id
stringlengths 3
8
| url
stringlengths 32
207
| title
stringlengths 1
114
| text
stringlengths 93
492k
|
|---|---|---|---|
44282067
|
https://en.wikipedia.org/wiki/Leighton%20Dye
|
Leighton Dye
|
Leighton William Charles Dye (October 30, 1901 – October 25, 1977) was an American hurdler. He placed fourth in the 110 m hurdles at the 1928 Summer Olympics and was United States champion in 1926.
Biography
Dye was born in St. Louis, Missouri on October 30, 1901. Representing coach Dean Cromwell's USC Trojans, Dye won the IC4A 120 yd (109.7 m) hurdles title as a junior in 1925, running 14.8; USC won that year's IC4A team title. Later that year he placed third at the national championships, behind Olympic finalist George Guthrie and NCAA champion Hugo Leistner. In 1926 Dye repeated as IC4A champion, this time in 14.7, and placed second to Guthrie at the NCAA championships; the Trojans again won the IC4A team title, and would have also won the NCAA title if one had been awarded that year. Dye then won at the national championships in 14.6, equalling both his personal best and Guthrie's meeting record from the previous year.
Dye again ran 14.6, this time for the metric 110 m hurdles, at the 1928 Southwestern Olympic Tryouts, qualifying for the final Olympic Trials; the time broke Earl Thomson's world record for the metric distance of 14.8, although it was still inferior to Thomson's 14.4 for the imperial hurdles and was never ratified as a world record. At the final Trials in Cambridge Dye placed third behind Steve Anderson and John Collier, qualifying for the Olympics.
At the Olympics in Amsterdam Dye won his heat in 15.0 and then his semi-final in 14.8, a time that equalled both the Olympic record and Thomson's still-official metric world record; however, South Africa's George Weightman-Smith ran 14.6 in a subsequent semi-final. In the final Dye placed fourth behind Sid Atkinson, Anderson and Collier, but defeated Weightman-Smith.
Dye later became a sales executive for the Goodyear Tire & Rubber Company. He died in Naples, Florida on October 25, 1977.
References
1901 births
1977 deaths
American male hurdlers
USC Trojans men's track and field athletes
Athletes (track and field) at the 1928 Summer Olympics
Olympic track and field athletes of the United States
Track and field athletes from St. Louis
|
59237149
|
https://en.wikipedia.org/wiki/Manchester%20Packet%20%28ship%29
|
Manchester Packet (ship)
|
At least two vessels in the early 19th century were known as the Manchester packet or Manchester Packet:
was originally built at Falmouth and served the Post Office Packet Service. Hence, she was generally referred to as a packet ship, and often as a Falmouth packet or as Manchester Packet. In 1813 an American privateer captured her after a single-ship action, but the British Royal Navy recaptured her quickly. She returned to the packet trade until 1831 when she became a whaler, making one whaling voyage to the Seychelles. From 1835 she was a merchantman, trading between London and Mauritius. She was last listed in 1841.
was built at New York. She immediately transferred to British registry and spent a number of years trading across the Atlantic. She in 1814 successfully repelled an attack by a U.S. privateer. In 1818 she returned to U.S. registry. She eventually became a whaler operating out of New London, Connecticut. In May 1828 she made the first of five whaling voyages; she was condemned in 1835 while on her sixth voyage.
Ship names
|
8784464
|
https://en.wikipedia.org/wiki/Object-capability%20model
|
Object-capability model
|
The object-capability model is a computer security model. A capability describes a transferable right to perform one (or more) operations on a given object. It can be obtained by the following combination:
An unforgeable reference (in the sense of object references or protected pointers) that can be sent in messages.
A message that specifies the operation to be performed.
The security model relies on not being able to forge references.
Objects can interact only by sending messages on references.
A reference can be obtained by:
Initial conditions: In the initial state of the computational world being described, object A may already have a reference to object B.
Parenthood: If A creates B, at that moment A obtains the only reference to the newly created B.
Endowment: If A creates B, B is born with that subset of A's references with which A chose to endow it.
Introduction: If A has references to both B and C, A can send to B a message containing a reference to C. B can retain that reference for subsequent use.
In the object-capability model, all computation is performed following the above rules.
Advantages that motivate object-oriented programming, such as encapsulation or information hiding, modularity, and separation of concerns, correspond to security goals such as least privilege and privilege separation in capability-based programming.
The object-capability model was first proposed by Jack Dennis and Earl C. Van Horn in 1966.
Loopholes in object-oriented programming languages
Some object-based programming languages (e.g. JavaScript, Java, and C#) provide ways to access resources in other ways than according to the rules above including the following:
Direct assignment to the instance variables of an object in Java and C#.
Direct reflective inspection of the meta-data of an object in Java and C#.
The pervasive ability to import primitive modules, e.g. java.io.File that enable external effects.
Such use of undeniable authority violates the conditions of the object-capability model. Caja and Joe-E are variants of JavaScript and Java, respectively, that impose restrictions to eliminate these loopholes.
Advantages of object capabilities
Computer scientist E. Dean Tribble stated that in smart contracts, identity-based access control did not support well dynamically changing permissions, compared to the object-capability model. He analogized the ocap model with giving a valet the key to one's car, without handing over the right to car ownership.
The structural properties of object capability systems favor modularity in code design and ensure reliable encapsulation in code implementation.
These structural properties facilitate the analysis of some security properties of an object-capability program or operating system. Some of these in particular, information flow properties can be analyzed at the level of object references and connectivity, independent of any knowledge or analysis of the code that determines the behavior of the objects. As a consequence, these security properties can be established and maintained in the presence of new objects that contain unknown and possibly malicious code.
These structural properties stem from the two rules governing access to existing objects:
1) An object A can send a message to B only if object A holds a reference to B.
2) An object A can obtain a reference to C only if object A receives a message containing a reference to C.
As a consequence of these two rules, an object can obtain a reference to another object only through a preexisting chain of references. In short, "Only connectivity begets connectivity."
Glossary of related terms
object-capability system
A computational system that implements principles described in this article.
object
An object has local state and behavior. An object in this sense is both a subject and an object in the sense used in the access control literature.
reference
An unforgeable communications channel (protected pointer, opaque address) that unambiguously designates a single object, and provides permission to send messages to that object.
message
What is sent on a reference. Depending on the system, messages may or may not themselves be first-class objects.
request
An operation in which a message is sent on a reference. When the message is received, the receiver will have access to any references included in the message.
attenuation
A common design pattern in object-capability systems: given one reference of an object, create another reference for a proxy object with certain security restrictions, such as only permitting read-only access or allowing revocation. The proxy object performs security checks on messages that it receives and passes on any that are allowed. Deep attenuation refers to the case where the same attenuation is applied transitively to any objects obtained via the original attenuated object, typically by use of a "membrane".
Implementations
Almost all historical systems that have been described as "capability systems" can be modeled as object-capability systems. (Note, however, that some uses of the term "capability" are not consistent with the model, such as POSIX "capabilities".)
KeyKOS, EROS, Integrity (operating system), CapROS, Coyotos, seL4, OKL4 and Fiasco.OC are secure operating systems that implement the object-capability model.
Languages that implement object capabilities
Act 1 (1981)
Eden (1985),
Emerald (1987),
Trusty Scheme (1992),
W7 (1995),
Joule (1996),
Original-E (1997),
Oz-E (2005),
Joe-E (2005),
CaPerl (2006),
Emily (2006)
Caja (2007–2021)
Monte (2008–present)
Pony (2014–present)
Wyvern (2012–present)
Newspeak (2007–present)
Hacklang (2021-present)
Rholang (2018-present)
See also
Capability-based security
Capability-based addressing
Actor model
References
Computer security models
|
54835522
|
https://en.wikipedia.org/wiki/Absolute%20Drift
|
Absolute Drift
|
Absolute Drift is a racing game developed and published by Funselektor Labs. It was released on 29 July 2015 on Windows, OS X and Linux. It was also released on 29 August 2016 and 25 August 2017 on the PlayStation 4 and Xbox One respectively as Absolute Drift: Zen Edition. Physical media copies on disc were released for the PlayStation 4 platform through Limited Run Games on 13 October 2017, and was limited to 4,000 printed copies. A Nintendo Switch version was released on 3 December 2020.
Gameplay
Absolute Drift features 5 free roam areas and 34 tracks. In the free roam areas, there are various objectives for the player to complete which unlock more levels and cars. The tracks also have objectives to complete, including gaining points in a drift-based scoring system.
Platforms
Absolute Drift: Zen Edition has been released on the PlayStation 4 which went on sale on 15 November in the United States. It was also released on the Xbox One which was also released in November. Absolute Drift began on Windows, OS X and Linux on 29 August 2016 which is a month before the Zen Edition release. It was then made available on iOS and Android in 2018. A Nintendo Switch version was released on 3 December 2020.
Reception
On Windows, Absolute Drift received mixed or average reviews from critics on Metacritic, while Absolute Drift: Zen Edition received generally favorable reviews on the PlayStation 4. GameSpew reviewed the game on PlayStation 4 and gave the game a 5 out of 10.
References
External links
2015 video games
Android (operating system) games
Indie video games
IOS games
Linux games
MacOS games
PlayStation 4 games
Nintendo Switch games
Racing video games
Steam Greenlight games
Video games developed in Canada
Video games set in Japan
Windows games
Xbox One games
|
44907137
|
https://en.wikipedia.org/wiki/JuJu%20Smith-Schuster
|
JuJu Smith-Schuster
|
John Sherman "JuJu" Smith-Schuster (born November 22, 1996) is an American football wide receiver for the Pittsburgh Steelers of the National Football League (NFL). He played college football at USC, and was drafted by the Steelers in the second round of the 2017 NFL Draft.
Smith-Schuster is the holder of several NFL records, including being the youngest player to reach 2,500 career receiving yards and the first player to have two offensive touchdowns of at least 97 yards. He also holds several Steelers franchise records. Off-the-field, he is also known for his social media presence and affinity for esports. In 2019, Smith-Schuster was ranked as one of the NFL's most marketable players.
Early years
Smith-Schuster began playing football at the age of eight. He changed his name in football program listings in 2012 from "John" to "JuJu," a nickname an aunt gave him when he was young, and legally changed his last name from "Smith" to "Smith-Schuster" while in college as a tribute to his step-father. In his youth, Smith-Schuster was coached by Snoop Dogg when he played youth football with the Snoop Youth Football League, where Snoop gave Smith-Schuster the nickname "Sportscenter," telling the boy that he believed one day his highlights would be shown on the flagship ESPN show.
He later attended Long Beach Polytechnic High School in Long Beach, California, the high school that at that time had the record for sending the most football players to careers in the NFL out of any in the United States. He played wide receiver and safety for the school's Jackrabbits football team. Smith-Schuster was rated by Rivals.com as a five-star recruit and was ranked as the second-best wide receiver in his class and the 24th-best player overall. He initially decided to attend Oregon, but then announced he would attend the University of Southern California (USC) to play college football under then-head coach Steve Sarkisian during his televised commitment.
College career
Smith-Schuster earned immediate playing time as a true freshman in 2014. In his first career game, he had four receptions for 123 yards against Fresno State. Against the Washington State Cougars, he had six receptions for 74 yards and three touchdowns. He finished the 2014 season with 54 receptions for 724 yards and five touchdowns. As a sophomore in 2015, Smith-Schuster played 14 games with a career-high 1,454 receiving yards and 10 touchdowns.
As a junior in 2016 the Trojans used Smith-Schuster less. He played in 13 games with 914 receiving yards and 10 touchdowns. That year he also helped the Trojans to a victory in the Rose Bowl over the Penn State Nittany Lions, catching seven passes for 133 yards and a receiving touchdown over the course of the game. After the 2016 season, Smith-Schuster announced on Twitter that he had decided to forego his senior year and enter the 2017 NFL Draft, before signing with sports agency Roc Nation. Fellow USC alum Lynn Swann said of Smith-Schuster's pro-potential based upon his college career, "He's got the size. He's got the strength. He's got the attitude … In Juju, you've got a guy who's got the kind of versatility you might be looking for." Though he left before graduation, Smith-Schuster later returned to take summer courses at USC in order to work towards finishing his university degree.
College statistics
Professional career
Smith-Schuster received an invitation to the NFL Combine and performed nearly all of the combine drills and positional drills except for the three-cone drill and short shuttle. He opted to attend USC's Pro Day and performed the short shuttle and three-cone drill. In addition, he performed the vertical and broad jump and improved his combine number on both. The Dallas Cowboys were the only team to hold a private workout with Smith-Schuster and showed heavy interest in him. He was ranked as the fourth best wide receiver in the draft by Sports Illustrated and ESPN, and ninth by NFLDraftScout.com and draft analyst Mel Kiper Jr.
The Pittsburgh Steelers selected Smith-Schuster in the second round (62nd overall) of the 2017 NFL Draft. He was the youngest player selected in the 2017 Draft and was the 13th USC wide receiver drafted in the last 15 years.
2017 season
On May 17, 2017, the Steelers signed him to a four-year, $4.19 million contract with $1.84 million guaranteed and a signing bonus of $1.19 million.
Smith-Schuster entered training camp competing with Sammie Coates, Darrius Heyward-Bey, Eli Rogers, Marcus Tucker, and Justin Hunter to be the Steelers' third option at wide receiver on their depth chart. He was named the sixth wide receiver on the Steelers' depth chart to begin the regular season behind Antonio Brown, Martavis Bryant, Heyward-Bey, Rogers, and Hunter.
Smith-Schuster made his NFL debut in the Steelers' season-opening victory over the Cleveland Browns and was credited with his first career start as a kick returner, returning one kick for four yards. When Smith-Schuster made his debut, he was the youngest player in the NFL. In Week 2, Smith-Schuster recorded his first career reception and caught his first career touchdown on a four-yard pass from quarterback Ben Roethlisberger, as the Steelers defeated the Minnesota Vikings by a score of 26–9. During the Vikings game, Smith-Schuster became the youngest NFL player to score a touchdown since running back Andy Livingston in 1964. He also became the second-youngest player in NFL history to catch a touchdown behind Arnie Herber, who was 60 days younger than Smith-Schuster when he caught a touchdown in 1930.
During Week 7 against the Cincinnati Bengals, Smith-Schuster caught his third touchdown pass of the season, a 31-yard reception, becoming the first player in NFL history to score three touchdowns before the age of 21. On October 29, Smith-Schuster made his first career start at wide receiver and had a breakout performance with a season-high seven receptions for 193 receiving yards and scored a 97-yard touchdown during a 20–15 victory against the Detroit Lions. The 97-yard touchdown reception was also the longest pass play in team history and the longest touchdown reception in the league during the 2017 season. Smith-Schuster started at wide receiver in place of Martavis Bryant, who was benched by head coach Mike Tomlin after publicly asking for a trade. His 193 yards was second only to Jimmy Orr's 205 in 1958 for the most receiving yards by a Steelers rookie and the most by any NFL rookie since Mike Evans' 209 in Week 11 of 2014. He was named AFC Offensive Player of the Week for his Week 8 performance.
On December 5, Smith-Schuster was suspended for one game after delivering a blindsided block to Cincinnati Bengals' linebacker Vontaze Burfict in Week 13. In Week 17, he had a 96-yard kick return for a touchdown and also caught nine passes for 143 yards and a touchdown during a 28–24 victory over the Cleveland Browns. With this performance, Smith-Schuster became the youngest player in NFL history to have over 1,000 all-purpose yards. He was also named AFC Special Teams Player of the Week for his kick return touchdown. He finished the season with 58 receptions for 917 yards and seven touchdowns, with the latter two statistics leading all rookies. He was named the Polynesian Pro Football Player of the Year for 2017.
The Steelers finished first in the AFC North with a 13–3 record and earned a first-round bye. On January 14, 2018, Smith-Schuster started in his first playoff game and made three receptions for five yards and a late touchdown in a narrow 45–42 loss to the Jacksonville Jaguars in the Divisional Round.
2018 season
On January 18, 2018, the Pittsburgh Steelers promoted quarterback's coach Randy Fichtner to offensive coordinator after they opted not to renew former offensive coordinator Todd Haley's contract. Smith-Schuster entered training camp slated as a starting wide receiver after the Steelers traded Martavis Bryant to the Oakland Raiders for a third-round pick in the 2018 NFL Draft. Tomlin named Smith-Schuster a starting wide receiver to begin the regular season, alongside Antonio Brown.
Smith-Schuster started his second NFL season strong with nine receptions for 116 receiving yards in a 21–21 tie against the Cleveland Browns. He followed that performance up with a career-high 13 receptions for 121 receiving yards and a touchdown in a 42–37 loss to the Kansas City Chiefs. In Week 3, against the Tampa Bay Buccaneers, he recorded nine receptions for 116 yards in the 30–27 victory. Smith-Schuster broke another NFL record on November 25, against the Denver Broncos when he became to the first player ever to have two offensive touchdowns of at least 97 yards. The touchdown was part of a 13-reception, 189-yard performance in the loss. In Week 14 against the Oakland Raiders, Smith-Schuster caught 8 passes for 130 yards and 2 touchdowns in a 24–21 loss. During Week 16 against the New Orleans Saints, Smith-Schuster finished with 115 receiving yards as the Steelers lost 28–31; however, as the Steelers were progressing down the field into scoring position, Smith-Schuster committed a game-ending fumble. This would ultimately be one of the causes of the Steelers missing the playoffs that season, as wins by the Baltimore Ravens and Indianapolis Colts the following week officially eliminated them.
Smith-Schuster was voted team MVP by his teammates for the 2018 season, finishing the season with a team-high 111 receptions and 1,426 yards. He also had seven touchdowns on the season, finishing second on the team only to Antonio Brown's 15 touchdown catches. Smith-Schuster made his first career Pro Bowl in 2018 as an alternate, after Brown announced that he would not participate in the game because of an injury. He received an overall grade of 81.8 from Pro Football Focus in 2018, which ranked as the 16th highest grade among all qualifying wide receivers.
2019 season
Prior to the start of the season, the Steelers traded Antonio Brown to the Oakland Raiders making Smith-Schuster the team's number one wide receiver. In Week 1 against the New England Patriots, Smith-Schuster caught six passes for 78 yards in the 33–3 loss. In Week 2 against the Seattle Seahawks, Smith-Schuster caught five passes for 84 yards as the Steelers lost 28–26.
In the game, Smith-Schuster passed Randy Moss as the youngest wide receiver to reach 2500 receiving yards (22 years, 297 days). In Week 3 against the San Francisco 49ers, Smith-Schuster caught three passes for 81 yards and a 76-yard touchdown pass as the Steelers lost 24–20. Smith-Schuster caught seven passes for 75 yards and a touchdown in Week 5 against the Baltimore Ravens. However, after the game went into overtime, he fumbled after catching a pass as Ravens cornerback Marlon Humphrey punched the ball out of Smith-Schuster's arms. The fumble was costly as it allowed Baltimore to kick the game-winning field goal, sending the Steelers to a 26–23 overtime loss.
In Week 8 against the Miami Dolphins, Smith-Schuster caught five passes for 103 yards and a touchdown in the 27–14 win. This was Smith-Schuster's first 100-yard receiving game of the season. In Week 11 against the Cleveland Browns, Smith-Schuster was knocked out after cornerback Greedy Williams delivered a helmet-to-helmet hit on him. Prior to the injury, Smith-Schuster caught two passes for 21 yards in the 21–7 loss. He missed all but the last two games of the season as he also suffered a knee injury from the Cleveland game. Smith-Schuster finished the 2019 season with a career-low 552 yards and three touchdowns on 42 catches.
2020 season
Smith-Schuster started the 2020 season off strong with six receptions for 69 receiving yards and two receiving touchdowns in the 26–16 victory over the New York Giants.
In Week 9 against the Dallas Cowboys at AT&T Stadium, Smith-Schuster recorded six catches for 93 yards and a touchdown during the 24–19 win. After Smith-Schuster caught the aforementioned touchdown, he attempted to celebrate on the star at midfield, but was stopped by various Cowboys defenders.
In Week 16 against the Indianapolis Colts, Smith-Schuster recorded 9 catches for 96 yards, including the 25 yard game winning touchdown, during the 28–24 win.
Smith-Schuster was the subject of controversy after dancing on several other opponents' midfield logos for his TikTok followers prior to away games, including the Buffalo Bills and Cincinnati Bengals. Both teams took offense to Smith-Schuster's pre-game antics and used it as incentive to beat the Steelers, with Bengals safety Vonn Bell landing a vicious hit on Smith-Schuster and forcing a fumble during the Bengals' 27–17 victory in Week 15.
Overall, Smith-Schuster rebounded in his contract year with the Steelers, catching 97 passes for 831 yards and a career-high nine touchdowns operating mainly out of the slot.
Smith-Schuster was also involved in a controversy in a pre-game conference against the Browns. Before the game, Smith-Schuster noted that "the Browns is the Browns," and called them "nameless gray faces." In the Wild Card Round of the playoffs against the Browns, Smith-Schuster recorded 13 catches for 157 yards and a touchdown during the 48–37 loss.
2021 season
On March 19, 2021, Smith-Schuster re-signed with the Steelers on a one-year, $8 million contract.
In August 2021, two weeks before the Steelers matchup against the Buffalo Bills in Week 1, he was the subject of controversy after being filmed attempting the viral milk crate challenge, a challenge in which participants climb up and down a stack of milk crates. TikTok banned the challenge due to safety concerns such as serious injuries.
In Week 5, Smith-Schuster suffered a season-ending shoulder injury during a win over the Denver Broncos and was placed on injured reserve on October 16. Three months later, days before the Steelers' Wild Card Round game against the Chiefs, a 21-day window for him was opened, and he was activated on January 15 for that matchup.
In the Wild Card Round of the playoffs, Smith-Schuster recorded five receptions for 26 yards, in the 42-21 loss against the Kansas City Chiefs.
NFL career statistics
NFL records
First player in NFL history to score five touchdowns before his 21st birthday
Youngest player to record at least 150 receiving yards in a single game
First player to have two offensive touchdowns of at least 97 yards
Youngest receiver with 1,500 receiving yards
Youngest receiver with 2,500 receiving yards
Steelers franchise records
Longest touchdown reception in franchise history (97 yards)
Youngest receiver to record over 1,000 receiving yards in a season (2018)
Fewest games needed to reach 1,500 career receiving yards (21)
Personal life
Smith-Schuster is of African American and Samoan descent and was raised in Long Beach, California. He is the second-eldest of seven children and identifies as a Christian. His cousin, Johnny Nansen, was formerly an assistant coach at USC. Smith-Schuster's nickname "JuJu" came from his aunt when he was a few months old. She initially called him "John-John" before opting to call him "JuJu" instead. He has one biological sister named So'omalo and their father was not active in their lives. His stepfather, Lawrence Schuster, was introduced to his mother, Sammy (Toa) when Smith-Schuster was four years old. Smith-Schuster legally hyphenated his last name after he turned 18, adding Schuster in honor of his stepfather. Smith-Schuster states he grew up a fan of USC and looked up to wide receivers Marqise Lee, Robert Woods, and Nelson Agholor.
Digital media
Smith-Schuster has built a widely-viewed presence on many social media, including TikTok, YouTube, Twitter, and Twitch.
Smith-Schuster has used Twitch to stream himself playing games including Fortnite and Call of Duty: WWII. In 2018 he participated in Ninja's record-breaking Fortnite stream including Drake and Travis Scott. While injured during the 2019 season, Smith-Schuster participated in a live Thursday Night Football stream with TimTheTatman, for which he was paid $100,000.
In February 2018, Smith-Schuster announced a partnership with the popular gaming group FaZe Clan to sell merchandise. He now has a YouTube channel using his full name that posts Call of Duty, Fortnite Battle Royale, and daily life videos that often feature his French bulldog Boujee.
In October 2020, Smith-Schuster announced that he would own a new esports team called Team Diverge. The team intends to include content from other athletes and musicians and would establish its own gaming house after the 2020 NFL season ends.
References
External links
Official YouTube Channel
Pittsburgh Steelers bio
USC Trojans bio
1996 births
Living people
American sportspeople of Samoan descent
American Christians
Players of American football from Long Beach, California
African-American players of American football
American football wide receivers
USC Trojans football players
Pittsburgh Steelers players
American Conference Pro Bowl players
American YouTubers
Twitch (service) streamers
21st-century African-American sportspeople
|
9868825
|
https://en.wikipedia.org/wiki/Jonathan%20James
|
Jonathan James
|
Jonathan Joseph James (December 12, 1983 – May 18, 2008) was an American hacker (a gray hat ethical hacker) who was the first juvenile incarcerated for cybercrime in the United States. The South Florida native was 15 years old at the time of the first offense and 16 years old on the date of his sentencing. He died at his Pinecrest, Florida home on May 18, 2008, of a self-inflicted gunshot wound.
Initial Department of Defense intrusion
Between August 23, 1999, and October 27, 1999, James committed a series of intrusions into various systems, including those of BellSouth and the Miami-Dade school system. What brought him to the attention of federal authorities, however, was his intrusion into the computers of the Defense Threat Reduction Agency (DTRA), a division of the United States Department of Defense, the primary function of which is to analyze potential threats to the United States of America, both at home and abroad. James later admitted to authorities that he had installed an unauthorized backdoor in a computer server in Dulles, Virginia, which he used to install a sniffer that allowed him to intercept over three thousand messages passing to and from DTRA employees, along with numerous usernames and passwords of other DTRA employees, including at least 10 on official military computers.
It was later revealed that the precise software obtained was the International Space Station's source code controlling critical life-sustaining elements. According to NASA, "the software supported the International Space Station's physical environment, including control of the temperature and humidity within the living space."
Arrest, conviction and sentencing
James's house was raided on January 26, 2000, by agents from the Department of Defense, NASA and the Pinecrest Police Dept. James was formally indicted six months later. On September 21, 2000, he entered into an agreement with U.S. Attorney Guy Lewis: he would plead guilty to two counts of juvenile delinquency in exchange for a lenient sentence.
James was sentenced to seven months' house arrest and probation until the age of eighteen, and was required to write letters of apology to NASA and the Department of Defense. He was also banned from using computers for recreational purposes. James later violated that probation when he tested positive for drug use and was then subsequently taken into custody by the United States Marshals Service and flown to an Alabama federal correctional facility where he ultimately served six months.
Legal experts have suggested that, given the extent of his intrusions, he could have served at least ten years for his crimes if he had been an adult.
Both Attorney General Janet Reno and prosecuting attorney Guy Lewis issued statements claiming the James case was proof the Justice Department was willing to get tough with juvenile offenders accused of cybercrime.
Death
On January 17, 2008
, department store chain TJX was the victim of a massive computer systems intrusion that compromised the personal and credit information of millions of customers. The same ring of hackers also committed intrusions on BJ's Wholesale Club, Boston Market, Barnes & Noble, Sports Authority, Forever 21, DSW, OfficeMax, and Dave & Buster's, and reportedly made a millionaire out of the group's ringleader, Albert Gonzalez. Though he denied having done anything, James—who was friends with some of the hackers involved—was investigated by the Secret Service, who raided James', his brother's, and his girlfriend's houses. Although they apparently discovered no connection to the intrusion, they did discover a legally registered firearm, which they did not take, and notes indicating he had considered killing himself; James' father would later say that his son had been prone to depression. The criminal complaint filed against the TJX hackers mention an additional, unnamed conspirator who was not indicted, who is identified only by the initials "J.J.". In 2004, this co-conspirator assisted one of the hackers in stealing credit card numbers, account numbers, and encrypted PINs from an OfficeMax store via Wi-Fi. These numbers were later allegedly provided to Albert Gonzalez, for whom "J.J." also opened a mail drop. James's father believes "J.J." to have been his son. However, it is plausible that the initials "J.J." may in fact have been referring to "Jim Jones", a (hacker) alias believed to be used by Stephen Watt who was a close friend of computer hacker and criminal Albert Gonzalez.
On May 18, 2008, Jonathan James was found dead in his shower with a self-inflicted gunshot wound to the head. His suicide was allegedly motivated by the belief that he would be prosecuted for crimes he had not committed. "I honestly, honestly had nothing to do with TJX," James wrote in his suicide note, "I have no faith in the 'justice' system. Perhaps my actions today, and this letter, will send a stronger message to the public. Either way, I have lost control over this situation, and this is my only way to regain control."
References
External links
Anonymous interview with Jonathan James for Frontline, on PBS.org
Document detailing the Indictment
1983 births
2008 suicides
Suicides by firearm in Florida
American computer criminals
People from Miami
Hacking (computer security)
People convicted of cybercrime
American prisoners and detainees
Prisoners and detainees of the United States federal government
|
4991565
|
https://en.wikipedia.org/wiki/Thamesford%20Trojans
|
Thamesford Trojans
|
The Thamesford Trojans are a Junior ice hockey team based in Thamesford, Ontario, Canada. They play in the Provincial Junior Hockey League of the Ontario Hockey Association.
History
The Thamesford Trojans were founded in 1976 as members of the Western Ontario Junior D Hockey League. In 1988, the league absorbed its competitor leagues and create a large "super league" that was renamed the OHA Junior Development League in 1991.
The Trojans from the 1989–90 until the 1991–92 season won three straight OHA Cups, the provincial championship.
In 1990, the Trojans fought all the way to the league finals. In the finals they met the Lucan Irish. After a hard-fought battle, the Trojans came out on top to win the series 4-games-to-2 and win their first ever OHA Cup.
The 1991 playoffs saw them reach the OHAJDL finals as well. Their opponents again were the Lucan Irish. The Trojans improved on the 1990 finals by defeating the Irish 4-games-to-1 to win their second straight OHA Cup.
The 1992 playoffs again saw the Trojans reach the championship series of the OHAJDL, which was once again against the Lucan Irish. This time the Trojans completely dominated and swept the series 4-games-to-none to win a third straight OHA Cup. The victory marked the first time since the award was first presented in 1948 that a team had won it three consecutive years.
In 1993, they made the OHAJDL finals once again, but ran into a team other than Lucan. The Mitchell Hawks had won the other conference and were challenging for the OHA Cup for the first time since 1973. The Hawks were not to be denied as they won the series 4-games-to-1 and broke the Trojan dynasty.
The Trojans finished the 1994–95 season in first place with 34 wins and only 2 losses on the entire season. They pushed through to the OHAJDL finals and met the Port Stanley Lakers. The Trojans defeated the Lakers 4-games-to-2 to clinch their fourth OHA Cup.
In 2003, the Trojans finished tenth overall in the OHAJDL. In the playoffs, the Trojans baffled their competitors and made it all the way to the OHA Cup final. Their opponent, another team that was unexpected, the eighth-seeded Wellesley Applejacks, were standing between the Trojans and a fifth OHA Cup. The Trojans could not be stopped as they swept the Applejacks 4-games-to-none to win another league title.
After a strong winning season, the Trojans started out the 2006 playoffs against the Mount Brydges Bulldogs. The Bulldogs fell to the Trojans 4-games-to-1. In the second round of the playoffs, the Trojans drew the West Lorne Lakers, whom they swept 4-games-to-none. In the conference final, the Trojans found themselves up against a Cinderella-story Lucan Irish. The Irish upset the Trojans 4-games-to-1 to bounce them from the playoffs and went on to win the OHA Cup.
In 2006, the OHAJDL was disbanded and replaced with the Southern Ontario Junior Hockey League. Again in 2007, the Trojans finished off the season with an excellent record. In the first round of the playoffs, the Trojans drew the Lucan Irish and were able to exact revenge for the 2006 upset by defeating them 4-games-to-1. In the second round, the Trojans were pitted against the North Middlesex Stars. The Trojans beat the Stars 4-games-to-1 as well. In the conference final, Thamesford ran into the eventual league champion for the second consecutive year as they fell to the Mitchell Hawks 4-games-to-2.
Season-by-Season Standings
Playoffs
1990 Won League
Thamesford Trojans defeated Lucan Irish 4-games-to-2 in final
1991 Won League
Thamesford Trojans defeated Lucan Irish 4-games-to-1 in final
1992 Won League
Thamesford Trojans defeated Lucan Irish 4-games-to-none in final
1993 Lost final
Mitchell Hawks defeated Thamesford Trojans 4-games-to-1 in final
1995 Won League
Thamesford Trojans defeated Port Stanley Lakers 4-games-to-2 in final
2003 Won League
Thamesford Trojans defeated Wellesley Applejacks 4-games-to-none in final
2006 Lost conference final
Thamesford Trojans defeated Mount Brydges Bulldogs 4-games-to-1 in conf. quarter-final
Thamesford Trojans defeated West Lorne Lakers 4-games-to-none in conf. semi-final
Lucan Irish defeated Thamesford Trojans 4-games-to-1 in conf. final
2007 Lost conference final
Thamesford Trojans defeated Lucan Irish 4-games-to-1 in conf. quarter-final
Thamesford Trojans defeated North Middlesex Stars 4-games-to-1 in conf. semi-final
Mitchell Hawks defeated Thamesford Trojans 4-games-to-2 in conf. final
2008 Won League
Thamesford Trojans defeated Lucan Irish 4-games-to-3 in conf. quarter-final
Thamesford Trojans defeated North Middlesex Stars 4-games-to-3 in conf. semi-final
Thamesford Trojans defeated Mount Brydges Bulldogs 4-games-to-0 in conf. final
Thamesford Trojans defeated Tavistock Braves 4-games-to-0 in final
2009 Lost round robin
Thamesford Trojans defeated Wellesley Applejacks 4-games-to-0 in conf. semi-final
Thamesford Trojans defeated Tavistock Braves 4-games-to-1 in conf. final
Thamesford Trojans defeated by North Middlesex Stars and Delhi Travellers in semi-final round robin
2010 Won League, won OHA Cup
Thamesford Trojans defeated Port Stanley Sailors 4-games-to-3 in conf. semi-final
Thamesford Trojans defeated Tavistock Braves 4-games-to-3 in conf. final
Thamesford Trojans and Exeter Hawks defeated Delhi Travellers in semi-final round robin
Thamesford Trojans defeated Exeter Hawks 4-games-to-3 in final
2011 Won league, won OHA Cup
Thamesford Trojans received first-round bye.
Thamesford Trojans defeated Lambeth Lancers 4-games-to-0 in conf. semifinal.
Thamesford Trojans defeated North Middlesex Stars 4-games-to-1 in conf. final.
Thamesford Trojans defeated Ayr Centennials 4-games-to-1 in OHA Cup final.
2012 Won league, won OHA Cup
Thamesford Trojans received first-round bye.
Thamesford Trojans defeated Mount Brydges Bulldogs 4-games-to-3 in conf. semifinal.
Thamesford Trojans defeated Lambeth Lancers 4-games-to-0 in conf. final.
Thamesford Trojans defeated Exeter Hawks 4-games-to-0 in OHA Cup final.
2013 Lost semifinals
Thamesford Trojans defeated Exeter Hawks 4-games-to-0 in quarter-finals.
Lambeth Lancers defeated Thamesford Trojans 4-games-to-0 in semifinals.
2014 Lost semifinals
Thamesford Trojans defeated Exeter Hawks "4-games-to-2 in quarter-finals
Dorchester Dolphins defeated Thamesford Trojans 4-games-to-0'' in semifinals
Notable alumni
Steve Rucchin
External links
Thamesford Trojans' Homepage
Southern Ontario Junior Hockey League teams
|
9905630
|
https://en.wikipedia.org/wiki/Wubi%20%28software%29
|
Wubi (software)
|
Wubi ("Windows-based Ubuntu Installer") is a free software Ubuntu installer, that was the official Windows-based software, from 2008 until 2013, to install Ubuntu from within Windows, to a single file within an existing Windows partition.
After installation, it added a new "Ubuntu" option to the existing Windows boot menu which allowed the user to choose between running Linux or Windows, and avoided the need to re-partition the disk.
History
Wubi was born as an independent project and as such versions 7.04 and 7.10 were unofficial releases.
For Ubuntu 8.04 the code was merged into Ubuntu and for 8.04 alpha 5, Wubi was also on the Ubuntu Live CD.
The project's aim was to enable existing Windows users, unacquainted with Linux, to try Ubuntu without risking any data loss (due to disk formatting or partitioning mistakes). It could also safely uninstall Ubuntu from within Windows.
It is not a virtual machine, but creates a stand-alone installation within a loopmounted device, also known as a disk image, like Topologilinux does. It is not a Linux distribution of its own, but rather an installer for Ubuntu.
While Wubi does not install Ubuntu directly to its own partition this can also be accomplished by using LVPM, the Loopmounted Virtual Partition Manager, to transfer the Wubi-generated Ubuntu installation to a dedicated real partition, including a bootable USB keydrive. The advantage of this setup is that users can test the operating system and install the drivers before they install it to a dedicated partition (and avoid booting and functioning risks).
Wubi adds an entry to the Windows boot menu which allows the user to run Linux. Ubuntu is installed within a file in the Windows file system (c:\ubuntu\disks\root.disk), as opposed to being installed within its own partition. This file is seen by Linux as a real hard disk. Wubi also creates a swap file in the Windows file system (c:\ubuntu\disks\swap.disk), in addition to the memory of the host machine. This file is seen by Ubuntu as additional RAM.
A related project, Lubi, used Linux as the host system instead of Windows. However, this project has not been worked on since 2007 and only works on Ubuntu 7.04.
Wubi was removed as an installation option in the official download page from Ubuntu 13.04 onward. However, Wubi for versions after Ubuntu 13.04 are still provided.
An unofficial fork of Wubi, called wubiuefi, supports UEFI and legacy BIOS. Newer versions of Ubuntu (as of 2017-10-30, version 16.04.3, 17.10 and 20.04.3).
Desktops
Users can select the desktop environment within Wubi. But, because each desktop environment is also available as an application package, it is recommended that users install Ubuntu (default option) and from there install the other desktop environments. When users log in, they can choose the desktop environment to use.
Limitations
Compared with a regular installation, a Wubi installation faces some limitations. Hibernation is not supported and the filesystem is more vulnerable to hard reboots. Also, if the Windows drive is unmounted uncleanly (Windows crash, power failure, etc.), Ubuntu will not be able to repair, re-mount, and boot from the Windows NTFS drive until Microsoft Windows has successfully booted, repaired the drive, and then shut down cleanly. If the Windows system could not be booted after the corruption to repair the filesystem, the user would also not be able to boot Ubuntu.
Performance related to hard-disk access is also slightly slower on a Wubi install, more so if the underlying disk image file is fragmented, as the disk image file in the Windows filesystem contains a Linux filesystem whereas without Wubi only the Linux filesystem is used that has direct hardware access.
Wubi creates the root.disk file using Microsoft's proprietary NTFS file system while running under the MS Windows OS and then while the Ubuntu OS is running it accesses that file using an alternative file system driver. The differences between the Microsoft and Linux implementations of NTFS could technically result in corruption of the root.disk file that affects the NTFS filesystem in such a way that it could even prevent Windows from booting. Running chkdsk /r from MS Windows to fix the damaged NTFS file system and then shutting down Windows cleanly may fix any corruptions (this may take a significant amount of time to run as root.disk is a large file).
Influences
Wubi relies on other open source projects: Debian installer, Migration Assistant, Grub4Dos, NTFS-3G, NSIS, Metalink and Ubiquity.
Development
The lead developers are Agostino Russo, Geza Kovacs, Oliver Mattos and Ecology2007. The main development occurs at Launchpad and is led by the Lupin Team (Lupin is the loop-installer, handles everything that happens after reboot) through the original Ubuntu blueprint page and the new Wubi, Lubi, Lupin, and LVPM project pages.
Hardware support
Both the i386 (32-bit x86) and x86-64 releases of Ubuntu are supported by Wubi and Lubi. In versions before 8.04, only the x86 release of Ubuntu was supported. Wubi UEFI works with UEFI boot loaders.
Origins
A number of Linux distributions, including Red Hat Linux and Slackware's ZipSlack, provided a similar tool in the mid-1990s, using syslinux and the UMSDOS filesystem driver. Later, SuSE provided something similar using syslinux and loop-mounted disk images on FAT filesystems. During the late '90s BeOS used a similar system to install the OS in a folder in Windows.
The idea for Wubi was drafted by Agostino Russo taking inspiration from Topologilinux, which provided a loopmounted installation, and Instlux, that provided a simple Windows frontend. The idea was to merge the two concepts having a Windows installer that would loopmount an image of Ubuntu. Geza Kovacs later refined the specification and provided the first prototypes to show that the concept was sound. Oliver Mattos wrote the original user interface in NSIS.
Agostino Russo then refined the loop-installation concept, moving from a simple loopmounted pre-made image file to an image created on the fly using a dynamically patched version of the Debian installer, thus providing an experience which was closer to a real installation while addressing several other issues of the early prototypes. Lupin project was thus born and Agostino Russo wrote and implemented most of its code with some contributions from Geza Kovacs.
Agostino Russo and Ecology2007 later redesigned and rewrote the current Windows front-end. Hampus Wessman contributed the new downloader and the translation scripts. Bean123 and Tinybit also helped to debug and fix bootloader issues. Lubi and LVPM were subsequently created by Geza Kovacs.
The project has inspired the creation of other Windows-based Linux installers, such as Win32-loader.
See also
List of tools to create Live USB systems
Ubiquity the Ubuntu operating system installer
Cooperative Linux allows Linux to run within Windows (used by e.g. Topologilinux (Slackware-based) and andLinux)
Debian-Installer
Instlux, included on openSUSE since the 10.3 release
Win32-Loader a similar chain-booting mechanism to install Debian without a CD
UNetbootin a similar approach for a standard Linux installation (or for creating a Live USB) without a CD
References
External links
WubiGuide in the official Ubuntu wiki
Lubi/LVPM/UNetbootin project website
FLOSS Weekly 63: Wubi with Agostino Russo, the lead developer of Wubi
Wubiuefi a "fork of Wubi for UEFI support and for support of recent Ubuntu releases"
Free software programmed in C++
Free system software
Linux installation software
Ubuntu
Windows-only free software
|
50623
|
https://en.wikipedia.org/wiki/Chmod
|
Chmod
|
In Unix and Unix-like operating systems, is the command and system call used to change the access permissions of file system objects, (files and directories) sometimes known as modes. It is also used to change special mode flags such as setuid and setgid flags and a 'sticky' bit. The request is filtered by the umask. The name is an abbreviation of change mode. They are shown when listing files in long format.
History
A command first appeared in AT&T Unix version 1.
As systems grew in number and types of users, access-control lists were added to many file systems in addition to these most basic modes to increase flexibility.
The version of bundled in GNU coreutils was written by David MacKenzie and Jim Meyering. The command is available as a separate package for Microsoft Windows as part of the UnxUtils collection of native Win32 ports of common GNU Unix-like utilities. The command has also been ported to the IBM i operating system.
Command syntax
Throughout this section, ser refers to the owner of the file, as a reminder that the symbolic form of the command uses "u".
chmod [options] mode[,mode] file1 [file2 ...]
Usually implemented options include:
Recursive, i.e. include objects in subdirectories.
verbose, show objects changed (unchanged objects are not shown).
If a symbolic link is specified, the target object is affected. File modes directly associated with symbolic links themselves are typically not used.
To view the file mode, the or commands may be used:
$ ls -l findPhoneNumbers.sh
-rwxr-xr-- 1 dgerman staff 823 Dec 16 15:03 findPhoneNumbers.sh
$ stat -c %a findPhoneNumbers.sh
754
The , , and specify the read, write, and execute access (the first character of the display denotes the object type; a hyphen represents a plain file). The script can be read, written to, and executed by the user ; read and executed by members of the group; and only read by any other users.
The main parts of the permissions:
For example:
Each group of three characters define permissions for each class:
the three leftmost characters, , define permissions for the User class (i.e. the file owner).
the middle three characters, , define permissions for the Group class (i.e. the group owning the file)
the rightmost three characters, , define permissions for the Others class. In this example, users who are not the owner of the file and who are not members of the Group (and, thus, are in the Others class) have no permission to access the file.
Numerical permissions
The numerical format accepts up to four digits. The three rightmost digits define permissions for the file user, the group, and others. The optional leading digit, when 4 digits are given, specifies the special , , and flags. Each digit of the three rightmost digits represents a binary value, which controls the "read", "write" and "execute" permissions respectively. A value of 1 means a class is allowed that action, while a 0 means it is disallowed.
For example, would allow:
"read" (4), "write" (2), and "execute" (1) for the User class i.e. 7 (4+2+1).
"read" (4) and "execute" (1) for the Group class i.e. 5 (4+1).
Only "read" (4) for the Others class.
A numerical code permits execution if and only if it is odd (i.e. , , , or ).
A numerical code permits "read" if and only if it is greater than or equal to (i.e. , , , or ).
A numerical code permits "write" if and only if it is , , , or .
Numeric example
Change permissions to permit members of the group to update a file:
$ ls -l sharedFile
-rw-r--r-- 1 jsmith programmers 57 Jul 3 10:13 sharedFile
$ chmod 664 sharedFile
$ ls -l sharedFile
-rw-rw-r-- 1 jsmith programmers 57 Jul 3 10:13 sharedFile
Since the , and bits are not specified, this is equivalent to:
$ chmod 0664 sharedFile
Symbolic modes
The command also accepts a finer-grained symbolic notation, which allows modifying specific modes while leaving other modes untouched. The symbolic mode is composed of three components, which are combined to form a single string of text:
$ chmod [references][operator][modes] file ...
Classes of users are used to distinguish to whom the permissions apply. If no classes are specified "all" is implied. The classes are represented by one or more of the following letters:
The program uses an operator to specify how the modes of a file should be adjusted. The following operators are accepted:
The modes indicate which permissions are to be granted or removed from the specified classes. There are three basic modes which correspond to the basic permissions:
Multiple changes can be specified by separating multiple symbolic modes with commas (without spaces). If a user is not specified, chmod will check the umask and the effect will be as if "a" was specified except bits that are set in the umask are not affected.
Symbolic examples
Add write permission () to the Group's () access modes of a directory, allowing users in the same group to add files:
$ ls -ld shared_dir # show access modes before chmod
drwxr-xr-x 2 jsmitt northregion 96 Apr 8 12:53 shared_dir
$ chmod g+w shared_dir
$ ls -ld shared_dir # show access modes after chmod
drwxrwxr-x 2 nfinny eastregion 96 Apr 8 12:53 shared_dir
Remove write permissions () for all classes (), preventing anyone from writing to the file:
$ ls -l ourBestReferenceFile
-rw-rw-r-- 2 tmiller northregion 96 Apr 8 12:53 ourBestReferenceFile
$ chmod a-w ourBestReferenceFile
$ ls -l ourBestReferenceFile
-r--r--r-- 2 ebowman northregion 96 Apr 8 12:53 ourBestReferenceFile
Set the permissions for the ser and the Group () to read and execute () only (no write permission) on , preventing anyone to add files.
$ ls -ld referenceLib
drwxr----- 2 ebowman northregion 96 Apr 8 12:53 referenceLib
$ chmod ug=rx referenceLib
$ ls -ld referenceLib
dr-xr-x--- 2 dhinkle northregion 96 Apr 8 12:53 referenceLib
Add the read and write permissions to the user and group classes of a file or directory named :
$ chmod ug+rw sample
$ ls -ld sample
drw-rw---- 2 rsanchez budget 96 Dec 8 12:53 sample
Change the permissions for the user and the group to read and execute only (no write permission) on .
$ # Sample file permissions before command
$ ls -ld sample
drw-rw---- 2 oschultz warehousing 96 Dec 8 12:53 NY_DBs
$ chmod ug=rx sample
$ ls -ld sample
dr-xr-x--- 2 aolensky warehousing 96 Dec 8 12:53 NJ_DBs
Special modes
The command is also capable of changing the additional permissions or special modes of a file or directory. The symbolic modes use '' to represent the setuid and setgid modes, and '' to represent the sticky mode. The modes are only applied to the appropriate classes, regardless of whether or not other classes are specified.
Most operating systems support the specification of special modes using octal modes, but some do not. On these systems, only the symbolic modes can be used.
Command line examples
See also
File-system permissions
chattr, the command used to change the attributes of a file or directory on Linux systems
chown, the command used to change the owner of a file or directory on Unix-like systems
chgrp, the command used to change the group of a file or directory on Unix-like systems
cacls, a command used on Windows NT and its derivatives to modify the access control lists associated with a file or directory
attrib
umask, restricts mode (permissions) at file or directory creation on Unix-like systems
User identifier
Group identifier
List of Unix commands
References
External links
chmod — manual page from GNU coreutils.
GNU "Setting Permissions" manual
CHMOD-Win 3.0 — Freeware Windows' ACL ↔ CHMOD converter.
Beginners tutorial with on-line "live" example
File system permissions
Operating system security
Standard Unix programs
Unix file system-related software
Unix SUS2008 utilities
Plan 9 commands
Inferno (operating system) commands
|
1986672
|
https://en.wikipedia.org/wiki/Ferranti%20Pegasus
|
Ferranti Pegasus
|
Pegasus was an early British vacuum-tube (valve) computer built by Ferranti, Ltd that pioneered design features to make life easier for both engineers and programmers. Originally it was named the Ferranti Package Computer as its hardware design followed that of the Elliott 401 with modular plug-in packages. Much of the development was the product of three men: W. S. (Bill) Elliott (hardware); Christopher Strachey (software) and Bernard Swann (marketing and customer support). It was Ferranti's most popular valve computer with 38 being sold. The first Pegasus was delivered in 1956 and the last was delivered in 1959. Ferranti received funding for the development from the National Research Development Corporation (NRDC).
At least two Pegasus machines survive, one in The Science Museum, London and one which was displayed in the Science and Industry Museum, Manchester but which has now been removed to the storage in the Science Museum archives at Wroughton. The Pegasus in The Science Museum, London ran its first program in December 1959 and was regularly demonstrated until 2009 when it developed a severe electrical fault. In early 2014, the Science Museum decided to retire it permanently, effectively ending the life of one of the world's oldest working computers. The Pegasus officially held the title of the world's oldest computer until 2012, when the restoration of the Harwell computer was completed at the National Museum of Computing.
Design
In those days it was common for it to be unclear whether a failure was due to the hardware or the program. As a consequence, Christopher Strachey of NRDC, who was himself a brilliant programmer, recommended the following design objectives:
The necessity for optimum programming (favoured by Alan Turing) was to be minimised, "because it tended to become a time-wasting intellectual hobby of the programmers".
The needs of the programmer were to be a governing factor in selecting the instruction set.
It was to be cheap and reliable.
The first objective was only partially met: because both program and the data on which it was to operate had to be in the 128 words of primary storage contained in 8-word nickel delay lines. The rest of the memory was held on a 7936-word magnetic drum, which rotated at 3750 rpm, so it was often necessary to use ingenuity to reduce the number of transfers between the fast store and the drum.
Pegasus had eight accumulators, seven of which could also be used as index registers, the first computer to allow this dual use. Accumulators 6 and 7 were known as p and q and were involved in multiply and divide and some double-length shift instructions. Each word contained 39 bits plus 1 bit for parity checking. Two 19-bit instructions were packed into one word, with the extra bit that could be used to indicate a breakpoint (optional stop), to assist in debugging. In line with Strachey's second objective, it had a relatively generous instruction set for a computer of its time, but there was no explicit hardware provision for handling either characters or floating-point numbers.
The speed of arithmetic operations was about the same as in the Elliott 402 computer, which could add in 204 microseconds and multiply in 3366 microseconds. The Pegasus basic instruction cycle time for add/subtract/move and logical instructions was 128 microseconds. Multiply, divide, justify and shift instructions took a variable time to complete. Transfers to and from the drum were synchronous. The layout of blocks on the drum was interleaved to allow some processing between transfers to/from consecutive blocks. The computer was advertised as weighing .
To what extent Strachey's third objective was reached, depends on how one views a price of £50,000 for Pegasus 1, which did not have magnetic tape drives, line printer or punched card input and output. The modular design with plug-in units of hardware did, however, make it very reliable by the standards of the day, and maintenance was "a doddle of a job".
Applications
The initial version of Pegasus, Pegasus 1 was intended for scientific and engineering applications. Its input was via 5-hole paper tape with output on tape. The variant for business data processing was called Pegasus 2 and could be equipped with punched cards, magnetic tape and line printer.
In 1956 the first Pegasus was used to calculate the stresses and strains in the tail plane of the Saunders-Roe SR.53; the results were used to check the manufacturers figures; the programmer was Anne Robson. Because of the importance of a computer, it was housed in the drawing room, complete with an Adam's ceiling, of Ferranti's London office in Portland Place.
A Pegasus 1 was installed at Cyber House, Sheffield by Stafford Beer for the use of United Steel. It was the first computer installed for management cybernetics.
The Pegasus at Southampton University was used for analysis of ground resonance data for the Saro P.531 helicopter, which eventually entered production as the Westland Scout and Westland Wasp.
In 1957 a Pegasus computer was used to calculate 7480 digits of , a record at the time. In 1959 Handley Page Ltd were advertising for experienced Pegasus programmers to join their aviation design team at Cricklewood, London
The University of Leeds had a Pegasus computer, run by Sandy Douglas. This was used, among other things, for a project to process the University's matriculation records.
Other people who worked on the Pegasus included Hugh McGregor Ross and Donald B. Gillies.
See also
List of vacuum-tube computers
References
Bibliography
External links
The History of Computing Project: The Industrial Era, 1955–1957
The 1962 edition of the Pegasus Programming Manual (38 MB PDF)
The Computer Conservation Society, who helped to maintain the Pegasus installation in the London Science Museum
Early British computers
Pegasus
Vacuum tube computers
Collections of the Science Museum, London
|
2575836
|
https://en.wikipedia.org/wiki/Abstract%20state%20machine
|
Abstract state machine
|
In computer science, an abstract state machine (ASM) is a state machine operating on states that are arbitrary data structures (structure in the sense of mathematical logic, that is a nonempty set together with a number of functions (operations) and relations over the set).
Overview
The ASM Method is a practical and scientifically well-founded systems engineering method that bridges the gap between the two ends of system development:
the human understanding and formulation of real-world problems (requirements capture by accurate high-level modeling at the level of abstraction determined by the given application domain)
the deployment of their algorithmic solutions by code-executing machines on changing platforms (definition of design decisions, system and implementation details).
The method builds upon three basic concepts:
ASM: a precise form of pseudo-code, generalizing Finite State Machines to operate over arbitrary data structures
ground model: a rigorous form of blueprints, serving as an authoritative reference model for the design
refinement: a most general scheme for stepwise instantiations of model abstractions to concrete system elements, providing controllable links between the more and more detailed descriptions at the successive stages of system development.
In the original conception of ASMs, a single agent executes a program in a sequence of steps, possibly interacting with its environment. This notion was extended to capture distributed computations, in which multiple agents execute their programs concurrently.
Since ASMs model algorithms at arbitrary levels of abstraction, they can provide high-level, low-level and mid-level views of a hardware or software design. ASM specifications often consist of a series of ASM models, starting with an abstract ground model and proceeding to greater levels of detail in successive refinements or coarsenings.
Due to the algorithmic and mathematical nature of these three concepts, ASM models and their properties of interest can be analyzed using any rigorous form of verification (by reasoning) or validation (by experimentation, testing model executions).
History
The concept of ASMs is due to Yuri Gurevich, who first proposed it in the mid-1980s as a way of improving on Turing's thesis that every algorithm is simulated by an appropriate Turing machine. He formulated the ASM Thesis: every algorithm, no matter how abstract, is step-for-step emulated by an appropriate ASM. In 2000, Gurevich axiomatized the notion of sequential algorithms, and proved the ASM thesis for them. Roughly stated, the axioms are as follows: states are structures, the state transition involves only a bounded part of the state, and everything is invariant under isomorphisms of structures. (Structures can be viewed as algebras, which explains the original name evolving algebras for ASMs.) The axiomatization and characterization of sequential algorithms have been extended to parallel and interactive algorithms.
In the 1990s, through a community effort, the ASM method was developed, using ASMs for the formal specification and analysis (verification and validation) of computer hardware and software. Comprehensive ASM specifications of programming languages (including Prolog, C, and Java) and design languages (UML and SDL) have been developed.
A detailed historical account can be found elsewhere.
A number of software tools for ASM execution and analysis are available.
Publications
Books
AsmBook: Egon Börger, Robert Stärk. Abstract State Machines: A Method for High-Level System Design and Analysis
JBook: R.Stärk, J.Schmid, E.Börger. Java and the Java Virtual Machine: Definition, Verification, Validation
Proceedings/Journal Issues (since 2000)
2008: Springer LNCS 5238 Abstract State Machines, B and Z
2007: J.UCS Special Issue with Selected Papers from ASM'07
2006: Springer LNCS 5115 Rigorous Methods for Software Construction and Analysis, ASM and B Dagstuhl Seminar
2005: Fundamenta Informatica Special Issue with Selected Papers from ASM'05 (electronic proceedings)
2004: Springer LNCS 3052 Abstract State Machines 2004
2003: Springer LNCS 2589 Abstract State Machines 2003: Advances in Theory and Practice
2003: TCS special Issue with Selected Papers from ASM'03
2002: Dagstuhl Seminar Report Theory and Applications of Abstract State Machines
2001: J.UCS 7.11 Special Issue with Selected Papers from ASM'01
2000: Springer LNCS 1912 Abstract State Machines: Theory and Applications
Comparative case studies with ASM contributions
Steam-Boiler Control: Specification Case Study, Springer LNCS 1165
Production Cell: Software Development Case Study, ASM model
Railcrossing: Formal Methods for Real-Time Computing, ASM model
Light Control: Requirements Engineering Case Study, Dagstuhl Seminar
Invoicing: Requirements Capture Case Study
Behavioral models for industrial standards
OMG for BPMN (version 2006): Springer LNCS 5316
OASIS for BPEL: IJBPMI 1.4 (2006)
ECMA for C#: "A high-level modular definition of the semantics of C♯"
ITU-T for SDL-2000: formal semantics of SDL-2000 and Formal Definition of SDL-2000 - Compiling and Running SDL Specifications as ASM Models
IEEE for VHDL93: E.Boerger, U.Glaesser, W.Mueller. Formal Definition of an Abstract VHDL'93 Simulator by EA-Machines. In: Carlos Delgado Kloos and Peter T.~Breuer (Eds.), Formal Semantics for VHDL, pp. 107–139, Kluwer Academic Publishers, 1995
ISO for Prolog: "A mathematical definition of full Prolog"
Tools
(in historical order since 2000)
ASMETA, the Abstract State Machine Metamodel and its tool set on SourceForge
AsmL
CoreASM, available at CoreASM, an extensible ASM execution engine
AsmGofer on Archive.org
The XASM open source project on SourceForge
Bibliography
Y. Gurevich, Evolving Algebras 1993: Lipari Guide, E. Börger (ed.), Specification and Validation Methods, Oxford University Press, 1995, 9-36. ()
Y. Gurevich, Sequential Abstract State Machines capture Sequential Algorithms, ACM Transactions on Computational Logic 1(1) (July 2000), 77–111.
R. Stärk, J. Schmid and E. Börger, Java and the Java Virtual Machine: Definition, Verification, Validation, Springer-Verlag, 2001. ()
E. Börger and R. Stärk, Abstract State Machines: A Method for High-Level System Design and Analysis, Springer-Verlag, 2003. ()
E. Börger and A. Raschke, Modeling Companion for Software Practitioners, Springer-Verlag, 2018. (, )
References
External links
Abstract State Machines
AsmCenter
The TASM toolset: specification, simulation, and formal verification of real-time systems
Models of computation
Formal methods
|
3950518
|
https://en.wikipedia.org/wiki/Economy%20of%20Bangalore
|
Economy of Bangalore
|
The economy of Bengaluru contributes over 43.65% to the economy of the State of Karnataka, accounting for 98% of the Software Exports of the State.
The establishment and success of high technology firms in Bangalore has led to the growth of Information Technology (IT) in India. As of 2017, IT firms in Bengaluru employ about 1.5 million employees in the IT and IT-enabled services sectors, out of nearly 4.36 million employees across India and account for the highest IT-related exports in the country. In 2014, Bangalore contributed US$ 45 billion, or 38 per cent of India’s total IT exports.
The Estimated Metro GDP of the city is around US$110 billion, and it has been ranked as fourth most productive metro area of India.
One of the important factors spurring Bangalore's growth was heavy state government investment (and its environment) in Bangalore's public sector industries.
Education
Bangalore houses a number of top tier colleges including the Indian Institute of Management, Bangalore (IIMB), a top management Institute in India, the Indian Statistical Institute (ISI), the Indian Institute of Science (IISc), the Indian Institute of Astrophysics, the National Law School (NLSIU), The Indian Institute of Theoretical Sciences, National Institute of Design (NID), and National Institute of Fashion Technology (NIFT)..
Economic sectors
Earliest startups that were launched in the city in the 1990s include Infosys, Wipro Technologies, Mindtree being popular ones and smaller ones include Tejas Networks. Flipkart, having originated in Bangalore, acquired several other e-commerce companies originated in Bangalore like Myntra and was itself eventually acquired by Walmart in 2018 for close to $20 Billion. Several other unicorns have their origins ln Bangalore like Swiggy, Ola Cabs, InMobi, Quickr etc.
Information Technology
Bangalore is firstly known for its IT industry. It houses many IT Companies. Here is many IT companies like Infosys, Mphasis, Wipro, Tata Consultancy Services, Nasdaq, Facebook, Google, Contrapine and Microsoft etc. India's two largest IT companies - Infosys and Wipro have their headquarters here in Bangalore. Electronic City is a place in Bangalore, which houses IT companies in Bangalore along with Infosys headquarters. Whitefield is another major suburb housing many IT companies. It is called as "The Silicon Valley of India' and "IT Capital of India"
Aerospace and aviation
Bangalore also called the aviation monopoly capital of India. It accounts for India's more than 65% aerospace business. World Aerospace giants such as Boeing, Airbus, Goodrich, Dynamatics, Honeywell, GE Aviation, UTL, others have their R&D and Engineering centres.
Before Bangalore was called the Silicon Valley of India, the city made its name as headquarters to some of the largest public sector heavy industries of India. The Hindustan Aeronautics Limited (HAL) headquarters is in Bangalore, and is dedicated to research and development activities for indigenous fighter aircraft for the Indian Air Force. With over 9,500 employees, it is one of the largest public sector employers in Bangalore.
Today, HAL manufactures, under license, various fighter aircraft for the Indian Air Force (IAF) including Sukhoi 30 Flankers and Jaguars. HAL also develops indigenous products for the IAF such as HAL Tejas, Aeronautical Development Agency, HAL Dhruv and HAL HF-24 Marut.
The National Aerospace Laboratories (NAL) is also headquartered in Bangalore and is dedicated to the development of civil aviation technologies. Incorporated in 1960, NAL often works in conjunction with the HAL and has a staff strength of over 1,300 employees. NAL also investigates aircraft malfeasance.
A special economic zone for the aerospace industry is being set up near the Kempegowda International Airport. Bangalore was also home to large domestic airlines - now defunct Simplifly Deccan and Kingfisher Airlines.
Biotechnology
Biotechnology is a rapidly expanding field in the city. Bangalore accounts for at least 97 of the approximately 240 biotechnology companies in India. Interest in Bangalore as a base for biotechnology companies stems from Karnataka's comprehensive biotechnology policy, described by the Karnataka Vision Group on Biotechnology. In 2003–2004, Karnataka attracted the maximum venture capital funding for biotechnology in the country - $8 million. Biocon, headquartered in Bangalore, is the nation's leading biotechnology company and ranks 16th in the world in revenues.
Institute of Bioinformatics and Applied Biotechnology (IBAB), initiated by Biotechnology vision group, ICICI and Biocon (located at ITPL) is trying to shape revolutionary scientists in the field. Advanta India is also based in the city.
Like the software industry which initially drew most of its workforce from the local public sector engineering industries, the biotechnology industry had access to talent from the National Center of Biological Sciences (NCBS) and the Indian Institute of Science (IISc).
Manufacturing
Other heavy industries in Bangalore include Bharat Electronics Limited, Bharat Heavy Electricals Limited (BHEL), Indian Telephone Industries (ITI), Bharat Earth Movers Limited (BEML), HMT (formerly Hindustan Machine Tools), Hindustan Motors (HM), Manjushree Technopack and ABB Group.
Bangalore is also becoming a destination for the automotive industry. Volvo has a manufacturing plant in Bangalore.
Bangalore houses many small and medium scale industries in its Peenya industrial area that claimed to be one of the biggest in Asia 30-years ago; newly including Apple's India manufacturing plant - the only active plant outside of China.
Other sectors
Food: The city has several types of entrepreneurial pursuits that have shaped it along the way from the early '90s. The city is known for several restaurateurs who innovated on fast service models popularly called Darshini restaurants that served hot breakfast and beverages. Orkla foods, the Norwegian foods company bought MTR Foods, traditional ready-to-eat consumer goods brand in 2007 for approximately $60m. A recent $100m brand is ID foods, fast becoming popular in retail. Swiggy, an on-demand food delivery Unicorn is popular along with Zomato, a restaurant review, listing and food delivery business, that initially started in Bangalore. FreshMenu is a near unicorn cloud kitchen business that only delivers via mobile apps and other on-demand food apps. Cafe Coffee Day, a listed entity is a coffee store chain with stores in Prague, Bratislava, Riga and Warsaw. Chai Point is a chain of tea stores founded in Bangalore in 2010.
Real Estate: Several Venture Capital funded startups like housing.com, nestaway, commonfloor.com (acquired by the Unicorn, Quikr) are disrupting the rental marketplace in India. Several listed real estate brands have their origins in the city like Prestige Group, Brigade Enterprises, Total Environment and Sobha Developers.
Aerospace: India's largest indigenous OEM, Hindustan Aeronautics Limited (HAL) had its headquarters in India. Several smaller tier 1 and tier 2 suppliers had their base in the city to serve the OEM need. The National Aerospace Laboratories (NAL) is also headquartered in Bangalore and is dedicated to the development of civil aviation technologies. Bangalore also housed now-defunct full-service airline brand Kingfisher Airlines, which acquired another airline startup, Air Deccan, a budget airline.
Space: The Indian Space Research Organization (ISRO), one of the top national space agencies in the world is headquartered in the city. ISRO is recognized world over for its indigenous capabilities in launching low cost satellites using its own launch vehicles, the PSLV and the GSLVs. ISRO has a record of deploying 104 satellites in orbits successfully in a single launch, which is a world record. ISRO has also launched a Mars mission, Mars Orbital Mission, which was the lowest cost inter-planetary orbital mission. Startups have made attempts to launch lunar rovers and are analyzing satellite images to uses in agriculture and climate.
Transportation: Bangalore is the home of India's first electric car brand, Reva was acquired by a large domestic car company, Mahindra & Mahindra. Several startups in automotive services, marketplaces are situated in the city. On-demand taxi service, Ola Cabs, a Unicorn, originated in the city and acquired its early competition and peer, taxiforsure. Bounce is an on-demand motorbike startup that originated in the city. Zoomcar is on demand inter city car transportation startup running out of the city. RedBus is an intercity bus aggregator that was bought by Naspers group.
Grocery: BigBasket.com, Zopnow.com and Zopper.com, started in on-demand grocery and compete with Amazon's Prime Now platform. Offline, formal retail format grocers originating from the city include FoodWorld supermarkets that started in 1996 and several other local brands.
Retail: Urban Ladder is a leading omnichannel commerce furniture retailer founded by entrepreneurs from the city. Lifestyle, now part of Dubai-based Landmark group originated as a brand in Bangalore in 1999. Tanishq is a jewelry retail store brand and is owned by the Tata Group. Printo is a chain of stationery and printing services stores.
Fintechs: Several fintechs have their origins in the city. The revolutionary low-cost brokerage firm Zerodha, several cryptocurrency exchanges. Pine Labs is a recent unicorn that builds POS systems. Capillary Technologies is a loyalty, analytics provider built over POS systems. QwikCilver, a gifting and loyalty platform founded in Bangalore was acquired by Amazon.
Beverages, Beer and Spirits: The city is known for its craft breweries, popular ones being Toit, Arbor Brewing Company and others. Kingfisher is one of the world's largest beer brands that originated in Bangalore. Amrut is India's first Single Malt Whisky brand that is sold all over the world and was named as the number three whisky in the world in 2010. United Breweries Group has its headquarters in Bangalore. It produces Kingfisher (beer).
Biopharmaceuticals: Biocon is one of India's largest pharmaceutical companies which also owns a majority stake in India's largest Clinical Research Outsourcing (CRO) company Syngene International that works with global pharmaceutical majors. Strides Arcolab manufactures pharma products for emerging markets and is a listed entity in the Indian Stock Markets. The Himalaya Drug company makes several pharma and beauty care products and is headquartered in Bangalore.
Consumer goods: Wildcraft, a fast-growing outdoor adventure goods company was founded in the city. Zivame is an online commerce lingerie company fast growing into the number 1 brand in India.
Healthcare: Narayana Hrudayalaya, a listed business, is a popular hospital chain that was built by renowned Bangalore cardiac surgeon. Portea Medical and Practo are some of the fast-growing startups in the space. Cloud Nine is a chain of fast-growing maternity and childcare brands founded in the city in 2007.
Logistics: DTDC is an asset light logistics company built by first generation entrepreneurs in the city.
Feature Films: Lucia is a Kannada movie that is renowned as India's first crowdsourced movie. The movie was extensively shot in and directed by Bangalore teams.
Fitness and Sports: There are many sports facility aggregators where consumers can book indoor courts or swimming pool slots like Playo. Many entrepreneurs are setting up sports facilities due to higher interest in fitness. There is a fitness chain called CureFit, invested in by early entrepreneurs and restaurants attached like EatFit.
Agriculture: Many wine yards are springing up around the city due to interest among a globally aware community of people residing in the city. Bangalore is also India's largest export of roses, about 70% of all rose exports come from the city.
Architecture: Samsung Electronics in 2018, opened Largest Mobile Experience Centre in the World at Bengaluru’s Iconic Opera House. Samsung Opera House will be a must-do destination for the city’s millennials looking for exciting tech-enabled experiences and entertainment. One will be able to enjoy VR experiences such as the 4D Sway Chair or the Whiplash Pulsar 4D chair that makes 360 degrees three-dimensional movements. One can slip into the role of a fighter pilot doing extreme aircraft stunts, or experience a space battle, or a roller coaster ride. The 33,000 sq ft standalone property, which during the British era hosted plays and Operas, has been restored over two years and its facade continues to don its magnificent original look and feel. On the inside, a modern experiential space has been developed with extensive use of modern technology.
Economic zones in the city
There are several economic clusters, as in many cities in the world, in the city.
Chickpete area is known for textile trades and early entrepreneurs in the city
Shivajinagar area houses auto spares and services clusters
Whitefield was a neighboring town to Bangalore, but over time has been assimilated into the city. Whitefield houses several Information Technology Parks and many global firms have their India headquarters located in the area.
Koramangala and JP Nagar have traditionally been the area where tech startups take birth
Electronics City houses all the major IT service providers of India
Government incentives and programs
Tax holiday for IT services: Government of Karnataka was the first state government to introduce a tax holiday for IT services companies to set up shop in the city to earn a decade-long corporate tax holiday to incentivize the industry.
IT SEZ program: Server IT Special economic Zones are now set up where they receive a corporate tax holiday if offices are situated in those zones
Ministry of IT: One of the early states in India to have a Ministerial position for Information Technology. This was created to address the issues faced by the industry in terms of physical and digital infrastructure, and supply of graduates.
Adoption of Technology in Government programs: Multiple government initiatives have included digitization of citizen programs and Karnataka has been at the forefront of adoption of technology. The Regional Transport Office in the city are fully computerized and they the earliest to do so. Bangalore also achieved full computerization of the Indian Passport Distribution process, first in the country.
The digital office of the Income Tax Department of India is based in Bangalore. The need for the build of systems to collect and refund taxes for millions of citizens and need for data analytics and AI to prevent fraud meant that Bangalore city was an obvious choice for the same.
References
External links
Bangalore: India's Hightech-Capital
Bangalore cluster: Evolution, growth and challenges - An examination of the IT industry in Bangalore
The Garment Industry in Bangalore
|
1117753
|
https://en.wikipedia.org/wiki/ZMODEM
|
ZMODEM
|
ZMODEM is a file transfer protocol developed by Chuck Forsberg in 1986, in a project funded by Telenet in order to improve file transfers on their X.25 network. In addition to dramatically improved performance compared to older protocols, ZMODEM offered restartable transfers, auto-start by the sender, an expanded 32-bit CRC, and control character quoting supporting 8-bit clean transfers, allowing it to be used on networks that would not pass control characters.
In contrast to most transfer protocols developed for bulletin board systems (BBSs), ZMODEM was not directly based on, nor compatible with, the seminal XMODEM. Many variants of XMODEM had been developed in order to address one or more of its shortcomings, and most remained backward compatible and would successfully complete transfers with "classic" XMODEM implementations. This list includes Forsberg's own YMODEM.
ZMODEM eschewed backward compatibility in favor of producing a radically improved protocol. It performed as well or better than any of the high-performance varieties of XMODEM, did so over links that previously didn't work at all, like X.25, or had poor performance, like Telebit modems, and included useful features found in few or no other protocols. ZMODEM became extremely popular on bulletin board systems (BBS) in the early 1990s, becoming a standard as widespread as XMODEM had been before it.
Improvements
Streaming
Generally, file transfer protocols break down a file into a series of packets, and then send them one-at-a-time to the receiver. The main portion of the packet, the payload, is a certain number of bytes from the file being sent. After the payload comes a checksum or cyclic redundancy check (CRC) that can be used to determine if the payload was received correctly. If the packet is received correctly, the receiver sends an ACK message and the sender then starts sending the next packet.
The telephone system introduces a small delay known as latency that interferes with this process. Even if the receiver sends the ACK immediately, the delay in the phone lines means there will always be some time before the sender receives it and sends the next packet. As modem speeds increase, this delay represents a larger and larger number of packets that could have been sent during the delay, decreasing the channel efficiency.
XMODEM used 128-bytes payloads with a three-byte header and one-byte checksum for a total of 132 bytes per packet. In the era of 300 bps modems, a packet took about four seconds to send, and typical latencies were on the order of of a second, so the performance overhead was not significant. As speeds increase the problem becomes more problematic; at 2400 bps a packet takes about to send, so about of the available bandwidth is wasted waiting for ACKs. At 9600 bps a packet requires only 0.13 seconds to send, so about of the bandwidth is wasted.
One solution to this problem is the use of a sliding window. These protocols address latency by allowing the sender to continue sending a number of packets without waiting for an ACK. The number of packets that it allows to continue is the "window", which was typically between two and sixteen packets in most implementations. A number of new versions of XMODEM with sliding window support appeared in the early 1980s.
Sliding windows are useful for latencies on the order of several packet lengths, which is the case for XMODEM on conventional phone lines. However, it is not enough to address longer latencies found on overseas phone calls or X.25 services such as PC Pursuit, where the latencies are on the order of a second or longer. In other cases, where the reverse channel was much slower than the sending one, as was the case for Telebit or US Robotics modems, even the small number of ACKs might overwhelm the return channel and cause the transfer to pause.
ZMODEM addressed these problems by removing the need for ACKs at all, allowing the sender to send data continually as long as the receiver detected no errors. Only NAKs had to be sent, if and only if there was a problem. Since ZMODEM was often used on links with built-in error correction, like X.25, the receiver would often not send a single message back to the sender. As a result, the system would send the entire file in a continual stream, and ZMODEM referred to itself as a "streaming protocol".
ZMODEM's performance was so improved over previous common protocols that it generally replaced even special protocols such as YMODEM-g, which included no error correction at all and instead relied on error-free links maintained by the modems. Although YMODEM-g was faster, the lack of other features such as restartable transfers made it less appealing.
Restart
XMODEM, and most protocols based on it, managed packet order by prefixing the data with a packet number from 1 to 255. Windowed versions used this packet number to indicate which packets had been received properly, or specify one that had not. Since the packets were 128 bytes long, this meant the maximum amount of data that could be transferred before the packet numbers rolled over was 32 kB.
ZMODEM replaced the packet number with the actual location in the file, indicated by a 32-bit number. This allowed it to send NAK messages that re-wound the transfer to the point of failure, regardless of how long the file might be. This same feature was also used to re-start transfers if they failed or were deliberately interrupted. In this case, the receiver would look to see how much data had been previously received and then send a NAK with that location, automatically triggering the sender to start from that point.
Auto-start
Auto-starting simplified management by allowing the sending machine to start the transfer. Previously the user had to first request the file from the sender, placing it into a "waiting" state, then return to their local program and invoke a command to start the transfer. With auto-transfer, they simply requested the file, the sender would then automatically trigger the transfer in the user's program.
Variations
A number of modified versions of ZMODEM appeared. ZedZap was a variant of ZMODEM with 8 kbyte blocks for better performance on high-speed modems. LeechZmodem was a mischievous ZMODEM variant (among similar XMODEM and YMODEM derivatives) that cheated BBS download quotas. A backwards compatible extension of ZMODEM with 32 kbyte and 64 kbyte block lengths was created by ADONTEC in 2002 and 2007 to increase performance on high-speed error free connections like ISDN or TCP/IP networks.
The most notable ZMODEM implementations were from Chuck Forsberg's Omen Technology, Inc. These included DSZ (DOS Send ZMODEM), GSZ (Graphical Send ZMODEM), and the ubiquitous (l)rzsz for Unix variants.
In more current times, the developers of Synchronet have created a modern X/Y/ZMODEM implementation named SEXYZ, loosely based on the zmtx/zmrx package, which runs natively on Windows and Unix variants, supports long filenames and faster, more reliable data transfers. The ZMODEM implementation from SEXYZ has also been incorporated into the SyncTERM project. Synchronet, SEXYZ, and SyncTERM are all open-source, cross-platform, BBS-centric projects.
Forsberg himself collected a number of improvements into ZMODEM-90. The first of these is MobyTurbo, which removed control quoting to further improve performance, about 15%. Even on networks that "eat" control characters, ZMODEM-90 can be tailored to quote only those characters the network actually eats, as opposed to every possible one. A similar improvement allows ZMODEM-90 to work on 7-bit networks, whereas earlier protocols (with the notable exception of Kermit) had all demanded 8-bits to one degree or another. Finally, ZMODEM-90 includes a basic run-length encoding compression system to further improve performance on uncompressed files.
Limitations
Some of the ZMODEM packets (e.g. ZACK, ZRPOS) embed a byte-offset within the transferred file as a 32-bit unsigned integer. This design limits the feasibility of ZMODEM to only reliably transfer files that are under 4GB in size.
Even though the protocol could permit it, the reference (l)rzsz implementation cannot encode arbitrary non-control characters (e.g. '~') which are often used by TCP/IP connection programs like telnet and ssh as client-side "terminal escape" characters. Users must disable the terminal escape feature to achieve reliable transfers over these kinds of links, e.g. ssh -e none user@hostname.
References
The ZMODEM Inter Application File Transfer Protocol
Synchronet External X/Y/Zmodem (SEXYZ) File Transfer Protocol Driver
External links
Evolution and Selection of File Transfer Protocols
BBS file transfer protocols
Modems
Computer-related introductions in 1986
|
1745691
|
https://en.wikipedia.org/wiki/Warehouse%20management%20system
|
Warehouse management system
|
A warehouse management system (WMS) is a software application designed to support and optimize warehouse functionality and distribution center management. These systems facilitate management in using simplified automatic technologies useful in daily activities like planning, organizing, staffing, directing, warehousekeeping and controlling the utilization of available resources, to move and store materials inside, around and outside of a warehouse, while supporting staff in the performance of material movement and storage in and around a warehouse, without causing any large scale disruption to business resources.
Use case
Warehouse management solutions are primarily tactical tools, purchased and used by businesses to satisfy the unique customer demand requirements of their supply chain(s) and distribution channel(s), when the inventory and workload is larger than what can be handled manually, with spreadsheets.
Features
A WMS uses a database configured to support warehouse operations, containing detail describing a variety of standard warehouse elements including:
Individual stock keeping units (SKUs) that are handled and stored, e.g., weight, dimensions, case pack, automatic ID labels (bar codes, etc.), and inventory by location with manufacture date, lot code, etc. SKUs may include basic materials, fabricated parts, assemblies, and industrial and consumer finished goods, etc.;
Warehouse storage locations, e.g., individual location number, picking sequence, type of use (picking, reserve storage, etc.), type of storage (each, case, pallet), location size or capacity, storage restriction (flammable, hazardous, high value materials, outdoor, etc.), etc.;
Dock doors, e.g., individual number, etc.; and
Expected labor productivity rates by function or activity, e.g., cases picked per man-hour, etc.
Daily management functions include
Planning – finalizing the daily plan for receiving dock activity, selecting the workload/orders to be processed in the day or shift, (this may also be done by the business system), and calculating an estimate of the labor and vehicles required to pick and ship the orders to ensure the staffing is appropriate, and to notify carriers regarding to load and depart to meet customer requirements.
Organizing – sequencing the orders to be picked. Organizing orders for picking can be accomplished in many ways, meeting the needs of the user. The primary objective is to be intentional, and not to pick the orders in the sequence in which they were received unless the company wants to pay a carrier make sense for transportation and delivery. The initial way of organizing was called wave planning or wave picking, with two objectives, a. to minimize need for dock staging space, by having orders arrive at the shipping dock in trailer load sequence, and b. to create an order of flow that will support monitoring the progress through the day and eliminate/reduce last minute requests for overtime or delay of carrier departure, etc.
Staffing – assign staff to work functions and areas, by wave, to minimize staging.
Directing – ensuring the documented processes and procedures are embedded in the WMS and are consistently applied, used and appropriate for the nature of the work and service level intentions of the company (e.g., International Standards Organization 9000 (www.iso.org)). This function may also be used to divide individual orders into logical work units and the ability to assign them to separate individuals potentially for simultaneous performance, consistent throughput requirements and physical layout, e.g., separating individual case picking from each unit picking, and individual pallet load picking, to improve productivity and support Control.
Controlling – providing milestones for management to monitor progress through the day, providing the opportunity to respond to problems in a timely way, and report data for performance analysis.
Integration
Warehouse management systems support warehouse staff in performing the processes required to handle all of the major and many minor warehouse tasks such as receiving, inspection and acceptance, put-away, internal replenishment to picking positions, picking, packing, value added services, order assembly on the shipping dock, documentation, and shipping (loading onto carrier vehicles). A warehouse management system also helps in directing and validating each step, capturing and recording all inventory movement, and status changes to the data file.
A warehouse management system usually represents the central unit in the software structure of a warehouse. The WMS receives orders from the overlying host system, mostly an ERP system, manages these in a database and, after appropriate optimization, supplies them to the connected conveyor control systems.
This becomes clear when you look at the processes necessary for e-commerce: as soon as a customer places an order on a website the information is passed along via the business host computer (mostly an ERP system) to the WMS. All necessary steps to manage this order, pick the ordered items, etc., are then processed within the WMS. Afterward, information is sent back to the business host computer to support financial transactions, advance shipping notifications to customers, inventory management, etc.
A modern WMS will connect to a variety of communication technologies (radio frequency), automatic ID technologies (barcode, RFID, etc.), mobile computers, and occasionally automated material handling (conveyors and sortation) and storage equipment (carousels, automatic storage and retrieval, etc.).
Types
Warehouse management systems can be standalone systems, part of supply chain execution suites, or modules of an enterprise resource planning (ERP) system. Depending on the size and sophistication of the organization, warehouse management can be as simple as handwritten lists or spreadsheets using software such as Microsoft Excel or Access, as well as specialty WMS software systems.
See also
Automated storage and retrieval system
Data warehouse
Document automation
Enterprise resource planning
Inventory management software
Manufacturing resource planning
Pick and pack
Shipping list
Voice-directed warehousing
Warehouse control system
Warehouse execution system
References
Further reading
Fayol Henri, General and Industrial Management, 2013 translated reprint,
Gattorna, John (2015), Dynamic Supply Chains
Warehouses
Business software
Automatic identification and data capture
Radio-frequency identification
|
22152977
|
https://en.wikipedia.org/wiki/Netblender
|
Netblender
|
Netblender US-based company that produces and develops software for creators of Blu-ray high definition media. Based in Alexandria, Virginia and founded in 2005 Netblender's primary product is the DoStudio line of Blu-ray authoring software. It is one of only three producers of professional Blu-ray authoring tools. Its software is aimed at both large budget studio productions and independent film makers.
Sony Creative Software purchased Netblender in October, 2011.
Products
Do Studio
Is one of only three professional Blu-ray encoding software products on the market today. Originally developed as a HD DVD only tool it was re released in 2008 for Blu-ray. It is a complete BD-ROM spec compliant tool with AACS support, BDCMF formatting, BD-J support. The tool includes a point and click graphical user interface.
BD Touch
BD Touch is software that allows iPhones and other wifi enabled hand held devices to connect to a Blu-ray player. This connectivity has several uses. It allows to device to act as a remote control or keyboard interface to enter data into the player. It also allows media transfer between the Blu-ray player and the device, so that video can be downloaded to an iPhone. There is also a possibility of leveraging the interactive features of the Blu-ray disc and interface of an iPhone to create games where the hand held device interacts with the Blu-ray disc. The first title to be released using BD Touch was the French version of Iron Man.
Netblender Live
Netblender live is the latest release from Netblender and was introduced at the NAB show of 2009. The program is a complete technology solution for connecting rich media content to a Blu-ray Disc via an internet connection. NetBlender Live helps with the production of online features such as updateable trailers, dynamic Picture in Picture, downloadable bonus footage.
Awards
Netblender was nominated for the Outstanding Achievement in Advanced Media Technology for the Non-Synchronous Enhancement of Original Television Content Award of the 58th Annual Technology & Engineering Emmy Awards. It was nominated for its work on the PBS DVD, A Cultivated Life: Thomas Jefferson and Wine.
References
Optical disc authoring
Optical disc authoring software
Blu-ray Disc
High-definition television
Java platform
Privately held companies based in Virginia
|
161049
|
https://en.wikipedia.org/wiki/1962%20in%20music
|
1962 in music
|
This is a list of notable events in music that took place in the year 1962.
Specific locations
1962 in British music
1962 in Norwegian music
Specific genres
1962 in country music
1962 in jazz
Events
January 1 – The Beatles and Brian Poole and the Tremeloes both audition at Decca Records in London which has the option of signing one group only. The Beatles are rejected, mainly as they come from Liverpool and the others are Dagenham-based, nearer London.
January 5 – The first album on which The Beatles play, My Bonnie, credited to "Tony Sheridan and the Beat Brothers" (recorded last June in Hamburg and produced by Bert Kaempfert), is released by Polydor.
January 24 – Brian Epstein signs on to manage The Beatles.
February 16 – Conductor Bruno Walter, the day before his death, ends his last letter with: "Despite all the dark experiences of today I am still confident that Palestrina will remain. The work has all the elements of immortality".
March 18 – The 7th Eurovision Song Contest, held at Villa Louvigny in Luxembourg City, is won by France with the song "Un premier amour", performed by Isabelle Aubret.
March 19 – Bob Dylan releases his debut album, Bob Dylan, in the United States, featuring mostly folk standards.
April 6 – New York Philharmonic concert of April 6, 1962: Leonard Bernstein causes controversy with his remarks before a concert featuring Glenn Gould with the New York Philharmonic, when he (Bernstein) announces that although he disagrees with Gould's slow tempi in Brahms' Piano Concerto No. 1, he finds Gould's ideas fascinating and will conduct the piece anyway. Bernstein's action receives a withering review from The New York Times music critic Harold C. Schonberg.
April 7 – Mick Jagger and Keith Richards meet Brian Jones at The Ealing Club, a blues club in London.
April 10 – Former Beatle Stuart Sutcliffe dies from cerebral paralysis caused by a brain hemorrhage in Hamburg, Germany.
April 12 – A recording is made of Bob Dylan's concert at the Town Hall, in New York City by Columbia Records. (Columbia eventually release the recording of "Tomorrow is a Long Time" from this concert.)
April 24 – Bob Dylan begins recording The Freewheelin' Bob Dylan in New York.
May 29 – The 4th Annual Grammy Awards are held in Chicago, Los Angeles and New York. Henry Mancini wins the most awards with five, including Record of the Year and Song of the Year for his song "Moon River". Judy Garland's Judy at Carnegie Hall wins Album of the Year, while Peter Nero wins Best New Artist.
June 6 – The Beatles play their first session at EMI's Abbey Road Studios in London.
June 19 – The film version of the musical The Music Man is released to theaters by Warner Bros.
August 2 – Robert Allen Zimmerman legally changes his name to Bob Dylan in the New York Supreme Court.
August 16 – The Beatles fire drummer Pete Best and replace him with Ringo Starr.
August 17 – Instrumental Telstar, written and produced by Joe Meek for English band The Tornados, is released in the UK. The song will eventually be the first song by a British group ever to reach the top spot on the Billboard Top 100 in the United States, proving to be a precursor to the British Invasion.
August 18 – The Beatles play their first live engagement with the line-up of John, Paul, George and Ringo, at Hulme Hall, Port Sunlight on the Wirral Peninsula.
August 20 – Albert Grossman becomes Bob Dylan's manager.
August 23 – John Lennon marries Cynthia Powell in an unpublicised register office ceremony at Mount Pleasant, Liverpool.
September 21 – New Musical Express, the British music magazine, publishes a story about two 13-year-old schoolgirls, Sue and Mary, releasing a disc on Decca and adds "A Liverpool group, The Beatles, have recorded 'Love Me Do' for Parlophone Records, set for October 5 release."
September 22 – Bob Dylan appears for the first time at Carnegie Hall in New York City as part of a hootenanny including the first public performance of "A Hard Rain's a-Gonna Fall".
September 23 – Opening concert at the New York Philharmonic's new home, Philharmonic Hall at Lincoln Center for the Performing Arts, conducted by Leonard Bernstein and broadcast live on television across the United States by NBC. The opening work, Aaron Copland's specially commissioned Connotations, sends "shock waves through the world of music". Other commissions featured include Darius Milhaud's Overture Philharmonique and Samuel Barber's Andromache's Farewell for soprano and orchestra. The following day, John Browning premières Barber's Piano Concerto at the venue and on October 4 William Schuman's Symphony No. 8 is premièred here.
October 5 – The Beatles' first single in their own right, "Love Me Do"/"P.S. I Love You", is released in the UK on EMI's Parlophone label.
October 14 – Italian tenor Sergio Franchi makes his American TV debut on The Ed Sullivan Show.
October 17 – The Beatles make their first televised appearance, on Granada television's local news programme People and Places.
October 20 – Peter, Paul and Mary's self-titled debut album reaches No. 1 on the Billboard 200 album chart.
October 21 – Sergio Franchi makes his American concert debut at Carnegie Hall (sans microphone), promoted by Sol Hurok.
November 11
Ken Russell's film Elgar is shown in BBC Television's Monitor series in the United Kingdom.
Joan Baez has all of her first three albums on the Billboard charts, on their way to Gold status.
Two Pete Seeger classic songs reach the Billboard pop charts:
"Where Have All the Flowers Gone" recorded by The Kingston Trio reaches No. 21.
"If I Had a Hammer", recorded by Peter, Paul and Mary, reaches No. 10.
The first American Folk Blues Festival, initiated by German promoters, tours Europe; artists include Sonny Terry, Brownie McGhee and T-Bone Walker. Its only UK date, 21 October at the Free Trade Hall, Manchester, is influential on the British R&B scene, with the audience including Mick Jagger, Keith Richards and Brian Jones of The Rolling Stones with Jimmy Page, Paul Jones, John Mayall and other musicians, and with a second show filmed and shown on Independent Television.
Georges Auric becomes director of the Opéra National de Paris.
André Hodeir's book, Since Debussy, makes controversial claims about the importance of Jean Barraqué as a composer.
José Manuel Calderón becomes the first Dominican musician to record bachata, at the Radiotelevisión Dominicana studios.
The Spokane Philharmonic orchestra becomes the Spokane Symphony.
Dalida is named Calabrian Citizen of Honour and receives the Radio Monte Carlo Oscar with Johnny Hallyday.
Paul & Paula make their first appearance together while attending Howard Payne College in Brownwood, Texas.
The Mashed Potato is a popular dance craze, with several songs based around the style.
Lou Harrison visits Taiwan; on his return he forms, with William Colvig, Richard Dee and Lily Chin, the first American ensemble to play traditional Chinese music.
Sergio Franchi is signed to an RCA Red Seal recording contract in London by Norman Luboff.
Bands formed
Booker T. & the MG's
Herman's Hermits
The Rolling Stones
The Trashmen
Question Mark and the Mysterians
The Routers
Albums released
Adam Faith – Adam Faith
After Hours – Joni James
Alice Faye Sings Her Famous Movie Hits – Alice Faye
Along Comes Ruth – Ruth Brown
All Aboard the Blue Train – Johnny Cash
All Alone – Frank Sinatra
All the Sad Young Men – Anita O'Day
Baby It's You – The Shirelles
Bashin': The Unpredictable Jimmy Smith – Jimmy Smith
Because You're Mine – Keely Smith
The Best of Ball, Barber And Bilk – Kenny Ball, Chris Barber, and Acker Bilk
The Best of Irving Berlin's Songs from Mr. President – Perry Como with Kaye Ballard and Sandy Stewart
The Best of Julie – Julie London
The Best of Sam Cooke – Sam Cooke
Bewitching-Lee – Peggy Lee
Big Band Percussion – Ted Heath and His Music
Big Band Specials – June Christy
Billy Rose's Jumbo – Soundtrack
Blues Cross Country – Peggy Lee
Bobby Vee Meets the Crickets – Bobby Vee and The Crickets
A Bobby Vee Recording Session – Bobby Vee
Bobby Vee's Golden Greats – Bobby Vee
Bob Dylan – Bob Dylan (debut album)
Bo Diddley – Bo Diddley
Bo Diddley & Company – Bo Diddley
Bo Diddley's a Twister – Bo Diddley
Bobby Darin Sings Ray Charles – Bobby Darin
Bouquet of Roses – Les Paul and Mary Ford
Buddy and Soul – Buddy Greco
Bursting Out with the All–Star Big Band! – Oscar Peterson
By Request – Perry Como
Cafrune – Jorge Cafrune
Cal Tjader Plays Harold Arlen – Cal Tjader
Cal Tjader Plays the Contemporary Music of Mexico and Brazil – Cal Tjader
The Cannonball Adderley Sextet in New York – Cannonball Adderley Sextet
Cannonball in Europe! – Cannonball Adderley
Cha Cha de Amor – Dean Martin
Cherokeely Swings – Keely Smith
Chuck Berry Twist – Chuck Berry
The Classic Della – Della Reese
Close Up In Swing – Erroll Garner
Coltrane – John Coltrane
Come Waltz with Me – Steve Lawrence
Comin' Home Baby – Mel Tormé
Dance with Ike & Tina Turner's Kings of Rhythm – Kings of Rhythm
Danny Boy and Other Songs I Love to Sing – Andy Williams
Dear Lonely Hearts – Nat King Cole
Del Shannon – Del Shannon
Dinah '62 – Dinah Washington
Dino: Italian Love Songs – Dean Martin
Dino Latino – Dean Martin
Dizzy on the French Riviera – Dizzy Gillespie
Don't Go in the Lion's Cage Tonight – Julie Andrews
Don't Mess with Tess – Teresa Brewer
Don't Worry 'Bout Me – Billy Eckstine
Drinking Again – Dinah Washington
Duet – Doris Day with André Previn
Dynamite! – Ike & Tina Turner
The Electrifying Aretha Franklin – Aretha Franklin
Ella Swings Brightly with Nelson – Ella Fitzgerald
Ella Swings Gently with Nelson – Ella Fitzgerald
The Fabulous Hits of Dinah Shore – Dinah Shore
The First Family – Vaughn Meader
First Time Out – Clare Fischer
Folklore – Jorge Cafrune
For Those Who Think Young – Joanie Sommers
For Twisters Only – Chubby Checker
French Style – Dean Martin
Full House – Wes Montgomery
The Garland Touch – Judy Garland
The Gift of Love – Jack Jones
Girls! Girls! Girls! (OST) – Elvis Presley
Go – Dexter Gordon
Go On Home – Patti Page
Golden Age of Donegan – Lonnie Donegan
Gospel Time – Ruth Brown
Great Motion Picture Themes – Various Artists
Hancock – Tony Hancock
Hello Young Lovers – Nancy Wilson
High Flying – Lambert, Hendricks & Ross
Hits Of The Rockin' 50s – Bobby Vee
Horn A-Plenty – Al Hirt
Howlin' Wolf – Howlin' Wolf
Howling Wolf Sings the Blues – Howlin' Wolf (released, recorded 1951–52)
Hymns from the Heart – Johnny Cash
I Cry by Night – Kay Starr
I Feel a Song Coming On – Joni James
I Left My Heart In San Francisco – Tony Bennett
I Wanna Be Loved – Dinah Washington
I'm Your Girl – Joni James
In Love – Dinah Washington
In Other Words – Petula Clark
India's Most Distinguished Musician in Concert – Ravi Shankar
Instant Party! – Everly Brothers
It's Trad, Dad! (OST) – Various Artists
I've Got a Lot of Livin' to Do – Jack Jones
Jazz Workshop Revisited – Cannonball Adderley
Let's Talk About Love – Joanie Sommers
Joan Baez in Concert – Joan Baez
Johnny Get Angry – Joanie Sommers
Jorge Cafrune – Jorge Cafrune
Just Plain Country – Kay Starr
Lena...Lovely and Alive – Lena Horne
Lena on the Blue Side – Lena Horne
Let's Face the Music – Shirley Bassey with the Nelson Riddle Orchestra
Let's Go! with The Routers – The Routers
Let's Love – Buddy Greco
Let's Talk About Love – Joanie Sommers
Linger Awhile – Vic Damone
Live at the Diplomat – Damita Jo
The Lively Ones – Vic Damone
Love Letters – Julie London
Love Makes the World Go 'Round – Anna Maria Alberghetti
Marion Montgomery Swings for Winners and Losers – Marion Montgomery
Matt Monro – Matt Monro
Miles Davis at Carnegie Hall – Miles Davis
A Million Dollars' Worth Of Twang Volume 2 – Duane Eddy
Modern Sounds in Country and Western Music – Ray Charles
Modern Sounds in Country and Western Music Volume Two – Ray Charles
Moon Beams – Bill Evans
Moon River and Other Great Movie Themes – Andy Williams
More Cole Español – Nat King Cole
Mr. Broadway – Tony Bennett
The Music Man (OST) – Various Artists
My Bonnie – Tony Sheridan
My Son, the Folk Singer – Allan Sherman
Nancy Wilson/Cannonball Adderley – Nancy Wilson and Cannonball Adderley
Nat King Cole Sings/George Shearing Plays – Nat King Cole and the George Shearing Quintet
Nina at the Village Gate – Nina Simone
Nina Simone Sings Ellington – Nina Simone
No Strings – La Vern Baker, Chris Connor, Bobby Short
Oh! Look at Me Now – Bobby Darin
On Stage with the George Mitchell Minstrels – George Mitchell Minstrels
On the Way Up – Ann-Margret
Out of the Shadows – The Shadows
Past Midnight – Margaret Whiting
Patti Page Sings Golden Hits of the Boys – Patti Page
Peter, Paul and Mary – Peter, Paul and Mary
A Picture of You – Joe Brown
Poema de Amor – Elis Regina
Point of No Return – Frank Sinatra
Porgy and Bess – Original Soundtrack
Pot Luck – Elvis Presley
Ramblin' Rose – Nat King Cole
Rapture – Johnny Mathis
The Real Ambassadors – Dave Brubeck, Louis Armstrong, Carmen McRae, and Lambert, Hendricks & Ross
Rock 'N' Roll No.2 – Elvis Presley (re-issue)
Romantic Italian Songs – Sergio Franchi
Rhythm Is My Business – Ella Fitzgerald
S Wonderful 'S Marvellous – Ray Conniff
Sacred Songs – Harry Secombe
Sammy Davis Jr. All-Star Spectacular – Sammy Davis, Jr.
Sammy Davis Jr. Belts the Best of Broadway – Sammy Davis, Jr.
Sarah + 2 – Sarah Vaughan
See See Rider – La Vern Baker
Sentimentally Yours – Patsy Cline
The Shirelles and King Curtis Give a Twist Party – The Shirelles and King Curtis
Side by Side – Sandler & Young
Sinatra and Strings – Frank Sinatra
Sinatra and Swingin' Brass – Frank Sinatra
Sinatra Sings Great Songs from Great Britain – Frank Sinatra
Sinatra Sings of Love and Things – Frank Sinatra
Sinatra–Basie: An Historic Musical First – Frank Sinatra and Count Basie
Sincerely Yours – Robert Goulet
Sing Something Simple – Cliff Adams Singers
Something Warm – Oscar Peterson
The Song Is Paris – Jackie Paris
Sophisticated Lady – Julie London
Soul – Timi Yuro
The Sound of Johnny Cash – Johnny Cash
Strange Enchantment – Vic Damone
Sugar 'n' Spice – Peggy Lee
Surfin' Safari – The Beach Boys
Swinging All the Way with Frances Faye – Frances Faye
Take Good Care of My Baby – Bobby Vee
Takin' Off – Herbie Hancock
Time for 2 – Anita O'Day and Cal Tjader
Tears and Laughter – Dinah Washington
The Tender, the Moving, the Swinging Aretha Franklin – Aretha Franklin
Things and Other Things – Bobby Darin
32 Minutes and 17 Seconds – Cliff Richard and The Shadows
This Is Anita – Anita O'Day
This Was My Love – Jack Jones
Time for Two – Anita O'Day and Cal Tjader
Tony Bennett at Carnegie Hall – Tony Bennett
Tope Puestro – Jorge Cafrune
Tops with Me – Helen Shapiro
Trumpet and Strings – Al Hirt
Twangy Guitar – Silky Strings – Duane Eddy
Twist with Chubby Checker – Chubby Checker
Twist with Keely Smith – Keely Smith
Twistin' and Twangin' – Duane Eddy
Twistin' Knights at the Roundtable – Bill Haley & His Comets
Twistin' the Night Away – Sam Cooke
Two of Us – Robert Goulet
Vamp of the Roaring Twenties – Dorothy Provine
The Vivacious One – Ann-Margret
Warm and Willing – Andy Williams
We Wish You a Merry Christmas – Ray Conniff
West Side Story – Oscar Peterson Trio
What Kind of Fool Am I and Other Show-Stoppers – Sammy Davis Jr.
What Kind of Fool Am I? – Keely Smith
Whispering Hope – Jo Stafford and Gordon MacRae
You'll Never Walk Alone – Doris Day
You're Mine You – Sarah Vaughan
Biggest hit singles
The following singles achieved the highest chart positions in 1962.
Singles released
Published popular music
"Ahab The Arab" w.m. Ray Stevens
"Blowin' in the Wind" w.m. Bob Dylan
"Bossa Nova Baby" w.m. Jerry Leiber & Mike Stoller
"The Boys' Night Out" w. Sammy Cahn m. Jimmy Van Heusen from the film Boys' Night Out
"Breaking Up Is Hard To Do" w.m. Neil Sedaka & Howard Greenfield
"Call Me Irresponsible" w. Sammy Cahn m. Jimmy Van Heusen from the film Papa's Delicate Condition
"Can't Get Used to Losing You" w.m. Doc Pomus & Mort Shuman
"Can't Help Falling in Love" w.m. Luigi Creatore, Hugo Peretti & George David Weiss
"Comedy Tonight" w.m. Stephen Sondheim
"Danke Schoen" w. Milton Gabler & Kurt Schwabach m. Bert Kaempfert
"Days of Wine and Roses" w. Johnny Mercer m. Henry Mancini from the film Days of Wine and Roses
"Desafinado" w. Newton Mendonca m. Antonio Carlos Jobim
"Devil Woman" w.m. Marty Robbins
"Don't Make Me Over" w. Hal David m. Burt Bacharach
"Dream Baby" w.m. Cindy Walker
"Free" w.m. Stephen Sondheim
"Go Away, Little Girl" w.m. Gerry Goffin & Carole King
"Gonna Build A Mountain" w.m. Leslie Bricusse & Anthony Newley from the musical Stop The World – I Want To Get Off
"Have A Dream" w.Lee Adams m. Charles Strouse
"He's A Rebel" w.m. Gene Pitney
"Her Royal Majesty" w.m. Gerry Goffin & Carole King
"I Just Don't Know What to Do with Myself" w. Hal David m. Burt Bacharach
"I'm Calm" w.m. Stephen Sondheim
"I'm Not The Marrying Kind" w. Mack David m. Sherman Edwards
"I've Got Your Number" w. Carolyn Leigh m. Cy Coleman
"Impossible" w.m. Stephen Sondheim
"It's The Only Way To Travel" w. Sammy Cahn m. Jimmy Van Heusen. Introduced by Bing Crosby and Bob Hope in the film The Road to Hong Kong
"Johnny Get Angry" w. Hal David m. Sherman Edwards
"Let's Not Be Sensible" w. Sammy Cahn m. Jimmy Van Heusen. Introduced by Bing Crosby and Dorothy Lamour in the film The Road to Hong Kong
"Little Boxes" w.m. Malvina Reynolds
"Loads of Love" w.m. Richard Rodgers. Introduced by Diahann Carroll in the musical No Strings
"Look No Further" w.m. Richard Rodgers. Introduced by Diahann Carroll and Richard Kiley in the musical No Strings
"Love I Hear" w.m. Stephen Sondheim
"Lovely" w.m. Stephen Sondheim
"Make It Easy On Yourself" w. Hal David m. Burt Bacharach
"The Man Who Shot Liberty Valance" w. Hal David m. Burt Bacharach
"More" w. Marcello Ciorciolini & Norman Newell m. Nino Oliviero & Riz Ortolani from the film Mondo Cane
"On The Other Side Of The Tracks" w. Carolyn Leigh m. Cy Coleman from the musical Little Me
"Once in a Lifetime" w.m. Leslie Bricusse & Anthony Newley from the musical Stop the World – I Want to Get Off
"Once Upon a Time" w. Lee Adams m. Charles Strouse. Introduced by Ray Bolger and Eileen Herlie in the musical All American
"One Note Samba" w. Jon Hendricks & Newton Mendonca m. Antonio Carlos Jobim
"Only Love Can Break a Heart" w. Hal David m. Burt Bacharach
"Patches" w.and m Barry Mann and Larry Kolber
"Pretty Little Picture" w.m. Stephen Sondheim
"Quando, quando, quando" w. Pat Boone & Alberto Testa m. Elio Cesari
"Ramblin' Rose" w.m. Noel Sherman & Joe Sherman
"Real Live Girl" w. Carolyn Leigh m. Cy Coleman. Introduced by Sid Caesar in the musical Little Me.
"The Road to Hong Kong" w. Sammy Cahn m. Jimmy Van Heusen from the film The Road to Hong Kong
"The Stripper" m. David Rose
"The Sweetest Sounds" w.m. Richard Rodgers from the musical No Strings
"A Swingin' Safari" m. Bert Kaempfert
"Teamwork" w. Sammy Cahn m. Jimmy Van Heusen. Introduced by Bing Crosby, Bob Hope and Joan Collins in the film The Road to Hong Kong
"Those Lazy, Hazy, Crazy Days Of Summer" w. Charles Tobias m. Hans Carste
"Vacation" w.m. Connie Francis, Hank Hunter & Gary Weston
"A Walk in the Black Forest" m. Horst Jankowski
"Walk on the Wild Side" w. Mack David m. Elmer Bernstein from the film Walk on the Wild Side
"Warmer Than a Whisper" w. Sammy Cahn m. Jimmy Van Heusen. Introduced by Dorothy Lamour in the film The Road to Hong Kong
"What Kind Of Fool Am I?" w.m. Leslie Bricusse & Anthony Newley. Introduced by Anthony Newley in the musical Stop The World – I Want To Get Off
"What Now, My Love?" w. Pierre Delanoë & Carl Sigman m. Gilbert Bécaud
"Wolverton Mountain" w.m. Merle Kilgore & Claude King
Other notable songs
"Danke Schoen" w. Kurt Schwaback and Milt Gabler m. Bert Kaempfert
"The Girl from Ipanema" ("Garota de Ipanema") w. Vinicius de Moraes m. Antonio Carlos Jobim
"Quando, quando, quando" w. Alberto Testa m. Tony Renis
"Mandulinata blu" – Mario Trevi
"Zwei kleine Italiener" w. George Buschor m. Christian Bruhn
Classical music
Premieres
Compositions
George Barati – Chamber Concerto
Morley Calvert – Suite from the Montenegrin Hills
Carlos Chávez – Symphony No. 6
Aaron Copland – Connotations
George Crumb – Five Pieces for piano
Luigi Dallapiccola
for orchestra
for baritone and chamber orchestra
Mario Davidovsky
Electronic Study No. 2
Synchronisms No. 1 for flute and electronic sound
Trio for Clarinet, Trumpet, and Viola
Ding Shande – Long March Symphony
Paavo Heininen – Second Symphony ("Petite symphonie joyeuse")
Gyorgy Ligeti – Poème symphonique
Francis Jackson – Intrada for organ, Op. 84 No. 6
André Jolivet – Concerto for cello n°1
Wojciech Kilar – Riff 62 for symphony orchestra
Darius Milhaud
A Frenchman in New York
Invocation à l'ange Raphael
Overture Philharmonique
Symphony No. 12 Rurale
Krzysztof Penderecki – Stabat Mater
Francis Poulenc
Sonata for Oboe
Sonata for Clarinet
William Schuman – Symphony No. 8
Dmitri Shostakovich – Symphony No. 13 in B-flat minor, Op. 113 "Babi-Yar"
Ezra Sims – Third Quartet
La Monte Young – The Second Dream of the High-Tension Line Stepdown Transformer
Opera
Mozart Camargo Guarnieri – Um homem só (tragic opera in one act, libretto by Gianfrancesco Guarnieri, premiered on November 29 at the Theatro Municipal in Rio de Janeiro)
Mario Castelnuovo-Tedesco – The Importance of Being Earnest
Carlisle Floyd – The Passion of Jonathan Wade
Michael Tippett – King Priam
Bruno Maderna – Don Perlimplin (ovvero il Trionfo dell'amore e dell'immaginazione)
Jazz
Musical theatre
All-American Broadway production opened at the Winter Garden Theatre and ran for 80 performances
Blitz! (Lionel Bart) – London production
A Funny Thing Happened on the Way to the Forum (Stephen Sondheim) – Broadway production opened at the Alvin Theatre and ran for 964 performances
Gentlemen Prefer Blondes London production
The Golden Apple Off-Broadway revival of 1954 Broadway production
I Can Get It for You Wholesale Broadway production opened at the Shubert Theatre and ran for 300 performances
Little Mary Sunshine London production
Little Me Broadway production opened at the Lunt-Fontanne Theatre on November 17 and ran for 257 performances
No Strings Broadway production opened at the 54th Street Theater on March 15 and ran for 580 performances
Scapa London production opened at the Adelphi Theatre on March 8 and ran for 44 performances
Stop the World – I Want to Get Off (Anthony Newley and Leslie Bricusse) – Broadway production
Musical films
Bees Saal Baad, starring Biswajeet
Billy Rose's Jumbo released December 6 starring Doris Day, Jimmy Durante, Stephen Boyd and Martha Raye
Gypsy starring Rosalind Russell, Natalie Wood and Karl Malden. Directed by Mervyn LeRoy.
The Music Man starring Robert Preston, Shirley Jones and Hermione Gingold. Directed by Morton DaCosta.
The Road to Hong Kong
State Fair
Wild Guitar
Births
January 4
Robin Guthrie (The Cocteau Twins)
Peter Steele (Type O Negative)
January 8 – Chris Marion, American musician (Little River Band)
January 13 – Trace Adkins, American country music singer-songwriter
January 15 – Tony Rebel, reggae/dancehall artist
January 16 – Paul Webb (Talk Talk)
January 22 – Jimmy Herring, American guitarist
January 28 – Leslie Phillips/Sam Phillips, singer
January 31 – Sophie Muller, British music video director
February 1 – Tomoyasu Hotei, Japanese guitarist (Boøwy)
February 4 – Clint Black, American singer-songwriter, guitarist and producer
February 5 – Martin Nievera, Filipino singer and TV personality
February 6 – Axl Rose (Guns N' Roses, LA Guns, AC/DC)
February 7
David Bryan, keyboardist for the band Bon Jovi
Garth Brooks, country singer
February 10 – Cliff Burton, bassist for Metallica d. 1986
February 11 – Sheryl Crow, American singer
February 17 – David McComb, Australian singer-songwriter and guitarist (The Triffids and The Blackeyed Susans) (d. 1999)
February 19 – Francisco Alejandro Gutierrez, singer
February 21 – Mark Arm, born Mark McLaughlin, American grunge vocalist (Mudhoney)
February 22
Olivier Latry, French organist
Michael Wilton, American progressive metal guitarist Queensrÿche
February 24 – Michelle Shocked, American musician
March 2 – Jon Bon Jovi, lead singer for the band Bon Jovi
March 5 – Craig Reid and Charlie Reid, The Proclaimers
March 7 – Taylor Dayne, American singer
March 10 – Gary Clark (musician), Scottish singer-songwriter, music producer (The Veronicas, Delta Goodrem, Reece Mastin, Gin Wigmore)
March 15 – Terence Trent D'Arby, American-born English singer
March 17 – Clare Grogan, Scottish actress and singer
March 24
Angèle Dubeau, Canadian violinist
Renee Rosnes, Canadian jazz pianist/composer
Rita, Israeli pop singer and actress
March 30 – M.C. Hammer, American rapper
March 31 – Phil Leadbetter, American musician
April 3 – Mike Ness (Social Distortion)
April 8 – Izzy Stradlin of Guns N' Roses, Ju Ju Hounds
April 12
Art Alexakis, American singer and musician (Everclear)
Michael English, American Christian singer
April 13 – Hillel Slovak, American rock musician (Red Hot Chili Peppers) (d. 1988)
April 16 – Ian MacKaye, lead singer of Minor Threat and Fugazi
May 2 — Alain Johannes, Musician and Producer. Eleven (band), Queens of the Stone Age, Them Crooked Vultures.
May 9 – David Gahan, English singer (Depeche Mode)
May 12 – Brett Gurewitz (Bad Religion)
May 14
Ian Astbury, British rock singer (The Cult)
C.C. DeVille, American rock guitarist (Poison)
May 16 – Erwin Gutawa, Indonesian composer
May 28 – Brandon Cruz, American child actor and musician
May 31 – Corey Hart
June 8 – Nick Rhodes (Duran Duran)
June 10 – Wong Ka Kui, Hong Kong composer, songwriter, musician and singer (died 1993)
June 15 – Andrea Rost, Hungarian lyric soprano
June 16 – Femi Kuti, Nigerian saxophonist
June 19 – Paula Abdul, American pop vocalist
June 20 – Mark De Gli Antoni, Soul Coughing
June 21 – Viktor Tsoi, Soviet underground singer and songwriter (died 1990)
June 22 – Bobby Gillespie, Scottish musician (Primal Scream)
June 23
Chuck Billy, American singer-songwriter and guitarist (Testament and Dublin Death Patrol)
Steve Shelley, American musician (Sonic Youth and Crucifucks)
June 26 – Andrej Šeban, guitarist
June 27 – Michael Ball, British stage actor and singer
July 7 – Mark White, bassist (Spin Doctors)
July 8 – Joan Osborne, American singer
July 13 – Rhonda Vincent, American singer-songwriter and mandolin player
July 21 – Lee Aaron, Canadian rock and jazz singer
July 22
Steve Albini, guitarist
Martine St. Clair, Canadian singer and actress
July 26 – Mairéad Ní Mhaonaigh, Irish musician
July 27 – Karl Mueller (Soul Asylum) (d. 2005)
July 29 – Lisa Ono, Japanese-Brazilian bossa nova singer
August 4 – Paul Reynolds (A Flock of Seagulls)
August 7 – Andrew Glover, composer
August 17 – Gilby Clarke, American rock musician (Guns N' Roses)
August 25 – Vivian Campbell, rock guitarist (Def Leppard)
September 26 – Tracey Thorn, English singer, songwriter and writer.
October 3 – Tommy Lee, drummer (Mötley Crüe)
October 5 – Ken Noda, concert pianist and composer
October 12 – Chris Botti, jazz trumpeter
October 15 – Mark Reznicek, alternative rock drummer (Toadies)
October 16
Flea, American-Australian actor and rock bassist (Red Hot Chili Peppers)
Dmitri Hvorostovsky, operatic baritone (d. 2017)
October 25 – Chad Smith, rock drummer (Red Hot Chili Peppers)
November 1
Magne Furuholmen, Norwegian rock keyboardist (a-ha)
Anthony Kiedis, American lead singer of Red Hot Chili Peppers
November 2
Ron McGovney, American rock bassist (Metallica)
Graham Waterhouse, English composer
November 3 – Marilyn, born Peter Robinson, pop vocalist
November 9 – Steve "Silk" Hurley, house-music producer and club DJ
November 11
Mic Michaeli, Swedish rock keyboardist (Europe)
James Morrison, Australian musician
November 12 – Brix Smith, American singer and guitarist (The Fall and The Adult Net)
November 18 – Kirk Hammett, lead guitarist of Metallica
November 20 – Peng Liyuan, Chinese folk singer and First Lady
November 21 – Steven Curtis Chapman, American Christian music singer-songwriter
November 27
Charlie Benante, Anthrax
Mike Bordin (Faith No More)
November 28 – Matt Cameron (Soundgarden, Pearl Jam)
December 4 – Vinnie Dombroski (Sponge)
December 5 – José Cura, Argentine tenor
December 8 – Marty Friedman (Megadeth)
December 25 – Francis Dunnery, Lead singer, It Bites
December 28 – Michel Petrucciani, French musician (d. 1999)
December 31 – Jennifer Higdon, American composer
Deaths
January 29 – Fritz Kreisler, violinist, 86
February 5 – Jacques Ibert, composer, 71
February 7 – Roy Atwell, American actor, comedian and composer, 83
February 17 – Bruno Walter, conductor, 85
February 22 – Attila the Hun, calypso singer, 69
March 24 – Jean Goldkette, jazz musician, 69
April 10 – Stuart Sutcliffe, former member of The Beatles, 21 (cerebral paralysis caused by a brain hemorrhage)
May 24 – Cloe Elmo, operatic contralto, 52
May 27 – Egon Petri, pianist, 81
June 12 – John Ireland, pianist and composer, 82
June 13 – Sir Eugene Aynsley Goossens, conductor, 69
June 15 – Alfred Cortot, pianist and conductor, 84
July 11 – René Maison, operatic tenor, 66
July 12 – Roger Wolfe Kahn, bandleader, 54 (heart attack)
July 25 – Christie MacDonald, actress and singer, 87
August 19 – Emilius Bangert, composer and organist, 79
September 6
Hanns Eisler, composer, 64
Dermot Troy, lyric tenor, 35 (heart attack)
October 6 – Solomon Linda, Zulu musician, 53
October 15 – Joseph Noyon, French organist and composer, 74
November 19 – Clara Clemens, concert contralto and daughter of Mark Twain, 88
December 7 – Kirsten Flagstad, operatic soprano, 67
December 13 – Harry Barris, US singer, composer and pianist, 57 (alcohol-related)
December 22 – Roy Palmer, jazz trombonist, 70
December 31 – Bella Alten, operatic soprano, 85
date unknown – Palladam Sanjiva Rao, flautist and Carnatic musician
Awards
Eurovision Song Contest
Eurovision Song Contest 1962: Un premier amour, sung by Isabelle Aubret for France (music by Claude-Henri Vic, text by Roland Stephane Valade)
Grammy Awards
Grammy Awards of 1962
Ivor Novello Awards
Best-Selling A-Side – The Tornados, "Telstar"
Tony Osborne
See also
List of Billboard Hot 100 number-one singles of 1962
References
20th century in music
Music by year
|
66771432
|
https://en.wikipedia.org/wiki/Omori%20%28video%20game%29
|
Omori (video game)
|
Omori (stylized as OMORI) is a 2020 role-playing video game developed by indie studio Omocat. Based on the director's webcomic series, it was released in December 2020. Prominently featuring concepts such as anxiety and depression, the game has psychological horror elements. In the story, the player controls a boy named Sunny and his dream world alter-ego Omori. They explore both the real world and the surreal dream world to overcome their fears and secrets. How they interact depends on choices made by the player, resulting in one of several endings. The game's turn-based battle system includes unconventional status effects based on the characters' emotions.
After a successful Kickstarter campaign, the game was delayed numerous times, and experienced several development difficulties. It was finally released for Microsoft Windows and macOS six years after its initial funding, and the developers also announced plans for a Japanese translation as well as ports to Nintendo Switch, PlayStation 4, and Xbox One. Omori was acclaimed by critics, who lauded it for its graphics, narrative elements, soundtrack, and depiction of anxiety and depression, favorably comparing it to EarthBound and Yume Nikki. The game went on to be nominated for several awards, winning DreamHack's "Daringly Dramatic" category in 2021.
Gameplay
Omori'''s gameplay is inspired by traditional Japanese role-playing games. The player controls a party of four characters: Omori, Aubrey, Kel, and Hero, each with their own skills in battle and the overworld.
When exploring the overworld, the game is played from a top-down perspective. It features side-quests and puzzles for the player to solve, which allow them to gain rewards and skills. Weapons and items which benefit the party can be obtained throughout the game, including via purchasing them using the game's currency, Clams. Outside of battle, the party can heal and save by encountering a picnic blanket, associated with Omori's older sister Mari.
Battles are played out in a turn-based format, where each party member performs a move. After attacking, party members can work together to perform "follow up" attacks. Characters and enemies have heart, which functions as health points; if damage is taken, it decreases, and if it reaches zero, the character is defeated and turns into toast. The juice meter is used to perform skills, special abilities which aid in battle.
Unlike most role-playing games, status effects are based on a three-pointed emotion system. A party member or opponent's emotion can change throughout the course of a battle, usually due to moves by another party member or enemy. Neutral is the baseline and has no effects, Angry increases attack but lowers defense, Sad increases defense but lowers speed, and Happy increases speed but lowers accuracy. Emotions are either strong or weak against each other – Happy beats Angry, Angry beats Sad, and Sad beats Happy. Additionally, higher-intensity variants of each emotion also exist.
Plot
The titular main character, Omori, awakens in the "White Space", a small white room he has lived in "for as long as [he] can remember." He opens a door and enters the vibrant world of "Headspace", where he meets his older sister Mari, and his friends Aubrey, Kel, Hero, and Basil. They look through shared memories in Basil's photo album and they decide to head to his house, although Mari decides to stay behind. Along the way, the album is damaged when Kel and Aubrey scuffle. Upon seeing an unfamiliar photo fall from it, Basil panics, and Omori is suddenly teleported back to White Space alone. He stabs himself with his knife, revealing the previous events to be the dreams of a teenage boy, Sunny.
Waking up in bed, Sunny discovers he is moving out in three days and goes downstairs for a midnight snack. Confronted by a nightmarish hallucination symbolizing his fear, he dispels it by calming down and returns to bed with his steak knife. Awakening once again in White Space, Omori reunites with Aubrey, Kel, and Hero, and the four learn that Basil has gone missing. Deciding to rescue him, they travel to various parts of Headspace to search for him, with Mari helping along the way. The group gradually gets distracted by various situations they encounter, and their memories of Basil and their goal of rescuing him slowly disappear.
Meanwhile, in the waking world, Mari had committed suicide four years ago, which led to the friend group diverging. Although Kel and Hero managed to recover somewhat emotionally, Sunny became an estranged shut-in, Aubrey left after feeling betrayed by the group's apparent indifference to Mari's death, and Basil became neurotic and paranoid. Kel knocks on Sunny's door in an attempt to reconnect one last time. The player can either ignore Kel or answer the door; choosing differently can trigger different routes, if they choose the former, Sunny stays inside for the remaining three days, doing chores and focusing on his dreams instead of reconciling.
If the latter option is chosen, Sunny and Kel discover Aubrey attacking Basil. They discover that she stole Basil's real-life photo album, ostensibly to stop him from vandalizing it. After fighting Aubrey again and retrieving the album, they return it to Basil with some photos missing, but he lets Sunny keep it. While eating dinner together, Basil is suddenly mortified to learn of Sunny's impending departure, revealing that he has similar hallucinations. In another fight the next day, Aubrey accidentally pushes Basil into a lake. Sunny tries to rescue him, and both are saved from drowning by the arrival of Hero. In the dream world, Omori and his friends return to Basil's now-dilapidated house, and he is transported to the more disturbing "Black Space". Basil appears many times within it, repeatedly attempting to talk to him about something before dying gruesomely. In the final room, Omori kills Basil, placing himself atop a throne of massive, red hands.
On the last day before Sunny's departure, the others reconcile with Aubrey and find the missing photos. Coming to terms with Mari's death, they decide to spend their final night together in Basil's house, even though he refuses to exit his room. That night, Sunny confronts the truth in his dreams: during an argument, he killed Mari by accidentally pushing her down the stairs. In denial that Sunny did it, Basil helped frame Mari's death as a suicide by hanging her corpse. Afterward, they looked back and saw an open eye staring back at them, shaping their subsequent hallucinations. While Basil was consumed by guilt and self-loathing, Sunny's suicidal depression made him create Headspace and his dream persona Omori to mask his trauma. To hide the truth, Omori reset Headspace every time their memories escaped from Black Space. Sunny wakes up in the middle of the night; the player can either choose to enter Basil's room to confront him about Mari's death or head back to sleep.
Endings
If the player answers Kel, then confronts Basil on the final day, Sunny and a mentally unstable Basil attack and fight each other, where in the midst of the fight Sunny gets stabbed in the eye by Basil using his garden shears and both of the boys pass out. While unconscious, Sunny recalls his memories with Mari and his friends and faces Omori. Refusing to die, Omori defeats him and the player encounters a game over screen.
If the player opts to try again, Sunny gets up and plays the duet with Mari that was planned for their recital. Omori hugs him and disappears. In the real world, Sunny wakes up in the hospital that he and Basil were sent to, and heads to the latter's bed. While surrounded by their friends, it is implied that Sunny tells them the truth about Mari's death. Additionally, if the player watered Basil's garden daily in Headspace, an after-credits scene will show Basil waking up in the hospital. He and Sunny smile at each other, and the hallucinations disappear from both boys.
Should the player choose not to continue, Sunny disappears rather than Omori. Waking up in the hospital, he commits suicide by jumping off the balcony.
Alternatively, if the player ignores Basil on the final day, Sunny and his friends will wake up to discover that Basil has committed suicide. Depending on the player's choice, Sunny can then either kill himself with his knife or move away with his guilt still unabated as sirens ring out in the distance. If the player initially chooses to remain inside and avoid Kel, only a variant of this ending is available.
Development Omori was developed over the course of six and a half years, directed by pseudonymous artist Omocat. It is based on , a webcomic Tumblr blog Omocat created to "help [them] cope with [their] problems during a confusing part of [their] life." Initially planned as a graphic novel, they switched its medium to a video game to enable the audience to make choices in the story. For the game engine, they chose RPG Maker, as they deemed it important to support an accessible platform and community.
A Kickstarter campaign was launched in 2014, and was successfully funded within one day, with an initial projected release date of May 2015. A Nintendo 3DS port was promised as a stretch goal, but ultimately never came to fruition due to the discontinuation of the console; backers were instead offered a Nintendo Switch port. To aid the game's creation, Omocat hired several additional team members, including an RPG Maker expert, but still had a goal of keeping the team size small. Initially, they enlisted their musician friends Space Boyfriend and Slime Girls to help with the soundtrack; after being inspired by bo en's "My Time" and coming up with the idea of hidden music tracks, they contacted him as well.
As development continued, the team had to change their version of the RPG Maker engine, using this opportunity to refine the game's visual style, story, and gameplay. After crowdfunding money was exhausted, they relied on merchandise sales to continue development. The game would be delayed into 2019 and early 2020, but would again miss both targets.
Later in 2020, Omori received its final release date of December 25. It was initially released on Microsoft Windows and macOS. It was announced during an Indie World presentation in December 2021 that a Nintendo Switch version will release in spring 2022. The PlayStation 4, and Xbox One version release dates are yet to be announced.
Reception Omori received generally favorable reviews, with the PC version earning an aggregated score of 87 out of 100 on Metacritic. PC Gamer reviewer Rachel Watts praised both its combat and gameplay, saying the game had "all the makings of being a modern cult classic". Patrick Hancock of Destructoid stated that he didn't "know the last game that really hit me so emotionally like [it] did", but criticised many gameplay elements, stating that they could ruin the experience for some players.
Multiple publications positively reviewed the game's depiction of anxiety and depression, with Rock Paper Shotgun reviewer Kat Bailey comparing it to her real-life experiences. According to her, the game managed to take overused themes regarding the subject and create a "memorable darkness". Watts stated that the game "captures this sentiment [of overcoming anxiety] masterfully", but criticised some parts of the game for being too dark.
A majority of reviewers praised the game's writing and tone, comparing it to games such as EarthBound, Undertale, and Yume Nikki. Writing for Wired magazine, reviewer Julie Fukunaga commended the depth and psychological themes of the narrative, stating that "it is in this medium that Omori thrives". Hancock praised the "juxtaposition" of serious and discomfiting themes with whimsical moments, stating he sometimes thought of the game's jokes "on a weekly basis".
Reviewers' opinion of the game's combat varied. Hancock criticised the lack of strategical depth, stating that he "found a strategy that worked and basically just repeated it ad nauseam", and claiming that the combat was "hardly necessary". Opposingly, Bailey praised the game's "well-executed" combat and "difficult" bosses, stating that they helped break up some of the dungeons. In her review, Rachel Watts complimented the way the game's abilities made the party feel like a cohesive unit.
The art direction also received positive reactions. Watts praised the art direction of the monsters, stating the mix of different art styles "really heightens the horror". The "anime-style cut-ins" were praised by Bailey, who called them "surprisingly well-animated". Despite his criticism of the game's battles, Hancock stated he often anticipated them due to the artstyle, calling it "nothing short of phenomenal".
Awards Omori'' received two Honorable Mentions at the 2021 Independent Games Festival. It was also nominated for three categories in DreamHack's 2021 "Dreamies" awards, winning the "Daringly Dramatic" prize.
Notes
References
External links
Official website
2020 video games
Crowdfunded video games
Indie video games
Kickstarter-funded video games
Role-playing video games
RPG Maker games
Single-player video games
MacOS games
Nintendo Switch games
Windows games
PlayStation 4 games
Video games about mental health
Video games developed in the United States
Video games scored by Calum Bowen
Xbox One games
Psychological horror games
|
17512141
|
https://en.wikipedia.org/wiki/VLAN%20hopping
|
VLAN hopping
|
VLAN hopping is a computer security exploit, a method of attacking networked resources on a virtual LAN (VLAN). The basic concept behind all VLAN hopping attacks is for an attacking host on a VLAN to gain access to traffic on other VLANs that would normally not be accessible. There are two primary methods of VLAN hopping: switch spoofing and double tagging. Both attack vectors can be mitigated with proper switch port configuration.
Switch spoofing
In a switch spoofing attack, an attacking host imitates a trunking switch by speaking the tagging and trunking protocols (e.g. Multiple VLAN Registration Protocol, IEEE 802.1Q, Dynamic Trunking Protocol) used in maintaining a VLAN. Traffic for multiple VLANs is then accessible to the attacking host.
Mitigation
Switch spoofing can only be exploited when interfaces are set to negotiate a trunk. To prevent this attack on Cisco IOS, use one of the following methods:
1. Ensure that ports are not set to negotiate trunks automatically by disabling DTP:
Switch (config-if)# switchport nonegotiate
2. Ensure that ports that are not meant to be trunks are explicitly configured as access ports
Switch (config-if)# switchport mode access
Double tagging
In a double tagging attack, an attacker connected to an 802.1Q-enabled port prepends two VLAN tags to a frame that it transmits. The frame (externally tagged with VLAN ID that the attacker's port is really a member of) is forwarded without the first tag because it is the native VLAN of a trunk interface. The second tag is then visible to the second switch that the frame encounters. This second VLAN tag indicates that the frame is destined for a target host on a second switch. The frame is then sent to the target host as though it originated on the target VLAN, effectively bypassing the network mechanisms that logically isolate VLANs from one another.
However, possible replies are not forwarded to the attacking host (unidirectional flow).
Mitigation
Double Tagging can only be exploited on switch ports configured to use native VLANs. Trunk ports configured with a native VLAN don't apply a VLAN tag when sending these frames. This allows an attacker's fake VLAN tag to be read by the next switch.
Double Tagging can be mitigated by any of the following actions (Incl. IOS example):
Simply do not put any hosts on VLAN 1 (The default VLAN). i.e., assign an access VLAN other than VLAN 1 to every access port
Switch (config-if)# switchport access vlan 2
Change the native VLAN on all trunk ports to an unused VLAN ID.
Switch (config-if)# switchport trunk native vlan 999
Explicit tagging of the native VLAN on all trunk ports. Must be configured on all switches in network autonomy.
Switch(config)# vlan dot1q tag native
Example
As an example of a double tagging attack, consider a secure web server on a VLAN called VLAN2. Hosts on VLAN2 are allowed access to the web server; hosts from outside VLAN2 are blocked by layer 3 filters. An attacking host on a separate VLAN, called VLAN1(Native), creates a specially formed packet to attack the web server. It places a header tagging the packet as belonging to VLAN2 under the header tagging the packet as belonging to VLAN1. When the packet is sent, the switch sees the default VLAN1 header and removes it and forwards the packet. The next switch sees the VLAN2 header and puts the packet in VLAN2. The packet thus arrives at the target server as though it was sent from another host on VLAN2, ignoring any layer 3 filtering that might be in place.
See also
Private VLAN
References
Computer network security
Ethernet
|
44130382
|
https://en.wikipedia.org/wiki/William%20Gill%20%28sea%20captain%29
|
William Gill (sea captain)
|
William Gill (1795 – 25 January 1858) was a Manx merchant navy officer who served as commanding officer of numerous Isle of Man Steam Packet Company vessels. Gill was the first recognised captain of the line, retiring with the rank of Commodore.
He is also known as the captain who first charted an approach to the (then) treacherous River Mersey, which subsequently became known as the Victoria Channel.
Early life
William Gill was born in Ramsey, Isle of Man in 1795. Upon finishing his education he was apprenticed to a ship's carpenter, but his ambition was to go to sea.
Career
From 1814 Capt. Gill commanded vessels trading between the Isle of Man, Scotland, England and Ireland. Prior to the introduction of steam, he was Master of the clipper packets which sailed between Douglas and Liverpool. Such vessels he commanded at this time included the Earl St. Vincent, the Douglas, the Mona Castle and the Duchess of Atholl.
Captain Gill was generally regarded to have possessed a genial social nature and frank and obliging manner. This rendered him an exceedingly popular officer who proved to be a great favourite with his crew and passengers alike. He was known to the poet T.E. Brown who said of Gill: "He bore the reputation of a fine commander, a true modest gentleman and sailor."
Isle of Man Steam Packet Company
Captain Gill's reputation led to his appointment as Master of the Isle of Man Steam Packet Company's new steamer Mona's Isle when service commenced in August 1830.
At that time the St George Steam Packet Company were the primary operators on the route with their vessel the Sophia Jane under the command of Lieutenant Tudor, RN, but the ship was very unpopular in terms of comfort and reliability.
The onus therefore fell upon Capt. Gill and the Mona's Isle to operate an efficient and reliable service, with comfort of the passengers also to be of a high priority. Unlike the Sophia Jane the Mona's Isle had been designed primarily to shelter passengers and had spacious and comfortable cabins.
On Monday, 16 August 1830, Mona's Isle sailed for Liverpool. The Sophia Jane sailed at the same time and reached Liverpool one and a half minutes ahead.
On Wednesday, 18 August, a similar race took place back to Douglas with a similar result. But on Friday, 20 August, returning from Liverpool, Mona's Isle came in 40 minutes ahead. The pattern was established and Sophia Jane was regularly beaten, on one occasion in a gale, by over three hours.
The early defeats were probably caused by the fact that Mona's Isle's new engine took time to run in and full speed was not attainable at first. Mona's Isle, however, had proved herself capable of travelling between Liverpool and Douglas in eight hours at a speed of .
The St George Company engaged in a price-cutting war, and in September withdrew the Sophia Jane and replaced her with their largest and fastest steamer, the St. George. However, Mona's Isle won the first race largely because of the astuteness of Capt. Gill.
Seeing a south-westerly gale developing, he had the coal and cargo moved to the windward side of the vessel, to prevent the windward paddle lifting out of the water.
By October 1830, Mona's Isle had established herself as the principle steamer between Liverpool and Douglas.
On Friday 19 November 1830, under the command of Lieutenant John Tudor RN, the St George arrived in Douglas from Liverpool with mail and passengers.
Once her passengers and mail were unloaded, the St George proceeded to take her anchorage in the vicinity of Conister Rock using the fixed chain cable which had been secured for the task.
The night was stormy, with strong gusts of wind from the southwest which increased in ferocity as the wind veered to the southeast on the morning of 20 November. At 05:00hrs the chain cable holding the St George began to give way and she began to drive in between the Pollock and Conister rocks.
Through the efforts of Sir William Hillary, founder of the Royal National Lifeboat Institution, the crew of the St. George were saved.
Capt. Gill on seeing the predicament of the St George was able to break away from his mooring and put to sea, thus avoiding a similar fate.
By 1832 the Directors of the Isle of Man Steam Packet Company were becoming increasingly concerned about using the Mona's Isle in winter weather. A second vessel, the Mona, was ordered to meet this task and entered service initially serving Whitehaven before replacing the Mona's Isle on the main Liverpool service in October of that year.
By this time, after seeing off the competition of the St. George Company, the Isle of Man Steam Packet Company had achieved the first reliable steamship service between the Isle of Man and Liverpool and consequently further ships were ordered for service with the line, with Capt. Gill raising to the rank of Commodore and taking initial command of each new vessel in turn.
The Mona was followed by the much larger and more powerful Queen of the Isle in 1834, the King Orry in 1842, the Ben-my-Chree in 1845 and the Tynwald in 1846 which was to be Capt. Gill's final command.
Captain Gill's understanding of the winds, currents and tides between the Isle of Man and Liverpool was of particular renown and he gained a reputation as a fearless and daring commander and ultimately one of the most successful, rarely known to turn back in heavy weather.
It was said that he had on several occasions left the Port of Liverpool when no other commander would, and that during his time at sea not one single life was lost from any vessel placed under his charge.
However, in 1835 he was dismissed by the directors of the Isle of Man Steam Packet Company for refusing to go to sea when his brother was dying. The Company's shareholders however would not accept his dismissal and after holding a meeting to investigate the matter he was re-instated as a Master within the Company. The shareholders went further and sacked the directors whom they accused of "injudicious management of the Company's affairs."
The dismissed directors sought to establish a rival shipping company to the Isle of Man Steam Packet and acquired a 300-ton steamer which they named Monarch. And so set against the Queen of the Isle a new series of races on the Douglas - Liverpool route commenced. As was the case with the St George Company the competition was seen off by the Isle of Man Steam Packet Company, in 1847 the Monarch Company went into liquidation and their vessel was sold.
On Friday 31 January 1840 Captain Gill was presented with an award of five guineas together with a vote of thanks (with a further five guineas distributed amongst the crew of the Mona's Isle) by the Liverpool Shipwreck and Humane Society in recognition for their part in the rescue of the crew of the barque Corsair.
The Corsair had run aground on the Jordan Flats in the Mersey Estuary, thereby placing her crew in considerable peril. On seeing the distress signal being flown from the Rock Fort at New Brighton, Capt. Gill was able to take the lifeboat Magazine in tow, placing her to the windward of the Corsair thus enabling the crew of the lifeboat to perform the rescue.
Charting the Victoria Channel
Whilst a channel had existed for the navigation of ships into the Port of Liverpool, this channel, the Rock Channel, was only available for use at high tides and therefore vessels could wait many hours at anchor before being able to enter the port.
With the increasing commercial trade into and out of Liverpool coming with the advent of the steamship, various attempts were made to chart a safe navigable channel through the south eastern portion of Liverpool Bay and into the River Mersey at all states of the tide.
According to a crew member of Capt. Gill's, John Bell, who began his service as a deck boy on the Queen of the Isle in 1836, the task was something which Capt. Gill went about in a meticulous way. Bell is recorded as saying that Capt. Gill would be always taking various bearings from his positions to places on the shore, such as the Leasowe Castle and the Beacon on Bidston Hill. A record of the depth of the water at various states of the tide was found by two sailors, one port and one starboard using a lead line, and this would be logged by Capt. Gill. Another part of the arduous task would require Capt. Gill to lower his anchor some two or three feet below the draught of his steamer and, dragging this with him, let it go when he got nearly ashore on a sand-bank. It was in this way that he was able to discover the channel which was to make the modern shipping fortunes of Liverpool.
Presentation
On the occasion of Capt. Gill's retirement, a complete solid silver breakfast and tea service; manufactured by Joseph Mayer of Liverpool, and which consisted of a full-sized coffee-pot, tea pot, sugar basin and cream jug; a silver chased toast rack, four very richly-chased candlesticks, a silver butter cooler with cover and stand, 12 silver teaspoons, sugar tongs and two very elegant butter knives were presented to Capt. Gill at a dinner held in is honour at the Castle Mona, Douglas, Isle of Man on Wednesday June 16, 1852. In addition Capt. Gill also received a purse of 100 sovereigns.
On the top of the coffee and tea pots were two emblems, one representing that for the sailing vessels, being formed of a rudder, sail, and block grouped together, the other consisting of a large paddle wheel, funnel and steering-wheel.
On the coffee pot was inscribed, under the figure of a yacht, the names of the sailing vessels commanded by Captain Gill, and under a steam vessel the names of the Mona's Isle, Queen of the Isle, King Orry, Ben-my-Chree and Tynwald, the steamers which had been under his charge. In addition to the silver articles there were three handsome papier mache waiters and a complete service of china in white and rich gold. The silver article, had the initials W. G. upon them, with the principal inscription "To Captain William Gill, the discoverer of the Victoria Channel into Liverpool."
In this manner, therefore, did Liverpool express gratitude for the new Channel.
Retirement
Captain Gill retired from the Isle of Man Steam Packet Company in 1852. Through public subscription he received a silver inscribed plate commemorating his charting of the Victoria Channel and a purse of 100 guineas. However, he sustained the loss of a large proportion of his wealth following the failure of Joint Stock Bank and the Bank of Messrs Holmes, but is recorded as still having retired in a comfortable manner.
Having only recently retired he was enticed back to sea the following year to assist in the establishment of a small shipping line in his native Ramsey. The company had built a steamer which they called the Manx Fairy and Capt. Gill, at the special request of the shareholders, took command of her on her first trip "in order that her steaming and sailing qualifications might be fairly tried under a commander of such great experience of coasting steam navigation." This was to be Capt. Gill's last triumph, the Manx Fairy steaming out of Liverpool at the same time as the Isle of Man Steam Packet's new flag ship Mona's Queen, which she beat to Douglas by 8 minutes in a passage time of 5 hours 30 minutes.
Death
It was said that for the last two years of his life Capt. Gill was constantly indoors, and although it is said that he continued to enjoy the company of close friends he avoided local society. He also was said to have been badly affected by the loss of his wife, Elizabeth, which was then followed by the loss of his only child, a daughter, Margaret.
Captain William Gill died aged 63 at his home in Harris Terrace, Douglas, on 25 January 1858. His body was interred with that of his wife and daughter at Braddan Parish Cemetery. In 1930 when the Isle of Man Steam Packet Company celebrated its centenary his grave was reconditioned by the Company.
References
English sailors
People from Ramsey, Isle of Man
Steamship captains
1795 births
1858 deaths
British Merchant Navy officers
Manx culture
History of Liverpool
|
16374951
|
https://en.wikipedia.org/wiki/Little%20Brother%20%28Doctorow%20novel%29
|
Little Brother (Doctorow novel)
|
Little Brother is a novel by Cory Doctorow, published by Tor Books. It was released on April 29, 2008. The novel is about four teenagers in San Francisco who, in the aftermath of a terrorist attack on the San Francisco–Oakland Bay Bridge and BART system, defend themselves against the Department of Homeland Security's attacks on the Bill of Rights. The novel is available for free on the author's website under a Creative Commons license (CC BY-NC-SA), keeping it accessible and remixable to all.
The book debuted at No. 9 on The New York Times Best Seller list, children's chapter book section, in May 2008. As of July 2, it had spent a total of six weeks on the list, rising to the No. 8 spot. Little Brother won the 2009 White Pine Award, the 2009 Prometheus Award. and the 2009 John W. Campbell Memorial Award. It also was a finalist for the Hugo Award for Best Novel. Little Brother received the Sunburst Award in the young adult category.
The New York Times says, Little Brother' isn't shy about its intent to disseminate subversive ideas to a young audience." The novel comes with two afterword essays by cryptographer and computer security specialist Bruce Schneier, and hacker Andrew "bunnie" Huang, and has a bibliography of techno-countercultural writings, from Jack Kerouac's "On the Road" to Schneier's "Applied Cryptography".
Hacker Peiter 'Mudge' Zatko stated that the book is now used as training material for new NSA recruits in order to give them a different point of view.
Characters
Marcus Yallow – Main protagonist, a 17-year-old high school student who enjoys understanding technology and building his own custom devices. He is the leader of his foursome of friends.
Darryl Glover – Marcus' best friend who attends the same high school as Marcus and is Marcus' second-in-command and the "details man" of the group. He has had a crush on Van for years.
Vanessa Pak (Van) – 17-year-old Korean American girl who attends a nearby all-girls Catholic school, she is the "ideas" person of the group. She has been attracted to Marcus for a long time, but doesn't admit it until the end of the book. Her parents managed to escape from North Korea.
Jose Luis Torrez (Jolu) – A brilliant high school student at a nearby Catholic school, he is the technical member of the group. Even though everyone in the group is technically competent, he is the most technology-oriented, doing his own programming, and working for a local ISP. He is somewhat vain and seems to work at being cool.
Drew Yallow – Marcus' father who has a stormy relationship with Marcus through most of the book. Scared by the thought of Marcus having died during the bombing because Marcus has been missing for three days, he supports the tactics that the DHS employs. This leads to many arguments with Marcus despite his former mindset that was similar to Marcus'.
Lillian Yallow – Marcus' mother, British expatriate, who helps newly immigrated Britons integrate into American life. She and Marcus have a strong bond and seem to think alike. She is a strong woman and helps mediate Marcus' fights with his father.
Charles Walker – Also a student at the same high school as Marcus and Darryl, he is the antithesis of Marcus. He is a bully, a brown noser and a snitch. He and Marcus have a long-standing feud and detest each other.
Carrie Johnstone (Severe Haircut Lady) – Main antagonist and in charge of the DHS that is monitoring San Francisco. She is a cold sadistic woman to whom the ends always justify the means and enjoys abusing her power. It has been claimed that she is based on Theresa May.
Angela Carvelli (Ange) – She attends the same high school as Van and develops into Marcus' love interest, when she first meets him at a party. She is an active member of the Xnet and is very strong-willed, and independent. She's known to use pepper spray as a condiment.
Ms. Galvez – A social studies teacher at Cesar Chavez High School, she is seen as a dedicated teacher and an independent thinker. She seems to be the only teacher that Marcus respects at his school. She tends to agree with Marcus on topics of security and Marcus helps her with contacting her brother, who's an overseas soldier, via internet.
Barbara Stratford – Investigative reporter for the Bay Guardian, who helps Marcus expose what the DHS has been doing.
Masha – A DHS operative who attempts to help Marcus escape the city. Marcus meets her briefly in the beginning of the novel when she threatens to expose him for skipping school while ARGing. He also meets up with Masha in the end in the midst of their escape, he finds a photo of his friend Darryl and his position on running away is changed. Therefore, he escapes from Masha after beating her up and smashing her fingers in a truck door.
Zeb – A former detainee of DHS's "Gitmo-by-the-Bay", he manages to escape and attempts to disappear after contacting Marcus about Darryl and the current status of the prison.
Plot
Marcus Yallow is a 17-year-old hacker/techno whiz from San Francisco. One day Marcus and his best friend Darryl play truant from school to play an Alternate Reality Game. A terrorist attack is perpetrated against the city, and the four are captured and detained under suspicion of terrorism.
After a series of interrogations that take place over a period of six days, Marcus, Jolu, and Vanessa are finally released; Darryl's whereabouts are unknown. The DHS tells Marcus that they will be monitoring his actions and moves because he is still a suspect. Marcus is "infuriated at how his civil rights [are] ignored."
In response to the increasing surveillance of the city and its citizens, Marcus creates Xnet, a private mesh network intended to allow people to communicate freely while fighting "the surveillance state." Through XNet, using his pseudonym 'Mik3y', Marcus encourages his peers to rebel against the DHS surveillance.
While introducing a group to Cryptography during a key signing party, Marcus meets Ange, and shortly thereafter they begin to date.
When a former prisoner who was held by the DHS tells Marcus that Darryl is still alive, Marcus tells a reporter and his family about his actions taken against the DHS. The journalist's story is then published and the DHS takes Marcus into custody again. On order from the governor, California highway patrol troopers raid the DHS compound during a waterboarding interrogation and arrest the DHS agents. Darryl is subsequently freed and Marcus, after his parents have to pay his bail to make sure he doesn't go to prison, finally returns to his life the way it was before the terrorist attacks.
Major themes
Little Brother has major themes that, according to some, are too serious for a young adult novel. In an interview, the Journal of Adolescent & Adult Literacy asked Doctorow about his "potentially heavy themes, including paranoia, loyalty, sex, torture, [and] fear" and when his editing staff asked to censor the themes, he replied, "Oh, no."
The Hollywood Reporter remarked, "The book tackles many themes, including civil liberties and social activism".
According to journalist April Spisak's article on "What Makes a Good Young Adult Dystopian Novel?" Spisak claims, "Cory Doctorow’s Little Brother probably represents the purest example on the list—modern technology meets classic dystopic elements—even while the book itself is part instructional guide, part love story, and part rant at the increasingly dictatorial powers-that-be that consider safety at any cost a reasonable exchange. Small personal victories for the protagonist and his friends are present, but the power of Big Brother is hardly tempered by their work, and the folks who tangled with the government are all permanently scarred by the encounter."
The book has also been characterized as "[expressing] astonishment, fear, uncertainty, shame, and guilt" and addressing "issues of political authority, social order, individual freedom and electronic security."
Background
Little Brother takes place in the "near future rather than decades or centuries away." Little Brother also makes use of "obvious parallels to Orwellian warnings and post 9/11 policies."
Reception
Novel
Cindy Dobrez in her review for Booklist said that "Doctorow’s novel blurs the lines between current and potential technologies, and readers will delight in the details of how Marcus attempts to stage a techno-revolution. Obvious parallels to Orwellian warnings and post-9/11 policies, such as the Patriot Act, will provide opportunity for classroom discussion and raise questions about our enthusiasm for technology, who monitors our school library collections, and how we contribute to our own lack of privacy."
Kirkus Reviews described it as an "unapologetically didactic tribute to 1984", and called it a "Terrifying glimpse of the future—or the present."
Publishers Weekly said that it was "filled with sharp dialogue and detailed descriptions of how to counteract gait-recognition cameras, RFID's (radio frequency ID tags), wireless Internet tracers and other surveillance devices, this work makes its admittedly didactic point within a tautly crafted fictional framework."
Institute of Public Affairs says that "Doctorow, like many freedom-fighting writers before him likes his women smart and strong. Male or female, freedom-loving writers tend to like writing strong female characters, often protagonists."
News coverage
In 2014, a high school principal in Pensacola, Florida, Michael Roberts, pulled Little Brother from his school's summer reading list because the book is "about questioning authority" and portrays questioning authority "as a positive thing."; however it was kept on the list for advanced placement and grade 11 honors students. Roberts also described Cory Doctorow, a Canadian author living in England, as "an outsider to the George W. Bush administration." In response, his publisher sent 200 copies of the book directly to the school.
Adaptations
Play
In early 2012, it was announced that the novel Little Brother written by Cory Doctorow will be made into a play directed by Josh Costello called Little Brother. The play was augmented with animated video projections, an original score by Chris Houston and original choreography by Daunielle Rasmussen.
Marin Independent said that Little Brother is "required watching!'
Charlie Jane Anders of io9 praised the Little Brother play: "I was lucky enough to catch a preview performance of the Custom Made Theatre Co.'s new stage adaptation of Cory Doctorow's award-winning novel Little Brother the other day—and it was a total marvel. Somehow, writer/director Josh Costello managed to condense the novel down to a two-hour play, without losing any of the impact. If anything, the staged version hits a bit harder than the book, because of the intense, but not overstated, performances."
According to TheatreStorm, "Costello has wisely tightened Doctorow’s book to three main characters. On a nearly empty stage, Costello utilizes video and sound effects superbly, creating multiple San Francisco locations, mass demonstrations, press conferences, online experiences and coaching his actors to create multiple characterizations as necessary. This is the best kind of political theatre. Thought provoking, suspenseful, emotionally real, uncomfortably close to the hard truth."
Film
The novel has also been the subject of a possible movie. The production company AngryFilms has optioned Little Brother "with the aim of translating it to the big screen."
In September 2015, Doctorow announced on his blog that Little Brother had been optioned by Paramount with Don Murphy as the producer.
Dedications
Each chapter of the e-book edition of Little Brother is dedicated to a different bookstore: Bakka-Phoenix (a Toronto sci-fi/fantasy bookstore where Doctorow used to be employed), Amazon.com, Borderlands Books, Barnes & Noble, Secret Headquarters, Powell's City of Books, Books of Wonder, Borders, Compass Books/Books Inc., Anderson's Bookshops, University Book Store at the University of Washington, Forbidden Planet, Books-A-Million, Mysterious Galaxy, Chapters/Indigo Books, Booksmith, Waterstone's, Sophia Books, MIT Press Bookshop, The Tattered Cover, Pages Books, and Hudson Booksellers.
Author
In reference to Little Brother, Cory Doctorow has stated that "the enemy is obscurity, not piracy." His book Little Brother is available on his website for free, which is provided in a variety of formats.
Sequels
On June 20, 2012, Doctorow posted the cover art of the sequel to Little Brother, titled Homeland. An excerpt of the book's opening, set at the Burning Man festival, was posted the next month on the Tor Books website. Homeland was released in hardback, and for download under a Creative Commons license on Doctorow's website, in February 2013.
On September 8, 2020, Doctorow announced that the third book in the Little Brother series, Attack Surface, would be released "in five weeks".
References
External links
Official Book Page on Cory Doctorow's website
A Little Brother related article by Cory Doctorow: Security Literacy: teaching kids to think critically about security
eMusic Q&A: Cory Doctorow about Little Brother
Little Brother cover art gallery at Upcoming4.me
Analysis of Little Brother on Lit React
Little Brother free download provided by Cory Doctorow
(in development)
2008 Canadian novels
Novels about terrorism
Novels by Cory Doctorow
Creative Commons-licensed novels
Novels set in San Francisco
Novels about freedom of speech
Tor Books books
Novels about mass surveillance
Dystopian novels
Novels about cryptography
Books about computer hacking
Libertarian science fiction books
|
24612414
|
https://en.wikipedia.org/wiki/HTC%20HD2
|
HTC HD2
|
The HTC HD2 (also known as the HTC T8585, HTC T9193 and HTC Leo), is a smartphone in the HTC Touch family designed and manufactured by HTC. The HD2 natively runs the Windows Mobile 6.5 operating system, and was released in Europe in November 2009, in Hong Kong in December 2009, and in other regions including North America in March 2010. The phone is the successor to the HTC Touch HD, and is succeeded by the HTC HD7.
History
Rumors of the HTC HD2 began appearing in September 2009. It was codenamed Leo, although a decal on the back cover conflictingly identified it as the Pro.Three (which indicates it may have been intended as a bridge between the HTC Touch Pro and HTC Touch), and the "About" info in Bluetooth as the HD2. The specifications sheet released turned out to be true when the HD2 was launched, with the exception of the listed 320MB of RAM, compared to the final 576MB (448MB available to user) of RAM.
Hardware
It is the first smartphone with a 4.3-inch touchscreen, the first Windows Mobile 6.5 phone with a multitouch capacitive screen and HTC Sense, and the second smartphone with a Qualcomm Snapdragon CPU (the first being the Toshiba TG01). The Snapdragon CPU is clocked at 1 GHz, but automatically underclocks itself to 553 MHz if extra processing power is not needed. Tweaks have been made however, to clock the processor dynamically from 96 MHz to 1.61 GHz.
The HD2 is fitted with an Asahi Kasei AK8976A magnetometer. The magnetometer is used for applications such as the pre-loaded digital compass.
Accessories
HTC sold an optional capacitive stylus pen for the HD2 to aid navigation through the interface. Some Windows Mobile applications were designed to be used with a stylus, rather than finger-touch, and still need a stylus pen to be used effectively.
An extended 'Media' battery was also available officially from HTC. The official unit comes with a replacement battery cover sporting a pull-out metal kickstand which supports the phone in an upright landscape orientation.
The HD2 was sold with a black or brown leather slip-case with a velvet interior in certain countries.
Software
The HTC HD2 runs Windows Mobile 6.5 as its native operating system with Windows CE as its underlying kernel and OS. The HD2 runs HTC Sense as a UI shell on top of Windows Mobile.
Upgrades
The HD2 was originally slated to be upgraded to Windows Phone (then known as Windows Mobile 7). Microsoft rejected it and other Windows Mobile devices, however, due to it not being compliant with the company's hardware requirements for smartphones running Windows Phone, such as a lack of a dedicated two-stage camera button and five hardware buttons on the front as compared to the three supported.
However, developers have successfully ported Windows Phone to the HD2. Microsoft has expressed tacit and subtle approval of such ports, nearing the release of Mango for native Windows Phone devices. Live services were not available to HD2 as the Windows Phone on the HD2 is not activated. It is possible for users to call Microsoft to request an activation key, but the device is not supported as a WP7 phone and being given a code is not guaranteed.
Unlike its sibling, the HD Mini, the HD2 never received an official upgrade to Windows Mobile 6.5.3, the last stable release of Windows Mobile (the HD2 natively runs 6.5.0). However, several developers at XDA Developers prepared unofficial 6.5.3 and 6.5.5 (the latter being the last unstable release of Windows Mobile) ROMs for the HD2.
Modifications
The ability to 'mod' the HTC HD2 and run multiple different operating systems from the NAND flash or SD card has given it an enduring popularity, and this made the HTC HD2 one of the phones that could run the largest number of operating systems in the world.
Android (versions 2.2 Froyo, 2.3 Gingerbread, 4.0.4 Ice Cream Sandwich, 4.1 Jelly Bean, 4.2 Jelly Bean, 4.3 Jellybean, 4.4 Kitkat, 5.0 Lollipop, 6.0 Marshmallow and 7.0 Nougat), Ubuntu, MeeGo and Windows Phone have all been unofficially ported to the HD2. In addition, many customised versions of Windows Mobile are available for the device, with versions 6.1, 6.5, 6.5.3 and 6.5.5 available.
FPSECE (First PlayStation Emulator for Windows CE), a PlayStation emulator for Windows CE devices, was ported to the HD2 in December 2009, a few months after the initial release of the HD2.
In early October 2010, a video was released that appeared to show a HD2 booting into Windows Phone by way of Russian developer Cotulla's MAGLDR tool (a bootloader), which was initially created to allow the booting of Android from the device's NAND flash. As of 13 January 2011, MAGLDR and a Windows Phone 7 ROM are publicly available. Windows Phone Genuine checks prevent access to Windows Live services. A solution to this problem has been found, though the legality of the activation is still not fully known, and is frowned heavily upon by Microsoft.
Windows Phone RTM (Release To Manufacturers) was ported to the HD2 in August 2011, a month after ROM developers at XDA Developers made a successful attempt to run a beta version on the device.
On 23 December 2012, XDA developer zoid created a custom Debian/Ubuntu-based Pentest-focused distribution called ubnhd2 for the HTC HD2.
In December 2012, Windows RT and Windows Phone 8 were ported onto the device as a proof-of-concept; no working builds exist.
On 6 May 2013, an XDA developer successfully ported Firefox OS to the HTC HD2.
In August 2013, a group of developers on XDA successfully ported HTC Sense 5 to the HTC HD2.
In November 2015, XDA Senior Member macs18max successfully ported Android 6.0 Marshmallow to the HTC HD2.
In September 2016, CyanogenMod 14 which is based on Android 7.0 Nougat was ported to the HTC HD2 successfully.
Reception
Commercial reception
When launched in the UK, Vodafone quickly sold all of its stock and developed a backlog of orders, and O2 delayed putting the HD2 on its website so that it could fulfill all orders. Similarly, in the US, the HTC HD2 sold out in most T-Mobile stores within 4 hours and T-Mobile struggled to keep it in stock for several weeks.
Certain T-Mobile locations ran a promotion that stated that iPhone users who traded in their handsets could get anywhere from $100 to $350 off the HD2.
The HTC HD2 became notoriously difficult to get hold of in the UK and Europe. At one point, there was a high level of demand for the product amongst businesses, due to the fact that many have apps that operate solely on the Windows Mobile 6.5 operating system.
See also
TouchFLO 3D
HTC Touch
HTC Touch HD – the predecessor to the HD2.
HTC HD Mini – a variant of the HD2, with lower specs and running Windows Mobile 6.5.3
Pocket PC – the HD2's basic software and hardware platform.
Information appliance
Technological convergence
References
External links
(Europe)
HTC HD2 overview
HTC Introduction video
HTC HD2 technical information and Linux port
HD2
Windows Mobile Professional devices
Mobile phones with user-replaceable battery
Mobile phones introduced in 2009
|
3302657
|
https://en.wikipedia.org/wiki/Digital%20puppetry
|
Digital puppetry
|
Digital puppetry is the manipulation and performance of digitally animated 2D or 3D figures and objects in a virtual environment that are rendered in real time by computers. It is most commonly used in filmmaking and television production, but has also been used in interactive theme park attractions and live theatre.
The exact definition of what is and is not digital puppetry is subject to debate among puppeteers and computer graphics designers, but it is generally agreed that digital puppetry differs from conventional computer animation in that it involves performing characters in real time, rather than animating them frame by frame.
Digital puppetry is closely associated with motion capture technologies and 3D animation, as well as skeletal animation. Digital puppetry is also known as virtual puppetry, performance animation, living animation, live animation and real-time animation (although the latter also refers to animation generated by computer game engines). Machinima is another form of digital puppetry, and Machinima performers are increasingly being identified as puppeteers.
History and usage
Early experiments
One of the earliest pioneers of digital puppetry was Lee Harrison III. He conducted experiments in the early 1960s that animated figures using analog circuits and a cathode ray tube. Harrison rigged up a body suit with potentiometers and created the first working motion capture rig, animating 3D figures in real-time on his CRT screen. He made several short films with this system, which he called ANIMAC. Among the earliest examples of digital puppets produced with the system included a character called "Mr. Computer Image" who was controlled by a combination of the ANIMAC's body control rig and an early form of voice-controlled automatic lip sync.
Waldo C. Graphic
Perhaps the first truly commercially successful example of a digitally animated figure being performed and rendered in real-time is Waldo C. Graphic, a character created in 1988 by Jim Henson and Pacific Data Images for the Muppet television series The Jim Henson Hour. Henson had used the Scanimate system to generate a digital version of his Nobody character in real-time for the television series Sesame Street as early as 1970 and Waldo grew out of experiments Henson conducted to create a computer generated version of his character Kermit the Frog in 1985.
Waldo's strength as a computer generated puppet was that he could be controlled by a single puppeteer (Steve Whitmire) in real-time in concert with conventional puppets. The computer image of Waldo was mixed with the video feed of the camera focused on physical puppets so that all of the puppeteers in a scene could perform together. (It was already standard Muppeteering practice to use monitors while performing, so the use of a virtual puppet did not significantly increase the complexity of the system.) Afterwards, in post production, PDI re-rendered Waldo in full resolution, adding a few dynamic elements on top of the performed motion.
Waldo C. Graphic can be seen today in Jim Henson's Muppet*Vision 3D at Disney's Hollywood Studios in Lake Buena Vista, Florida.
Mike Normal
Another significant development in digital puppetry in 1988 was Mike Normal, which Brad DeGraf and partner Michael Wahrman developed to show off the real-time capabilities of Silicon Graphics' then-new 4D series workstations. Unveiled at the 1988 SIGGRAPH convention, it was the first live performance of a digital character. Mike was a sophisticated talking head driven by a specially built controller that allowed a single puppeteer to control many parameters of the character's face, including mouth, eyes, expression, and head position.
The system developed by deGraf/Wahrman to perform Mike Normal was later used to create a representation of the villain Cain in the motion picture RoboCop 2, which is believed to be the first example of digital puppetry being used to create a character in a full-length motion picture.
Trey Stokes was the puppeteer for both Mike Normal's SIGGRAPH debut and Robocop II.
Sesame Street: Elmo's World
One of the most widely seen successful examples of digital puppetry in a TV series is Sesame Street's "Elmo's World" segment. A set of furniture characters were created with CGI, to perform simultaneously with Elmo and other real puppets. They were performed in real time on set, simultaneously with live puppet performances. As with the example of Henson's Waldo C. Graphic above, the digital puppets' video feed was seen live by both the digital and physical puppet performers, allowing the digital and physical characters to interact.
Disney theme parks
Walt Disney Imagineering has also been an important innovator in the field of digital puppetry, developing new technologies to enable visitors to Disney theme parks to interact with some of the company's famous animated characters. In 2004, they used digital puppetry techniques to create the Turtle Talk with Crush attractions at Epcot and Disney California Adventure Park. In the attraction, a hidden puppeteer performs and voices a digital puppet of Crush, the laid-back sea turtle from Finding Nemo, on a large rear-projection screen. To the audience Crush appears to be swimming inside an aquarium and engages in unscripted, real-time conversations with theme park guests.
Disney Imagineering continued its use of digital puppetry with the Monsters Inc. Laugh Floor, a new attraction in Tomorrowland at Walt Disney World's Magic Kingdom, which opened in the spring of 2007. Guests temporarily enter the "monster world" introduced in Disney and Pixar's 2001 film, Monsters, Inc., where they are entertained by Mike Wazowski and other monster comedians who are attempting to capture laughter, which they convert to energy. Much like Turtle Talk, the puppeteers interact with guests in real-time, just as a real-life comedian would interact with his/her audience.
Disney also uses digital puppetry techniques in Stitch Encounter, which opened in 2006 at the Hong Kong Disneyland park. Disney has another version of the same attraction in Disneyland Resort Paris called Stitch Live!
Military Simulation & Training
Since 2014, the United States Army's Program Executive Office for Simulation, Training, Research, and Instrumentation (PEO STRI), a division of US Army Simulation and Training Technology Center (STTC), has been experimenting with digital puppetry as a method of teaching advanced situational awareness for infantry squads. A single improvisor using motion capture technology from Organic Motion Inc interacted with squads through the medium of several different life-sized avatars of varying ages and genders that were projected onto multiple walls throughout an urban operations training facility. The motion capture technology was paired with real-time voice shifting in order to achieve the effect.
Types of digital puppetry
Waldo puppetry
A digital puppet is controlled onscreen in real time by a puppeteer who uses a telemetric input device known as a Waldo (after the short story "Waldo" by Robert A. Heinlein which features a man who invents and uses such devices), connected to the computer. The X-Y-Z axis movement of the input device causes the digital puppet to move correspondingly.
Motion capture puppetry/performance animation
An object (puppet) or human body is used as a physical representation of a digital puppet and manipulated by a puppeteer. The movements of the object or body are matched correspondingly by the digital puppet in real-time. Motion capture puppetry is commonly used, for example, by VTubers, who rig digital avatars to correspond to the movements of their heads.
Machinima
A production technique that can be used to perform digital puppets. Machinima involves creating computer-generated imagery (CGI) using the low-end 3D engines in video games. Players act out scenes in real-time using characters and settings within a game and the resulting footage is recorded and later edited into a finished film.
References
External links
Animata - Free, open source real-time animation software commonly used to create digital puppets.
Mike the talking head - Web page about Mike Normal, one of the earliest examples of digital puppetry.
Organic Motion LIVE - Commercial digital puppetry technology currently used for simulation & training purposes.
Puppetry
3D computer graphics
Machinima
User interface techniques
|
56641018
|
https://en.wikipedia.org/wiki/Deepfake
|
Deepfake
|
Deepfakes (a portmanteau of "deep learning" and "fake") are synthetic media in which a person in an existing image or video is replaced with someone else's likeness. While the act of faking content is not new, deepfakes leverage powerful techniques from machine learning and artificial intelligence to manipulate or generate visual and audio content with a high potential to deceive. The main machine learning methods used to create deepfakes are based on deep learning and involve training generative neural network architectures, such as autoencoders or generative adversarial networks (GANs).
Deepfakes have garnered widespread attention for their uses in creating child sexual abuse material, celebrity pornographic videos, revenge porn, fake news, hoaxes, bullying, and financial fraud. This has elicited responses from both industry and government to detect and limit their use.
History
Photo manipulation was developed in the 19th century and soon applied to motion pictures. Technology steadily improved during the 20th century, and more quickly with digital video.
Deepfake technology has been developed by researchers at academic institutions beginning in the 1990s, and later by amateurs in online communities. More recently the methods have been adopted by industry.
Academic research
Academic research related to deepfakes is split between the field of computer vision, a subfield of computer science, which develops techniques for creating and identifying deepfakes, and humanities and social science approaches that study the social, ethical and aesthetic implications of deepfakes.
Social science and humanities approaches to deepfakes
In cinema studies, deepfakes demonstrate how "the human face is emerging as a central object of ambivalence in the digital age". Video artists have used deepfakes to "playfully rewrite film history by retrofitting canonical cinema with new star performers". Film scholar Christopher Holliday analyses how the switching out gender and race of performers in familiar movie scences destabilise gender classifications and categories. The idea of "queering" deepfakes is also discussed in Oliver M. Gingrich's discussion of media artworks that use deepfakes to reframe gender, including British artist Jake Elwes' Zizi: Queering the Dataset, an artwork that uses deepfakes of drag queens to intentionally play with gender. The aesthetic potentials of deepfakes are also beginning to be explored. Theatre historian John Fletcher notes that early demonstrations of deepfakes are presented as performances, and situates these in the context of theatre, discussing "some of the more troubling paradigm shifts" that deepfakes represent as a performance genre.
Philosophers and media scholars have discussed the ethics of deepfakes especially in relation to pornography. Media scholar Emily van der Nagel draws upon research in photography studies on manipulated images to discuss verification systems that allow women to consent to uses of their images.
Beyond pornography, deepfakes have been framed by philosophers as an "epistemic threat" to knowledge and thus to society. There are several other suggestions for how to deal with the risks deepfakes give rise beyond pornography, but also to corporations, politicians and others, of "exploitation, intimidation, and personal sabotage", and there are several scholarly discussions of potential legal and regulatory responses both in legal studies and media studies. In psychology and media studies, scholars discuss the effects of disinformation that uses deepfakes, and the social impact of deepfakes.
While most English-language academic studies of deepfakes focus on the Western anxieties about disinformation and pornography, digital anthropologist Gabriele de Seta has analysed the Chinese reception of deepfakes, which are known as huanlian, which translates to "changing faces". The Chinese term doesn't contain the "fake" of the English deepfake, and de Seta argues that this cultural context may explain why the Chinese response has been more about practical regulatory responses to "fraud risks, image rights, economic profit, and ethical imbalances".
Computer science research on deepfakes
An early landmark project was the Video Rewrite program, published in 1997, which modified existing video footage of a person speaking to depict that person mouthing the words contained in a different audio track. It was the first system to fully automate this kind of facial reanimation, and it did so using machine learning techniques to make connections between the sounds produced by a video's subject and the shape of the subject's face.
Contemporary academic projects have focused on creating more realistic videos and on improving techniques. The "Synthesizing Obama" program, published in 2017, modifies video footage of former president Barack Obama to depict him mouthing the words contained in a separate audio track. The project lists as a main research contribution its photorealistic technique for synthesizing mouth shapes from audio. The Face2Face program, published in 2016, modifies video footage of a person's face to depict them mimicking the facial expressions of another person in real time. The project lists as a main research contribution the first method for re-enacting facial expressions in real time using a camera that does not capture depth, making it possible for the technique to be performed using common consumer cameras.
In August 2018, researchers at the University of California, Berkeley published a paper introducing a fake dancing app that can create the impression of masterful dancing ability using AI. This project expands the application of deepfakes to the entire body; previous works focused on the head or parts of the face.
Researchers have also shown that deepfakes are expanding into other domains such as tampering medical imagery. In this work, it was shown how an attacker can automatically inject or remove lung cancer in a patient's 3D CT scan. The result was so convincing that it fooled three radiologists and a state-of-the-art lung cancer detection AI. To demonstrate the threat, the authors successfully performed the attack on a hospital in a White hat penetration test.
A survey of deepfakes, published in May 2020, provides a timeline of how the creation and detection deepfakes have advanced over the last few years. The survey identifies that researchers have been focusing on resolving the following challenges of deepfake creation:
Generalization. High-quality deepfakes are often achieved by training on hours of footage of the target. This challenge is to minimize the amount of training data required to produce quality images and to enable the execution of trained models on new identities (unseen during training).
Paired Training. Training a supervised model can produce high-quality results, but requires data pairing. This is the process of finding examples of inputs and their desired outputs for the model to learn from. Data pairing is laborious and impractical when training on multiple identities and facial behaviors. Some solutions include self-supervised training (using frames from the same video), the use of unpaired networks such as Cycle-GAN, or the manipulation of network embeddings.
Identity leakage. This is where the identity of the driver (i.e., the actor controlling the face in a reenactment) is partially transferred to the generated face. Some solutions proposed include attention mechanisms, few-shot learning, disentanglement, boundary conversions, and skip connections.
Occlusions. When part of the face is obstructed with a hand, hair, glasses, or any other item then artifacts can occur. A common occlusion is a closed mouth which hides the inside of the mouth and the teeth. Some solutions include image segmentation during training and in-painting.
Temporal coherence. In videos containing deepfakes, artifacts such as flickering and jitter can occur because the network has no context of the preceding frames. Some researchers provide this context or use novel temporal coherence losses to help improve realism. As the technology improves, the interference is diminishing.
Overall, deepfakes are expected to have several implications in media and society, media production, media representations, media audiences, gender, law, and regulation, and politics.
Amateur development
The term deepfakes originated around the end of 2017 from a Reddit user named "deepfakes". He, as well as others in the Reddit community r/deepfakes, shared deepfakes they created; many videos involved celebrities’ faces swapped onto the bodies of actresses in pornographic videos, while non-pornographic content included many videos with actor Nicolas Cage’s face swapped into various movies.
Other online communities remain, including Reddit communities that do not share pornography, such as r/SFWdeepfakes (short for "safe for work deepfakes"), in which community members share deepfakes depicting celebrities, politicians, and others in non-pornographic scenarios. Other online communities continue to share pornography on platforms that have not banned deepfake pornography.
Commercial development
In January 2018, a proprietary desktop application called FakeApp was launched. This app allows users to easily create and share videos with their faces swapped with each other. As of 2019, FakeApp has been superseded by open-source alternatives such as Faceswap, command line-based DeepFaceLab, and web-based apps such as DeepfakesWeb.com
Larger companies started to use deepfakes. Corporate training videos can be created using deepfaked avatars and their voices, for example Synthesia, which uses deepfake technology with avatars to create personalized videos. The mobile app giant Momo created the application Zao which allows users to superimpose their face on television and movie clips with a single picture. As of 2019 the Japanese AI company DataGrid made a full body deepfake that could create a person from scratch. They intend to use these for fashion and apparel.
As of 2020 audio deepfakes, and AI software capable of detecting deepfakes and cloning human voices after 5 seconds of listening time also exist.
A mobile deepfake app, Impressions, was launched in March 2020. It was the first app for the creation of celebrity deepfake videos from mobile phones.
Resurrection
Deepfakes technology can not only be used to fabricate messages and actions of others, but it can also be used to revive deceased individuals. On 29 October 2020, Kim Kardashian posted a video of her late father Robert Kardashian; the face in the video of Robert Kardashian was created with deepfake technology. This hologram was created by the company Kaleida, where they use a combination of performance, motion tracking, SFX, VFX and DeepFake technologies in their hologram creation.
In 2020, Joaquin Oliver, victim of the Parkland shooting was resurrected with deepfake technology. Oliver's parents teamed up on behalf of their organization Nonprofit Change the Ref, with McCann Health to produce this deepfake video advocating for gun-safety voting campaign. In this deepfake message, it shows Joaquin encouraging viewers to vote.
There has also been deepfake resurrection of pop cultural and historical figures who were murdered, for example, the member of The Beatles, John Lennon, murdered in 1980.
Techniques
Deepfakes rely on a type of neural network called an autoencoder. These consist of an encoder, which reduces an image to a lower dimensional latent space, and a decoder, which reconstructs the image from the latent representation. Deepfakes utilize this architecture by having a universal encoder which encodes a person in to the latent space. The latent representation contains key features about their facial features and body posture. This can then be decoded with a model trained specifically for the target. This means the target's detailed information will be superimposed on the underlying facial and body features of the original video, represented in the latent space.
A popular upgrade to this architecture attaches a generative adversarial network to the decoder. A GAN trains a generator, in this case the decoder, and a discriminator in an adversarial relationship. The generator creates new images from the latent representation of the source material, while the discriminator attempts to determine whether or not the image is generated. This causes the generator to create images that mimic reality extremely well as any defects would be caught by the discriminator. Both algorithms improve constantly in a zero sum game. This makes deepfakes difficult to combat as they are constantly evolving; any time a defect is determined, it can be corrected.
Applications
Blackmail
Deepfakes can be used to generate blackmail materials that falsely incriminate a victim. However, since the fakes cannot reliably be distinguished from genuine materials, victims of actual blackmail can now claim that the true artifacts are fakes, granting them plausible deniability. The effect is to void credibility of existing blackmail materials, which erases loyalty to blackmailers and destroys the blackmailer's control. This phenomenon can be termed "blackmail inflation", since it "devalues" real blackmail, rendering it worthless. It is possible to repurpose commodity cryptocurrency mining hardware with a small software program to generate this blackmail content for any number of subjects in huge quantities, driving up the supply of fake blackmail content limitlessly and in highly scalable fashion.
A report by the American Congressional Research Service warned that deepfakes could be used to blackmail elected officials or those with access to classified information for espionage or influence purposes.
Pornography
In 2017, Deepfake pornography prominently surfaced on the Internet, particularly on Reddit. As of 2019, many deepfakes on the internet feature pornography of female celebrities whose likeness is typically used without their consent. A report published in October 2019 by Dutch cybersecurity startup Deeptrace estimated that 96% of all deepfakes online were pornographic.
As of 2018, a Daisy Ridley deepfake first captured attention, among others. As of October 2019, most of the deepfake subjects on the internet were British and American actresses. However, around a quarter of the subjects are South Korean, the majority of which are K-pop stars.
In June 2019, a downloadable Windows and Linux application called DeepNude was released which used neural networks, specifically generative adversarial networks, to remove clothing from images of women. The app had both a paid and unpaid version, the paid version costing $50. On 27 June the creators removed the application and refunded consumers.
Politics
Deepfakes have been used to misrepresent well-known politicians in videos.
As of 2018 in separate videos, the face of the Argentine President Mauricio Macri had been replaced by the face of Adolf Hitler, and Angela Merkel's face has been replaced with Donald Trump's.
In April 2018, Jordan Peele collaborated with Buzzfeed to create a deepfake of Barack Obama with Peele's voice; it served as a public service announcement to increase awareness of deepfakes.
In January 2019, Fox affiliate KCPQ aired a deepfake of Trump during his Oval Office address, mocking his appearance and skin color (and subsequently fired an employee found responsible for the video).
During the 2020 Delhi Legislative Assembly election campaign, the Delhi Bharatiya Janata Party used similar technology to distribute a version of an English-language campaign advertisement by its leader, Manoj Tiwari, translated into Haryanvi to target Haryana voters. A voiceover was provided by an actor, and AI trained using video of Tiwari speeches was used to lip-sync the video to the new voiceover. A party staff member described it as a "positive" use of deepfake technology, which allowed them to "convincingly approach the target audience even if the candidate didn't speak the language of the voter."
In April 2020, the Belgian branch of Extinction Rebellion published a deepfake video of Belgian Prime Minister Sophie Wilmès on Facebook. The video promoted a possible link between deforestation and COVID-19. It had more than 100,000 views within 24 hours and received many comments. On the Facebook page where the video appeared, many users interpreted the deepfake video as genuine.
In 2020 Bruno Sartori has parodied politicians like Jair Bolsonaro and Donald Trump.
In June 2019, the United States House Intelligence Committee held hearings on the potential malicious use of deepfakes to sway elections.
Art
In March 2018 the multidisciplinary artist Joseph Ayerle published the video artwork Un'emozione per sempre 2.0 (English title: The Italian Game). The artist worked with Deepfake technology to create an AI actress, a synthetic version of 80's movie star Ornella Muti, traveling in time from 1978 to 2018. The Massachusetts Institute of Technology referred this artwork in the study "Collective Wisdom". The artist used Ornella Muti's time travel to explore generational reflections, while also investigating questions about the role of provocation in the world of art. For the technical realization Ayerle used scenes of photo model Kendall Jenner. The program replaced Jenner's face by an AI calculated face of Ornella Muti. As a result, the AI actress has the face of the Italian actress Ornella Muti and the body of Kendall Jenner.
Acting
There has been speculation about deepfakes being used for creating digital actors for future films. Digitally constructed/altered humans have already been used in films before, and deepfakes could contribute new developments in the near future. Deepfake technology has already been used by fans to insert faces into existing films, such as the insertion of Harrison Ford's young face onto Han Solo's face in Solo: A Star Wars Story, and techniques similar to those used by deepfakes were used for the acting of Princess Leia in Rogue One.
As deepfake technology increasingly advances, Disney has improved their visual effects using high resolution deepfake face swapping technology. Disney improved their technology through progressive training programmed to identify facial expressions, implementing a face swapping feature, and iterating in order to stabilize and refine the output. This high resolution deepfake technology will be implemented into movie and television production—saving significant operational and production costs. Disney's deepfake generation model can produce AI-generated media at a 1024 x 1024 resolution, which is much greater and produces more realistic results than common models that produce media at a 256 x 256 resolution. In addition, with this technology, Disney has the opportunity to revive dead actors and characters with a quick and simple face swap; Disney can now resurrect and revive characters for fans to enjoy.
Internet meme
In 2020, an internet meme emerged utilizing deepfakes to generate videos of people singing the chorus of , a song from the game Yakuza 0 in the video game series Yakuza. In the series, the melancholic song is sung by the player in a karaoke minigame. Most iterations of this meme use a 2017 video uploaded by user Dobbsyrules, who lip syncs the song, as a template.
Social media
Deepfakes have begun to see use in popular social media platforms, notably through Zao, a Chinese deepfake app that allows users to substitute their own faces onto those of characters in scenes from films and television shows such as Romeo + Juliet and Game of Thrones. The app originally faced scrutiny over its invasive user data and privacy policy, after which the company put out a statement claiming it would revise the policy. In January 2020 Facebook announced that it was introducing new measures to counter this on its platforms.
The Congressional Research Service cited unspecified evidence as showing that foreign intelligence operatives used deepfakes to create social media accounts with the purposes of recruiting individuals with access to classified information.
Sockpuppets
Deepfake photographs can be used to create sockpuppets, non-existent people, who are active both online and in traditional media. A deepfake photograph appears to have been generated together with a legend for an apparently non-existent person named Oliver Taylor, whose identity was described as a university student in the United Kingdom. The Oliver Taylor persona submitted opinion pieces in several newspapers and was active in online media attacking a British legal academic and his wife, as "terrorist symphathizers." The academic had drawn international attention in 2018 when he commenced a lawsuit in Israel against NSO, a surveillance company, on behalf of people in Mexico who alleged they were victims of NSO's phone hacking technology. Reuters could find only scant records for Oliver Taylor and "his" university had no records for him. Many experts agreed that "his" photo is a deepfake. Several newspapers have not retracted "his" articles or removed them from their websites. It is feared that such techniques are a new battleground in disinformation.
Collections of deepfake photographs of non-existent people on social networks have also been deployed as part of Israeli partisan propaganda. The Facebook page "Zionist Spring" featured photos of non-existent persons along with their "testimonies" purporting to explain why they have abandoned their left-leaning politics to embrace the right-wing, and the page also contained large numbers of posts from Prime Minister of Israel Benjamin Netanyahu and his son and from other Israeli right wing sources. The photographs appear to have been generated by "human image synthesis" technology, computer software that takes data from photos of real people to produce a realistic composite image of a non-existent person. In much of the "testimony," the reason given for embracing the political right was the shock of learning of alleged incitement to violence against the prime minister. Right wing Israeli television broadcasters then broadcast the "testimony" of these non-existent person based on the fact that they were being "shared" online. The broadcasters aired the story, even though the broadcasters could not find such people, explaining "Why does the origin matter?" Other Facebook fake profiles—profiles of fictitious individuals—contained material that allegedly contained such incitement against the right wing prime minister, in response to which the prime minister complained that there was a plot to murder him.
Concerns
Fraud
Audio deepfakes have been used as part of social engineering scams, fooling people into thinking they are receiving instructions from a trusted individual. In 2019, a U.K.-based energy firm's CEO was scammed over the phone when he was ordered to transfer €220,000 into a Hungarian bank account by an individual who used audio deepfake technology to impersonate the voice of the firm's parent company's chief executive.
Credibility and authenticity
Though fake photos have long been plentiful, faking motion pictures has been more difficult, and the presence of deepfakes increases the difficulty of classifying videos as genuine or not. AI researcher Alex Champandard has said people should know how fast things can be corrupted with deepfake technology, and that the problem is not a technical one, but rather one to be solved by trust in information and journalism. Deepfakes can be leveraged to defame, impersonate, and spread disinformation. The primary pitfall is that humanity could fall into an age in which it can no longer be determined whether a medium's content corresponds to the truth.
Similarly, computer science associate professor Hao Li of the University of Southern California states that deepfakes created for malicious use, such as fake news, will be even more harmful if nothing is done to spread awareness of deepfake technology. Li predicted that genuine videos and deepfakes would become indistinguishable in as soon as half a year, as of October 2019, due to rapid advancement in artificial intelligence and computer graphics.
Former Google fraud czar Shuman Ghosemajumder has called deepfakes an area of “societal concern” and said that they will inevitably evolve to a point at which they can be generated automatically, and an individual could use that technology to produce millions of deepfake videos.
The consequences of a deepfake are not significant enough to destabilize the entire government system; however, deepfakes possess the ability to damage individual entities tremendously. This is because deepfakes are often targeted at one individual, and/or their relations to others in hopes to create a narrative powerful enough to influence public opinion or beliefs. This can be done through deepfake voice phishing, which manipulates audio to create fake phone calls or conversations. Another method of deepfake use is fabricated private remarks, which manipulate media to convey individuals voicing damaging comments.
In September 2020 Microsoft made public that they are developing a Deepfake detection software tool.
Example events
Deepfakes of North Korean leader Kim Jong-un and Russian president Vladimir Putin have also been created by a nonpartisan advocacy group RepresentUs. These deepfakes were meant to air publicly as commercials to relay the notion that interference by these leaders in US elections would be detrimental to the United States' democracy; the commercial also aimed to shock Americans to realize how fragile democracy is, and how media and news can significantly influence the country's path regardless of credibility. However, these commercials did include an ending comment detailing that the footage was not real, and the commercials ultimately did not air due to fears and sensitivity regarding how Americans may react.
A clip from Nancy Pelosi's speech at the Center for American Progress given on 22 May 2019 was slowed down, in addition to the pitch being altered, to make it seem as if she were drunk; however, critics argue that this is not a deepfake, but shallowfake, less sophisticated video manipulation.
Donald Trump deepfake
A deepfake of Donald Trump was easily created based on a skit Jimmy Fallon performed on NBC's The Tonight Show. In this skit (aired 4 May 2016), Jimmy Fallon dressed up as Donald Trump and pretended to participate in a phone call with Barack Obama, conversing in a manner that presented him to be bragging about his primary win in Indiana. On 5 May 2019 a deepfake of Donald Trump (taken from this skit) was created. In this deepfake, Jimmy Fallon's face was transformed into Donald Trump's face (audio remained the same). This deepfake video was uploaded to YouTube by the founder of Derpfakes with a comedic intent.
Barack Obama deepfake
American actor Jordan Peele, BuzzFeed, and Monkeypaw Productions created and produced a deepfake of Barack Obama (uploaded to YouTube on 17 Apr 2018) that depicted Barack Obama cursing and calling Donald Trump names. In this deepfake Peele's voice and mouth was transformed and manipulated into Obama's voice and face. The intent for this video was to portray the dangerous consequences and power of deepfakes, and how deepfakes can make anyone say anything.
Responses
Social media platforms
Twitter
Twitter is taking active measures to handle synthetic and manipulated media on their platform. In order to prevent disinformation from spreading, Twitter is placing a notice on tweets that contain manipulated media and/or deepfakes that signal to viewers that the media is manipulated. There will also be a warning that appears to users who plan on retweeting, liking, or engaging with the tweet. Twitter will also work to provide users a link next to the tweet containing manipulated or synthetic media that links to a Twitter Moment or credible news article on the related topic—as a debunking action. Twitter also has the ability to remove any tweets containing deepfakes or manipulated media that may pose a harm to users’ safety. In order to better improve Twitter's detection of deepfakes and manipulated media, Twitter has asked users who are interesting in partnering with them to work on deepfake detection solutions to fill out a form (that is due 27 November 2020).
Facebook
Facebook has taken efforts towards encouraging the creation of deepfakes in order to develop state of the art deepfake detection software. Facebook was the prominent partner in hosting the Deepfake Detection Challenge (DFDC), held December 2019, to 2114 participants who generated more than 35000 models. The top performing models with the highest detection accuracy were analyzed for similarities and differences; these findings are areas of interest in further research to improve and refine deepfake detection models . Facebook has also detailed that the platform will be taking down media generated with artificial intelligence used to alter an individual's speech. However, media that has been edited to alter the order or context of words in one's message would remain on the site but be labeled as false, since it was not generated by artificial intelligence.
Detection
Most of the academic research surrounding deepfake seeks to detect the videos. The most popular technique is to use algorithms similar to the ones used to build the deepfake to detect them. By recognizing patterns in how deepfakes are created the algorithm is able to pick up subtle inconsistencies. Researchers have developed automatic systems that examine videos for errors such as irregular blinking patterns of lighting. This technique has also been criticized for creating a "Moving Goal post" where anytime the algorithms for detecting get better, so do the deepfakes. The Deepfake Detection Challenge, hosted by a coalition of leading tech companies, hope to accelerate the technology for identifying manipulated content.
A team at the University of Buffalo published a paper in October 2020 outlining their technique of using reflections of light in the eyes of
those depicted to spot deepfakes with a high rate of success, even without the use of an AI detection tool, at least for the time being.
Other techniques use blockchain to verify the source of the media. Videos will have to be verified through the ledger before they are shown on social media platforms. With this technology, only videos from trusted sources would be approved, decreasing the spread of possibly harmful deepfake media.
Digitally signing of all video and imagery by cameras and video cameras, including smartphone cameras, was suggested to fight deepfakes. That allows tracing every photograph or video back to its original owner that can be used to pursue dissidents.
Internet reaction
Since 2017, Samantha Cole of Vice published a series of articles covering news surrounding deepfake pornography. On 31 January 2018, Gfycat began removing all deepfakes from its site. On Reddit, the r/deepfakes subreddit was banned on 7 February 2018, due to the policy violation of "involuntary pornography". In the same month, representatives from Twitter stated that they would suspend accounts suspected of posting non-consensual deepfake content. Chat site Discord has taken action against deepfakes in the past, and has taken a general stance against deepfakes. In September 2018, Google added "involuntary synthetic pornographic imagery” to its ban list, allowing anyone to request the block of results showing their fake nudes.
In February 2018, Pornhub said that it would ban deepfake videos on its website because it is considered “non consensual content” which violates their terms of service. They also stated previously to Mashable that they will take down content flagged as deepfakes. Writers from Motherboard from Buzzfeed News reported that searching "deepfakes" on Pornhub still returned multiple recent deepfake videos.
Facebook has previously stated that they would not remove deepfakes from their platforms. The videos will instead be flagged as fake by third-parties and then have a lessened priority in user's feeds. This response was prompted in June 2019 after a deepfake featuring a 2016 video of Mark Zuckerberg circulated on Facebook and Instagram.
Legal response
In the United States, there have been some responses to the problems posed by deepfakes. In 2018, the Malicious Deep Fake Prohibition Act was introduced to the US Senate, and in 2019 the DEEPFAKES Accountability Act was introduced in the House of Representatives. Several states have also introduced legislation regarding deepfakes, including Virginia, Texas, California, and New York. On 3 October 2019, California governor Gavin Newsom signed into law Assembly Bills No. 602 and No. 730. Assembly Bill No. 602 provides individuals targeted by sexually explicit deepfake content made without their consent with a cause of action against the content's creator. Assembly Bill No. 730 prohibits the distribution of malicious deepfake audio or visual media targeting a candidate running for public office within 60 days of their election.
In November 2019 China announced that deepfakes and other synthetically faked footage should bear a clear notice about their fakeness starting in 2020. Failure to comply could be considered a crime the Cyberspace Administration of China stated on its website. The Chinese government seems to be reserving the right to prosecute both users and online video platforms failing to abide by the rules.
In the United Kingdom, producers of deepfake material can be prosecuted for harassment, but there are calls to make deepfake a specific crime; in the United States, where charges as varied as identity theft, cyberstalking, and revenge porn have been pursued, the notion of a more comprehensive statute has also been discussed.
In Canada, the Communications Security Establishment released a report which said that deepfakes could be used to interfere in Canadian politics, particularly to discredit politicians and influence voters. As a result, there are multiple ways for citizens in Canada to deal with deepfakes if they are targeted by them.
Response from DARPA
In 2018, the Defense Advanced Research Projects Agency (DARPA) funded a project where individuals will compete to create AI-generated videos, audio, and images as well as automated tools to detect these deepfakes. In 2019, DARPA hosted a "proposers day" for a project affiliated with the Semantic Forensics Program where researchers were driven to prevent viral spread of AI-manipulated media. DARPA and the Semantic Forensics Program were also working together to detect AI-manipulated media through efforts in training computers to utilize common sense, logical reasoning. In 2020 DARPA created a Media Forensics (MediFor) program, to detect and mitigate the increasing harm that deepfakes and AI-generated media posed, to provide information regarding how the media was createdand to address and emphasize the consequential role of deepfakes and their influence upon decision making.
In popular culture
The 1986 Mid-December issue of Analog magazine published the novelette "Picaper" by Jack Wodhams. Its plot revolves around digitally enhanced or digitally generated videos produced by skilled hackers serving unscrupulous lawyers and political figures.
The 1987 film The Running Man starring Arnold Schwarzenegger depicts an autocratic government using computers to digitally replace the faces of actors with those of wanted fugitives to make it appear the fugitives had been neutralized.
In the 1992 techno-thriller A Philosophical Investigation by Philip Kerr, "Wittgenstein", the main character and a serial killer, makes use of both a software similar to Deepfake and a virtual reality suit for having sex with an avatar of the female police lieutenant Isadora "Jake" Jakowicz assigned to catch him.
The 1993 film Rising Sun starring Sean Connery and Wesley Snipes depicts another character, Jingo Asakuma, who reveals that a computer disc has digitally altered personal identities to implicate a competitor.
Deepfake technology is part of the plot of the 2019 BBC One drama The Capture. The series follows British ex-soldier Shaun Emery, who is accused of assaulting and abducting his barrister. Expertly doctored CCTV footage is used to set him up and mislead the police investigating him.
Al Davis vs. the NFL — The narrative structure of this 2021 documentary, part of ESPN's 30 for 30 documentary series, uses deepfake versions of the film's two central characters, both deceased—Al Davis, who owned the Las Vegas Raiders during the team's tenure in Oakland and Los Angeles, and Pete Rozelle, the NFL commissioner who frequently clashed with Davis.
Deepfake technology is featured in "Impawster Syndrome", the 57th episode of the Canadian police series "Hudson and Rex", first broadcast on 6 January 2022, where a member of the St. John's police team is investigated on suspicion of robbery and assault due to doctored CCTV footage using his likeness.
See also
Facial motion capture
StyleGAN
Synthetic media
Virtual actor
Identity replacement technology
Hyperreality
Regulation of artificial intelligence
References
External links
Fake/Spoof Audio Detection Challenge (ASVspoof)
Deepfake Detection Challenge (DFDC)
Bibliography: Media Literacy in the Age of Deepfakes. Curated by Dr Joshua Glick.
Applications of computer vision
Artificial intelligence applications
Computer graphics
Deep learning
Identity theft
Special effects
2010s neologisms
Internet memes introduced in 2020
Articles containing video clips
Media studies
|
6323645
|
https://en.wikipedia.org/wiki/Windows%20Media%20Center%20Extender
|
Windows Media Center Extender
|
Windows Media Center Extenders (officially "Extender for Windows Media Center" and code named "Bobsled") are devices that are configured to connect over a computer network to a computer running Microsoft Windows XP Media Center Edition, Windows Vista Home Premium/Ultimate, Windows 7 Home Premium, or Windows 8 with a Pro pack to stream the computer's media center functions to the Extender device. This allows use of the Media Center and its features (such as view photos, videos, listen to music, watch live television and use DVR functions, watch recorded TV, etc.) on a television receiver or other electronic visual display.
The advantage with these devices is that a household's primary computer, hosting Media Center, need not be near the device used for display. Additionally, with an Extender, the Media Center can be accessed at the same time by several users. The Xbox 360 gaming console has Media Center Extender functionality. The Ceton Echo is a stand-alone extender.
Technology
Media Center Extenders (MCX) can either be dedicated hardware devices, such as set top boxes or televisions, or software based implementations such as the Xbox 360. First generation hardware based devices were based on the Windows CE operating system whereas the second generation devices can use other embedded OSs such as Linux as well. The Extender creates its own user account on the host PC(MCX1, MCX2, etc.) and then uses a version of Fast User Switching to enable the use of the host computer and Extenders at the same time.
Version 1 Extenders only support Media Center versions up to Windows XP Media Center Edition 2005 Update Rollup 2 - they cannot support the version of Media Center incorporated in Windows Vista Home Premium/Ultimate Edition and later.
The server software, which runs on the host PC and streams the media, is built into Windows Media Center. An MCX device must be paired with the MCE software before use; this is done by pairing the MCE software with an identifying number generated by the MCX device.
The MCE software makes the user interface available via the Remote Desktop Protocol (RDP, which is also used by Remote Desktop client). All processing done by the MCE software and plug-ins happen at the host computer; only the user interface is streamed to the MCX devices.
As such, the device can render the interface even though the Media Center-specific software (or the plug-ins) might not be installed there. However, the media files are streamed over a different protocol. To render the media, an implementation of the codec used to package the media must be locally installed on the Extender; having the codec on the host computer is not enough. Alternatively media can be trans-coded on the fly by the host computer to a codec that is supported by the Extender. In Windows 7 this is now a standard feature which will probably relieve Extender vendors in the future from having to include such a wide variety of codecs.
Version 1 Extenders
HP x5400
Linksys WMCE54AG
Xbox with Media Center Extender Add-On
All Version 1 Extenders have been discontinued and are not supported in Windows Vista.
Version 2 Extenders
For quite some time, the Xbox 360 was the only Version 2 Extender available that could work with Windows Vista. When connecting an Xbox 360 to a Windows XP Media Center Edition PC, a free download is required to connect for the first time. When connecting an Xbox 360 to a Windows Vista PC, no download is necessary as all required components are built into Windows Vista.
Microsoft eventually announced the v2 Media Center Extenders from partners (Linksys, D-Link and Niveus Media) on 5 September 2007. Version 2 capable Extenders support animated transitions between screens and additional capabilities of Windows Vista to handle newer video formats, notably, DivX, Xvid, Windows Media Video HD and H.264. They can stream HDTV (including 1080p) through HDMI like the Xbox 360, can stream protected content and many incorporate draft 802.11n wireless connectivity.
In addition to these updates, Extender manufacturers will be able to integrate Extender technology into other popular consumer electronics devices. Examples include DVD players, HDTVs, HD DVD players, Blu-ray players, etc. Windows Media Connect and Windows Media Player Network Sharing are able to connect to them on Windows XP; however, they do not work with Windows XP Media Center Edition 2005 as extenders. Xbox 360 is the only device that can work as an extender with both Windows XP Media Center as well as Windows Vista.
As of 2020, there are no commercially available Extenders.
Discontinued Products:
D-Link DSM-750
HP MediaSmart Connect - x280n
HP MediaSmart HDTV (With software update from April 2008)
Linksys DMA2100
Linksys DMA2200 (Integrated DVD Player)
Niveus Media Extender - EDGE
Samsung MediaLive Digital Media Extender MR-00EA1
Xbox 360 (Works with MCE 2005, Vista, Windows 7 and Windows 8 Media Center)
Ceton Echo (Does not work with Windows 8 Media Center)
Energy usage
The various versions of the Xbox 360 consume between 70 and 200 watts of power, depending upon model and activity (the 360 S consumes 70 W while idling). The Ceton Echo claims to use less than 5 W. Energy cost depends upon electricity prices, model, and use, but for an Xbox 360 running continuously can be a significant fraction of the purchase price every year. The Ceton claims to save up to US$60 a year on electricity compared to a cable box or Xbox 360 used as an extender.
References
External links
Extender for Windows Media Center
FAQ: Windows Media Center Extenders and Xbox 360
Media Center Extender Setup
Media Center Extender for Xbox Review
See also
Windows Media Center
Windows Media Connect
Microsoft initiatives
Digital media players
|
50565
|
https://en.wikipedia.org/wiki/Executive
|
Executive
|
Executive may refer to:
Role, title, or function
Executive (government), branch of government that has authority and responsibility for the administration of state bureaucracy
Executive, a senior management role in an organization
Chief executive officer (CEO), one of the highest-ranking corporate officers (executives) or administrators
Executive director, the senior manager of an organization, company, or corporation
Executive education, term used for programs at graduate-level business schools that aim to educate managers or entrepreneurs
Executive officer, a high-ranking member of a corporation body, government or military
Business executive, a person responsible for running an organization
Music executive or record executive, person within a record label who works in senior management
Studio executive, employee of a film studio
Executive producer, a person who oversees the production of an entertainment product
Account executive, a job title given by a number of marketing agencies (usually to trainee staff who report to account managers)
Executive functions or executive system, theorized cognitive system in psychology that controls and manages other cognitive processes
Arts, entertainment, and media
Executive (magazine), a Lebanese business monthly
The Executive, a fictional raincoat in the Seinfeld episode "The Raincoats"
The Executive, a musical band including Andrew Ridgeley and George Michael before the formation of Wham!
Brands and enterprises
Chrysler Executive, a car offered 1983–1986
Sinclair Executive, an electronic calculator offered in the early 1970s
Computing and technology
Executive (operating system), the operating system for the ICL 290x range of computers
The Windows Executive, internal part of modern Microsoft Windows operating systems
Other uses
Executive car, in Britain: an automobile larger than a large family car
Executive paper size (often )
See also
Executive order (disambiguation), a form of act issued by a number of the executive branch of a central government
|
56748434
|
https://en.wikipedia.org/wiki/Where%20the%20Water%20Tastes%20Like%20Wine
|
Where the Water Tastes Like Wine
|
Where the Water Tastes Like Wine is an adventure game developed by Dim Bulb Games and Serenity Forge, and published by Good Shepherd Entertainment. It was released for Linux, macOS, Microsoft Windows in February 2018. In November 2019, Serenity Forge announced that Where the Water Tastes Like Wine would also be released on the Nintendo Switch, PlayStation 4, and Xbox One.
Title
"[Going] where the water tastes like wine" is an excerpt from the traditional American folk song "Going Down the Road Feeling Bad" (also known as the "Lonesome Road Blues").
Gameplay
Where the Water Tastes Like Wine is a narrative-driven adventure game. Players explore a Great Depression-era United States, hearing and collecting oral stories and passing them along. Stories are used as a form of progression, with characters gradually opening up to the player in response to the provided stories, which in turn allows one to learn their true stories. The player may purchase goods to replenish their hunger or tiredness, with money being earned and then spent on the aforementioned goods, or in faster means of transportation. Several means of transport are available, including walking, hitchhiking and freighthopping.
Development and release
Where the Water Tastes Like Wine was developed by Dim Bulb Games and Serenity Forge. The game was published by Good Shepherd Entertainment. The game was released for Linux, macOS and Microsoft Windows on 28 February 2018. According to the developer, the game's initial release was a commercial disaster.
On November 8, Serenity Forge announced the game would be coming to the Nintendo Switch, PlayStation 4, and Xbox One on November 29.
Reception
Where the Water Tastes Like Wine received "mixed or average" reviews according to review aggregator Metacritic. It was awarded the Developers Choice Award along with Walden, a game at the 2017 Indiecade Festival. However, in the months following release, creator Johnnemann Nordhagen wrote in his postmortem, "I can’t discuss exact numbers, but in the first few weeks fewer people bought the game than I have Twitter followers, and I don’t have a lot of Twitter followers," and "At the end of the day it’s astounding that a game that got this much attention from the press, that won awards, that had an all-star cast of writers and performers, that had a bizarre celebrity guest appearance [by the musician Sting] failed this hard." Nordhagen writes, "Basically, I’m not sure that games like this one can continue to be made in the current market."
Soundtrack
The soundtrack of Where the Water Tastes Like Wine gained praise as an authentic representation of Americana: The 30-track compilation spans folk, jazz, country, blues, bluegrass, and more. The soundtrack was licensed and released by video game music label Materia Collective. A limited edition vinyl was pressed by Laced Records.
Awards
References
External links
2018 video games
Adventure games
Linux games
MacOS games
Video games developed in the United States
Video games set in the United States
Windows games
|
1649105
|
https://en.wikipedia.org/wiki/Digital%20identity
|
Digital identity
|
A digital identity is information on an entity used by computer systems to represent an external agent. That agent may be a person, organization, application, or device. ISO/IEC 24760-1 defines identity as "set of attributes related to an entity".
The information contained in a digital identity allows for assessment and authentication of a user interacting with a business system on the web, without the involvement of human operators. Digital identities allow our access to computers and the services they provide to be automated, and make it possible for computers to mediate relationships.
The term "digital identity" also denotes certain aspects of civil and personal identity that have resulted from the widespread use of identity information to represent people in an acceptable and trusted digital format in computer systems.
Digital identity is now often used in ways that require data about persons stored in computer systems to be linked to their civil, or national, identities. Furthermore, the use of digital identities are now so widespread that many discussions refer to "digital identity" as the entire collection of information generated by a person’s online activity. This includes usernames and passwords, online search activities, birth date, social security, and purchasing history. Especially where that information is publicly available and not anonymized, and can be used by others to discover that person's civil identity. In this wider sense, a digital identity is a version, or facet, of a person's social identity. This may also be referred to as an online identity. With self-sovereign identity (SSI) the user has a means of generating and controlling unique identifiers as well as some facility to store identity data.
The legal and social effects of digital identity are complex and challenging. However, they are simply a consequence of the increasing use of computers, and the need to provide computers with information that can be used to identify external agents.
Background
A critical problem in cyberspace is knowing with whom one is interacting. Using static identifiers such as password and email there are no ways to precisely determine the identity of a person in digital space, because this information can be stolen or used by many individuals acting as one. Digital identity based on dynamic entity relationships captured from behavioral history across multiple websites and mobile apps can verify and authenticate an identity with up to 95 percent accuracy.
By comparing a set of entity relationships between a new event (e.g., login) and past events, a pattern of convergence can verify or authenticate the identity as legitimate where divergence indicates an attempt to mask an identity. Data used for digital identity is generally anonymized using a one-way hash, thereby avoiding privacy concerns. Because it is based on behavioral history, a digital identity is very hard to fake or steal.
Related terms
Subject and entity
A digital identity may also be referred to as a digital subject or digital entity and is the digital representation of a set of claims made by one party about itself or another person, group, thing or concept.
Attributes, preferences and traits
Every digital identity has zero or more identity attributes. Attributes are acquired and contain information about a subject, such as medical history, purchasing behaviour, bank balance, age and so on. Preferences retain a subject's choices such as favourite brand of shoes, preferred currency. Traits are features of the subject that are inherent, such as eye colour, nationality, place of birth. While attributes of a subject can change easily, traits change slowly, if at all. Digital identity also has entity relationships derived from the devices, environment and locations from which an individual transacts on the web.
Rhetorical aspects
Digital rhetoric
The term digital identity is used in the academic field of digital rhetoric to denote identity as a "rhetorical construction." Digital rhetoric is concerned with how identities are being formed, negotiated, influenced, or challenged in ever-evolving digital environments. Being aware of different rhetorical situations is complex in digital spaces but it is important for effective communication as some scholars argue that individuals’ ability to evaluate rhetorical situations is necessary for constructing an appropriate identity under different rhetorical circumstances. In addition to that, physical and digital identities cannot be separated and visual affordances shape the representation of physical identity in online spaces. As Bay argues, “what we do online now requires there to be more continuity—or at least fluidity—between our online and off-line selves.” In positioning of digital identity in rhetoric, the scholars pay attention to how issues of race, gender, agency, and power are manifested in digital spaces. Some radical theorists "posited that cyberspace would liberate people from their bodies, blur the lines between human and technology." Other scholars theorized that this ‘‘disembodied’’ communication "could free society from discrimination based on race, sex, gender, sexuality, or class." Even more, the construction of digital identity is also tied to the network. This can be seen from the practices of reputation management companies which work on creating positive identity, so that personal or company's accounts show up higher in various search engines.
Technical aspects
Issuance
Digital identities can be issued through digital certificates, which act the same way passports do in the physical world. They contain data which is associated with a user, and are issued with legal guarantees by a recognized certification authority (CA).
Trust, authentication and authorization
In order to assign a digital representation to an entity, the attributing party must trust that the claim of an attribute (such as name, location, role as an employee, or age) is correct and associated with the person or thing presenting the attribute (see Authentication below). Conversely, the individual claiming an attribute may only grant selective access to its information, e.g. (proving identity in a bar or PayPal authentication for payment at a web site). In this way, digital identity is better understood as a particular viewpoint within a mutually-agreed relationship than as an objective property.
Authentication
Authentication is a key aspect of trust-based identity attribution, providing a codified assurance of the identity of one entity to another. Authentication methodologies include the presentation of a unique object such as a bank credit card, the provision of confidential information such as a password or the answer to a pre-arranged question, the confirmation of ownership of an e-mail address, and more robust but relatively costly solutions utilizing encryption methodologies. In general, business-to-business authentication prioritises security while user to business authentication tends towards simplicity. Physical authentication techniques such as iris scanning, handprinting, and voiceprinting are currently being developed and in the hope of providing improved protection against identity theft. Those techniques fall into the area of Biometry (biometrics). A combination of static identifiers (username & passwords) along with personal unique attributes (biometrics), would allow for multi factor authentication. This process would yield more creditable authentication, which in nature is much more difficult to be cracked and manipulated.
Whilst technological progress in authentication continues to evolve, these systems do not prevent aliases from being used. The introduction of strong authentication for online payment transactions within the European Union now links a verified person to an account, where such person has been identified in accordance with statutory requirements prior to account being opened. Verifying a person opening an account online typically requires a form of device binding to the credentials being used. This verifies that the device that stands in for a person on the Web is actually the individuals device and not the device of someone simply claiming to be the individual. The concept of reliance authentication makes use of pre-existing accounts, to piggy back further services upon those accounts, providing that the original source is reliable. The concept of reliability comes from various anti-money laundering and counter-terrorism funding legislation in the USA, EU28, Australia, Singapore and New Zealand where second parties may place reliance on the customer due diligence process of the first party, where the first party is say a financial institution. An example of reliance authentication is PayPal's verification method.
Authorization
Authorization is the determination of any entity that controls resources that the authenticated can access those resources. Authorization depends on authentication, because authorization requires that the critical attribute (i.e., the attribute that determines the authorizer's decision) must be verified. For example, authorization on a credit card gives access to the resources owned by Amazon, e.g., Amazon sends one a product. Authorization of an employee will provide that employee with access to network resources, such as printers, files, or software. For example, a database management system might be designed so as to provide certain specified individuals with the ability to retrieve information from a database but not the ability to change data stored in the database, while giving other individuals the ability to change data.
Consider the person who rents a car and checks into a hotel with a credit card. The car rental and hotel company may request authentication that there is credit enough for an accident, or profligate spending on room service. Thus a card may later be refused when trying to purchase an activity such as a balloon trip. Though there is adequate credit to pay for the rental, the hotel, and the balloon trip, there is an insufficient amount to also cover the authorizations. The actual charges are authorized after leaving the hotel and returning the car, which may be too late for the balloon trip.
Valid online authorization requires analysis of information related to the digital event including device and environmental variables. These are generally derived from the hundreds of entities exchanged between a device and business server to support an event using standard Internet protocols.
Digital identifiers
Digital identity fundamentally requires digital identifiers—strings or tokens that are unique within a given scope (globally or locally within a specific domain, community, directory, application, etc.). Identifiers are the key used by the parties to an identification relationship to agree on the entity being represented. Identifiers may be classified as omnidirectional and unidirectional. Omnidirectional identifiers are intended to be public and easily discoverable, while unidirectional identifiers are intended to be private and used only in the context of a specific identity relationship.
Identifiers may also be classified as resolvable or non-resolvable. Resolvable identifiers, such as a domain name or e-mail address, may be dereferenced into the entity they represent, or some current state data providing relevant attributes of that entity. Non-resolvable identifiers, such as a person's real-world name, or a subject or topic name, can be compared for equivalence but are not otherwise machine-understandable.
There are many different schemes and formats for digital identifiers. The most widely used is Uniform Resource Identifier (URI) and its internationalized version Internationalized Resource Identifier (IRI)—the standard for identifiers on the World Wide Web. OpenID and Light-weight Identity (LID) are two web authentication protocols that use standard HTTP URIs (often called URLs), for example. A Uniform Resource Name (URN) is a persistent, location-independent identifier assigned within the defined namespace.
Digital Object Architecture
Digital Object Architecture (DOA) provides a means of managing digital information in a network environment. A digital object has a machine and platform independent structure that allows it to be identified, accessed and protected, as appropriate. A digital object may incorporate not only informational elements, i.e., a digitized version of a paper, movie or sound recording, but also the unique identifier of the digital object and other metadata about the digital object. The metadata may include restrictions on access to digital objects, notices of ownership, and identifiers for licensing agreements, if appropriate.
Handle System
The Handle System is a general purpose distributed information system that provides efficient, extensible, and secure identifier and resolution services for use on networks such as the internet. It includes an open set of protocols, a namespace, and a reference implementation of the protocols. The protocols enable a distributed computer system to store identifiers, known as handles, of arbitrary resources and resolve those handles into the information necessary to locate, access, contact, authenticate, or otherwise make use of the resources. This information can be changed as needed to reflect the current state of the identified resource without changing its identifier, thus allowing the name of the item to persist over changes of location and other related state information. The original version of the Handle System technology was developed with support from the Defense Advanced Research Projects Agency (DARPA).
Extensible Resource Identifiers
A new OASIS standard for abstract, structured identifiers, XRI (Extensible Resource Identifiers), adds new features to URIs and IRIs that are especially useful for digital identity systems. OpenID also supports XRIs, and XRIs are the basis for i-names.
Risk-based authentication
Risk-based authentication is an application of digital identity whereby multiple entity relationship from the device (e.g., operating system), environment (e.g., DNS Server) and data entered by a user for any given transaction is evaluated for correlation with events from known behaviors for the same identity. Analysis are performed based on quantifiable metrics, such as transaction velocity, locale settings (or attempts to obfuscate), and user-input data (such as ship-to address). Correlation and deviation are mapped to tolerances and scored, then aggregated across multiple entities to compute a transaction risk-score, which assess the risk posed to an organization.
Policy aspects
There are proponents of treating self-determination and freedom of expression of digital identity as a new human right. Some have speculated that digital identities could become a new form of legal entity.
Taxonomies of identity
Digital identity attributes—or data—exist within the context of ontologies.
The development of digital identity network solutions that can interoperate taxonomically-diverse representations of digital identity is a contemporary challenge. Free-tagging has emerged recently as an effective way of circumventing this challenge (to date, primarily with application to the identity of digital entities such as bookmarks and photos) by effectively flattening identity attributes into a single, unstructured layer. However, the organic integration of the benefits of both structured and fluid approaches to identity attribute management remains elusive.
Networked identity
Identity relationships within a digital network may include multiple identity entities. However, in a decentralised network like the Internet, such extended identity relationships effectively require both (a) the existence of independent trust relationships between each pair of entities in the relationship and (b) a means of reliably integrating the paired relationships into larger relational units. And if identity relationships are to reach beyond the context of a single, federated ontology of identity (see Taxonomies of identity above), identity attributes must somehow be matched across diverse ontologies. The development of network approaches that can embody such integrated "compound" trust relationships is currently a topic of much debate in the blogosphere.
Integrated compound trust relationships allow, for example, entity A to accept an assertion or claim about entity B by entity C. C thus vouches for an aspect of B's identity to A.
A key feature of "compound" trust relationships is the possibility of selective disclosure from one entity to another of locally relevant information. As an illustration of the potential application of selective disclosure, let us suppose a certain Diana wished to book a hire car without disclosing irrelevant personal information (utilising a notional digital identity network that supports compound trust relationships). As an adult, UK resident with a current driving license, Diana might have the UK's Driver and Vehicle Licensing Agency vouch for her driving qualification, age and nationality to a car-rental company without having her name or contact details disclosed. Similarly, Diana's bank might assert just her banking details to the rental company. Selective disclosure allows for appropriate privacy of information within a network of identity relationships.
A classic form of networked digital identity based on international standards is the "White Pages".
An electronic white pages links various devices, like computers and telephones, to an individual or organization. Various attributes such as X.509v3 digital certificates for secure cryptographic communications are captured under a schema, and published in an LDAP or X.500 directory. Changes to the LDAP standard are managed by working groups in the IETF, and changes in X.500 are managed by the ISO. The ITU did significant analysis of gaps in digital identity interoperability via the FGidm, focus group on identity management.
Implementations of X.500[2005] and LDAPv3 have occurred worldwide but are primarily located in major data centers with administrative policy boundaries regarding sharing of personal information. Since combined X.500 [2005] and LDAPv3 directories can hold millions of unique objects for rapid access, it is expected to play a continued role for large scale secure identity access services. LDAPv3 can act as a lightweight standalone server, or in the original design as a TCP-IP based Lightweight Directory Access Protocol compatible with making queries to a X.500 mesh of servers which can run the native OSI protocol.
This will be done by scaling individual servers into larger groupings that represent defined "administrative domains", (such as the country level digital object) which can add value not present in the original "White Pages" that was used to look up phone numbers and email addresses, largely now available through non-authoritative search engines.
The ability to leverage and extend a networked digital identity is made more practicable by the expression of the level of trust associated with the given identity through a common Identity Assurance Framework.
Security issues and privacy
Several writers have pointed out the tension between ubiquitous services that consume digital identity on the one hand and privacy on the other.
If services gather and store data linked to a digital identity, and if that digital identity can be linked to a user's real identity, then services can learn a great deal about individuals by recording and sharing data. GDPR is one attempt to address this concern using regulation.
Many systems provide privacy-related mitigations when analyzing data linked to digital identities. One common mitigation is data anonymization, such as hashing user identifiers with a cryptographic hash function. Another popular technique is adding statistical noise to a data set to reduce identifiability, such as with differential privacy.
While a digital identity allows consumers to transact from anywhere and more easily manage various ID cards, it also poses a potential single point of compromise that malicious hackers can use to steal all of that personal information.
Legal issues
Clare Sullivan presents the grounds for digital identity as an emerging legal concept. The UK's Identity Cards Act 2006 confirms Sullivan's argument and unfolds the new legal concept involving database identity and transaction identity. Database identity refers to the collection of data that is registered about an individual within the databases of the scheme and transaction identity is a set of information that defines the individual's identity for transactional purposes. Although there is reliance on the verification of identity, none of the processes used are entirely trustworthy. The consequences of digital identity abuse and fraud are potentially serious, since in possible implications the person is held legally responsible.
Business aspects
Corporations have begun to recognize the potential of the internet to tailor their online presence to each individual customer. Purchase suggestions, personalised adverts and other tailored marketing strategies are a great success to businesses. Such tailoring however, depends on the ability to connect attributes and preferences to the identity of the visitor. For technology to enable direct value transfer of rights and non-bearer assets, human agency must be conveyed, including the authorization, authentication and identification of the buyer and/or seller, as well as “proof of life,” without a third party.
National digital identity systems
Variance by jurisdiction
While many facets of digital identity are universal owing in part to the ubiquity of the Internet, some regional variations exist due to specific laws, practices and government services that are in place. For example, digital identity in Australia can utilize services that validate driving licences, passports and other physical documents online to help improve the quality of a digital identity, also strict policies against money laundering mean that some services, such as money transfers need a stricter level of validation of digital identity.
Digital identity in the national sense can mean a combination of single sign on, and/or validation of assertions by trusted authorities (generally the government).
European Union
On June 3, 2021, the European Commission proposed a framework for a European Digital Identity. It is planned to be available to citizens, residents, and business within the EU. While it should be suitable for online and offline private and public services, it can be used by participants for personal identification or to provide confirmation about specific personal information. Benefits included are the EU wide recognition of every digital identity card, a secure way on how to control the amount of data and information the user wants to share with the services as well as the simple operation via digital wallets using several mobile devices.
Australia
In Australia, MyGov/MyGovID and Australia Post DigitaliD provide a means of single sign on. MyGov currently only supports government agencies, whereas Australia Post's DigitaliD solution supports private institutions.
China
China's Resident Identity Card cross referencing to other services (banking, Internet service providers etc] acts as a pseudo Digital Identity system.
Estonia
Estonia's Identity Card is a sophisticate digital ID system that can be used by governments and some third parties for authentication.
India
In India, Aadhaar card is used as a digital ID service, mainly for government institutions.
Italy
Italy's SPID can be used as a digital ID for public and private institutions, and rates as the most extensive national digital ID at this time (2021).
Monaco
Monaco citizens and residents can get a digital ID for public institutions and access of telecom or electricity services since June 2021.
Singapore
Singapore's SingPass is being extended to National Digital Identity (NDI), for government services, though the intent is to extend it to private institutions. The corporate login version is called CorpPass.
United Kingdom
The UK's GOV.UK Verify allows only a few third parties to validate assertions.
United States
While no ubiquitous digital identity service exists, US Social Security numbers act as a national identity number and can be validated by authorised private institutions using the government's Social Security Number Validation Service (SSNVS).
Germany
There is an online ID card available in Germany. The user can identify himself securely on the internet, at vending machines or several citizen terminals. Thereby business and authority matters can be easily worked out electronically to save time, cost and money. In the framework of a competition called "Schaufenster Sichere Digitale Identitäten", the German Federal Ministry of economy and energy created a project, called "IDunion". This project was launched on April 1st 2021 and aims to create the opportunity for inhabitants to get easier access to education, mobility, e-government, industry, health care and much more.
Ukraine
Ukraine has introduced online ID cards in April 2020 and is going to equate them to the paper documents. Ukrainian citizens will be able to use an app called Diia for identification purposes. Ukraine plans to fully legalize the use of online ID documents on August 23, 2021, and every user will be able to choose whether to use the paper documents or digital ones as for authorities will not be able to demand paper documents from citizens if they have digital ones. Digital identity can be used not only for provision of public and government services but also to receive deliveries, confirm age in supermarkets and open new bank accounts.
Digital death
Digital death refers to a phenomenon of people having accounts in Internet even after their death. Digital death is concerned with several ethical issues of how the information stored by the deceased person may be used or stored or given to the family members. It also may result in confusion as social media have automated features such as birthday reminders, and uncertainty of the willingness of the deceased person to pass their personal information to the third party. Majority of social media don't have a clear legislation regarding the digital death. Right now there are many companies that have a service of securing digital identities after death, or passing it to the family legally.
See also
Digital footprint
Digital rhetoric
E-authentication
Federated identity
Informational self-determination
Privacy by design
Death and the Internet
References
Identity management
Digital technology
Federated identity
Computer access control
|
4895341
|
https://en.wikipedia.org/wiki/MSN%20Chat
|
MSN Chat
|
MSN Chat was the Microsoft Network version of IRCX (Internet Relay Chat extensions by Microsoft), which replaced Microsoft Chat, a set of Exchange-based IRCX servers first available in the Microsoft Comic Chat client, although Comic Chat was not required to connect.
History
Client Compatibility
According to the MSN Chat website, the following were required to use the MSN Chat Service:
Windows 95 or later
Internet Explorer 4.0 or later OR;
Netscape Navigator 4.x
The Microsoft Network Chat Control was developed as an ActiveX Component Object Model (COM) Object. ActiveX, being a Microsoft technology provided limited compatibility for other products. The other major platforms beside Internet Explorer that MSN Chat was supported on, was Netscape Navigator and MSNTV (formerly known as WebTV). To ensure the MSN Chat network was only being connected to by authorized clients, Microsoft created and implemented a SASL based Security Service Provider authentication package known as GateKeeper. This used a randomized session key to authorize users not using the Microsoft Passport (now Microsoft account) system. Microsoft used another SSP known as GateKeeperPassport, that worked from the same method but required certain attributes related to the user's account.
Defeating the "Authentication Challenge"
There have been various methods through the use of mIRC to access the MSN Chat Network. Most of the methods were through the use of the MSN Chat Control itself, yet others were more complicated.
In the beginning, shortly after the move from Microsoft Chat, the MSN Chat Network could be directly connected to through any IRC Client to irc.msn.com on port 6667. Perhaps because of abuse or other factors, such as the desire to authenticate users based on their Microsoft Passport, Microsoft implemented GateKeeper and GateKeeperPassport, and integrated both into their chat control. The weakness of GateKeeper and the fact the early MSN Chat Controls (1.0−3.0) had public functions for doing GateKeeper authentication seemed to indicate Microsoft wanted third parties to be able to access their network as before, but they wanted to be able to control automated abuse. In any event, these public functions allowed normal IRC clients to authorize themselves.
With the release of the MSN Chat Control 4.0, the public functions were removed. Users found a way to authorize by a "Proxy Method", forcing the Chat Control to bridge connections between mIRC and the Chat Network.
With the release of the MSN Chat Control 4.2 and later, they blocked this proxy method by having the chat control hash the IP address of the server to which it was instructed to connect into the response to the challenge in authentication. If the control was instructed to connect to any address other than the server, it would not match the server's hash and thus authentication would fail. A few later third party clients could authenticate without the control and were adjusted to compensate for this change.
Versions
The versions of MSN Chat were designed from IRC3 through to IRC8, Even with the newer versions, MSN Chat still had the possibility to replicate older MSN Chat versions by issuing the IRCVERS command.
It is believed that IRC referred to the original IRC Daemon, and IRC2 referred to IRCX.
IRC3
MSN Chat 1.0 was introduced as an ActiveX object for use within Internet Explorer.
GateKeeper (version 1) authentication was enabled. As the client did not specify a GUID, a random GateKeeper address was issued by the server.
Directory (better known as FINDS) servers were created to distribute the load between servers.
IRC4
- UNKNOWN. Further research is required.
IRC5
GateKeeper (version 2) authentication was enabled. The major difference between v1 and v2 was that the client specified a GUID that was stored in the Windows Registry, which allowed each client to have a unique, and semi-permanent GateKeeper address.
USER command is no longer required.
GateKeeperPassport was enabled, this allowed the client to relay cookies received from the passport.net service as a method of permanent authentication.
Non-passport nicknames must now be prefixed with a '>', which is displayed as 'Guest_' by the official client.
Passport user nicknames are no longer able to be changed without first disconnecting. Guest nicknames may still be changed, but the official client offers no way to do so.
Basic icons are shown next to the user's name, they identify MSN Staff (Sysops and Admins) with the MSN Butterfly, users who are away with a coffee cup, and spectators with a pair of glasses.
IRC6 -
IRC7:
MSN Chat introduces profile icons, Profile icons indicated if the member had a profile, gender (if known), and if the user had a picture
IRC8:
As MSN Chat had now become a Subscription Only (Premium) service, This introduced extra user and channel modes. The channel mode 'S' was added to indicated that only subscribers could talk. The user mode 'B' (to indicate the user was subscribed) and O (to indicate the user was not subscribed) were added. With the exception of Official MSN Staff. It was impossible for a user with the mode "O" to chat in a channel with the Channel Mode "S".
Update to the GateKeeper Authentication method (known as the "4.5 Auth", due to the MSN Chat Control 4.5 being the first to implement it). It was a slight change, that added the value taken from the Server Parameter (before the ":" (if one is present)) to a MD5 Checksum.
Third-party applications
The use of third-party applications on the MSN Chat Network was not prohibited, although it was unsupported. Third-party applications were required to use the same Authentication Methods as the MSN Chat Control.
The second change was the major part, allowing the Chat Control to bridge the connections between the Client and MSN Chat Service.
The most popular third-party applications were mIRC, IRC Dominator and Viperbot.
Scripts were often downloaded from sites such as TechGear007.
Notable features
Webchat using MSN's Chat Control
Chat nicknames
Profiles
Chatroom creation
Emoticons
Chatroom listings
User created rooms
MSN created rooms
MSN WebTV chats
Celebrity chats
Adult chats, moderate content chats, all aged chats
Integration with MSN groups
Authentication
GateKeeper
The GateKeeper (and closely related GateKeeperPassport) authentication mechanisms are SASL authentication mechanisms as defined in the IRCX Drafts.
After the introduction of authentication on MSN Chat, Gatekeeper was the only authentication method that the public could use. During the initial handshake, the client would send a packet only containing the 16 byte header to the server, and the server would reply with a header, coupled with a 128 bit Cryptographic nonce. Finally, the client would create a 128 bit cryptographic hash of the nonce received from the server using a secret key, sending this as a subsequent authentication reply after the header, and immediately before a 16 byte GUID. The cryptographic hash function used was hmac-md5, and the secret key was "SRFMKSJANDRESKKC" (case sensitive).
Defeating GateKeeper
Early implementations of the GateKeeper authentication mechanism did not create a barrier to entry, as the authentication API that Microsoft had created was available to other program developers.
After some time, Microsoft removed the ability for developers to use/see the API that had been embedded in the MSN Chat Control, and it can be safely assumed from this time that Microsoft wanted access to be from the official chat control only.
The GateKeeper authentication made an appearance in the WebTV/MSNTV client.
It was quickly realised that it was also possible to connect by creating a proxy that would load the MSN Chat Control temporarily as required, relaying nonce and hashes between the server and control, before closing the chat control. The difficulty with this method is that it was often slow, didn't work, or could crash applications due to requiring the ActiveX control to be used in Microsoft Internet Explorer, or MSIE based web controls. It is likely possibly that an alternative browser (such as Netscape Navigator, Firefox, etc) could have been used to host the MSN Chat Control, as there was a NPAPI version available from Microsoft.
In July 2002, a user named zmic reverse engineered the MSN Chat Control, and produced a python script that was able to login without the use of the MSN Chat Control. The python script was buggy, but was later re-written in multiple programming languages by various authors. The user eXonyte had written some code which could be used (via WINE) on Linux. It's believed that this was the first time MSN Chat had been used outside of Windows.
When GateKeeper version 3 was introduced, it was a very minor change that had added the string of the server name (as defined in the Chat Control parameter "Server") to the hash. The additional string would not include a colon or port if they were present. This appeared to be an effort to defeat the proxy method of accessing the service, but was quickly overcome as users shared the information that the IP had been added to the hash. This information was likely leaked from someone in Microsoft, as there were rumours of the upcoming change before the new GateKeeper version was released.
It wasn't until around 2018 that the user JD noticed that the various keys from zmic's reverse engineering were likely derivatives of another key, and he was able to find the plain text key - before finding the algorithm used. Upon sharing this information with Sky, they quickly discovered the underlying cryptographic hash function was HMAC-MD5.
There are still just two bytes that are unknown in the GateKeeper authentication header, however it was tested against the MSN Chat Server many times, and the server didn't appear to differentiate between the values of those two bytes. There's a possibility that the two bytes are random bytes of memory.
NTLM
Like GateKeeper, NTLM and NTLMPassport were implemented as SASL authentication mechanisms as defined in the IRCX protocol.
NTLM Authentication was not available to be used by the MSN Chat Control, and the only known client implementation is in the MSN Chat Admin Client, which is a very basic client that was created to be used by MSN Chat staff, based on the publicly available MS Chat version 2.5. NTLM credentials were not available to normal users.
It is believed that MSN Chat staff used NTLM to authenticate, and that they authenticated through Microsoft's Active Directory. It is possible that MSN Chat staff were connected directly to Microsoft's network, or connected via a virtual private network (VPN).
MSN Chat staff also had the ability to login via the less secure USER/PASS method documented in RFC 1459. This was used heavily with the official chat bots, as it required no knowledge of SASL authentication mechanisms.
Passport
GateKeeperPassport and NTLMPassport were extensions to the GateKeeper and NTLM authentication mechanisms.
The Passport extensions allowed the user to identify with a '.net Passport' (later known as a Windows Live Passport, now known as a Microsoft Passport).
When a client attempted to register using a passport authentication extension, instead of receiving the usual asterisks to indicate that authentication is successful (as noted in IRCX drafts), they would be presented with a further subsequent authentication command, with only the string 'OK' as a parameter. The user would then send back an authentication command without the header, using two variables known as PassportTicket and PassportProfile (taken from the browser cookies MSPAuth and MSPProf) to identify themselves. Both variables were preceded by a string representation of an 8 digit hex number indicating the length of the variable, and must be presented in the correct order.
When using GateKeeperPassport, the GUID specified after the GateKeeper hash should be a null GUID - Literally \0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0.
Example PassportTicket and PassportProfile being sent: AUTH GateKeeperPassport S :0000000EPassportTicket0000000FPassportProfile\r\n
Whilst it is assumed the same format is used with NTLMPassport, it can not be confirmed as NTLMPassport usage has not been witnessed. Active MSN Chat staff were using NTLM and were considered Guests, although the Guest prefix ">" was not enforced, instead a "'" prefix was used, which is noted to be a Unicode nickname prefix in the IRCX Drafts.
User levels
MSN Chat had the following user levels:
Staff:
Admin
Sysop
Guide
Bot
Users:
Owner
Host
Participant
Spectator
Similar services
There are many chat networks attempting to simulate the service that was provided by the Microsoft Network, which use the "MSN Chat Control". These simulation chat networks are often referred to as "MSN Chat Clones". These are generally small chat networks, which often rely on home-made IRC servers, or IRCX servers. Many of the "MSN Chat Clones" are non-compliant and do not follow the RFC 1459 (IRC) or the "eXtensions to Internet Relay Chat" (IRCX) standards and often contain many bugs/exploits that may cause a denial of service with the MSN Chat Control.
Many of the MSN Chat Clones started up directly after MSN closed its services (2006), and additional networks have continued to spring up since then.
There is speculation that these chat networks may have pulled potential subscribers away from MSN Chat, ultimately bringing on the demise of MSN Subscription Chat Services.
While the majority of MSN Clone Chat sites are free, most of them rely on adverts to provide a small income. In addition, some of the clones have begun to charge, or allow for donations.
The legality of sites offering the MSN Chat Control has been in question for some time due to many "Clone Sites" hosting the Chat Control.
The Chat Control download is publicly available by Microsoft to download at .
Problems with MSN Chat
There were many documented problems from users about the MSN chat function. Most were directed to the “chat host.” This was a person who would enter the chat room under the name “host”, and act accordingly regulating the room. This service was useful for controlling the room, making sure that everyone was behaving accordingly, answering users’ questions about the rooms, and other assorted tasks. While the idea of a supervisor would put a lot of users at ease, there were reported disagreements between the two with what was considered appropriate.
A claim was that there were a multitude of rules which the host didn’t make clear to the users, so many people were booted out of the room for breaking a rule they weren’t aware of. Any content that was viewed as offensive or sexually explicit was immediately removed and the person who wrote it was expelled from the room. Asking other chatters to press certain keys, displaying any kind of URL, or displaying what location you were from were all offenses punishable by temporary banishment. The convenience of an automated system for MSN led to problems for its users, problems solvable by a person able to interpret positive and negative content.
A significant reason for MSN Chat shutting down was that it provided another opportunity for pedophiles and other sex-offenders to have access to youth through the chat rooms. The MSNBC program, "To Catch a Predator", a show about catching child predators, showed children meeting up with online "friends" which they assumed were being truthful about their identity but, on the show, were revealed to be pedophiles.
Closure
In 2001, Microsoft closed access via IRC clients (including Comic Chat), asking users to exclusively use their browser client instead. In 2003, Microsoft announced that it would close "unregulated" MSN Chat rooms in 28 countries, including "most of Asia" due to problems with spam and concerns about child pornography, with plans to convert to a subscription model for "better accountability." Messenger chat services remained open. MSN Chat became a subscription service for $20/year.
On August 31, 2006 Microsoft announced that MSN Chat would no longer be provided. On October 16, 2006 MSN Chat shut down their servers at about 11:30 a.m. EST. The service closed as allegedly MSN no longer deemed it profitable to run as a subscription service.
See also
Windows Live Messenger, another messaging service owned by Microsoft.
Skype, a messaging service bought by Microsoft.
References
External links
MSN Chat Administration Tools
History of MSN Chat
MSN
Internet Relay Chat
Online chat
|
554240
|
https://en.wikipedia.org/wiki/National%20Instruments
|
National Instruments
|
NI, formerly National Instruments Corporation, is an American multinational company with international operation. Headquartered in Austin, Texas, it is a producer of automated test equipment and virtual instrumentation software. Common applications include data acquisition, instrument control and machine vision.
In 2016, the company sold products to more than 35,000 companies with revenues of US$1.23 billion.
History
Founding
In the early 1970s, James Truchard, Jeff Kodosky, and Bill Nowlin were working at the University of Texas at Austin Applied Research Laboratories. As part of a project conducting research for the U.S. Navy, the men were using early computer technology to collect and analyze data. Frustrated with the inefficient data collection methods they were using, the three decided to create a product that would enable their task to be done more easily. In 1976, working in the garage at Truchard's home, the three founded a new company. They attempted to incorporate under several names, including Longhorn Instruments and Texas Digital, but all were rejected. Finally, they settled on the current name of National Instruments.
With a $10,000 loan from Interfirst Bank, the group bought a PDP-11/04 minicomputer and, for their first project, designed and built a GPIB interface for it. Their first sale was the result of a cold call to Kelly Air Force Base in San Antonio, Texas. Because the trio were still employed by the University of Texas, in 1977 they hired their first full-time employee, Kim Harrison-Hosen, who handled orders, billing, and customer inquiries. By the end of the year they had sold three boards, and, to attract more business, the company produced and sent a mailer to 15,000 users of the PDP-11 minicomputer. As sales increased, they were able to move into a real office space in 1978, occupying a office at 9513 Burnet Road in Austin, Texas.
1980s
At the end of the 1970s, the company booked $400,000 in orders, recording a $60,000 profit. In 1980 Truchard, Kodosky, and Nowlin quit their jobs to devote themselves full-time to National Instruments, and at the end of the year moved the company to a larger office, renting of office space. To assist in generating revenue, the company undertook numerous special projects, working on a fuel-pump credit-card system and a waveform generator for U.S. Navy sonar acoustic testing. By 1981, the company reached the $1 million sales mark, leading them to move to a office in 1982.
In 1983 National Instruments reached an organizational milestone, developing their first GPIB board to connect instruments to IBM PCs. With the arrival of the Macintosh computer, however, the company felt ready to take advantage of the new graphical interfaces. Kodosky began a research initiative with the assistance of student researchers at the University of Texas into ways to exploit the new interface. This led to the creation of NI's flagship product, the LabVIEW graphical development platform for the Macintosh computer, which was released in 1986. The software allows engineers and scientists to program graphically, by "wiring" icons together instead of typing text-based code. By allowing people to use a more intuitive, less-structured development environment, their productivity greatly increased, making LabVIEW quite popular. The following year, a version of LabVIEW, known as LabWindows, was released for the DOS environment.
The company had 100 employees by 1986. As part of the company's decision to begin direct sales of its products, NI opened its first international branch, in Tokyo, Japan in 1987.
1990s
After growing their staff enough to take over almost the entire building they were renting, in 1990 NI moved to a new building at 6504 Bridge Point Parkway, which the company purchased in 1991. The building, located along Lake Austin near the Loop 360 Bridge, became known as "Silicon Hills = Bridge Point."
NI received their first patent for LabVIEW in 1991. Later that year, they introduced Signal Conditioning eXtensions for Instrumentation (SCXI) to expand the signal-processing capabilities of the PC, and, in 1992, LabVIEW was first released for Windows-based PCs and Unix workstations. To further assist their customers, NI also created the National Instruments Alliance Partner program, attracting a worldwide selection of third-party developers, systems integrators, and consultants who could extend the capabilities of the NI hardware and software.
With LabVIEW now available to a much larger audience, in 1993 the company reached the milestone of $100 million in annual sales. To attract C/C++ programmers, later that year NI introduced LabWindows/CVI. The following year an industrious employee began experiments with the relatively new World Wide Web and developed natinst.com, the company's very first web page. As the company continued to grow, they began to run out of room in their approximately campus. In 1994, NI broke ground on a new campus, located at a site along North Mopac boulevard in northern Austin. By this time, NI had reached 1000 employees.
The new NI campus, which opened in 1998, was designed to be employee-friendly. It contains dedicated "play" areas, including basketball and volleyball courts, an employee gym, and a campus-wide walking trail. Each of the buildings on the campus are lined with windows and feature an open floor plan, so that the employees seated in cubicles throughout the building are never far from the sun and views of northwest Austin. To maintain the focus on equality among the employees, even "Dr. T", as the employees call their CEO, sits in an open cubicle and does not have an assigned parking space.
Employees had been granted stock in the privately held company as part of their compensation packages. When the company chose to go public in 1995, over 300 current and former employees owned stock. The company is now listed on the NASDAQ exchange as NATI.
By the late 1990s, customers had begun using LabVIEW in industrial automation applications. With LabVIEW and the more advanced DAQ boards provided by the company, engineers could now replace expensive, fixed-function, vendor-defined instruments with a custom PC-based system that would acquire, analyze, and present data with added flexibility and a lower cost. With the company's acquisition of Georgetown Systems Lookout software, NI products were further incorporated into applications run on the factory-floor. By 1996, the company had reached $200 million in annual sales, and was named to Forbes magazine's 200 Best Small Companies list.
Over the next several years, the engineers at NI continued to stretch the boundaries of virtual instrumentation, releasing machine vision software and hardware, which allow cameras to act as sensors, and motion control hardware and software. NI also introduced the CompactPCI-based PXI, an open industry standard for modular measurement and automation, and NI TestStand, which provides for tracking high-volume manufacturing tests.
2000s
User traffic and e-commerce rapidly improved after the company acquired the ni.com domain and began investing in web technologies to better highlight their products. The company quickly introduced online configuration tools to help customers decide which NI products would best interact to solve their problem, and introduced NI Developer Zone, which provides the end-user developers access to example programs, sample code, and development tips, as well as forums in which users and NI employees could help answer questions about the products.
In the 2000s, NI began exporting most of its manufacturing overseas by first opening its first international manufacturing plant in Debrecen, Hungary. This plant helped to diversify the company's manufacturing capabilities, which had been centered at company headquarters in Austin. NI now manufactures nearly 90% of its production in Debrecen and has expanded several times in the last decade. In 2011, with a multimillion-dollar grant from the government, NI increased production in Debrecen by approximately 20%. With state-of-the-art automation processes, headcount increased by only 2%.
In 2002, the company dedicated the Building C on their Mopac campus, which became the headquarters for the company's R&D operations. Upon completion of this building, the NI campus finally had enough capacity to move all Austin-based employees to a single location.
Following the company model of selling directly to customers, by 2006 NI had opened 21 sales offices in Europe and 12 offices in the Asia/Pacific region, as well as a multitude of offices in the Americas, Africa, and the Middle East. Research and Development centers are located in the U.S., Germany, India, Romania, China, Canada, and Malaysia.
2010s
In January 2013, National Instruments acquired all outstanding shares of Digilent Inc., which became a wholly owned subsidiary. Digilent was founded in 2000 by two Washington State University electrical engineering professors, Clint Cole and Gene Apperson and grew to become a multinational corporation in the engineering education sector, with sales of test and development products to thousands of universities. Digilent developed the open standard Pmod Interface.
2020s
On June 16, 2020, National Instruments announced that they were officially changing the company's name to "NI". On May 4, 2021, NI announced the acquisition of monoDrive, a provider of ultra-high fidelity simulation software for advanced driver-assistance systems (ADAS) and autonomous vehicle development.
Products
National Instruments' engineering software includes:
LabVIEW, a graphical development environment
LabVIEW Communications System Design Suite, A design environment designed for rapid deployment of communication systems.
LabWindows/CVI, an ANSI C programming environment
Measurement Studio, a set of components for Microsoft Visual Studio
NI TestStand, for test execution sequencing
NI VeriStand for real-time test
NI DIAdem for data management
NI Multisim for circuit design
NI Ultiboard for PCB design
NI Vision Builder for Automated Inspection
NI LabVIEW SignalExpress for data logging
NI Switch Executive for switch management
NI Requirements Gateway for requirements tracking
National Instruments' hardware platforms include:
NI CompactRIO, programmable FPGA-based industrial controller
NI roboRIO, a robotics controller used standard in the FIRST Robotics Competition
NI CompactDAQ, data acquisition systems for USB and Ethernet
PXI and PXIe Platforms, a modular instrumentation standard with more than 1,500 products
STS, a production-ready ATE solution for RF, mixed-signal, and MEMS
NI ELVIS, a multi-instrument lab station for teaching technology
Groups
Electronics Workbench Group
The National Instruments Electronics Workbench Group is responsible for creating the electronic circuit design software NI Multisim and NI Ultiboard, which was previously a Canada-based company that first produced MultiSIM, and integrated ULTIboard with it.
Interactive Image Technologies was founded in Toronto, Ontario, Canada by Joe Koenig, and specialized in producing educational movies and documentaries. When the government of Ontario needed an educational tool for teaching electronics in colleges, the company created a circuit simulator called Electronics Workbench. In 1996, Interactive Image Technologies appointed its vice president Roy Bryant to Chief Operating Officer to oversee day-to-day operations of the company and to grow the companies Electronic Design Automation (EDA) products. Bryant is credited with "overseeing the development and marketing of the company's Electronics Workbench EDA product". By 1999, Electronics Workbench was the most popular EDA in the world.
In 1998 the company started a strategic partnership with another electronic design automation company named Ultimate Technology from Naarden, Netherlands who was the European market leader in printed circuit board design software, with their package ULTIboard. Like Electronics Workbench, founder James Post had focused heavily on the educational market and gained PR fame when he organized the distribution of 180,000 demo floppy disks via electronics magazines in Europe.
In 1999 the companies merged, and renamed itself after its most well known product, Electronics Workbench. The then current product line consisted of schematic capture and a simulation product named MultiSIM and the printed circuit board software called Ultiboard. Soon thereafter the combined product suite became worldwide leader in PC based computer-aided design.
In 2005 the company was acquired by National Instruments, and rebranded as National Instruments Electronics Workbench Group.
Community
Beginning in 1995, National Instruments has held an annual developer conference in Austin, NIWeek. Engineers and scientists from around the world attend the week-long conference at the Austin Convention Center. Activities center on technical sessions on the company's products as well as the underlying technologies, presented both by NI employees and external presenters. An exhibition hall allows selected industry integrators and suppliers to showcase their products, and various customers or university students also present papers on their work with NI tools.
See also
List of companies based in Austin, Texas
Mechatronics
References
External links
NI home page
NI US Patents
Electronics companies of the United States
Manufacturing companies based in Austin, Texas
Companies listed on the Nasdaq
Electronics companies established in 1976
Electronic test equipment manufacturers
1976 establishments in Texas
|
35595643
|
https://en.wikipedia.org/wiki/Computer-based%20test%20interpretation%20in%20psychological%20assessment
|
Computer-based test interpretation in psychological assessment
|
Computer-based test interpretation (CBTI) programs are technological tools that have been commonly used to interpret data in psychological assessments since the 1960s. CBTI programs are used for a myriad of psychological tests, like clinical interviews or problem rating, but are most frequently exercised in psychological and neuropsychological assessments. CBTI programs are either empirically based or clinically based. The empirically based programs, or actuarial assessment programs, use statistical analyses to interpret the data, while the clinically based programs, or automated assessment programs, rely on information from expert clinicians and research. Although CBTI programs are successful in test-retest reliability, there have been major concerns and criticisms regarding the programs' ability to assess inter-rater and internal consistency reliability. Research has shown that the validity of CBTI programs has not been confirmed, due to the varying reports of individual programs. CBTI programs are very efficient in that they save time, reduce human error, are cost effective, and are objective/reliable, yet limited in that they are not always used by adequately trained evaluators or are not integrated with multiple sources of data. As technology continues to transform our modern society, computer-based interpretation programs have the possibility to expand their software and even alleviate some of the current concerns with the programs' methodology.
History
Computerized testing methods were first introduced over 60 years ago. The first program able to interpret computerized assessment data was developed in 1962 at the Mayo Clinic. The program was used to evaluate MMPI data from hospital patients and generated a list of 110 possible descriptive statements which corresponded to particular scale elevations. This rudimentary computerized interpretation is not far off from the methods used today. In 1969, the first program able to generate narrative reports based on scale configurations was released. By 1985, it was estimated that as many as 1.5 million MMPI protocols had been interpreted by computer-based test interpretation (CBTI) programs. In 1987 as many as 72 separate suppliers of over 300 computer-based assessment products were in existence, nearly half which were developed for personality assessment. Since this time, the popularity and accessibility of computer-based testing and CBTI programs has increased dramatically, a trend that will continue into the future as the utilization of technology in the mental health profession increases.
Present status
Currently, CBTI programs fall into one of two categories: actuarial assessment programs or automated assessment programs. Actuarial assessment programs are based on statistical or actuarial prediction (e.g., statistical analyses, linear regression equations and Bayesian rules), which is empirically based while automated assessment programs consist of a series of if-then statements derived by expert clinicians and informed by published research and clinical experience. For the purposes of this article, both types will be referred to as computer-based test interpretations (CBTIs). The use of CBTIs is found in a variety of psychological domains (e.g., clinical interviewing and problem rating), but is most commonly utilized in personality and neuropsychological assessments. This article will focus on the use of CBTIs in personality assessment, most commonly using the MMPI and its subsequent revised editions.
Reliability
The ability for CBTIs to eliminate human-error is considered a benefit, and as a result reliability of CBTIs is considered to be better than those of clinician interpretations. However, CBTIs have demonstrated poor reliability. Research regarding the equivalence of CBTIs and paper-and-pencil measures has been found to be equivocal (for reviews see). Further, CBTI research has been criticized for failure to assess inter-rater (comparing the interpretation of one protocol by two different programs) and internal consistency reliability (comparing the reliability of different sections of the same interpretation). On the other hand, test-retest reliability of CBTIs is considered perfect (i.e., the same protocol will repeatedly yield the same interpretation), if the same program is used.
Validity
Research on the validity of CBTIs tends to utilize three types of studies: external criterion studies (comparing the CBTI report to some external criterion measure of the construct, such as a self-report or behavioral measure), consumer satisfaction studies (asking clients whether the reports are accurate representations of themselves), and comparison with clinical conclusions (comparing CBTI reports to clinician interpretations). Comprehensive reviews of CBTI validity can be found elsewhere (e.g.,). In general, the validity of CBTIs has not been demonstrated, and the validity of individual CBTI systems has been found to vary. However, many validity studies are flawed due to small samples, criterion contamination, the Barnum effect, inadequate input data to generate powerful statistical prediction rules, unreliability of measures and the practice of generalizing across testing situations and populations without considering potential moderators.
Strengths and weaknesses
CBTI programs can be found for nearly every type of personality assessment available today. CBTI programs arguably have many benefits over traditional hand-scored assessments and clinician interpretations which may contribute to their popularity. For example, CBTI programs save time and eliminate human responding and scoring errors. Further, CBTI programs are often more comprehensive than clinician interpretation, tend to be more reliable than clinician interpretation, are cost effective, and more objective which may allow clients to be more accepting of feedback.
Despite these benefits, there are significant limitations of CBTIs to consider. For example, CBTI reports may suggest an unwarranted impression of scientific precision and reports may be too general to provide differential information. Additionally, CBTIs may promote exceedingly cavalier attitudes towards clinical assessment and interpretation, and as they are increasingly available to inadequately trained evaluators, the potential for misuse is high. Clinicians are cautioned to educate themselves before using CBTI programs, not to blindly interpret computer-generated reports as true or use CBTIs as a way to circumvent their responsibilities as a clinician to integrate multiple sources of data.
Future
As our healthcare system and society as a whole becomes increasingly reliant on technology, it is inevitable that the availability and use of CBTI software will also expand. The potential of the internet for extending the use of CBTIs has been recognized, although the potential problems associated with this modality have yet to be fully understood and will need to be addressed before the use of internet-based CBTI utilization proliferates. In addition, the application of computer-adaptive testing, although successfully applied in other assessment domains (i.e., ability and aptitude), provides a promising, yet under researched addition to personality assessment. Lastly, there is a call for the more effective integration of clinical and computer-based prediction methods, beginning with a partnership between clinicians and researchers in the development of CBTI programs.
See also
Personality test
Psychological testing
References
Further reading
Psychological Assessment Special Section on the Use of Computers for Making Judgments and Decisions, 2000, 12(1)
Psychological testing
|
21837508
|
https://en.wikipedia.org/wiki/Link%20Quality%20Report
|
Link Quality Report
|
The Link Quality Report (LQR) protocol is a part of the Point-to-Point Protocol (PPP), which allows two computers to connect to each other. LQR allows peers at either end of the PPP link to assess the state and quality of the PPP link.
LQR only transmits counts of packets sent, received, and rejected with errors. It does not report on signal noise or attenuation.
In order to produce Link Quality Reports, a PPP peer has to implement Link Quality Monitoring. Link Quality Monitoring consists of maintaining a number of counters. These counters include:
Packets Transmitted
Packets received
Octets (or bytes) transmitted
Octets received
Number of LQRs transmitted
Number of LQRs received
Number of Octets received without error.
The use of LQRs are negotiated when the PPP link is first established. Any peer that wants to receive LQR packets signals this by sending a PPP configuration Option with the following data:
Type - always 4
Length - always 8
Quality Protocol - 0xC025 for Link Quality Reports
Reporting period - the maximum time between LQR packets, in hundredths of seconds. The remote peer may send them more often. If set to zero, then the remote peer should send an LQR whenever it receives an LQR from the other peer.
An LQR is one packet containing the counters above, as well as:
a Magic Number that is used to detect looping conditions
the last transmitted count of LQRs, packets and Octets transmitted
number of packets discarded
Number of packets found to have errors.
In addition, the receiving peer will add the following fields to the LQR packet when it arrives:
The number of LQRs that have been received.
The number of Packets that have been received
the number of received packets discarded
The number of received packets found to have errors
the number of received Octets.
These numbers come from the MIB database that the PPP receive logic maintains. They are saved for use in the next LQR packet that the peer sends.
Problems with LQRs
A number of PPP implementations cause errors with LQR generation. Other implementations negotiate correctly for LQRs, but then fail to send them. This leads to the local peer determining that the PPP link has failed.
This has led to most users using the less capable LCP echos to detect whether the link is still functioning. LCP echos cannot provide the information that LQR could provide.
References
RFC1989 - "PPP Link Quality Monitoring", August 1996. http://www.ietf.org/rfc/rfc1989.txt
RFC1333 - "PPP Link Quality Monitoring", August 1992. http://www.ietf.org/rfc/rfc1333.txt
Logical link control
|
2869030
|
https://en.wikipedia.org/wiki/ILIOS
|
ILIOS
|
ILIOS is an acronym of InterLink Internet Operating System. It is an attempt to create a router-only operating system; one specifically oriented towards computer networking purposes, especially routing. It supports IPv4 routing and is a good educational OS, though it is single tasking and does everything via interrupts.
It is released under the BSD License. The author of this research OS is Rink Springer, who is also responsible for porting FreeBSD to the Xbox.
External links
ILIOS - Trac Rink Springer's website
Free software operating systems
Software using the BSD license
|
10760804
|
https://en.wikipedia.org/wiki/Alloy%20Computer%20Products
|
Alloy Computer Products
|
Alloy Computer Products is an Australian manufacturer of information technology products based near Melbourne. As of 2007, the company currently markets networking and VoIP products. The company was originally based in Framingham, Massachusetts and by 1990 was part of the Fortune 500. At one point Alloy was a major producer of QIC format tape drives and other computer peripherals. In the mid 1990s the company was no longer profitable. It filed for bankruptcy in the U.S. and the Australian subsidiary was bought out by the management team from the Australian division.
Alloy Computer Products, Inc., was founded in 1979. Alloy was initially founded to supply hard drive and tape backup systems for S-100 bus computers running CP/M. When IBM's PC was released, Alloy provided hard drive storage and tape backup solutions for the new system. Alloy Computer Products later developed and marketed multi-user computer systems for the emerging microcomputer marketplace. Alloy later developed printing accelerator hardware.
In 1984 Alloy developed the PC-Slave card which consisted of an X86 (8086 or V20) processor, either 256k or 1 Meg of memory and two serial ports. Later, an Intel 80286-based version was released, called the PC-Slave/286. These cards used RTNX (later renamed NTNX) to allow the host computer to provide disk storage and printing support. Dumb PC-Term terminals were attached to the PC-Slave to allow the running of DOS programs. At the time, using this solution was more cost-effective than using separate networked computers, but as computers and networking hardware became cheaper and cheaper, Alloy's advantage was overshadowed by the disadvantages of not being able to support graphics, etc. Alloy also developed a PC-Bus expansion bus system to allow the install of up to 32 PC-Slave cards attached to a single host PC. This allowed 32 user networks to be created, but each network was completely standalone.
Based on the knowledge learned by developing the PC-Slave card, in 1985 Alloy developed the DOS-73 co-processor board for the AT&T UNIX PC, allowing AT&T's Unix based UNIX PC (aka the PC 7300 and the 3B1) to run MS-DOS based programs.
Alloy grew to $50 million in annual sales by 1986 and executed a successful IPO in June of that year. Alloy had an installed base of 150,000 users by the early 1990s, largely small businesses, comprising a relatively significant portion of the multi-user DOS marketplace. One DOS based computer was equipped with a multi-user/multi-tasking operating system called "386/MultiWare" which along with specialized hardware could provide serial connectivity to up to 20 dumb terminal clients. Each dumb terminal was connected to a session running up to 8 concurrent DOS virtual machines, all running on the host computer. If a problem arose with a single DOS virtual machine it could be rebooted without an effect on other terminals attached. Later "MultiNode" was introduced to meet client needs using the Novell network operating system allowing both Client/Server network connectivity as well as serial terminal users.
See also
Multiuser DOS Federation
References
External links
Corporate website.
Buyout info.
Scans of magazine advertisements from 1983 illustrating their then-current product line.
Alloy files for bankruptcy.
Alloy Computer Products to market Micro Advice's JETstream! printer accelerator card
AT&T Unix-PC system
Manufacturing companies of Australia
Companies based in Framingham, Massachusetts
|
19448595
|
https://en.wikipedia.org/wiki/University%20of%20Mindanao
|
University of Mindanao
|
The University of Mindanao is the largest private, non-sectarian university in Mindanao located in Davao City on the Southern Philippine island. Established in 1946, the University of Mindanao has ten branches spread over thirteen campuses in Southern Mindanao. It is currently an Autonomous Status per CEB Resolution No. 076-2009 with Category A (t) per CMO No. s. 2009 standing accredited by Commission on Higher Education (CHED). Its Accountancy, Computer Engineering and Information Technology programs are Centers of Development(COD) and its Business Administration, Criminology and Teacher Education programs are recognized as Centers of Excellence(COE) by CHED. It is the largest private university in Mindanao and hailed as the institution with the second highest number of programs accredited by PACUCOA in the country today.
History
In the midst of rebuilding the ruins of World War II, Atty. Guillermo E. Torres constructed the institution that would provide the education for socially, morally, economically knowledgeable, productive and responsible citizenry of the country.
Mindanao Colleges was incorporated on July 27, 1946. During the first year of operation, classes were held in four rented rooms of the Borgaily Building along San Pedro Street in Davao City. Thirteen teachers were hired and there were 381 enrollees. Dr. Efigenia C. Occeña was the Acting Coordinator. The permitted courses were originally the six year complete Elementary Course, two-year Secondary Course (1st and 2nd years), two year Elementary Teacher Certificate, two-year Associate in Commercial Science, and two-year Associate in Arts. To accommodate the increasing number of enrollees, the Board of Trustees decided to buy Club Royale along Legaspi Street and renovated it to suit classroom requirements. New parcels of land were purchased along Bolton and Bonifacio Street which is the present location of the main campus and Embassy Area respectively. The University's influence erected more with the establishment of the Mindanao Collegian, the first free campus newspaper in Mindanao. It became the training ground of the Davao newspaper men, a lot of them front liners of the city's local publications up to this date.
Foreign linkages were sparked when Atty. Torres left for the US for a sponsored study tour in May 1955. These bondages broaden the UM's scope and help it gear up for more challenging global competitiveness. Some of them were the University on the Air (1971); Sister University agreements with the John Dewey International University Consortium of America, New York City and the Fongchia College of Engineering and Business of Taipei, Taiwan.
The Open Education Program in the early 70s enabled the institution to help the poor but deserving college undergraduates employed in the business and factory sites and self-employed to earn a college education. From being a humble Mindanao Colleges in Bolton, it blossomed into the University of Mindanao on December 21, 1966 and has spawned 10 more branches to the outlying province in 1948 in Digos, Bangoy, Peñaplata, Tagum (1950), Guianga (1952), Ilang-Tibungco (1951), Panabo (1951), Bansalan (1962), Cotabato City (1959), Toril and a sprawling learning ground in Matina. UM is the first non-sectarian university in Mindanao.
Academics
The University of Mindanao has more than 10 colleges and schools located in three campuses. The Colleges of Business Administration, and Law and the Graduate School are located in Bolton Campus. The Colleges of Arts and Sciences, Nursing, Engineering, Computing, Architecture, Education, Forestry, Accountancy, and Criminology are located in Matina Campus. There are Technical and Vocational Courses are located in Bangoy Campus. Each college is supervised by Dean and Program Heads/Instructor Coordinator.
Most of its academic programs are accredited by the Philippine Association of Colleges and Universities Commission on Accreditation (PACUCOA) and the Federation of Accrediting Agencies of the Philippines (FAAP). Its Electrical Engineering is the first in the country granted Level III Reaccredited Status. Level III status is the highest accreditation granted by PACUCOA—a seal of excellence and quality in a given academic program. Its Architecture Program is the first in the country to be granted Level I Accreditation. UM is the first PACUCOA school in Mindanao granted Level III for various academic programs and one of the top five (5) schools in the Philippines with the most number of accreditation.
The Commission on Higher Education (CHED) has granted Center of Excellence (COE) and Center of Development (COD) to its various academic programs, having the most number of COEs and CODs in Mindanao. The programs granted with COE are Teacher Education, Criminology, and Business Administration. The programs granted with COD are Accountancy, Computer Engineering, Information Technology, Electrical Engineering and Mechanical Engineering. UM Digos College granted with COD on Information Technology program. UM Tagum College granted with COD on Teacher Education program.
Student life
Student Scholarships
Member - UM Choir/Band
Member - UM Makabayan Dancers
Honors - Valedictorian to Honorable mention in High School
STAP - Student's Assistant Program Scholarship
Athletics - PRISAA and Palarong Pambansa
Student Publication
The official student publication of the university is Primum, Latin term for first. Its predecessor, the Mindanao Collegian, which was later renamed as UM Saga and then EVO prior to its recent name. Since Mindanao Collegian, the publication has been producing top-caliber editors, journalists and columnists in the country not just in the entire region.
Broadcasting
The University of Mindanao Broadcasting Network (UMBN) is a commercial broadcasting company in Visayas and Mindanao founded in 1949 in Davao City. It runs AM and FM stations in Mindanao while its affiliate, Ditan Communications run the Visayas FM stations.
Newspaper
Mindanao Times, founded on the same year the University was founded, is an affiliate of University of Mindanao.
Notable alumni
Mary Jean Lastimosa - Miss Universe Philippines 2014; Miss Universe 2014 Top 10 Semi-Finalist
Hon. Allan L. Rellon - Mayor of Tagum City
Hon. Paolo Duterte - Congressman, 1st District of Davao City
Atty. Walter O. Junia - RTC Judge, Branch 39 (Special Court for Environmental Cases), Lingayen, Pangasinan
Atty. Felix S. Alicer - Former Regional Technical Director (RTD) for Land Management Service (LMS) of the Department of Environment and Natural Resources, Regional Office No. XI
Hon. Danilo Dayanghirang - multi-termer Davao City Councilor
Jose Ariel L. Noble, Economics/Summa Cum Laude - Corporate Planning Head, DCWD
Atty. Emmanuel Mahipus - multi-termer Davao City Councilor, Former LTFRB Executive Director
Atty. Evangeline Presto-Hernaez - Legal Officer, SSS-Davao
Peter Blair Agustin - Vice President, BDO Unibank and Chief Risk and Compliance Officer, BDO Leasing and Finance
Lourdes M. Mission - President, COHREP XI and Executive Director of EHMAR Human and Environmental College
Anthony Halog, Ph.D., MBA - Professor, School of Earth and Environmental Sciences, The University of Queensland, Australia; Research Citations: 2,264; h-index: 23; Research interests: Circular Economy and many more
Albert B. Jubilo, EdD - PIChE Fellow (2018), Former President, CFU-AdDU; Former Vice Chair, Academe Industry Tripartite Council - XI; Outstanding Chemical Engineer of the Philippines (2010) of the Philippine Institute of Chemical Engineers, Inc.; National P.R.O. of the Philippine Institute of Chemical Engineers, Inc. (PIChE)
Mamerto A. Irasga - Former National Executive Vice President of the Philippine Institute of Chemical Engineers, Inc. (PIChE)
Isabelita L. Buduan - Chief, Regional Soils Laboratory, DA-XI; Outstanding Chemical Engineer of the Philippines (2017) of the Philippine Institute of Chemical Engineers, Inc.
Charlito L. Cañezares, D-Engg - Outstanding Mechanical Engineer of the Philippines (2017); Dean, UM College of Engineering Education; President, CoDEE-XI
Jocelyn Espina - Outstanding Chemical Engineer of the Philippines (2016) of the Philippine Institute of Chemical Engineers, Inc.; Former Acting Chief, Davao City Environment & Natural Resources Office
Rogelio J. Lu - Outstanding Chemical Engineer of the Philippines (2008) of the Philippine Institute of Chemical Engineers, Inc.; Former President, PIChE Davao Chapter; Former Manager, Davao Central Chemical Corporation
Edwin V. Regalado - General Manager of the Davao City Water District
Roel E. Lucas - Partner, SyCip, Gorres, Velayo & Co. (SGV & Co.)
References
External links
UM Alumni, Students, Faculty Online Community
Mindanao Students' Writing Center
University of Mindanao Alumni Official Website
Official Website
Universities and colleges in Davao City
Educational institutions established in 1946
1946 establishments in the Philippines
|
16939285
|
https://en.wikipedia.org/wiki/TinkerPlots
|
TinkerPlots
|
TinkerPlots is exploratory data analysis and modeling software designed for use by students in grades 4 through university. It was designed by Clifford Konold and Craig Miller at the University of Massachusetts Amherst and is currently published by the Learn Troop. It runs on Windows XP or later and Mac OS 10.4 or later. The program allows users to enter their own data, to import them from other applications or the Web, or to generate them using a sampling engine. The program also comes with 50 multivariate data sets.
Using TinkerPlots, students can make a large variety of graphs, including those specified for middle school in Common Core State Standards for Mathematics But rather than making these graphs directly using commands, students construct them by progressively organizing cases using basic operations including “stack,” “order,” and “separate.” Responding to these operations, case icons animate into different screen positions. The interface was based on observations of people organizing “data cards” on a table to make graphs to answer specific questions
Innovations of TinkerPlots include using a superimposed color gradient to detect covariation in two numeric attributes and a “hat plot,” a reformulated and generalized version of the box plot.
The latest version is 2.3.4. This version does not have substantively different features from versions 2.1 and 2.2, but has a number of bug fixes and enhancements to remain compatible with the latest versions of Windows and MacOS.
Critical acclaim
ComputED 2010 Best Educational Software (BESSIE) Award
ComputED 2008 Education Software Review (EDDIE) Award.
Parents' Choice Silver Honor, 2005
Technology & Learning Award of Excellence, 2005
References
Additional References
Bakker, A., Derry, J., & Konold, C. (2006). Using technology to support diagrammatic reasoning about center and variation. In A. Rossman & B. Chance (Eds.) Proceedings of the 7th International Conference on Teaching Statistics (ICOTS) CD-ROM. Salvador, Bahai, Brazil, July 2–7, 2006.
Konold, C., & Lehrer, R. (in press). Technology and mathematics education: An essay in honor of Jim Kaput. In L. English (Ed.), Handbook of International Research in Mathematics Education, (2nd edition). New York: Routledge.
Rubin, A., Hammerman, J., & Konold, C. (2006). Exploring informal inference with interactive visualization software. In A. Rossman & B. Chance (Eds.) Proceedings of the 7th International Conference on Teaching Statistics (ICOTS) CD-ROM. Salvador, Bahai, Brazil, July 2–7, 2006.
Educational Materials using TinkerPlots
Konold, C. (2005). Exploring Data with TinkerPlots. Key Curriculum Press, . Contents: Getting Started, Learning TinkerPlots, Teaching with TinkerPlots, Activities, Activity Notes.
Brodesky, A., Doherty, A., & Stoddard, J. (2008). Digging into Data with TinkerPlots. Key Curriculum Press, 225 pp. . Contents: (1) Comparisons, Distributions, and Line Plots: Exploring Data about Cats, (2) Comparisons and Boxplots: Investigating Data about Middle-School Students, (3) Comparisons using Formulas: Investigating Data about Signatures and Words, (4) Measures of Center and Histograms: Analyzing Safety Data, (5) Relationships between Attributes and Scatter Plots: Investigating Sports Data.
Walsh, T. (2009). The Survey Toolkit: Collecting Information, Analyzing Data, and Writing Reports. Contents: Choosing a Research Question, Developing and Giving the Survey, Analyzing Survey Data, Sharing Results. 112pp. .
TinkerPlots Instructional Movies (2010). These 10 short movies where developed by the Statistics Education Research Group in 2010, and published with TinkerPlots, in QuickTime and AVI format. Titles: TinkerPlots Basics, Adding Data, Making Common Graphs, Comparing Groups, Exploring Relationships 1, Exploring Relationships 2, Building a Data Factory, Simulating Group Differences, Probabilities Simulation, Creating Sample Spaces
TinkerPlots Workshop Guide (2007). .
TinkerPlots Walkthrough Guide and Quick Reference Card (included in Instructors Evaluation Edition).
Free TinkerPlots Activities and Resources on Key Curriculum Website
Free TinkerPlots Activities and Resources on University of Massachusetts Website
History
TinkerPlots 2.3.1 - 2.3.4, Published 2016-2018 by Learn Troop
TinkerPlots 2.3, published August, 2015 by Learn Troop.
TinkerPlots 2.2, published June, 2014 by University of Massachusetts Amherst.
TinkerPlots 2.1, published November, 2012 by Key Curriculum.
TinkerPlots 2.0, published April, 2011 by Key Curriculum.
TinkerPlots 1.1, published June, 2009 by Key Curriculum.
TinkerPlots 1.0, published September, 2004 by Key Curriculum.
External links
TinkerPlots 2.3 publishers web site at Learn Troop
TinkerPlots 2.2 publishers web site at University of Massachusetts Amherst
TinkerPlots 2.1 publishers web site at Key Curriculum
Exploratory data analysis
Plotting software
Educational software
|
25871
|
https://en.wikipedia.org/wiki/Code%20refactoring
|
Code refactoring
|
In computer programming and software design, code refactoring is the process of restructuring existing computer code—changing the factoring—without changing its external behavior. Refactoring is intended to improve the design, structure, and/or implementation of the software (its non-functional attributes), while preserving its functionality. Potential advantages of refactoring may include improved code readability and reduced complexity; these can improve the source codes maintainability and create a simpler, cleaner, or more expressive internal architecture or object model to improve extensibility. Another potential goal for refactoring is improved performance; software engineers face an ongoing challenge to write programs that perform faster or use less memory.
Typically, refactoring applies a series of standardised basic micro-refactorings, each of which is (usually) a tiny change in a computer program's source code that either preserves the behaviour of the software, or at least does not modify its conformance to functional requirements. Many development environments provide automated support for performing the mechanical aspects of these basic refactorings. If done well, code refactoring may help software developers discover and fix hidden or dormant bugs or vulnerabilities in the system by simplifying the underlying logic and eliminating unnecessary levels of complexity. If done poorly, it may fail the requirement that external functionality not be changed, and may thus introduce new bugs.
Motivation
Refactoring is usually motivated by noticing a code smell. For example, the method at hand may be very long, or it may be a near duplicate of another nearby method. Once recognized, such problems can be addressed by refactoring the source code, or transforming it into a new form that behaves the same as before but that no longer "smells".
For a long routine, one or more smaller subroutines can be extracted; or for duplicate routines, the duplication can be removed and replaced with one shared function. Failure to perform refactoring can result in accumulating technical debt; on the other hand, refactoring is one of the primary means of repaying technical debt.
Benefits
There are two general categories of benefits to the activity of refactoring.
Maintainability. It is easier to fix bugs because the source code is easy to read and the intent of its author is easy to grasp. This might be achieved by reducing large monolithic routines into a set of individually concise, well-named, single-purpose methods. It might be achieved by moving a method to a more appropriate class, or by removing misleading comments.
Extensibility. It is easier to extend the capabilities of the application if it uses recognizable design patterns, and it provides some flexibility where none before may have existed.
Performance engineering can remove inefficiencies in programs, known as software bloat, arising from traditional software-development strategies that aim to minimize an application's development time rather than the time it takes to run. Performance engineering can also tailor software to the hardware on which it runs, for example, to take advantage of parallel processors and vector units.
Challenges
Refactoring requires extracting software system structure, data models, and intra-application dependencies to get back knowledge of an existing software system.
The turnover of teams implies missing or inaccurate knowledge of the current state of a system and about design decisions made by departing developers. Further code refactoring activities may require additional effort to regain this knowledge.
Refactoring activities generate architectural modifications that deteriorate the structural architecture of a software system. Such deterioration affects architectural properties such as maintainability and comprehensibility which can lead to a complete re-development of software systems.
Code refactoring activities are secured with software intelligence when using tools and technics providing data about algorithms and sequences of code execution. Providing a comprehensible format for the inner-state of software system structure, data models, and intra-components dependencies is a critical element to form a high-level understanding and then refined views of what needs to be modified, and how.
Testing
Automatic unit tests should be set up before refactoring to ensure routines still behave as expected. Unit tests can bring stability to even large refactors when performed with a single atomic commit. A common strategy to allow safe and atomic refactors spanning multiple projects is to store all projects in a single repository, known as monorepo.
With unit testing in place, refactoring is then an iterative cycle of making a small program transformation, testing it to ensure correctness, and making another small transformation. If at any point a test fails, the last small change is undone and repeated in a different way. Through many small steps the program moves from where it was to where you want it to be. For this very iterative process to be practical, the tests must run very quickly, or the programmer would have to spend a large fraction of their time waiting for the tests to finish. Proponents of extreme programming and other agile software development describe this activity as an integral part of the software development cycle.
Techniques
Here are some examples of micro-refactorings; some of these may only apply to certain languages or language types. A longer list can be found in Martin Fowler's refactoring book and website. Many development environments provide automated support for these micro-refactorings. For instance, a programmer could click on the name of a variable and then select the "Encapsulate field" refactoring from a context menu. The IDE would then prompt for additional details, typically with sensible defaults and a preview of the code changes. After confirmation by the programmer it would carry out the required changes throughout the code.
Techniques that allow for more understanding
Program Dependence Graph - explicit representation of data and control dependencies
System Dependence Graph - representation of procedure calls between PDG
Software intelligence - reverse engineers the initial state to understand existing intra-application dependencies
Techniques that allow for more abstraction
Encapsulate field – force code to access the field with getter and setter methods
Generalize type – create more general types to allow for more code sharing
Replace type-checking code with state/strategy
Replace conditional with polymorphism
Techniques for breaking code apart into more logical pieces
Componentization breaks code down into reusable semantic units that present clear, well-defined, simple-to-use interfaces.
Extract class moves part of the code from an existing class into a new class.
Extract method, to turn part of a larger method into a new method. By breaking down code in smaller pieces, it is more easily understandable. This is also applicable to functions.
Techniques for improving names and location of code
Move method or move field – move to a more appropriate class or source file
Rename method or rename field – changing the name into a new one that better reveals its purpose
Pull up – in object-oriented programming (OOP), move to a superclass
Push down – in OOP, move to a subclass
Automatic clone detection
Hardware refactoring
While the term refactoring originally referred exclusively to refactoring of software code, in recent years code written in hardware description languages has also been refactored. The term hardware refactoring is used as a shorthand term for refactoring of code in hardware description languages. Since hardware description languages are not considered to be programming languages by most hardware engineers, hardware refactoring is to be considered a separate field from traditional code refactoring.
Automated refactoring of analog hardware descriptions (in VHDL-AMS) has been proposed by Zeng and Huss. In their approach, refactoring preserves the simulated behavior of a hardware design. The non-functional measurement that improves is that refactored code can be processed by standard synthesis tools, while the original code cannot. Refactoring of digital hardware description languages, albeit manual refactoring, has also been investigated by Synopsys fellow Mike Keating. His target is to make complex systems easier to understand, which increases the designers' productivity.
History
The first known use of the term "refactoring" in the published literature was in a September, 1990 article by William Opdyke and Ralph Johnson.
Griswold's Ph.D. thesis,
Opdyke's Ph.D. thesis, published in 1992, also used this term. Although refactoring code has been done informally for decades, William Griswold's 1991 Ph.D. dissertation is one of the first major academic works on refactoring functional and procedural programs, followed by William Opdyke's 1992 dissertation on the refactoring of object-oriented programs, although all the theory and machinery have long been available as program transformation systems. All of these resources provide a catalog of common methods for refactoring; a refactoring method has a description of how to apply the method and indicators for when you should (or should not) apply the method.
Martin Fowler's book Refactoring: Improving the Design of Existing Code is the canonical reference.
The terms "factoring" and "factoring out" have been used in this way in the Forth community since at least the early 1980s. Chapter Six of Leo Brodie's book Thinking Forth (1984) is dedicated to the subject.
In extreme programming, the Extract Method refactoring technique has essentially the same meaning as factoring in Forth; to break down a "word" (or function) into smaller, more easily maintained functions.
Refactorings can also be reconstructed posthoc to produce concise descriptions of complex software changes recorded in software repositories like CVS or SVN.
Automated code refactoring
Many software editors and IDEs have automated refactoring support. It is possible to refactor application code as well as test code. Here is a list of a few of these editors, or so-called refactoring browsers.
DMS Software Reengineering Toolkit (Implements large-scale refactoring for C, C++, C#, COBOL, Java, PHP and other languages)
Eclipse based:
Eclipse (for Java, and to a lesser extent, C++, PHP, Ruby and JavaScript)
PyDev (for Python)
Photran (a Fortran plugin for the Eclipse IDE)
Embarcadero Delphi
IntelliJ based:
Resharper (for C#)
AppCode (for Objective-C, C and C++)
IntelliJ IDEA (for Java)
PyCharm (for Python)
WebStorm (for JavaScript)
PhpStorm (for PHP)
Android Studio (for Java)
JDeveloper (for Java)
NetBeans (for Java)
Smalltalk: Most dialects include powerful refactoring tools. Many use the original refactoring browser produced in the early '90s by Ralph Johnson.
Visual Studio based:
Visual Studio (for .NET and C++)
CodeRush (addon for Visual Studio)
Visual Assist (addon for Visual Studio with refactoring support for C# and C++)
Wing IDE (for Python)
Xcode (for C, Objective-C, and Swift)
Qt Creator (for C++, Objective-C and QML)
See also
Amelioration pattern
Code review
Database refactoring
Decomposition (computer science)
Modular programming
Obfuscated code
Prefactoring
Separation of concerns
Software peer review
Test-driven development
References
Further reading
External links
What Is Refactoring? (c2.com article)
Martin Fowler's homepage about refactoring
Extreme programming
Technology neologisms
|
38368
|
https://en.wikipedia.org/wiki/John%20Carmack
|
John Carmack
|
John D. Carmack II (born August 20, 1970) is an American computer programmer and video game developer. He co-founded the video game company id Software and was the lead programmer of its 1990s games Commander Keen, Wolfenstein 3D, Doom, Quake, and their sequels. Carmack made innovations in 3D computer graphics, such as his Carmack's Reverse algorithm for shadow volumes. In 2013, he resigned from id to work full-time at Oculus VR, where he served as CTO and later Consulting CTO in 2019.
Biography
Early life
Carmack was born in Shawnee Mission, Kansas, the son of local television news reporter Stan Carmack. He grew up in the Kansas City metropolitan area, where he became interested in computers at an early age. He attended Shawnee Mission East High School in Prairie Village, Kansas and Raytown South High School in nearby Raytown, Missouri.
Carmack was introduced to video games with the 1978 shoot 'em up game Space Invaders in the arcades during a summer vacation as a child. The 1980 maze chase arcade game Pac-Man also left a strong impression on him. He cited Nintendo designer Shigeru Miyamoto as the game developer he most admired.
As reported in David Kushner's Masters of Doom, when Carmack was 14, he broke into a school to help a group of children steal Apple II computers. To gain entry to the building, Carmack concocted a sticky substance of thermite mixed with Vaseline that melted through the windows. However, an overweight accomplice struggled to get through the hole and instead opened the window, setting off a silent alarm and alerting police. Carmack was arrested and sent for psychiatric evaluation. He was sentenced to a year in a juvenile home. He attended the University of Missouri–Kansas City for two semesters before withdrawing to work as a freelance programmer.
Career
Softdisk, a computer company in Shreveport, Louisiana, hired Carmack to work on Softdisk G-S (an Apple IIGS publication), introducing him to John Romero and other future key members of id Software such as Adrian Carmack (not related). Later, Softdisk would place this team in charge of a new, but short-lived, bi-monthly game subscription product called Gamer's Edge for the IBM PC (DOS) platform. In 1990, while still at Softdisk, Carmack, Romero, and others created the first of the Commander Keen games, a series that was published by Apogee Software, under the shareware distribution model, from 1991 onwards. Afterwards, Carmack left Softdisk to co-found id Software.
Carmack has pioneered or popularized the use of many techniques in computer graphics, including "adaptive tile refresh" for Commander Keen, ray casting for Hovertank 3D, Catacomb 3-D, and Wolfenstein 3D, binary space partitioning which Doom became the first game to use, surface caching which he invented for Quake, Carmack's Reverse (formally known as z-fail stencil shadows) which he devised for Doom 3, and MegaTexture technology, first used in Enemy Territory: Quake Wars. Quake 3 popularized the fast inverse square root algorithm.
Carmack's engines have also been licensed for use in other influential first-person shooters such as Half-Life, Call of Duty and Medal of Honor. In 2007, when Carmack was on vacation with his wife, he ended up playing some games on his cellphone, and decided he was going to make a "good" mobile game.
On August 7, 2013, Carmack joined Oculus VR as their CTO. On November 22, 2013, he resigned from id Software to work full-time at Oculus VR. Carmack's reason for leaving was that id's parent company ZeniMax Media did not want to support Oculus Rift. Carmack's role at both companies later became central to a ZeniMax lawsuit against Oculus' parent company, Facebook, claiming that Oculus stole ZeniMax's virtual reality intellectual property. The trial jury absolved Carmack of liability, though Oculus and other corporate officers were held liable for trademark, copyright, and contract violations.
In February 2017, Carmack sued ZeniMax, claiming the company had refused to pay him the remaining $22.5 million owed to him from their purchase of id Software. By October 2018, Carmack stated that he and ZeniMax reached an agreement and that "Zenimax has fully satisfied their obligations to me", ending the suit.
On November 13, 2019, Carmack announced that he was stepping down from the Oculus CTO role to become a "Consulting CTO" in order to allocate more time to his work on artificial general intelligence (AGI).
Armadillo Aerospace
Around 2000, Carmack became interested in rocketry, a hobby of his youth. Reviewing how much money he was spending on customizing Ferraris, He began by giving financial support to a few local amateur engineers. Carmack funded the company, called Armadillo Aerospace, out of his own pocket, for "something north of a million dollars a year." The company of hobbyists made steady progress toward their goals of suborbital space flight and eventual orbital vehicles. In October 2008, Armadillo Aerospace competed in a NASA contest known as the Lunar Lander Challenge, winning first place in the Level 1 competition along with $350,000. In September 2009, they completed Level 2 and were awarded $500,000. The company went into "hibernation mode" in 2013.
Open-source software
Carmack is a well-known advocate of open-source software, and has repeatedly voiced his opposition to software patents, equating them to robbery. He has also contributed to open-source projects, such as starting the initial port of the X Window System to Mac OS X Server and working to improve the OpenGL drivers for Linux through the Utah GLX project.
Carmack released the source code for Wolfenstein 3D in 1995 and the Doom source code in 1997. When the source code to Quake was leaked and circulated among the Quake community underground in 1996, a programmer unaffiliated with id Software used it to port Quake to Linux, and subsequently sent the patches to Carmack. Instead of pursuing legal action, id Software, at Carmack's behest, used the patches as the foundation for a company-sanctioned Linux port. id Software has since publicly released the source code to Quake, Quake 2, Quake 3 and lastly Doom 3 (and later the BFG Edition), all under the GNU General Public License (GPL). The Doom source code was also re-released under the GPL in 1999. The id Tech 4 engine, more commonly known as the "Doom 3 engine", has also been released as open-source license under the GPL. The source code for Hovertank 3D and Catacomb 3D (as well as Carmack's earlier Catacomb) was released in June 2014 by Flat Rock Software with Carmack's blessing. On the other hand, Carmack has several times over the years voiced a skeptical opinion about Linux as a gaming platform; for instance in 2013 he argued for emulation as the "proper technical direction for gaming on Linux" and in 2014 he voiced the opinion that Linux might be the biggest problem for the success of the Steam Machine.
Carmack contributes to charities and gaming communities. Some of the recipients of Carmack's charitable contributions include his former high school, promoters of open-source software, opponents of software patents, and game enthusiasts.
Personal life
Carmack was so successful at id that by mid-1994 he had purchased two Ferraris: a 328 and a Ferrari Testarossa. In 1997, he gave away one of his Ferraris (a 328 model) as a prize to Dennis Fong, the winner of the Quake tournament "Red Annihilation".
He met his [at-that-time] wife, Katherine Anna Kang, at the 1997 QuakeCon when she visited id's offices. As a bet, Kang challenged Carmack to sponsor the first All Female Quake Tournament if she was able to produce a significant number of participants. Carmack predicted a maximum of 25 participants, but there were 1,500. Carmack and Kang married on January 1, 2000, and planned a ceremony in Hawaii. Steve Jobs requested that they would postpone the ceremony so he could attend the MacWorld Expo on January 5, 2000. Carmack declined and suggested making a video instead. Carmack and his wife had a son in 2004. Carmack has a blog last updated in 2006 (previously a .plan), an active Twitter account, and also occasionally posts comments to Slashdot.
Carmack changed his married status to divorced on December 30, 2021 He changed it to 'in a relationship' on February 24th, 2022.
As a game developer, Carmack differed from many of his contemporaries by avoiding commitment to a final release date for any game he was developing. Instead, when asked for a release date on a new game, Carmack would usually reply that the game would be released "when it's done". In 2019, as a guest on the Joe Rogan podcast, Carmack stated that his beliefs have changed over time: "I largely recant from that now." On Rage 6-year development time he says: "I think we should have done whatever it would have taken to ship it 2 years earlier". Carmack also reflects on the internal development of Quake in this regard and describes it as "traumatic" and says id Software could have split the game into two parts and shipped it earlier.
Employees at Apogee, in their past years the publishers of games by id Software, adopted this business practice as well.
Carmack supported the 2012 presidential campaign of Libertarian Ron Paul.
Carmack is an atheist.
During a conversation with Joe Rogan, Carmack revealed that he had trained Brazilian Jiu Jitsu and Judo for several years as a hobby.
During his time at id Software, a medium pepperoni pizza would arrive for Carmack from Domino's Pizza almost every day, carried by the same delivery person for more than 15 years. Carmack had been such a regular customer that they continued to charge him 1995 prices.
On occasion he has commended the efforts of similarly focused programmers – first Ken Silverman, who wrote the Build engine for 3D Realms, and later with Tim Sweeney of Epic Games, who wrote the Unreal Engine.
Recognition
{|class="wikitable sortable"
|-
! width="10% | Date !! width="30%" class="unsortable" | Award !! width="60%" class="unsortable" | Description
|-
|
| Named among the most influential people in computer gaming of the year and of all time
| #1 and #2 in GameSpots lists.
|-
|
|Named among the most influential people of all time
|#7 in Computer Gaming World list, for game design.
|-
|
| Named among the 50 most influential people in technology
| #10 in Time'''s list.
|-
|
| Award for community contribution for the Quake 3 engine
| Used in 12 games. Bestowed at 2001 Game Developer's Conference Award Ceremony.
|-
|
| Inducted into Academy of Interactive Arts and Sciences' Hall of Fame
| The fourth person to be inducted, an honor bestowed upon those who have made revolutionary and innovative achievements in the video and computer game industry.
|-
|
| Named to the MIT Technology Review TR100
| Included as one of the top 100 innovators in the world under the age of 35.
|-
|
| One subject of book Masters of Doom| Masters of Doom is a chronicle of id Software and its founders.
|-
|
| Name in film
| The film Doom featured a character named Dr. Carmack, in recognition of Carmack who co-created the original game.
|-
|
| Added to the Walk of Game
| Walk of Game is an event that recognizes the developers and games with the most impact on the industry.
|-
|
| Awarded 2 Emmy Awards
| Carmack and id Software were awarded with two Emmy Awards. The first was Science, Engineering & Technology for Broadcast Television, which includes broadcast, cable and satellite distribution. The second was for Science, Engineering and Technology for Broadband and Personal Television, encompassing interactive television, gaming technology, and for the first time, the Internet, cell phones, private networks, and personal media players. id Software is the first independent game developer to be awarded an Emmy since the Academy began honoring technology innovation in 1948.
|-
|
| Television appearance
| Appeared on Discovery Channel Canada Daily Planet featuring his rocket designs along with the Armadillo Aerospace team.
|-
|
| Honored
| Carmack was honored at the 59th Annual Technology & Engineering Emmy Awards for Quake's pioneering role of user modifiability. He is the only game programmer ever honored twice by the National Academy of Television Arts & Sciences, having been given an Emmy Award in 2007 for his creation of the 3D technology that underlies modern shooter video games. Along with Don Daglow of Stormfront Studios and Mike Morhaime of Blizzard Entertainment, Carmack is one of only three game developers to accept awards at both the Technology & Engineering Emmy Awards and at the Academy of Interactive Arts & Sciences Interactive Achievement Awards.
|-
|
| Won X-Prize
| Carmack's Armadillo Aerospace won the $350,000 Level One X-Prize Lunar Lander Challenge.
|-
|
| Lifetime Achievement Award
| Was awarded the Game Developers Conference Lifetime Achievement award for his work.
|-
|
|BAFTA Fellowship Award
|Honoured with the Academy's highest honour, the Fellowship for "work that has consistently been at the cutting edge of games and his technical expertise helping the future arrive that little bit faster".
|-
|
|Honorary Doctorate
|Received a Doctor of Engineering Honoris Causa from the University of Missouri, Kansas City for "his work in cutting edge tech & comp sci".
|}
Games
References
Further reading
Kushner, David (2003). Masters of Doom: How Two Guys Created an Empire and Transformed Pop Culture'', New York: Random House. .
External links
1970 births
Living people
20th-century American businesspeople
20th-century atheists
21st-century American businesspeople
21st-century atheists
Academy of Interactive Arts & Sciences Hall of Fame inductees
American aerospace businesspeople
American aerospace designers
American aerospace engineers
American atheists
American computer businesspeople
American male bloggers
American bloggers
American software engineers
American technology chief executives
American technology company founders
American video game designers
American video game programmers
Businesspeople from Kansas
Businesspeople from Texas
BAFTA fellows
Emmy Award winners
Facebook employees
Free software programmers
Id Software people
People from Heath, Texas
People from Johnson County, Kansas
Texas Libertarians
Virtual reality pioneers
Game Developers Conference Lifetime Achievement Award recipients
|
18473453
|
https://en.wikipedia.org/wiki/DESCHALL%20Project
|
DESCHALL Project
|
DESCHALL, short for DES Challenge, was the first group to publicly break a message which used the Data Encryption Standard (DES), becoming the $10,000 winner of the first of the set of DES Challenges proposed by RSA Security in 1997. It was established by a group of computer scientists led by Rocke Verser assisted by Justin Dolske and Matt Curtin and involved thousands of volunteers who ran software in the background on their own machines, connected by the Internet. They announced their success on June 18, only 96 days after the challenge was announced on January 28.
Background
To search the 72 quadrillion possible keys of a 56-bit DES key using conventional computers was considered impractical even in the 1990s. Rocke Verser already had an efficient algorithm that ran on a standard PC and had the idea of involving the spare time on hundreds of other such machines that were connected to the internet. So they set up a server on a 486-based PS/2 PC with 56MB of memory and announced the project via Usenet towards the end of March. Client software was rapidly written for a large variety of home machines and eventually some more powerful 64 bit systems.
There were two other main contenders: SoINET (a Swedish group), and a group at Silicon Graphics, a manufacturer of high-performance computers, which was in the lead until late in the day. Other groups using supercomputers withdrew after SYN flood attacks on their networks.
The Project
With the software that was used, a single 200 MHz Pentium system was able to test approximately 1 million keys/second if it was doing nothing else. At this rate it would take around 2,285 years to search the entire key-space. The number of computers being used rose rapidly and in the end, a total of 78,000 different IP addresses had been recorded, with a maximum of 14,000 unique hosts in a 24-hour period. By the time the key was found, they had searched about a quarter of the key-space and were searching about 7 billion keys per second, but the number of participants was still increasing rapidly.
The solution was:
Strong cryptography makes the world a safer place.
The owner of the computer that found the solution was awarded $4,000 of the prize, with the rest going to the originator of the project.
The conclusion of the paper describing the project was "We have demonstrated that a brute-force search of DES keyspace is not only possible, but is also becoming practical for even modestly funded groups. RSA's prize for the find was US$10,000; it is safe to say that DES is inadequate for protecting data of any greater value."
See also
Brute Force: Cracking the Data Encryption Standard
distributed.net
RSA Factoring Challenge
RSA Secret-Key Challenge
Footnotes
References
External links
Archive of project material
DESCHALL home page
Press Release announcing success
Cryptography contests
Data Encryption Standard
|
35318785
|
https://en.wikipedia.org/wiki/Factor%20%28Unix%29
|
Factor (Unix)
|
On Unix, Plan 9, and Unix-like computer systems, factor is a utility for factoring an integer into its prime factors.
History
factor first appeared on 5th edition Research Unix in 1974, as a "user maintained" utility (section 6 of the manual). In the 7th edition in 1979, it was moved into the main "commands" section of the manual (section 1). From there, the factor utility was copied to all other variants of Unix, including commercial Unixes and BSD. In some variants of Unix, it is classified as a "game" more than a serious utility, and therefore documented in section 6.
A free software version of the factor utility was written for the GNU project by Paul Rubin, in 1986. It is now available on all Linux distributions as part of the GNU Core Utilities. In 2008, GNU factor started to use the GNU MP library for arbitrary-precision arithmetic, allowing it to factor integers of any size, not limited by the machine's native datatypes.
The command is available as a separate package for Microsoft Windows as part of the UnxUtils collection of native Win32 ports of common GNU Unix-like utilities.
Syntax
factor [number]
The command can be used by supplying an integer value. Various projects, including simple ones such as printing prime numbers, are facilitated by using this command.
References
External links
GNU's factor manual page
FreeBSD's factor man page
Unix software
Plan 9 commands
|
235324
|
https://en.wikipedia.org/wiki/Jonny%20Lee%20Miller
|
Jonny Lee Miller
|
Jonathan Lee Miller (born 15 November 1972) is an English film, television and theatre actor. He achieved early success for his portrayal of Simon "Sick Boy" Williamson in the dark comedy drama film Trainspotting (1996) and as Dade Murphy in Hackers (1995) before earning further critical recognition for his performances in Afterglow (1997), Mansfield Park (1999), The Flying Scotsman (2006), Endgame (2009) and T2 Trainspotting (2017); for The Flying Scotsman he received a London Film Critics' Circle nomination for Actor of the Year. He was also part of the principal cast in the films Melinda and Melinda (2004), Dark Shadows (2012) and Byzantium (2013). He has appeared in several theatrical productions, most notably After Miss Julie and Frankenstein, the latter of which earned him an Olivier Award for Best Actor.
Miller starred as the title character in the ABC comedy-drama Eli Stone, for which he received a Satellite Award nomination for Best Actor. This was followed by another starring role in the BBC costume drama Emma and a supporting role as Jordan Chase in the fifth season of the Showtime drama Dexter. From 2012 to 2019 he starred as a modern-day version of Sherlock Holmes in the CBS crime drama Elementary, which earned him his second Satellite Award nomination for Best Actor.
Early life
Miller was born on 15 November 1972 in Kingston-upon-Thames and was raised in south west London. The son of Anna (Lee) and Alan Miller, he was inspired by his parents to go into acting. Both were theatre actors. His grandfather was actor Bernard Lee, who played M in the first eleven James Bond films.
Miller attended Tiffin School as a child. He appeared in several school plays such as The Ragged Child and performed as part of the Tiffin Swing Band. He joined the National Youth Music Theatre, where he met fellow actor Jude Law. He left school, aged 16 after taking his GCSEs, to pursue an acting career.
Career
Television
Miller made his television debut with an uncredited appearance in the BBC series Doctor Who at the age of nine in the 1982 episode Kinda. The following year he appeared in Jemima Shore and had a role as Charles Price in the serial drama Mansfield Park. In 1991, he costarred, with Alexei Sayle in "'Itch", which was broadcast on Channel 4 as part of the 4 Play strand, a platform for a series of one-off plays that ran from 1989 to 1991. The play was written by Alexei Sayle and David Stafford. Miller played "Dennis Turnbull", the teenaged son of Gordon and Susan Turnbull. He then appeared in various television shows throughout the 1990s. These included Keeping Up Appearances in 1990, followed by Inspector Morse and Minder in 1991. He appeared in two separate guest roles in the ITV police drama The Bill, one in 1991 and another in 1993, as well as single-episode roles in the BBC drama Between the Lines and the medical drama Casualty, both of which were broadcast in 1992.
In 1993's third instalment of Prime Suspect, Miller played a young man victimised as a child by a paedophile. His first notable acting role that year was in the soap opera EastEnders wherein he played Jonathan Hewitt. Miller later revealed he had been offered a contract to remain on the show but declined: "It was five weeks' work and I made more money there than I ever had in my life. Then they offered me a year's contract. I said no, thank God. I thought I should get out of there while I still could."
In 2003, Miller appeared in the BBC modernisation of The Canterbury Tales in the episode The Pardoner's Tale and had a starring role as Lord Byron in the television film Byron. He then starred alongside Ray Liotta in the CBS drama Smith. However, the show was canceled after only seven episodes. Miller was then cast as the eponymous character in the legal comedy-drama Eli Stone. The show ran for two seasons on ABC and he received a Satellite Award nomination for Best Actor. He then starred in the BBC costume drama Emma as George Knightley.
Miller appeared in a guest role as Jordan Chase in the fifth season of the Showtime drama Dexter, for which he received a nomination for Screen Actors Guild Award for being part of the main cast in the category of Outstanding Performance by an Ensemble in a Drama Series. In early 2010, it was reported he was set to portray Rick Grimes in the television adaptation of the comic The Walking Dead. It was later revealed that Andrew Lincoln had been cast. In 2011, Miller auditioned for the role of Sherlock Holmes in the CBS adaption based on the works of Arthur Conan Doyle. He originally turned down the part, as he feared it would be too similar to the BBC version Sherlock. However, after receiving the script he accepted the part, and it was officially announced he would star in Elementary, alongside Lucy Liu. This earned him his second Satellite Award nomination for Best Actor.
In 2021, it was announced that he was to star in season five of The Crown, as former British Prime Minister, John Major.
Film
He first starred in the film Hackers (1995), with Angelina Jolie, whom he married in 1996. Shortly after Hackers, Miller was cast as Sick Boy in Trainspotting. He was suggested for the role by Ewan McGregor. The accent he used in the film was regarded as convincing, leading some people to incorrectly believe that he was Scottish. Miller has stated: "I had to do a lot of work. I read and re-read the book and I pretended to be Scottish all the time I was in Glasgow, hanging around with Scots, picking up bits and pieces on the street and in bars. Everyone's been very encouraging and Danny thinks that I've got it about right. Of course, the others are from all over Scotland and have different accents themselves, so I've tried to just pick up a general, composite accent."
In 1997, he played Billy Prior in the film adaptation of Pat Barker's World War I novel Regeneration. In 2000, he played Cameron Colley in Complicity, based on the book by Iain Banks. He costarred in the film Love, Honour and Obey as Johnny, a London street kid getting mixed up with a notorious British gangster. Also in 2000, he appeared as Simon Sheppard in Wes Craven's Dracula 2000. In 2006 Miller portrayed cyclist Graeme Obree in The Flying Scotsman.
He was considered as the third teammate to join Ben Fogle and James Cracknell in Team QinetiQ for the Amundsen Omega 3 South Pole Race in January 2009. He participated in training for the event in Norway, which was televised for a BBC2 documentary series On Thin Ice. He was not able to attend the race because of filming commitments, after Eli Stone was extended for a second season.
In 1997, he was involved with the creation and operation of the production company Natural Nylon with friend Jude Law. Natural Nylon folded in 2003.
Theatre
In November 1999, he played Brito in Paul Corcoran's Four Nights in Knaresborough at the Tricycle Theatre, London. In March 2011, at the Royal National Theatre, he played both Victor Frankenstein and Frankenstein's Monster on alternate nights, opposite Benedict Cumberbatch, in a stage adaptation of Frankenstein. Directed by Danny Boyle, the play was broadcast to cinemas worldwide as part of National Theatre Live on 17 March 2011 and additional dates throughout March and April. He also appeared on Broadway in a production of After Miss Julie, with his performance receiving very positive reviews. In March 2004, he played Christian in Festen by David Eldridge at The Almeida Theatre in London.
Awards and honours
Laurence Olivier Award (2012)
Satellite Award (2008, 2012)
IQ Award (2014)
Initially Edward Snowden had been nominated by Mensa members, and the IQ commission had approved his nomination, the managing board of Mensa revoked Snowden's nomination because "Mensa is not allowed to comment on political issues." In protest, Miller was then proposed by one member, for his portrayal of Sherlock Holmes. He won the most votes to take the award.
Personal life
Miller married actress Angelina Jolie on 28 March 1996. They separated 18 months later and were divorced in 2000; however, they remain close friends. He began dating actress and model Michele Hicks in 2006. They married in July 2008 in Malibu, California. The couple have one son, Buster Timothy Miller, born in December 2008. They divorced in 2018.
He is a marathon runner, often supporting the charity Mencap. Miller was signed up to run the 2006 Marathon des Sables, but had to drop out due to shooting a film. He ran the 2008 London Marathon in 3:01:40. Miller is an advocate to finding treatment for the disease Sanfilippo syndrome, following a case with five-year-old Jonah Weishaar. In 2014, he addressed the Congressional caucus in Washington, D.C., on behalf of rare disease organisations, in the hope of securing funding for treatment research.
In November 2014, he became an American citizen.
Muay Thai
Miller has trained in both Muay Thai and Brazilian Jiu-Jitsu at Evolution Muay Thai in New York City. In May 2018, he took part in an exhibition Muay Thai bout held at Chok Sabai Gym in New York City, which followed a five-week training camp leading up to the event.
On 1 February 2019, Miller made his Muay Thai debut at "Friday Night Fights" held at Broad Street Ballroom in New York City, where he took on Robert Bermudez in the scheduled-for-three-rounds 145-pound bout. Miller won the fight by knockout in the third round with a right cross – left hook combination.
Filmography
Film
Television
Stage
Awards and nominations
Kickboxing record
Legend:
See also
List of actors who have played Sherlock Holmes
List of British actors
List of people from Kingston upon Thames
References
External links
1972 births
20th-century English male actors
21st-century English male actors
Male actors from London
English expatriates in the United States
English male film actors
English male soap opera actors
English male stage actors
English male child actors
Laurence Olivier Award winners
British expatriate male actors in the United States
Living people
People educated at Tiffin School
People from Kingston upon Thames
|
34499
|
https://en.wikipedia.org/wiki/Zlib
|
Zlib
|
zlib ( or "zeta-lib", ) is a software library used for data compression. zlib was written by Jean-loup Gailly and Mark Adler and is an abstraction of the DEFLATE compression algorithm used in their gzip file compression program. zlib is also a crucial component of many software platforms, including Linux, macOS, and iOS. It has also been used in gaming consoles such as the PlayStation 4, PlayStation 3, Wii U, Wii, Xbox One and Xbox 360.
The first public version of zlib, 0.9, was released on 1 May 1995 and was originally intended for use with the libpng image library. It is free software, distributed under the zlib License.
Capabilities
Encapsulation
zlib compressed data are typically written with a gzip or a zlib wrapper. The wrapper encapsulates the raw DEFLATE data by adding a header and trailer. This provides stream identification and error detection that are not provided by the raw DEFLATE data.
The gzip header, used in the ubiquitous gzip file format, is larger than the zlib header, as it stores a file name and other file system information.
Algorithm
, zlib only supports one algorithm, called DEFLATE, which uses a combination of a variation of LZ77 (Lempel–Ziv 1977) and Huffman coding. This algorithm provides good compression on a wide variety of data with minimal use of system resources. This is also the algorithm used in the Zip archive format. The header makes allowance for other algorithms, but none are currently implemented.
Resource use
zlib provides facilities for control of processor and memory use. A compression level value may be supplied that trades speed for compression. There are also facilities for conserving memory, useful in restricted memory environments, such as some embedded systems.
Strategy
The compression can be optimized for specific types of data. If one is using the library to always compress specific types of data, then using a specific strategy may improve compression and performance. For example, if the data contain long lengths of repeated bytes, the run-length encoding (RLE) strategy may give good results at a higher speed. For general data, the default strategy is preferred.
Error handling
Errors in compressed data may be detected and skipped. Further, if "full-flush" points are written to the compressed stream, then corrupt data can be skipped, and the decompression will resynchronize at the next flush point — although no error recovery of the corrupt data is provided. Full-flush points are useful for large data streams on unreliable channels, where some data loss is unimportant, such as in some multimedia applications. However, creating many flush points can affect the speed as well as the amount (ratio) of compression.
Data length
There is no limit to the length of data that can be compressed or decompressed. Repeated calls to the library allow an unlimited number of blocks of data to be handled. Some ancillary code (counters) may suffer from overflow for long data streams, but this does not affect the actual compression or decompression.
When compressing a long (or infinite) data stream, it is advisable to write regular full-flush points.
Applications
Today, zlib is something of a de facto standard, to the point that zlib and DEFLATE are often used interchangeably in standards documents, with thousands of applications relying on it for compression, either directly or indirectly. These include:
The Linux kernel, where zlib is used to implement compressed network protocols, compressed file systems, and to decompress the kernel image at boot time.
GNU Binutils and GNU Debugger (GDB)
libpng, the reference implementation for the PNG image format, which specifies DEFLATE as the stream compression for its bitmap data.
libwww, an API for Web applications like Web browsers.
The Apache HTTP Server, which uses zlib to implement HTTP/1.1.
Similarly, the cURL library uses zlib to decompress HTTP responses.
The OpenSSH client and server, which rely on zlib to perform the optional compression offered by the Secure Shell protocol.
The OpenSSL and GnuTLS security libraries, which can optionally use zlib to compress TLS connections.
The FFmpeg multimedia library, which uses zlib to read and write the DEFLATE-compressed parts of stream formats, such as Matroska.
The rsync remote file synchronizer, which uses zlib to implement optional protocol compression.
The dpkg and RPM package managers, which use zlib to unpack files from compressed software packages.
The Apache Subversion and CVS version control systems, which use zlib to compress traffic to and from remote repositories.
The Apache ORC column-oriented data storage format use ZLib as its default compression method.
The Git version control system uses zlib to store the contents of its data objects (blobs, trees, commits and tags).
The PostgreSQL RDBMS uses zlib with custom dump format (pg_dump -Fc) for database backups.
The class System.IO.Compression.DeflateStream of the Microsoft .NET Framework 2.0 and higher.
The "deflate" utility in TORNADO as part of VxWorks Operating System made by Wind River Systems uses zlib to compress boot ROM images.
, raw zlib compression program, part of qpdf
The MySQL RDBMS uses ZLib LZ77 for compression in InnoDB Tables
zlib is also used in many embedded devices, such as the Apple iPhone and Sony PlayStation 3, because the code is portable, liberally licensed, and has a relatively small memory footprint.
Forks
A commonly used library built on an old codebase, zlib is also frequently forked by third-parties that claim improvements to this library:
Intel has a high-performance fork of zlib.
CloudFlare maintains a high-performance fork with "massive" improvements.
Zlib-ng is a zlib replacement fork with optimizations for "next generation" systems.
See also
DEFLATE
gzip
LZ77 and LZ78 § LZ77
Zip (file format)
zlib License
Zopfli
References
External links
— ZLIB Compressed Data Format
— DEFLATE Compressed Data Format
—GZIP file format
1995 software
C (programming language) libraries
Free data compression software
Free software programmed in C
Software using the zlib license
|
305074
|
https://en.wikipedia.org/wiki/Business%20card
|
Business card
|
Business cards are cards bearing business information about a company or individual. They are shared during formal introductions as a convenience and a memory aid. A business card typically includes the giver's name, company or business affiliation (usually with a logo) and contact information such as street addresses, telephone number(s), fax number, e-mail addresses and website. Before the advent of electronic communication business cards might also include telex details. Now they may include social media addresses such as Facebook, LinkedIn and Twitter. Traditionally, many cards were simple black text on white stock, and the distinctive look and feel of cards printed from an engraved plate was a desirable sign of professionalism. In the late 20th century, technological advances drove changes in style, and today a professional business card will often include one or more aspects of striking visual design.
Prior to the COVID-19 pandemic, approximately 7 billion business cards were printed around the world every year. The American company Vistaprint indicates sales of the cards dropped 70 percent during the pandemic, but sales have rebounded in mid-2021.
Construction
Business cards are printed on some form of card stock, the visual effect, method of printing, cost and other details varying according to cultural or organizational norms and personal preferences. The common weight of a business card varies some by location. Generally, business cards are printed on stock that is 350 g/m2 (density), 45 kg (100 lb) (weight), or 12 pt (thickness).
The advent of personal laser and inkjet printers made it possible for people to print business cards at home, using specially designed pre-cut stock. At first, these cards were noticeably lighter in weight, and the perforations could be felt along the edges, but improvements in the design of both printers and paper have made it possible to print cards with a professional look and feel.
High quality business cards without full-color photographs are normally printed using spot colors on sheet-fed offset printing presses. Some companies have gone so far as to trademark their spot colors (examples are UPS brown, Owens-Corning pink, and Cadbury's purple). If a business card logo is a single color and the type is another color, the process is considered two-color. More spot colors can be added depending on the needs of the card. With the onset of digital printing, and batch printing, it is now cost effective to print business cards in full color.
To simulate the effect of printing with engraved plates, a less-expensive process called thermography was developed that uses the application of a plastic powder, which adheres to the wet ink. The cards are then passed through a heating unit, which melts the plastic onto the card. Spot UV varnish onto matte laminate can also have a similar effect.
Full color cards, or cards that use many colors, are printed on sheetfed presses as well; however, they use the CMYK (cyan, magenta, yellow, and black) four-color printing process. Screens of each color overprinted on one another create a wide gamut of color. The downside to this printing method is that screened colors if examined closely will reveal tiny dots, whereas spot color cards are printed solid in most cases. Spot colors should be used for simple cards with line art or non-black type that is smaller than 5 points.
Some terminology in reference to full-color printing:
4/0 - Full color front / No print on back
4/1 - full color front / One color on reverse
4/4 - full color front / Full color back
These names are pronounced as "four over zero," "four over one," and "four over four".
A business card can also be coated with a UV glossy coat (offset-uv printing). The coat is applied just like another ink using an additional unit on a sheetfed press. That being said, UV coats can also be applied as a spot coating - meaning areas can be coated, and other areas can be left uncoated. This creates additional design potential. UV Coating is not to be confused with coated stock, which has a gloss or semi gloss finish that is applied before printing.
Business cards can also be printed with a digital copier, which uses toner fused onto the surface of the card, however many modern printing firms instead utilise high end "Digital Presses," now distinct from office copiers, which range from light production units such as the Bizhub 5500 from Konica Minolta, to state of the art units such as the latest HP Indigo Digital Presses.
While some of the older office copiers may have had problems running heavy business card stock, the newest digital presses can print on stock as heavy as 407 g/m2 (150# cover stock), and special substrates such as polypropylene. Available in both sheet-fed and web-fed models, many modern digital presses can emulate Pantone spot colors, print in up to seven colours in one pass, and some even contain embedded spectrophotometers and air-assisted feeding systems.
UV coats, and other coatings such as aqueous coatings are used to speed manufacturing of the cards. Cards that are not dry will "offset", i.e., the ink from the front of one card will mark up back of the next one. UV coatings are generally highly glossy but are more likely to fingerprint, while aqueous coatings are not noticeable but increase the life of the card. It is possible to use a dull aqueous coating on uncoated stock and get some very durable uncoated cards, and using UV coating or plastic lamination can also be applied to thicken thin stocked cards and make them more durable as well.
When cards are designed, they are given bleeds if color extends to the edge of the finished cut size. (A bleed is the extension of printed lines or colors beyond the line where the paper it is printed on will be cut.) This is to help ensure that the paper will cut without white edges due to very small differences in where the blade cuts the cards, and it is almost impossible to cut the cards properly without. Just being a hair off can result in white lines, and the blade itself will pull the paper while cutting. The image on the paper can also shift from page to page which is called a bounce, which is generally off by a hairline on an offset press, but can be quite large on lower end equipment such as a copier or a duplicator press. Bleeds are typically an extra 3.175 () to 6.35 mm ( in) to all sides of the card.
(US)
Bleed size: 95.25 × 57.15 mm (3.75 × 2.25 in) ( in bleeds)
Standard cut size: 89 × 51 mm (3.5 × 2 in)
(UK)
Bleed size: 91 × 61 mm (3.58 × 2.40 in)
Standard cut size: 85 × 55 mm (3.35 × 2.17 in)
Fold-over or "tent" cards, and side fold cards are popular as well. Generally these cards will fold to the standard size.
Cards can also be printed with a different language on each side.
Dimensions
Aspect ratios range from 1.42 to 1.8. There is no standard for the business card dimensions. Sharing dimensions with other cards makes storage easier, for example banking cards (85.60 × 53.98 mm) and business cards in Western Europe (85 × 55 mm) have almost the same size.
Global variations
Japan
A Japanese business card is called a . It typically features the company name at the top in the largest print, followed by the job title and then the name of the individual. This information is written in Japanese characters on one side and often Latin characters on the reverse. Other important contact information is usually provided, such as business address, phone number and fax number. Meishi may also contain a QR code to provide contact details in a machine-readable form, but this has not yet become a widespread practice. According to a 2007 survey, fewer than 3% of Japanese people own a meishi with a QR code printed on it.
The presentation of one's meishi to another person is more formal and ritualistic than in the Western world. The card should be held at the top two corners, face up and turned so that it can be read by the person receiving the meishi, who takes it by the bottom two corners using both hands. Placing one's fingers over the name or other information is considered rude. Upon receiving the meishi, one is expected to read the card over, noting the person's name and rank. One should then thank the other person, saying "choudai itashimasu" ("I accept your name card") or "choudai shimasu", and then bow. When meishi are being exchanged between parties with different status, such as between the president of a company and someone in middle management, it is proper that the person of lower status extend his or her business card in such a way that it is underneath or below the meishi being extended by the person in a higher position.
Meishi should be kept in a smart leather case where they will not become warm or worn, both of which are considered a sign of disrespect or thoughtlessness. A received meishi should not be written on or placed in a pocket; it is considered proper to file the meishi at the rear of the leather case. If the meishi is being presented at a table, the recipient keeps the meishi on top of the leather case until they leave the table. If several people are involved in the meeting and one receives several meishi, the one with the highest rank is kept on the leather case, and the others beside it, on the table.
The manner in which the recipient treats the presenter's meishi is indicative of how the recipient will treat the presenter. Actions such as folding the card in half, or placing the presenter's meishi in one's back pocket, are regarded as insults.
Japanese executives or officials usually has two meishi: one in Japanese and intended for fellow Japanese, using the Japanese ordering of names (family name first), and another intended for foreigners, with the name in Western order (family name last).
Other formats
Various technological advances made Compact Disc "business cards" possible, which could hold about 35 to 100 MB of data. These business card CDs may be square, round or oblong but are approximately the same size as a conventional business card. CD business cards are designed to fit within the 80 mm tray of a computer's CD-ROM drive. They are playable in most tray computer CD drives, but do not work in slot-loading drives. Despite the ability to include dynamic presentations and a great deal of data, these discs were never in common use as business cards, though they are still available.
With handheld computers and smartphones becoming more ubiquitous, business card data is increasingly exchanged electronically via direct wireless connections (e.g. infra-red, Bluetooth, RFID), SMS, specialized apps (e.g. Bump) or via a cloud service (e.g. licobo). Once again however, these new methods of transmitting business information have yet to completely replace the traditional physical business card.
Special materials
Apart from common business cards made of paper/card there are also special business cards made from plastic (PVC), especially frosted translucent plastic, crystal clear plastic, white or metallic plastic. Other extraordinary materials are metal, rubberized cards, rubber, magnets, poker chips, wooden nickels, and even real wood. For the most part those special material business cards are of standard format, sometimes with rounded corners.
Business card software
Business cards can be mass-produced by a printshop or printed at home using business card software. Such software typically contains design, layout tools, and text editing tools for designing one's business cards. Most business card software integrates with other software (like mail clients or address books) to eliminate the need of entering contact data manually. Cards are usually printed on business card stock or saved in an electronic form and sent to a printshop. Multiple programs are available for users of Linux, macOS and Windows platforms.
Web-to-print
In addition to business card software, many printing firms now offer a web-to-print service, which allows the customer to choose from a selection of stock design templates, customize online using their own logos and imagery, select quantities, view pricing options and request them for delivery to home or business addresses. Often this process is applied not only to business cards, but also to letterheads, notepads, labels and compliments slips.
Collecting
There are several hundred known collectors of business cards, especially antique cards, celebrity cards, or cards made of unusual materials. One of the major business card collectors' clubs is the International Business Card Collectors, IBCC. IBCC members exchange cards with other members, simply for the price of postage.
For dating
Business-style cards are also used by some for dating. These cards typically have the bearer's name, their contact information, and may also feature a humorous quote or piece of information about the individual.
See also
Carte de visite
Comp card
hCard
vCard
Visiting card
References
Stationery
Paper products
|
40363371
|
https://en.wikipedia.org/wiki/SoftEther%20VPN
|
SoftEther VPN
|
SoftEther VPN is free open-source, cross-platform, multi-protocol VPN client and VPN server software, developed as part of Daiyuu Nobori's master's thesis research at the University of Tsukuba. VPN protocols such as SSL VPN, L2TP/IPsec, OpenVPN, and Microsoft Secure Socket Tunneling Protocol are provided in a single VPN server. It was released using the GPLv2 license on January 4, 2014. The license was switched to Apache License 2.0 on January 21, 2019.
SoftEther VPN supports NAT traversal, making it useful to run VPN servers on computers that are behind residential gateways, facility routers, and firewalls. Firewalls performing deep packet inspection are unable to detect SoftEther's VPN transport packets as a VPN tunnel because HTTPS is used to camouflage the connection. SoftEther server currently binds to ALL IP addresses on the server. Preventing servers hosting SSL sites from utilizing the VPN over SSL feature.
SoftEther VPN optimizes performance by using full Ethernet frame utilization, reducing memory copy operations, parallel transmission, and clustering. Together, these reduce latency normally associated with VPN connections while increasing throughput.
The SoftEther VPN Server is unable to bind to specific IP addresses on a machine, negating one of its biggest features. A server running an SSL website cannot run SoftEther on the same machine, thereby preventing it from using the SSL-VPN tunnel functionality that the software is famous for.
Interoperability
SoftEther VPN Server and VPN Bridge run on Windows, Linux, OS X up to OS X 10.8, FreeBSD, and Solaris operating systems. SoftEther VPN Client runs on Windows, Linux, and macOS.
SoftEther VPN Server serves the SoftEther VPN protocol, but it also serves OpenVPN, Microsoft Secure Socket Tunneling Protocol (SSTP), SSL VPN, EtherIP, L2TPv3, and IPsec. It serves mobile devices running iOS, Android, and Windows Phone via L2TP/IPsec.
VPN clients and endpoints supporting other VPN protocols may also be used; this includes many routers from Cisco, Juniper, Linksys (with DD-WRT), Asus, and others.
VPN Server
SoftEther VPN Server implements the VPN server function. It listens and accepts connections from VPN Client or VPN Bridge with several VPN protocols.
A VPN Server can have several Virtual Hubs and Virtual Layer-3 Switches. A Virtual Hub has full layer-2 Ethernet packet-switching functions like a physical Ethernet switch. Additionally, a Virtual Hub can be configured to define IP packet filter entries to filter the packets through the Virtual Hub. A Virtual Layer-3 Switch has layer-3 IP static routing functions like a physical router.
A VPN Server can have local bridges. A local bridge is the layer-2 packet-switching fabric between a physical Ethernet network-adapter and a Virtual Hub. The administrator defines a local bridge between the Virtual Hub and the existing corporate network to build a remote-access VPN server or a site-to-site VPN server.
VPN Client
SoftEther VPN Client is a VPN client program which has the virtualized function of an Ethernet network adapter. A computer with installed SoftEther VPN Client can establish a VPN connection to the VPN Server. Since the VPN Server has the support for multiple VPN protocols such as L2TP/IPsec or MS-SSTP VPN, VPN users are not required to install SoftEther VPN Client on client computers. When a user uses L2TP/IPsec or MS-SSTP VPN to connect to the VPN Server, the built-in VPN client programs on the operating system can be used to establish a VPN to the VPN Server. However, SoftEther VPN Client has advanced functions (e.g. more detailed VPN communication settings) than OS built-in VPN clients. To exploit the full performance of SoftEther VPN Server, it is recommended to install SoftEther VPN Client on each client computer.
VPN Bridge
SoftEther VPN Bridge is a VPN program for building a site-to-site VPN. To build a site-to-site VPN network, the system administrator has to install SoftEther VPN Server on the central site, and has to install SoftEther VPN Bridge on one or more remote sites. A VPN Bridge connects to the central VPN Server by cascade connection. A cascade connection is similar to, but a virtualization of, an uplink connection (cross-cable connection) between two physical Ethernet switches.
VPN Server Manager for Windows
The GUI Tool is the administrative tool for SoftEther VPN Server and SoftEther VPN Bridge. It is a program that runs on both Windows and Linux with WINE. A system administrator installs the GUI Tool on his laptop PC, and makes it connect to the remote VPN Server or VPN Bridge for administration. The connection is made by SSL session, and management commands are transported as RPC over SSL.
Command-line admin utility
vpncmd is the CUI administrative tool for SoftEther VPN Server, Client and Bridge. It is a program that runs on consoles of every supported operating systems. When a user is unable to use Windows or Linux with WINE, the user can alternatively use vpncmd to manage the VPN programs. vpncmd is also useful to execute a batch operation, such as creating many users on the Virtual Hub, or creating many Virtual Hubs on the VPN Server.
Architecture
Some parts of the architecture of SoftEther VPN are different from typical traditional IPsec-based VPN systems.
Virtual Hub
A Virtual Hub is the software-emulated virtual Ethernet switch. It learns and maintains its own forwarding-database table inside. While traditional physical Ethernet switches implement this function by hardware, SoftEther VPN implements the same function by software. A VPN Server can have several Virtual Hubs. Each Virtual Hub is isolated. A Virtual Hub performs the packet-switching between concurrently connected VPN sessions to realize the communication between VPN Clients and VPN Bridges.
When there are several Virtual Hubs in a single instance of VPN Server, these Virtual Hubs are isolated for security. Each different administrator can have the delegated privilege for each correspondent Virtual Hub. An administrator for a Virtual Hub can define user-objects and ACLs, limited only the delegated Virtual Hub.
Virtual Network Adapter
A Virtual Network Adapter is the software-emulated virtual Ethernet adapter. A VPN Client can create several Virtual Network Adapters on the client computer. A VPN user can establish a VPN session between the Virtual Network Adapter and the destination Virtual Hub of the remote VPN Server. While the VPN session is established, the VPN user can communicate to the remote VPN network through the Virtual Network Adapter. Since the Virtual Network Adapter works as if it were the physical one, any applications or operating system components can be used without any modification.
Virtual Layer-3 Switch
A Virtual Layer-3 Switch is the software-emulated virtual IP router. Several Virtual Layer-3 Switches can be created on a single VPN Server instance. A Virtual Layer-3 Switch has virtual IP interfaces connected to Virtual Hubs. It also has several static routing table entries.
The Virtual Layer-3 Switch is useful to make a large-scale site-to-site VPN network. Although the easy way to make a site-to-site VPN network is to build the layer-2 bridging based VPN, if the number of computers is huge the number of broadcasting packets will increase to load the inter-site links. To prevent that scaling problem, the VPN administrator isolates IP networks by Virtual Layer-3 switch.
Cascade Connection between Virtual Hubs
The administrator can define a cascade connection between local or remote Virtual Hubs. After the cascade connection has been established, the originally-isolated two Ethernet segments are combined to the single Ethernet segment. Therefore, the cascade connection function is used to build the site-to-site layer-2 Ethernet bridging.
Local Bridge between Virtual Hubs and physical Ethernet segment
Since Virtual Hubs and Virtual Network Adapters are only software-emulated virtual Ethernet devices, the Ethernet packets through these virtual devices cannot communicate with physical Ethernet devices. Therefore, a bridge between the virtual and the physical is necessary to build a remote-access VPN or site-to-site VPN. To make a bridge, the Local Bridge function exchanges the Ethernet packets between a Virtual Hub and a physical Ethernet network adapter to combine both isolated Ethernet segments into a single Ethernet segment.
After defining the Local Bridge on SoftEther VPN Server, any VPN Client can connect to the VPN Server and communicate to all existing Ethernet devices (e.g. servers or network equipment) through the Local Bridge. This is called a remote-access VPN.
If the network administrator sets up the remote-site VPN Bridge, and defines two Local Bridges on both VPN Server and VPN Bridge, and defines a cascade connection between VPN Server and VPN Bridge, then the remote two Ethernet segments are connected directly in layer-2 Ethernet level. This is called a site-to-site VPN.
Firewall, proxy, and NAT transparency
One of the key features of SoftEther VPN is the transparency for firewalls, proxy servers, and NATs (Network Address Translators). To do this, SoftEther VPN supports SSL-VPN and NAT Traversal.
SoftEther VPN uses HTTPS protocol in order to establish a VPN tunnel. HTTPS (HTTP over SSL) protocol uses the TCP/IP port 443 (may vary) as destination.
Parallel transmission mechanism of multiple SSL-VPN tunnels
When the user chooses SSL-VPN protocol between the VPN Client and VPN Server, SoftEther VPN Server and VPN Client use a parallel transmission mechanism to improve the throughput of the SSL-VPN tunnel. A user can set up the number of concurrent parallel transmission channels from 1 to 32.
In an environment such as a slow and delaying network, this performance tuning will result in a faster throughput. When this function is enabled, the logical VPN Session will consist of several TCP (HTTPS) connections. All packets will be added to one of the appropriate TCP connections with calculations of optimizing modules. If some packet losses have been detected on a TCP connection of the logical VPN Session, then the new packet will use another healthy VPN connection. This fast-switching optimization to determine the processing TCP connection enables high throughput.
NAT traversal
Traditional VPN systems require the user to ask the firewall's administrator of the company to open an endpoint (TCP or UDP port) on the firewall or NAT on the border between the company and the Internet. In order to reduce the necessity to open an endpoint on the firewall, SoftEther VPN Server has the NAT Traversal function. NAT Traversal is enabled by default. As long as it is enabled, SoftEther VPN Client computers can connect to your VPN Server behind the firewall or NAT. No special settings on the firewall or NAT are necessary.
VPN over ICMP, and VPN over DNS
A few very-restricted networks only permit to pass ICMP or DNS packets. On such a network, TCP or UDP are filtered. Only ICMP and DNS are permitted. In order to make it possible to establish a SoftEther VPN client-server session via such a very-restricted network, SoftEther VPN has the "VPN over ICMP" and the "VPN over DNS" function.
This function is very powerful to penetrate such a restricted firewall. All VPN packets are encapsulated into ICMP or DNS packets to transmit over the firewall. The receiver-side endpoint extracts the inner packet from the capsuled packet. This is useful for exploiting public Wi-Fi. Some public Wi-Fi can pass only ICMP or DNS packets. They filter TCP or UDP packets. If you have a VPN Server installed on your home or office in advance of going outdoors, you can enjoy protocol-free network communication by using such a restricted network.
VPN Gate
VPN Gate is a plugin for SoftEther VPN, which allows users to connect to free VPN servers, run by volunteers who use SoftEther to host their VPN servers. Volunteers use personal computers as "servers". VPN Gate is sponsored by the University of Tsukuba.
See also
OpenVPN, an open-source VPN program
UDP hole punching, a technique for establishing UDP "connections" between firewalled/NATed network nodes
Secure Socket Tunneling Protocol (SSTP) Microsoft method for implementing PPP over SSL VPN
References
External links
VPN Gate
Multi-Protocol SoftEther VPN Becomes Open Source (by Linux Today)
Virtual private networks
2014 software
|
608311
|
https://en.wikipedia.org/wiki/List%20of%20video%20game%20industry%20people
|
List of video game industry people
|
Below is a list of notable people who work or have worked in the video game industry.
The list is divided into different roles, but some people fit into more than one category. For example, Sid Meier is both a game designer and programmer. In these cases, the people appear in both sections.
Art and animation
Dennis Hwang: graphic designer working for Niantic
Edmund McMillen: artist whose art style is synonymous with Flash games
Jordan Mechner: introduced realistic movement to video games with Prince of Persia
Jim Sachs: created new standard for quality of art with the release of the Amiga game Defender of the Crown
Derek Yu: Indie video game artist, designer, and blogger. Known for working on Spelunky, Spelunky 2, Aquaria, Eternal Daughter, I'm O.K – A Murder Simulator, and DRL
Company officers
J Allard: Xbox Officer President
David Baszucki: founder and CEO of the Roblox Corporation
Marc Blank: co-founder of Infocom
Cliff Bleszinski: founder of Boss Key Productions
Doug Bowser: president of Nintendo of America (2019–present)
Arjan Brussee: co-founder of Guerrilla Games & Boss Key Productions
Nolan Bushnell: founder of Atari
David Cage: founder of Quantic Dream
Doug Carlston: co-founder of Brøderbund
Trevor Chan: founder and CEO of Enlight Software
Josef Fares: founder of Hazelight Studios
Reggie Fils-Aimé: former president of Nintendo of America (2006–2019)
Greg Fischbach: CEO of Acclaim Entertainment before it bankrupted
Jack Friedman: Founder of Jakks Pacific, LJN, and THQ
Andy Gavin & Jason Rubin: founders of Naughty Dog
David Gordon: founder of Programma International
Yves Guillemot: co-founder and CEO of Ubisoft
Shuntaro Furukawa: President of Nintendo (2018–present)
Hal Halpin: President of ECA
John Hanke: founder and CEO of Niantic
Trip Hawkins: founder of Electronic Arts
Sam Houser: co-founder and President of Rockstar Games
Tsunekazu Ishihara: CEO of The Pokémon Company
Tomonobu Itagaki: Founder of Team Ninja & Valhalla Game Studios
Satoru Iwata: Former President of Nintendo (2002–2015)
Sampo Karjalainen: Founder of Sulake
Tatsumi Kimishima: Former President of Nintendo (2015–2018)
Michael Kogan: founder of Taito
Bobby Kotick: CEO of Activision Blizzard
Kagemasa Kōzuki: founder of Konami
Jennell Jaquays: started the game design unit at Coleco
Ken Kutaragi: Former President of Sony Computer Entertainment, Inc. (1997 - 2007)
Doug Lowenstein: founder and former President of the Entertainment Software Association
Hiroshi Matsuyama: CEO of CyberConnect2
Masafumi Miyamoto: founder of Square
Shigeru Miyamoto: Representative Director of Nintendo
Hidetaka Miyazaki: President of FromSoftware
Peter Moore: COO at Electronic Arts
Peter Molyneux: founder of Lionhead Studios, Co-founder of Bullfrog Productions
Michael Morhaime: co-founder and former president of Blizzard Entertainment
Masaya Nakamura: founder of Namco
Jay Obernolte: founder of FarSight Studios
Philip & Andrew Oliver: co-founders of Blitz Games; twins
Scott Orr: founder of GameStar, Glu Mobile
Mark Pincus & Justin Waldron: founders of Zynga
Randy Pitchford: CEO of Gearbox Software
Ted Price: President of Insomniac Games
Paul Reiche III & Fred Ford: founders of Toys for Bob
John Riccitiello: CEO of Unity Technologies
Warren Robinett: Founder of The Learning Company
John Romero: co-founded at least seven game companies: Capitol Ideas Software, Inside Out Software, Ideas from the Deep, id Software, Ion Storm, Monkeystone Games, and Gazillion Entertainment
Jeremiah Slaczka: co-founder of 5th Cell
Jeff Spangenberg: founder of Retro Studios
Phil Spencer: head of the Xbox brand
Tim & Chris Stamper: founders of Ultimate Play the Game & Rare
Hirokazu Tanaka: President of Creatures
Kenzo Tsujimoto: founder of Capcom and Irem
Feargus Urquhart: CEO of Obsidian Entertainment
Christopher Weaver: founder of Bethesda Softworks and Co-Founder of ZeniMax Media
Jordan Weisman: founder of FASA
David Whatley: founder of Simutronics
Andrew Wilson: CEO of Electronic Arts (2013–Present) & director of Intel (2017-Present)
Hiroshi Yamauchi: former president of Nintendo (1949–2002)
Riccardo Zacconi: founder of King
Strauss Zelnick: CEO of Take-Two Interactive
Design
Hardware
Ralph Baer: inventor of the Magnavox Odyssey, the first video game console
Seamus Blackley: main designer and developer of the original Xbox
William Higinbotham: main developer of Tennis for Two. One of the first video games developed in the early history of video games.
Josef Kates: engineer who developed the first digital game-playing machine
Ken Kutaragi: creator of the PlayStation brand
Jerry Lawson: pioneered the video game cartridge by designing the Fairchild Channel F console
Palmer Luckey: founder of Oculus VR (or Facebook Technologies) and the designer of the Oculus Rift
Ivan Sutherland: Internet pioneer who is regarded as the "father of computer graphics." Also invented the first virtual reality headset with the help of his students
Xiaoyuan Tu & Wei Yen: founders of AiLive, who helped create the motion sensing hardware for the Wii
Gunpei Yokoi: inventor of the Game & Watch, Game Boy and WonderSwan
Music and sound
Online gaming
Richard Bartle: wrote the first MUD along with Roy Trubshaw
David Baszucki: creator of Roblox
John D. Carmack: developed an early online version of Doom which supported up to four players; later Quake supported 16 players which helped popularize online gaming
Jess Cliffe & Minh Le: developed the first Counter-Strike game and thus started the franchise.
J. Todd Coleman: Lead creative director of Shadowbane, Wizard101, Pirate101, Crowfall, and many other MMORPG titles.
Don Daglow: designed first MMORPG with graphics, Neverwinter Nights for AOL
Alex Evans: created the game engine for the LittleBigPlanet games & Dreams
Jeff Kaplan: lead designer of Overwatch
Sampo Karjalainen & Aapo Kyrölä: creators of Habbo Hotel
John De Margheriti: CEO of BigWorld Pty Ltd, makers of Massively Multiplayer Online Game Middleware (MMOG) technology
Elonka Dunin: General Manager at Simutronics, senior editor of IGDA Online Games White Papers
Kelton Flinn: designer of Air Warrior and many other pioneering online games, co-founder of Kesmai
Richard Garriott (a.k.a. Lord British): Creator of Ultima Online, Work on Lineage, Lineage II (Electronic Arts, NCsoft)
Dean Hall: Creator of DayZ
IceFrog: lead designer of Defense of the Ancients and Dota 2
Raph Koster: LegendMUD, Ultima Online, Star Wars Galaxies. (Electronic Arts, Sony Online Entertainment)
Brad McQuaid: co-creator of EverQuest (Verant Interactive, Sony Online Entertainment, Sigil Games)
Rob Pardo: lead designer and producer of World of Warcraft
Philip Rosedale: founded the virtual world Second Life
John Smedley: co-creator of EverQuest (Verant Interactive, Sony Online Entertainment) and president of Sony Online Entertainment
Gordon Walton: executive producer
Jordan Weisman: founder of 42 Entertainment, co-creator of I Love Bees and The Beast
Will Wright: c of The Sims Online (Electronic Arts)
Naoki Yoshida: producer of FINAL FANTASY XIV Online: A Realm Reborn and its following expansions.
Producing
Eiji Aonuma, The Legend of Zelda series
Mark Cerny, Jak and Daxter series, Spyro the Dragon series and Ratchet & Clank
Katsuya Eguchi, Animal Crossing series, Star Fox series and Wii series
Guillaume de Fondaumiere, Fahrenheit (or Indigo Prophecy), Heavy Rain, Beyond: Two Souls, and Detroit: Become Human
Yuji Horii, Dragon Quest series
Sam Houser, Grand Theft Auto series, Bully, The Warriors, Max Payne 3
Todd Howard, The Elder Scrolls III: Morrowind, Oblivion, Skyrim, Fallout 3 and Fallout 4
Keiji Inafune, Megaman character designer, producer of Dead Rising and Onimusha
Hideo Kojima, Metal Gear, Zone of the Enders, and Death Stranding
Ken Levine, BioShock, System Shock 2
Hisashi Nogami, Animal Crossing series and Splatoon series
Jade Raymond, Assassin's Creed
John Romero, executive producer and designer of Heretic, Hexen: Beyond Heretic
Hironobu Sakaguchi, Final Fantasy series
Bruce Shelley, Age of Empires
Rod Fergusson, Gears of War series
Warren Spector, Thief, Deus Ex
Daniel Stahl, Star Trek Online, Champions Online
Yu Suzuki, Virtua Fighter series, Shenmue
Satoshi Tajiri, Pokémon franchise
Dave D. Taylor, Abuse
Programming
Michael Abrash: pioneer of fast PC graphics; author of graphics programming texts
Dave Akers: programmer of the arcade games Klax and Escape from the Planet of the Robot Monsters
Ed Boon: programmer and creator of the Mortal Kombat series
Jens Bergensten: lead developer of Minecraft since 2011
Danielle Bunten Berry: M.U.L.E., Seven Cities of Gold
Jonathan Blow: creator of Braid and The Witness
David Braben: co-creator of Elite
Bill Budge: Raster Blaster and Pinball Construction Set
John D. Carmack: Wolfenstein 3D, Doom, Quake, co-founded id Software
Don Daglow: 1970s mainframe games Baseball, Dungeon; also did Intellivision Utopia, first sim game
Fred Ford: lead programmer of The Horde, Pandemonium!, the Star Control series, and the Skylanders series
Richard Garriott (a.k.a. Lord British): creator of the Ultima Online series, Tabula Rasa and founder of Origin Systems
Nasir Gebelli: famous for programming Square Co.'s (Now Square Enix) Final Fantasy for the Famicom (NES) and a few other Square titles; a programming legend on the Apple II
Mark Healey: known for working on Theme Park, Magic Carpet, Dungeon Keeper, the Fun School games, the LittleBigPlanet games, and Dreams
Rebecca Heineman: Out of this world and The Bard's Tale
William Higinbotham: designer and programmer of Tennis for Two, one of the first video games developed during the early history of video games
Alec Holowka: Indie video game programmer and designer. Known for working on Aquaria, I'm O.K – A Murder Simulator, and Night in the Woods
Wesley Huntress: Rendezvous: A Space Shuttle Simulator and Wilderness: A Survival Adventure
André LaMothe: author of several game programming texts
Maddy Thorson: founder of Extremely OK Games (previously Matt Makes Games) and lead developer of TowerFall and Celeste
Al Lowe: Leisure Suit Larry series
Seumas McNally: founder of Longbow Digital Arts and lead programmer of DX-Ball, DX-Ball 2, and Tread Marks. The Seumas McNally Grand Prize is named after him.
Jordan Mechner: Karateka and Prince of Persia series
Sid Meier: Civilization series, Railroad Tycoon, co-founder of Firaxis Games
Alan Miller: original programmer for Atari 2600, co-founded publishers Activision and Accolade
Jeff Minter: founder of Llamasoft and programmer of most of their games
David Mullich: The Prisoner and other Edu-Ware games
Yuji Naka: Sonic the Hedgehog and other Sega games
Gabe Newell: Half-Life; co-founder of Valve
Markus Persson (a.k.a. Notch): created Minecraft; founder of Mojang
Steve Polge: Unreal series and other Epic Games games
Zoë Quinn: programmer and video game blogger. Known for developing Depression Quest and for her role in the Gamergate controversy
Frédérick Raynal: best known for Alone in the Dark and the Little Big Adventure series
Chris Roberts: programmer and designer of Freelancer, Star Citizen, and the Wing Commander games.
Warren Robinett: Adventure, Rocky's Boots, & Robot Odyssey
John Romero: game programmer since 1979; known for Commander Keen, Doom, Quake
Jim Sachs: programmer of Saucer Attack and other home computer era games
Chris Sawyer: programmer and designer RollerCoaster Tycoon series and other games
Cher Scarlett: programmer who worked at Blizzard Entertainment and known for her role in California Department of Fair Employment and Housing v. Activision Blizzard
Tim Schafer: programmer and designer of Full Throttle, Grim Fandango, Psychonauts, Brütal Legend, and Broken Age. Also worked on the Monkey Island games.
Ken Silverman: author of the Build engine game engine
Tim Sweeney: founded Epic Games, Unreal series and the Unreal Engine
Anne Westfall: programmer of the Archon series of games
Will Wright: programmer of first games in SimCity series and co-founder of Maxis
Brianna Wu: programmer known for working on Revolution 60 and for her role in the Gamergate controversy
Corrinne Yu: Halo lead and principal engine architect (Microsoft Halo team), Gearbox Software (studio wide) Director of Platform Technology, Ion Storm (studio wide) Director of Technology, Prey engine lead programmer at 3D Realms
Video game development
Video game industry
+People
|
6719779
|
https://en.wikipedia.org/wiki/Tzar%3A%20The%20Burden%20of%20the%20Crown
|
Tzar: The Burden of the Crown
|
Tzar: The Burden of the Crown (Цар: Тежестта на короната in Bulgarian), also known as simply Tzar, is a real-time strategy game for Microsoft Windows published by TalonSoft and developed by the Bulgarian game developer company Haemimont Games. The game was met with moderate success; however, it got mild recognition and audience when it was published as a demo in several gaming magazines.
The game was considered by Linux Game Publishing to be ported to Linux, but was rejected due to concerns within the company about its gameplay and after hearing negative comments about the game from the Linux gaming community.
The game got a digital re-release on the GOG.com digital platform on July 16, 2013, and Steam digital platform on June 6, 2019.
Gameplay
The gameplay is set in a fictional medieval age. The game is a basic real time strategy game that resembles the gameplay of the Age of Empires series. The basic goal is to conquer the neighbouring kingdoms and destroy all traces of them, or destroy their castles, depending on the selected playing mode. There are many different buildings and characters player can produce, each depending on which of the three races the player chooses to play as: European, Asian or Arabian. The main differences are the types of special buildings and the types of troops available.
There are four types of resources a player has to gather: food, wood, stone and gold. Food can be gathered by harvesting crops, milking cows or killing them for meat, as well as fishing if the map has lakes or rivers. Wood is gathered by chopping down trees, and gold and stone are gathered by mining. All units have health (hit points) but sorcerers also have mana which gradually regenerates when used to cast spells or summon creatures.
The main buildings that can be constructed by all three races are houses, farms, blacksmiths, workshops, barracks, stables, towers, walls, gates and inns. The players usually starts the game with a castle and a few peasants. All types of resources can be carried to the castle. Building houses increases the population limit. Farms can be used to produce cows and also as a place to gather food. Stables are required for some types of mounted soldiers, and blacksmiths provide various improvements to units' armour and fighting skills. Workshops are used to build siege machines. Towers are used for defence. Inns are the place where the player can exchange resources and later hire mercenaries and heroes. Docks can be built to fishing and travelling across the sea.
There are 4 Strategies in which the player can take: religion (mosque- Arabians, cathedral-Europeans, Shaolin monastery-Asians), magic (mage tower-all races), war (warrior's academy-all races), or trade (merchant's guild-all races). The player takes a path by building the corresponding building. Due to the high cost of these elite buildings, the player can only take one of the strategic paths each with their own unique style:
Religion will allow the player to produce priests, spies, and elite religious unit. Priest have the ability to heal and bless units by increasing their stats for a short period of time. They also have a long line of sight to spot wizards and neutralize them with one long range shot making religion the perfect counter for a player taking the magic path. Spies have the ability to impersonate an opponent unit to infiltrate their kingdoms allowing you to see what your opponents are doing. Your opponent can command your spies and move them around or even have them collect resources if your spies impersonate an peasant. Spies can reveal their true selves at any time you give the command. Europeans elite units are crusaders which are mounted units with high armor. They come in groups at a time and the player cannot produce more until the current group is completely killed. Arabians have Jihadi warrior's which are an upgrade from a typical soldier. What makes them unique is that they are actually peasants. Peasants are much cheaper than the standard soldier suggesting the player to spam peasants and converting them to Jihadi warriors and swarm the enemy. Asian's elite unit is the monk which are all purpose warriors. They have a good balance of attack and defense and can share their battle experience with other kung-Fu units.
Magic will allow the player to produce wizards and research spells. Wizards will start out with no abilities until they are researched from the mage tower. Each race have unique spells but they are all devastating for large groups of units making magic the perfect counter against a player taking the war path. In addition, after researching, wizards can summon magical creatures - giants and bats (Europeans), genies (Arabians) and dragons (Asians). They all have outrageously high attack and hit points but are vulnerable to priests.
War will allow the player to value each soldier by removing the cap leveling up allowing them to reach heroic status as they experience more and more battles. The player can also research faster experience gain and influence by heroes. The player taking this path will be able to hire mercenaries giving quality units at no time at all. This strategic path suggests leveling up units and swarming creating hordes of experienced warriors and heroes. Despite how strong religious units are, outnumbering eventually wins making war the perfect path against a player who has taken the religious path.
The trade path allows the player to trade with allies, gamble with resources, take up loans, and increase the population cap in order to produce more peasants to collect more resources. This path is more suited when playing with allies. In addition, the trade path allows the research of elite war galleons which are larger, stronger, and have longer attack range than the other war ships making trade a considerable path to take when playing in island maps. Lastly, the player can research the ability that allows peasants to bribe enemy units as long as the price is right.
There is also a campaign option for single players in which the player must complete specific goals, such as destroying an enemy force, or protecting a citadel from attack. The campaign has a total of 20 missions.
The game also includes a map editor where players can create their own maps to play on with strategically placed rivers, forests, and resources to use to build their armies with. The game is best known for the first ever implementation of a full experience system for every unit in a RTS game. The game doesn't have the commonly known system of Warcraft III for heroes but still every unit has the potential to reach level twelve and thus gaining a heroic status. There is no limit of the "hero" units a player can have, as long as they can keep them alive.
Plot
The kingdom of Keanor is under attack by dark forces and much lie in ruins. The old king has died and the son Prince Sartor's whereabouts are unknown.
Sartor is raised as a lumberjack in a village, unaware of his royal lineage as Prince. One day, mercenaries seeking Sartor raid the village, killing his uncle. A wizard named Ghiron arrives in time and saves him, revealing his royal lineage and promises to help restore the kingdom to its previous glory. Ghiron takes him to find allies, such as his father's guard captain Woolin. They save the capitol from being completely destroyed. The trio seek more and more allies, growing enough to be confident in the final battle. Having enough resources, they lead massive armies against the Messiah of Evil, the manifestation of evil on Earth.
Sartor slowly gains allies. He travels far and wide to find people. He finds allies in the Asians on a far northern continent and finds favor when he kills their old time foes. Sartor soon finds Arabian allies on a far continent. He gets taken prisoner one time and his allies break him out of his imprisonment. Eventually, he gets the confidence and his allies to find the final allies.
Then the now-King Sartor leads his army to defeat the Messiah of Evil and his city in one large battle. In the end, he recognizes that evil shall always remain.
Reception
The game received average reviews according to the review aggregation website GameRankings.
The Spanish version became a hit in Spain, with sales of 50,000 units in the region by November 2000.
References
External links
Tzared Tzar for web browsers and Android
Tzar: The Burden of the Crown official website
Spanish Wikipedia's entry (Useful and very detailed entry page at Spanish Wikipedia. Contains information on several games and expansions in Haemimont's Tzar: Anthology series that must be added on here too.)
2000 video games
Cancelled Linux games
Real-time strategy video games
Video games developed in Bulgaria
Windows games
Windows-only games
|
254223
|
https://en.wikipedia.org/wiki/Data%20General%20RDOS
|
Data General RDOS
|
The Data General RDOS (Real-time Disk Operating System) was a real-time operating system released in 1970. The software was only sold bundled with the company's popular Nova and Eclipse minicomputers.
Overview
RDOS was capable of multitasking, with the ability to run up to 32 what were called "tasks" (similar to the current term threads) simultaneously on each of two grounds (foreground and background) within a 64 KB memory space. Later versions of RDOS were compatible with Data General's 16-bit Eclipse minicomputer line.
A cut-down version of RDOS, without real-time background and foreground capability but still capable of running multiple threads and multi-user Data General Business Basic, was called Data General Diskette Operating System (DG-DOS or now—somewhat confusingly—simply DOS); another related operating system was RTOS, a Real-Time Operating System for diskless environments. RDOS on microNOVA-based "Micro Products" micro-minicomputers was sometimes called DG/RDOS.
RDOS was superseded in the early 1980s by Data General's AOS family of operating systems, including AOS/VS and MP/AOS (MP/OS on smaller systems).
Commands
The following list of commands are supported by the RDOS/DOS CLI.
ALGOL
APPEND
ASM
BASIC
BATCH
BOOT
BPUNCH
BUILD
CCONT
CDIR
CHAIN
CHATR
CHLAT
CLEAR
CLG
COPY
CPART
CRAND
CREATE
DEB
DELETE
DIR
DISK
DUMP
EDIT
ENDLOG
ENPAT
EQUIV
EXFG
FDUMP
FGND
FILCOM
FLOAD
FORT
FORTRAN
FPRINT
GDIR
GMEM
GSYS
GTOD
INIT
LDIR
LFE
LINK
LIST
LOAD
LOG
MAC
MCABOOT
MDIR
MEDIT
MESSAGE
MKABS
MKSAVE
MOVE
NSPEED
OEDIT
OVLDR
PATCH
POP
PRINT
PUNCH
RDOSSORT
RELEASE
RENAME
REPLACE
REV
RLDR
SAVE
SDAY
SEDIT
SMEM
SPDIS
SPEBL
SPEED
SPKILL
STOD
SYSGEN
TPRINT
TUOFF
TUON
TYPE
VFU
XFER
Antitrust lawsuit
In the late 1970s Data General was sued (under the Sherman and Clayton antitrust acts) by competitors for their practice of bundling RDOS with the Data General Nova or Eclipse minicomputer. When Data General introduced the Data General Nova, a company called Digidyne wanted to use its RDOS operating system on its own hardware clone. Data General refused to license their software and claimed their "bundling rights". In 1985, courts including the United States Court of Appeals for the Ninth Circuit ruled against Data General in a case called Digidyne v. Data General. The Supreme Court of the United States declined to hear Data General's appeal, although Justices White and Blackmun would have heard it. The precedent set by the lower courts eventually forced Data General to license the operating system because restricting the software to only Data General's hardware was an illegal tying arrangement.
In 1999, Data General was taken over by EMC Corporation.
References
External links
RDOS documentation at the Computer History Museum
RDOS 7.50 User Parameters definition
SimuLogics' ReNOVAte - Emulator to run NOVA/Eclipse Software on DOS / WindowsNT / UN*X / VMS
Data General
Disk operating systems
Real-time operating systems
|
4424224
|
https://en.wikipedia.org/wiki/FooBillard
|
FooBillard
|
FooBillard is a free and open-source, OpenGL-based sports simulation video game.
Gameplay and features
FooBillard supports several kinds of billiard games: carom billiards (three-cushion billiards), snooker, and pool billiard (pocket billiards) in the eight-ball and nine-ball variant.
FooBillard has a realistic physics engine and a computer opponent AI. It features an optional red/green 3D stereo view (requires anaglyph 3D glasses), a free view mode and an animated cue.
History
FooBillard was started around 2002 by Florian Berger. The cue sports simulator is free software, licensed under the terms of the GNU General Public License. Originally implemented for Linux it was and ported to AROS, Mac OS X, MorphOS and Windows. The most recently released version is 3.0a.
As the original FooBillard has not been under development for many years, the Foobillard++ project was created around 2011 as continuation of the game's development. Latest version of FooBillard++ 3.42 was from 2012. An Android port was created around 2014.
Reception
Foobillard was reviewed in 2005 by Chip.de and noted for the "beautiful graphic" and "realistic physic".
Between 2002 and 2016 the game was downloaded 1,470,000 times from SourceForge.
The game is also included in many Linux distributions, e.g. Ubuntu and OpenSUSE.
References
External links
– original project by Florian Berger
– continuation
AROS software
Cue sports video games
Snooker video games
Linux games
MorphOS games
MacOS games
Windows games
Open-source video games
|
5151542
|
https://en.wikipedia.org/wiki/Windows%20Embedded%20CE%206.0
|
Windows Embedded CE 6.0
|
Windows Embedded CE 6.0 (codenamed "Yamazaki") is the sixth major release of the Microsoft Windows embedded operating system targeted to enterprise-specific tools such as industrial controllers and consumer electronics devices like digital cameras. CE 6.0 features a kernel that supports 32,768 processes, up from the 32-process limit of prior versions. Each process receives 2 GB of virtual address space, up from 32 MB.
Windows Embedded CE 6.0 was released on November 1, 2006 and includes partial source code. The OS currently serves as the basis for the Zune HD portable media player. Windows Mobile 6.5 is based on Windows CE 5.2. Windows Phone 7, the first major release of the Windows Phone operating system, is based on Windows Embedded CE 6.0 R3; although Windows Phone 7 is also using Windows Embedded Compact 7 features.
New features
Some system components (such as filesystem, GWES (graphics, windowing, events server), device driver manager) have been moved to the kernel space.
The system components which now run in kernel have been converted from EXEs to DLLs, which get loaded into kernel space.
New virtual memory model. The lower 2 GB is the process VM space and is private per process. The upper 2 GB is the kernel VM space.
New device driver model that supports both user mode and kernel mode drivers.
The 32 process limit has been raised to 32,768 processes.
The 32 megabyte virtual memory limit has been raised to the total virtual memory; up to 2 GB of private VM is available per process.
The Platform Builder IDE is integrated into Microsoft Visual Studio 2005 as plugin (thus forcing the client to obtain Microsoft Visual Studio 2005 also), allowing one development environment for both platform and application development.
Read-only support for UDF 2.5 filesystem.
Support for Microsoft's exFAT filesystem.
802.11i (WPA2) and 802.11e (QoS) wireless standards, and multiple radio support.
CE 6.0 is compatible with x86, ARM, SH4 (only up to R2) and MIPS based processor architectures.
New Cellcore components to enable devices to easily make data connections and initiate voice calls through cellular networks.
New features in R3
Windows Embedded CE 6.0 R3 was finalized in September 2009 for OEMs and serves as the base platform for the Zune HD and Windows Phone 7. CE 6.0 R3 includes the following new features and abilities:
Note that these features listed here are not all specific to Windows Phone 7 or the Zune HD.
References
External links
History of Windows CE, by HPC:Factor with screenshots of the various versions
Bor-Ming Hsieh and Sue Loh: 3rd Generation Kernel for Windows CE — Channel 9 Interview
Juggs Ravalia: Windows Embedded CE 6.0 Device Driver Model — Channel 9 Interview
Mike Hall's WEBlog
Windows CE blog from e-con
Embedded CE 6.0
Embedded operating systems
Windows CE
MIPS operating systems
|
29737166
|
https://en.wikipedia.org/wiki/CONFER%20%28software%29
|
CONFER (software)
|
CONFER is one of the first computer conferencing systems. Highly sophisticated for its time, it was developed in 1975 at the University of Michigan by then graduate student Robert Parnes. The CONFER system continued to be a widely used communication tool until 1999. CONFER is the progenitor of the computer conferencing systems Caucus, PicoSpan, and YAPP.
Origins and history
CONFER was developed in the mid-1970s when University of Michigan experimental psychology graduate student Bob Parnes attended a seminar where Professor Merrill M. Flood discussed aspects of electronic mail and conferencing on group decision making. Flood had a magnetic tape of a prototype system and approached Parnes about getting it to run on the Michigan Terminal System (MTS), the university's time-sharing system. Parnes declined, but offered instead to attempt writing a similar program for MTS. With encouragement from Fred Goodman and LeVerne Collet at the School of Education and Karl Zinn at the Center for Research on Learning and Teaching (CRLT), CONFER was developed.
Because of a graduate teaching assistant strike, Parnes was temporarily relieved of his teaching duties and had some extra time to devote to his experimental system, which he called "CONFER". MTS served as an excellent development environment for CONFER, which was built on top of the MTS file structure and exploited its file sharing features. According to Parnes, "I don't think I could have written CONFER anywhere but on MTS." MTS at U-M and later at Wayne State University (WSU) was a good match for CONFER because both systems were attached to the Merit Network and thus had a broader reach within Michigan via Merit and within the U.S. and internationally via Merit's interconnections to Telenet (later SprintNet), Tymnet, ADP's Autonet, and later still the IBM Global Network and the Internet.
Parnes' vision of the system was one where the individual group participant would alternate between being a producer and being a consumer of information. The unique CONFER feature in this regard was initially the functionality of the "vote." This feature allowed the consumer to voice their "feelings" or opinion on a statement by voting.
Parnes went on to form his own company — Advertel Communication Systems, Inc. — which marketed and supported CONFER.
The CONFER system continued to be a widely used communication tool until 1999. By this time, U-M, WSU, and the University of Alberta had moved from the Michigan Terminal System to distributed computing environments and several newer digital technologies replaced the functionality provided by CONFER.
Sites where CONFER was used
In addition to the University of Michigan CONFER was used at Wayne State University (WSU), the University of Alberta (UQV), Michigan State University (MSU), and at Hewlett-Packard (HP). MSU and HP both ran MTS so they could run CONFER. A Unix version, known as CONFER U, was created by the University of Michigan's Information Technology Division and used at U-M and at the Research Libraries Group. A version for the DEC VMS operating system, known as CONFER V, was created and used at Western Michigan University (WMU). The work on CONFER U at U-M and on CONFER V at WMU was done with the encouragement of and guidance from Bob Parnes.
Features
CONFER provides facilities for online discussion of topics of general interest. Discussions are organized around "conferences" that focus on a topic, a group or community, or an event. Conferences may be "public" (open to anyone with an account on the host system where CONFER runs) or private (invitation only). Each conference has one or more organizers. Individuals join conferences as participants, auditors, or observers. Conferences are accessed using terminals from various locations, allowing discussion without having to meet physically or participate at the same time.
As a system developed in the mid-1970s, CONFER is a text oriented, command driven system with extensive prompts and online help. It does not have a graphical user interface (but see InfoX below) or allow the display of photographs or other graphics.
Within a conference, discussions are managed as a collection of items. One person starts an item by entering the item text and giving it a title, called a header. Other people can then make their own responses to the initial entry. The item text and each response is signed with the name of its author. The item's author can specify the type of responses desired. The most common type of response is a discussion response where the response is simply text. Participants can make as many discussion responses to an item as they like. Another type of response is a vote where a numeric response followed by an optional text comment is given with only one response per item per participant. And still another response type is a dynamic value vote.
One can view items in chronological order, reverse chronological order, or by following a thread of related items linked together using next and previous item links. One can also view specific items, a range of items, new items or items that have new responses.
To participate in a conference one must first register as a permanent participant, an auditor, or a temporary observer. A participant may contribute items and responses, while an auditor or observer just views them. Once one has joined a conference, CONFER keeps track of what has been seen for participants and auditors, but not for observers. Each time a conference is visited by a participant or auditor, CONFER displays a list of new information that has been entered since the previous visit. Of course one can always go back and look at old items and responses as well.
CONFER allows the use of pseudonyms for items, responses, and messages, and participants can register in a conference under a pseudonym. Many conferences that allow pseudonymous comments ask participants to register under their own names to establish a legitimate tone for the conference, and help establish the credibility of the participants.
Bulletins, notices that are displayed when a conference is entered with no responses allowed, are another less frequently used form of communication.
CONFER also provides a "meeting" mode to allow real-time discussions and includes facilities to support "simulations" as described below.
Not only did CONFER offer the opportunity for various forms of group discussion, it also served as the first widely used e-mail system on the Michigan campus. And while the MTS $MESSAGE e-mail system eventually surpassed CONFER as the e-mail facility of choice at Michigan, the computer conferencing portion of CONFER continued to thrive.
Commands
The following commands are supported by CONFER. Many command names and modifiers may be abbreviated using initial sub-strings of the name.
At the DO NEXT? prompt:
HELP To see the online tutorial in CONFER II.
? Same as HELP.
DESCRIPTOR [NEW] To see the 3-line descriptors of an item or the new items.
NEW To see NEW messages, items, and responses.
ITEM n To see a particular item, where "n" is its number.
RESPONSES [n:m1-m2] Display responses "m1" to "m2" for items "n".
ENTER To enter an item (public) into the conference.
LOAD filename To enter text from filename
TRANSMIT To send a message (private) to another participant.
MESSAGE [n] Display a message or messages.
BULLETIN To enter a bulletin (public) for everyone to see.
BULLETIN ALL Display bulletins.
BULLETIN REVERSE Display bulletins in reverse order.
NOTE To create a note (private) for yourself.
INDEX To see the index of items for the conference.
JOIN name To join another conference called "name".
WAIT n To set automatic screen pauses every "n" lines.
CHANGE TEXT n To change the text of item "n".
CHANGE RESPONSE n:m To change, delete, or retire response "m" of item "n".
CHANGE RETIRE n To retire items "n".
CHANGE RESTORE n To unretire item "n".
CHANGE FREEZE n To freeze (prevent more responses) item "n".
CHANGE BULLETIN Change the text of a bulletin.
CHANGE INTRODUCTION Change the participant's introduction.
CHANGE NAME Change the participant's name.
CHANGE PHONE Change the participant's phone number.
CHANGE RESIGN Resign from the current conference.
PARTICIPANT Display participant information.
PARTICIPANT ALL Display participant information.
PARTICIPANT name Display participant information.
DELETE n Delete item "n" (organizer only).
STOP To return to MTS command mode (#).
QUIT To end your conferencing session and to SIGN OFF.
At the RESPOND, FORGET OR PASS? prompt:
HELP To see the online tutorial in CONFER II.
? Same as HELP.
RESPOND To enter a response to that item.
FORGET To tell CONFER to stop showing you that item.
PASS To pass your turn at making a response.
TEXT To display the text of the item again.
-n To display the last "n" (an integer) responses.
n To display response "n" through the last response.
n ONLY To display only response "n".
MINE To display all the responses you’ve made on an item.
TRANSMIT See above.
ENTER See above.
BULL See above.
NOTE See above.
NEW To label the responses new again.
NEW STOP To label the responses new and return to DO NEXT?
STOP To return to the DO NEXT? prompt.
Enter RESPOND to be prompted to enter the text of a response. CONFER formats responses, so entering very long lines do not cause problems. A null line is entered to complete a response and CONFER then prompts with a question of the form:
EDIT, VIEW, CANCEL, MORE, OR DONE:
To which there are several possible responses:
DONE Enter the response (the default)
EDIT Edit the response by invoking the MTS File Editor
VIEW Display the current text of the response
MORE Add more text to the response
CANCEL Cancel the response and discard the text
? Ask for assistance
The complete form of the ITEM command is:
ITEM [item-list] [modifier [modifer [...] ] ]
where item-list selects the items to print and takes the following forms:
n item “n”
n1,n2,n3,... items “n1”, “n2”, and “n3” (a list of items)
n1−n2 items “n1” through “n2” (a range of items)
n:m item “n” with response “m”
n:m1,m2,m3,... item “n” with responses “m1”, “m2”, and “m3” (a list of responses)
n:m1−m2 item “n” with responses “m1” through “m2” of item “n” (a range of responses)
NEXT the next item
PREVIOUS the previous item
LAST the last (highest numbered) item
ALL all items
NEW all new items (not yet seen)
If the item list is omitted, only new items are displayed.
The following modifiers may be appended to the ITEM and many other commands:
BROWSE print only the first two lines of each response
FORGET stop showing this item and its responses
NOFORGET display items even if they have been forgotten
HEADER print the 1-line title instead of 3-line descriptor
LIFO print the responses in reverse chronological order
NODescriptor do not print the 3-line descriptor
NOResponse do not print the responses
NOText do not print the text of the item
PASS automatically pass each item
REVERSE print the items in reverse order (highest number first)
*DUMMY* discard the output of the item and mark it as “seen”
*PRINT* directs output to a printer
*FILE*=filename directs output to a file
Examples
Several simple examples of CONFER use are shown below. Text shown as bold italic is user input. All other text is output.
Example 1: Start CONFER and view new items and enter a response to an item:
#source wabc:project-x
#$Run CNFR:CONFER t=5 par=WABC:PROJECT-X
#Execution begins
Confer II (08/89) - designed by Robert Parnes
Copyright & Trademark: Advertel Communication Systems
CONFERence for WABC:PROJECT-X
Marlou Smith, organizer
New item: 1
No new responses
No new messages
DO NEXT? new
Item 1 14:38 Nov10/90 4 lines 1 response
Marlou Smith
A new beginning!
This notice is to introduce you to our new Project-X
conference. Please join our conference and respond
to this item to indicate that you have successfully
joined. Thank you.
1 response
Nov10/90 14:42
1:1) John Brown: Thank you for the invitation. I am
now a member.
RESPOND, FORGET, OR PASS: respond
GIVE YOUR RESPONSE
> Yes! I too am now a member.
> {return}' [a null or empty line]
EDIT, VIEW, CANCEL, MORE, OR DONE: done
This is response 1:2
DO NEXT?
Example 2: Enter a new item for discussion:
DO NEXT? enter
ENTER NUMBER OF ITEM THAT MOST INSPIRED THIS ITEM: 1
ENTER YOUR TEXT
> This is the first line of text in a new item
> And this is the second and last line of text in the item
> {return} [a null or empty line]
EDIT, VIEW, CANCEL, MORE, OR DONE: done
ENTER THE HEADER FOR YOUR ITEM ON ONE LINE
A new beginning!
OK TO USE DISCUSSION RESPONSES? ok
Your item preparation is now complete.
OK TO ENTER THIS INTO WABC:Project-X? ok
Your entry is now ITEM 2
DO NEXT?
Example 3: Post a new bulletin that will be shown to all members of the conference:
DO NEXT? bulletin
YOU MAY POST A SHORT BULLETIN
- There will be a short meeting tomorrow for all members of Project-X
- in West Conference room at 2 pm.
- {return} [a null or empty line]
EDIT, VIEW, CANCEL, MORE, OR DONE: {return} [a null or empty line]
EFFECTIVE DATE: {return}
EXPIRATION DATE: {return}
Bulletin has been posted.
Marlou Smith Effective: Nov19/90 Expires: Nov26/90
There will be a short meeting tomorrow for all members of Project-X
in West Conference room at 2 pm.
DO NEXT?
Example 4: Transmit a private message to another participant:
DO NEXT? transmit
ENTER YOUR MESSAGE
> I am sending you a test message. Do you read me?
> {return}
EDIT, VIEW, CANCEL, MORE, OR DONE: {return}
ENTER RECIPIENT: john brown
OK TO SEND TO JOHN BROWN? ok
Message sent at 13:11 Nov18/90
ENTER ANOTHER RECIPIENT (or press RETURN):
{return}
DO NEXT?
Example 5: View a private message from another participant:
New message: 2
DO NEXT? message
- Message 2 3 lines 13:12:41 Nov18/90
MESSAGE from: Jack Black 13:11 Nov18/90 WXYZ:MF
I am sending you a test message. Do you read me?
Jack
REPLY, DELETE, OR IGNORE: reply
ENTER YOUR REPLY
> I read you loud and clear!
> John
> {return}
EDIT, VIEW, CANCEL, MORE, OR DONE: done
OK TO SEND TO JACK BLACK? ok
Message sent at 13:12 Nov18/90
ENTER ANOTHER RECIPIENT (or press RETURN):
{return}
Continuing with message 2 from Jack Black
DELETE OR SAVE: delete
Deleted
DO NEXT?
Example 6: Finish the CONFER session and sign off from MTS:
DO NEXT? stop
#Execution terminated
#signoff
InfoX
InfoX (pronounced “info-ex”, originally InfoDisk) is a program for the Apple Macintosh ("Classic"; not compatible with the modern Mac OS X) developed by the Information Technology Division at the University of Michigan. It provides a modern user interface (menus, icons, windows, and buttons) that can be used to check electronic mail, participate in CONFER II conferences, access the MTS User Directory, and create, edit, and manipulate files. InfoX adds Macintosh-style word processing features to the more traditional editing functions available from the CONFER command-line interface. One can use the standard Cut, Copy, and Paste commands under the Macintosh Edit menu to move text from any Macintosh file to a conference entry or message. Text is automatically wrapped text in conference entries and messages.
InfoX allows users to join a conference, enter or respond to an item, read a particular item or response, forget an item, or mark all items as seen. Unseen conference items are displayed in much the same way messages are displayed, so one can select an item by title, not just by item number. When a conference folder is opened, InfoX displays a variety of information about new items and new responses. The buttons at the top of the screen allow the user to join a conference, read any item, enter a new item, forget an item, and mark all items as seen.
Some CONFER II functions are not available through InfoX. One cannot use the program to enter organizer-defined commands, post or read bulletins, hold meetings, use polled or numeric responses, enter pseudonymous or anonymous responses, change entries, access the index or summaries, or send or receive CONFER messages. Because InfoX does not allow for many conference management features, organizers and advanced users choose to access conferences through the traditional CONFER II command-line interface.
Uses
The U-M Center for Research on Learning and Teaching (CRLT) was an early sponsor and proponent of CONFER and saw great promise in it for expanding learning environments.
The first major "test" for the CONFER system was the October 1976 International Society for Technology Assessment (ISTA) Conference held in Ann Arbor. Karl Zinn from U-M's CRLT was interested in testing the technology to facilitate the coordination of tasks among the conference staff as well as using the system to allow conference participants to extend discussions on conference topics. CONFER provided a new opportunity for group discussion and is credited for playing a "tremendous role in enlarging the electronic community" at the University of Michigan.
Those providing user support for the Merit Network in Michigan, particularly Chris Wendt, were excited by the potential for CONFER, and they created the statewide MNET:Caucus conference to help Merit users get quick answers to their questions and take some of the load off their consulting staff. The participants — both consultants and users — learned a lot from each other through the conference.
CONFER continued to gain in popularity with faculty, students, administrators, and staff through the 1980s. The following papers give a hint at the range of activities for which CONFER was used.
"Computer-based educational communications at the University of Michigan", Proceedings of the ACM Annual Conference/Meeting, 1976
A Meeting-related Information Exchange Facility within a computer conferencing environment, 1977, Committee for Information on Science and Technology (CIDST) of the Commission of the European Communities
"Third party consulting in the network environment", CHI '81 Proceedings of the joint conference on Easier and more productive use of computer systems, 1981
"The CONFER experience of the Merit Computer Network", CHI '81 Proceedings of the joint conference on Easier and more productive use of computer systems, 1981
"Uses of CONFER at Wayne State University", CHI '81 Proceedings of the joint conference on Easier and more productive use of computer systems, 1981
"Computer conference and message systems: Their use in a university computer center", Proceedings of the 9th annual ACM SIGUCCS conference on User services, 1981
"Is It Time for CONFER, a Computer-Based Conference for Dental Public Health?", Journal of Public Health Dentistry, 1984
"The Design and Implementation of a Statewide Perinatal Automated Medical Network for Michigan (PAM/NET)", Proceedings of the Annual Symposium on Computer Application in Medical Care, 1985
"Using Computers to Teach Writing", U-M Computing News, 1986, describes how Richard Meisler, Lecturer in U-M's Department of English, uses CONFER to effectively teach students how to write
"Politics and Computers", U-M Computing News, 1986, describes the use of Confer by Fred Goodman and Edgar Taylor of the U-M School of Education, and Raymond Tanter in Political Science at U-M, in their courses Poli Sci 471, "American Foreign Policy Process" and Poli Sci 353, "Arab-Israeli Conflict"
"Computer conferencing for accounting instruction", Journal of Accounting Education, 1989
"The Integration of Computer Conferencing into the Medical School Curriculum", Medical Teacher, 1989
"Institutional Gaming through the use of Computer Conferencing", Empowering networks: computer conferencing in education, 1992
"Connecting the University and the Field of Practice", Empowering networks: computer conferencing in education, 1992
"Uses of Electronic Communication to Document an Academic Community: A Research Report", Archivaria 38, 1994
"Crisscrossing Grand canyon: Bridging the gaps with computer conferencing", Computers and Composition, 1995
In 1985, a group of U-M students established the first computer conference exclusively for students called MEET:STUDENTS. This very popular conference marked, in a sense, the acceptance of online communications as a culturally accepted mode for student communication and exchange.
For many on the Michigan campus and elsewhere, the benefits of CONFER included meeting new people with similar interests, engaging in group discussion, and communicating outside the normal parameters defined by time and space. CONFER played a tremendous role in enlarging the electronic community at the University and in removing the traditional geographic borders of the classroom and campus. Said Parnes, "CONFER enabled a lot of people to talk together who wouldn't have otherwise."
Legacy
There is a group of computer conferencing programs whose designs were derived from CONFER which are sometimes called "WELL-style" systems, because The WELL has been very influential in spreading this design. WELL-style systems facilitate group discussion by treating discussion items as part of an ongoing conversation with an inherent structure. The conversations are organized as linear chains of items and responses with individual items and responses displayed as a continuous stream of text.
Examples of WELL-style Web conferencing software include: Backtalk, Caucus, COW, Motet, PicoSpan, Web crossing, WELL Engaged, and YAPP. Because of its influence on these programs, CONFER has had a strong influence on most of the major computer conferencing, blogs, social networking, and other similar programs and sites that followed.
Documentation
MTS Volume 23: Messaging and Conferencing in MTS
Confer and MTS Help, ITD Reference R1042, October 1, 1989 (1 page)
Computer Conferencing Guidelines, ITD Reference R1043, October 1, 1989 (2 pages)
Guidelines for Effective Conferencing for Organizers, ITD Reference R1044, October 1, 1989 (8 pages)
Guidelines for Effective Conferencing for Participants, ITD Reference R1045, October 1, 1989 (5 pages)
The Beginner’s Guide to Confer II (approximately 40 pages)
An Intro Guide to Using Confer II (approximately 15 pages)
The Reference Guide to Confer II (approximately 100 pages)
The Organizer’s Guide to Confer II (approximately 75 pages)
The Quick Reference Card for Confer II (2 pages)
A summary of Confer commands (2 pages)
A guide for using Confer with multiple userIDs (3 pages)
A guide for the program CNFR:CHECK which monitors conference activity (3 pages)
References
External links
Arab-Israli Conflict Web site, Interactive Communications & Simulations, University of Michigan-Flint and Ann Arbor.
"Sunday in the Park with Parnes", includes group photo, U-M Computing News, vol.1, no.2 (11 August 1986), Computing Center, University of Michigan, p. 3
Parnes, Robert, Learning to CONFER: The Interplay of Theory and Practice in Computer Conferencing (PhD dissertation), 1981, in the Karl Zinn papers at UM's Bentley Historical Library, box 1, 2 folders.
Parnes, Robert, "Learning how to confer: The interplay of theory and practice in computer conferencing", In CHI '81 Proceedings of the joint conference on Easier and more productive use of computer systems (Part - II): Human interface and the user interface, Volume 1981.
Wolter, Jan, "A Partial History of Computer Conferencing in Ann Arbor", The Great Green Room, 2007.
Zinn, Karl, "Computer facilitation of communication within professional communities", Behavior Research Methods (BRM), vol. 9 no. 2 (March 1977), pp. 96–107.
Zinn, Karl, "Case study of a user-oriented conferencing system", CHI '81 Proceedings of the joint conference on Easier and more productive use of computer systems (Part - II): Human interface and the user interface, Volume 1981.
Zinn, Karl, "CONFER Connection", Creative Computing, vol.7, no.4 (April 1981), pp. 98–102.
Bulletin board systems
Internet Protocol based network software
1970s software
University of Michigan
Pre–World Wide Web online services
Virtual learning environments
|
38705739
|
https://en.wikipedia.org/wiki/1929%20Pittsburgh%20Panthers%20football%20team
|
1929 Pittsburgh Panthers football team
|
The 1929 Pittsburgh Panthers football team, coached by Jock Sutherland, represented the University of Pittsburgh in the 1929 college football season. The Panthers finished the regular season undefeated and were considered the champions of the East, and by some, a national championship team. The Panthers concluded the season by traveling by train to California where they lost to USC in the Rose Bowl. Bowls at the time were still widely considered to be exhibition games. According to a 1967 Sports Illustrated article, football pioneer Parke H. Davis, whose “outstanding nationwide team” selections for 1869 to 1933 (all made in 1933) are recognized as "major" in the official NCAA football records book, named Pitt that season's national champion. The article contained a "list of college football's mythical champions as selected by every recognized authority since 1924," which has served as the basis of the university's historical national championship claims, with Davis being the only selector of Pitt in 1929. The team is also recognized as a co-national champion in 1929 by College Football Data Warehouse, along with Notre Dame, the pick of nine major selectors.
Schedule
Preseason
After five years as coach of the Panthers, Coach Sutherland's record was 32–9–5. The Athletic Council approved raising the player stipend from $500 to $650 a year, plus tuition and books, so he could continue to recruit top-notch talent.
Pitt and Carnegie Tech shared the use of Pitt Stadium from the 1929 season through the 1943 season. For $18.00 one could purchase a season ticket for all nine games scheduled at the stadium.
James Hagan, former Pitt halfback, was appointed Assistant Director of Athletics and assumed his duties on February 4, 1929.
Dr. H. A. R. Shanor replaced team doctor Oliver Kendrick who resigned his position to set up practice in Duquesne.
Joseph Bower, a senior in the School of Business Administration, was chosen student manager of the 1929 football team.
The outlook for the 1929 season was promising since only three starters (Alex Fox, Albert Guarino and Mike Getto) and four substitutes (James Scanlon, Ted Helsing, Ed Sherako and Philip Goldberg) had graduated. Coach Sutherland welcomed 75 aspirants to spring practice on March 21 and trained the squad for six weeks. The Pittsburgh Press noted: "Coach Sutherland is well satisfied with the results of the spring workouts and believes his squad will be strong offensively during the autumn campaign. Reserve strength, barring scholastic difficulties, should be plentiful."
Coach Sutherland invited 41 lads to the preseason drills at Camp Hamilton. A hospital and dispensary were now available on site. The camp lasted two and a half weeks with two practice sessions daily. Coach Sutherland worked the team hard because as noted by David Finoli: "He truly believed in the famous quote that his mentor Pop Warner muttered so many times: 'You play the way you practice'." The Panthers returned to Pittsburgh a week prior to the home opener with Waynesburg College "in as fine condition and with as brilliant prospects as any Pitt team has ever boasted." The Panthers roster was strong as the Pittsburgh Press noted: "Apparently, there are no such things as varsity and second teams out where the Golden Panthers are sharpening their claws for nine weeks of feasting, or fasting. There are just two evenly-matched elevens, with not much to choose between them."
A tarp was purchased to cover the stadium gridiron and insure the playing surface would be in great condition regardless of the weather.
Coaching staff
Roster
Game summaries
Waynesburg
The Panthers home opener was against Waynesburg College. The Panthers and the Yellow Jackets had not played in nineteen years. Pitt lost to the Yellow Jackets 14 to 5 in 1897, but the Panthers gained revenge in 1904 by the lopsided score of 83 to 0 and then with a 42 to 0 victory in 1910. Second-year coach Frank N. Wolf was looking to improve the Yellow Jackets record of 0-6 in 1928. The Jackets beat St. Vincent 19 to 6 to open their season.
The Panthers wore new uniforms for the home opener - blue and gold sateen jerseys with tan trousers and blue helmets with gold cross-pieces. The field was protected by the cover purchased over the summer so a dry field was assured.
Harry Keck of the Sun-Telegraph reported: "Under a warm sun and with only about 9,000 fans looking on, another powerful University of Pittsburgh football eleven made its bow at the Stadium Saturday afternoon, showing promise of great things in the games to come by the manner in which, with first, second and third-string men in action, it romped over the squad of Waynesburg College for eight touchdowns and an impressive 53–0 victory."
The Panther offense established superiority early with two touchdowns in the opening period. Tom Parkinson and Josh Williams scored the touchdowns. The Panthers added three more touchdowns in the second stanza. William Walinchus and Parkinson scored on running plays. The third tally came on a pass from Parkinson to Joe Donchess, which Donchess caught while lying flat on the ground in the end zone. The halftime score read Pitt 33 to Waynesburg 0. The three touchdowns in the second half were scored by Parkinson, Walinchus and third-team halfback Fred Johnson. The extra points were done by committee as Parkinson and James Rooney each converted twice and Edward Baker once. Coach Sutherland substituted often and thirty-five Panthers saw action.
Waynesburg finished the season with a 5-4 record.
The Pitt starting lineup for the game against Waynesburg was Joe Donchess (left end), Charles Tully (left tackle), Ray Montgomery (left guard), Ralph Daugherty (center), Albert DiMeolo (right guard), James MacMurdo (right tackle), William Loehr (right end), Charles Edwards (quarterback), Toby Uansa (left halfback), Josh Williams (right halfback) and Tom Parkinson (fullback). Substitutes appearing in the game for Pitt were Edward Baker, James Rooney, William Walinchus, Frank Hood, Joe Tommins, Jesse Quatse, Walter Milligan, Markley Barnes, Hart Morris, Vladimir Babic, Paul Collins, Al Ciper, Daniel Fuge, Robert Morris, Frank Fisher, Arthur Corson, Edward Schultz, Harry Wagner, Jack Kelly, Felix Wilps, Fred Johnson, James Clark and Walter Potter.
at Duke
The first road trip of the season took the Panthers to Durham, NC to both battle the Duke Blue Devil eleven and take part in the dedication of their new 35,000 seat stadium. This was Pitt's first trip to the "deep-south" for a football game. The train departed Pittsburgh Wednesday night and arrived in Washington D. C. on Thursday morning. David Finoli noted: "While in the nation's capital, the team got the chance to meet President Herbert Hoover and have their picture taken with him as they visited the White House. They would have the honor of being the first college football team to visit the White House in Hoover's tenure." Sightseeing and a luncheon were followed by practice on the Georgetown Field. Thursday night the squad was back on the train and arrived in Durham Friday morning. Friday's practice was held at the University of North Carolina stadium in Chapel Hill. For the dedication game, the team wore a special hot weather uniform of blue silk with gold trim across the shoulders, and blue helmets with gold crosspieces. The 70-piece Pitt marching band made the trip and took part in the festivities.
Duke coach James DeHart, Pitt's first four-sport letterman, "is conceded to have one of the best teams ever developed in the South, and with football interest of the whole section focused on the big intersectional game at Durham, the Blue Devils will be primed for the Panthers." Coach DeHart was pessimistic when he spoke to The Pittsburgh Press: "We cannot hope to win. I only hope that Jock won't run it up too high on me." Henry Kistler, Duke captain and star tackle, was injured in the previous game against Mercer and was out of the lineup.
The Pittsburgh Press noted: 'At Chapel Hill, where hostility to Duke runs high, the North Carolina boys were unanimous in declaring that the Panthers would triumph. They hoped it would be an overwhelming setback for the Durham lads, they said."
The Panthers were healthy, but Coach Sutherland made two changes to the starting lineup - Edward Baker replaced Charles Edwards at quarterback and Paul Collins replaced William Loehr at end.
The News and Observer reported: "Pitt's powerful Panthers performing perfectly more often than not, showed 20,000 football fans and stadium connoisseurs a great grid machine here today as they rolled up a 52 to 7 score against Duke's Blue Devil in the dedication game of this university's new stadium."
The Duke defense could not stop Pitt's running attack. The Panthers received the opening kick-off and Toby Uansa raced from his 7-yard line to the Duke 45-yard line before he was downed. Six plays later Harold Williams sprinted the last 7 yards for the touchdown. The Pitt defense forced a punt and got possession on their 42-yard line. After gaining a first down, Williams scampered 40 yards around end for his second score of the game. Duke went to the air and advanced the ball to the Pitt 20-yard line, but lost the ball on downs. On second down Uansa dashed 78 yards for the third tally of the first quarter and Tom Parkinson converted the point after Pitt led 19 to 0. Early in the second quarter the Blue Devils advanced to the Pitt 24-yard line, but again lost the ball on downs. On first down Uansa took the handoff and rambled 76 yards for his second touchdown of the game. Parkinson converted the point after and Pitt led 26 to 0. Sutherland removed the starting lineup for the remainder of the game. James Rooney scored twice in the third quarter on runs of 58 and 45 yards and William Walinchus added a touchdown scamper of 47 yards. The Panthers also earned a safety in the period to bring the score to 46 to 0. Edward Schultz scored the final Pitt touchdown on a pass play from Frank Hood in the last quarter. Duke scored in the last minutes on a 53-yard pass play from Sam Buie to Robert Beaver. Buie kicked the point after and the final score read - Pitt 52 to Duke 7. Duke finished the season with a 4–6 record.
The Pitt starting lineup for the game against Duke was Joe Donchess (left end), Charles Tully (left tackle), Ray Montgomery (left guard), Ralph Daugherty (center), Albert DiMeolo (right guard), James MacMurdo (right tackle), Paul Collins (right end), Edward Baker (quarterback), Toby Uansa (left halfback), Josh Williams (right halfback) and Tom Parkinson (fullback). Substitutes appearing in the game for Pitt were Charles Edwards, James Rooney,Edward Hirschberg, Vladimir Babic, Jesse Quatse, James Clark, Hart Morris, Markley Barnes, Walter Milligan, William Loehr, William Walinchus, Arthur Corson, Joe Tommins, Harry Wagner, Al Ciper, Felix Wilps, Herman Yentch, Edward Schultz, Frank Hood, Robert Morris and Ernest Lewis.
West Virginia
The 25th game against the Mountaineers of West Virginia was the first "feature" game of the season at the stadium. Fifth year coach Ira Rogers' eleven was 1–1–1 after winning their opener against West Virginia Wesleyan 16–0, losing to Davis & Elkins 13–6 and then tying Duquesne 7–7. The Panthers lost to the Mounties last year but still lead the series 15–8–1.
The Pittsburgh Press reported: "The Panther players are determined...Their defeat last year rankled as few beatings have. They frankly want revenge and a team in that frame of mind is dangerous." The Panthers were healthy and Coach Sutherland started the same eleven that beat Duke.
The Panthers gained their revenge for the 9–6 loss in 1928 by beating the Mountaineers 27 to 7. The Panthers would go on to win 19 of the next 20 games played in the series.
On Pitt's third possession, Josh Williams culminated a fifty-nine yard drive with a 17 yard scamper through tackle for a touchdown. Parkinson added the point after and Pitt led 7 to 0 at the end of the first quarter. The second period saw the Panther offense advance the ball to the West Virginia 4-yard line before losing the ball on downs. The Mountaineers punted out of trouble. The Panthers lost possession on a fumble. Pitt's Paul Collins then intercepted an Eddie Stumpp pass to regain possession for Pitt on their 49-yard line. Three running plays advanced the ball to the Mountaineer 17-yard line. On fourth down Eddie Baker's pass was caught by Toby Uansa on the 2 and he fell over the goal line for the touchdown. Uansa added the point and Pitt led 14 to 0 at halftime.
Pitt received the second half kickoff and drove 72 yards for their third touchdown with Uansa going around left end for the last 13 yards for the score. Parkinson missed the placement and Pitt led 20 to 0. The Mountaineers answered with a 43 yard touchdown pass from Stumpp to Bill Behnke. Glenn converted the point after and the score read 20 to 7. After an exchange of possessions Uansa fumbled and West Virginia recovered on their 45-yard line. On third down Uansa intercepted Stumpp's pass and raced 60 yards for the final score of the contest. Parkinson added the point after and Pitt led 27 to 7. The final quarter was a punting duel with many substitutes playing for both sides.
The Mountaineers finished the season with a 4–3–3 record.
The Pitt starting lineup for the West Virginia game was Joe Donchess (left end), Charles Tully (left tackle), Ray Montgomery (left guard), Ralph Daugherty (center), Albert DiMeolo (right guard), James MacMurdo (right tackle), Paul Collins (right end), Edward Baker (quarterback), Toby Uansa (left halfback), Josh Williams (right halfback) and Tom Parkinson (fullback). Substitutes appearing in the game for Pitt were William Walinchus, James Clark, James Rooney, Charles Edwards, William Loehr, Hart Morris, Walter Milligan, Vladimar Babic, Jesse Quatse, Edward Hirschberg, Markley Barnes, Frank Hood, Harry Wagner, Robert Morris, Joe Tommins, Edward Schultz, Ernest Lewis, Al Ciper and Leo Murphy.
at Nebraska
The trainload of Panthers, for their second road game, headed west to battle the Cornhuskers of Nebraska. This was the fourth meeting between the two schools, with the series record 1–1–1. Similar to the 1928 trip, the Panthers left Wednesday evening and arrived in Chicago on Thursday morning. The team practiced on Stagg Field at the University of Chicago. They reboarded the train in the evening and arrived in Omaha on Friday morning. The Ak-Sar-Ben fairgrounds in Omaha was the site of their final scrimmage. Saturday morning the team rode the final 60 miles to Lincoln. The Panthers were healthy and Coach Sutherland started the same lineup he used against West Virginia.
Dana X. Bible replaced Ernest Bearg as Nebraska coach. He had the Huskers 1–0–1 on the season. Nebraska opened at home with a scoreless tie against SMU. They then traveled to Syracuse and beat the Orange 13 to 6. The Huskers lineup boasted an All-American tackle – Ray Richards, and five more members of the 1929 All-Big 6 Conference team. Richards and fullback Clair Sloan were named to the first team and end Steve Hokuf, guard George Koster, halfback George Farley, and tackle Marion Broadstone were named to the second team. David Finoli pointed out that "with home-field advantage and the fact that they had revenge on their minds themselves as they had not beaten Pitt in the past two campaigns, Nebraska certainly had all the intangibles on their side." Notre Dame coach Knute Rockne disagreed, writing in his weekly column: "Pittsburgh has possibly one of the best teams in the East this year, if not in the country, and they will carry too many guns for Coach Bible's men. Nebraska showed nice improvement last week at Syracuse, but they are not ready yet for a team of the caliber that 'Jock' Sutherland will send on to the field this Saturday afternoon."
The Panthers prevailed with a 12 to 7 victory. The first quarter was scoreless, but the Panther offense scored twice in the second stanza to take a 12 to 0 lead into halftime. Halfback William Walinchus caught a short pass from Edward Baker and raced 60 yards to the Nebraska 6-yard line. Tom Parkinson plunged into the end zone on third down for the first touchdown. The second touchdown came on Pitt's next possession and was aided by a 15 yard penalty which took the ball from the Husker 24-yard line to the 9-yard line. Parkinson shoved it across on fourth down and Pitt was done scoring for the day. Parkinson missed both placements. After a scoreless third quarter, the home team blocked a Parkinson punt and recovered the ball on the Pitt 25-yard line. On third down Clair Sloan hit Cliff Morgan with a touchdown pass. Sloan added the point after and the final score read: Pitt 12, Nebraska 7.
Coach Bible told The Lincoln Star: "When the season started I expressed the hope that in the event we lost a game the defeat would be sustained at the hands of a good football team. I do not hesitate to admit that we lost today to that sort of team." The Cornhuskers finished the season with a 4–1–3 record and won the Big Six Conference title.
The Pitt starting lineup for the game against Nebraska was Joe Donchess (left end),Charles Tully (left tackle), Ray Montgomery (left guard), Ralph Daugherty (center), Albert DiMeolo (right guard), James MacMurdo (right tackle), Paul Collins (right end), Edward Baker (quarterback), Toby Uansa (left halfback), Josh Williams (right halfback) and Tom Parkinson (fullback). Substitutes appearing in the game for Pitt were William Walinchus, Vladimar Babic, William Loehr, Charles Edwards, Hart Morris, James Rooney, Frank Hood and Harry Wagner.
at Allegheny
On October 26, while Carnegie Tech was hosting Notre Dame at Pitt Stadium, the Pitt Panthers and Allegheny Methodists met for the final time on the gridiron at Municipal Stadium in Erie, Pa. This was the third and final road game for the Panthers. In addition to the game, the Erie – Allegheny Alumni Association and the Erie branch of the University of Pittsburgh arranged a fun-filled day for both fans and students.
Pitt led the all-time series 7–2. Allegheny won two straight games from Western University Pittsburgh back in 1901 and 1902, but the Panthers won the last six and outscored the Methodists 262 to 14.
First year coach Harry Crum's Methodists were 0–2–1 on the season. They tied Geneva (13–13) in their home-field opener, and then lost to Westminster (7–6) before traveling to Dartmouth and losing (53–0).
Coach Sutherland started the second string to keep the regulars healthy for the final four game stretch of Ohio State, Wash. & Jeff., Carnegie Tech and Penn State. The Campus (student newspaper of Allegheny College) reported that three of their starters did not play and six other regulars were injured and missed playing time, so it turned into a game of opportunity for substitutes. The Panthers were too strong and beat the Methodists 40 to 0. James Rooney led the way with three rushing touchdowns and four extra point conversions. William Walinchus, James Clark and Leo Murphy each added a touchdown. Allegheny threatened in the first quarter as they advanced to the Pitt 10-yard line. Walter Milligan intercepted a pass to thwart the drive. The Methodists drove to the Pitt 7-yard line in the waning moments of the game but the Pitt defense held on downs. Allegheny finished the season with a 2-4-2 record.
The Pitt starting lineup for the game against Allegheny was William Loehr (left end), Jesse Quatse (left tackle), Walter Milligan (left guard), Markley Barnes (center), Hart Morris (right guard), Vladimar Babic (right tackle), Paul Collins (right end), Charles Edwards (quarterback), James Rooney (left halfback), William Walinchus (right halfback) and James Clark (fullback). Substitutes appearing in the game for Pitt were Ernest Lewis, Edward Hirschberg, Leo Murphy, Felix Wilps, Al Ciper, Tom Parkinson, Joe Donchess, Charles Tully, Albert DiMeolo and Toby Uansa.
While the country was reeling from the stock market frenzy, the sports topic highlighted this week in history was the Carnegie Foundation report on college athletics. David Finoli noted: "The unique thing about the report was the lack of specifics or the facts that at several universities like Pitt, there were no investigators reported on campus. Regardless of the inadequacies, it brought to light the issues of paying athletes in college football and began a national debate on the ethics of the policy, a policy that would be uncovered at the University of Pittsburgh toward the end of the next decade and would eventually lead to the downfall of their powerful national championship program."
Ohio State
On November 2 Pitt faced its first opponent from the Western Conference (Big Ten), as the undefeated Ohio State Buckeyes visited Pitt Stadium for the Homecoming Game. First-year coach Sam Willaman's Buckeyes were 3–0–1 on the season. The Buckeye line was anchored by All-American end Wesley Fesler, who would later coach the Panthers for the 1946 season, and All-Big 10 guard Sam T. Selby, while All-Big 10 quarterback Alan M. Holman was the star of the backfield.
The Panthers kept their winning streak intact with an 18 to 2 victory. Ohio State received the opening kick-off, but the Pitt defense forced a punt and gained possession on their 30-yard line. On second down Toby Uansa ran around left end 68 yards for the first touchdown. Tom Parkinson missed the point after and Pitt led 6 to 0. Late in the quarter the Buckeye halfback Arden McConnell mishandled a snap from center and had to fall on the ball in the end zone for a safety. Pitt led 8 to 0 at the break. Pitt fumbled into the end zone in the second stanza and Uansa covered it for a safety and two points for Ohio State. James Rooney converted a 22 yard field goal on Pitt's next possession and Pitt led 11–2 at halftime. The third period was scoreless as the State defense stopped Parkinson inches short of the goal line after the Panthers had recovered a fumble on the State 2-yard line. Pitt had possession on the Buckeye 25-yard line at the end of the third quarter. On the first play after the break, Rooney faked a punt and threw a pass to Uansa on the 13-yard line. He carried it into the end zone for Pitt's last touchdown of the game. Rooney converted the point after. Ohio State finished the season with a 4–3–1 record.
Coach Sutherland praised the Buckeyes: "No Pitt team ever got more breaks than mine did today. Ohio was never favored by fortune. The real feature to my mind was the splendid sportsmanship exhibited by the players of both teams. So far as I was able to see, it was one of the cleanest games I have ever witnessed, despite the fact that both teams were fighting hard. The score does not indicate a thing. We are not 16 points better than Ohio State."
The Pittsburgh Press noted: "Ohio State may have lost the football game, but so far as regular visitors to the stadium are concerned, their band won the world's championship yesterday. The Buckeye musicians are without a doubt the finest college band ever to have appeared in Pittsburgh. The visit of this superb 110-piece organization to Pittsburgh will not be forgotten soon."
The Pitt starting lineup for the game against Ohio State was Joe Donchess (left end), Charles Tully (left tackle), Ray Montgomery (left guard), Ralph Daugherty (center), Albert DiMeolo (right guard), James MacMurdo (right tackle), Paul Collins (right end), Edward baker (quarterback), Toby Uansa (left halfback), Josh Williams (right halfback) and Tom Parkinson (fullback). Substitutes appearing in the game for Pittsburgh were James Rooney, William Loehr, Jesse Quatse, Charles Edwards, Leo Murphy, Hart Morris, James Clark, Vladimar Babic, Harry Wagner and Edward Hirschberg.
Washington & Jefferson
On November 9, 1929, the Pitt Panthers, holding a slim 14–13–2 margin in the all-time series, welcomed their fiercest rival to this point in their football history, the Presidents of Washington & Jefferson, to Pitt Stadium for their annual tussle. The Presidents led by dual coaches, Ray A. Ride and Bill Amos, were undefeated with a 4–0–2 record. Their only blemishes were scoreless ties with Temple and Carnegie Tech. The Presidents had outscored their opponents 124–6. Star tackle Forrest Douds was a three-time All-American, who would become the first coach of the football Pirates (Steelers) in 1933.
Coach Sutherland warned against overconfidence: "Newspapers all over the country have greatly overrated the Panther club and have left a more or less cocksuredness air among the players, the attitude that victory is an established fact. Such an attitude may not work out so well in the remaining three games."
The Panthers obeyed their coach and shut out the Presidents 21 to 0 to keep their quest for a national title on track. The teams traded fumbles early in the opening period. On the Panthers opening possession, Tom Parkinson fumbled on the W. & J. 48-yard line. Two plays later W. & J. halfback Don Lewis fumbled and Charles Tully recovered for the Panthers on their 31-yard line. The Panthers advanced the ball to the Presidents 13-yard line and lost the ball on downs. On W. & J.'s second down Lewis fumbled again and Tully recovered on the Presidents 24-yard line. Toby Uansa gained 5 yards and Parkinson followed with a run to the 1-foot line. Parkinson fumbled on first down, but recovered on the 4-yard line. On third down he plunged into the end zone for the touchdown. Parkinson added the point after and Pitt led 7 to 0. The rest of the half was scoreless as both defenses stiffened. Pitt's third possession of the second half started on their 39-yard line. On third down a 38 yard pass play from James Rooney to Eddie Baker took the ball to the W. & J. 23-yard line. Uansa carried the ball the final 12 yards for the touchdown. Parkinson added the placement for a 14 to 0 Pitt lead at the end of the third stanza. Early in the last period, Pitt gained possession on their 24-yard line. "Uansa got around left end, was apparently stopped on the Pitt 38, but was not in the grasp of a tackler, so he got up and ran to the W. & J. 20." Coach Sutherland then replaced the entire backfield. William Walinchus scored the final touchdown of the contest from two yards out and Charles Edwards added the point after to make it 21 to 0.
The Presidents finished the season with a 5–2–2 record and would not meet the Panthers on the gridiron again until the 1933 season.
The Pitt starting lineup for the game against Washington & Jefferson was Joe Donchess (left end), Charles Tully (left tackle), Ray Montgomery (left guard), Ralph Daugherty (center), Albert DiMeolo (right guard), James MacMurdo (right tackle), Paul Collins (right end), Edward Baker (quarterback), Toby Uansa (left halfback), Josh Williams (right halfback) and Tom Parkinson (fullback). Substitutes appearing in the game for Pitt were James Rooney, William Loehr, Jesse Quatse, Hart Morris, Leo Murphy, William Walinchus, James Clark, Charles Edwards, Walter Milligan, Vladimar Babic, Markley Barnes, Frank Hood, Joe Tommins,Harry Wagner,Edward Schultz, Felix Wilps and Robert Morris.
Carnegie Tech
On November 16, 54,000 spectators flocked to Pitt Stadium for the sixteenth edition of the "City Game". Pitt led the overall series with Carnegie Tech 11–4, but the Tartans had won four of the past six, including the previous year's 6 to 0 battle in the mud. Eighth-year coach Walter Steffen had his team 4–1–1 on the season. The only missteps were a 7–0 loss to Notre Dame and a scoreless tie with Washington & Jefferson. Coach Steffen told the Post-Gazette: "Carnegie Tech is going up against a powerful team, one of the most powerful in the country, but we're going to be in there giving our best. The game should be a good one, and may the best team win."
Coach Sutherland was worried: "Carnegie Tech has a greatly under-rated team. Two weeks of rest have done Tech a lot of good. The Tartans will be 50 per cent stronger today than they were against Notre Dame three weeks ago. I expect the hardest game, by far, of the year."
The Panthers shocked the Tartans and the crowd by scoring 21 points in the opening quarter. Toby Uansa rambled 58 yards on the second play from scrimmage for a touchdown. Tom Parkinson booted the point after for an early 7 to 0 Pitt lead. The Panther defense forced a punt. The center snap went over the punter Harry McCurdy's head. He retrieved the ball, but his punt attempt was blocked by Albert DiMeolo. The ball went through the end zone for a safety and Pitt led 9 to 0. The Panthers then advanced the ball to the Tartan 24-yard line, but lost possession on downs. Uansa intercepted Howard Eyth's pass on the Pitt 25-yard line. The Pitt ground game advanced the ball to the Tech 41-yard line. Uansa broke free through left tackle and scored his second touchdown of the period. Parkinson missed the placement and Pitt led 15 to 0. Joe Donchess intercepted Eyth's pass on the Tech 16-yard line. The Panthers lost the ball on downs at the 12. Tech fullback John Karcis fumbled on second down. William Walinchus caught the fumble in the air and raced 14 yards into the end zone for the Panthers third touchdown in the first fifteen minutes. James Rooney was wide on the placement and Pitt led 21 to 0 at the break. Walinchus scored his second touchdown after a sustained drive in the second stanza. Pitt led 27 to 0 at halftime. The Panther offense spent the third quarter in Tech territory, but could not add to their lead. Early in the final quarter Tech got on the scoreboard with a touchdown on a short drive aided by a poor center snap by Pitt in punt formation. Thayer Flanagan caught a short pass for the score. The placement was blocked. Pitt then sustained another long drive with James Clark plunging over center for the score. Edward Baker added the point after and Pitt led 34 to 6. Tech added a late score on an 80 yard touchdown pass play from McCurdy to John Kerr. John Dreshar added the point after to close the scoring for the game. Pitt 34 to Tech 13.
Carnegie Tech finished the season with a 5–3–1 record.
The Pitt starting lineup for the game against Carnegie Tech was Joe Donchess (left end), Charles Tully (left tackle), Ray Montgomery (left guard), Ralph Daugherty (center), Albert DiMeolo(right guard), James MacMurdo (right tackle), Paul Collins (right end), Edward baker (quarterback), Toby Uansa (left halfback), William Walinchus (right halfback) and Tom Parkinson (fullback). Substitutes appearing in the game for Pitt were James Rooney, James Clark, Leo Murphy, Jesse Quatse, Ed Hirschberg, Hart Morris, Vladimar Babic, Walter Milligan, William Loehr, Charles Edwards and Harry Wagner.
Penn State
The annual Thanksgiving Day battle with Penn State would determine Pitt's football fate in their drive for a national title and Rose Bowl invitation. Hugo Bezdek was in his twelfth and final year as coach of the Lions. The Nittanies had a 6–2 record, having lost to NYU (7–0) and Bucknell (27–6). The Panthers led the all-time series 17–12–2. Penn State had not beaten Pitt since 1919.
The Pittsburgh Sun-Telegraph noted: "Exactly 20 November games in all have been played by the Panthers under their present mentor, and of these they have won 16, tied 3 and lost one. The lone defeat was administered by the Presidents (W. & J.) in 1924."
Ten Panthers made their last appearance at the stadium in a Pitt uniform on Thanksgiving Day: Tom Parkinson, Toby Uansa, Joe Donchess, Ray Montgomery, Albert DiMeolo, Charles Edwards, Al Corson, Markley Barnes, James Rooney and Felix Wilps. Coach Sutherland made two changes to the lineup. Halfback Josh Williams' injured knee did not respond to treatment, so he was replaced by William Walinchus and Ed Hirschberg replaced Paul Collins at end.
The Pitt Panthers completed their undefeated regular season by beating the Nittany Lions 20 to 7. The Penn State defense was geared to stop Toby Uansa, so Tom Parkinson rushed for 182 yards and scored all 20 points for the Panthers. Pitt scored first after a 65 yard sustained drive with Parkinson plunging over from the one. His point after attempt was wide. Pitt led 6 to 0 at the end of the first quarter. Late in the second period the Penn State offense started a drive from their 47-yard line. After reaching the Pitt 26-yard line, the Panthers called time out to regroup, but nonetheless State quarterback Cooper French threw a touchdown pass to end Skip Stahley tying the game. Yutz Diedrich booted the point after. The ball hit the upright and bounced over the cross-bar. Pitt trailed for the first time all season. Halftime score: Penn State 7 to Pitt 6. Mid-third quarter, the Panther offense started on their 16-yard line and went 84 yards on 16 plays for the touchdown. Parkinson carried the ball on 11 plays, including the last 3 yards for the touchdown. His point after was successful and Pitt led 13 to 7 at the end of the third period. The Panther offense regained possession on their 47-yard line early in the fourth stanza, and minutes later Parkinson scored his final touchdown of the day and added the placement.
The Pitt starting lineup for the game against Penn State was Joe Donchess (left end), Charles Tully (left tackle), Ray Montgomery (left guard), Ralph Daugherty (center), Albert DiMeolo (right guard), James MacMurdo (right tackle), Ed Hirschberg (right end), Edward Baker (quarterback), Toby Uansa (left halfback), William Walinchus (right halfback) and Tom Parkinson (fullback). Substitutes appearing in the game for Pitt were Paul Collins and Jesse Quatse.
Penn State finished the season with a 6–3 record. Hugo Bezdek, with an over-all 12-year record of 65–30–11, had a 1–9–2 record versus the Panthers. He was replaced by his assistant Bob Higgins.
Pitt was invited to play a post-season benefit game for the Christmas Fund against Fordham or Colgate in New York City. The University Athletic Council turned down the offer in hopes that an invitation to the Rose Bowl would be forthcoming after the Penn State game.
On December 4, the San Francisco Junior Chamber of Commerce invited the Panthers to play the undefeated St. Mary's Gaels at Kezar Stadium on December 21. The Tournament of Roses committee chose USC for the Rose Bowl host team, so St. Mary's extended the offer to Pitt with the enticements of more money and cooler weather. The Panther Athletic Council declined the offer because the team would miss more than a week of classes.
vs USC (Rose Bowl)
On December 6, "Dr. H. E. Friesell, dean of the Pitt school of dentistry, and chairman of the Panther athletic schedule committee, was officially notified by long-distance telephone yesterday afternoon that Pitt had been selected by Southern California to represent the East in the Tournament of Roses battle." The Panthers accepted and Ralph Davis of The Pittsburgh Press wrote: "A defeat by the Trojans would be a humiliating blow to the Panther prestige. (Howard) Jones' boys by no stretch of the imagination, can be figured as a championship eleven. They have been beaten twice."
Hours before the Panther entourage boarded the train headed west, C. L. Woolridge, chairman of the athletic council, announced that Jock Sutherland would be retained as coach of the Panthers for the next five years. Woolridge stated: "The council had renewed the contract with Dr. Sutherland not only because it considers him one of the foremost coaches of the country, but also because it has a deep appreciation of his widespread influences in teaching good sportsmanship and clean living."
The second Rose Bowl trip under Jock Sutherland's leadership took a southwestern route so the team could become better accustomed to the heat of southern California. The Panther train departed Christmas night for St. Louis, where the team was unable to practice the following morning on the muddy Washington University field. Dallas, Texas was the next stop, with a practice session under ideal weather conditions on the field of Southern Methodist University. On December 28 the train arrived in El Paso, Texas where the team had a short workout on the high school field before boarding the train for Tucson, Arizona and a day of rest at the Santa Rita Hotel. The Pittsburgh Panthers arrived in Pasadena on the evening of December 30 and stayed at the Hotel Huntington. "The squad will do no sight-seeing going to the coast, nor will it see the celebrations before the game. Sutherland will give the boys no opportunity to have their minds distracted from football."
The USC Trojans led by fifth year coach Howard Jones came into the game with a 9–2 record. Their two losses were at home against the California Bears (15–7) and at Chicago against Notre Dame (13–12). End Francis Tappaan was named first-team All-America by the United Press, the Newspaper Enterprise Association, the North American Newspaper Alliance and the All-American Board of Football. Captain and guard Nate Barragar was named second team All-America by the International News Service, the Central Press Association and Davis Walsh. Quarterback Russ Saunders garnered third team accolades from the Newspaper Enterprise Association and the North American Newspaper Alliance.
The Pasadena Post reported: 'With a wealth of reserve material and perfect mental attitude in the minds of players Coach Howard Jones felt confident that his charges would weather the test against the undefeated champions of the east."
Jock Sutherland told the San Francisco Examiner: "My men are apparently in good condition - no colds, no injuries – and they will be ready for a real fight. Just say the weather will have no effect whatever on the outcome."
The Pasadena Star-News New Year's Number noted: "The University of Southern California scored the most overwhelming victory in the history of the Tournament of Roses East-West football game, at the Rose Bowl the afternoon of January 1, 1930, when it defeated the University of Pittsburgh, 47 to 14."
Pitt received the opening kick-off. On the first play from scrimmage Toby Uansa sprinted around left end for a 68 yard gain to the USC 14-yard line where they lost the ball on downs. The Trojan offense controlled the rest of the first half, scoring four touchdowns and two extra points to lead 26 to 0 at halftime. Trojan quarterback Russ Saunders threw a 55 yard touchdown pass to halfback Harry Edelson to open the scoring. Gaius Shaver was good on the point after. Saunders then connected on a 25 yard scoring pass to halfback Ernest Pinckert. Shaver missed the placement. End of first period: USC 13 to Pitt 0. Then the Trojans recovered a Pitt fumble on the Panther 18. Marshall Duffield replaced Saunders at quarterback and scored on a three yard end run. The placement bounced off the upright. The Trojans ended the first half with a 1 yard touchdown plunge by Duffield and the conversion by John Baker. Halftime score: USC 26 to Pitt 0. Saunders returned to his quarterback position to start the third period and raced 15 yards for a touchdown. Shaver tacked on the point to make the score 33 to 0. The Panthers proceeded to sustain a drive and Uansa threw a 28 yard touchdown pass to William Walinchus to put the Panthers on the board. Tom Parkinson was good on the placement. The Panther defense could not stop the Trojans, as Saunders threw a 38 yard scoring toss to Edelson. Baker added the point to make the score USC 40 to Pitt 7. Pitt back Charles Edwards intercepted a Duffield pass and ran back to the USC 36-yard line. Josh Williams connected with end Paul Collins on a 36 yard touchdown pass. Parkinson added the point to make it USC 40 to Pitt 14. Duffield answered with a 62 yard scoring pass to Thomas Wilcox and drop-kicked the point after to finalize the game's scoring.
Statistically, the Panthers out gained the Trojans on the ground, but USC was dominant through the air. Southern Cal gained 454 total yards to 285 for the Panthers. USC completed 8 of 16 passes for 287 yards. Pitt completed 4 of 19 passes for 87 yards. USC gained 167 yards rushing to 199 for the Panthers. USC earned 14 first downs and Pitt 10.
Coach Sutherland praised the Trojans to The Los Angeles Times: "U.S.C. has come ahead, we have gone back since Thanksgiving Day. The Trojans played beautiful football, we fell down. I have seen few teams function better than U.S.C. did against us. My team's defense against Howard Jones's passing attack simply went to pieces."
The Pitt starting lineup for the game against USC was Joe Donchess (left end), Charles Tully (left tackle), Ray Montgomery (left guard), Ralph Daugherty (center), Albert DiMeolo (right guard), James MacMurdo (right tackle), Paul Collins (right end), Edward Baker (quarterback), Toby Uansa (left halfback), William Walinchus (right halfback) and Tom Parkinson (fullback). Substitutes appearing in the game for Pitt were Jesse Quatse, Hart Morris, Ed Hirschberg, James Clark, Charles Edwards, Josh Williams, Vladimar Babic, Leo Murphy, William Loehr, Walter Milligan, James Rooney, Markley Barnes, Ernest Lewis and Harry Wagner.
The Panthers spent January 2 and 3 sightseeing in southern California, and then boarded the train for the trip home. The itinerary included stops at the Grand Canyon, where they met Charles Lindbergh, and the Indian ruins near Santa Fe, New Mexico. The Santa Fe visit was scratched so the University could save $1,200, and the players could get back for classes. The Panthers arrived back in Pittsburgh on January 8. They were greeted by a crowd of 3,500, which included students, fans, the Pitt band and Chancellor John G. Bowman.
Scoring summary
Postseason
On January 29th at the annual football banquet, coach Sutherland named Edward Baker captain for the 1930 season, and W. D. Harrison, director of athletics, awarded letters to the following players: Albert DiMeolo, Edward Baker, Joe Donchess, Charles Tully, Ray Montgomery, Ralph Daugherty, James MacMurdo, Paul Collins, Charles Edwards, Toby Uansa, Harold Williams, Tom Parkinson, Jesse Quatse, Markley Barnes, Hart Morris, Edward Hirschberg, James Rooney, William Walinchus, James Clark and Manager Joe Bower.
On February 1st the Veteran Athletes of Philadelphia awarded the Panthers the Joseph H. Jolley Trophy emblematic of the Eastern football champions.
The Panther department of athletics named Walter A. Kearney student manager of the 1930 varsity football team. Mr. Kearney was a dental student and had been an assistant manager the past three seasons.
Author David Finoli in his book When Pitt Ruled The Gridiron wrote this assessment of the Pitt 1929 season after the bowl loss: "Any argument that Pittsburgh was a better team than Notre Dame much less Southern Cal became a moot point after this annihilation, the worst defeat by any school in Rose Bowl history to that point. Luckily, in the historical context, the experts of the day did not consider bowl games anything more than an exhibition, so Parke H. Davis did not consider the embarrassing effort when naming the Panthers 1929 national champions."
All-Americans
Joe Donchess, end (College Football Hall of Fame inductee) (1st team Associated Press, based on a nationwide opinion poll of 215 experts, including "newspaper sports editors and writers, Associated Press staff observers, officials and coaches in every section of the country."; 1st team United Press, "named by the United Press with the assistance and advice of more than 200 coaches, officials and experts from every part of the country"; 1st team Collier's Weekly as selected by Grantland Rice; 1st team Newspaper Enterprise Association selected as follows: "In the selection of these All-America players, the opinions of more than 100 coaches and football writers have been confidentially consulted."; 1st team International News Service (later merged with UP to form UPI), based on "popular vote among sport writers and coaches, representing every major section of the country"; voters included Damon Runyon, Ford Frick, Tom Thorp, Dick Hylund, John Heisman, and Bill Corum; 1st team North American Newspaper Alliance, selected by four noted coaches, Dan McGugin, Howard Jones, Bob Zuppke, and Bill Roper; 1st team New York Sun; 1st team New York Post; 1st team All-America Board of Football, consisting of Knute Rockne, "Pop" Warner, Tad Jones and W.A. Alexander; 1st team Davis Walsh for the International News Service; 1st team Lawrence Perry:"Lawrence Perry selected his 1929 All-America football team after traveling many thousands of miles and watching most of the country's leading teams in play or practice"; Washington Times)
Ray Montgomery, guard (2nd team AP; 1st team United Press; 1st team Collier's Weekly; 1st team Newspaper Enterprise Association; 1st team International News Service; 2nd team North American Newspaper Alliance; 2nd team New York Sun; 1st team All-America Board of Football; 1st team Davis Walsh)
Luby DiMeolo, guard (3rd team International News Service [t]; 2nd team New York Post)
Octavius "Toby" Uansa, halfback (1st team AP-1; 3rd team United Press; 2nd team Newspaper Enterprise Association; 2nd team International News Service; 3rd team North American Newspaper Alliance; 1st team Central Press Association, "selected by the readers of hundreds of client newspapers of the Central Press Association"; Washington Times)
Thomas "Pug" Parkinson, fullback (2nd team AP; 2nd team United Press; 1st team International News Service; 2nd team North American Newspaper Alliance; 1st team New York Sun; 2nd team New York Post; 2nd team Davis Walsh [hb]; 1st team Lawrence Perry; Washington Times)
Bold – Consensus All-American
References
Pittsburgh
Pittsburgh Panthers football seasons
College football national champions
Pittsburgh Panthers football
|
2622712
|
https://en.wikipedia.org/wiki/VTK
|
VTK
|
The Visualization Toolkit (VTK) is an open-source software system for 3D computer graphics, image processing and scientific visualization.
VTK is distributed under the OSI-approved BSD 3-clause License.
Functionality
VTK consists of a C++ class library and several interpreted interface layers including Tcl/Tk, Java, and Python. The toolkit is created and supported by the Kitware team. VTK supports a various visualization algorithms including: scalar, vector, tensor, texture, and volumetric methods; and advanced modeling techniques such as: implicit modeling, polygon reduction, mesh smoothing, cutting, contouring, and Delaunay triangulation. VTK has an information visualization framework, has a suite of 3D interaction widgets, supports parallel processing, and integrates with various databases and GUI toolkits such as Qt and Tk. VTK is cross-platform and runs on Linux, Windows, Mac and Unix platforms. The core of VTK is implemented as a C++ toolkit, requiring users to build applications by combining various objects into an application. The system also supports automated wrapping of the C++ core into Python, Java and Tcl, so that VTK applications may also be written using these programming languages.
History
VTK was initially created in 1993 as companion software to the book The Visualization Toolkit: An Object-Oriented Approach to 3D Graphics. The book and software were written by three researchers (Will Schroeder, Ken Martin and Bill Lorensen) on their own time and with permission from General Electric (thus the ownership of the software resided with, and continues to reside with, the authors). After the core of VTK was written, users and developers around the world began to improve and apply the system to real-world problems.
With the founding of Kitware, the VTK community grew rapidly, and toolkit usage expanded into academic, research and commercial applications. A number of major companies and organizations, such as Sandia National Laboratories, Livermore National Laboratory, Los Alamos National Laboratory funded the development of VTK and even developed a number of VTK modules themselves. VTK forms the core of the 3DSlicer biomedical computing application, and numerous research papers at IEEE Visualization and other conferences based on VTK have appeared. VTK has been used on a large 1024-processor computer at the Los Alamos National Laboratory to process nearly a Petabyte of data.
Later VTK was expanded to support the ingestion, processing and display of informatics data. This work was supported by Sandia National Laboratories under the 'Titan' project.
Criticism
In 2013, a survey paper on visualization for radiotherapy noticed that while VTK is a powerful and widely known toolkit, it lacked a number of important features, such as multivolume rendering, had no support of GPGPU libraries such as CUDA, no support of out-of-core rendering of huge datasets and no native support for visualization of time-dependent volumetric data.
However, since 2013 there have been improvements such as VTK-m which can speed-up and parallelize certain computationally intensive tasks using accelerators such as GPGPU. VTK is also used in the visualization pipeline of radiological imaging software such as MEDInria or Starviewer which perform multi-volume (also called fusion) and time-dependent (also called phase) visualizations.
See also
:Category:Software that uses VTK
References
Further reading
External links
Kitware home page
Visualization toolkit (VTK) and official VTK Wiki
Parallel Visualization Application (ParaView) and official ParaView Wiki
PDF 9-page technical paper (with color images)
A summary of VTK technical features
vtk.js, a Javascript implementation of VTK
Some of the early history of VTK
Computer vision software
Free 3D graphics software
Free science software
Free software programmed in C++
Free software programmed in Java (programming language)
Free software programmed in Python
Free software programmed in Tcl
Software that uses Qt
Software that uses Tk (software)
Software using the BSD license
Free data visualization software
|
194420
|
https://en.wikipedia.org/wiki/Xerox%20820
|
Xerox 820
|
The Xerox 820 is an 8-bit desktop computer sold by Xerox in the early 1980s. The computer runs under the CP/M operating system and uses floppy disk drives for mass storage. The microprocessor board is a licensed variant of the Big Board computer.
820
Xerox introduced the 820 in June 1981 for $2,995 with two -inch single-density disk drives with 81K of capacity per diskette, or $3,795 with two 8-inch drives with 241K capacity. To beat the IBM PC to market Xerox created little of the computer's design; it is based on the Ferguson Big Board computer kit and other off-the-shelf components, including a Zilog Z80 processor clocked at 2.5 MHz, and 64 kiB of RAM.
Xerox chose CP/M as its operating system because of the large software library—The 820 is compatible with all Big Board software—and sold a customized version of WordStar for $495, although by 1982 the company offered the standard version for the same price.
820-II
Overview
The Xerox 820-II followed in 1982, featuring a Z80A processor clocked at 4.0 MHz. Pricing started at $3000.
Hardware: The processor board is located inside the CRT unit, and includes the Z80A, 64 kiB of RAM and a boot ROM which enables booting from any of the supported external drives in 8-bit mode.
Screen: The display is a 24-line, 80-character (7×10 dot matrix) white-on-black monochrome CRT, with software-selectable variations such as reverse video, blinking, low-intensity (equivalent to grey text), and 4×4-resolution graphics.
Communication ports These include two 25-pin RS-232 serial ports (including one intended for a Xerox 620 or 630 printer or compatible, and one intended for a modem), and two optional parallel ports which can be added via an internal pin header, usable with a Xerox or other cable.
Keyboard: A bulky 96-character ASCII keyboard with a 10-key numeric keypad and a cursor diamond which otherwise defaults to Ctrl-A to Ctrl-D. It also includes "Help" and "Line Feed" keys, and is attached to the back of the CRT unit by a thick cable.
Software: A typical 820-II comes with CP/M 2.2, diagnostic software, WordStar, and Microsoft's BASIC-80 programming language.
Expansion
The Xerox 820-II is different from the Xerox 820:
the Xerox 820 mainboard has built-in 8" floppy disk I/O devices but no built-in 5.25" floppy disk I/O devices nor hard disk I/O (nor any expansion bay capabilities), whereas
the Xerox 820-II mainboard has no built-in disk I/O devices nor a built-in processor expansion capability (these are required to be on expansion bay cards; there are two different expansion bay connectors, one which accommodates one of several disk I/O boards, and one which accommodates a processor board—the processor board was the taller of the two).
The Xerox 820-II's disk I/O capability is on one of two different cards:
a floppy disk I/O card, which can control external 8" or 5.25" floppies, or a mixture of these, as configured by special external cables, and
a SASI hard disk/floppy disk I/O card, which can control one external 8" hard drive and one to three external 8" floppy drives (these being either single- or double-sided, and either single- or double-density).
The Xerox 820-II has a processor expansion capability, which optionally supports a 16-bit Intel 8086 processor card with its own 128 kiB or 256 kiB of RAM (the 16-bit processor card uses the on-mainboard Z80A for all peripheral I/O operations, therefore the 8086 behaves more like a co-processor).
The Xerox 820-II's 16 bit processor card features a true 16-bit 8086 processor, not an 8/16 bit 8088 processor as on the contemporary IBM PC.
The 16 bit processor card is, however, limited to 128 kiB of DRAM (256 kiB, maximum, if incorporating a rather rare RAM "daughter" card).
Flipping the Xerox 820-II's console between 8 bit and 16 bit modes on an 820-II which is equipped with the optional 16-bit processor card is accomplished by a keyboard control command.
Xerox 820-II component parts were available from Xerox outlet stores at quite reasonable prices, and it was not uncommon to convert surplus (but new) 128 kiB 16-bit processor cards to 512 kiB by the substitution of sixteen 41256 DRAM chips for the card's usual sixteen 4164 DRAM chips (both are 16-pin DIPs—pin 1 is unused on a 4164 and becomes A8 on a 41256), plus the addition of two ICs (one 74F02 and one 74F08, or two user-modified PALs) for controlling the 41256's 9th address row and column (not found on 4164s), thereby achieving a four-times increase in RAM without the use of a "daughter" card (which can only achieve a two-times increase in RAM).
A simple modification to the Xerox 820-II's BIOS initialization code was developed to move the BIOS image up to the top of the 512 kiB RAM area, thereby giving the applications maximum contiguous RAM. Otherwise, the 512 kiB of the converted processor card is segmented into a lower 128 kiB segment, and an upper 384 kiB segment, but CP/M-86 was designed to handle such segmented RAM, so this BIOS modification is optional, although desirable.
Unlike much later processors from Intel, and others, which offers both segmented and "flat" addressing, the 8086 (and the 8088) offers only segmented addressing, with each segment limited to 64 kiB. By effective utilization of the four available segment registers, Code, Data, Stack and Extra, the 512 kiB address space possible with the modified Xerox 820-II 8086 processor card can be very effectively managed, although in 64 kiB chunks. If each data area is identified with its segment and its offset, possibly starting with zero offset, then there is little penalty associated with such segmented addressing, just as long as each individual data area does not exceed 64 kiB, and most such data areas were intentionally designed so as not to exceed 64 kiB.
Disk storage
Much CP/M software uses the Xerox 820's disk format, and other computers such as the Kaypro II are compatible with it.
The CRT unit contains the processor, and a large port on the back connected via heavy cable to a disk drive, allowing a wide variety of configurations. Disk drives can be daisy-chained via a port on the back.
Reference: 820-II Operation Manual
The Basic Operating System (BOS) monitor
The system can function to a limited extent without having to load a disk operating system: the system monitor in ROM allows, at boot-up, a variety of uses via one-letter commands followed by attributes.
A user normally uses the "(L)oad" command to load a bootstrap loader (i.e., for CP/M) from a floppy or the fixed disk. One can also access a "(T)ypewriter" mode for direct interface with the serial printer port and basic typing on screen. "(H)ost terminal" allows the 820-II to interface as a terminal via either of the serial ports, as specified, at up to 19.2 kbit/s.
For low-end system operations, a user can manually read or write to memory, execute code at a particular location in memory, read from or write to the system ports, or even read a sector from a disk. Further, (documented) calls to BOS subroutines allows a skilled user or program to restart the system, perform disk operations, take keyboard input, or write to the display.
Reference: 820-II Reference Guide
Model 16/8
The Model 16/8, introduced in May 1983, has dual CPUs, an 8-bit Z80 and 16-bit Intel 8086, which can be booted jointly or separately. The operating system is 8-bit CP/M-80 and 16-bit CP/M-86, and the computer was supplied with the WordStar word processor and dBase II database management system. It has double 8" floppy disk drives, a 12" monochrome monitor and a daisywheel printer. Later in 1984 double 5.25 floppy disk drives, a portrait-size blue monitor, and a laser printer were offered. The Model 16/8 is also called a Xerox 823.
Flipping the 8/16's console between 8 bit and 16 bit modes is accomplished by a simple keyboard control command.
Reception
The 820 was codenamed The Worm because Xerox saw Apple Computer as its main competitor; InfoWorld reported that Apple delayed and redesigned a computer under development to better compete with the 820. While less expensive than dedicated word processors such as the Xerox 860, the 820 was expensive and slow compared to personal computers; one month after its release, the $1,795 Osborne 1—faster, portable, and with bundled software worth more than $1,000—appeared, while Xerox charged $200 for the required CP/M software. The 820 did not use Xerox PARC's sophisticated technology that influenced the Apple Macintosh.
InfoWorld in 1982 stated that "The considerable virtues of the Xerox 820 lie mostly in its use of the Big Board design—its faults are, to a large extent, Xerox's own, and in no small measure due to its rush to get the system to market" before the IBM PC. The reviewer criticized the keyboard's contact bounce, slow disk access, and "pieced-together ... minimal" documentation, and warned customers against the Xerox-customized WordStar. He reported that three of the four computers' disk-drive units his company had purchased had problems, and "strongly recommend an 820 owner get a service contract". The reviewer concluded that while the 820 "could be a fine office computer, its faults are so egregious that they indicate a basic lack of attention to detail on the part of Xerox". While noting the 8" model's low price and Xerox's strong field service and "prestige nameplate", and expressing hope that the company "gets it act together" and fix the keyboard and other problems, he suggested that potential customers consider building a similar computer at a lower price around the Big Board.
Xerox was the second Fortune 500 company after Tandy Corporation, and first major American office-technology company, to sell a personal computer. It had experience with large customers, unlike Apple or Tandy. InfoWorlds reviewer stated that he and his colleagues were glad when Xerox announced the 820, because "at last a recognized business-equipment manufacturer had brought out a standard CP/M" computer at a low price; dealers reportedly were also pleased to sell a computer from a well-known company. The Rosen Electronics Letter also unfavorably reviewed the 820 in June 1981, however, describing it as a disappointing, "me too" product for a leading technology company like Xerox. In November it stated that the new IBM PC was much more attractive; "we think the bulk of the sales will go to IBM". They did choose the PC, introduced one month after the 820; Yankee Group said after the latter's discontinuation that it "sort of got blown away right then and there by the IBM announcement". Xerox hoped to sell 100,000 820s in two years, but reportedly failed to do so in four; Micro Cornucopia reported in October 1983 that a dealer had thousands of 820 motherboards for sale for $39.95. Xerox discontinued the 16/8 and 820-II in early 1985. Yankee Group predicted that the company would introduce its own PC clone.
References
External links
820 picture and specifications
820-II picture and specs
16/8 picture and specs
Article about the 820-II with a rigid drive option From mccworkshop.com.
820-II Spanish TV commercial (1983)
Microcomputers
Personal computers
Products introduced in 1981
820
Z80
8-bit computers
|
4992945
|
https://en.wikipedia.org/wiki/Shah%20%26%20Anchor%20Kutchhi%20Engineering%20College
|
Shah & Anchor Kutchhi Engineering College
|
Shah & Anchor Kutchhi Engineering College is an engineering college in Mumbai affiliated under University Of Mumbai.
The college offers technical education to students.
This college was established by the Mahavir Education Trust in 1985, making it one of the oldest technical institutes in the state.
The college has been graded 'A' By NAAC for 5 years from 2021. Computer Engineering and Information Technology branches are accredited By NBA.
Shah and Anchor Kutchhi Engineering college was place in band 251- 300 band in NIRF 2020
History
In 1983 the Mahavir Education Trust was established.
The Bachelor of Engineering course offered by the University of Mumbai. Institute establishing a strong brand image for itself in the engineering domain. The funds for the development of the Engineering College are being augmented by donation from many other philanthropic business and industrialists.
The Engineering College is run by the Mahavir Education Trust established for development of appropriate education in technical field.
Environment
Shah & Anchor Kutchhi Engineering College is located on Waman Tukaram Patil Marg, Chembur, Nearest railway station is Govandi. Deonar Bus Depot on Mumbai- Pune Highway is within walking distance.
All laboratories, class rooms, drawing hall, students room, sports hall, administrative office are situated in a seven-storeyed building of the college.
Courses
Bachelor of Engineering (B.E.)
Departments
The college has an intake capacity of 600 students in three branches for Bachelor of Engineering degree:
Electronics and Computer Science Engineering – 120 seats
Computer Engineering – 180 seats
Information Technology – 120 seats
Electronics and telecommunications – 60 seats (started from 2012)
Artificial Intelligence and Data Science - 60 seats ( Started from 2020)
Cyber Security - 60 seats ( Started from 2020)
In addition to these, 10% of intake of every branch diploma students are admitted each year during the second year of the bachelor's degree.
Infrastructure and Facilities
The college has furnished classrooms. Most classrooms have a capacity of around 75 seats, while with some larger classrooms with nearly double capacity.
The college has an auditorium that seats 120. There is also an Engineering Drawing hall.
The college has a library with reading hall, a collection of books related to the curriculum and a few books related to self-improvement and personality development. The college library subscribes to a number of National and International Journals devoted to technical subjects to help students keep themselves updated with latest developments. The college is also a member of IEL Online where IEEE journals can be accessed. Web browsing facilities are also available in the library.
The library has university prescribed text books and reference material. It subscribes to all major international journals and magazines. The library is open six days a week, and on Sundays when exams are approaching.
Canara Bank extension counter has been provided for exclusive use by the staff and students of the college and polytechnic.
The in-house canteen provides a variety of food items.
A gymkhana with facilities for Table Tennis, Carrom and Chess has been provided.
Master of Engineering (M.E.)
Master of Engineering section in Shah and Anchor was affiliated by Mumbai University in the year 2011.
Electronics Engineering – 9 seats
Computer Engineering - 9 seats
Information Technology - 9 seats
Student life
Lectures and Practicals are mainly conducted between 9.15am and 5.00pm, with an occasional early extra class. Most students engage in various technical, cultural and athletic extra-curricular activities. The expansive lobby is a hub of activity in the time the college is active, and the gymkhana often remains open after hours.
There is a canteen located behind the Diploma section as well as two food stalls by another side gate that serve a variety of refreshments. The grounds behind the college also sees a lot of activity during the lunch breaks and during sports season.
Most students have joined one of the three main organizations pervasive in the college. These organizations are involved in a series of workshops and seminars that the students themselves conduct. The organizations have been detailed below.
These three student organizations are the main source of extracurricular and technical activities hosted by the college.
Institute of Electrical and Electronic Engineers
IEEE-SAKEC is the student chapter of the Institute of Electrical and Electronics Engineers. It helps organize Nucleus, an annual intercollegiate technical symposium. It is the most active student body in the whole Bombay Section. Apart from organizing events in the college like international university fairs, technical and non-technical seminars and workshops, it organizes a yearly industrial visit to parts of the country. IEEE-SAKEC is a big milestone of this college.
Indian Society for Technical Education
ISTE-SAKEC is the student chapter of the Indian Society for Technical Education, established in 2005. It organizes workshops, seminars and field trips. It helps organize Nucleus, the annual intercollegiate technical symposium.
Computer Society of India
CSI-SAKEC is the student chapter of the Computer Society of India. It conducts workshops during holidays for SAKEC students. The students started a CSI website and CSI magazine, Cache in March 2010.
Institute of Electronics and Telecommunication Engineers
IETE-SAKEC is the student chapter of the Institute of Electronics and Telecommunication Engineers. The IETE SAKEC has been instrumental in bringing all the students of the college in the Electronics and telecommunication branch closer and making shah and anchor a closely knit family. It is a new organization and was made famous for its classy opening ceremony, wherein the inauguration of the organization's name (IETE-SAKEC) was done by the chairman with the help of a remote controlled curtain raiser. This is just the beginning of the many more events that would be conducted successfully by the newly christened student organisation.
Festivals
The college holds multiple events in its annual festival. They are broadly classified into six categories: Nucleus (the technical fest), R1 (national level robotics), Verve (the cultural fest), Marathon, Olympus (comprising all sports based events) and Portal.
Nucleus
Nucleus is the annual technical symposium of the college. It is jointly organised by the student bodies and the college student council. Companies like HP, Videocon, Bank of Baroda, Samsonite, Charagh Din, MTNL and Asian Paints are associated with it. It covers 50 colleges with more than 3000 students coming from all the parts of the city. Nucleus is SAKEC's annual technical festival promoting technical events and contests for all Mumbai University students. It aims to provide a platform for students to come out of their usual syllabus and experience practical knowledge.
Nucleus hosts the following events:
Technical: The technical events are widely ranged, from coding competitions, events involving practical and interdisciplinary knowledge and various contests that explore creativity and curiosity among students.
Non-technical: There are also a variety of non-technical events associated with the festival. The prominent ones include contests that encourage lateral thinking. There is also a Minute to Win it based contest as well as a gaming contest. Simulation events include handling a virtual IPL team and getting placed via interview.
Robotics: The robotics based events are one of the most prominent features of the technical fest. Together, the events incorporate challenges for the first three levels of robotics.
Challenges include robots playing football, Pacman, maneuvering through various themed courses, remote maze navigation, autonomous line following as well as a robot battle and many others.
R1
R1 is a national-level robotics event held annually in the college grounds. Sponsored by the memorial trust of the late student Monish Gala, it consists of racing events. The first edition of this event was held in 2009, and was conceived and organized by Monish. A dirt race consisting of both wired and wireless Internal combustion engine robotic cars is held at the college ground. Being a national level event, this event sees participation from engineering students all over India.
Verve
Verve is the annual inter-collegian cultural festival of the college. It hosts events of widely varied genres.
Harmonix: One of the main attractions of verve, Harmonix is a musical competition among student bands from across the city. Every year, prominent local bands are also invited to play in the event.
Nrityanjali: Nrityanjali is an inter-college dance competition.
Model United Nations: SakecMUN is one of the few Model United Nations being hosted among Mumbai's schools and colleges.
Intra Events: A variety of miscellaneous intra-college events take place, such as a fashion show and The Apprentice.
Marathon
The SAKEC Marathon began as an event held during the 2010 college festival, and has been repeated annually. Students from all over the city compete in running a mile through the roads of Chembur. This has become a key event of the SAKEC festival. The SAKEC Marathon began as an event marked to commemorate the 25th anniversary of the college, and was held during the 2010 college festival.
Olympus
Olympus is the annual sports festival. Intercollegiate events range from football and table tennis to chess and Carrom. More than 60 teams from engineering and medical colleges participate in Olympus. Inter-college competitions started in 2009 and have expanded since. Intra-Olympus too consists of a variety of sports and games ranging from outdoor games like Cricket, football and volleyball to indoor games like chess and Carrom.
Web portal
Nucleus also hosts a variety of web-based games and events that require on-line participation. These include Google Whack, CodeChef competitions, Web Hunt and Virtual Stock Exchange.
Campus recruitment
Recruiters include consulting, engineering and software development firms. Major recruiters include Tata Consultancy Services, Mastek, Wipro, Syntel, iGATE, Blue Star Infotech, Amdocs, Oracle Financial Services Software (Previously
iFlex), Indus Valley Partners, Mphasis, Larsen & Toubro Infotech, Capgemini, Tech Mahindra, Accenture, GE Energy, Vistaar, Webaroo (Now SMS GupShup),Godrej infotech.
See also
University of Mumbai
List of Mumbai Colleges
References
External links
Official website
Engineering colleges in Mumbai
Affiliates of the University of Mumbai
Educational institutions established in 1985
1985 establishments in Maharashtra
|
17962018
|
https://en.wikipedia.org/wiki/16th%20Airborne%20Command%20and%20Control%20Squadron
|
16th Airborne Command and Control Squadron
|
The 16th Airborne Command and Control Squadron is a United States Air Force flying unit assigned to Air Combat Command's 461st Air Control Wing, 461st Operations Group, stationed at Robins Air Force Base, Georgia. The squadron flies the Northrop Grumman E-8C JSTARS, providing airborne battle management, command and control, surveillance, and target acquisition.
Mission
The 16th Squadron operates the Northrop Grumman E-8 Joint STARS (Joint Surveillance Target Attack Radar System), an advanced ground surveillance and battle management system. J-STARS detects, locates, classifies, tracks and targets ground movements on the battlefield, communicating real-time information through secure data links with combat command posts.
History
World War II
The squadron was first activated as the 380th Fighter Squadron, part of IV Fighter Command in early 1943. It engaged in the air defense of the San Francisco area as well as acting as a Replacement Training Unit until the end of 1943. It trained as a North American P-51 Mustang operational squadron before deploying to the European Theater of Operations. In Europe it became part of IX Fighter Command in England. Operated both as a tactical fighter squadron, providing air support to Allied ground forces in France as well as an air defense squadron, attacking enemy aircraft in air-to-air combat over Europe.
The squadron was converted to a tactical reconnaissance squadron in August 1944, when it was redesignated the 160th Tactical Reconnaissance Squadron. It engaged in hazardous reconnaissance flights over enemy-controlled territory unarmed, gathering intelligence for Allied commanders until the end of combat in Europe, May 1945. The unit advanced eastward across France using advanced landing grounds, then into the Low Countries and Occupied Germany.
The squadron remained in Germany as part of the occupation forces, returning to Langley Field, Virginia in June 1947. The unit remained assigned to Tactical Air Command as a reconnaissance squadron. The squadron was inactivated in 1949.
Cold War
In 1950 the squadron was activated once again at Langley, now designated the 16th Tactical Reconnaissance Squadron. It moved to Shaw Air Force Base, South Carolina in 1958 where it re-equipped with McDonnell RF-101C Voodoo reconnaissance aircraft. The squadron deployed to south Florida in 1962 during the Cuban Missile Crisis, flying hazardous overflights over Cuba gathering intelligence photos. The unit upgraded to the McDonnell Douglas RF-4C Phantom II in 1965. It also operated a flight of Martin EB-57E Canberra electronic warfare aircraft. It added Douglas EB-66 Destroyer jamming aircraft beginning in 1971 as part of the phaseout of the Destroyer at Shaw. It was the last USAF active duty B-57 squadron, retiring the aircraft in 1976 when F-4G Phantom IIs took over its mission.
The 16th remained the single RF-4C squadron at Shaw after the 1982 realignment of its parent 363d from a tactical reconnaissance to tactical fighter wing. It continued reconnaissance training in the United States until 1989 when the RF-4Cs were transferred to 67th Tactical Reconnaissance Wing at Bergstrom Air Force Base, Texas, and the squadron was inactivated.
Joint Surveillance Target Attack Radar System
The squadron was reactivated as the 16th Airborne Command and Control Squadron in 1996 at Robins Air Force Base, Georgia as an E-8 J-STARS squadron. In 2002, the J-Stars mission was transferred to the Georgia Air National Guard and the 116th Air Control Wing and the squadron became a Guard unit. Ten years later the mission returned to the regular Air Force, with Georgia Air National Guard associate units joining the mission.
Lineage
Constituted as the 380th Fighter Squadron (Single Engine) on 11 February 1943
Activated on March 1943
Redesignated 160th Tactical Reconnaissance Squadron on 25 August 1944
Redesignated 160th Reconnaissance Squadron, Photographic on 29 Ju1y 1946
Redesignated 160th Tactical Reconnaissance Squadron, Photographic on 14 June 1948
Inactivated on 26 April 1949
Redesignated 160th Tactical Reconnaissance Squadron, Night Photographic on 8 August 1950
Activated on 1 September 1950
Redesignated 16th Tactical Reconnaissance Squadron, Night Photographic on 10 October 1950
Redesignated 16th Tactical Reconnaissance Squadron, Night Photographic-Jet on 8 November 1955
Redesignated 16th Tactical Reconnaissance Squadron, Photographic-Jet on 1 March 1965
Redesignated 16th Tactical Reconnaissance Squadron on 8 October 1966
Redesignated 16th Tactical Reconnaissance Training Squadron on 1 October 1979
Redesignated 16th Tactical Reconnaissance Squadron on 1 July 1982
Inactivated on 15 December 1989
Redesignated 16th Airborne Command and Control Squadron on 15 January 1996
Activated on 1 October 1996
Allotted to the Air National Guard on 1 October 2002
Withdrawn from the Air National Guard on 1 October 2012 (remained active)
Assignments
363d Fighter Group (later 363d Tactical Reconnaissance Group), 1 March 1943
Air echelon attached to 10th Photographic Group, 24 December 1944 – 6 February 1945
10th Reconnaissance Group, 15 November 1945
Tactical Air Command, 25 June 1947
363d Reconnaissance Group (later 363d Tactical Reconnaissance Group), 24 July 1947 – 26 April 1949
363d Tactical Reconnaissance Group, 1 September 1950
363d Tactical Reconnaissance Wing (later 363d Tactical Fighter) Wing), 8 February 1958 – 13 December 1989
93d Operations Group, 1 October 1996
116th Operations Group, 1 October 2002
461st Operations Group, 1 October 2012 – present
Stations
Hamilton Field, California, March 1943
Santa Rosa Army Air Field, California, 23 August 1943
Oakland Municipal Airport, California, 8 October-2 December 1943
RAF Keevil (AAF-471), England, 23 December 1943
RAF Rivenhall (AAF-168), England, c. 3 February 1944
RAF Staplehurst (AAF-413), England, 14 April 1944
Maupertu Airfield (A-15), France, c. 5 July 1944
Azeville Airfield (A-7), France, c. 22 August 1944
Montreuil Airfield (A-38), France, 9 September 1944
Sandweiler Airfield (A-97), Luxembourg, 11 October 1944
Le Culot Airfield (A-89), Belgium, 29 October 1944
Operated from Conflans Airfield (A-94), France, 24 December 1944 – 6 February 1945
Venlo Airfield (Y-55), Netherlands, 11 March 1945
Gutersloh Airfield (R-85), Germany, 16 April 1945
Brunswick/Waggum Airfield (R-37), Germany, 26 April 1945
AAF Station Wiesbaden, Germany, 20 May 1945
AAF Station Eschwege, Germany, 12 July 1945
AAF Station Darmstadt/Griesheim, Germany, 22 September 1945
AAF Station Fürth, Germany, 24 November 1945
Fürstenfeldbruck Air Base, Germany, 2 March 1947
Bad Kissingen Air Base, Germany, 14 June 1947
Langley Field (later Langley Air Force Base), Virginia, 25 June 1947 – 26 April 1949
Langley Ai Force Base, Virginia, 1 September 1950
Shaw Air Force Base, South Carolina, 8 February 1958 – 31 December 1989
Operated from MacDill Air Force Base, Florida, 22 October-30 November 1962
Robins Air Force Base, Georgia, 1 October 1996 – present
Aircraft
Bell P-39 Airacobra, 1943
North American P-51 Mustang, 1944–1945, 1946–1947
North American F-6 Mustang, 1944–1945, 1946–1947
Lockheed FP-80 Shooting Star (later Lockheed RF-80 Shooting Star), 1947–1949
Douglas RB-26 Invader, 1950–1955
Martin RB-57 Canberra, 1954–1956
Douglas RB-66 Destroyer, 1956–1965
McDonnell RF-101C Voodoo, 1958–1965
McDonnell RF-4C Phantom II, 1965–1989
Martin EB-57E Canberra, 1971–1976
Northrop Grumman E-8C Joint STARS (1996–present)
See also
References
Notes
Explanatory notes
Citations
Bibliography
World Airpower Journal. (1992). US Air Force Air Power Directory. Aerospace Publishing: London, UK.
Military units and formations in Georgia (U.S. state)
016
Squadrons of the United States Air National Guard
Command and control squadrons of the United States Air Force
|
47017294
|
https://en.wikipedia.org/wiki/System%20Integrity%20Protection
|
System Integrity Protection
|
System Integrity Protection (SIP, sometimes referred to as rootless) is a security feature of Apple's macOS operating system introduced in OS X El Capitan (2015) (OS X 10.11). It comprises a number of mechanisms that are enforced by the kernel. A centerpiece is the protection of system-owned files and directories against modifications by processes without a specific "entitlement", even when executed by the root user or a user with root privileges (sudo).
Apple says that the root user can be a significant risk factor to the system's security, especially on systems with a single user account on which that user is also the administrator. SIP is enabled by default, but can be disabled.
Justification
Apple says that System Integrity Protection is a necessary step to ensure a high level of security. In one of the WWDC developer sessions, Apple engineer Pierre-Olivier Martel described unrestricted root access as one of the remaining weaknesses of the system, saying that "[any] piece of malware is one password or vulnerability away from taking full control of the device". He stated that most installations of macOS have only one user account that necessarily carries administrative credentials with it, which means that most users can grant root access to any program that asks for it. Whenever a user on such a system is prompted and enters their account password – which Martel says is often weak or non-existent – the security of the entire system is potentially compromised. Restricting the power of root is not unprecedented on macOS. For instance, versions of macOS prior to Mac OS X Leopard enforce of securelevel, a security feature that originates in BSD and its derivatives upon which macOS is partially based.
Functions
System Integrity Protection comprises the following mechanisms:
Protection of contents and file-system permissions of system files and directories;
Protection of processes against code injection, runtime attachment (like debugging) and DTrace;
Protection against unsigned kernel extensions ("kexts").
System Integrity Protection protects system files and directories that are flagged for protection. This happens either by adding an extended file attribute to a file or directory, by adding the file or directory to or both. Among the protected directories are: , , , (but not ). The symbolic links from , and to , and are also protected, although the target directories are not themselves protected. Most preinstalled Apple applications in are protected as well. The kernel, XNU, stops all processes without specific entitlements from modifying the permissions and contents of flagged files and directories and also prevents code injection, runtime attachment and DTrace with respect to protected executables.
Since OS X Yosemite, kernel extensions, such as drivers, have to be code-signed with a particular Apple entitlement. Developers have to request a developer ID with such an entitlement from Apple. The kernel refuses to boot if unsigned extensions are present, showing the user a prohibition sign instead. This mechanism, called "kext signing", was integrated into System Integrity Protection.
System Integrity Protection will also sanitize certain environmental variables when calling system programs when SIP is in effect. For example, SIP will sanitize and before calling a system program like to avoid code injections into the Bash process.
Configuration
The directories protected by SIP by default include:
/System
/sbin
/bin
/usr
/Applications
/usr is protected with the exception of /usr/local subdirectory. /Applications is protected for apps that are pre-installed with Mac OS, such as Calendar, Photos, Safari, Terminal, Console, App Store, and Notes.
System Integrity Protection can only be disabled (either wholly or partly) from outside of the system partition. To that end, Apple provides the command-line utility which can be executed from a Terminal window within the recovery system or a bootable macOS installation disk, which adds a boot argument to the device's NVRAM. This applies the setting to all of the installations of El Capitan or macOS Sierra on the device. Upon installation of macOS, the installer moves any unknown components within flagged system directories to . By preventing write access to system directories, the system file and directory permissions are maintained automatically during Apple software updates. As a result, permissions repair is not available in Disk Utility and the corresponding operation.
Reception
Reception of System Integrity Protection has been mixed. Macworld expressed the concern that Apple could take full control away from users and developers in future releases and move the security policy of macOS slowly toward that of Apple's mobile operating system iOS, whereupon the installation of many utilities and modifications requires jailbreaking. Some applications and drivers will not work to their full extent or cannot be operated at all unless the feature is disabled, either temporarily or permanently. Ars Technica suggested that this could affect smaller developers disproportionately, as larger ones may be able to work with Apple directly. However, they also remarked that by far most users, including power users, will not have a reason to turn the feature off, saying that there are "almost no downsides" to it.
See also
AppArmor
Computer security
Security-Enhanced Linux (SELinux)
Social engineering (security)
Trusted Computing
Trusted Solaris
User Account Control
User Interface Privilege Isolation
Windows File Protection
References
External links
MacOS security technology
|
38362703
|
https://en.wikipedia.org/wiki/Informatics.nic.in
|
Informatics.nic.in
|
Informatics, an e-Governance quarterly publication of National Informatics Centre (NIC), is a popular and useful source of news and information on myriad aspects of e-governance innovations and initiatives in ICT across India. It is published both in print and online by National Informatics Centre, Department of Electronic and Information Technology, Ministry of Communication & Information Technology, Government of India.
The current chief editor is Neeta Verma, deputy director general of NIC. The online format of the publication is made available at Informatics Website.
References
External links
Official website
1976 establishments in India
Magazines established in 1976
Ministry of Communications and Information Technology (India)
Quarterly magazines published in India
Science and technology magazines published in India
Hindi-language magazines
English-language magazines published in India
Information technology in India
E-government in India
Magazines published in Delhi
|
40769446
|
https://en.wikipedia.org/wiki/UMBC%20College%20of%20Engineering%20and%20Information%20Technology
|
UMBC College of Engineering and Information Technology
|
The College of Engineering and Information Technology is one of three colleges at the University of Maryland, Baltimore County. The college offers bachelor's, master's, and doctoral degrees in various engineering, computer science, and information systems programs for full and part-time students. The programs featured in the College of Engineering and Information Technology are ranked for top enrollments and degrees in several areas.
History
The College of Engineering and Information Technology was first established as an extension of the A. James Clark School of Engineering of the University of Maryland, College Park up until 1988 when the organization of the University System of Maryland was formed, giving autonomy to the University of Maryland, Baltimore County.
Departments
Chemical, Biochemical & Environmental Engineering
Computer Science and Electrical Engineering
Information Systems
Mechanical Engineering
Centers
Center for Accelerated Real Time Analytics
Center for Advanced Studies in Photonics Research
Center for Advanced Sensor Technology
Center for Cybersecurity
Center for Urban Environmental Research & Education
Center for Information Security and Assurance
Center for Women In Technology
References
External links
Official website
Departmental Directory
College of Engineering and Information Technology
Engineering universities and colleges in Maryland
Maryland, Baltimore County
Maryland, Baltimore County
College of Engineering and Information Technology
Engineering and Information Technology
|
28085917
|
https://en.wikipedia.org/wiki/Submission%20software
|
Submission software
|
Submission software is a category of computer software that allows its users to publish their products or websites over the Internet. This software is typically used by marketing professionals who work in online marketing. It represents an electronic solution for online marketing as opposed to offline (newspapers, street banners) or media (radio, television) marketing.
Usually these packages allow three types of submissions: automatic, semi-automatic and manual.
Types of submission software
Software submission - allows to submit software products either through the use of PAD files or by filling the websites submission forms
Article submission - submits articles to article directories or online magazines
Website submission - submits website addresses to all kind of directories
Press release submission - applications that allow users to submit press releases to PR websites
RSS submission - submits RSS feeds to RSS publishing sites
References
See also
Portable Application Description
Search engine submission
Publishing software
|
30156699
|
https://en.wikipedia.org/wiki/JBoss%20Enterprise%20SOA%20Platform
|
JBoss Enterprise SOA Platform
|
The JBoss Enterprise SOA Platform (or JBoss SOA Platform) is free software/open-source Java EE-based service-oriented architecture (SOA) software. The JBoss Enterprise SOA Platform is part of the JBoss Enterprise Middleware portfolio of software. The JBoss Enterprise SOA Platform enables enterprises to integrate services, handle business events, and automate business processes, linking IT resources, data, services and applications. Because it is Java-based, the JBoss application server operates cross-platform: usable on any operating system that supports Java. The JBoss SOA Platform was developed by JBoss, now a division of Red Hat.
Product features and components
Business rules engine
JBoss jBPM
JBoss Enterprise Service Bus (JBossESB)
Event management and complex event processing (CEP)
Event-driven architecture (EDA)
Data integration
Service-oriented architecture (SOA) services
HornetQ
JBoss Enterprise Application Platform (JBoss EAP)
Java Enterprise Edition (JEE) services
Computer clustering
Java Connector Architecture (JCA)
Enterprise Service Bus (ESB)
The JBoss Enterprise Service Bus (JBossESB, or JBoss ESB) software is part of the JBoss Enterprise SOA Platform. The software is Enterprise Application Integration (EAI) or business integration software. In general, enterprise service bus (ESB) software is used to map the Service-Oriented Infrastructure (SOI) and Service-Oriented Architecture (SOA) concepts onto a concrete implementation. The software is middleware used to connect systems together, especially non-interoperable systems. The software contains the following:
Business process monitoring
Integrated Development Environment (IDE)
Human workflow user interface
Business Process Management (BPM)
Connectors
Transaction manager
Security
Application containers
Messaging services
Metadata repository
Naming and directory service
Distributed Computing Architecture (DCA)
Enterprise Data Services Platform (EDSP)
The JBoss Enterprise Data Services Platform (JBoss EDSP) is data virtualization software, a superset of the JBoss Enterprise SOA Platform. The JBoss EDSP uses the enterprise service bus (ESB) software JBoss Enterprise Service Bus (JBossESB). The JBoss EDSP includes:
tools for creating data views that are accessible through standard protocols
a repository for storing metadata
a runtime environment for data integrity and security
Licensing and pricing
JBoss itself is open source, but Red Hat charges to provide a support subscription for JBoss Enterprise Middleware.
See also
List of JBoss software
Comparison of business integration software
References
Bibliography
External links
JBoss application server website
Securing JBoss
JBoss Wiki
JBoss Community Projects
JBoss Introduction by Javid Jamae
Java enterprise platform
Red Hat software
Cross-platform software
Service-oriented architecture-related products
Enterprise application integration
|
39650063
|
https://en.wikipedia.org/wiki/Mad%20Max%20%282015%20video%20game%29
|
Mad Max (2015 video game)
|
Mad Max is an action-adventure video game based on the Mad Max franchise. Developed by Avalanche Studios and published by Warner Bros. Interactive Entertainment, it was released for Microsoft Windows, PlayStation 4, and Xbox One in 2015. Feral Interactive published the game's macOS and Linux versions. In the game, players control Max Rockatansky as he progresses through the wasteland building a vehicle, the "Magnum Opus", to do battle with a gang of raiders, led by Scabrous Scrotus, and to reach the storied "Plains of Silence", where he hopes to find peace. Mad Max emphasizes vehicular combat, in which players can use weapon and armor upgrades on their car to fight enemies. It is set in an open post-apocalyptic wasteland consisting of deserts, canyons, and caves.
Two other Mad Max games, developed by Cory Barlog and Interplay Entertainment respectively, were in production before the announcement of this game, but neither of them were successfully released. Although Mad Max is not based on the film series, it was inspired by its universe, and franchise creator George Miller was consulted during the game's pre-production. Avalanche Studios found developing a vehicular-combat video game a challenge because of their inexperience with creating that type of game. Announced at E3 2013, the game was re-tooled during development and the PlayStation 3 and Xbox 360 versions were canceled.
Originally planned for release in 2014, it was released in September the following year, several months after the theatrical release of Mad Max: Fury Road, the fourth film in the series. Mad Max received overall mixed reviews from critics. Although the game's environment, direction, vehicular combat, and graphics were praised, its quest design and story were criticized. The game became the eighth best-selling retail game in the United States in September 2015.
Gameplay
Mad Max is an action-adventure game set in an open world post-apocalyptic environment, emphasizing vehicular combat, in which the player is the eponymous Mad Max. According to its publisher, up to 60 percent of the game focuses on driving. Some weapons and tools, including flamethrowers and turbo boosts, are mounted directly onto the Magnum Opus, while others, such as a grappling hook and sniper rifle, are used in conjunction with the vehicle by Chumbucket, Max's assistant, or Max himself. Max's Magnum Opus, with its V8 engine and powerful ramming ability, can destroy enemies' vehicles and weaponry. When simultaneously driving and aiming, the game changes to slow motion to allow the player to toggle between targets. Although Mad Max primarily uses a third-person perspective, the player can switch to first-person view when fighting enemies while driving the Magnum Opus. Chumbucket repairs the car when instructed to do so or when the player exits.
To encourage exploration, the Magnum Opus can be upgraded with materials scavenged from the desert, by hijacking enemies' cars or collecting their car parts. An enemy can jump on top of the Magnum Opus to make it explode, but the player can avoid that by surrounding the car with hazards such as spikes. The player can access the garage screen throughout the game, allowing them to customize the Magnum Opus. Max's garage can change and modify the car's engine, chassis, wheels, body work, paint job, and its "shell". Upgrading one aspect of the car will negatively affect other aspects; upgrading the engine will allow Max to drive faster, but handling will be more difficult. The sound produced by the engine changes when the player changes, adds, or remove parts of the Magnum Opus. Max, his armor, and weapons are customisable; the player can unlock new skills and upgrades for him as he progresses through the game and earns experience points. Max is also customisable, with his clothing, appearance, fighting skills, and weapons being modifiable. Griffa, a wasteland wanderer, also offers Max tokens which can be used to upgrade his abilities.
Although the game has many choices (such as playing stealthily or aggressively), it emphasizes action over stealth. Mad Max features a variety of weapons, including Max's iconic shotgun, but ammunition is scarce and the game emphasizes melee combat over firearms. One weapon is the explosive Thunderstick, which can be lanced into an enemy's chest. The game has a free-flow combat system combining professional wrestling attacks and boxing techniques, similar to Warner Bros.' previous Batman: Arkham video-game series (in which indicators on enemies' heads remind the player when to strike, counter or make finishing moves). Attacks by Max during his "frenzied" state are more powerful than usual.
Mad Maxs landscape consists of canyons, caves, deserts, and abandoned wastelands. The game's world is divided into several regions, with each having its own backstory and landscape. Unique landmarks and ruins can be discovered in each region. Side activities such as races, time trials, invading enemy fortresses, and eliminating enemy convoys can be found in each region. A region's threat level is lowered by completing these activities, facilitating its navigation. Each region has a boss, who can be found and defeated in their base. Some of the game's strongholds are friendly, and eliminating hostile strongholds gives Max additional quests and rewards. These strongholds can be upgraded, offering Max different benefits such as helping Max to collect scraps when the game is turned off, or restoring Max's health and shotgun ammo upon visits. Max can ascend in a hot-air balloon (permanently attached to the ground) to look for new objectives and locations. After seeing the objectives through binoculars, they are highlighted on the map. Max can be guided by Chumbucket in strategically completing his objectives. Max is accompanied by a dog companion who can help players detect land mines. Max has limited climbing abilities, and objects that he can climb are highlighted in yellow.
Most resources in the game are scarce except for gasoline, which is needed for driving. The player can collect one jerrycan at a time, storing it in the back of the Magnum Opus, and can find collectibles (history relics) throughout the game. The relics are primarily photos and notes of the wasteland before the apocalypse. Food and water are vital to Max's survival; the player can collect them in the wasteland and use them to replenish their health. Max can also eat small animals, such as rodents, and maggots from decomposing corpses, to replenish his health, and areas where he can find food and supplies have crows flying around them. As initially described, the player would be able to venture into the Big Nothing, an uncharted, volatile area of the wasteland with dangerous sandstorms and no food or water in which rare parts for the Magnum Opus could be found (according to Avalanche, the "Big Nothing" made the game map infinite) but ultimately this was not a feature of the final gameplay. A dynamic day-night cycle, a weather system and a variety of environmental hazards are included in the game, whose terrain is affected by weather and natural disasters.
Plot
In search of fuel, highway patrol officer-turned-survivalist Max Rockatansky (Bren Foster) journeys to the Plains of Silence. His runs into the War Boys led by Scabrous Scrotus (Travis Willingham), son of Immortan Joe (Fred Tatasciore) and ruler of Gastown. The War Boys run Max off the road and steal his car and supplies, leaving him to die in the desert. Max chases them and challenges Scrotus to a duel on the Land Mover. Scrotus sics his war hound on Max, but after Max fends off the dog, Scrotus throws it off the Land Mover in disgust. Max then stabs Scrotus in the head with his own chainsaw, but Scrotus kicks Max off the Land Rover.
Befriending the abandoned dog, Max obtains a weapon and clothes from a dead Wastelander. In the desert, Max finds a hunchbacked mechanic named Chumbucket (Jason Spisak) who calls him the Saint. Chumbucket leads Max to Scrotus and the War Boys and tells him that he is building a car, the Magnum Opus, but it lacks critical parts; Max agrees to search for them. Max must first liberate Wasteland leaders' territories from the War Boys: Jeet (Josh Keaton), whose stronghold is in an old lighthouse, and Gut Gash (Liam O'Brien), whose followers believe that they will be protected from a flood in their ship stronghold. His stronghold is the remains of an oil tanker. He must penetrate a massive gate protected by War Boys, using the Magnum Opus outfitted with an exploding harpoon. Max and Chumbucket must then save Pink Eye (Adrienne Barbeau), a woman whose mechanical skill rivals Chumbucket's, from an invasion of her silo base led by Stank Gum—one of Scrotus' Top Dogs.
Searching for a V8 engine for the Magnum Opus, Max learns about a race in Gastown with a Big Chief V8 as a prize. After winning the race against Stank Gum (Yuri Lowenthal) and defeating the fighter Tenderloin in a Thunderdome duel, Max receives the engine and the concubine Hope (Courtenay Taylor). His victory is short-lived; Scrotus recognizes Max and attacks him. After he is shot with a crossbow and thrown down a mine shaft, Max is saved by Hope, who takes him to the Organic Mechanic and Scab (Orion Acaba)—also known as the Bloodbag. While Max is undergoing surgery, he has a hallucination that his wedding to Hope is officiated by Chumbucket and a man with a dog's head. When he wakes up, he and Hope steal the Big Chief; they drive to the temple of Deep Friah (Robin Atkin Downes), a friendly fire cultist.
At the temple, Hope asks Max to find her daughter, Glory (Madison Carlon), who had fled to Buzzard territory. He travels to the Underdune and rescues Glory from the Buzzards. Returning, he discovers that Chumbucket took the Magnum Opus to his old home. Max follows him in one of Deep Friah's cars, but learns that Scrotus and Stank Gum tortured Chumbucket, who revealed Hope and Glory's location and their ties to Max. Max kills Stank Gum, rushes back to the temple and finds Hope hanged to death and Glory tortured on the floor. Glory dies, and Max swears vengeance against Scrotus.
He returns to Gastown and learns Scrotus' location from Scab. Max and Chumbucket find Scrotus driving around the Purgatory Flatlands, and use the Magnum Opus to crash the Land Mover, which is pushed to the edge of a cliff. Max wants to push the Mover off the cliff with the Magnum Opus but is opposed by Chumbucket, who considers himself the car's protector. Ignoring Chumbucket, he rams the Mover at full speed; Chumbucket dies, and the Land Mover and Magnum Opus are destroyed. Scrotus escapes with the Interceptor, Max's car at the start of the game, and challenges him. Max wins the battle, pulling the chainsaw blade out of Scrotus' head and killing him. Max enters the Interceptor and places a picture of his family on the dashboard as he heads off.
Development
A video game set in the Mad Max universe was mentioned by franchise creator George Miller in a 2008 interview. Miller joined God of War II director Cory Barlog to develop the game after Barlog left Sony Computer Entertainment. The project was originally intended as a tie-in with a Mad Max animated film which would be released simultaneously. The film's production was suspended to allow adequate production time for the game. After Barlog announced in 2008 that a publisher for the game was being sought, no further information about the project was forthcoming. In 2010, Barlog was a consultant for Avalanche Studios, leaving in 2012 for Crystal Dynamics. A Fury Road tie-in video game was in development by Interplay Entertainment, but was scrapped when Electronic Arts acquired the franchise's video-game rights for $20 million.
On 14 February 2013, a blurry screenshot of the game was released by Avalanche Studios founder and CEO Christofer Sundberg. The game was announced at Electronic Entertainment Expo 2013 on 10 June at Sony's press conference, with a scheduled 2014 release for Microsoft Windows, PlayStation 3, PlayStation 4, Xbox 360, and Xbox One. Although Sundberg said during the expo that Miller and Barlog's project was not the Mad Max game announced by Avalanche, he later said that Barlog had worked on a Mad Max game at Avalanche. Despite the unclear relationship between the projects, according to the game's design director, Miller had collaborated with Avalanche during the game's pre-production in mid-2011. Despite having Miller to offer input, Warner Bros. inclined to give much creative freedom to Avalanche. Full production of the game began before May 2012.
In April 2014, Avalanche announced that Mad Max would be delayed until the following year, making it one of the titles released during Avalanche's "biggest year since [its] inception". The game was retooled during development. Despite its release that year, the game is not directly connected to 2015's Mad Max: Fury Road and was not intended to be a tie-in; its setting and story are original. This decision was made because the game's publisher, Warner Bros. Interactive Entertainment, believed that a standalone game was more beneficial to players than a "play-the-movie game" after the success of its Batman: Arkham series. Locations which have appeared in the films, such as Gas Town and Thunderdome, are featured in the game. Unlike previous Avalanche games, such as Just Cause 2, the game's tone is more mature and its narrative is emphasized.
Similar to the films, Max seldom speaks or expresses emotion; his thoughts are reflected by his actions. The team aimed at developing a complex character and personality for him. According to the game's director, Max is traumatized by past experiences (such as losing his family); this makes him "insane", "unstable", and "mad". These qualities are reflected in the game's "rage" mode, in which Max inflicts additional damage on enemies. Chumbucket, Max's mechanic and companion, is obsessed with the Magnum Opus; according to the game's lead writer, he "has a pseudo-religious/sexual relationship with engines". Scabrous Scrotus, the game's main antagonist, is a warlord designed as a "bloodthirsty monster that only can find solace from his own pain through the suffering of others". Enemies' faces are painted and scarred; according to game director Frank Rooke, their appearance "is kind of the approach of how this civilization merged into this kind of state".
Lead designer Emil Krafting said that gameplay was the top priority during development. Like the Just Cause series, Mad Maxs developer aimed to give players autonomy by providing tools to create their own events. The studios intended to build a dynamic world, creating "a seamless series of events". The game was inspired by the atmosphere of the Mad Max universe, rather than a particular film in the series. According to Avalanche, they did not plan to be influenced by other post-apocalyptic video games such as Fallout, Rage, and Borderlands since most of those games were inspired by the original Mad Max. The company said that the game's vehicular combat posed a challenge because of their inexperience with that type of game. The car customization system was designed to increase the game's fun factor and give players more freedom.
The game's world was inspired by the Just Cause series, which features large sandboxes for players to explore. Avalanche Studios CEO Christofer Sundberg hoped that players would compare Mad Maxs desert setting to the western setting of Red Dead Redemption. The game world is scaled according to gameplay density and frequency; the development team emphasized creating a world with choices and distractions, rather than focusing on size. Designed as dead, threatening, and hostile, it is also exciting and engaging (encouraging exploration). One challenge faced by the developers was building a wasteland with a variety of environments, since Mad Max is Avalanche's first post-apocalyptic game. They spent most of their time designing ground and terrain variations to minimize repetition in the landscape. Since the game is set in a desert, the team used vibrant colors for the sky. Avalanche Studios sent a team to a Costa Rican jungle to inspect local landscapes and environments in preparation for creating the world of Mad Max, particularly its sky. Like the films, the game does not identify the apocalypse; its developers wanted to give "a sense of mystery" to the wasteland so players could imagine how the wasteland evolved. Garages allowing players to upgrade and repair their cars were originally intended to be featured in the game. The idea was later scrapped, since the studio thought the element "interfered with gameplay".
Mad Max is powered by Apex Engine (formerly known as Avalanche Engine), an in-house proprietary engine developed by Avalanche and also used in Just Cause 2. According to lead graphics designer Alvar Jansson, new graphical features were introduced to the engine during the development of Mad Max and it was designed and optimized for open-world games. The team also worked on improving the world's draw distance and ensuring that gameplay across the three major platforms have no significant difference.
Gaming journalists invited to preview a private gameplay demonstration at E3 2013 noted that Max had an American accent, rather than the Australian accent of the film series, and fans protested his new American voice; Avalanche Studios later confirmed that he would have an Australian accent. Donal Gibson, the brother of the original Mad Max star Mel Gibson, expressed interest in taking the lead role in the video game adaptation. However, Australian actor Bren Foster, who previously starred in The Last Ship and Days of Our Lives, was chosen for the role. The game's setting is described as "wasteland creole", with elements of a number of civilizations, so its characters have a variety of accents.
Release
Mad Max was released on 1 September 2015 in North America and the United Kingdom, 2 September in Australia, 3 September in New Zealand and 4 September in Europe for Microsoft Windows, PlayStation 4, and Xbox One. It was announced on 3 May 2015 that the PlayStation 3 and Xbox 360 versions had been cancelled due to hardware restrictions, but a Linux port was announced. The game was released for Linux and macOS on 20 October 2016.
Players who pre-ordered the game could receive the Ripper, an additional Magnum Opus design. The Ripper, a steelbook, collector's box, mini-license plate and Blu-ray copy of Mad Max: Fury Road were included in the Post-Apocalypse Edition. PlayStation 4-version purchasers could access a Road Warrior Survival Kit, with twelve hood ornaments for the Magnum Opus, exclusively until 30 November 2015. To promote Mad Max, Warner Bros. Interactive Entertainment sponsored launch events. In Australia, the company invited artists to create artwork on their vehicles with dust. They joined Uber for a Seattle promotion in which Uber users could access a free ride "straight from the post-apocalypse". The offer was free, since "dollars are worthless in the wasteland".
Reception
Critical reception
Mad Max received "mixed or average" reviews from critics, according to review aggregator Metacritic.
Its story received a mixed response. Brandin Tyrrel of IGN found the story surprising and genuine, despite most of the action occurring later in the game. Tyrrel wrote that the characters have different personalities and distinct qualities, and considered them the "true star" of the game. According to Chris Carter of Destructoid, the game's story engages the player. Leon Hurley of GamesRadar found the overall story weak and "barely exist[ing] for the majority of the game", but thought the game's climax was exciting. Matt Bertz of Game Informer also criticized the story, calling it thin and light, and called the voice actors' performances uneven.
Mad Maxs world design received generally positive reviews. According to Brandin Tyrrel, it captured the films' savage tone and the game's sandbox was a "gorgeous" setting for players to explore. GamesRadar's Leon Hurley praised the game's scale, which he compared to The Witcher 3: Wild Hunt. Martin Robinson of Eurogamer compared its scale favorably to Avalanche's previous Just Cause game series, and opined that Avalanche had successfully combined the Mad Max universe with an open-world game design. Matt Bertz praised the game's inhospitable atmosphere, commending Avalanche for adding a variety of styles and a vibrant sky to an otherwise-boring sandbox. Daniel Bloodworth of GameTrailers echoed Bertz, calling each region unique and distinct. Bloodworth also praised Avalanche for its efforts in crafting the world. Peter Brown of GameSpot praised Mad Maxs natural disasters, writing that it set a new standard for in-game weather effects. Philip Kollar of Polygon criticized the game's layout, writing that every location in the game feels identical and its bland environments discourage exploration.
Tyrrel considered the vehicular combat one of the game's best elements, adding a layer of creativity. Brown praised the car action, calling it intense, complex, and unpredictable, but criticized the over-simplistic and shallow on-foot combat. Carter compared the game's vehicular controls to the best racing games, and commended its handling. He also praised the car mechanics, writing that it has offered players a cinematic experience. Tyrrel liked the additions to the game's combat (such as the introduction of weapons and the Fury mode), writing that they added depth to the combat. Hurley praised the game's progression system, which he found satisfying, and the balance between vehicular and on-foot combat. Bloodworth wrote that the melee combat used a "tried-and-true system" which worked well, despite awkward camera angles. Kollar criticized the boss fights, which he thought lacked variety.
Other gameplay aspects received mixed reviews. Tyrrel praised the customization system for Max and the Magnum Opus, since the customization impacts the gameplay and makes the overall experience more rewarding; Kollar echoed this. Brown criticized the game for failing to offer much challenge or a sense of accomplishment to players. He called the health system a redundant addition in which resources, such as water and food, play an insignificant role and can be neglected by players. Brown also criticized the scrap-collecting system, writing that it frustrated most players and slowed the game's pace. However, Robinson wrote that those elements reflect the barbarian nature of the wasteland. He praised its world design (which he thought echoed the films), describing it as "a world of twisted metal and sudden violence that's there to be survived rather than conquered". Bloodworth criticized the game's stronghold system, which he called repetitive. Brown criticized the game's lack of a climbing system, which hinders movement; this was echoed by Carter.
Mad Maxs quest design also received mixed reviews. Tyrrel praised the content and activities scattered across the world, calling the activities engaging for most players. However, he disliked the repetition which dragged down their replay value. Hurley found it easy for players to become confused in the game's early stages, since the objectives are unclear. Brown criticized the structure of several quests which force players to use a certain method, removing freedom and creativity. Chris Carter of Destructoid wrote that the game brought nothing new to the genre, and its quests and features were too similar to typical Ubisoft open-world design.
The game had some technical problems when it was released. Tyrrel noted an unstable frame rate and occasional texture pop-up, and Kollar identified audio problems.
Sales
Mad Max was the second-best selling game in the United Kingdom in its first week of release on the United Kingdom software retail chart, only behind Metal Gear Solid V: The Phantom Pain, which was released the same day. According to the NPD Group, it was the eighth-best selling game in the United States in September 2015.
Notes
References
External links
2015 video games
Avalanche Studios games
Cancelled PlayStation 3 games
Cancelled Xbox 360 games
Death games in fiction
Linux games
MacOS games
Mad Max
Open-world video games
PlayStation 4 games
Post-apocalyptic video games
Vehicular combat games
Video games about police officers
Video games based on films
Video games developed in Sweden
Video games using Havok
Video games set in Australia
Warner Bros. Interactive Entertainment games
Windows games
Xbox One games
Single-player video games
|
33085168
|
https://en.wikipedia.org/wiki/Juju%20%28software%29
|
Juju (software)
|
Juju is a free and open source application modeling tool developed by Canonical Ltd. Juju focuses on reducing the operation overhead of software by facilitating deploying, configuring, scaling, integrating, and performing operational tasks on public and private cloud services along with bare-metal servers and local container-based deployments.
Juju modeling complex software topologies
Juju aims to provide a modeling language that abstracts the specifics of operating complex software topologies in order to reduce the cost of operations and provide flexibility. A Juju model is an environment to manage and operate a set of software applications. Models can be operated on a variety of public clouds.
A Juju controller is the service that tracks the events, state, and user activity across multiple models. A controller and models are analogous to a database server and databases available on the server. Each model can have different configurations, sets of operating software, and users with various levels of access. Examples of models include a web application, load balancer, and database in a "web-app" model. Models allow deployments to be isolated into logical solutions and managed separately.
Juju charms
The central mechanism behind Juju is called charms. Charms can be written in any programming language that can be executed from the command line. A charm is a collection of YAML configuration files and a selection of hooks. A hook is an executable file that can be used to install software, start or stop a service, manage relationships with other charms, upgrade charms, scale charms, configure charms, etc. Charms can have many properties. Charm helpers allow boiler-plate code to be automatically generated, thus accelerating the creation of charms.
Juju client and environments
Juju has two components: a client and a bootstrap node. After installing the client, one or more environments can be bootstrapped. Juju environments can be bootstrapped on various clouds. By creating a Juju Provider, additional cloud environments can be supported.
Juju can also be bootstrapped on bare-metal servers. Large deployments can use Canonical's Metal as a Service. Small deployments can use the manual provider, which allows any SSH Ubuntu machine to be converted into a Juju-managed machine. Juju can also be installed on a local Ubuntu machine via LXC operating system–level virtualization and the local provider.
Command line and GUI
Juju has both a command line and a GUI. Automatically available on every controller, the Juju GUI and allows users to visually see what software is currently running in which models. It also lets users search the Charm Store and browse results with detailed charm information presented. Complex software stacks can be deployed via drag-and-drop.
Bundles
Juju also has a concept of bundles. A bundle is a portable specification for a model with charms, configuration, and relations, all specified in a declarative YAML format. A bundle YAML file can later be imported into another Juju model and shared with others. Bundles can also be uploaded to the Charm Store, allowing others deploy them.
In this example bundle, two applications are modeled: mediawiki and mysql. Users can modify attributes declared in the bundle to customize their deployment:
services:
mediawiki:
charm: mediawiki
num_units: 1
options:
debug: false
name: Please set name of wiki
skin: vector
mysql:
charm: mysql
num_units: 1
options:
binlog-format: MIXED
dataset-size: 80%
tuning-level: safest
series: trusty
relations:
- - mediawiki:db
- mysql:db
Charm Store
The Juju Charm Store launched on April 3, 2012. The Charm Store regularly tests charms to notify charm authors when code breaks in addition to ensuring that Juju users have access to the latest versions of charms.
Supported platforms
Juju is available on Ubuntu server, with agents available for Ubuntu, CentOS and Microsoft Windows. Support for both CentOS and Windows has been contributed by Cloudbase Solutions.
References
External links
Canonical (company)
Free software programmed in Go
Python (programming language) software
Software using the GNU AGPL license
|
609578
|
https://en.wikipedia.org/wiki/Run%20%28magazine%29
|
Run (magazine)
|
Run (stylized as RUN) was an American computer magazine published monthly by IDG Communications with its first issue debuting in January 1984. Bi-monthly publishing began in June/July 1990 (issue #78, volume 7 number 6), and went on until the magazine folded in November/December 1992 (issue #94, volume 9 number 6). In its heyday, Runs monthly circulation was in the 200,000–300,000 range. Folio, the trade journal of the magazine industry, rated it as the second fastest-growing U.S. magazine of 1985.
The magazine contained articles about Commodore 8-bit home computers and peripherals, as well as reviews on available software packages for the computers. In addition, every issue featured several type-in programs written in BASIC and/or machine language. The magazine's name came from the BASIC command "RUN", which started execution of the computer's program, presumably typed in from the magazine.
The front cover was originally accented by a logotype reading "RUN", with each letter placed on a key button resembling those used on the C-64. In June 1987 the keys were removed and the font became italicized with rounded letters.
Content
Run columns included the following:
Magic, perhaps the magazine's most distinctive feature, was a collection of short programs, programming tips, and tricks, mostly submitted by readers. Several dozen were published each month, and they were all numbered in hexadecimal, with each issue's numbering taking over where the last one had left off. Readers could write to Magic at P.O. Box 101011, a box number chosen for its binary appearance. Often, a "special issue" published at the end of the year would collect the year's Magic entries and augment them with many unpublished ones. This column, created and compiled by Louis F. Sander, debuted in the first issue and was run during the entire life of the magazine.
Mega-Magic was a monthly column that included type-in programming utilities larger and more powerful than those in the standard Magic columns.
Commodore Clinic, a letters column, allowed users to write in with questions about hardware and software issues, which would then be answered in the magazine.
Run Amok was an errata column that published corrections to previous type-in programs and articles.
Software Gallery reviewed various commercial software packages.
128 Mode, taken over from Commodore's own magazine when it was purchased by Run, included programming advice and short type-ins for the Commodore 128.
Gold Mine was another Louis F. Sander column taken over from Commodore's magazine. It featured tips and tricks for commercial games.
Contributors
Mike Konshak, a BASIC software developer and mechanical engineer contributed the popular DataFile database management program and many other utilities for the Commodore 64 to Run. The code was first published in the back of the November 1984 issue. A small note, written by Mike at the end of the article, stated "If you don't want to type this in, send me $6.00 and I'll send you a disk". 1500 Run subscribers sent Mike money in the first month, which prompted the editors to create the "Re-Run" disk to generate more revenue for the publisher. A series of a dozen follow-on article by Mike were published in the ensuing two years, and the programs were exclusively sold on Runs Re-Run disk, as the editors restricted authors from soliciting for disks in the magazine from then on. (Datafile then evolved into dFile64, dFile128, dFcalc, DFword, etc., and sold by Mike Konshak through his small company, MichaelSoft "A cottage Industry of Home-Spun Software").
References
External links
DLH's Commodore Archive Gallery of RUN magazine covers and downloadable PDFs of the "Special Issues."
10 PRINT CHR$(205.5+RND(1)); : GOTO 10, book about a one-line type-in program published in RUNs "Magic" column
Bimonthly magazines published in the United States
Commodore 8-bit computer magazines
Defunct computer magazines published in the United States
Magazines established in 1984
Magazines disestablished in 1992
Home computer magazines
|
839358
|
https://en.wikipedia.org/wiki/EFF%20DES%20cracker
|
EFF DES cracker
|
In cryptography, the EFF DES cracker (nicknamed "Deep Crack") is a machine built by the Electronic Frontier Foundation (EFF) in 1998, to perform a brute force search of the Data Encryption Standard (DES) cipher's key space – that is, to decrypt an encrypted message by trying every possible key. The aim in doing this was to prove that the key size of DES was not sufficient to be secure.
Background
DES uses a 56-bit key, meaning that there are 256 possible keys under which a message can be encrypted. This is exactly 72,057,594,037,927,936, or approximately 72 quadrillion possible keys. One of the major criticisms of DES, when proposed in 1975, was that the key size was too short. Martin Hellman and Whitfield Diffie of Stanford University estimated that a machine fast enough to test that many keys in a day would have cost about $20 million in 1976, an affordable sum to national intelligence agencies such as the US National Security Agency. Subsequent advances in the price/performance of chips kept reducing that cost until, twenty years later, it became affordable for even a small nonprofit organization such as the EFF to mount a realistic attack.
The DES challenges
DES was a federal standard, and the US government encouraged the use of DES for all non-classified data. RSA Security wished to demonstrate that DES's key length was not enough to ensure security, so they set up the DES Challenges in 1997, offering a monetary prize. The first DES Challenge was solved in 96 days by the DESCHALL Project led by Rocke Verser in Loveland, Colorado. RSA Security set up DES Challenge II-1, which was solved by distributed.net in 39 days in January and February 1998.
In 1998, the EFF built Deep Crack (named in reference to IBM's Deep Blue chess computer) for less than $250,000. In response to DES Challenge II-2, on July 15, 1998, Deep Crack decrypted a DES-encrypted message after only 56 hours of work, winning $10,000. The brute force attack showed that cracking DES was actually a very practical proposition. Most governments and large corporations could reasonably build a machine like Deep Crack.
Six months later, in response to RSA Security's DES Challenge III, and in collaboration with distributed.net, the EFF used Deep Crack to decrypt another DES-encrypted message, winning another $10,000. This time, the operation took less than a day – 22 hours and 15 minutes. The decryption was completed on January 19, 1999. In October of that year, DES was reaffirmed as a federal standard, but this time the standard recommended Triple DES.
The small key space of DES, and relatively high computational costs of Triple DES resulted in its replacement by AES as a Federal standard, effective May 26, 2002.
Technology
Deep Crack was designed by Cryptography Research, Inc., Advanced Wireless Technologies, and the EFF. The principal designer was Paul Kocher, president of Cryptography Research. Advanced Wireless Technologies built 1856 custom ASIC DES chips (called Deep Crack or AWT-4500), housed on 29 circuit boards of 64 chips each. The boards were then fitted in six cabinets and mounted in a Sun-4/470 chassis.
The search was coordinated by a single PC which assigned ranges of keys to the chips. The entire machine was capable of testing over 90 billion keys per second. It would take about 9 days to test every possible key at that rate. On average, the correct key would be found in half that time.
In 2006, another custom hardware attack machine was designed based on FPGAs. COPACOBANA (COst-optimized PArallel COdeBreaker) is able to crack DES at considerably lower cost. This advantage is mainly due to progress in integrated circuit technology.
In July 2012, security researchers David Hulton and Moxie Marlinspike unveiled a cloud computing tool for breaking the MS-CHAPv2 protocol by recovering the protocol's DES encryption keys by brute force. This tool effectively allows members of the general public to recover a DES key from a known plaintext–ciphertext pair in about 24 hours.
References
External links
The DES Cracker page on EFF's site
Photos of the machine on Cryptography Research's site
COPACOBANA, an off-the-shelf DES cracking device
A FPGA implementation using 48 Virtex-6 LX240Ts
ASIC design from 1994 that could crack DES in 24 hours with 256 custom chips
Cryptographic hardware
Cryptanalytic devices
Data Encryption Standard
One-of-a-kind computers
|
5479136
|
https://en.wikipedia.org/wiki/Aalborg
|
Aalborg
|
Aalborg (, , ) is Denmark's fourth largest city with an urban population of 142,937 (2021).
The twin city Nørresundby is across the Limfjord. When including their population of 20.964 (), then the Municipality of Aalborg is the third most populous in the country after Copenhagen and Aarhus. By road Aalborg is southwest of Frederikshavn, and north of Aarhus. The distance to Copenhagen is if travelling by road and not using ferries.
The earliest settlements date to around AD 700. Aalborg's position at the narrowest point on the Limfjord made it an important harbour during the Middle Ages, and later a large industrial centre. Architecturally, the city is known for its half-timbered mansions built by its prosperous merchants. Budolfi Church, now a cathedral, dates from the end of the 14th century and Aalborghus Castle, a royal residence, was built in 1550. Today, Aalborg is a city in transition from a working-class industrial area to a knowledge-based community. A major exporter of grain, cement, and spirits, its thriving business interests include Siemens Wind Power, Aalborg Industries, and Aalborg Portland. These companies have become global producers of wind turbine rotors, marine boilers, and cement.
With its theatres, symphony orchestra, opera company, performance venues, and museums such as Aalborg Historical Museum and the Aalborg Museum of Modern Art, Aalborg is an important cultural hub. The Aalborg Carnival, held at the end of May, is one of the largest festivals in Scandinavia, attracting some 100,000+ people annually. The town's major university is Aalborg University (often abbreviated to AAU), founded in 1974, which has more than 20,000 students (as of 2018). AAU is also North Jutland's largest university and overall academic institution. The University College of Northern Denmark (UCN) is one of seven new regional organisations while the Royal School of Library and Information Science (RSLIS) provides higher education in library and information science. Trænregimentet, the Danish regiment for army supply and emergency medical personnel, is also in Aalborg. Aalborg University Hospital, the largest in the north of Jutland, was founded in 1881.
The football club Aalborg BK, established in 1885 and based at Nordjyske Arena, won the Danish Superliga in the 1994–95 season, the 1998–99 season, the 2007–08 season, and the 2013–14 season. Other sports associations include the icehockey club Aalborg Pirates, the men's handball team Aalborg Håndbold, the rugby club Aalborg RK, and Aalborg Cricket Club. Aalborg Railway Station, on John F. Kennedys Plads has connected the city to Randers and the south since 1869. Aalborg Airport is just northwest of the city centre, and the E45, a European route from Alta, Norway, to Gela, Italy, passes through Aalborg.
The European Commission has concluded that the citizens of Aalborg are the most satisfied people in Europe with their city.
History
The area around the narrowest point on the Limfjord attracted settlements as far back as the Iron Age leading to a thriving Viking community until around the year 1000 in what has now become Aalborg. In the Middle Ages, royal trading privileges, a natural harbour and a thriving herring fishing industry contributed to the town's growth. Despite the difficulties it experienced over the centuries, the city began to prosper once again towards the end of the 19th century when a bridge was built over Limfjord and the railway arrived. Aalborg's initial growth relied on heavy industry but its current development focuses on culture and education.
Beginnings
Aalborg traces its history back over a thousand years. It was originally settled as a trading post because of its position on the Limfjord. The sites of what were two settlements and a burial ground can be seen on Lindholm Høje, a hill overlooking the city. These large settlements, one from the 6th-century Germanic Iron Age, the other from the Viking Age in the 9th to 11th centuries, evolved at the narrowest point on Limfjord as a result of the traffic between Himmerland to the south and Vendsyssel to the north.
The first mention of Aalborg under its original name Alabu or Alabur is found on coins from 1040, the period when King Harthacnut (Hardeknud) settled in the area. In 1075, Adam of Bremen reported that Alaburg, as he called it in German, was an important harbour for ships sailing to Norway. In Valdemar's Danish Census Book from 1231 it was called Aleburgh, possibly meaning "the fort by the stream" as in Old Norse all meant a stream or current and bur or burgh a fort or a castle.
The Church of Our Lady in Aalborg was originally built in the early 12th century but was demolished during the Reformation. The Franciscan friary, or Greyfriars, on the east side of Østerå, was probably built around 1240; it was documented in 1268, but like many other Roman Catholic monasteries and convents was shut down in 1530 as a result of the Reformation.
Middle Ages
Aalborg's earliest trading privileges date from 1342, when King Valdemar IV received the town as part of his huge dowry on marrying Helvig of Schleswig. The privileges were extended by Eric of Pomerania in 1430 and by Christopher of Bavaria in 1441. The town prospered, becoming one of the largest communities in Denmark. Its prosperity increased when the merchant- and trade association Guds Legems Laug was established in 1481, facilitating trade with the Hanseatic League,
especially from 1516 when Christian II granted it a monopoly in salting Limfjord's herring. The king frequently visited the town, where he held court and stayed in the old Aalborghus. The herring fishery linked Aalborg to the East coast of England, across the North Sea, both in commercial competition and cultural exchange. During the Middle Ages a number of important institutions were established in Aalborg, including Budolfi Cathedral in the late 14th century and the Hospital of the Holy Ghost, a monastery and nunnery founded in 1451 to help those in need. It was converted into a hospital during the Reformation and is still in use today as a nursing home for the elderly.
In 1530 a large part of the town was destroyed by fire, and in December 1534 it was stormed and plundered by the king's troops after a peasants' revolt known as the Count's Feud led by Skipper Clement. It resulted in the death of up to 2,000 people. The Reformation in 1536 brought about the demolition of the town's two monasteries. As a result of the Reformation, Aalborg became a Lutheran bishopric in 1554.
17th to 19th centuries
From the 1550s to the 1640s, as a result of increased foreign trade, Aalborg enjoyed great prosperity, second only to that of Copenhagen. The population grew in parallel with the development of many fine buildings in the city as merchants benefitted from their shipping routes from Norway to Portugal. In 1663, the city suffered yet another serious fire, which destroyed the tower of Budolfi Church.
During the second half of the 18th century, Aalborg entered a further period of prosperity. In Erik Pontoppidan's Danske Atlas (Danish Atlas) it was described as "after Copenhagen, the best and most prosperous market town in Denmark". The population grew from 4,160 in 1769 to 5,579 in 1801. In 1767, the second newspaper ever published in Denmark appeared in the city.
After Denmark ceded Norway to Sweden in 1814, Aalborg lost its important role as the country's centre for Norwegian trade. Its former prosperity also suffered as a result of difficulties with the herring industry as the fish disappeared after the sea breached the Agger Tange (which had linked Thy with the rest of Jutland at the western end of Limfjord) in the 1825 North Sea storm. The after effects of the state bankruptcy in 1813 also contributed to widespread poverty in the city. In the mid-19th-century, Aalborg was overtaken by Aarhus as the largest city in Jutland. Towards the end of the 19th century there was however an upturn. In 1865, the pontoon bridge over Limfjord was completed, and in 1869, the railway reached the city with a railway bridge over the sound to Vendsyssel three years later. The harbour facilities were also improved, making Aalborg Denmark's second port. Aalborg became the country's main producer of tobacco products and spirits, followed in the 1890s by fertilisers and cement. By 1901, the population had increased to almost 31,500.
20th century industrialisation
Around the beginning of the 20th century, as a result of decisions taken by the municipality, many of the city's half-timbered houses were torn down. They were replaced by hundreds of modern buildings, completely changing the look of the city. Factories with smoking chimneys became ever more prevalent in the outskirts. Among the most important were De Danske Spritfabrikker (spirits and liquors), De forenede Textilfabrikker (textiles), the East Asiatic Company (trading), Dansk Eternit (building materials) and C.W. Obel's tobacco factory (established in 1787). Aalborg Portland, run by F.L. Smidth, was one of several cement factories operating in 1913, together employing some 800 workers. By the 1930s, Aalborg was being promoted as "Denmark's new centre for industry and workers". Replanning continued with additional thoroughfares cutting through the city. The port facilities were also improved with the help of a dredger and the opening of new docks. In 1933, Christian X inaugurated a new bridge over Limfjord to replace the fragile pontoon crossing.
Aalborg Airport, officially opened in 1938 because of the success of the cement industry, had in fact operated flights to Copenhagen since 1936. During the German invasion of Denmark in 1940, the airport was captured by German paratroopers on the night of 21 April as a base for German aircraft flying to Norway. On 13 August 1940, a dozen Bristol Blenheim bombers of No. 82 Squadron RAF were launched against the Luftwaffe airfield during one of the most disastrous Royal Air Force raids of the war. One turned back because of fuel problems, but all of the remaining 11 were shot down by enemy fighters and/or flak batteries within 20 minutes. After the war, the Royal Air Force destroyed all the German facilities including planes, hangars and equipment but left the passenger facilities intact.
By 1960, Aalborg had become known as the "city of smoking chimneys", with half of the inhabitants working in industry or manufacturing. Ten years later, Aalborg's population had grown to around 97,000 inhabitants.
Recent history
The significance of Aalborg's industry began to decline in the 1970s, precipitating a fall in the city's population until about 1990, when it began to increase again. By the year 2000, the service and education sectors accounted for about 60 percent of the workforce, partly as a result of the founding of Aalborg University (AAU) in 1974. Since 1970, Aalborg and the northern suburb of Nørresundby have become a major administrative centre, thanks in part to the offices of the Region Nordjylland established in the east of the city. In addition to large industrial companies including Aalborg Portland, the only cement-producing company in the country, and the building products company Eternit, many small and medium-sized enterprises have been established. The telecommunications and information technology sector has developed with the support of Aalborg University and the North Jutland knowledge park NOVI.
The First European Conference on Sustainable Cities and Towns took place in Aalborg in 1994. It adopted the Aalborg Charter, which provides a framework for the delivery of local sustainable development and calls on local authorities to engage in Local Agenda 21 processes. The Fourth European Sustainable Cities and Towns Conference, held in Aalborg in 2004, adopted the more binding Aalborg Commitments on local sustainable development. The commitments have now been signed by 650 local authorities while over 2,500 have signed the earlier Aalborg Charter.
Geography
Aalborg is in North Jutland (northwestern Denmark), at the narrowest point of the Limfjord, a shallow sound that separates North Jutlandic Island (Vendsyssel-Thy) from the rest of the Jutland Peninsula and connects Aalborg to the Kattegat about to the east. Aalborg is north of Aarhus, north of Randers, and southwest of Frederikshavn. It is by Great Belt Fixed Link to Copenhagen, by the Frederikshavn-Göteborg ferry to Gothenburg in Sweden, and by the Frederikshavn-Oslo ferry to Oslo in Norway.
The area close to the waterfront is low-lying, with an elevation averaging about , but there are many hills in and around city, some reaching over . Nørresundby, on the northern side of the sound, is also a hilly area. Villages to the south of Aalborg from west to east include Frejlev, Svenstrup, and Gistrup (which contains extensive woodland to the south as well as a golf club). Klarup and Storvorde lie to the southeast along the 595 road, which, flanking a stretch of the Limfjord known as Langerak, leads to the town of Hals. Nibe, with a harbour on the Limfjord, is to the southwest, past the village of Frejlev. The Nibe Broads (Nibe Bredning) in the Limfjord not only has the largest eelgrass belts in Danish waters but is an important sanctuary for thousands of migratory birds. To the north of the city, villages include Vadum, Aabybro, Vestbjerg, Sulsted, Tylstrup, Vodskov, and Hjallerup. There is an extensive plantation, Branths Plantage - Møgelbjerg, immediately north of Vodskov.
The Himmerland region to the south still has a number of moors which once formed a vast area of heathland extending to the Rold Forest near Arden. Rebild Hills in the Rold Forest stretch over of rolling heath country about south of Aalborg. Lille Vildmose, to the southeast, is reported to be the largest raised bog in north-western Europe.
The city
The city centre, dating from the Middle Ages, lies on a series of clay banks between the former streams of Vesterå and Lilleå, which used to run into the sound. Despite effective drainage, the main streets, including Algade, still run east to west while the side streets run north to south. The Budolfi Church and the old town hall line Gammeltorv, the old market square. The main shopping streets are Algade and Bispengade, the latter lying in between the modern Vesterbro thoroughfare and Nytorv square. Østerågade, once the old harbor, is noted for its merchants' mansions.
The city cemetery, the Kilden park and the modern art museum, Kunsten, are in the modern commercial and administrative area around the railway station to the west. Beyond this, Hasseris has become a residential district with a number of large villas and detached houses. The city's main development area is now to the east of the centre although in addition to the university and new areas of housing, it still contains the shipping harbor, Østhavnen, and the cement factory. The waterfront to the northeast of the centre is being transformed from a harbour into a recreational area with the Utzon Center and Musikkens Hus.
Egholm
Off the northwestern side of the city in the sound is the island of Egholm, reached via ferry. The island, with a population of 55 , covers an area of and consists mainly of farmland although there are still a few untilled areas of salt marshes and woodland. Dikes have been built along the coastline to protect the island from flooding. The Kronborg Forest on the island, covering an area of , was acquired by the municipal government in 1945. A restaurant in the vicinity was established in 1918 but rebuilt in 1946 following a fire. To the west of Egholm is the smaller uninhabited Fruensholm, and there are also three small islands to the north.
Lakes and chalk deposits
There are several man-made lakes nearby: Lindholm Kridtgrav lies to the northwest of Skanse Park on the northern side of Limfjord, while Nordens Kridtgrav to the northwest of Mølleparken is on the southern side. The Aalborg area is one of three in Denmark where chalk deposits are found (the others being Møns Klint and Stevns). The largest quarry is at Rørdal in Øster Sundby ( to the east of the city centre), while Vokslev ( to the west) has also provided chalk. Clay is also quarried in Østerådalen in the southern outskirts, making the area ideal for cement production.
Parks and green spaces
The Østre Anlæg park is one of the oldest in Aalborg, visited by up to 175,000 people a year. It was used as a dumping ground in the 1920s before being cleaned up and made into a recreational area in the 1930s and 1940s. It contains lawns, flowers, tall trees, bushes, and a lake, overlooked by St. Mark's Church on the eastern side. The lake is on the site of a former clay pit. Fifty-one species of bird have been recorded in the park.
Lindholm Fjordpark, to the south of the Lindholm's industrial park, forms part of the green sector of the city known as 'Ryåkilen' along the coast of the sound, covering roughly . Like Østre Anlæg, it once served as a waste site with landfill, and a housing estate was built on its northeastern side. Its use as a landfill site was gradually discontinued in the 1990s, and in 1996, extensive restoration work began. Today it has woodlands and open areas with grass and herbaceous vegetation, notably buckthorn. It is also a habitat for many species of migratory birds such as pale-bellied brent geese, curlews, and songbirds. The park is also used by the Nordjysk Windsurfing Club and has a six-hole golf course.
Aalborg has a number of additional civic parks and recreational facilities. Among them are Kildeparken, which hosts the annual Aalborg Carnival, Mølleparken, which contains a pond, statues, an outdoor exercise facility, and a 2.5 kilometre (1.6 mi) jogging trail (within the trail lies the Lysløjpen, a 45-metre [148 ft] gradient), Sohngårdsholmpark, a wooded area containing trails for both walking/jogging and biking and a six-hole golf course (free to the public), the Aalborg Open Air Swimming Pool, also free to the public, Bundgårdsparken, and Lindholm Strandpark.
The Aalborg Zoo was opened in 1935 and typically houses 1,300 animals from 138 different species, including tigers, chimpanzees, zebra, elephants, giraffes, penguins and polar bears. It is one of the area's major tourist attractions with over 300,000 visitors a year. Within the zoo an African savannah has been created where exotic animals are housed.
Aalborg was home to an amusement park, Karolinelund, founded in 1946. In 2005, still owned by the founding family, it was sold to an entrepreneur who resold it to the city the following year. When the park closed in 2010, it was home to 17 attractions. Recently, the city has reopened the park to volunteers who wish to return it to operating status. The park is once again open to the public as a leisure facility but without rides and attractions. The association, Platform4, a non-profit user-driven project-oriented venue that experiments with technology (electronics) in combination with artistic genres is now located in the park. Volunteers frequently arrange seminars, exhibitions, films, music concerts, and more which are open to the public.
Climate
Aalborg has a maritime climate (Cfb), just above the humid continental climate classification (Dfb) with short, mild summers and long, moderately cold winters.
Aalborg is cool most of the year, with average high temperatures of around and lows of during the summer, and average temperatures of during the coldest months of January and February, rarely dropping below . The warmest months are typically July and August, with an average temperature of , but by October the temperature averages . June has the highest number of hours of sunshine on average at 218, closely followed by May and July. Precipitation is rather evenly distributed all year around, with an average of during October, normally the wettest month with an average 14 days with rainfall, and an average of during February, normally the driest month with an average of eight days of precipitation, closely followed by April.
Politics and government
Henning G. Jensen, a Social Democrat, was the long-serving Mayor of Aalborg from 1998 until 2013. He was succeeded by Thomas Kastrup-Larsen, also a Social Democrat, who was elected to the City Council in 1998.
The civic government in Aalborg consists of seven departments: the Mayor's Department (responsible for the titular position, the four Citizen Service Centres in Aalborg, the Financial Services division, the Commercial Services division, the General Services division, and the Fire and Rescue Centre); the Technical and Environmental Department (responsible for urban planning, transportation oversight, the Parks and Nature division, and the Environmental Division); the Department of Family and Employment (responsible for Children and Family services, social services, and the city's "Job Centre"); the Department of Care of the Elderly and Disabled (responsible for social benefits, senior citizen care, and disabled citizen care); the Department of Education and Cultural Affairs (responsible for the municipal schools, the public libraries, the Cultural Affairs division, and the city archives); the Health and Sustainable Development Department (responsible for public health, the Occupational Health and Safety Division, the Public Transportation division, and the Sustainable Development division); and the Utilities Department (responsible for gas, heating, water, sewage, and refuse collection).
Aalborg City Council consists of 31 members, including a mayor. As of September 2013, 11 of the council seats are held by the Social Democratic Party, nine by Venstre, three by the Socialist People's Party, two by the Danish People's Party, and two by the Conservative People's Party, while three members are professed independents. The council is mandated to hold a minimum of two meetings per month, with meetings of a public forum format.
Demographics
Aalborg was the largest city in Jutland until it was surpassed by Aarhus in the mid-19th century. In 1672, it had 4,181 inhabitants, growing slowly during the 18th century, with 4,425 in 1769, 4,866 in 1787 and 5,579 by 1801. By 1845, there were 7,477 inhabitants, increasing to 10,069 by 1860. Dramatic growth began in the late 19th century, with an increase from 14,152 in 1880 to 31,457 in 1901. By 1930, the population had grown to 59,091, although the figure was boosted by the merging of Nørre Tranders, Rørdal Fabriksby, Øster Sundby and Øster Uttrup into Aalborg. In 1950, it reached 87,883, which grew to 100,587 by 1970.
There was a temporary decline in population to 94,994 in 1976 but in 1981, following the incorporation of Nørresundby, it grew to 114,302. The population has increased steadily since then; according to the census of 1 January 2009, Aalborg had a total of 122,461 inhabitants, 101,497 of them living in the city and 20,964 in the independent suburb of Nørresundby. , the city has a total population of 142,561 (118,871 in the city proper and 23,690 in Nørresundby) making it the fourth most populous in Denmark after Copenhagen, Aarhus and Odense. Statistics for 2016 showed there were 210,316 people living in the Municipality of Aalborg.
Economy
Aalborg is North Jutland's major industrial and commercial centre, exporting grain, cement, and spirits. Heavy industry was behind the city's prosperity until fairly recently. Many of the factories have now closed, to be replaced by developments in the knowledge-based and green-energy sectors. Mobile and wireless communications industries have grown substantially since the 1990s, as has rotor production for wind turbines.
In January 2011, there were some 9,200 enterprises in Aalborg, employing around 109,000 people or approximately 35% of the workforce of the Northern Region. In the 2010s, the city is set on increasing its participation in the global economy through both existing companies and new entrants. Its efforts are focused on four areas: energy and environment, information technology, health support systems and "Arctic business". The latter covers trade with Greenland as the Port of Aalborg handles over 60% of all goods shipped to Greenland. Four harbours dot the waterfront, Marina Fjordparken, Skudehavnen, Vestre Badehavn, and Østre Havn. Tourism is also growing, with a considerable rise in the number of passengers at Aalborg Airport. Aalborg Municipality has Denmark's second highest revenue from tourism and is the only municipality in the north of Denmark where overnight stays are increasing.
Major private companies
Telenor Denmark, part of the Norwegian Telenor telecommunications and mobile phone company, has a workforce of about 1,100 in Aalborg, making it one of the city's largest new employers. Siemens Wind Power has rotor-blade production and testing facilities in Aaborg. In 2012 and 2013, there were additions in both areas. The new testing plant is the world's largest research test centre for wind turbine technology. In 2012, the company shipped a record 570 wind turbine blades from the Port of Aalborg, mainly to England and Ireland, up 45% on the previous year.
Aalborg was home to De Danske Spritfabrikker or Danish Distillers (now owned by the Norwegian company Arcus), which produces numerous brands of akvavit, until 2014. The company is the world's largest akvavit producer and exporter.
Aalborg Industries, the world's largest manufacturer of marine boilers, has been established in Aalborg since the 1920s. It has recently expanded into floating production systems for the offshore market. Employing 2,600 people, in December 2010 it was acquired by the Swedish Alfa Laval, also a specialist in the area. Aalborg Portland, a subsidiary of the Italian Cementir since 2004, was founded in 1889 with the support of FLSmidth. Able to draw on the chalk deposits from Rørdal to the east of the city, it rapidly became a major cement producer. Today it is the world's largest supplier of white cement, which it exports around the globe.
Facilities
Aalborg has a wide selection of shops and restaurants. In the city centre, there are both large department stores and smaller speciality shops. One of the largest shopping malls in Denmark, the Aalborg Storcenter, is to the south of the city in Skalborg. It has about 75 stores, including a large Bilka supermarket. The city has over 300 restaurants, catering in Danish, European and Asian dishes. Notable establishments include Fusion on the waterfront, Mortens Kro, run by celebrity chef Morten Nielsen, and Irish House, a pub in the 17th-century Jens Olufsen's House. While Aalborg is renowned for its alcohol and nightlife, there are also a number of coffee shops.
Aalborg has 12 large hotels, most within walking distance of the city centre. The Helnan Phønix Hotel is the largest, occupying what was originally built as a lavish private residence in 1783 for a Danish brigadier. It was converted into a hotel in 1853, and in 2011 had 210 rooms, furnished with dark oak. The Chagall was established in the 1950s and has reproductions of Marc Chagall paintings in the rooms. Radisson Blu Limfjord Hotel, operated by the Radisson Hotels chain, contains 188 rooms and has the Italian restaurant Vero Gusto. The Park Hotel, opposite the railway station, was established in 1917. Other hotels include Cabinn Aalborg, Hotel Hvide Hus, Hotel Krogen and Prinsen Hotel. Several banks including Danske Bank, Forex, Jyske Bank, Spar Nord and Nordea have branches in Aalborg.
Landmarks
Despite its industrial background and the factories along its waterfront, the city has gained popularity for tourism in recent years, offering a wide variety of attractions and historic buildings in addition to its museums, churches and parks. See the religion section for details on churches.
Historic buildings
Jens Bang's House (), on Østerågade near the old town hall, is one of Denmark's best examples of 17th-century domestic architecture. Built in 1624 by the Aalborg merchant Jens Bang in the Dutch Renaissance style, the four-story sandstone building is noted for its rising gables and sculpted auricular window decorations. For over 300 years, it has housed the city's oldest pharmacy.
Jørgen Olufsen's House (Jørgen Olufsens Gård) on Østerågade is Denmark's best preserved merchant's mansion in the Renaissance style. Built mainly of sandstone in 1616, it also has a half-timbered section. The style is reminiscent of similar buildings in the north of Germany and in the Netherlands. Olufsen, Jens Bang's half brother, was not only a successful merchant but also mayor of Aalborg. When it was built, the residence with its integrated warehouse was on the Østerå, an inlet from the sound with access for barges. The old iron bar with a hook for scales can be seen in the portico.
Aalborghus Castle (Aalborghus Slot) is a half-timbered building with red-painted woodwork and whitewashed wall panels. It was built in the mid-16th century by King Christian III for his vassals who collected taxes and is the only remaining example of its kind in the country. The park, dungeon and casemates, but not the castle itself, are open to the public in the summer months. In the 1950s, the castle was converted into administrative offices.
Aalborg's old city hall in Gammeltorv, in service until 1912, was built in 1762. It is now only used for ceremonial and representative purposes. Designed in the Late Baroque style, the building with its black-glazed tile roof consists of two storeys and a cellar. The yellow-washed façade is decorated with white pilasters and a frontispiece featuring the Danish coat of arms and a bust of King Frederick V. His motto, Prudentia et Constantia, is also seen above the main entrance. The well-preserved door is an example of the Rococo style. The building was listed by the Danish Heritage Agency in 1918.
Another old building of note is the half-timbered Håndværkerhuset (at Kattesunded 20) from 1625, which originally housed a number of warehouses. It is now used as a centre for arts and crafts. Finally, the headquarters of Danish Distillers (De Danske Spritfabrikker), to the west of the Limfjord Bridge, is noted for its Neoclassical appearance. Completed in 1931 by the architect Alf Cock-Clausen, it combines functionality with decorative classical symbolism. Considered a masterpiece of Danish factory design, it is now a Danish National Heritage site. When the factory closed in 2014, was the area bought by an investor, who will use the buildings to create an international culture city with museums, theatres, apartments etc.
Other landmarks
Jomfru Ane Gade (literally Virgin Anne's Street) is one of the most famous streets in Aalborg if not in Denmark. Popular for its cafés and restaurants during the day, it is even busier at night with its clubs, discos and bars. During the 1990s, the street was infamously a 'hang out' of two biker gangs who were at war for some years all over Scandinavia. As the bikers disappeared it became increasingly popular for people of all ages. The pedestrian hubs of Nytorv Square and John F. Kennedy Square in the central city area are also part of the cityscape.
Aalborgtårnet is a tripod tower erected in 1933 with a restaurant on the top. The tower itself is high; but as it stands on the top of the Skovbakken hill, it reaches a total height of above sea level, providing a view over the sound and the city. Designed by Carlo Odgård, it was erected in 1933 in connection with the North Jutland Fair.
In 2008, the Utzon Center, its art, architecture and design credited to the noted architect Jørn Utzon, is also dedicated to him. It was built next to the Limfjord at the central harbour front in Aalborg. Born in Copenhagen, Utzon grew up in Aalborg. The centre contains an exhibition on Utzon's work, which includes the Sydney Opera House, as well as educational displays on architecture and design. The centre consists of several individual buildings creating a special place around a courtyard on a platform. The tall sculptural roofs of the auditorium and the boat-hall, both on the harbour front, and the library facing the park area and the city are set off by the lower roofs of the exhibition and workshop areas inside the complex.
Culture
The annual Aalborg Carnival usually takes place in the last weekend of May. It consists of three events: the children's carnival (Børnekarneval), the battle of carnival bands, and the carnival proper. Attracting about 100,000 visitors, it is the biggest carnival in Scandinavia and one of the largest in northern Europe. Hjallerup Market in Hjallerup, about northeast of Aalborg is one of the oldest and largest markets in Denmark and is the largest horse market in Europe. Held for three days in the beginning of June, it annually attracts more than 200,000 people and 1200 horses.
In 1999 Aalborg was for the first time one of the four host ports in The Tall Ships Race (then Cutty Sark Tall Ships Race) of that year. The city hosted the world's largest event for sailing vessels again in 2004 and 2010, and will do so for the fourth time in less than two decades when The Tall Ships Races visits Aalborg in early August 2015.
Major venues
Aalborgs Kongres & Kultur Center, designed in a functional style by Otto Frankild, was completed in 1952. The centre's main component, the Aalborg Hall, can be divided into sections. The complex also contains a hotel, restaurant, bowling alley, and a number of meeting rooms. The smaller Europahallen was added in 1991, making the centre the largest in Scandinavia. With over 100 theatrical and musical presentations per year, it offers international stars, opera, ballet, musicals, classical concerts, productions for children as well as pop and rock concerts. It can accommodate audiences of up to 2,500.
Aalborg Teater, built in 1878 and subsequently modified by Julius Petersen, seats 870 in the main auditorium. First privately owned, the theatre is now controlled and owned by the Danish Ministry of Culture. While most productions are housed in the main hall, the building can accommodate up to four shows at once in halls of varying sizes. Over the years, the theatre has produced a wide selection of drama and musicals.
Nordkraft is a cultural centre in a former power plant near the harbour. It has theatres, a cinema, and concert facilities. Kunsthal Nord, established in the centre in 2009, arranges up to five exhibitions a year of all forms of contemporary art, especially of local origin but also from other parts of Denmark and beyond. It serves as the exhibition centre for KunstVærket, the North Jutland centre for the arts, and also works in collaboration with the modern art museum Kunsten designed by the Finnish architect Alvar Aalto.
In the same neighbourhood, a huge concert hall, Musikkens Hus, designed by Coop Himmelb(l)au, opened in 2014. It is Aalborg's most ambitious construction project in recent years.
The city also has a wide selection of galleries and arts and crafts outlets operated by local artists. The Academy of Music also has a presence in Aarhus. There are several glass workshops; others produce jewelry, sculptures or exhibit paintings.
Museums
There are various museums in the city. The Aalborg Historical Museum was established in 1863, making it one of the earliest provincial museums in the country. The North Jutland Historical Museum conducted a series of archaeological excavations in the 1950s at Lindholm Høje, revealing ancient burial sites. In 1992, the Lindholm Høje Museum was opened there and extended in 2008. In 1994 and 1995, excavations at the site of the Greyfriars Monastery resulted in the creation of the underground Gråbrødrekloster Museum in the city centre. Several organisations now collaborate under the leadership of the North Jutland Historical Museum. The Springeren - Marine Experience Center is a marine museum on the city's wharf with a wide range of exhibits including "Springeren", an old Danish submarine, whence its name. The Aalborg Defence and Garrison Museum documents Danish defences during the Second World War as well as the history of Aaborg's garrison since 1779. The KUNSTEN Museum of Modern Art Aalborg was built from 1958 to 1972; the collection consists of around 1,500 art objects, including paintings, sculptures and other media.
Music
The Aalborg Symphony Orchestra (Aalborg Symfoniorkester) founded in 1943 presents about 150 concerts a year, frequently playing in the Musikkens Hus. It also plays for the Jutland opera company (Den Jyske Opera, also based in Aalborg), and at the Royal Danish Theatre in Copenhagen. It is one of the main organisers of the 10-day Aalborg Opera Festival held every March. Aalborg has the jazz club Jazzclub Satchmo and an annual jazz and blues festival (Den Blå Festival), also known as the Mini New Orleans Festival. Over four days in mid-August, concerts are performed on squares, in the streets, and in cafés and restaurants. Since 2012, the Egholm Festival, a small music festival on the island of Egholm near Aalborg has been organized in the first weekend of August. It features relatively unknown upcoming pop, rock and hip-hop artists. The festival has two stage areas and was organized by the Musical Association Aalborg (MUSAM) and Aalborg Events.
Religion
Lutheranism
The principal religion in Aalborg as in the rest of Denmark is Christianity. Aalborg is the seat of a bishop within the Lutheran State Church of Denmark. The cathedral of this bishopric is the Budolfi Church, originally built no later than 1132 by Viborg's Bishop Eskil. This church was considerably smaller than the current one, as it was merely a parish church. The existing structure was completed in the late 14th century, on the grounds of the former church, and was listed for the first time in the Atlas of Denmark in 1399. The church was named after St Botolph, an English abbot and saint. The church is constructed in the Gothic style. In 1554 Aalborg was made a diocese and, after consideration, St Budolfi Church was made the seat of the Bishop of Aalborg. Aalborg is also home to the former Catholic church, the Abbey of Our Lady, converted from a Benedictine nunnery.
Churches
The present Budolfi Church, which has the status of a cathedral, dates from the end of the 14th century, although at least two earlier churches stood on the same spot. Built in the Gothic style, it consists of a nave flanked by two aisles, a tower, and a porch. After the original tower was destroyed by fire in 1663, the striking new Baroque tower, based on that of an earlier Copenhagen city hall, was completed in 1779. The church has 16th-century frescoes and an intricately carved early Baroque altarpiece from 1689 created by Lauridtz Jensen.
Abbey of Our Lady (Vor Frue Kirke) was designed in 1878 by J.E. Gnudtzmann in the Neo-Romanesque style. The original Church of Our Lady from the early 12th century was pulled down after the Reformation because it was old and unstable, but the 12th-century tower and the original portal with sculpted decorations can still be seen. The carved pulpit dates to around 1581.
As a result of the considerable population increase from the end of the 19th century, a number of new churches were built in various styles. Next to Aalborg Hall, Ansgar's Church with its tall tower was built in 1929 to a design by Hother August Paludan in a modern Baroque style. St Mark's Church (Sankt Markus Kirke), completed in 1933, was designed by Einar Packness. Its tower is crowned by an imposing spire. The Biblical figures known as the Johannes Group (based on Christ's meeting with John the Baptist in Matthew, Chapter 3) sculpted by Bertel Thorvaldsen are displayed around the interior. The Margrethe Church with its steeply sloping roof reaching is the work of Carlo Odgaard and Aaby Sørensen. Bent Exner designed some of the artefacts in the church including the crucifix over the altar.
Cemeteries
Aalborg's cemeteries have a history dating to the end of the Middle Ages. Sankt Jørgens Kirkegård (St George's Cemetery) was on the corner of Hasserisgade and Kirkegårdsgade. The site was chosen in a district outside the city as it provided isolation for those affected by the plague, many of whom died in the neighbouring hospice, Sankt Jørgens Gårde. In 1794, a new cemetery was opened in Klostermarken, immediately to the south of Sankt Jørgens Kirkegård. It was further extended in 1804, 1820 and 1870. It is now known as Aalborgs Almen Kirkegård (meaning "common cemetery") and contains the graves of many of the city's most notable citizens.
Judaism
Aalborg had a synagogue, built in 1854; and the Jewish rabbi Salomon Mielziner served it for 35 years. Services were no longer offered after Mielziner died, and in 1924 the synagogue was donated to the city government, which began using it to store the city archives (Stadsarkivet). It was burned down by the Schalburg Corps in April 1945 towards the end of World War II, destroying its centuries-old Torahs. Anti-semitism continues to exist in Denmark, and in 1999, an unlicensed Nazi radio station began operating from a neo-Nazi stronghold in Fynen, Nørresundby, within Aalborg municipality. The activity has been widely denounced with organized opposition in Aalborg and the rest of Denmark, and in February 1999, 12 anti-fascists were arrested for possession of explosives at their base in Fynen.
Education
The major university in Aalborg is the University of Aalborg, founded in 1974. It has more than 17,000 students and more than 3,000 employees. In 2012, 3,000 new students started at the university. In 1995 it merged with Esbjerg Engineering College. The university has attempted from the outset to "develop a more "relevant" form of education than was then being offered by the established universities". It has sought to develop what is known as "contextual knowledge", a form of problem-based learning based around the project work conducted by students, rather than the curriculum focusing on traditional academic disciplines.
The University College of Northern Denmark is one of seven new regional organisations (professionshøjskoler) of different study sites in Denmark offering courses normally at the bachelor level. The Royal School of Library and Information Science (RSLIS) provides higher education in library and information science; one of its two departments is in Aalborg. With about 4,500 students a year and 700 employees, Tech College Aalborg offers a wide spectrum of vocational training and runs Aalborg Tekniske Gymnasium. Aalborg Business College provides basic training in retail and trading for private enterprises and the public sector, with courses which cover information technology, economics, sales and communication, and languages.
The island of Egholm contains the former Egholm Skole, which was closed in 1972 when a ferry service to Aalborg was established and children on the island began attending the Vesterkæret Skole in Aalborg. Today the old school on Egholm is run as a school camp by the City of Aalborg, with 18 beds and facilities for 60 people. Skipper Clement International School is a private school for children between 6 and 16. The international department conducts its classes in English, the first to be established in the Jutland peninsula, but it does have department which educates in Danish, like the public schools in Denmark.
Sport
The city is home to Aalborg BK, established in 1885 and known as "AaB" for short. The club has won the Danish championship (Superliga) four times in recent years (1995, 1999, 2008, 2014). The team qualified for the group stages of the 1995–96 and 2008–09 UEFA Champions League seasons. Aalborg Chang is a Danish amateur association football club, previously known as FC Nordjylland.
Aalborg is also known for the women's handball club Aalborg DH, and the men's handball club Aalborg Håndbold. Established in 2001 and 2011, respectively, they both play their games in the Gigantium. Rugby in Aalborg is represented by Aalborg RK Lynet (Lightning), established in 1964. The city also has the Aalborg Cricket Club, which is part of the Danish Cricket League. They were established in 2000 and have players from various nations.
Aalborg Tennisklub is located along the Kastetvej road in the centre of Aalborg. About to the southwest of the city, near the hamlet of Restrup Enge, is Aalborg Golf Klub. Aalborg Golf Klub is the second oldest golf club in Denmark, and was originally established in 1908 in the eastern part of Aalborg. In 1929 it moved to Sohngaardsholm, but 30 years later the course had to again move because of developments with the university. The present course to the southwest of Aalborg was designed in 1968 by Graham Lockey and Commander John Harris as a 9-hole course, later expanded to 18 holes in 1976 and 27 in 2006. In 2010 the club hosted the European Girls Team Golf Championships. Another course, Ørnehoj Golfklub, is at the southeastern limits of the city, in the village of Gistrup.
On 11 September 1977, Aalborg hosted the Final of the Long Track World Championship for Motorcycle speedway. The Final was won by Swedish rider Anders Michanek. He defeated West Germany's Hans Seigl and Denmark's own speedway hero Ole Olsen.
Transport
On the north side of the Limfjord is Nørresundby, connected to Aalborg by the Limfjordsbroen road bridge, which was inaugurated in 1933, replacing a pontoon bridge which dated to 1865. The iron Limfjord Railway Bridge, inaugurated in 1938, is a nine-span bascule bridge. It opens 4,000 times a year, allowing around 10,000 vessels to sail under it. Opening in 1969 as the first motorway tunnel to be built in Denmark, the Limfjord Tunnel is long and has three lanes in each direction. It forms part of the E45, stretching from Alta, Norway, to Gela, Italy.
Aalborg Airport is northwest of the city centre. With its two runways, it has 20 direct routes to destinations in Denmark, Norway, Ireland, the Netherlands, the UK, Spain, and Turkey, along with seasonal flights to additional Spanish destinations and the Faroe Islands. Processing 1.4 million passengers a year, the airport is the third largest in Denmark. The Aalborg Air Base, an important Danish Air Force facility, occupies part of the extensive airport area. The Port of Aalborg is northern Denmark’s main import/export hub, operated by Aalborg Havn A/S on the Limfjord. Two additional private harbours serve the cement factory, Aalborg Portland A/S, and the power station, Vattenfall A/S.
The city's main train station, Aalborg Railway Station, is on John F. Kennedys Plads. It opened in 1869, when the Aalborg to Randers railway was inaugurated. The original station building was designed by N.P.C. Holsøe while the present building, which opened in 1902, was designed by Thomas Arboe. Aalborg Railway Station is operated by Banedanmark and DSB. Other rail stations in Aalborg are Skalborg Station, Aalborg Vestby Station and Lindholm Station. There are regular bus services covering the inner city as well as the wider urban area.
Cycling is also relatively popular in Aalborg. Statistics for 2012 indicate 44% of the population use their bicycles several times a week while 27% of the workforce cycle to work. The municipal authorities hope to increase the use of bicycles by providing better cycle tracks and parking facilities, as well as improved support services. City bikes are provided free of charge in Aalborg and Nørresundby from April to November with numerous stands throughout the area. There are plans to build a light rail system to serve Aalborg, similar to Odense Letbane and Aarhus Letbane.
Healthcare
Aalborg University Hospital, the largest in the north of Jutland, was founded in 1881. , it consists of two large buildings in Aalborg, the hospital in Dronninglund and smaller departments in Hobro and Hjørring. It is the largest employer in the area with around 6,500 on the payroll. The hospital has traditionally undertaken research but from the beginning of 2013 it has had a formal collaboration with Aalborg University. A new building, designed by schmidt hammer lassen architects and to be completed by 2020, will provide for hospital buildings and for the university's Faculty of Health. The Aalborg University Hospital, section south, is on Hobrovej and has a 24-hour emergency ward. The northern section is in Reberbanegade, which is in the western part of the city centre. Trænregimentet, the Danish regiment for army supply and emergency medical personnel, is also in Aalborg.
Media
Nordjyske Stiftstidende, published in Aalborg, is Denmark's second oldest newspaper founded in 1767 as Nyttige og fornøyelige Jydske Efterretninger. It was later known as Aalborg Stiftstidende (until 1999). In 1827, it merged with Aalborg's second newspaper Aalborgs Stifts Adresse-Avis. The paper now serves the whole of Vendsyssel and most of Himmerland and has local editions in Aalborg, Hjørring, Hobro, Frederikshavn, Fjerritslev, and Skagen and Brønderslev.
ANR (also Aalborg Nærradio and Alle Nordjyders Radio) is a local radio station operated by Nordjyske Medier, owner of Nordjyske Stiftstidende. The TV news channel, 24Nordjyske, is operated by the same firm.
Twin towns – sister cities
Aalborg practices twinning on the municipal level. For the twin towns, see twin towns of Aalborg Municipality.
Notable people
Among those who contributed to Aalborg's prosperity in the 19th century were Poul Pagh (1796–1870) who significantly developed trade and shipping, and Christen Winther Obel (1800-1860) who increased production at the C.W. Obel tobacco factory until it became the city's main employer. Another important figure of the times was Marie Rée (1835-1900) who ran the local newspaper Aalborg Stiftstidende until 1900, often promoting women's rights.
More recently, the actor and script-writer Preben Kaas (1930–1981), who was born in Aalborg, starred in over 50 Danish films. Among the city's many sporting figures, Peter Gade (born 1976) stands out as one of the world's most successful badminton players.
On the cultural side, Jørn Utzon (1918–2008), designer of the Sydney Opera House, grew up in Aalborg; the iconic Utzon Center which he inspired now serves as a museum for his architectural designs and offers courses of study based on his approach.
Gallery
References
Notes
Bibliography
External links
Satellite image from Google Maps
About Aalborg from Nordjyske Medier (local media group)
Aalborg Kommune (Aalborg Municipality's official website)
VisitAalborg (Aalborg Tourist Office)
Aalborg University
Aalborg University
Aalborg Cricket Club
Public Transport in Aalborg and surroundings
Aalborg Akvavit
Ålborgtårnet
Instagram Photos of Aalborg
Aalborg Carnival Information
Municipal seats of the North Jutland Region
Municipal seats of Denmark
Cities and towns in the North Jutland Region
Port cities and towns in Denmark
Port cities and towns of the North Sea
Viking Age populated places
Limfjord
Populated places established in the 1st millennium
Aalborg Municipality
|
20270
|
https://en.wikipedia.org/wiki/Motorola%2068000
|
Motorola 68000
|
The Motorola 68000 (sometimes shortened to Motorola 68k or m68k and usually pronounced "sixty-eight-thousand") is a 16/32-bit complex instruction set computer (CISC) microprocessor, introduced in 1979 by Motorola Semiconductor Products Sector.
The design implements a 32-bit instruction set, with 32-bit registers and a 16-bit internal data bus. The address bus is 24 bits and does not use memory segmentation, which made it easier to program for. Internally, it uses a 16-bit data arithmetic logic unit (ALU) and two more 16-bit ALUs used mostly for addresses, and has a 16-bit external data bus. For this reason, Motorola termed it a 16/32-bit processor.
As one of the first widely available processors with a 32-bit instruction set, and running at relatively high speeds for the era, the 68k was a popular design through the 1980s. It was widely used in a new generation of personal computers with graphical user interfaces, including the Macintosh, Amiga, Atari ST, and X68000. The 1988 Mega Drive console is also powered by a 68000.
The 68k was soon expanded with more family members, implementing full 32-bit ALUs as part of the growing Motorola 68000 series. The original 68k is generally software forward-compatible with the rest of the line despite being limited to a 16-bit wide external bus.
After in production, the 68000 architecture is still in use.
History
Motorola's first widely-produced CPU was the Motorola 6800. Although a capable design, it was eclipsed by more powerful designs, such as the Zilog Z80, and less expensive designs, such as the MOS Technology 6502 (MOS 6502). As the sales prospects of the 6800 dimmed, Motorola began a new design to replace it. This became the Motorola Advanced Computer System on Silicon project, or MACSS, begun in 1976.
The MACSS aimed to develop an entirely new architecture without backward compatibility with the 6800. It ultimately does retain a bus protocol compatibility mode for existing 6800 peripheral devices, and a version with an 8-bit data bus was produced. However, the designers mainly focused on the future, or forward compatibility, which gives the 68000 design a head start against later 32-bit instruction set architectures (ISAs). For instance, the CPU registers are 32 bits wide, though few self-contained structures in the processor itself operate on 32 bits at a time. The MACSS team drew heavily on the influence of minicomputer processor design, such as the PDP-11 and VAX systems, which are similarly microcode-based.
In the mid 1970s, the 8-bit microprocessor manufacturers raced to introduce the 16-bit generation. National Semiconductor had been first with its IMP-16 and PACE processors in 1973–1975, but these had issues with speed. Intel had worked on their advanced 16/32-bit Intel iAPX 432 (alias 8800) since 1975 and their Intel 8086 since 1976 (it was introduced in 1978 but became widespread in the form of the almost identical 8088 in the IBM PC a few years later). Arriving late to the 16-bit arena affords the new processor more transistors (roughly 40,000 active versus 20,000 active in the 8086), 32-bit macroinstructions, and acclaimed general ease of use.
The original MC68000 was fabricated using an HMOS process with a 3.5 µm feature size. Formally introduced in September 1979, initial samples were released in February 1980, with production chips available over the counter in November. Initial speed grades are 4, 6, and 8 MHz. 10 MHz chips became available during 1981, and 12.5 MHz chips by June 1982. The 16.67 MHz "12F" version of the MC68000, the fastest version of the original HMOS chip, was not produced until the late 1980s.
IBM considered the 68000 for the IBM PC but chose the Intel 8088 because the 68000 was not ready; Walden C. Rhines wrote that thus "Motorola, with its superior technology, lost the single most important design contest of the last 50 years". (IBM Instruments briefly sold the 68000-based IBM System 9000 laboratory computer systems.) The 68k instruction set is particularly well suited to implement Unix, and the 68000 and its successors became the dominant CPUs for Unix-based workstations including Sun workstations and Apollo/Domain workstations. The 68000 also is used for mass-market computers such as the Apple Lisa, Macintosh, Amiga, and Atari ST. The 68000 is used in Microsoft Xenix systems, as well as an early NetWare Unix-based Server. The 68000 is used in the first generation of desktop laser printers, including the original Apple Inc. LaserWriter and the HP LaserJet.
In 1981, Motorola introduced the Motorola 68000 Educational Computer Board, a single-board computer for educational and training purposes which in addition to the 68000 itself contained memory, I/O devices, programmable timer and wire-wrap area for custom circuitry. The board remained in use in US colleges as a tool for learning assembly programming until the early 1990s.
In 1982, the 68000 received a minor update to its instruction set architecture (ISA) to support virtual memory and to conform to the Popek and Goldberg virtualization requirements. The updated chip is called the 68010. It also adds a new "loop mode" which speeds up small loops, and increases overall performance by about 10% at the same clock speeds. A further extended version, which exposes 31 bits of the address bus, was also produced in small quantities as the 68012.
To support lower-cost systems and control applications with smaller memory sizes, Motorola introduced the 8-bit compatible MC68008, also in 1982. This is a 68000 with an 8-bit data bus and a smaller (20-bit) address bus. After 1982, Motorola devoted more attention to the 68020 and 88000 projects.
Second-sourcing
Several other companies were second-source manufacturers of the HMOS 68000. These included Hitachi (HD68000), who shrank the feature size to 2.7 µm for their 12.5 MHz version, Mostek (MK68000), Rockwell (R68000), Signetics (SCN68000), Thomson/SGS-Thomson (originally EF68000 and later TS68000), and Toshiba (TMP68000). Toshiba was also a second-source maker of the CMOS 68HC000 (TMP68HC000).
Encrypted variants of the 68000, being the Hitachi FD1089 and FD1094, store decryption keys for opcodes and opcode data in battery-backed memory and were used in certain Sega arcade systems including System 16 to prevent piracy and illegal bootleg games.
CMOS versions
The 68HC000, the first CMOS version of the 68000, was designed by Hitachi and jointly introduced in 1985. Motorola's version is called the MC68HC000, while Hitachi's is the HD68HC000. The 68HC000 offers speeds of 8–20 MHz. Except for using CMOS circuitry, it behaved identically to the HMOS MC68000, but the change to CMOS greatly reduced its power consumption. The original HMOS MC68000 consumed around 1.35 watts at an ambient temperature of 25 °C, regardless of clock speed, while the MC68HC000 consumed only 0.13 watts at 8 MHz and 0.38 watts at 20 MHz. (Unlike CMOS circuits, HMOS still draws power when idle, so power consumption varies little with clock rate.) Apple selected the 68HC000 for use in the Macintosh Portable.
Motorola replaced the MC68008 with the MC68HC001 in 1990. This chip resembles the 68HC000 in most respects, but its data bus can operate in either 16-bit or 8-bit mode, depending on the value of an input pin at reset. Thus, like the 68008, it can be used in systems with cheaper 8-bit memories.
The later evolution of the 68000 focused on more modern embedded control applications and on-chip peripherals. The 68EC000 chip and SCM68000 core remove the M6800 peripheral bus, and exclude the MOVE from SR instruction from user mode programs, making the 68EC000 and 68SEC000 the only 68000 CPUs not 100% object code compatible with previous 68000 CPUs when run in User Mode. When run in Supervisor Mode, there is no difference. In 1996, Motorola updated the standalone core with fully static circuitry, drawing only 2 µW in low-power mode, calling it the MC68SEC000.
Motorola ceased production of the HMOS MC68000 and MC68008 in 1996, but its spin-off company Freescale Semiconductor was still producing the MC68HC000, MC68HC001, MC68EC000, and MC68SEC000, as well as the MC68302 and MC68306 microcontrollers and later versions of the DragonBall family. The 68000's architectural descendants, the 680x0, CPU32, and Coldfire families, were also still in production. More recently, with the Sendai fab closure, all 68HC000, 68020, 68030, and 68882 parts have been discontinued, leaving only the 68SEC000 in production.
As a microcontroller core
Since being succeeded by "true" 32-bit microprocessors, the 68000 is used as the core of many microcontrollers. In 1989, Motorola introduced the MC68302 communications processor.
Applications
At its introduction, the 68000 was first used in high-priced systems, including multiuser microcomputers like the WICAT 150, early Alpha Microsystems computers, Sage II / IV, Tandy 6000 / TRS-80 Model 16, and Fortune 32:16; single-user workstations such as Hewlett-Packard's HP 9000 Series 200 systems, the first Apollo/Domain systems, Sun Microsystems' Sun-1, and the Corvus Concept; and graphics terminals like Digital Equipment Corporation's VAXstation 100 and Silicon Graphics' IRIS 1000 and 1200. Unix systems rapidly moved to the more capable later generations of the 68k line, which remained popular in that market throughout the 1980s.
By the mid-1980s, falling production cost made the 68000 viable for use in personal and home computers, starting with the Apple Lisa and Macintosh, and followed by the Commodore Amiga, Atari ST, and Sharp X68000. On the other hand, the Sinclair QL microcomputer was the most commercially important utilisation of the 68008, along with its derivatives, such as the ICL One Per Desk business terminal. Helix Systems (in Missouri, United States) designed an extension to the SWTPC SS-50 bus, the SS-64, and produced systems built around the 68008 processor.
While the adoption of RISC and x86 displaced the 68000 series as desktop/workstation CPU, the processor found substantial use in embedded applications. By the early 1990s, quantities of 68000 CPUs could be purchased for less than 30 USD per part.
Video game manufacturers used the 68000 as the backbone of many arcade games and home game consoles: Atari's Food Fight, from 1982, was one of the first 68000-based arcade games. Others included Sega's System 16, Capcom's CP System and CPS-2, and SNK's Neo Geo. By the late 1980s, the 68000 was inexpensive enough to power home game consoles, such as Sega's Mega Drive/Genesis console and also the Mega CD attachment for it (A Mega CD system has three CPUs, two of them 68000s). The 1993 multi-processor Atari Jaguar console used a 68000 as a support chip, although some developers used it as the primary processor due to familiarity. The 1994 multi-processor Sega Saturn console used the 68000 as a sound co-processor (much as the Mega Drive/Genesis uses the Z80 as a co-processor for sound and/or other purposes). By 1995 the 68000 had made it into a handheld game console, Sega's Genesis Nomad, as its main CPU.
Certain arcade games (such as Steel Gunner and others based on Namco System 2) use a dual 68000 CPU configuration, and systems with a triple 68000 CPU configuration also exist (such as Galaxy Force and others based on the Sega Y Board), along with a quad 68000 CPU configuration, which has been used by Jaleco (one 68000 for sound has a lower clock rate compared to the other 68000 CPUs) for games such as Big Run and Cisco Heat; another, fifth 68000 (at a different clock rate than the other 68000 CPUs) was used in the Jaleco arcade game Wild Pilot for input/output (I/O) processing.
The 68000 also saw great success as an embedded controller. As early as 1981, laser printers such as the Imagen Imprint-10 were controlled by external boards equipped with the 68000. The first HP LaserJet, introduced in 1984, came with a built-in 8 MHz 68000. Other printer manufacturers adopted the 68000, including Apple with its introduction of the LaserWriter in 1985, the first PostScript laser printer. The 68000 continued to be widely used in printers throughout the rest of the 1980s, persisting well into the 1990s in low-end printers.
The 68000 also saw success in the field of industrial control systems. Among the systems benefited from having a 68000 or derivative as their microprocessor were families of programmable logic controllers (PLCs) manufactured by Allen-Bradley, Texas Instruments and subsequently, following the acquisition of that division of TI, by Siemens. Users of such systems do not accept product obsolescence at the same rate as domestic users, and it is entirely likely that despite having been installed over 20 years ago, many 68000-based controllers will continue in reliable service well into the 21st century.
In a number of digital oscilloscopes from the 80s, the 68000 has been used as a waveform display processor; some models including the LeCroy 9400/9400A also use the 68000 as a waveform math processor (including addition, subtraction, multiplication, and division of two waveforms/references/waveform memories), and some digital oscilloscopes using the 68000 (including the 9400/9400A) can also perform fast Fourier transform functions on a waveform.
The 683XX microcontrollers, based on the 68000 architecture, are used in networking and telecom equipment, television set-top boxes, laboratory and medical instruments, and even handheld calculators. The MC68302 and its derivatives have been used in many telecom products from Cisco, 3com, Ascend, Marconi, Cyclades and others. Past models of the Palm PDAs and the Handspring Visor used the DragonBall, a derivative of the 68000. AlphaSmart used the DragonBall family in later versions of its portable word processors. Texas Instruments used the 68000 in its high-end graphing calculators, the TI-89 and TI-92 series and Voyage 200.
A modified version of the 68000 formed the basis of the IBM XT/370 hardware emulator of the System 370 processor.
Architecture
Address bus
The 68000 has a 24-bit external address bus and two byte-select signals "replaced" A0. These 24 lines can therefore address 16 MB of physical memory with byte resolution. Address storage and computation uses 32 bits internally; however, the 8 high-order address bits are ignored due to the physical lack of device pins. This allows it to run software written for a logically flat 32-bit address space, while accessing only a 24-bit physical address space. Motorola's intent with the internal 32-bit address space was forward compatibility, making it feasible to write 68000 software that would take full advantage of later 32-bit implementations of the 68000 instruction set.
However, this did not prevent programmers from writing forward incompatible software. "24-bit" software that discarded the upper address byte, or used it for purposes other than addressing, could fail on 32-bit 68000 implementations. For example, early (pre-7.0) versions of Apple's Mac OS used the high byte of memory-block master pointers to hold flags such as locked and purgeable. Later versions of the OS moved the flags to a nearby location, and Apple began shipping computers which had "32-bit clean" ROMs beginning with the release of the 1989 Mac IIci.
The 68000 family stores multi-byte integers in memory in big-endian order.
Internal registers
The CPU has eight 32-bit general-purpose data registers (D0-D7), and eight address registers (A0-A7). The last address register is the stack pointer, and assemblers accept the label SP as equivalent to A7. This was a good number of registers at the time in many ways. It was small enough to allow the 68000 to respond quickly to interrupts (even in the worst case where all 8 data registers D0–D7 and 7 address registers A0–A6 needed to be saved, 15 registers in total), and yet large enough to make most calculations fast, because they could be done entirely within the processor without keeping any partial results in memory. (Note that an exception routine in supervisor mode can also save the user stack pointer A7, which would total 8 address registers. However, the dual stack pointer (A7 and supervisor-mode A7') design of the 68000 makes this normally unnecessary, except when a task switch is performed in a multitasking system.)
Having the two types of registers allows one 32-bit address and one 16-bit data calculation to take place at the one time. This results in reduced instruction execution time as addresses and data can be processed in parallel.
Status register
The 68000 has a 16-bit status register. The upper 8 bits is the system byte, and modification of it is privileged. The lower 8 bits is the user byte, also known as the condition code register (CCR), and modification of it is not privileged. The 68000 comparison, arithmetic, and logic operations modify condition codes to record their results for use by later conditional jumps. The condition code bits are "zero" (Z), "carry" (C), "overflow" (V), "extend" (X), and "negative" (N). The "extend" (X) flag deserves special mention, because it is separate from the carry flag. This permits the extra bit from arithmetic, logic, and shift operations to be separated from the carry for flow-of-control and linkage.
Instruction set
The designers attempted to make the assembly language orthogonal. That is, instructions are divided into operations and address modes, and almost all address modes are available for almost all instructions. There are 56 instructions and a minimum instruction size of 16 bits. Many instructions and addressing modes are longer to include more address or mode bits.
Privilege levels
The CPU, and later the whole family, implements two levels of privilege. User mode gives access to everything except privileged instructions such as interrupt level controls. Supervisor privilege gives access to everything. An interrupt always becomes supervisory. The supervisor bit is stored in the status register, and is visible to user programs.
An advantage of this system is that the supervisor level has a separate stack pointer. This permits a multitasking system to use very small stacks for tasks, because the designers do not have to allocate the memory required to hold the stack frames of a maximum stack-up of interrupts.
Interrupts
The CPU recognizes seven interrupt levels. Levels 1 through 5 are strictly prioritized. That is, a higher-numbered interrupt can always interrupt a lower-numbered interrupt. In the status register, a privileged instruction allows setting the current minimum interrupt level, blocking lower or equal priority interrupts. For example, if the interrupt level in the status register is set to 3, higher levels from 4 to 7 can cause an exception. Level 7 is a level triggered non-maskable interrupt (NMI). Level 1 can be interrupted by any higher level. Level 0 means no interrupt. The level is stored in the status register, and is visible to user-level programs.
Hardware interrupts are signalled to the CPU using three inputs that encode the highest pending interrupt priority. A separate encoder is usually required to encode the interrupts, though for systems that do not require more than three hardware interrupts it is possible to connect the interrupt signals directly to the encoded inputs at the cost of more software complexity. The interrupt controller can be as simple as a 74LS148 priority encoder, or may be part of a very large-scale integration (VLSI) peripheral chip such as the MC68901 Multi-Function Peripheral (used in the Atari ST range of computers and Sharp X68000), which also provides a UART, timer, and parallel I/O.
The "exception table" (interrupt vector table interrupt vector addresses) is fixed at addresses 0 through 1023, permitting 256 32-bit vectors. The first vector (RESET) consists of two vectors, namely the starting stack address, and the starting code address. Vectors 3 through 15 are used to report various errors: bus error, address error, illegal instruction, zero division, CHK and CHK2 vector, privilege violation (to block privilege escalation), and some reserved vectors that became line 1010 emulator, line 1111 emulator, and hardware breakpoint. Vector 24 starts the real interrupts: spurious interrupt (no hardware acknowledgement), and level 1 through level 7 autovectors, then the 16 TRAP vectors, then some more reserved vectors, then the user defined vectors.
Since the starting code address vector must always be valid on reset, systems commonly included some nonvolatile memory (e.g. ROM) starting at address zero to contain the vectors and bootstrap code. However, for a general purpose system it is desirable for the operating system to be able to change the vectors at runtime. This was often accomplished by either pointing the vectors in ROM to a jump table in RAM, or through use of bank switching to allow the ROM to be replaced by RAM at runtime.
The 68000 does not meet the Popek and Goldberg virtualization requirements for full processor virtualization because it has a single unprivileged instruction, "MOVE from SR", which allows user-mode software read-only access to a small amount of privileged state. The 68EC000 and 68SEC000, which are later derivatives of the 68000, do meet the requirements as the "MOVE from SR" instruction is privileged. The same change was introduced on the 68010 and later CPUs.
The 68000 is also unable to easily support virtual memory, which requires the ability to trap and recover from a failed memory access. The 68000 does provide a bus error exception which can be used to trap, but it does not save enough processor state to resume the faulted instruction once the operating system has handled the exception. Several companies did succeed in making 68000-based Unix workstations with virtual memory that worked by using two 68000 chips running in parallel on different phased clocks. When the "leading" 68000 encountered a bad memory access, extra hardware would interrupt the "main" 68000 to prevent it from also encountering the bad memory access. This interrupt routine would handle the virtual memory functions and restart the "leading" 68000 in the correct state to continue properly synchronized operation when the "main" 68000 returned from the interrupt.
These problems were fixed in the next major revision of the 68k architecture with the release of the MC68010. The Bus Error and Address Error exceptions push a large amount of internal state onto the supervisor stack in order to facilitate recovery, and the "MOVE from SR" instruction was made privileged. A new unprivileged "MOVE from CCR" instruction is provided for use in its place by user mode software; an operating system can trap and emulate user mode "MOVE from SR" instructions if desired.
Instruction set details
The standard addressing modes are:
Register direct
data register, e.g. "D0"
address register, e.g. "A0"
Register indirect
Simple address, e.g. (A0)
Address with post-increment, e.g. (A0)+
Address with pre-decrement, e.g. −(A0)
Address with a 16-bit signed offset, e.g. 16(A0)
Register indirect with index register & 8-bit signed offset e.g. 8(A0,D0) or 8(A0,A1)
Note that for (A0)+ and −(A0), the actual increment or decrement value is dependent on the operand size: a byte access adjusts the address register by 1, a word by 2, and a long by 4.
PC (program counter) relative with displacement
Relative 16-bit signed offset, e.g. 16(PC). This mode was very useful for position-independent code.
Relative with 8-bit signed offset with index, e.g. 8(PC,D2)
Absolute memory location
Either a number, e.g. "$4000", or a symbolic name translated by the assembler
Most 68000 assemblers used the "$" symbol for hexadecimal, instead of "0x" or a trailing H.
There were 16 and 32-bit versions of this addressing mode
Immediate mode
Data stored in the instruction, e.g. "#400"
Quick immediate mode
3-bit unsigned (or 8-bit signed with moveq) with value stored in opcode
In addq and subq, 0 is the equivalent to 8
e.g. moveq #0,d0 was quicker than clr.l d0 (though both made D0 equal to 0)
Plus: access to the status register, and, in later models, other special registers.
Most instructions have dot-letter suffixes, permitting operations to occur on 8-bit bytes (".b"), 16-bit words (".w"), and 32-bit longs (".l").
Like many CPUs of its era the cycle timing of some instructions varied depending on the source operand(s). For example, the unsigned multiply instruction takes (38+2n) clock cycles to complete where 'n' is equal to the number of bits set in the operand. To create a function that took a fixed cycle count required the addition of extra code after the multiply instruction. This would typically consume extra cycles for each bit that wasn't set in the original multiplication operand.
Most instructions are dyadic, that is, the operation has a source, and a destination, and the destination is changed. Notable instructions were:
Arithmetic: ADD, SUB, MULU (unsigned multiply), MULS (signed multiply), DIVU, DIVS, NEG (additive negation), and CMP (a sort of comparison done by subtracting the arguments and setting the status bits, but did not store the result)
Binary-coded decimal arithmetic: ABCD, NBCD, and SBCD
Logic: EOR (exclusive or), AND, NOT (logical not), OR (inclusive or)
Shifting: (logical, i.e. right shifts put zero in the most-significant bit) LSL, LSR, (arithmetic shifts, i.e. sign-extend the most-significant bit) ASR, ASL, (rotates through eXtend and not) ROXL, ROXR, ROL, ROR
Bit test and manipulation in memory or data register: BSET (set to 1), BCLR (clear to 0), BCHG (invert) and BTST (no change). All of these instructions first test the destination bit and set (clear) the CCR Z bit if the destination bit is 0 (1), respectively.
Multiprocessing control: TAS, test-and-set, performed an indivisible bus operation, permitting semaphores to be used to synchronize several processors sharing a single memory
Flow of control: JMP (jump), JSR (jump to subroutine), BSR (relative address jump to subroutine), RTS (return from subroutine), RTE (return from exception, i.e. an interrupt), TRAP (trigger a software exception similar to software interrupt), CHK (a conditional software exception)
Branch: Bcc (where the "cc" specified one of 14 tests of the condition codes in the status register: equal, greater than, less-than, carry, and most combinations and logical inversions, available from the status register). The remaining two possible conditions (always true and always false) have separate instruction mnemonics, BRA (branch always), and BSR (branch to subroutine).
Decrement-and-branch: DBcc (where "cc" was as for the branch instructions), which, provided the condition was false, decremented the low word of a D-register and, if the result was not -1 ($FFFF), branched to a destination. This use of −1 instead of 0 as the terminating value allowed the easy coding of loops that had to do nothing if the count was 0 to start with, with no need for another check before entering the loop. This also facilitated nesting of DBcc.
68EC000
The 68EC000 is a low-cost version of the 68000 with a slightly different pinout, designed for embedded controller applications. The 68EC000 can have either a 8-bit or 16-bit data bus, switchable at reset.
The processors are available in a variety of speeds including 8 and 16 MHz configurations, producing 2,100 and 4,376 Dhrystones each. These processors have no floating-point unit, and it is difficult to implement an FPU coprocessor (MC68881/2) with one because the EC series lacks necessary coprocessor instructions.
The 68EC000 was used as a controller in many audio applications, including Ensoniq musical instruments and sound cards, where it was part of the MIDI synthesizer. On Ensoniq sound boards, the controller provided several advantages compared to competitors without a CPU on board. The processor allowed the board to be configured to perform various audio tasks, such as MPU-401 MIDI synthesis or MT-32 emulation, without the use of a terminate-and-stay-resident program. This improved software compatibility, lowered CPU usage, and eliminated host system memory usage.
The Motorola 68EC000 core was later used in the m68k-based DragonBall processors from Motorola/Freescale.
It also was used as a sound controller in the Sega Saturn game console and as a controller for the HP JetDirect Ethernet controller boards for the mid-1990s HP LaserJet printers.
Example code
The 68000 assembly code below is for a subroutine named , which copies a null-terminated string of 8-bit characters to a destination string, converting all alphabetic characters to lower case.
The subroutine establishes a call frame using register A6 as the frame pointer. This kind of calling convention supports reentrant and recursive code and is typically used by languages like C and C++. The subroutine then retrieves the parameters passed to it ( and ) from the stack. It then loops, reading an ASCII character (one byte) from the string, checking whether it is a capital alphabetic character, and if so, converting it into a lower-case character, otherwise leaving it as it is, then writing the character into the string. Finally, it checks whether the character was a null character; if not, it repeats the loop, otherwise it restores the previous stack frame (and A6 register) and returns. Note that the string pointers (registers A0 and A1) are auto-incremented in each iteration of the loop.
In contrast, the code below is for a stand-alone function, even on the most restrictive version of AMS for the TI-89 series of calculators, being kernel-independent, with no values looked up in tables, files or libraries when executing, no system calls, no exception processing, minimal registers to be used, nor the need to save any. It is valid for historical Julian dates from 1 March 1 AD, or for Gregorian ones. In less than two dozen operations it calculates a day number compatible with ISO 8601 when called with three inputs stored at their corresponding LOCATIONS:
;
; WDN, an address - for storing result d0
; FLAG, 0 or 2 - to choose between Julian or Gregorian, respectively
; DATE, year0mda - date stamp as binary word&byte&byte in basic ISO-format
;(YEAR, year ~ YEAR=DATE due to big-endianness)
;
;
; Apply step 1 - Lachman's congruence
;
; Apply step 2 - Finding spqr as the year of the Julian leap day preceding DATE
;
; (Apply step 0 - Gregorian adjustment)
;
;
;
; Days of the week correspond to day numbers of the week as:
; Sun=0 Mon=1 Tue=2 Wed=3 Thu=4 Fri=5 Sat=6
;
See also
Motorola 68000 series
Motorola 6800 – an 8-bit predecessor
DTACK Grounded – an early 68000 newsletter
References
Further reading
Datasheets and manuals
M68000 Microprocessor Users Manual (Rev 8); Motorola (Freescale); 224 pages; 1994.
M68000 Microprocessors User's Manual (9th Edition); NXP; 189 pages; 1993.
Addendum to M68000 User Manual (Rev 0); Motorola (Freescale); 26 pages; 1997.
M68000 Family Programmer's Reference Manual; Motorola (Freescale); 646 pages; 1991; .
Books
68000, 68010, 68020 Primer; 1st Ed; Stan Kelly-Bootle and Bob Fowler; Howard Sams & Co; 370 pages; 1985; . (archive)
Mastering The 68000 Microprocessor; 1st Ed; Phillip Robinson; Tab Books; 244 pages; 1985; . (archive)
Pocket Guide Assembly Language for the 68000 Series; 1st Ed; Robert Erskine; Pitman Publishing; 70 pages; 1984; . (archive)
Motorola M68000 die schematics
68000 Machine Code Programming (68000, 68008, 68010, & 68020 Processors); 1st Ed; David Barrow; Collins Professional and Technical Books; 234 pages; 1985; .
External links
comp.sys.m68k FAQ
Descriptions of assembler instructions
68000 images and descriptions at cpu-collection.de
EASy68K, an open-source 68k assembler for Windows
the 68k and m88k resource – with information on Motorola's VME based 68k boards
68k microprocessors
Instruction set architectures
Computer-related introductions in 1979
32-bit microprocessors
|
45210316
|
https://en.wikipedia.org/wiki/Signal%20%28software%29
|
Signal (software)
|
Signal is a cross-platform centralized encrypted instant messaging service developed by the non-profit Signal Technology Foundation and Signal Messenger LLC. Users can send one-to-one and group messages, which can include files, voice notes, images and videos. It can also be used to make one-to-one and group voice and video calls, and the Android version can optionally function as an SMS app.
Signal uses standard cellular telephone numbers as identifiers and secures all communications to other Signal users with end-to-end encryption. The client software includes mechanisms by which users can independently verify the identity of their contacts and the integrity of the data channel.
Signal's software is free and open-source. Its mobile clients are published under the GPL-3.0-only license, while the desktop client and server are published under the AGPL-3.0-only license. The official Android app generally uses the proprietary Google Play Services (installed on most Android devices), though it is designed to still work without them installed. Signal also has an official client app for iOS and desktop programs for Windows, macOS and Linux (although registration requires an iOS or Android device).
The non-profit Signal Foundation was launched in February 2018 with initial funding of $50 million from Brian Acton. , Signal had more than 105 million total downloads, and the platform had approximately 40 million monthly active users. Signal has been installed on more than 50 million Android devices.
History
2010–2013: Origins
Signal is the successor of the RedPhone encrypted voice calling app and the TextSecure encrypted texting program. The beta versions of RedPhone and TextSecure were first launched in May 2010 by Whisper Systems, a startup company co-founded by security researcher Moxie Marlinspike and roboticist Stuart Anderson. Whisper Systems also produced a firewall and tools for encrypting other forms of data. All of these were proprietary enterprise mobile security software and were only available for Android.
In November 2011, Whisper Systems announced that it had been acquired by Twitter. Neither company disclosed the financial terms of the deal. The acquisition was done "primarily so that Mr. Marlinspike could help the then-startup improve its security". Shortly after the acquisition, Whisper Systems' RedPhone service was made unavailable. Some criticized the removal, arguing that the software was "specifically targeted [to help] people under repressive regimes" and that it left people like the Egyptians in "a dangerous position" during the events of the Egyptian revolution of 2011.
Twitter released TextSecure as free and open-source software under the GPLv3 license in December 2011. RedPhone was also released under the same license in July 2012. Marlinspike later left Twitter and founded Open Whisper Systems as a collaborative Open Source project for the continued development of TextSecure and RedPhone.
2013–2018: Open Whisper Systems
Open Whisper Systems' website was launched in January 2013.
In February 2014, Open Whisper Systems introduced the second version of their TextSecure Protocol (now Signal Protocol), which added end-to-end encrypted group chat and instant messaging capabilities to TextSecure. Toward the end of July 2014, they announced plans to merge the RedPhone and TextSecure applications as Signal. This announcement coincided with the initial release of Signal as a RedPhone counterpart for iOS. The developers said that their next steps would be to provide TextSecure instant messaging capabilities for iOS, unify the RedPhone and TextSecure applications on Android, and launch a web client. Signal was the first iOS app to enable end-to-end encrypted voice calls for free. TextSecure compatibility was added to the iOS application in March 2015.
From its launch in May 2010 until March 2015, the Android version of Signal (then called TextSecure) included support for encrypted SMS/MMS messaging. From version 2.7.0 onward, the Android application only supported sending and receiving encrypted messages via the data channel. Reasons for this included security flaws of SMS/MMS and problems with the key exchange. Open Whisper Systems' abandonment of SMS/MMS encryption prompted some users to create a fork named Silence (initially called SMSSecure) that is meant solely for the exchange of encrypted SMS and MMS messages.
In November 2015, the TextSecure and RedPhone applications on Android were merged to become Signal for Android. A month later, Open Whisper Systems announced Signal Desktop, a Chrome app that could link with a Signal mobile client. At launch, the app could only be linked with the Android version of Signal. On September 26, 2016, Open Whisper Systems announced that Signal Desktop could now be linked with the iOS version of Signal as well. On October 31, 2017, Open Whisper Systems announced that the Chrome app was deprecated. At the same time, they announced the release of a standalone desktop client (based on the Electron framework) for Windows, macOS and certain Linux distributions.
On October 4, 2016, the American Civil Liberties Union (ACLU) and Open Whisper Systems published a series of documents revealing that OWS had received a subpoena requiring them to provide information associated with two phone numbers for a federal grand jury investigation in the first half of 2016. Only one of the two phone numbers was registered on Signal, and because of how the service is designed, OWS was only able to provide "the time the user's account had been created and the last time it had connected to the service". Along with the subpoena, OWS received a gag order requiring OWS not to tell anyone about the subpoena for one year. OWS approached the ACLU, and they were able to lift part of the gag order after challenging it in court. OWS said it was the first time they had received a subpoena, and that they were committed to treat "any future requests the same way".
In March 2017, Open Whisper Systems transitioned Signal's calling system from RedPhone to WebRTC, also adding the ability to make video calls with the mobile apps.
2018–present: Signal Technology Foundation
On 21 February 2018, Moxie Marlinspike and WhatsApp co-founder Brian Acton announced the formation of the Signal Technology Foundation, a 501(c)(3) nonprofit organization whose mission is "to support, accelerate, and broaden Signal's mission of making private communication accessible and ubiquitous". Acton started the foundation with $50 million in funding and became the foundation's executive chairman after leaving WhatsApp's parent company Facebook in September 2017. Marlinspike continued as Signal Messenger's first CEO. , Signal ran entirely on donations, as a nonprofit.
Between November 2019 and February 2020, Signal added iPad support, view-once images and videos, stickers, and reactions. They also announced plans for a new group messaging system and an "experimental method for storing encrypted contacts in the cloud."
Signal was reportedly popularized in the United States during the George Floyd protests. Heightened awareness of police monitoring led protesters to use the platform to communicate. Black Lives Matter organizers had used the platform "for several years". During the first week of June, the encrypted messaging app was downloaded over five times more than it had been during the week prior to the murder of George Floyd. In June 2020, Signal Foundation announced a new feature that enables users to blur faces in photos, in response to increased federal efforts to monitor protesters.
On 7 January 2021, Signal saw a surge in new user registrations, which temporarily overwhelmed Signal's capacity to deliver account verification messages. CNN and MacRumors linked the surge with a WhatsApp privacy policy change and a Signal endorsement by Elon Musk and Edward Snowden via Twitter. International newspapers reported similar trends in the United Arab Emirates. Reuters reported that more than 100,000 people had installed Signal between 7 and 8 January.
Between 12 and 14 January 2021, the number of Signal installations listed on Google Play increased from over 10 million to over 50 million.
On 15 January 2021, due to the surge of new users, Signal was overwhelmed with the new traffic and was down for all users. On the afternoon of 16 January, Signal announced via Twitter that service had been restored.
On January 10, 2022, Moxie Marlinspike announced that he was stepping down from his role as CEO of Signal Messenger. He continues to remain on the Signal Foundation's board of directors and Brian Acton has volunteered to serve as interim CEO during the search for a new CEO.
Usage numbers
Signal's userbase started in May 2010, when its predecessor TextSecure was launched by Whisper Systems. According to App Annie, Signal had approximately 20 million monthly active users at the end of December 2020. In January 2022, the BBC reported that Signal was used by over 40 million people.
Features
Signal allows users to make one-to-one and group voice and video calls with up to 40 people on iOS, Android, and desktop. All calls are made over a Wi-Fi or data connection and (with the exception of data fees) are free of charge, including long distance and international. Signal also allows users to send text messages, files, voice notes, pictures, GIFs, and video messages over a Wi-Fi or data connection to other Signal users on iOS, Android and a desktop program. The platform also supports group messaging.
All communications between Signal users are automatically end-to-end encrypted (the encryption keys are generated and stored on the phones, not on the servers). To verify that a correspondent is really the person that they claim to be, Signal users can compare key fingerprints (or scan QR codes) out-of-band. The platform employs a trust-on-first-use mechanism in order to notify the user if a correspondent's key changes.
On Android, users can opt into making Signal the default SMS/MMS application, allowing them to send and receive unencrypted SMS messages in addition to the standard end-to-end encrypted Signal messages. Users can then use the same application to communicate with contacts who do not have Signal. Sending a message unencrypted is also available as an override between Signal users.
TextSecure allowed the user to set a passphrase that encrypted the local message database and the user's encryption keys. This did not encrypt the user's contact database or message timestamps. The Signal applications on Android and iOS can be locked with the phone's pin, passphrase, or biometric authentication. The user can define a "screen lock timeout" interval, providing an additional protection mechanism in case the phone is lost or stolen.
Signal also allows users to set timers to messages. After a specified time interval, the messages will be deleted from both the sender's and the receivers' devices. The time interval can be between five seconds and one week long, and the timer begins for each recipient once they have read their copy of the message. The developers have stressed that this is meant to be "a collaborative feature for conversations where all participants want to automate minimalist data hygiene, not for situations where your contact is your adversary".
Signal excludes users' messages from non-encrypted cloud backups by default.
Signal allows users to automatically blur faces of people in photos to protect their identities.
Signal also includes a cryptocurrency wallet functionality that allows users to store, send and receive in-app payments. Apart from certain regions and countries, the feature was enabled globally in November 2021. , the only supported payment method is MobileCoin.
Limitations
Signal requires that the user provides a phone number for verification, eliminating the need for user names or passwords and facilitating contact discovery (see below). The number does not have to be the same as on the device's SIM card; it can also be a VoIP number or a landline as long as the user can receive the verification code and have a separate device to set up the software. A number can only be registered on one mobile device at a time. Account registration requires an iOS or Android device.
This mandatory connection to a phone number (a feature Signal shares with WhatsApp, KakaoTalk, and others) has been criticized as a "major issue" for privacy-conscious users who are not comfortable with giving out their private phone number. A workaround is to use a secondary phone number. The ability to choose a public, changeable username instead of sharing one's phone number is a widely-requested feature.
Using phone numbers as identifiers may also create security risks that arise from the possibility of an attacker taking over a phone number.
Usability
In July 2016, the Internet Society published a user study that assessed the ability of Signal users to detect and deter man-in-the-middle attacks. The study concluded that 21 out of 28 participants failed to correctly compare public key fingerprints in order to verify the identity of other Signal users, and that the majority of these users still believed they had succeeded, while in reality they failed. Four months later, Signal's user interface was updated to make verifying the identity of other Signal users simpler.
Architecture
Encryption protocols
Signal messages are encrypted with the Signal Protocol (formerly known as the TextSecure Protocol). The protocol combines the Double Ratchet Algorithm, prekeys, and an Extended Triple Diffie–Hellman (X3DH) handshake. It uses Curve25519, AES-256, and HMAC-SHA256 as primitives. The protocol provides confidentiality, integrity, authentication, participant consistency, destination validation, forward secrecy, backward secrecy ( future secrecy), causality preservation, message unlinkability, message repudiation, participation repudiation, and asynchronicity. It does not provide anonymity preservation, and requires servers for the relaying of messages and storing of public key material.
The Signal Protocol also supports end-to-end encrypted group chats. The group chat protocol is a combination of a pairwise double ratchet and multicast encryption. In addition to the properties provided by the one-to-one protocol, the group chat protocol provides speaker consistency, out-of-order resilience, dropped message resilience, computational equality, trust equality, subgroup messaging, as well as contractible and expandable membership.
In October 2014, researchers from Ruhr University Bochum published an analysis of the Signal Protocol. Among other findings, they presented an unknown key-share attack on the protocol, but in general, they found that it was secure. In October 2016, researchers from UK's University of Oxford, Queensland University of Technology in Australia, and Canada's McMaster University published a formal analysis of the protocol. They concluded that the protocol was cryptographically sound. In July 2017, researchers from Ruhr University Bochum found during another analysis of group messengers a purely theoretic attack against the group protocol of Signal: A user who knows the secret group ID of a group (due to having been a group member previously or stealing it from a member's device) can become a member of the group. Since the group ID cannot be guessed and such member changes are displayed to the remaining members, this attack is likely to be difficult to carry out without being detected.
, the Signal Protocol has been implemented into WhatsApp, Facebook Messenger, Skype, and Google Allo, making it possible for the conversations of "more than a billion people worldwide" to be end-to-end encrypted. In Google Allo, Skype and Facebook Messenger, conversations are not encrypted with the Signal Protocol by default; they only offer end-to-end encryption in an optional mode.
Up until March 2017, Signal's voice calls were encrypted with SRTP and the ZRTP key-agreement protocol, which was developed by Phil Zimmermann. In March 2017, Signal transitioned to a new WebRTC-based calling system that introduced the ability to make video calls. Signal's voice and video calling functionalities use the Signal Protocol channel for authentication instead of ZRTP.
Authentication
To verify that a correspondent is really the person that they claim to be, Signal users can compare key fingerprints (or scan QR codes) out-of-band. The platform employs a trust on first use mechanism in order to notify the user if a correspondent's key changes.
Local storage
Once the messages are received and decrypted on a user's device, they are stored locally in a SQLite database that is encrypted with SQLCipher. The key to decrypt this database is also stored locally on the user's device and can be accessed if the device is unlocked. In December 2020, Cellebrite published a blog post announcing that one of their products could now access this key and use it to "decrypt the Signal app". Technology reporters later published articles about how Cellebrite had claimed to have the ability to "break into the Signal app" and "crack Signal's encryption". This latter interpretation was rejected by several experts, as well as representatives from Signal, who said the original post by Cellebrite had been about accessing data on "an unlocked Android phone in their physical possession" and that they "could have just opened the app to look at the messages". Similar extraction tools also exist for iOS devices and Signal Desktop.
Servers
Signal relies on centralized servers that are maintained by Signal Messenger. In addition to routing Signal's messages, the servers also facilitate the discovery of contacts who are also registered Signal users and the automatic exchange of users' public keys. By default, Signal's voice and video calls are peer-to-peer. If the caller is not in the receiver's address book, the call is routed through a server in order to hide the users' IP addresses.
Contact discovery
The servers store registered users' phone numbers, public key material and push tokens which are necessary for setting up calls and transmitting messages. In order to determine which contacts are also Signal users, cryptographic hashes of the user's contact numbers are periodically transmitted to the server. The server then checks to see if those match any of the SHA256 hashes of registered users and tells the client if any matches are found. The hashed numbers are thereafter discarded from the server. In 2014, Moxie Marlinspike wrote that it is easy to calculate a map of all possible hash inputs to hash outputs and reverse the mapping because of the limited preimage space (the set of all possible hash inputs) of phone numbers, and that a "practical privacy preserving contact discovery remains an unsolved problem." In September 2017, Signal's developers announced that they were working on a way for the Signal client applications to "efficiently and scalably determine whether the contacts in their address book are Signal users without revealing the contacts in their address book to the Signal service."
Metadata
All client-server communications are protected by TLS. Signal's developers have asserted that their servers do not keep logs about who called whom and when. In June 2016, Marlinspike told The Intercept that "the closest piece of information to metadata that the Signal server stores is the last time each user connected to the server, and the precision of this information is reduced to the day, rather than the hour, minute, and second".
The group messaging mechanism is designed so that the servers do not have access to the membership list, group title, or group icon. Instead, the creation, updating, joining, and leaving of groups is done by the clients, which deliver pairwise messages to the participants in the same way that one-to-one messages are delivered.
Federation
Signal's server architecture was federated between December 2013 and February 2016. In December 2013, it was announced that the messaging protocol Signal uses had successfully been integrated into the Android-based open-source operating system CyanogenMod. Since CyanogenMod 11.0, the client logic was contained in a system app called WhisperPush. According to Signal's developers, the Cyanogen team ran their own Signal messaging server for WhisperPush clients, which federated with the main server, so that both clients could exchange messages with each other. The WhisperPush source code was available under the GPLv3 license. In February 2016, the CyanogenMod team discontinued WhisperPush and recommended that its users switch to Signal. In May 2016, Moxie Marlinspike wrote that federation with the CyanogenMod servers had degraded the user experience and held back development, and that their servers will probably not federate with other servers again.
In May 2016, Moxie Marlinspike requested that a third-party client called LibreSignal not use the Signal service or the Signal name. As a result, on 24 May 2016 the LibreSignal project posted that the project was "abandoned". The functionality provided by LibreSignal was subsequently incorporated into Signal by Marlinspike.
Licensing
The complete source code of the Signal clients for Android, iOS and desktop is available on GitHub under a free software license. This enables interested parties to examine the code and help the developers verify that everything is behaving as expected. It also allows advanced users to compile their own copies of the applications and compare them with the versions that are distributed by Signal Messenger. In March 2016, Moxie Marlinspike wrote that, apart from some shared libraries that are not compiled with the project build due to a lack of Gradle NDK support, Signal for Android is reproducible. Signal's servers are partially open source, but the server software's anti-spam component is proprietary and closed source due to security concerns.
Reception
Security
In October 2014, the Electronic Frontier Foundation (EFF) included Signal in their updated surveillance self-defense guide. In November 2014, Signal received a perfect score on the EFF's secure messaging scorecard; it received points for having communications encrypted in transit, having communications encrypted with keys the provider does not have access to (end-to-end encryption), making it possible for users to independently verify their correspondents' identities, having past communications secure if the keys are stolen (forward secrecy), having the code open to independent review (open source), having the security designs well-documented, and having a recent independent security audit. At the time, "ChatSecure + Orbot", Pidgin (with OTR), Silent Phone, and Telegram's optional "secret chats" also received seven out of seven points on the scorecard.
Former NSA contractor Edward Snowden has endorsed Signal on multiple occasions. In his keynote speech at SXSW in March 2014, he praised Signal's predecessors (TextSecure and RedPhone) for their ease of use. In December 2014, Der Spiegel leaked slides from an internal NSA presentation dating to June 2012 in which the NSA deemed Signal's encrypted voice calling component (RedPhone) on its own as a "major threat" to its mission of accessing users' private data, and when used in conjunction with other privacy tools such as Cspace, Tor, Tails, and TrueCrypt was ranked as "catastrophic" and led to a "near-total loss/lack of insight to target communications [and] presence".
Following the 2016 Democratic National Committee email leak, it was reported by Vanity Fair that Marc Elias (the general counsel for Hillary Clinton's presidential campaign) had instructed DNC staffers to exclusively use Signal when saying anything negative about Republican presidential nominee Donald Trump.
In March 2017, Signal was approved by the sergeant at arms of the U.S. Senate for use by senators and their staff.
On the 27 September 2019, Natalie Silvanovich, a security engineer working in Google's vulnerability research team at Project Zero, disclosed how a bug in the Android Signal client could let an attacker spy on a user without their knowledge. The bug allowed an attacker to phone a target device, mute the call, and the call would complete - keeping the audio open but without the owner being aware of that (however they would still be aware of a ring and / or a vibration from the initial call). The bug was fixed the same day that it was reported and patched in release 4.47.7 of the app for Android.
In February 2020, the European Commission recommended that its staff use Signal. Following the George Floyd protests, which began in May 2020, Signal was downloaded 121,000 times in the U.S. between 25 May and 4 June. In July 2020, Signal became the most downloaded app in Hong Kong on both the Apple App Store and the Google Play Store after the passage of the Hong Kong national security law.
, Signal is a contact method for securely providing tips to major news outlets such as The Washington Post, The Guardian, The New York Times, and The Wall Street Journal.
In-app payments
In April 2021, Signal announced the addition of a cryptocurrency wallet feature that would allow users to send and receive payments in MobileCoin. This received criticism from security expert Bruce Schneier, who had previously praised the software. Schneier stated that this would bloat the client and attract unwanted attention from the authorities. The wallet functionality was initially only available in certain countries, but was later enabled globally in November 2021.
Blocking
In December 2016, Egypt blocked access to Signal. In response, Signal's developers added domain fronting to their service. This allows Signal users in a specific country to circumvent censorship by making it look like they are connecting to a different internet-based service. , Signal's domain fronting is enabled by default in Egypt, the United Arab Emirates, Oman, Qatar, and Iran.
, Signal was blocked in Iran. Signal's domain fronting feature relies on the Google App Engine (GAE) service. This does not work in Iran because Google has blocked Iranian access to GAE in order to comply with U.S. sanctions.
In early 2018, Google App Engine made an internal change to stop domain fronting for all countries. Due to this issue, Signal made a public change to use Amazon CloudFront for domain fronting. However, AWS also announced that they would be making changes to their service to prevent domain fronting. As a result, Signal said that they would start investigating new methods/approaches. Signal switched from AWS back to Google in April 2019.
In January 2021, Iran removed the app from app stores, and blocked Signal. Signal was later blocked by China in March 2021.
Audience
Use by activists
In March 2021, the United Nations recommended Myanmar residents use Signal and ProtonMail to pass and preserve evidence of human rights violations committed during the 2021 coup.
The far right right-wing militias and white nationalists used Signal for organizing their actions including the Unite the Right II rally in 2018.
Use by criminals
By design, Signal is not able to read user messages, which precludes attempts at moderation. This has been confirmed by independent audits of Signal's algorithms. According to CNN, "[t]he same technology that keeps a conversation private between you and a family member also gives a safe haven to a terrorist in Syria and the person in the United States he's trying to recruit to commit an act of mass murder."
In 2016, authorities in India arrested members of a suspected ISIS-affiliated terrorist cell that communicated via Signal and Telegram.
Developers and funding
The development of Signal and its predecessors at Open Whisper Systems was funded by a combination of consulting contracts, donations and grants. The Freedom of the Press Foundation acted as Signal's fiscal sponsor. Between 2013 and 2016, the project received grants from the Knight Foundation, the Shuttleworth Foundation, and almost $3 million from the US government–sponsored Open Technology Fund. Signal is now developed by Signal Messenger LLC, a software company founded by Moxie Marlinspike and Brian Acton in 2018, which is wholly owned by a tax-exempt nonprofit corporation called the Signal Technology Foundation, also created by them in 2018. The Foundation was funded with an initial loan of $50 million from Acton, "to support, accelerate, and broaden Signal's mission of making private communication accessible and ubiquitous". All of the organization's products are published as free and open-source software.
See also
Comparison of instant messaging clients
Comparison of VoIP software
Internet privacy
List of video telecommunication services and product brands
Secure communication
Notes
References
Bibliography
External links
Cross-platform software
Cryptographic software
Free and open-source Android software
Free instant messaging clients
Free security software
Free software programmed in Java (programming language)
Free VoIP software
Instant messaging clients programmed in Java
Internet privacy software
IOS software
Secure communication
|
26316973
|
https://en.wikipedia.org/wiki/Mobile%20phone%20industry%20in%20Japan
|
Mobile phone industry in Japan
|
The Japanese mobile phone industry is one of the most advanced in the world. As of July 31, 2013 there were 139,180,300 mobile phones in use in Japan. This is 110 percent of Japan's total population according to the Ministry of Internal Affairs and Communications.
In Japanese, are often referred to as simply or for short.
History
In the year 1979, Nippon Telegraph and Telephone (NTT) launched the world's first first generation (1G) mobile phone service in Tokyo as a car phone.
In 1985, NTT offered Japan's first mobile phone service, called the "Shoulder Phone."
In 1988, Mobile Communication Group, which later was absorbed into KDDI, started mobile phone service
In 1993, NTT Docomo started its first digital mobile phone service (2G), using a Time division multiple access (TDMA) variant called Personal Digital Cellular.
In 1994, Digital Phone Group and Tu-Ka Group, both of which later became SoftBank Mobile, started mobile phone service. In the same year, DDI Pocket, a subsidiary of KDDI, started PHS mobile phone service.
In 1999, NTT Docomo started i-mode Internet service.
In 2001, NTT Docomo premiered the world's first Third Generation mobile phone service (3G), using W-CDMA technology called FOMA.
In 2002, KDDI started 3G service in Okinawa, using CDMA2000 technology. In the same year, J-Phone started 3G service using W-CDMA technology.
In 2003, J-Phone changed its name to Vodafone.
In 2006, Vodafone Japan was purchased by SoftBank and renamed to SoftBank Mobile. In the same year, MNP (Mobile Number Portability) was introduced.
In 2007, Japanese regulator introduced new guideline for unbundling new handset price and service plan.
In 2010, SoftBank Mobile stopped all non-3G services, focusing on 3G service only.
In 2012, NTT Docomo stopped 2G services, which also made its car phone service to end.
Providers
There are four cellular service operators in Japan.
NTT Docomo
DoCoMo was spun off in 1991 from Nippon Telegraph and Telephone (NTT), NTT Docomo first offered its second-generation service known as Personal Digital Cellular (PDC). It now offers a 3G service using W-CDMA technology known as FOMA. The company is operating a world band W-CDMA network at 2100 MHz. As of February 2019, the number of subscribers is 79 million.
KDDI
KDDI was formed by the merger of KDD (International phone service operator), DDI (nationwide CDMA operator except for Kanto and Tokai area), and IDO (CDMA operator for Kanto and Tokai area) in 2000. They offer the au mobile phone service: its second generation service, using CDMA technology, and 3G service, using CDMA2000. Their operating bands are 800 MHz and 2100 MHz. As of March 2016, there are 46 million subscribers.
SoftBank Mobile
Softbank Mobile is a subsidiary of Softbank. Softbank purchased Vodafone Japan at $15b in 2006. Softbank Mobile now offers 3G, 4G and 5G services using W-CDMA technology at 2100 MHz. Softbank Mobile was also the exclusive service provider of Apple's iPhone in Japan until November 2011. As of March 2016, there were 40 million subscribers.
Y!mobile
Y!mobile, formerly EMOBILE, is the most recent entrant into the 3G market. Beginning in 2005, it has provided 3G data and voice service coverage to 90% of the Japanese population through its own network and a roaming agreement with NTT Docomo. Their band is 1700 MHz which is not compatible with other area's W-CDMA phone. As of December 2013, the projected subscriber base was over 10 million subscribers.
Industry
The Japanese mobile phone market is known for its extremely competitive and saturated market, which, combined with a complex regulatory environment, has led to growing consolidation among manufacturers and providers alike.
Mobile telecommunications operating licenses are administered by the Ministry of Internal Affairs and Communications. In Japan, there have never been band license auctions. Usually MIC issues operating licenses by just paper checking.
Collaboration by the various companies can be seen at the Yokosuka Research Park, near NTT's Yokosuka R&D Center, where many manufacturers have research and development laboratories offices. An outdoor testing site is also located there.
Since the introduction of new regulations about unbundling service plan and handset prices in 2008, the Japanese handset market has shrunk. At its peak in 2007, the total handset shipping amount was roughly 52M units. However, the number for 2009 was roughly 32M units. This caused a serious recession for the handset industry and a consolidation of companies due to the reliance which handset vendors had on the Japanese market.
Japan's PHS technology has been exported to China, Taiwan, and other countries. NTT Docomo's i-mode web technology had been used by Australia's Telstra, Russia's Mobile TeleSystems, UK's O2 and a few other mobile service providers overseas. NTT has been one of the main contributors to the 3G W-CDMA standard. NTT Docomo collaborated with AT&T Mobility to set up a 3G-compatible mobile phone network in Hawaii.
Handsets
Manufacturers
The following manufacturers have marketed and sold handsets within Japan:
Japanese
Fujitsu (including Toshiba)
Kyocera
NEC-Casio (NEC/Casio/Hitachi)
Panasonic
Sharp
Sony
NTT Docomo
Non-Japanese
Apple
BlackBerry Limited
HTC
Huawei
Lenovo (including Motorola)
LG Electronics
Samsung
Xiaomi
ZTE
Sanyo Electric, although formerly an independent manufacturer of handsets, sold its handset business to Kyocera in 2008. Mitsubishi Electric exited the mobile phone market in April 2008. Nokia discontinued development of mobile phones for the Japanese market in 2009. The DoCoMo M702iS, released in December 2006, was the last Motorola phone launched in Japan until their return to the market in 2011.
Japanese manufacturers have had difficulty marketing their phones overseas. In 2009, out of all Japanese handset manufacturers, Sony Ericsson (now called Sony Mobile) sold the most handsets worldwide (after non-Japanese Nokia, Samsung, LG Electronics and Motorola); domestically, Sharp sold one quarter of the Japanese market, followed by Fujitsu, Panasonic, NEC and Kyocera.
Operating system
Japan's mobile phones traditionally used the ITRON operating system, but as the functions become more complex, they moved over to more generally used operating systems, such as Symbian OS, Embedded Linux, Windows Mobile and Android. Most handsets on the market today use Android or iOS.
Language input
Input on mobile phones is performed using hiragana, katakana, kanji, and alphanumeric characters. A character mode function allows the user to select from among these types of character input. Kanji characters are selected by first inputting hiragana, then the characters. Kana characters are laid out on the mobile phone keys in the 50 character table format: A-column characters on 1 key, Ka-column characters on the 2 key, etc.
The alphabetic character mode allows input of Roman characters; however, English-language word prediction (such as T9) is rarely implemented in Japanese handsets. Support for other languages and character sets, such as French, Russian (Cyrillic), and Chinese (both traditional and simplified characters), is not standard on handsets from domestic manufacturers.
Other characteristics
The Japanese are known for their development of and to express emotions in email messages. A large number and variety of emoji and kaomoji are available on handsets. Foreign manufacturers (such as Apple), in order to ensure compatibility with Japanese-made handsets, have introduced emoji on their handsets around the world. Gmail and other email services have also introduced emoji that can be sent and received from mobile handsets as well as computers.
Unique business practices
All handsets sold in Japan were formerly "locked" for use in Japan only, due to the demands of service providers. Likewise, providers also refused to sell USIM cards by themselves without a handset or for a handset brought in from overseas, although NTT DoCoMo has recently relaxed this business practice. In accordance with the recommendations of the Ministry of Internal Affairs and Communications' mobile business consultative committee, some Japanese phone manufacturers began to produce unlocked handsets in 2011. Sharp, Fujitsu, NEC and Panasonic now offer a number of unlocked handsets.
See also
Japanese mobile phone culture
Telecommunications in Japan
Mobile phone industry in China
Mobile phone industry in Russia
Mobile phone industry in India
Mobile phone industry in South Korea
Mobile phone industry in the United States
References
Telecommunications in Japan
Japan
|
4594185
|
https://en.wikipedia.org/wiki/Clipboard%20%28computing%29
|
Clipboard (computing)
|
The clipboard is a buffer that some operating systems provide for short-term storage and transfer within and between application programs. The clipboard is usually temporary and unnamed, and its contents reside in the computer's RAM.
The clipboard provides an application programming interface by which programs can specify cut, copy and paste operations. It is left to the program to define methods for the user to command these operations, which may include keybindings and menu selections. When an element is copied or cut, the clipboard must store enough information to enable a sensible result no matter where the element is pasted. Application programs may extend the clipboard functions that the operating system provides. A clipboard manager may give the user additional control over the clipboard. Specific clipboard semantics vary among operating systems, can also vary between versions of the same system, and can sometimes be changed by programs and by user preferences.
Windows, Linux and macOS support a single clipboard transaction.
History
Clipboards as buffers for small text snippets were first used by Pentti Kanerva when he used it to store deleted texts in order to restore them. Since one could delete a text in one place and restore it in another, the term "delete" wasn't what one would expect in this case. Larry Tesler renamed this in 1973 as cut, copy, and paste and coined the term "clipboard" for this buffer, since these techniques need a clipboard for temporary saving the copied or cut data.
Data formats
Applications communicate through the clipboard by providing either serialized representations of an object, or a promise (for larger objects). In some circumstances, the transfer of certain common data formats may be achieved opaquely through the use of an abstract factory; for example, Mac OS X uses a class called NSImage to provide access to image data stored on the clipboard, though the actual format of the image data backing the object is hidden. The sending and receiving application negotiate the formats which can be transferred in between them, oftentimes with the active GUI widget responsible for providing acceptable type transformations. The pasteboard allows for transfer of common items such as URLs, colors, images, strings, attributed strings (Rich text), and sounds. The operating system and GUI toolkit may provide some common conversions, for example converting from rich text to plain text and vice versa. Various type identifiers for data transfer are supported by modern operating systems, which may automatically provide acceptable mappings between type systems, such as between MIME and Uniform Type Identifier.
Computer security
Clipboard hijacking is an exploit in which a person's clipboard's content is replaced by malicious data, such as a link to a malicious web site. While some security-holes were patched, JavaScript can still be used to modify clipboard content via an attack dubbed 'pastejacking'. Dylan Ayrey who developed the attack set up a website that demonstrates how this exploit can be used to trick a user into running commands they didn't want to run.
There have been exploits where web pages grab clipboard data. In early 2013 researchers exposed risks stemming from Android-based password managers and documented how passwords in 21 of the most popular of these apps could be accessed by any other app on an Android device including those with extremely low-level privileges. Joe Siegrist notes that this is an "OS-level issue that impacts everything running on Android".
Clipboard management and extensions
Clipboard manager extensions add functionality to the integrated clipboard functions of an operating system. They are applications that enable the user to manipulate the clipboard. On platforms such as Linux that use multiple incompatible GUI toolkits, clipboard managers are often used to transfer data between applications using different such frameworks.
When a clipboard manager provides multiple cut and paste transactions, the clipboard is treated as a stack or scrap book, with new cuts and copies being placed on a list of recent transactions. The standard paste operation copies the most recent transaction, while specialized pastes provide access to the other stored transactions. These managers generally also provide a window that displays the transaction history and allows the user to select earlier copies, edit them, change their format and even search amongst them.
Since most operating systems (e.g. Windows, macOS, Linux, X11, Android, iOS) do not save the clipboard contents to any persistent storage – when a user logs out or reboots the system the clipboard contents are deleted – an added functionality is to save the clipboard persistently. Another example is making the local clipboard work with online applications by saving the clipboard data to the online location upon a copy or cut event, making this data available to online applications for pasting. Clipboard managers can also serve as tools to overcome the limitation of software not supporting copying and pasting (for example, while logging into remote Windows server, one cannot copy and paste their user name and password).
Operating system-specific clipboards
Microsoft Windows and ReactOS
The clipboard in Microsoft Windows and ReactOS holds one item in multiple available formats.
Every item has at least one clipboard format, but can have different types of format of the same data. The three different types of possible formats are:
standard formats (e.g. CF_BITMAP, or CF_UNICODETEXT),
registered formats (e.g. CF_HTML)
private formats for internal use
Up to and including Windows XP the clipboard could be accessed via the ClipBook Viewer application. In newer versions of Windows the content can be accessed via clipboard managers.
Data can be stored to the Windows and ReactOS clipboard via command line using the clip command:
$ # to paste the content of a folder to the clipboard:
$ dir | clip
The clipboard can also be accessed via PowerShell:
# to paste the content of a directory to the clipboard
Set-Clipboard -Path "C:\directory\"
# to get the content of the clipboard
Get-Clipboard
Apple macOS
The clipboard in Apple macOS holds one item in multiple available formats.
The contents of the clipboard can be viewed by selecting the Show Clipboard menu item from the Finder's Edit menu. The raw data and the stored formats can be seen using the ClipboardViewer.
Using the following commands the clipboard can be accessed from the command line:
$ # to copy data into the clipboard:
$ echo 'hello world' | pbcopy
$ # to paste from the clipboard:
$ pbpaste
hello world
X Window System
The X Window System commonly used on Unix and Linux systems provides three clipboards, which are named "PRIMARY", "SECONDARY" and "CLIPBOARD".
The usage and handling of various selections is not standardized. However, most modern toolkits and desktop environments, such as GNOME or KDE, follow a widely accepted convention, outlined in the freedesktop.org specification. One selection, CLIPBOARD, is used for traditional clipboard semantics, with shortcuts identical to Windows. Another selection, PRIMARY, is an X11-specific mechanism. Data is "copied" immediately upon highlighting and pasted with the third (middle) mouse button. This copied data is usually separated from the CLIPBOARD selection and does not change its contents. SECONDARY was planned as an alternative to PRIMARY but is only used inconsistently.
There are two command line tools (xsel and xclip) which can access the clipboard:
$ # to paste standard output to the clipboard using xclip
$ echo text | xclip -in -selection clipboard
$ # to paste standard output to the clipboard using xsel
$ echo text | xsel --clipboard
The main difference to OS X and Windows is that no data is actually stored in the CLIPBOARD-clipboard but only the reference to the copied or cut data. The application claims the ownership of the CLIPBOARD selection and communicates its ownership to the X Server. When pasting this data, the data and its available formats are requested from the application that owns the CLIPBOARD selection.
AmigaOS
The Amiga operating system uses 256 units, so one has multiple clipboards at the same time.
Android
Android provides a clipboard that can hold up to one clip object and is accessible system-wide. Simple text is stored directly in the clipboard; complex data are stored by reference. The clip object has one of three formats: text string, URI object, or intent.
To interact with the clipboard, an app uses the class ClipboardManager and system calls to cut, copy, and paste objects.
In Android 8.0, the clipboard first appears in the user interface: In a situation where the user prepares to paste from the clipboard, a "Clipboard" option appears that gives the user access to many objects copied or cut to the clipboard in the past. Apart from that, and in earlier versions, the user has no access to the clipboard except in apps that make it available to the user.
Apple iOS
The clipboard is called "pasteboard" in iOS similar to OS X. Apps on this operating system can create additional pasteboards, called instances of the UIPasteboard class, which can be public or private. One instance can hold a single item or multiple items in different formats.
The formats are identified by Uniform Type Identifiers (UTI).
The data contained in the pasteboard cannot be accessed via the GUI but only from the system and applications.
APIs
Applications can access the clipboard or its data via APIs.
JavaScript
In JavaScript a class which detects changes in the users clipboard data (ClipboardEvent) and functions to alter the content of a clipboard or read from it (clipboardData.getData(), clipboardData.setData()) exist, but aren't supported by every browser since altering the clipboard of a user can represent a security issue.
Qt
In Qt a wrapper for every supported platform exists. It provides access to window system clipboards with the use of the class QClipboard. This class facilitates access to common data types by functions. The data type of the element stored in the clipboard is indicated via MIME and MIME data can also be put in the clipboard with help of functions from this class.
See also
Clipboard manager
Cut, copy, and paste
References
Further reading
External links
clip | Microsoft Docs
2. Peer-to-Peer Communication by Means of Selections in the ICCCM
Windows Dev Center: Transferring Shell Objects with Drag-and-Drop and the Clipboard
Microsoft Developer Network: How the Clipboard Works, Part 1
Microsoft Developer Network: How the Clipboard Works, Part 2
Microsoft Developer Network: Delayed Rendering of Clipboard Data
User interface techniques
|
8506329
|
https://en.wikipedia.org/wiki/Nested%20RAID%20levels
|
Nested RAID levels
|
Nested RAID levels, also known as hybrid RAID, combine two or more of the standard RAID levels (where "RAID" stands for "redundant array of independent disks") to gain performance, additional redundancy or both, as a result of combining properties of different standard RAID layouts.
Nested RAID levels are usually numbered using a series of numbers, where the most commonly used levels use two numbers. The first number in the numeric designation denotes the lowest RAID level in the "stack", while the rightmost one denotes the highest layered RAID level; for example, RAID 50 layers the data striping of RAID 0 on top of the distributed parity of RAID 5. Nested RAID levels include RAID 01, RAID 10, RAID 100, RAID 50 and RAID 60, which all combine data striping with other RAID techniques; as a result of the layering scheme, RAID 01 and RAID 10 represent significantly different nested RAID levels.
(RAID 0+1)
RAID 01, also called RAID 0+1, is a RAID level using a mirror of stripes, achieving both replication and sharing of data between disks. The usable capacity of a RAID 01 array is the same as in a RAID 1 array made of the same drives, in which one half of the drives is used to mirror the other half. , where is the total number of drives and is the capacity of the smallest drive in the array.
At least four disks are required in a standard RAID 01 configuration, but larger arrays are also used.
(RAID 0+3)
RAID 03, also called RAID 0+3 and sometimes RAID 53, is similar to RAID 01 with the exception that byte-level striping with dedicated parity is used instead of mirroring.
(RAID 1+0)
RAID 10, also called RAID 1+0 and sometimes RAID 1&0, is similar to RAID 01 with an exception that the two used standard RAID levels are layered in the opposite order; thus, RAID 10 is a stripe of mirrors.
RAID 10, as recognized by the storage industry association and as generally implemented by RAID controllers, is a RAID 0 array of mirrors, which may be two- or three-way mirrors, and requires a minimum of four drives. However, a nonstandard definition of "RAID 10" was created for the Linux MD driver; Linux "RAID 10" can be implemented with as few as two disks. Implementations supporting two disks such as Linux RAID 10 offer a choice of layouts. Arrays of more than four disks are also possible.
According to manufacturer specifications and official independent benchmarks, in most cases RAID 10 provides better throughput and latency than all other RAID levels except RAID 0 (which wins in throughput). Thus, it is the preferable RAID level for I/O-intensive applications such as database, email, and web servers, as well as for any other use requiring high disk performance.
(RAID 5+0)
RAID 50, also called RAID 5+0, combines the straight block-level striping of RAID 0 with the distributed parity of RAID 5. As a RAID 0 array striped across RAID 5 elements, minimal RAID 50 configuration requires six drives. On the right is an example where three collections of 120 GB RAID 5s are striped together to make 720 GB of total storage space.
One drive from each of the RAID 5 sets could fail without loss of data; for example, a RAID 50 configuration including three RAID 5 sets can tolerate three maximum potential simultaneous drive failures (but only one per RAID 5 set). Because the reliability of the system depends on quick replacement of the bad drive so the array can rebuild, it is common to include hot spares that can immediately start rebuilding the array upon failure. However, this does not address the issue that the array is put under maximum strain reading every bit to rebuild the array at the time when it is most vulnerable.
RAID 50 improves upon the performance of RAID 5 particularly during writes, and provides better fault tolerance than a single RAID level does. This level is recommended for applications that require high fault tolerance, capacity and random access performance. As the number of drives in a RAID set increases, and the capacity of the drives increase, this impacts the fault-recovery time correspondingly as the interval for rebuilding the RAID set increases.
(RAID 6+0)
RAID 60, also called RAID 6+0, combines the straight block-level striping of RAID 0 with the distributed double parity of RAID 6, resulting in a RAID 0 array striped across RAID 6 elements. It requires at least eight disks.
(RAID 10+0)
RAID 100, sometimes also called RAID 10+0, is a stripe of RAID 10s. This is logically equivalent to a wider RAID 10 array, but is generally implemented using software RAID 0 over hardware RAID 10. Being "striped two ways", RAID 100 is described as a "plaid RAID".
Comparison
The following table provides an overview of some considerations for nested RAID levels. In each case:
Space efficiency is given as an expression in terms of the number of drives, ; this expression designates a fractional value between zero and one, representing the fraction of the sum of the drives' capacities that is available for use. For example, if three drives are arranged in RAID 3, this gives an array space efficiency of ; thus, if each drive in this example has a capacity of 250 GB, then the array has a total capacity of 750 GB but the capacity that is usable for data storage is only 500 GB. It is sometimes necessary to use in place of due to the inherent nature of the configuration (of use in RAID 10). Fault tolerance uses for representation, in place of , in certain Nested RAID levels (see below for fault tolerance calculation). is the number of disks in each mirror, rather than the total number of disks.
Fault tolerance is the number of drive failures allowed, where min is the guaranteed number of failures the RAID can handle and max is the maximum possible without guaranteed failure.
Failure rate is given as an expression in terms of the number of drives, (or the number of disks in each mirror, in some cases), and the drive failure rate, (which is assumed identical and independent for each drive) and can be seen to be a Bernoulli trial. For example, if each of three drives has a failure rate of 5% over the next three years, and these drives are arranged in RAID 3, then this gives an array failure rate over the next three years of:
See also
Non-RAID drive architectures
Non-standard RAID levels
Notes
References
Further reading
RAID
|
22202617
|
https://en.wikipedia.org/wiki/OpenHPSDR
|
OpenHPSDR
|
The OpenHPSDR (High Performance Software Defined Radio) project dates from 2005 when Phil Covington, Phil Harman, and Bill Tracey combined their separate projects to form the HPSDR group. It is built around a modular concept which encourages experimentation with new techniques and devices (e.g. SDR, Envelope Elimination and Restoration) without the need to replace the entire set of boards. The project has expanded from the original group, and several additional people have been involved in recent HPSDR module designs.
The core modules of the project are the Atlas passive backplane, the Ozy interface which provides a USB 2.0 data channel between the HPSDR system and the host PC, and the Mercury and Penelope receiver and exciter boards, which use high speed ADCs and DACs for direct conversion of received or transmitted signals in the DC to 55 MHz frequency range.
Mercury has attracted wide interest within the HPSDR community as a general-coverage, high performance, HF receiver. It uses a 16-bit 135MSPS analog-to-digital converter that provides performance over the range 0 to 55 MHz comparable to that of a conventional analog HF radio. The receiver will also operate in the VHF and UHF range using either mixer image or alias responses. The host computer uses DSP techniques to process the digital bitstream it receives from the HPSDR system. Currently, the HPSDR hardware has been interfaced with the Flex-Radio PowerSDR Windows-based software, which is licensed under the GPL.
As of February, 2011, the following HPSDR modules have been released:
Atlas backplane
Magister control board
Janus I/Q interface board
Mercury Direct Down-conversion receiver
LPU linear power supply
Pandora enclosure
Excalibur frequency reference board
PennyWhistle 20 watt RF power amplifier
Hercules 100 watt RF power amplifier
Metis 1Gigbit (1000T) PC interface board
Other modules nearing release include:
Alex RX/TX filter bank
Replaced by newer modules:
Ozy USB control board (replaced by Magister)
Penelope Direct Up-conversion exciter (replaced by PennyLane, not provided by TAPR but by new commercial organisation)
In cooperation with the HPSDR group, TAPR has provided (or will provide) all the modules listed above. Most have been made available as either fully assembled units or as bare circuit boards; a few are available as kits of parts.
Several other modules are under development. A web site and Wiki provide further information about the HPSDR projects.
.
The HPSDR project is open-source for software and uses a combination of licenses for the hardware.
Spin-off hardware
There are many complete transceivers that are based on the OpenHPSDR concept:
Anan-10
Anan-100
Anan-100D
Anan-200D
Anan-7000DLE
Anan-8000DLE
See also
Universal Software Radio Peripheral
Software-defined radio
Digital radio
References
Software-defined radio
Amateur radio transceivers
|
1597811
|
https://en.wikipedia.org/wiki/Meanings%20of%20minor%20planet%20names%3A%2022001%E2%80%9323000
|
Meanings of minor planet names: 22001–23000
|
22001–22100
|-id=002
| 22002 Richardregan || || Richard Regan, American mentor of a finalist in the 2005 Discovery Channel Young Scientist Challenge (DCYSC) (Src) ||
|-id=003
| 22003 Startek || || Jennifer Startek, Canadian-born mentor of a finalist in the 2005 Discovery Channel Young Scientist Challenge (DCYSC) (Src) ||
|-id=005
| 22005 Willnelson || || William Nelson, American mentor of a finalist in the 2005 Discovery Channel Young Scientist Challenge (DCYSC) (Src) ||
|-id=010
| 22010 Kuzmina || || Anastasiya Kuzmina (born 1984) is a Russian-born Slovak biathlete who has represented Slovakia since December 2008. She is the first biathlete to win gold medals in three consecutive Winter Olympics (2010 Vancouver, 2014 Sochi and 2018 Pyeongchang). ||
|-id=032
| 22032 Mikekoop || || Michael Walter Koop (born 1961), long-time president of the San Jose (California) Astronomical Association, is an electrical engineer by profession. His expertise in telecommunications has often been applied to meteors, observed from the ground and from aircraft ||
|-id=038
| 22038 Margarshain || || Margaret Shain, American mentor of a finalist in the 2005 Discovery Channel Young Scientist Challenge (DCYSC) (Src) ||
|-id=057
| 22057 Brianking || || Brian King, American mentor of a finalist in the 2005 Discovery Channel Young Scientist Challenge (DCYSC) (Src) ||
|-id=063
| 22063 Dansealey || || Dan Sealey, American mentor of a finalist in the 2005 Discovery Channel Young Scientist Challenge (DCYSC) (Src) ||
|-id=064
| 22064 Angelalewis || || Angela Lewis, American mentor of a finalist in the 2005 Discovery Channel Young Scientist Challenge (DCYSC) (Src) ||
|-id=065
| 22065 Colgrove || || Clinton Allen Colgrove, American mentor of a finalist in the 2005 Discovery Channel Young Scientist Challenge (DCYSC) (Src) ||
|-id=079
| 22079 Kabinoff || || Richard Kabinoff, American mentor of a finalist in the 2005 Discovery Channel Young Scientist Challenge (DCYSC) (Src) ||
|-id=080
| 22080 Emilevasseur || || Emile Levasseur, American mentor of a finalist in the 2005 Discovery Channel Young Scientist Challenge (DCYSC) (Src) ||
|-id=082
| 22082 Rountree || || Robert Rountree, American mentor of a finalist in the 2005 Discovery Channel Young Scientist Challenge (DCYSC) (Src) ||
|}
22101–22200
|-id=102
| 22102 Karenlamb || || Karen Lamb, mentor of a finalist in the 2005 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. † ||
|-id=105
| 22105 Pirko || || Richard G. Pirko (1952–2008) was a producer and space science educator for the Ward Beecher Planetarium at Youngstown State University. An accomplished photographer, pilot and horse trainer, his passion for astronomy exposed many college students to new educational experiences ||
|-id=106
| 22106 Tomokoarai || || Tomoko Arai (born 1971), a scientist at the Chiba Institute of Technology. ||
|-id=109
| 22109 Loriehutch || || Lorie Hutchinson, mentor of a finalist in the 2005 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. † ||
|-id=112
| 22112 Staceyraw || || Stacey Raw, mentor of a finalist in the 2005 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. † ||
|-id=120
| 22120 Gaylefarrar || || Gayle Farrar, mentor of a finalist in the 2005 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. † ||
|-id=132
| 22132 Merkley || || Clark Merkley, mentor of a finalist in the 2005 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. † ||
|-id=134
| 22134 Kirian || || Drew Kirian, mentor of a finalist in the 2005 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. † ||
|-id=136
| 22136 Jamesharrison || || James Christopher Harrison (born 1936) is an Australian blood plasma donor whose unusual plasma composition has been used to make a treatment for Rhesus disease. His 1000 donations throughout his lifetime are estimated to have saved over two million unborn babies from the condition. ||
|-id=137
| 22137 Annettelee || || Annette Lee, mentor of a finalist in the 2005 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. † ||
|-id=138
| 22138 Laynrichards || || Layne Richards, mentor of a finalist in the 2005 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. † ||
|-id=139
| 22139 Jamescox || || James Cox, mentor of a finalist in the 2005 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. † ||
|-id=140
| 22140 Suzyamamoto || || Suzanne Yamamoto, mentor of a finalist in the 2005 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. † ||
|-id=142
| 22142 Loripryor || || Lori Pryor, mentor of a finalist in the 2005 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. † ||
|-id=143
| 22143 Cathyfowler || || Cathy Fowler, mentor of a finalist in the 2005 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. † ||
|-id=144
| 22144 Linmichaels || || Linda Michaels, mentor of a finalist in the 2005 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. † ||
|-id=146
| 22146 Samaan || || Fida Samaan, mentor of a finalist in the 2005 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. † ||
|-id=148
| 22148 Francislee || || Francis Lee, mentor of a finalist in the 2005 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. † ||
|-id=151
| 22151 Davebracy || || Dave Bracy, mentor of a finalist in the 2005 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. † ||
|-id=152
| 22152 Robbennett || || Robbie Bennett, mentor of a finalist in the 2005 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. † ||
|-id=153
| 22153 Kathbarnhart || || Kathy Barnhart, mentor of a finalist in the 2005 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. † ||
|-id=155
| 22155 Marchetti || || David Marchetti, mentor of a finalist in the 2005 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. † ||
|-id=156
| 22156 Richoffman || || Richard Hoffman, mentor of a finalist in the 2005 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. † ||
|-id=157
| 22157 Bryanhoran || || Bryan Horan, mentor of a finalist in the 2005 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. † ||
|-id=158
| 22158 Chee || || Carmelita Chee, mentor of a finalist in the 2005 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. † ||
|-id=161
| 22161 Santagata || || William Santagata, mentor of a finalist in the 2005 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. † ||
|-id=162
| 22162 Leslijohnson || || Leslie Johnson, mentor of a finalist in the 2005 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. † ||
|-id=165
| 22165 Kathydouglas || || Kathy Douglas, mentor of a finalist in the 2005 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. † ||
|-id=167
| 22167 Lane-Cline || || Amanda Lane-Cline, mentor of a finalist in the 2005 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. † ||
|-id=168
| 22168 Weissflog || || Jens Weißflog, the "Fichtelberg flea", German ski jumper ||
|-id=171
| 22171 Choi || || Diane Jeehea Choi, American finalist in the 2006 Intel Science Talent Search (ISTS), for her behavioral and social sciences project. ||
|-id=173
| 22173 Myersdavis || || Myers Abraham Davis, American finalist in the 2006 Intel Science Talent Search (ISTS), for his computer science project. ||
|-id=174
| 22174 Allisonmae || || Allison Mae Gardner, American finalist in the 2006 Intel Science Talent Search (ISTS), for her zoology project. ||
|-id=177
| 22177 Saotome || || Masatoshi Saotome, Japanese director of the Japan Space Forum and contributor to the construction of the Bisei Spaceguard Center ||
|-id=183
| 22183 Canonlau || || Canon Lau (born 1965), a veteran amateur astronomer in Hong Kong since the 1980s, has put tremendous efforts into planetary observations and imaging. ||
|-id=184
| 22184 Rudolfveltman || || Rudolf Veltman (1951–2009) was a founding member of the Dutch Meteor Society. Because of a diving accident, he was paralyzed and wheelchair bound. Undeterred, he became leader of the DMS's visual meteor section and wrote articles about meteor showers and visual meteor observations for the society's journal Radiant ||
|-id=185
| 22185 Štiavnica || || Banská Štiavnica, Slovakia, UNESCO World Heritage List site and birthplace of the second discoverer ||
|-id=189
| 22189 Gijskatgert || 2049 P-L || Gijs Katgert (1981–2011), Dutch physicist and son of Leiden astronomers Peter and Jet Katgert, was one of the pioneers of the research on the flow properties of foams. ||
|-id=190
| 22190 Stellakwee || 2100 P-L || Stella Vooren Kwee (1964–2005) was the daughter of Leiden astronomer K. K. Kwee and his wife, Sunny Kwee. ||
|-id=191
| 22191 Achúcarro || 2113 P-L || Joaquí Achúcarro, distinguished concert pianist, admired teacher and mentor, with a performance career spanning over 50 years in more than 50 countries. ||
|-id=192
| 22192 Vivienreuter || 2571 P-L || Vivien Reuter, IAU Executive Assistant from 2008 March until 2012 October, heading the IAU Secretariat in Paris. ||
|-id=195
| 22195 Nevadodelruiz || 3509 P-L || Nevado del Ruiz, 5389-m active volcano in Colombia, situated in Colombias Cordillera Central, a part of the Andes. ||
|-id=199
| 22199 Klonios || 4572 P-L || Klonios, one of the four Pelasgian Epeioi kings during the Trojan war ||
|}
22201–22300
|-id=203
| 22203 Prothoenor || 6020 P-L || Prothoenor, a hero from Boeotia in the fight against Troy, as were Klonios and Arkesilaos. ||
|-id=222
| 22222 Hodios || 3156 T-2 || The Greek herald Hodios went together with the other Greek herald Eurybates, Odysseus and Phoenix to persuade Achilles to stop his quarrel with Agamemnon and fight the Trojans again. ||
|-id=227
| 22227 Polyxenos || 5030 T-2 || Polyxenos came from Elis and fought against the Trojans. ||
|-id=249
| 22249 Dvorets Pionerov || || Dvorets pionerov (Дворец пионеров, "Palace of Pioneers"), the Moscow City Palace of Youth Creativity, founded in 1936 ||
|-id=250
| 22250 Konstfrolov || || Konstantin Vasil'evich Frolov, Russian engineer, Academician of the Russian Academy of Sciences ||
|-id=253
| 22253 Sivers || || Yakov Efimovich Sivers (1731–1808) was an outstanding Russian statesman, governor of Novgorod province. As the founder and director of the Waterways Communications Department he made an invaluable contribution to navigation in Russia. In particular, he reconstructed the old canals between the Volga and Neva rivers ||
|-id=254
| 22254 Vladbarmin || || Vladimir Pavlovich Barmin, 20th-century Russian space engineer ||
|-id=260
| 22260 Ur || 1979 UR || Ur, Sumer † ||
|-id=263
| 22263 Pignedoli || 1980 RC || Antonio Pignedoli, a mathematics professor at the Military Academy of Modena ||
|-id=275
| 22275 Barentsen || 1982 BU || Geert Barentsen, Belgian astronomer. ||
|-id=276
| 22276 Belkin || || Anatoly Pavlovich Belkin, Russian painter. ||
|-id=277
| 22277 Hirado || || Hirado is a town in Nagasaki Prefecture, Japan. The Portuguese arrived in 1550, and during the early Edo period (beginning in 1603) Hirado became a center of trade with Portugal, the Netherlands and England. ||
|-id=278
| 22278 Protitch || || Milorad B. Protić, Serbian astronomer. ||
|-id=280
| 22280 Mandragora || || a genus belonging to the nightshade family (Solanaceae). Members of the genus are known as mandrakes. They are perennial herbaceous plants, with large tap-roots and leaves in the form of a rosette. Individual flowers are bell-shaped, whitish through to violet, and are followed by yellow or orange berries. ||
|-id=281
| 22281 Popescu || 1985 PC || Marcel Popescu (born 1983), a specialist in asteroid spectroscopy at the Astronomical Institute of the Romanian Academy in Bucharest. ||
|-id=283
| 22283 Pytheas || 1986 PY || Pytheas (fl. 4th century BC) was a geographer from the Greek colony of Massalia (Marseille) ||
|-id=291
| 22291 Heitifer || || Heinrich (born 1998), Tibère (born 1999) and Ferdinand (born 2000), the three grandsons of German discoverer Freimut Börngen ||
|-id=292
| 22292 Mosul || || Mosul is a city on the Tigris in northern Iraq, 400 km north of Baghdad. The area of Mosul was a part of Assyria from the 25th century BCE. Famous for its Grand Mosque, Mosul's craftsmen were admired for their metalwork, using gold and silver for inlay on bronze and brass. ||
|-id=294
| 22294 Simmons || || Michael ("Mike") S. Simmons, American amateur astronomer who assisted in organizing the photographic glass plate archive of the 1.2-m Schmidt Oschin Telescope at Palomar Observatory ||
|-id=299
| 22299 Georgesteiner || 1990 GS || George Steiner, French-American author, essayist, and literary critic. ||
|}
22301–22400
|-id=312
| 22312 Kelly || || Thomas J. Kelly (1929–2002), an American aerospace engineer and chief engineer of the Apollo Lunar Module. Considered the "Father of the LM", he and his Grumman Aerospace engineering team oversaw the design, construction and testing of each of the spacecraft that safely landed twelve men on the Moon. ||
|-id=322
| 22322 Bodensee || || Lake Constance (), is a border sea of the Alps, adjoining Germany, Switzerland and Austria. The river Rhine flows through it. It is an old cultivated and cultural landscape. The name was suggested by co-discoverer Freimut Börngen. ||
|-id=338
| 22338 Janemojo || 1992 LE || Morris Jones and his wife Jane, astronomers. ||
|-id=341
| 22341 Francispoulenc || 1992 PF || Francis Poulenc (1899–1963), French composer. He put to music poetry from the avant-garde poets Apollinaire, Eluard and Aragon. His most popular song is Les Chemins de l'amour (1940). Poulenc's religious devotion led to compositions such as Stabat Mater (1950) and Dialogues of the Carmelites (1953). ||
|-id=346
| 22346 Katsumatatakashi || || Takashi Katsumata (born 1952) is a professor of Nagasaki University and author of many articles on Japanese mythology related to stars. ||
|-id=347
| 22347 Mishinatakashi || || Takashi Mishina (born 1953) is a Japanese editor of natural science and an illustrator. ||
|-id=348
| 22348 Schmeidler || || (1920–2008), a German astronomer at the Munich Observatory for many years and professor at Munich University. He is known for his contributions to classical astronomy and the history of astronomy. The name was suggested by co-discoverer Lutz Schmadel. ||
|-id=351
| 22351 Yamashitatoshiki || || Toshiki Yamashita (born 1934) is a Japanese high school physics teacher. He has undertaken 43 expeditions to view total and annular solar eclipses. ||
|-id=352
| 22352 Fujiwarakenjiro || || Kenjiro Fujiwara (1894–1910) was a childhood friend of Japanese novelist Kenji Miyazawa whose fantasy novel Night on the Galactic Railroad depicts a protagonist based on Kenjiro. ||
|-id=354
| 22354 Sposetti || || Stefano Sposetti (born 1958), a Swiss amateur astronomer and teacher who lives in the country's Italian-speaking part in the Lepontine Alps. Since his youth he has been a very active observer of minor planets, comets, artificial satellites and meteors. He is also a helpful friend to budding young amateur astrometrists. ||
|-id=355
| 22355 Yahabananshozan || || Yahabananshozan is the name of a 848-meter mountain in Iwate Prefecture of Japan. It appears in Kenji Miyazawa's famous story "Taneyamagahara no Yoru" ("The Night of Taneyamagahara"). ||
|-id=356
| 22356 Feyerabend || || Paul Feyerabend (1924–1994) was a philosopher who criticized the scientific method, proposing instead that scientists use any method that works in their research ||
|-id=366
| 22366 Flettner || 1993 MT || Anton Flettner (1885–1961) was a German aviation engineer and inventor. He made important contributions to airplane and helicopter design. Name suggested by R. Jedicke and P. Jedicke. ||
|-id=369
| 22369 Klinger || || Max Klinger (1857–1920), German sculptor, painter and etcher † ||
|-id=370
| 22370 Italocalvino || || Italo Calvino (1923–1985), an Italian writer and novelist who produced fantastic tales such as The Cloven Viscount (1952), The Baron in the Trees (1957) and The Nonexistent Knight (1959). His Le cosmicomiche is a stream-of-consciousness narrative that treats the creation and evolution of the Universe. ||
|-id=378
| 22378 Gaherty || || | Geoff Gaherty (born 1941) is an amateur astronomer who writes about observing and won the Chant Medal of the Royal Astronomical Society of Canada in 2008. ||
|-id=383
| 22383 Nikolauspacassi || 1994 EL || Nikolaus Franz Leonhard von Pacassi (1716–1790) was an Austrian architect of Italian origin. ||
|-id=385
| 22385 Fujimoriboshi || || The Tokyo Metropolitan Fujimori High school, where co-discoverer Masanori Hirasawa teaches astronomy and Earth science. It is one of the traditional high schools in the Tokyo Tama area. The naming took place on the occasion of the school's 70th anniversary. ||
|-id=394
| 22394 Kondouakira || 1994 TO || Akira Kondou (born 1943) has been director of the Saga City Hoshizora Astronomy Center since 2016. He is a widely respected astronomy scholar and a keen popularizer of astronomy in Japan. ||
|-id=395
| 22395 Ourakenji || || Kenji Oura (born 1965) is the director of the Kanoya City Planetarium, Kagoshima prefecture, Japan. He organizes local star parties for amateur astronomers and lay persons alike. ||
|}
22401–22500
|-
| 22401 Egisto || || Egisto Masotti (born 1944), amateur astronomer in the Montelupo group of amateur astronomers. ||
|-id=402
| 22402 Goshi || 1995 GN || Goshi Nakamura (born 2001), whose initials are those of the provisional designation of this minor planet, is the son of the discoverer. ||
|-id=403
| 22403 Manjitludher || 1995 LK || Manjit Kaur Ludher, Deputy President of the Sikh Women's Awareness Network Society in Malaysia. ||
|-id=405
| 22405 Gavioliremo || 1995 OB || Remo Gavioli, Italian amateur astronomer, founding member of the G. Montanari Astronomical Society (Associazione Astronomica G. Montanari) in Cavezzo (Modena), Italy. ||
|-id=406
| 22406 Garyboyle || || Gary Boyle (born 1957) is a Canadian amateur astronomer who leads club activities, runs outreach events, teaches a college course and writes a stargazing column. ||
|-id=409
| 22409 Nagatohideaki || || Hideaki Nagato (born 1943) opened a nursery school and become its principal in Komatsu City, Ishikawa Prefecture, Japan. The school started with six children but now serves more than a thousand children. ||
|-id=410
| 22410 Grinspoon || || David Grinspoon (born 1959), an astrobiologist at the Southwest Research Institute, won the 2006 Carl Sagan Medal and wrote the award-winning book Lonely Planets. Name suggested by R. Jedicke and P. Jedicke. ||
|-id=413
| 22413 Haifu || || Hai Fu (born 1982) received his Ph.D. from the University of Hawaii and then worked at the University of Iowa, researching how galaxies evolve. Name suggested by R. and P. Jedicke. ||
|-id=414
| 22414 Hornschemeier || || At NASA-Goddard, Ann Hornschemeier (born 1975) specializes in studies of X-ray emission from star formation in galaxies at cosmologically-interesting distances. Name suggested by R. and P. Jedicke ||
|-id=415
| 22415 Humeivey || || James Nairn Patterson Hume (1923–2013) and Donald Glenn Ivey (born 1922) were physics educators, best known for their award-winning 1962 film Frames of Reference. Name suggested by R. and P. Jedicke. ||
|-id=416
| 22416 Tanimotoyoshi || || Motoyoshi Tani (born 1945) is a well-known astronomy popularizer in Osaka. His interests include the design of astronomical telescopes, observational instruments, and astronomical observatories. ||
|-id=421
| 22421 Jamesedgar || || James Somerville Edgar (born 1946) spent 40 years as a Locomotive Engineer and rail Supervisor. He became President of the Royal Astronomical Society of Canada in 2014. Name suggested by R. and P. Jedicke ||
|-id=422
| 22422 Kenmount Hill || || Kenmount Hill (47°31' N, 52°47' W) is the location near St. John's, Newfoundland, where John Winthrop of Harvard College observed the transit of Venus in 1761. Name suggested by R. and P. Jedicke. ||
|-id=423
| 22423 Kudlacek || || Trina Kudlacek (born 1967) is a long-term volunteer with the University of Hawaii's Friends of the Institute for Astronomy, who helped arrange eclipse expeditions. Name suggested by R. and P. Jedicke. ||
|-id=426
| 22426 Mikehanes || || Michael Francis Hanes (born 1959) was a pilot for Air Canada, an amateur astronomer and telescope maker with the Royal Astronomical Society of Canada, London Centre. Name suggested by R. and P. Jedicke. ||
|-id=429
| 22429 Jurašek || || Pavel "Balvan" Jurašek (1955–2008) was a professional meteorologist and since 2006 director of the Slovak Hydrometeorological Institute in Košice). Interested in observing meteors, he was a member of the Slovak Union of Amateur Astronomers and the Slovak Astronomical Society ||
|-id=432
| 22432 Pamgriffin || || Pamela Defreyn Griffin (born 1966) obtained a B.Sc. in Geological Engineering in 1989 and is active in the University of Hawaii's "Friends of the IfA". ||
|-id=434
| 22434 Peredery || || Walter Volodymyr Peredery (born 1938) is a retired Canadian geologist who studied the Sudbury, Ontario, area and developed the view that it is an impact basin. Name suggested by P. and R. Jedicke. ||
|-id=435
| 22435 Pierfederici || || Francesco Pierfederici (born 1973) developed software for the Pan-STARRS moving object processing system and Large Synoptic Survey Telescope. Name suggested by P. and R. Jedicke. ||
|-id=440
| 22440 Bangsgaard || 1996 KA || Nicolai Bangsgaard (born 1976) is a Danish traveller and biker, who spent 1413 days cycling around the world, visiting 53 countries on six continents ||
|-id=442
| 22442 Blaha || || John Elmer Blaha, American astronaut † ||
|-id=446
| 22446 Philwhitney || || Phil Whitney (born 1927) has long supported astronomy in Hawaii and organized events for the University of Hawaii's "Friends of the Institute for Astronomy". Name suggested by P. and R. Jedicke. ||
|-id=448
| 22448 Ricksaunders || || John Richard Saunders (born 1946) makes astronomy accessories and began a term as President of the Royal Astronomical Society of Canada, London Centre, in 2012. Name suggested by P. and R. Jedicke. ||
|-id=449
| 22449 Ottijeff || 1996 VC || Ottilie Malfliet (born 1944) and Jeffrey Levine (born 1948) are the parents of the discoverer's wife. ||
|-id=450
| 22450 Nové Hrady || 1996 VN || Nové Hrady, south Bohemia, near the Czech-Austrian border † ||
|-id=451
| 22451 Tymothycoons || || Tymothy Alan Coons (born 1955) is a pilot, flight engineer and inspector based in Tucson, Arizona, where he maintains various aircraft. One of his favorite jobs in Aereospace was at the Ballistic Missile Early Warning Site in Thule, Greenland: the purpose of this powerful radar was to look for objects in earth orbit ||
|-id=453
| 22453 Shibusawaeiichi || || Shibusawa Eiichi (1840–1931), called the "father of the modern Japanese economy", was involved in the founding of almost 500 companies and promoted economic development in Japan. He also poured his efforts into social welfare, social public enterprises and international relations around the turn of the 20th century. ||
|-id=454
| 22454 Rosalylopes || || A member of the Cassini Titan Radar Mapper Team at JPL, Rosaly M. C. Lopes-Gautier (born 1957) studies geology and volcanology. She discovered 71 volcanoes on Io. ||
|-id=456
| 22456 Salopek || || David Stephen Salopek (born 1963) earned a Ph.D. in cosmology from the University of Toronto in 1989 and worked at the Universities of Cambridge and Alberta. ||
|-id=465
| 22465 Karelanděl || || Karel Anděl, Czech astronomer and selenographer † ||
|-id=467
| 22467 Koharumi || || Kobayashi Harumi, Japanese master of the tea ceremony and an observing partner of the discoverer (this minor planet was detected on the same night as the comet P/1997 B1 (Kobayashi)) ||
|-id=469
| 22469 Poloniny || || Poloniny is the first dark sky protected area in Slovakia, proclaimed on 2010 December 3, located in the Poloniny National Park. ||
|-id=470
| 22470 Shirakawa-go || || Shirakawa=go is the village located on the border of Gifu Prefecture and Toyama Prefecture, Japan. It is famous for its big houses with thatched rafter roofs and was registered as a World Culture Heritage site in 1995 ||
|-id=473
| 22473 Stanleyhey || || James Stanley Hey (1909–2000), a British radar engineer. ||
|-id=474
| 22474 Frobenius || || Georg Ferdinand Frobenius (1849–1917), a professor at the University of Berlin. ||
|-id=475
| 22475 Stanrunge || || Stanley Edward John Runge (born 1956) is an experienced amateur astronomer and an active member of the Royal Astronomical Society of Canada, Winnipeg Centre. Name suggested by R. and P. Jedicke. ||
|-id=477
| 22477 Julimacoraor || || Juliana Mathea Coraor (born 1995) is a finalist in the 2012 Intel Science Talent Search, a science competition for high-school seniors, for her physics and space-science project. ||
|-id=480
| 22480 Maedatoshihisa || || Toshihisa Maeda (born 1963) is a Japanese amateur radio astronomer and president of the Kagoshima Astronomical Society ("Kagoshimaken Tenmon Kyoukai"), and an observer of variable stars. He is a high school teacher by profession. ||
|-id=481
| 22481 Zachlynn || || Zach Lynn mentored a finalist in the 2012 Intel Science Talent Search, a science competition for high-school seniors. ||
|-id=482
| 22482 Michbertier || || Michelle Bertier mentored a finalist in the 2012 Intel Science Talent Search, a science competition for high-school seniors. ||
|-id=485
| 22485 Unterman || || Nathan Unterman mentored a finalist in the 2012 Intel Science Talent Search, a science competition for high-school seniors. ||
|-id=487
| 22487 Megphillips || || Megan Phillips mentored a finalist in the 2012 Intel Science Talent Search, a science competition for high-school seniors. ||
|-id=488
| 22488 Martyschwartz || || Martin Schwartz mentored a finalist in the 2012 Intel Science Talent Search, a science competition for high-school seniors. ||
|-id=489
| 22489 Yanaka || || Tetsuo Yanaka (born 1954) is a post office clerk and amateur astronomer in Japan. ||
|-id=490
| 22490 Zigamiyama || || Zigamiyama is a 1850-meter mountain located in the western part of the Iide mountain range, in the Bandai-Asahi National Park. It is a popular area for Japanese mountain climbers ||
|-id=492
| 22492 Mosig || || Thomas Mosig mentored a finalist in the 2012 Intel Science Talent Search, a science competition for high-school seniors. ||
|-id=494
| 22494 Trillium || 1997 JL || Since 1937, the White Trillium (Trillium grandiflorum) has been the official flower of Canada's province of Ontario, where it is often found in forests. ||
|-id=495
| 22495 Fubini || || Guido Fubini (1879–1943), lecturer at the universities of Catania, Genoa and Turin. ||
|-id=497
| 22497 Immanuelfuchs || 1997 KG || Immanuel Lazarus Fuchs (1833–1902) received a doctorate from the University of Berlin and taught at various secondary schools and universities. His work was mostly in the study of solutions and singularities of homogeneous linear differential equations in the complex domain. ||
|-id=498
| 22498 Willman || || Mark Willman (born 1952) received his Ph.D. in planetary astronomy from the University of Hawaii's Institute for Astronomy and began working with Pan-STARRS1 in 2013. ||
|-id=499
| 22499 Wunibaldkamm || || Wunibald Kamm (1893–1966) developed aerodynamic designs that reduce turbulence at high speeds for automobiles, including the widely seen Kammback or Kamm-tail. ||
|-id=500
| 22500 Grazianoventre || 1997 OJ || Graziano Ventre (born 1954) is an active member of the Osservatorio Astronomico Sormano and from his personal observatory, near his home in Bellagio (Italy), he obtains astrometric positions of comets and pictures of deep sky objects. He is a discoverer of minor planets. ||
|}
22501–22600
|-id=503
| 22503 Thalpius || || Thalpius, son of Eurytus, leader of the Elean flotilla against Troy and one of those aboard the wooden horse † ||
|-id=505
| 22505 Lewit || 1997 UF || Since 1946, Karel Lewit (born 1916) has worked in leading Prague teaching hospitals, developing and propagating modern methods of rehabilitation and manual medicine, teaching and training specialists in that field at home and abroad. ||
|-id=512
| 22512 Cannat || || Guillaume Cannat, French scientific journalist and author of several books, including the annual Guide du ciel ||
|-id=517
| 22517 Alexzanardi || || Alex Zanardi (born 1966) is a former Formula 1 driver, 1997/1998 CART champion and 2005 Italian Superturismo Champion. After being seriously injured in a race in 2001, he turned to parathletics, winning two gold and one silver medals in handcycling at both the 2012 London and 2016 Rio Paralympics. ||
|-id=519
| 22519 Gerardklein || || Gérard Klein, French movie and television actor ||
|-id=521
| 22521 ZZ Top || || A power trio from Texas, ZZ Top was formed in 1969. Bearded Billy Gibbons (guitar and vocals) and Dusty Hill (bass and vocals), and beardless Frank Beard (percussion) produce energetic music that was used to close the dome of the OCA Schmidt telescope after a long night of observing ||
|-id=527
| 22527 Gawlik || || Evan Scott Gawlik, American finalist in the 2006 Intel Science Talent Search (ISTS) ||
|-id=528
| 22528 Elysehope || || Elyse Autumn Hope, American finalist in the 2006 Intel Science Talent Search (ISTS) ||
|-id=530
| 22530 Huynh-Le || || Minh-Phuong Huynh-Le, American finalist in the 2006 Intel Science Talent Search (ISTS) ||
|-id=531
| 22531 Davidkelley || || David Bruce Kelley, American finalist in the 2006 Intel Science Talent Search (ISTS) ||
|-id=533
| 22533 Krishnan || || Sheela Krishnan, American finalist in the 2006 Intel Science Talent Search (ISTS) ||
|-id=534
| 22534 Lieblich || || Jerrold Alexander Lieblich, American finalist in the 2006 Intel Science Talent Search (ISTS) ||
|-id=536
| 22536 Katelowry || || Kate Elizabeth Lowry, American finalist in the 2006 Intel Science Talent Search (ISTS) ||
|-id=537
| 22537 Meyerowitz || || Eric Allan Meyerowitz, American finalist in the 2006 Intel Science Talent Search (ISTS) ||
|-id=538
| 22538 Lucasmoller || || Lucas Edward Moller, American finalist in the 2006 Intel Science Talent Search (ISTS) ||
|-id=540
| 22540 Mork || || Anna Jolene Mork, American finalist in the 2006 Intel Science Talent Search (ISTS) ||
|-id=542
| 22542 Pendri || || Kiran Reddy Pendri, American finalist in the 2006 Intel Science Talent Search (ISTS) ||
|-id=543
| 22543 Ranjan || || Sukrit Ranjan, American finalist in the 2006 Intel Science Talent Search (ISTS) ||
|-id=544
| 22544 Sarahrapo || || Sarah Kate Rapoport, American finalist in the 2006 Intel Science Talent Search (ISTS) ||
|-id=545
| 22545 Brittrusso || || Brittany Nicole Russo, American finalist in the 2006 Intel Science Talent Search (ISTS) ||
|-id=546
| 22546 Schickler || || Carmiel Effron Schickler, American finalist in the 2006 Intel Science Talent Search (ISTS) ||
|-id=547
| 22547 Kimberscott || || Kimberly Megan Scott, American finalist in the 2006 Intel Science Talent Search (ISTS) ||
|-id=550
| 22550 Jonsellon || || Jonathan Blake Sellon, American finalist in the 2006 Intel Science Talent Search (ISTS) ||
|-id=551
| 22551 Adamsolomon || || Adam Ross Solomon, American finalist in the 2006 Intel Science Talent Search (ISTS) ||
|-id=553
| 22553 Yisun || || Yi Sun, American finalist in the 2006 Intel Science Talent Search (ISTS) ||
|-id=554
| 22554 Shoshanatell || || Shoshana Sophie Rothman Tell, American finalist in the 2006 Intel Science Talent Search (ISTS) ||
|-id=555
| 22555 Joevellone || || Joseph Daniel Vellone, American finalist in the 2006 Intel Science Talent Search (ISTS) ||
|-id=558
| 22558 Mladen || || Mladen Kolény Sr., father of the first discoverer, and Mladen Kolény Jr., his brother ||
|-id=561
| 22561 Miviscardi || || Michael Anthony Viscardi, American finalist in the 2006 Intel Science Talent Search (ISTS) ||
|-id=562
| 22562 Wage || || Nicholas Michael Wage, American finalist in the 2006 Intel Science Talent Search (ISTS) ||
|-id=563
| 22563 Xinwang || || Xin Wang, American finalist in the 2006 Intel Science Talent Search (ISTS) ||
|-id=564
| 22564 Jeffreyxing || || Jeffrey Chunlong Xing, American finalist in the 2006 Intel Science Talent Search (ISTS) ||
|-id=566
| 22566 Irazaitseva || || Irina Vladimirovna Zaitseva, American finalist in the 2006 Intel Science Talent Search (ISTS) ||
|-id=567
| 22567 Zenisek || || Sergio-Francis Mellejor Zenisek, American finalist in the 2006 Intel Science Talent Search (ISTS) ||
|-id=570
| 22570 Harleyzhang || || Harley Huiyu Zhang, American finalist in the 2006 Intel Science Talent Search (ISTS) ||
|-id=571
| 22571 Letianzhang || || Letian Zhang, American finalist in the 2006 Intel Science Talent Search (ISTS) ||
|-id=572
| 22572 Yuanzhang || || Yuan Zhang, American finalist in the 2006 Intel Science Talent Search (ISTS) ||
|-id=573
| 22573 Johnzhou || || John Cong Zhou, American finalist in the 2006 Intel Science Talent Search (ISTS) ||
|-id=575
| 22575 Jayallen || || Jay Allen, American mentor of a 2006 Intel Science Talent Search (ISTS) finalist ||
|-id=577
| 22577 Alfiuccio || || Alfio ("Alfiuccio") Grasso (1992–2004) died tragically at the age of twelve in a hunting accident on the slopes of Mt. Etna. The name was suggested by C. Blanco and M. Di Martino ||
|-id=579
| 22579 Marcyeager || || Marcy Eager, American mentor of a 2006 Intel Science Talent Search (ISTS) finalist ||
|-id=580
| 22580 Kenkaplan || || Kenneth Kaplan, American mentor of a 2006 Intel Science Talent Search (ISTS) finalist ||
|-id=581
| 22581 Rosahemphill || || Rosa Hemphill, American mentor of a 2006 Intel Science Talent Search (ISTS) finalist ||
|-id=582
| 22582 Patmiller || || Patricia Miller, American mentor of a 2006 Intel Science Talent Search (ISTS) finalist ||
|-id=583
| 22583 Metzler || || William Metzler, American mentor of a 2006 Intel Science Talent Search (ISTS) finalist ||
|-id=584
| 22584 Winigleason || || Winifred Gleason, American mentor of a 2006 Intel Science Talent Search (ISTS) finalist ||
|-id=586
| 22586 Shellyhynes || || Shelly Hynes, American mentor of a 2006 Intel Science Talent Search (ISTS) finalist ||
|-id=587
| 22587 McKennon || || Blanche McKennon, American mentor of a 2006 Intel Science Talent Search (ISTS) finalist ||
|-id=589
| 22589 Minor || || Tom Minor, American mentor of a 2006 Intel Science Talent Search (ISTS) finalist ||
|-id=594
| 22594 Stoops || || Tracy Stoops, American mentor of a 2006 Intel Science Talent Search (ISTS) finalist ||
|-id=596
| 22596 Kathwallace || || Kathleen Wallace, American mentor of a 2006 Intel Science Talent Search (ISTS) finalist ||
|-id=597
| 22597 Lynzielinski || || Lynne Zielinski, American mentor of a 2006 Intel Science Talent Search (ISTS) finalist ||
|-id=598
| 22598 Francespearl || || Frances Pearlmutter, American mentor of a 2006 Intel Science Talent Search (ISTS) finalist ||
|-id=599
| 22599 Heatherhall || || Heather Hall, American mentor of a 2006 Intel Science Talent Search (ISTS) finalist ||
|}
22601–22700
|-id=603
| 22603 Davidoconnor || || David O'Connor, American mentor of a 2006 Intel Science Talent Search (ISTS) finalist ||
|-id=605
| 22605 Steverumsey || || Stephen Rumsey, American mentor of a 2006 Intel Science Talent Search (ISTS) finalist ||
|-id=611
| 22611 Galerkin || 1998 KB || Boris Grigorievich Galerkin (1871–1945) studied engineering in his native Russia and abroad. His scientific work centered on various problems in the theory of elasticity and structural mechanics, in particular the curvature of thin plates and the torsion and flexure of prismatic rods. ||
|-id=612
| 22612 Dandibner || || Daniel Dibner (born 1955) is director of philanthropy of the Cascade Foundation. A Sloan Fellow at the Massachusetts Institute of Technology, he has specialized in the history of science. He has also been an executive at several software and technology companies ||
|-id=613
| 22613 Callander || || Thomas Callander Price Zimmermann (born 1934) has been professor of renaissance history at Reed College (Oregon) and Davidson College (North Carolina). He is a past president of the American Alpine Club, where he helped organize Club policy on access to mountain recreation areas ||
|-id=616
| 22616 Bogolyubov || || Nikolai Nikolaevich Bogolyubov (1909–1992) was a Russian and Ukrainian Soviet mathematician and theoretical physicist known for his work in statistical field theory and dynamical systems. He was awarded the Dirac Medal in 1992. The name was suggested by K. I. Churyumov ||
|-id=617
| 22617 Vidphananu || || The name Vidphananu is a Ukrainian abbreviation for the Department of Physics and Astronomy of the National Academy of Sciences of Ukraine, which was created in Kiev in 1918. The name was suggested by K. I. Churyumov ||
|-id=618
| 22618 Silva Nortica || || Silva Nortica, "Northern Forest", ancient Latin name of the territory on the borders of South Bohemia and Lower Austria ||
|-id=619
| 22619 Ajscheetz || || Alfred J. Scheetz, American mentor of a 2006 Intel Science Talent Search (ISTS) finalist ||
|-id=621
| 22621 Larrybartel || || Larry Bartel, American mentor of a 2006 Intel Science Talent Search (ISTS) finalist ||
|-id=622
| 22622 Strong || || Joshua Strong, American mentor of a 2006 Intel Science Talent Search (ISTS) finalist ||
|-id=623
| 22623 Fisico || || Misael Fisico, American mentor of a 2006 Intel Science Talent Search (ISTS) finalist ||
|-id=625
| 22625 Kanipe || || Linda Kanipe, American mentor of a 2006 Intel Science Talent Search (ISTS) finalist ||
|-id=626
| 22626 Jengordinier || || Jennifer Gordinier, American mentor of a 2006 Intel Science Talent Search (ISTS) finalist ||
|-id=627
| 22627 Aviscardi || || Anthony Viscardi, American mentor of a 2006 Intel Science Talent Search (ISTS) finalist ||
|-id=628
| 22628 Michaelallen || || Michael Allen, American mentor of a 2006 Intel Science Talent Search (ISTS) finalist ||
|-id=630
| 22630 Wallmuth || || Joanne Wallmuth, American mentor of a 2006 Intel Science Talent Search (ISTS) finalist ||
|-id=631
| 22631 Dillard || || Linda Dillard, American mentor of a 2006 Intel Science Talent Search (ISTS) finalist ||
|-id=632
| 22632 DiNovis || || Joanne DiNovis, American mentor of a 2006 Intel Science Talent Search (ISTS) finalist ||
|-id=633
| 22633 Fazio || || Marc Fazio, American mentor of a 2006 Intel Science Talent Search (ISTS) finalist ||
|-id=638
| 22638 Abdulla || || Almas Ugurgizi Abdulla (born 1993) is a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition, for her mathematics project. She attends the Stone Middle School, Melbourne, Florida ||
|-id=639
| 22639 Nickanthony || || Nick Alan Anthony (born 1993) is a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition, for his biochemistry, medicine, health, and microbiology project. He attends the Three Oaks Middle School, Ft. Myers, Florida ||
|-id=640
| 22640 Shalilabaena || || Shalila Alejandra Baena (born 1994) is a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition, for her botany and zoology project. She attends the Haaheo Elementary School, Hilo, Hawaii ||
|-id=644
| 22644 Matejbel || || Matej Bel (1684–1749), Slovak historian and a great scholar of the eighteenth century ||
|-id=645
| 22645 Rotblat || || Joseph Rotblat (1908–2005) was a Nobel Peace Prize laureate in 1995 for his efforts toward nuclear disarmament. A signatory to the 1955 Russell-Einstein manifesto, he was the guiding spirit of the Pugwash Conferences on Science and World Affairs and helped prevent the use of nuclear weapons during the Cold War ||
|-id=647
| 22647 Lévi-Strauss || || French anthropologist and ethnologist Claude Lévi-Strauss (1908–2009) introduced structuralism as the basis of human perception. Disillusioned with the study of philosophy at the Sorbonne, he went in 1935 to Brazil, where his research on Indian tribes culminated in Tristes Tropiques (1955) and La Pensée Sauvage (1962) ||
|-id=656
| 22656 Aaronburrows || || Aaron Phillip Burrows (born 1992) is a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition, for his botany and zoology project. He attends the Bradley Middle School, San Antonio, Texas ||
|-id=666
| 22666 Josephchurch || || Joseph Christopher Church (born 1992) is a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition, for his engineering project. He attends the Alice Deal Junior High School, Washington, District of Columbia ||
|-id=675
| 22675 Davidcohn || || David Milton Cohn III (born 1992) is a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition, for his environmental sciences project. He attends the Rhoades School, Encinitas, California ||
|-id=679
| 22679 Amydavid || || Amy Jane David (born 1991) is a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition, for her environmental sciences project. She attends the Pinedale Middle School, Pinedale, Wyoming ||
|-id=685
| 22685 Dominguez || || Isabella Rosa Dominguez (born 1991) is a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition, for her botany and zoology project. She attends the Key Biscayne Elementary School, Miami, Florida ||
|-id=686
| 22686 Mishchenko || || Michael Ivanovich Mischenko (born 1959), of the NASA Goddard Institute for Space Studies, studies electromagnetic scattering. He has developed a new branch of statistical optics based on numerically exact solutions of Maxwell's equations ||
|-id=692
| 22692 Carfrekahl || || Caroline and Frederikke Kahl, granddaughters of Danish astronomer Leif Kahl Kristensen, a friend of the discoverer (the latter are both members of IAU Commission 20, Positions and Motions of Minor Planets, Comets and Satellites) ||
|-id=694
| 22694 Tyndall || || John Tyndall (1820–1893), an Irish natural philosopher and glaciologist who made fundamental investigations of the motion of glaciers, insisting that the flow is due to fracture and regelation. He is known for the Tyndall effect in suspensions. ||
|-id=697
| 22697 Mánek || 1998 RM || Jan Karel Mánek, Czech amateur astronomer. ||
|}
22701–22800
|-
| 22701 Cyannaskye || || Cyanna Skye Edwards (born 1992) is a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition, for her biochemistry, medicine, health, and microbiology project. She attends the Buckner Fanning Christian School, San Antonio, Texas ||
|-id=705
| 22705 Erinedwards || || Erin Nicole Edwards (born 1995) is a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition, for her physical science project. She attends the John Hancock Charter School, Pleasant Grove, Utah ||
|-id=706
| 22706 Ganguly || || Shilpi Ganguly (born 1994) is a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition, for her biochemistry, medicine, health, and microbiology project. She attends the Trailwood Elementary School, Overland Park, Kansas ||
|-id=707
| 22707 Jackgrundy || || Jack Mark Grundy (born 1993) is a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition, for his biochemistry, medicine, health, and microbiology project. He attends the St. Francis of Assisi School, Louisville, Kentucky ||
|-id=717
| 22717 Romeuf || || David Romeuf (born 1969), a French amateur astronomer who worked as a student at the OCA Schmidt telescope in order to automate it, and is now research engineer at UCBL in Lyon, France. He has continued to work in pro-am astronomy and was project manager for the HACO-CLIMSO coronagraph at the Pic du Midi Observatory. ||
|-id=719
| 22719 Nakadori || || Nakadori is the central part of Fukushima prefecture, Japan, and is located between the Ōu Mountains and Abukuma highland. ||
|-id=722
| 22722 Timothycooper || || Timothy P. Cooper (born 1958), the Director of the Comet and Meteor Section of the Astronomical Society of Southern Africa. ||
|-id=723
| 22723 Edlopez || || As a research engineer, Edward ("Ed") B. Lopez III (1939–2010), created the first industrial robot to automate parcel sorting. His team designed the DIAD (Delivery Information Acquisition Device), a handheld data collector used to record and transmit delivery information ||
|-id=724
| 22724 Byatt || || Antonia Susan ("A. S.") Byatt (born 1936) is an English writer, well known for her novels and short stories. She is a winner of the Booker Prize for Fiction and became a Dame Commander of the Order of the British Empire in 1999 ||
|-id=725
| 22725 Drabble || || English writer Margaret Drabble (born 1939) has, among other works, published seventeen novels, has edited The Oxford Companion to English literature and is a biographer of Arnold Bennett and Angus Wilson. She became a Dame Commander of the Order of the British Empire in 2008 ||
|-id=729
| 22729 Anthennig || || Anthony Ian Hennig (born 1993) is a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition, for his physical science project. He attends the Powhatan Junior High School, Powhatan, Virginia ||
|-id=730
| 22730 Jacobhurwitz || || Jacob Benjamin Hurwitz (born 1992) is a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition, for his behavioral science project. He attends the Robert Frost Middle School, Rockville, Maryland ||
|-id=732
| 22732 Jakpor || || Otana Agape Jakpor (born 1993) is a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition, for her biochemistry, medicine, health, and microbiology project. She attends the Woodcrest Christian School, Riverside, California ||
|-id=734
| 22734 Theojones || || Theo Percy Jones (born 1993) is a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition, for his behavioral science project. He attends the Jones Home School, Tucson, Arizona ||
|-id=736
| 22736 Kamitaki || || Nolan M.K. Kamitaki (born 1992) is a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition, for his environmental sciences project. He attends the Waiakea Intermediate School, Hilo, Hawaii ||
|-id=739
| 22739 Sikhote-Alin || || Sikhote-Alin, a mountain range in eastern Siberia, extending about 900 km to the Russian Pacific. ||
|-id=740
| 22740 Rayleigh || || John William Rayleigh (1842–1919), an English physicist and Nobelist ||
|-id=744
| 22744 Esterantonucci || || Ester Antonucci (born 1945) is a solar physicist who has spent most of her career studying the sun using spacecraft. She participated in the Solar Maximum and SOHO missions and, since 2005, has been director of the Osservatorio Astronomico di Torino---the first woman to hold this position ||
|-id=745
| 22745 Rikuzentakata || || Rikuzentakata, a city in Iwate, Japan. ||
|-id=752
| 22752 Sabrinamasiero || || Sabrina Masiero (born 1970) is an astronomer and director of the educational popular science structure of the International Center for Astronomical Research GalHassin (Isnello, Sicily). GalHassin has achieved great success in the popularization of astronomy. ||
|-id=754
| 22754 Olympus || || Mount Olympus is the highest point in Greece. The cloud-veiled summit, and the heavens above, were believed by the ancients to be the dwelling place of the gods. ||
|-id=756
| 22756 Manpreetkaur || || Manpreet Kaur (born 1992) is a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition, for her biochemistry, medicine, health, and microbiology project. She attends the Seabrook Intermediate School, Seabrook, Texas ||
|-id=757
| 22757 Klimcak || || Sophie Haruna Klimcak (born 1992) is a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition, for her botany and zoology project. She attends the Palos Verdes Intermediate School, Palos Verdes, California ||
|-id=758
| 22758 Lemp || || Nicholas Andrew Lemp (born 1993) is a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition, for his earth and space science project. He attends the Lemp Home School, Waterford, Michigan ||
|-id=769
| 22769 Aurelianora || || Aurelia (born 1989) and Nora Sposetti (1991–1991) Sposetti, daughters of Swiss amateur astronomer Stefano Sposetti, who discovered this minor planet. ||
|-id=775
| 22775 Jasonelloyd || || Jason Eric Lloyd (born 1992) is a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition, for his botany and zoology project. He attends the Bonaire Middle School, Bonaire, Georgia ||
|-id=776
| 22776 Matossian || || Mikael Hagop Matossian (born 1994) is a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition, for his environmental sciences project. He attends the A.G.B.U. Manoogian Demirdjan School, Canoga Par, California ||
|-id=777
| 22777 McAliley || || Collin Northcott McAliley (born 1993) is a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition, for his environmental sciences project. He attends the Cocoa Beach Junior/Senior High School, Cocoa Beach, Florida ||
|-id=780
| 22780 McAlpine || || Jayleen Jo McAlpine (born 1993) is a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition, for her biochemistry, medicine, health, and microbiology project. She attends the Sunburst Elementary School, Sunburst, Montana ||
|-id=782
| 22782 Kushalnaik || || Kushal Ulhas Naik (born 1992) is a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition, for his biochemistry, medicine, health, and microbiology project. He attends the H.B. DuPont Middle School, Hockessin, Delaware ||
|-id=783
| 22783 Teng || || Stacy H. Teng (born 1980), a recent Ph.D. recipient at the University of Maryland, studies the evolution of nuclear activity in luminous and ultraluminous infrared galaxies and has confirmed the link between mergers and quasars. The name was suggested by M. M. Knight ||
|-id=784
| 22784 Theresaoei || || Theresa A. Oei (born 1993) is a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition, for her environmental sciences project. She attends the Oei Home School, Hebron, Connecticut ||
|-id=786
| 22786 Willipete || || William Garrett Pete (born 1995) is a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition, for his physical science project. He attends the Christina Huddleston Elementary School, Lakeville, Minnesota ||
|-id=788
| 22788 von Steuben || || Friedrich Wilhelm von Steuben (1730–1794), a Prussian military officer who taught standards of military drill and discipline to the Continental Army during the American Revolutionary War. Steuben Day parades (September) in New York and other American cities celebrate German culture ||
|-id=791
| 22791 Twarog || || Bruce Twarog (born 1952), a professor at the University of Kansas. ||
|-id=794
| 22794 Lindsayleona || || Lindsey Leona Precht (born 1993) is a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition, for her botany and zoology project. She attends the Miami Lakes Middle School, Miami, Florida ||
|}
22801–22900
|-id=802
| 22802 Sigiriya || || Sigiriya is a fifth-century rock fortress in central Sri Lanka. It is a UNESCO World Heritage Site renowned for its frescoes. The name was suggested by N. H. Samarasinha ||
|-id=809
| 22809 Kensiequade || || Mackensie Kathryn Quade (born 1991) is a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition, for her biochemistry, medicine, health, and microbiology project. She attends the St. John the Baptist School, New Brighton, Minnesota ||
|-id=810
| 22810 Rawat || || Radhika Rawat (born 1992) is a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition, for her physical science project. She attends the Summit Middle School, Boulder, Colorado ||
|-id=812
| 22812 Ricker || || Philip Daniel Ricker (born 1994) is a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition, for his biochemistry, medicine, health, and microbiology project. He attends the Ropesville Independent School District, Ropesville, Texas ||
|-id=815
| 22815 Sewell || || Michael T. Sewell (born 1993) is a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition, for his physical science project. He attends the Everest Academy, Clarkston, Michigan ||
|-id=817
| 22817 Shankar || || Aarthi Shankar (born 1992) is a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition, for her biochemistry, medicine, health, and microbiology project. She attends the Mountain Ridge Middle School, Colorado Springs, Colorado ||
|-id=819
| 22819 Davidtao || || David Tao (born 1992) is a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition, for his environmental sciences project. He attends the Takoma Park Middle School, Silver Spring, Maryland ||
|-id=824
| 22824 von Neumann || || John von Neumann (Neumann János), Hungarian-born American mathematician † ||
|-id=827
| 22827 Arvernia || || Arvernia is the Latin name of the Auvergne, a region in south-central France. Much of the Auvergne region is covered by the Massif Central, an extinct volcanic mountain range. Name suggested by J. Meeus ||
|-id=828
| 22828 Jaynethomp || || Jayne B. Thompson (born 1991) is a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition, for her environmental sciences project. She attends the Pinedale Middle School, Pinedale, Wyoming ||
|-id=829
| 22829 Paigerin || || Paige Erin Thompson (born 1993) is a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition, for her environmental sciences project. She attends the Lincoln Middle School, Bradenton, Florida ||
|-id=830
| 22830 Tinker || || Joel Jack Tinker (born 1994) is a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition, for his engineering project. He attends the Covenant Christian Academy, Huntsville, Alabama ||
|-id=831
| 22831 Trevanvoorth || || Trevor Will van Voorthuijsen (born 1991) is a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition, for his behavioral science project. He attends the van Voorthuijsen Home School, Lecanto, Florida ||
|-id=833
| 22833 Scottyu || || Scott Sang Yu (born 1991) is a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition, for his behavioral science project. He attends the Robert Frost Middle School, Rockville, Maryland ||
|-id=835
| 22835 Rickgardner || || Rick Gardner mentored a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. He teaches at the Three Oaks Middle School, Ft. Myers, Florida ||
|-id=836
| 22836 Leeannragasa || || LeeAnn Ragasa mentored a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. She teaches at the Haaheo Elementary School, Hilo, Hawaii ||
|-id=837
| 22837 Richardcruz || || Richard Cruz mentored a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. He teaches at the Bradley Middle School, San Antonio, Texas ||
|-id=838
| 22838 Darcyhampton || || Darcy Hampton mentored a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. She teaches at the Alice Deal Junior High School, Washington, District of Columbia ||
|-id=839
| 22839 Richlawrence || || Richard Lawrence mentored a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. He teaches at the Key Biscayne Elementary School, Miami, Florida ||
|-id=840
| 22840 Villarreal || || Margo Villarreal mentored a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. She teaches at the Buckner Fanning Christian School, San Antonio, Texas ||
|-id=842
| 22842 Alenashort || || Alena Short mentored a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. She teaches at the John Hancock Charter School, Pleasant Grove, Utah ||
|-id=843
| 22843 Stverak || || Janet Stverak mentored a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. She teaches at the Trailwood Elementary School, Overland Park, Kansas ||
|-id=846
| 22846 Fredwhitaker || || Fred Joseph Whitaker mentored a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. He teaches at the St. Francis of Assisi School, Louisville, Kentucky ||
|-id=847
| 22847 Utley || || Meredith Utley mentored a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. She teaches at the Powhatan Junior High School, Powhatan, Virginia ||
|-id=848
| 22848 Chrisharriot || || Christian Harriot mentored a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. He teaches at the Robert Frost Middle School, Rockville, Maryland ||
|-id=852
| 22852 Kinney || || Steve Kinney mentored a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. He teaches at the Woodcrest Christian School, Riverside, California ||
|-id=855
| 22855 Donnajones || || Donna Jones mentored a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. She teaches at the Jones Home School, Tucson, Arizona ||
|-id=856
| 22856 Stevenzeiher || || Steven Zeiher mentored a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. He teaches at the Waiakea Intermediate School, Hilo, Hawaii ||
|-id=857
| 22857 Hyde || || Tammi Hyde mentored a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. She teaches at the Seabrook Intermediate School, Seabrook, Texas ||
|-id=858
| 22858 Suesong || || Sue Song mentored a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. She teaches at the Palos Verdes Intermediate School, Palos Verdes, California ||
|-id=860
| 22860 Francylemp || || Francy M. Lemp mentored a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. She teaches at the Lemp Home School, Waterford, Michigan ||
|-id=862
| 22862 Janinedavis || || Janine Davis mentored a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. She teaches at the Bonaire Middle School, Bonaire, Georgia ||
|-id=863
| 22863 Namarkarian || || Nanor Markarian mentored a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. She teaches at the A.G.B.U. Manoogian Demirdjan School, Canoga Par, California ||
|-id=865
| 22865 Amymoffett || || Amy Moffett mentored a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. She teaches at the Cocoa Beach Junior/Senior High School, Cocoa Beach, Florida ||
|-id=868
| 22868 Karst || || Carol A. Karst mentored a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. She teaches at the Sunburst Elementary School, Sunburst, Montana ||
|-id=869
| 22869 Brianmcfar || || Brian McFarland mentored a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. He teaches at the H.B. DuPont Middle School, Hockessin, Delaware ||
|-id=870
| 22870 Rosing || || Wayne Rosing (born 1946) is an electrical engineer and computer industry executive. ||
|-id=871
| 22871 Ellenoei || || Ellen C. Oei mentored a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. She teaches at the Oei Home School, Hebron, Connecticut ||
|-id=872
| 22872 Williamweber || || William James Weber mentored a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. He teaches at the Christina Huddleston Elementary School, Lakeville, Minnesota ||
|-id=873
| 22873 Heatherholt || || Heather Holt mentored a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. She teaches at the Miami Lakes Middle School, Miami, Florida ||
|-id=874
| 22874 Haydeephelps || || Haydee Phelps mentored a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. She teaches at the Summit Middle School, Boulder, Colorado ||
|-id=875
| 22875 Lanejackson || || Lane L. Jackson mentored a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. She teaches at the Ropesville Independent School District, Ropesville, Texas ||
|-id=877
| 22877 Reginamiller || || Regina Miller mentored a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. She teaches at the Mountain Ridge Middle School, Colorado Springs, Colorado ||
|-id=880
| 22880 Pulaski || || A Polish soldier, Kazimierz Michal Waclaw Wiktor Pulaski (1745–1779), is often called "the father of American cavalry" in reference to training he provided to the Continental Army during the American Revolution. In Illinois, an eponymous holiday is traditionally held on the first Monday in March to celebrate Polish culture ||
|-id=885
| 22885 Sakaemura || || Sakaemura is a small mountainside village in Nagano prefecture, Japan. ||
|-id=889
| 22889 Donnablaney || || Donna Blaney mentored a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. She teaches at the Takoma Park Middle School, Silver Spring, Maryland ||
|-id=890
| 22890 Ruthaellis || || Rutha Ellis mentored a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. She teaches at the Lincoln Middle School, Bradenton, Florida ||
|-id=898
| 22898 Falce || || Falce, Italian for "Scythe", nickname of Renato Conedera, the discoverer's father-in-law. ||
|-id=899
| 22899 Alconrad || || Albert R. Conrad (born 1953) has been a dedicated adaptive-optics (AO) scientist at several U.S. observatories. Using AO, he has co-discovered many satellites of asteroids and made disk-resolved studies of asteroids and planetary satellites for size/shape/pole and topography. He has developed many innovative AO techniques. ||
|-id=900
| 22900 Trudie || || Trudie R. Wilson (1913–2001), mother of the discoverer. ||
|}
22901–23000
|-
| 22901 Ivanbella || || Ivan Bella (born 1964 ), a Slovak cosmonaut ||
|-id=903
| 22903 Georgeclooney || || George Clooney (born 1961), an American actor ||
|-id=905
| 22905 Liciniotoso || || Licinio Toso (1920–1999), grandfather of Italian astronomer Alberto Toso, member of the discovering team at Farra d'Isonzo Observatory ||
|-id=906
| 22906 Lisauckis || || Rhonda Lisauckis mentored a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. She teaches at the Covenant Christian Academy, Huntsville, Alabama ||
|-id=907
| 22907 van Voorthuijsen || || Lorrie van Voorthuijsen mentored a finalist in the 2006 Discovery Channel Young Scientist Challenge (DCYSC), a middle school science competition. She teaches at the van Voorthuijsen Home School, Lecanto, Florida ||
|-id=908
| 22908 Bayefsky-Anand || || Sarah Dana Bayefsky-Anand, American finalist in the 2007 Intel Science Talent Search (ISTS) ||
|-id=909
| 22909 Gongmyunglee || || Gongmyung Lee, American finalist in the 2007 Intel Science Talent Search (ISTS) ||
|-id=910
| 22910 Ruiwang || || Rui Wang, American finalist in the 2007 Intel Science Talent Search (ISTS) ||
|-id=911
| 22911 Johnpardon || || John Vincent Pardon, American finalist in the 2007 Intel Science Talent Search (ISTS) ||
|-id=912
| 22912 Noraxu || || Nora Xu, American finalist in the 2007 Intel Science Talent Search (ISTS) ||
|-id=913
| 22913 Brockman || || Gregory Drew Brockman, American finalist in the 2007 Intel Science Talent Search (ISTS) ||
|-id=914
| 22914 Tsunanmachi || || Tsunanmachi, a town in Niigata prefecture, Japan. ||
|-id=919
| 22919 Shuwan || || Shu Wan, American finalist in the 2007 Intel Science Talent Search (ISTS) ||
|-id=920
| 22920 Kaitduncan || || Kaitlin Duncan, American finalist in the 2007 Intel Science Talent Search (ISTS) ||
|-id=921
| 22921 Siyuanliu || || Siyuan Liu, American finalist in the 2007 Intel Science Talent Search (ISTS) ||
|-id=922
| 22922 Sophiecai || || Sophie Cai, American finalist in the 2007 Intel Science Talent Search (ISTS) ||
|-id=923
| 22923 Kathrynblair || || Kathryn Blair Friedman, American finalist in the 2007 Intel Science Talent Search (ISTS) ||
|-id=924
| 22924 Deshpande || || Neha Anil Deshpande, American finalist in the 2007 Intel Science Talent Search (ISTS) ||
|-id=927
| 22927 Blewett || || Megan Marie Blewett, American finalist in the 2007 Intel Science Talent Search (ISTS) ||
|-id=928
| 22928 Templehe || || Temple Mu He, American finalist in the 2007 Intel Science Talent Search (ISTS) ||
|-id=929
| 22929 Seanwahl || || Sean Matthew Wahl, American finalist in the 2007 Intel Science Talent Search (ISTS) ||
|-id=932
| 22932 Orenbrecher || || Oren Brecher, American finalist in the 2007 Intel Science Talent Search (ISTS) ||
|-id=933
| 22933 Mareverett || || Marshall Bradley Everett, American finalist in the 2007 Intel Science Talent Search (ISTS) ||
|-id=936
| 22936 Ricmccutchen || || Richard Matthew McCutchen, American finalist in the 2007 Intel Science Talent Search (ISTS) ||
|-id=937
| 22937 Nataliavella || || Natalie Avella Cameron, American finalist in the 2007 Intel Science Talent Search (ISTS) ||
|-id=938
| 22938 Brilawrence || || Brian Robert Lawrence, American finalist in the 2007 Intel Science Talent Search (ISTS) ||
|-id=939
| 22939 Handlin || || Daniel Adam Handlin, American finalist in the 2007 Intel Science Talent Search (ISTS) ||
|-id=940
| 22940 Chyan || || Yieu Chyan, American finalist in the 2007 Intel Science Talent Search (ISTS) ||
|-id=942
| 22942 Alexacourtis || || Alexandra Maria Courtis, American finalist in the 2007 Intel Science Talent Search (ISTS) ||
|-id=944
| 22944 Sarahmarzen || || Sarah Elizabeth Marzen, American finalist in the 2007 Intel Science Talent Search (ISTS) ||
|-id=945
| 22945 Schikowski || || Erin Marie Schikowski, American finalist in the 2007 Intel Science Talent Search (ISTS) ||
|-id=947
| 22947 Carolsuh || || Carol Yoon Joo Suh, American finalist in the 2007 Intel Science Talent Search (ISTS) ||
|-id=948
| 22948 Maidanak || || Maidanak, a mountainous region in southeast Uzbekistan. ||
|-id=951
| 22951 Okabekazuko || || Kazuko Okabe (born 1972), of the Japan Aerospace Exploration Agency, is the secretary of Junichiro Kawaguchi, project manager for the Hayabusa mission. ||
|-id=952
| 22952 Hommasachi || || Sachiko Homma (born 1965), of the Japan Aerospace Exploration Agency, is the secretary of Makoto Yoshikawa, project scientist for the Hayabusa mission ||
|-id=957
| 22957 Vaintrob || || Dmitry Vaintrob, American finalist in the 2007 Intel Science Talent Search (ISTS) ||
|-id=958
| 22958 Rohatgi || || Abhinav Rohatgi, American finalist in the 2007 Intel Science Talent Search (ISTS) ||
|-id=978
| 22978 Nyrola || || Nyrölä is a small rural village in central Finland and the site of the countryside observatory of the astronomical association Jyväskylän Sirius ry at Nyrölä Observatory ||
|-id=981
| 22981 Katz || || Daniel Scott Katz, American finalist in the 2007 Intel Science Talent Search (ISTS) ||
|-id=982
| 22982 Emmacall || || Emma Call, American finalist in the 2007 Intel Science Talent Search (ISTS) ||
|-id=983
| 22983 Schlingheyde || || Catherine Schlingheyde, American finalist in the 2007 Intel Science Talent Search (ISTS) ||
|-id=987
| 22987 Rebeckaufman || || Rebecca Lynn Kaufman, American finalist in the 2007 Intel Science Talent Search (ISTS) ||
|-id=988
| 22988 Jimmyhom || || Jimmy Hom, American finalist in the 2007 Intel Science Talent Search (ISTS) ||
|-id=989
| 22989 Loriskopp || || Lori Skopp, American mentor of a 2007 Intel Science Talent Search (ISTS) finalist ||
|-id=990
| 22990 Mattbrenner || || Matthew Brenner, American mentor of a 2007 Intel Science Talent Search (ISTS) finalist ||
|-id=991
| 22991 Jeffreyklus || || Jeffrey Klus, American mentor of a 2007 Intel Science Talent Search (ISTS) finalist ||
|-id=992
| 22992 Susansmith || || Susan Smith, American mentor of a 2007 Intel Science Talent Search (ISTS) finalist ||
|-id=993
| 22993 Aferrari || || Andrew Ferrari, American mentor of a 2007 Intel Science Talent Search (ISTS) finalist ||
|-id=994
| 22994 Workman || || David Workman, American mentor of a 2007 Intel Science Talent Search (ISTS) finalist ||
|-id=995
| 22995 Allenjanes || || Allen Janes, American mentor of a 2007 Intel Science Talent Search (ISTS) finalist ||
|-id=996
| 22996 De Boo || || Edward de Boo, American mentor of a 2007 Intel Science Talent Search (ISTS) finalist ||
|-id=998
| 22998 Waltimyer || || David Waltimyer, American mentor of a 2007 Intel Science Talent Search (ISTS) finalist ||
|-id=999
| 22999 Irizarry || || Carmen Irizarry, American mentor of a 2007 Intel Science Talent Search (ISTS) finalist ||
|}
References
022001-023000
|
29052941
|
https://en.wikipedia.org/wiki/Samsung%20Kies
|
Samsung Kies
|
Samsung Kies is a freeware software application used to communicate between Windows or Macintosh operating systems, and recently manufactured Samsung mobile phone and tablet computer devices, usually using a USB connection (though wireless LAN Kies connectivity is now possible using some devices). Samsung has released new software to replace Kies, named Samsung Smart Switch, which is mainly directed at migrating customers onto new Samsung devices. The name K.I.E.S. originated as an acronym for "Key Intuitive Easy System". After version 2.0, the name was shortened to "Kies".
Versions
Kies is available in several versions and editions, depending on the specific Samsung device and the OS it is running. Kies (currently in version 2.6.4.20043_5) supports devices with Android 2.1 through 4.2. Kies3 (version 3.x) supports devices with Android Jelly Bean (4.3 and up). Trying to use Kies with newer devices, or Kies3 with older devices, results in an error message.
There is also a Kies Mini version, which is available only for specific devices such as Samsung Captivate, Infuse, or Vibrant. It is used to update these devices' operating systems (OS versions). Though there are both Windows and Macintosh versions of the full Kies product, there is only a Windows version of Kies Mini for most Samsung devices; however, non-Windows users may overcome this limitation by using a Windows virtual machine, installing Kies Mini within it and connecting a Samsung device via USB cable to accomplish the OS update. On Windows devices, the file transfer happens via a plug-and-play mode.
Since 2012, Intel processors mounted the Cache Acceleration Software, which was tuned by system administrators when connected with SSD cards.
Although Kies connectivity has traditionally been via mini or micro-USB cable (needing some software, and not plug and play), wireless LAN connectivity between a Samsung device on which the Kies Wireless Android app is running, and any Windows or Macintosh computer running the Kies full version, is now also possible. The Kies Wireless app also supports wireless connectivity with other devices via the other devices' web browsers. All such connectivity, though, must be via a local Wi-Fi connection (and not via cellular 2G, 3G, or 4G data networks) wherein all involved devices are on the same Wi-Fi LAN.
The full version of Kies may be downloaded from the Samsung Global Download Center or from the download part of an individual mobile device's technical support web page on the Samsung website. With few exceptions, it is only the Kies Mini version, and not the full version, that is downloadable from a given Samsung device.
Smart Switch is part of a technical and commercial strategy finalized to connect all electronics in a unique semi-automation system, which is managed via a smartphone central app of Samsung.
Alternative software
Since 2012, most of the Intel product line just mounted the Cache Acceleration Software, both as an accelerator and a temporary database in connection with the parallel subsystem named Intel Management Engine (with ring-3 privilege inside the device).
Although lockstep, simple and oldest Trivial File Transfer Protocol was optimized for a client-server network, far different from a one-to-one and peer-to-peer connection.
Android File Transfer for Linux is a FOSS app, stable since version 2.2., though FOSS has somewhere (e.g. on GitHub) protected under the copyright law, and subject to file robots.txt mirroring exclusions.
System requirements
References
External links
Mobile device management software
Kies
Samsung software
|
1885640
|
https://en.wikipedia.org/wiki/Autopackage
|
Autopackage
|
Autopackage is a free computer package management system aimed at making it simple to create a package that can be installed on all Linux distributions, created by Mike Hearn around 2002.
In August 2010, Listaller and Autopackage announced that the projects will merge.
Projects such as aMSN and Inkscape offered an Autopackage installer, and Freecode offered content submitters a field to put the URL of Autopackages. The list of available packages is very limited, and most program versions are obsolete (for example, the most recent Autopackage of GIMP is 2.2.6, even though GIMP is now at version 2.8.2, as of August 2012).
Methodology
Autopackage was designed for installing binary, or pre-compiled, versions of non-core applications such as word processors, web browsers, and personal computer games, rather than core libraries and applications such as operating system shells.
Concept of autopackage was to "improve" Linux to a desktop platform, with stable binary interfaces comparable to Windows and MacOS.
Autopackage is not intended to provide installation of core applications and libraries for compatibility reasons. Using Autopackage to distribute non-core libraries is something of a thorny issue. On the one hand distributing them via Autopackage allows installation on a greater range of systems, on the other hand there can be conflicts with native package dependencies.
Autopackage is intended as a complementary system to a distribution's usual packaging system, such as RPM and deb. Unlike these formats, Autopackage verifies dependencies by checking for the presence of deployed files, rather than querying a database of installed packages. This simplifies the design requirements for autopackage by relying on available resources, rather than necessitating tracking all the package choices of all targeted distributions.
Programs that use autopackage must also be relocatable, meaning they must be installable to varying directories with a single binary. This enables an autopackage to be installed by a non-root user in the user's home directory.
Package format
Autopackage packages are indicated by the .package extension. They are executable bash scripts, and can be installed by running them. Files in an Autopackage archive are not easily extracted by anything other than Autopackage itself as the internal format must be parsed in order to determine file layout and other issues.
Autopackage programs are installed to hard-coded system paths, which may conflict with existing packages installed by other means, thus leading to corruption. This can usually be remedied by uninstalling an older version of a package being installed with Autopackage.
The Autopackage files can also be installed and removed using the Listaller toolset. Listaller simply includes the Autopackage packages into its own package container format and handles Autopackage like any other Listaller package file.
See also
AppImage
Flatpak
Zero Install
Listaller
Package management system
Bundle (software distribution)
Linux package formats
List of software package management systems
References
External links
Archive formats
Free package management systems
|
505528
|
https://en.wikipedia.org/wiki/Bill%20Gosper
|
Bill Gosper
|
Ralph William Gosper Jr. (born April 26, 1943), known as Bill Gosper, is an American mathematician and programmer. Along with Richard Greenblatt, he may be considered to have founded the hacker community, and he holds a place of pride in the Lisp community. The Gosper curve and the Gosper's algorithm are named after him.
Becoming a hacker
In high school, Gosper was interested in model rockets until one of his friends was injured in a rocketry accident and contracted a fatal brain infection. Gosper enrolled in MIT in 1961, and he received his bachelor's degree in mathematics from MIT in 1965 despite becoming disaffected with the mathematics department because of their anti-computer attitude.
In his second year at MIT, Gosper took a programming course from John McCarthy and became affiliated with the MIT AI Lab.
His contributions to computational mathematics include HAKMEM and the MIT Maclisp system. He made major contributions to Macsyma, Project MAC's computer algebra system. Gosper later worked with Symbolics and Macsyma, Inc. on commercial versions of Macsyma.
In 1974, he moved to Stanford University, where he lectured and worked with Donald Knuth.
Since that time, he has worked at or consulted for Xerox PARC, Symbolics, Wolfram Research, the Lawrence Livermore Laboratory, and Macsyma Inc.
Key contributions
Conway's Game of Life
He became intensely interested in the Game of Life shortly after John Horton Conway had proposed it. Conway conjectured the existence of infinitely growing patterns, and offered a reward for an example. Gosper was the first to find such a pattern, the glider gun, and won the prize. Gosper was also the originator of the Hashlife algorithm that can speed up the computation of Life patterns by many orders of magnitude.
Packing problems
Gosper has created numerous packing problem puzzles, such as "Twubblesome Twelve".
Symbolic computation
Gosper was the first person to realize the possibilities of symbolic computation on a computer as a mathematics research tool, whereas computer methods were previously limited to purely numerical methods. In particular, this research resulted in his work on continued fraction representations of real numbers and Gosper's algorithm for finding closed form hypergeometric identities.
In 1985, Gosper briefly held the world record for computing the most digits of pi with 17 million digits. See chronology of computation of π.
Space-filling curves
In the continuity of early 20th century examples of space-filling curves—the Koch-Peano curve, Cesàro and Lévy C curve, all special cases of the general de Rham curve—and following the path of Benoit Mandelbrot, Gosper discovered the Peano-Gosper curve, before engaging with variations on the Harter-Heighway dragon. In the late 80s, Gosper independently discovered the Gosper-Lafitte triangle.
See also
Hackers: Heroes of the Computer Revolution
References
External links
Bill Gosper's webpage which contains a Biography
Bill Gosper's Graphics
Twubblesome Twelve Puzzle - version for the free Mathematica Player
1943 births
Living people
20th-century American mathematicians
21st-century American mathematicians
Number theorists
Massachusetts Institute of Technology School of Science alumni
Cellular automatists
Recreational mathematicians
People from Pennsauken Township, New Jersey
Lisp (programming language) people
American computer businesspeople
Scientists at PARC (company)
|
8530037
|
https://en.wikipedia.org/wiki/ADX%20%28file%20format%29
|
ADX (file format)
|
CRI ADX is a lossy proprietary audio storage and compression format developed by CRI Middleware specifically for use in video games; it is derived from ADPCM. Its most notable feature is a looping function that has proved useful for background sounds in various games that have adopted the format, including many games for the Sega Dreamcast as well as some PlayStation 2, GameCube and Wii games. One of the first games to use ADX was Burning Rangers, on the Sega Saturn. Notably, the Sonic the Hedgehog series from the Dreamcast generation up to at least Shadow the Hedgehog have used this format for sound and voice recordings. Jet Set Radio Future for original Xbox also used this format.
On top of the main ADPCM encoding, the ADX toolkit also includes a sibling format, AHX, which uses a variant of MPEG-2 audio intended specifically for voice recordings and a packaging archive, AFS, for bundling multiple CRI ADX and AHX tracks into a single container file.
Version 2 of the format (ADX2) uses the HCA and HCA-MX extension, which are usually bundled into a container file with the extensions ACB and AWB.
The AWB extension is not to be confused with the Audio format with the same extension and mostly contains the binary data for the HCA files.
General overview
CRI ADX is a compressed audio format, but unlike MP3 and similar formats, it doesn't apply a psychoacoustic model to the sound to reduce its complexity. The ADPCM model instead stores samples by recording the error relative to a prediction function which means more of the original signal survives the encoding process; as such ADPCM compression instead trades accuracy of the representation for size by using relatively small sample sizes, usually 4bits. The human auditory system's tolerance for the noise this causes makes the loss of accuracy barely noticeable.
Like other encoding formats, CRI ADX supports multiple sampling frequencies such as 22050 Hz, 44100 Hz, 48000 Hz, etc. however, the output sample depth is locked at 16bits, generally due to the lack of precision already mentioned. It supports multiple channels but there seems to be an implicit limitation of stereo (2 channel) audio although the file format itself can represent up to 255 channels. The only particularly distinctive feature that sets CRI ADX apart from alternatives like IMA ADPCM (other than having a different prediction function) is the integrated looping functionality, this enables an audio player to optionally skip backwards after reaching a single specified point in the track to create a coherent loop; hypothetically, this functionality could be used to skip forwards as well but that would be redundant since the audio could simply be clipped with an editing program instead.
For playback there are a few plugins for WinAmp and a convert to wave tool (see the references section). The open source program / library FFmpeg also has CRI ADX support implemented, however, its decoder is hard coded so can only properly decode 44100 Hz ADXs.
Technical description
The CRI ADX specification is not freely available, however the most important elements of the structure have been reverse engineered and documented in various places on the web. The information here may be incomplete but should be sufficient to build a working codec or transcoder.
As a side note, the AFS archive files that CRI ADXs are sometimes packed in are a simple variant of a tarball which uses numerical indices to identify the contents rather than names. Source code for an extractor can be found in the ADX archive at.
File header
The ADX disk format is defined in big-endian. The identified sections of the main header are outlined below:
Fields labelled "Unknown" contain either unknown data or are apparently just reserved (i.e. filled with null bytes). Fields labelled with 'v3' or 'v4' but not both are considered "Unknown" in the version they are not marked with. This header may be as short as 20 bytes (0x14), as determined by the copyright offset, which implicitly removes support for a loop since those fields are not present.
The "Encoding Type" field should contain one of:
0x02 for CRI ADX with pre-set prediction coefficients
0x03 for Standard CRI ADX
0x04 for CRI ADX with an exponential scale
0x10 or 0x11 for AHX
The "Version" field should contain one of:
0x03 for CRI ADX 'version 3'
0x04 for CRI ADX 'version 4'
0x05 for a variant of CRI ADX 4 without looping support
When decoding AHX audio, the version field does not appear to have any meaning and can be safely ignored.
Files with encoding type '2' use 4 possible sets of prediction coefficients as listed below:
Sample format
CRI ADX encoded audio data is broken into a series of 'blocks', each containing data for only one channel. The blocks are then laid out in 'frames' which consist of one block from every channel in ascending order. For example, in a stereo (2 channel) stream this would consist of Frame 1: left channel block, right channel block; Frame 2: left, right; etc. Blocks are usually always 18 bytes in size containing 4bit samples though other sizes are technically possible, an example of such a block looks like this:
The first 3 bits of the 'Predictor/Scale' integer contain the predictor index. The scale is contained in the remaining 13 bits.
The predictor index is a 3bit integer that specifies which prediction coefficient set should be used to decode that block. This is only used in files with encoding type '2'.
The scale is a 13bit unsigned integer (big-endian like the header) which is essentially the amplification of all the samples in that block. Each sample in the block must be decoded in bit-stream order, that is, most significant bit first. For example, when the sample size is 4bits:
The samples themselves are not in reverse so there is no need to fiddle with them once they are extracted. Each sample is signed so for this example, the value can range between -8 and +7 (which will be multiplied by the scale during decoding). As an aside, although any bit-depth between 1 and 255 is made possible by the header. It is unlikely that one bit samples would ever occur as they can only represent the values {0, 1}, {-1, 0} or {-1, 1}, all of which are not particularly useful for encoding songs — if they were to occur then it is unclear which of the three possibilities is the correct interpretation.
CRI ADX decoding
This section walks through decoding CRI ADX 'version 3' or 'version 4' when "Encoding Type" is "Standard CRI ADX" (0x03). An encoder can also be built by simply flipping the code to run in reverse. All code samples in this section are written using C99.
Before a 'standard' CRI ADX can be either encoded or decoded, the set of prediction coefficients must be calculated. This is generally best done in the initialisation stage:
#define M_PI acos(-1.0)
double a, b, c;
a = sqrt(2.0) - cos(2.0 * M_PI * ((double)adx_header->highpass_frequency / adx_header->sample_rate));
b = sqrt(2.0) - 1.0;
c = (a - sqrt((a + b) * (a - b))) / b; //(a+b)*(a-b) = a*a-b*b, however the simpler formula loses accuracy in floating point
// double coefficient[2];
coefficient[0] = c * 2.0;
coefficient[1] = -(c * c);
This code calculates prediction coefficients for predicting the current sample from the 2 previous samples. These coefficients also form a first order Finite Impulse Response high-pass filter as well.
Once we know the decoding coefficients we can start decoding the stream:
static int32_t* past_samples; // Previously decoded samples from each channel, zeroed at start (size = 2*channel_count)
static uint_fast32_t sample_index = 0; // sample_index is the index of sample set that needs to be decoded next
static ADX_header* adx_header;
// buffer is where the decoded samples will be put
// samples_needed states how many sample 'sets' (one sample from every channel) need to be decoded to fill the buffer
// looping_enabled is a boolean flag to control use of the built-in loop
// Returns the number of sample 'sets' in the buffer that could not be filled (EOS)
unsigned decode_adx_standard( int16_t* buffer, unsigned samples_needed, bool looping_enabled )
{
unsigned const samples_per_block = (adx_header->block_size - 2) * 8 / adx_header->sample_bitdepth;
int16_t scale[ adx_header->channel_count ];
if (looping_enabled && !adx_header->loop_enabled)
looping_enabled = false;
// Loop until the requested number of samples are decoded, or the end of file is reached
while (samples_needed > 0 && sample_index < adx_header->total_samples)
{
// Calculate the number of samples that are left to be decoded in the current block
unsigned sample_offset = sample_index % samples_per_block;
unsigned samples_can_get = samples_per_block - sample_offset;
// Clamp the samples we can get during this run if they won't fit in the buffer
if (samples_can_get > samples_needed)
samples_can_get = samples_needed;
// Clamp the number of samples to be acquired if the stream isn't long enough or the loop trigger is nearby
if (looping_enabled && sample_index + samples_can_get > adx_header->loop_end_index)
samples_can_get = adx_header->loop_end_index - sample_index;
else if (sample_index + samples_can_get > adx_header->total_samples)
samples_can_get = adx_header->total_samples - sample_index;
// Calculate the bit address of the start of the frame that sample_index resides in and record that location
unsigned long started_at = (adx_header->copyright_offset + 4 + \
sample_index / samples_per_block * adx_header->block_size * adx_header->channel_count) * 8;
// Read the scale values from the start of each block in this frame
for (unsigned i = 0 ; i < adx_header->channel_count ; ++i)
{
bitstream_seek( started_at + adx_header->block_size * i * 8 );
scale[i] = ntohs( bitstream_read( 16 ) );
}
// Pre-calculate the stop value for sample_offset
unsigned sample_endoffset = sample_offset + samples_can_get;
// Save the bitstream address of the first sample immediately after the scale in the first block of the frame
started_at += 16;
while ( sample_offset < sample_endoffset )
{
for (unsigned i = 0 ; i < adx_header->channel_count ; ++i)
{
// Predict the next sample
double sample_prediction = coefficient[0] * past_samples[i*2 + 0] + coefficient[1] * past_samples[i*2 + 1];
// Seek to the sample offset, read and sign extend it to a 32bit integer
// Implementing sign extension is left as an exercise for the reader
// The sign extension will also need to include a endian adjustment if there are more than 8 bits
bitstream_seek( started_at + adx_header->sample_bitdepth * sample_offset + \
adx_header->block_size * 8 * i );
int_fast32_t sample_error = bitstream_read( adx_header->sample_bitdepth );
sample_error = sign_extend( sample_error, adx_header->sample_bitdepth );
// Scale the error correction value
sample_error *= scale[i];
// Calculate the sample by combining the prediction with the error correction
int_fast32_t sample = sample_error + (int_fast32_t)sample_prediction;
// Update the past samples with the newer sample
past_samples[i*2 + 1] = past_samples[i*2 + 0];
past_samples[i*2 + 0] = sample;
// Clamp the decoded sample to the valid range for a 16bit integer
if (sample > 32767)
sample = 32767;
else if (sample < -32768)
sample = -32768;
// Save the sample to the buffer then advance one place
*buffer++ = sample;
}
++sample_offset; // We've decoded one sample from every block, advance block offset by 1
++sample_index; // This also means we're one sample further into the stream
--samples_needed; // And so there is one less set of samples that need to be decoded
}
// Check if we hit the loop end marker, if we did we need to jump to the loop start
if (looping_enabled && sample_index == adx_header->loop_end_index)
sample_index = adx_header->loop_start_index;
}
return samples_needed;
}
Most of the above code should be straightforward enough for anyone versed in C. The 'ADX_header' pointer refers to the data extracted from the header as outlined earlier, it is assumed to have already been converted to the host Endian. This implementation is not intended to be optimal and the external concerns have been ignored such as the specific method for sign extension and the method of acquiring a bitstream from a file or network source. Once it completes, there will be samples_needed sets (if stereo, there will be pairs for example) of samples in the output buffer. The decoded samples will be in host-endian standard interleaved PCM format, i.e. left 16bit, right 16bit, left, right, etc. Finally, if looping is not enabled, or not supported, then the function will return the number of sample spaces that were not used in the buffer. The caller can test if this value is not zero to detect the end of the stream and drop or write silence into the unused spaces if necessary.
Encryption
CRI ADX supports a simple encryption scheme which XORs values from a linear congruential pseudorandom number generator with the block scale values. This method is computationally inexpensive to decrypt (in keeping with CRI ADX's real-time decoding) yet renders the encrypted files unusable. The encryption is active when the "Flags" value in the header is 0x08. As XOR is symmetric the same method is used to decrypt as to encrypt. The encryption key is a set of three 16-bit values: the multiplier, increment, and start values for the linear congruential generator (the modulus is 0x8000 to keep the values in the 15-bit range of valid block scales). Typically all ADX files from a single game will use the same key.
The encryption method is vulnerable to known-plaintext attacks. If an unencrypted version of the same audio is known the random number stream can be easily retrieved and from it the key parameters can be determined, rendering every CRI ADX encrypted with that same key decryptable. The encryption method attempts to make this more difficult by not encrypting silent blocks (with all sample nybbles equal to 0), as their scale is known to be 0.
Even if the encrypted CRI ADX is the only sample available, it is possible to determine a key by assuming that the scale values of the decrypted CRI ADX must fall within a "low range". This method does not necessarily find the key used to encrypt the file, however. While it can always determine keys that produce an apparently correct output, errors may exist undetected. This is due to the increasingly random distribution of the lower bits of the scale values, which becomes impossible to separate from the randomness added by the encryption.
AHX decoding
As noted earlier, AHX is just an implementation of MPEG2 audio and the decoding method is basically the same as the standard, it is possible just to demux the stream from the CRI ADX container and feed it through a standard MPEG Audio decoder like mpg123. The CRI ADX header's "sample rate" and "total samples" are usually correct if a decoder needs them (so should be set by encoder/muxer implementations) but most of the other fields such as the "block size" and "sample bitdepth" will usually be zero — as noted above, the looping functionality is also unavailable.
References
External links
ADX product page at CRI Middleware website
vgmstream WinAMP codec with source (supports ADX)
Dreamcast utilities including ADX converters with source ( ( 2009-10-24)
CRI ADX Description from multimedia.cx Wiki
ADX technical description on vgmstream Wiki
Audio codecs
Lossy compression algorithms
Computer file formats
Articles with example C code
|
1572696
|
https://en.wikipedia.org/wiki/Theme%20%28computing%29
|
Theme (computing)
|
In computing, a theme is a preset package containing graphical appearance and functionality details. A theme usually comprises a set of shapes and colors for the graphical control elements, the window decoration and the window. Themes are used to customize the look and feel of a piece of computer software or of an operating system.
Usage
Themes are often used to change the look and feel of a wide range of things at once, which makes them much less granular than allowing the user to set each option individually. For example, you might want the window-borders from a particular theme, but installing it would also alter your desktop background.
One method for dealing with this is to allow the user to select which parts of the theme they want to load; for example in Windows 98, you could load the background and screensaver from a theme, but leave your icons and sounds untouched.
Themed systems
Operating systems
Microsoft Windows supported themes since Windows 98. This operating system and its successor, Windows ME, came with themes that customized desktop backgrounds, icons, user interface colors, Windows sounds and mouse cursors. A separate application package called Plus! for Windows 95 added the same features to Windows 95. Windows XP expanded Windows theme support by adding Windows XP visual styles and allowing each theme to specify one. This feature was carried over to Windows Vista, which added Windows Aero, but was removed again with Windows 8. Third-party apps such as WindowBlinds, TuneUp Utilities and Desktop Architect enhance theme capabilities. Support for custom themes can also be added by patching system files, which Microsoft does not endorse.
Linux operating systems may support themes depending on their window managers and desktop environments. IceWM uses themes to customize its taskbar, window borders, and time format. WindowMaker can store colors for icons, menus, and window-borders in a theme, but this is independent of the wallpaper settings. GNOME and KDE use two independent sets of themes: one to alter the appearance of user interface elements (such as buttons, scroll bars or list elements), and another theme to customize the appearance of windows (such as, window borders and title bars).
MacOS does not natively support themes. Third-party apps such as Kaleidoscope and ShapeShifter may add this.
Although Android does not support themes, the forked CyanogenMod and its successor LineageOS have native theme support. The CM theme engine is in turn used on many other forked Android ROMs, such as Paranoid Android.
Apps
Firefox and Google Chrome either support or supported a form of theme. Firefox (and its sibling Thunderbird) supports themes either through lightweight themes (formerly Personas) or complete themes. While lightweight themes are simply background images for toolbar Firefox toolbars, complete themes have more power to modify Firefox's appearance. Google Chrome version 3.0 or later allows themes to alter the appearance of the browser. Internet Explorer 5 and its immediate successor allowed the background picture of their toolbars to be customized.
See also
Skin (computing)
Computer wallpaper
Look and feel
User interface engineering
Industrial design
Aqua (user interface)
References
Graphical user interfaces
Software add-ons
|
38283909
|
https://en.wikipedia.org/wiki/Flashcache
|
Flashcache
|
Flashcache is a disk cache component for the Linux kernel, initially developed by Facebook since April 2010, and released as open source in 2011. Since January 2013, there is a fork of Flashcache, named EnhanceIO and developed by sTec, Inc. Since 2015 that fork became unmaintained and it was forked again and maintained by individuals.
Flashcache works by using flash memory, a USB flash drive, SD card, CompactFlash or any kind of portable flash mass storage system as a write-back persistent cache. An internal SSD can also be used for increasing performance.
Overview
Using flash memory (NAND memory devices) for caching allows Linux kernel to service random disk IO with better performance than without the cache. This caching applies to all disk content, not just the page file or system binaries. Flash memory based devices are usually a magnitude faster than spinning HDDs for random IO, but with less advantage or even slower in sequential read/writes. By default, flashcache caches all full blocksize IOs, but can be configured to only cache random IO whilst ignoring sequential IO.
Similar technology exists in Microsoft Windows as ReadyBoost since Windows Vista.
Implementation
Flashcache is built on top of the Linux kernel's device mapper. The data structure of the cache is a set-associative hash table, in which the cache is divided up into a number of fixed-size sets (buckets), using linear probing within a set to find blocks. The device mapper layer breaks up all I/O requests into blocksize chunks before passing the requests to the cache layer.
When a write request happens, the corresponding cache block is marked dirty; dirty cache blocks are written lazily to disk in the background. There are a few parameters to control the write-back policy: dirty-threshold, idleness and contiguity with other dirty blocks about to be written back.
Limitations
There are a few limitations, imposed by the implementation of flashcache:
Atomicity
Cache block writes are currently non-atomic.
TRIM support
ATA TRIM command to optimize flash memory are not yet supported.
Cache pollution protection
A process can be marked non-cacheable to prevent flashcache cache its requests; however, if a process that marked itself non-cacheable dies, flashcache has no way of cleaning up.
Alignment
Relying on the device mapper resulted in caching performance issues and no caching of writes that are not multiple of 4 KiB. Primarily, this affects the Xen hypervisor. Thus, EnhanceIO has moved away from the device mapper integration, yielding higher performance for unoptimal use cases.
Write-around read latency impact
in write-around mode all writes bypass the cache for high consistency. The current implementation will fetch reads through the SSD device and then deliver them to the actual reader. This means that previously uncached blocks will always need to go to the SSD device first, causing a constant write IO. Not an issue on enterprise SSD or highend PCIe devices as facebook uses, but degrades performance on lower end SSD.
Write-around read cache warm-up phase
in write-around mode FlashCache has no information to compare the age of cached pages over the on-disk ones. (1) Because the device could have been mounted outside of FlashCache (2) Because no writes are tracked in this mode. This results in an empty cache after each volume activation (i.e.: reboot). Performance will be degraded until all hot areas have been cached.
See also
bcache
dm-cache
Cache Acceleration Software (Intel's product)
References
External links
Performance Comparison among EnhanceIO, bcache and dm-cache (LKML)
EnhanceIO, Bcache & DM-Cache Benchmarked
Flashcache at Facebook: From 2010 to 2013 and beyond
Facebook Releases Flashcache 3.0
Solid-state caching
Linux kernel-related software
|
38228787
|
https://en.wikipedia.org/wiki/Pack%20%28compression%29
|
Pack (compression)
|
Pack is a (now deprecated) Unix shell compression program based on Huffman coding.
The unpack utility will restore files to their original state after they have been compressed using the pack utility. If no files are specified, the standard input will be uncompressed to the standard output.
Although obsolete, support for packed files exists in modern compression tools such as gzip and 7-zip.
Description of program
Files compressed by pack are typically given the extension ".z" (not to be confused with the ".Z" of compress). Files can be returned to their original state using unpack. In addition, there may also be a pcat command which reads in a compressed file and sends its output to stdout.
See also
Data compression
Image compression
List of Unix commands
References
External links
Pack command Manual
Data compression software
Unix archivers and compression-related utilities
|
426391
|
https://en.wikipedia.org/wiki/Freedesktop.org
|
Freedesktop.org
|
freedesktop.org (fd.o) is a project to work on interoperability and shared base technology for free-software desktop environments for the X Window System (X11) and Wayland on Linux and other Unix-like operating systems. It was founded by Havoc Pennington, a GNOME developer working for Red Hat in March 2000. The project's servers are hosted by Portland State University, sponsored by Hewlett-Packard, Intel, and Google.
Widely used open-source X-based desktop projects, such as GNOME, KDE's Plasma Desktop, and Xfce, are collaborating with the freedesktop.org project. In 2006, the project released Portland 1.0 (xdg-utils), a set of common interfaces for desktop environments. However, freedesktop.org is a "collaboration zone" for standards and specifications where users can freely discuss ideas, and not a formal standards organization.
freedesktop.org was formerly known as the X Desktop Group, and the abbreviation "XDG" remains common in their work.
freedesktop.org joined the X.Org Foundation in 2019.
All freedesktop.org projects are covered by Coraline Ada Ehmke's Contributor Covenant code of conduct which aims to ensure a harassment-free and inclusive environment for developers.
Hosted projects
freedesktop.org provides hosting for a number of relevant projects. These include:
Windowing system and graphics
Software related to windowing systems and graphics in general
Cairo, a vector graphics library with cross-device output support
Direct Rendering Infrastructure (DRI), Linux API to access the graphics hardware, used by X11, Wayland compositors, Mesa 3D, etc.
Glamor, 2D graphics common driver for X server, it supports a variety of graphics chipsets which have supports for OpenGL/EGL/GBM APIs
Mesa 3D, an implementation of OpenGL
Pixman, is a low-level software library for pixel manipulation, providing features such as image compositing and trapezoid rasterization. Important users of pixman are the cairo graphics library and the X.Org Server
Poppler, a PDF rendering library
Video Acceleration API
Wayland, protocol to replace X11; features: no tearing, lag, redrawing or flicker
X.Org Server: the official reference implementation of the X11 protocol
XCB, an Xlib replacement.
Xephyr is a display server
Other
D-Bus, a message bus akin to DCOP (KDE 3) and Bonobo (GNOME 2)
Elektra, a library for reading and writing configuration
FreeType, a text rendering library.
fontconfig is a library for font discovery, name substitution, etc.
fprint, a library for the consumer fingerprint reader devices
Geoclue, a geoinformation service.
GStreamer is a cross-platform multimedia framework.
GTK-Qt engine, a GTK+ 2 engine which uses Qt to draw the graphical control elements, providing the same look and feel of KDE applications to GTK+2 applications.
HAL (Hardware Abstraction Layer) is a consistent cross-operating system layer; it has been deprecated and replaced by udev.
kmscon, userspace virtual console to replace Linux console, uses KMS driver and supports Unicode
luit, a tool used by terminal emulators
libinput, a library to handle input devices in Wayland compositors and to provide a generic X.Org input driver. It provides device detection, device handling, input device event processing and abstraction to minimize the amount of custom input code compositors need to provide the common set of functionality that users expect
PulseAudio is a sound server frontend meant to provide software mixing, network audio, and per application volume control.
systemd is a comprehensive init framework to start and manage services and sessions meant to replace older init models.
Xft, anti-aliased fonts using the FreeType library, rather than the old X core fonts.
pkg-config is a helper program used to generate flags for compiler and linker to include necessary libraries.
Also, Avahi (a free Zeroconf implementation) started as a fd.o project but has since become a separate project.
Base Directory Specification
XDG Base Directory Specification (XDG BDS) introduces a range of variables where user-specific files used by programs should be found. Many tools and applications utilize these variables by default.
User directories
Besides the variables mentioned below, XDG BDS also specifies that users' local binary files may be installed into . Systems compliant with the spec are expected to make this directory available in their CLI's environment variable.
For user application's own data files
Default to
For user's app configuration files
Default to
For user-specific app session data, which should be stored for future reuse
Default to
May include logs, recently used files, application-specific information (e.g. window layout, views, opened files, undo history, etc.), akin to session data that should be stored by app by request of system session manager, like X session manager
For user-specific apps cache files
Default to
For user-specific app runtime files like sockets which may survive reboot and logout cycles
System directories
Colon-separated list of preference-ordered paths to search for data files in
Default to
The same as above but for config files
Default to
Stated aims
The project aims to catch interoperability issues much earlier in the process. It is not for legislating formal standards. Stated goals include:
Collect existing specifications, standards, and documents related to X desktop interoperability and make them available in a central location.
Promote the development of new specifications and standards to be shared among multiple X desktops.
Integrate desktop-specific standards into broader standards efforts, such as Linux Standard Base and the ICCCM.
Work on the implementation of these standards in specific X desktops.
Serve as a neutral forum for sharing ideas about X desktop technology.
Implement technologies that further X desktop interoperability and free X desktops in general.
Promote X desktops and X desktop standards to application authors, both commercial and volunteer.
Communicate with the developers of free operating system kernels, the X Window System itself, free OS distributions, and so on to address desktop-related problems.
Provide source repositories (git and CVS), web hosting, Bugzilla, mailing lists, and other resources to free software projects that work toward the above goals.
See also
Comparison of open source software hosting facilities
Linux on the desktop
References
Sources
The Big freedesktop.org Interview (Rayiner Hashem & Eugenia Loli-Queru, OSNews, 24 November 2003)
External links
Free and open-source software organizations
Free software websites
Projects established in 2000
X Window System
|
10784234
|
https://en.wikipedia.org/wiki/Arkansas%20Activities%20Association
|
Arkansas Activities Association
|
The Arkansas Activities Association (AAA) is the primary sanctioning body for high school sports in state of Arkansas. AAA is a member association of the National Federation of State High School Associations (NFSHSA). Every public secondary school in Arkansas is a de jure member of the AAA, and most private schools, save for a few schools in the delta that belong to the Mississippi Private Schools Association, are included in membership.
The Arkansas Activities Association, or "AAA," was founded in 1904 by seven high schools and colleges and was called the "Arkansas State Athletic Association." In 1912, the high schools separated from the colleges and became the "Arkansas Athletics Association." Membership increased rapidly, and eventually the name of the organization was changed to the "Arkansas Activities Association".
The following member organizations exist within AAA:
Athletic Directors: Arkansas High School Athletic Administrators Association (AHSAAA)
Coaches: Arkansas High School Coaches Association (AHSCA)
Officials: Arkansas Officials Association (AOA)
History
Prior to integration of public schools, the AAA only governed the activities of white schools. Until 1961, the association required special permission before an integrated school could compete with an all-white school, even in band. The first AAA-sanctioned meeting between a predominantly white school and a black school occurred October 28, 1966 between Little Rock Central High School and Little Horace Mann. Some integrated schools were admitted to the AAA by 1966, and all of the African-American schools were admitted to the AAA in 1967, but maintained separate districts. This resulted in a situation in which all-black Stuttgart Holman was to play partially integrated Pine Bluff Southeast, which had been admitted to the AAA in 1966, for the African-American championship. The AAA refused to allow the title game to take place, on the grounds that Holman was not a member of the association. In 1968 the districts were realigned to include black and white schools in the same districts.
Sanctioned sports
The AAA currently governs a total of 12 sports:
Fall
Bowling (Boys/Girls)
Cheer / Dance (Girls/Co-Ed)
Cross Country (Boys/Girls)
Football
Golf (Boys/Girls)
Volleyball (Girls)
Winter
Basketball (Boys/Girls)
Swimming and diving (Boys/Girls)
Wrestling (Boys/Girls)
Spring
Baseball (Boys)
Soccer (Boys/Girls)
Softball (Girls)
Tennis (Boys/Girls)
Track and field (Boys/Girls)
Other activities
Although the word "activities" is used in the name, the AAA is directly responsible only for interscholastic athletics. Other activities, including music, forensics, and spirit groups, are governed by their own associations affiliated with yet not part of the AAA, who is only responsible for sanctioning the events. These associations usually adopt the AAA's means of determining eligibility as well as its size classifications seen below, but regional classifications and means of organizing events are left only to their respective associations.
The AAA maintains affiliations with several non-sporting activities associations. These associations generally use AAA guidelines regarding a student's eligibility to participate.
Arkansas Communication and Theatre Arts Association (ACTAA) — a professional non-profit organization that serves the students and teachers of Oral Communication, Debate, Forensic Activities, Theatre, and Dance in Arkansas. ACTAA is affiliated with the Arkansas District of the National Forensics League.
Arkansas Association of Student Councils (AASC) — an organization that support student government and Student Council activities; affiliated with National Association of Student Councils (NASC).
Arkansas Junior Science & Humanities Symposium (AR JSHS) — annual event that is designed to challenge and engage students (Grades 9-12) in science, technology, engineering or mathematics (STEM). Individual students compete for scholarships and recognition by presenting the results of their original research efforts before a panel of judges and an audience of their peers.
Arkansas School Band and Orchestra Association (ASBOA) — supports students and educators with competitions in a variety of marching band, jazz band, and orchestra.
Arkansas Scholastic Press Association (ASPA) & Arkansas Journalism Advisors Association (AJAA) — provides students and educators with resources, competitions and programs focused on yearbook, newspaper, photography and digital media.
Arkansas FFA — chartered in 1928 and serves as state organization within the National FFA Organization.
Organization
The AAA organizes its member schools by 3-year average daily membership (ADM) in grades 10-12 every two years. Each classification is organized by rank, as opposed to a minimum threshold, to maintain consistent numbers for each class.
Classifications
Since 2006, the schools have been organized as follows.
Class 7A (16 largest schools)
Class 6A (next 16 largest schools)
Class 5A (next 32 largest schools)
Class 4A (next 48 largest schools that sponsor football ("football schools"), as well as all non-football schools within range)
Class 3A (same means as Class 4A)
Class 2A (next 48 largest schools and remainder of football schools)
Class 1A (all remaining schools)
The means of placing private schools within these classifications have become a key issue in Arkansas. Prior to 2002, only single-gender schools would have its enrollment altered, in this case by doubling the reported enrollment. In 2002, the enrollments reported by private schools was multiplied by 1.35. In 2006, that multiplier was increased to 1.75. Starting in 2008, the multiplier will be dropped altogether, and each private school will be placed one classification above where the enrollment would otherwise place the school. In 2012, enrollment for private schools that were segregated were combined (for example, Catholic High School for Boys with Mount Saint Mary Academy (for Girls)).
Within each classification, the schools are further grouped into conferences, each with 6-8 schools apiece. In Classes 7A-5A, the conferences are named according to directional region (i.e. 7A-West, 6A-Central, 5A-Southeast). In the smaller classes, the conferences are named according to the activity district number which the conference is centrally located (a class 4A conference in western Arkansas would be the 4A-4 conference). In smaller classes, there can be more than one conference within an activity district. These are further named according to directional area (a pair of class 2A conferences in southwest Arkansas would be the 2A-7 West and 2A-7 East). Classes 3A and 2A group conferences for football and basketball separately (Mountainburg is in Conference 3A-1 for football and 3A-4 for basketball). Finally, sports with limited sponsorship, such as soccer and swimming, have their own conferences between the participants. These special conferences often transcend multiple classes.
From 2010 to 2016, the rules for 7A and 6A classification for football were changed. The divisions still compete in separate playoffs, but two regional conferences that have previously been exclusive to 7A or 6A now have a mix of 7A and 6A schools so as to save on transportation expenses during the regular season.
Conferences
For purposes of clarity, the activity districts with regions covered are as follows.
District 1 (northwest Arkansas)
District 2 (north central Arkansas)
District 3 (northeast Arkansas)
District 4 (west Arkansas)
District 5 (central Arkansas)
District 6 (east Arkansas)
District 7 (southwest Arkansas)
District 8 (southeast Arkansas)
The AAA has changed both the names and means of these classifications over time.
Prior to 1977, the classes ranged from Class AAAA to Class C, with AAAA including the 8 largest schools in Arkansas. In 1977, the first "class shift" added an "A" to each class, and references to Class C were removed.
In 1983, Class AAAAA merged into and was renamed Class AAAA, with all other classes relatively consistent.
In 1998, the state witnessed the second "class shift", this time removing all references to Class B.
In 2006, Class AAAAA was split in half, and Classes AAA and AA, both with over 70 schools each, were reorganized into three smaller classes. At first, the largest class was called Class AAAAAAA. The current naming conventions, changing the reference to 7A, were adopted soon after.
Prior to 2006, the activity district number was placed in front of the class for conference names (i.e. 4AAA, 7AA-East). These naming conventions changed as well, but many local media outlets still placed the district number before the class (3-4A instead of 4A-3). Prior to this, a few outlets mixed prior references to new ones (some newspapers in western Arkansas made references to the 4AAA-West, yet such a conference never existed).
Class 7A
The following conferences exist within the 7A classification for the 2016–18 school years:
Central
Bryant Hornets
Cabot Panthers
Catholic Rockets / Mt. St. Mary's Belles
Little Rock Central Tigers
Conway Wampus Cats
North Little Rock Charging Wildcats
Fort Smith Northside Grizzlies
Fort Smith Southside Mavericks
West
Bentonville Tigers
Bentonville West Wolverines
Fayetteville Purple Bulldogs
Har-Ber Wildcats
Heritage War Eagles
Rogers Mountaineers
Springdale Bulldogs
Van Buren Pointers
Class 6A
The following conferences exist within the 6A classification for the 2016–18 school years:
East
Jacksonville Titans
Jonesboro Golden Hurricanes
Little Rock Hall Warriors
Marion Patriots
Mountain Home Bombers
Pine Bluff Zebras
Searcy Lions
West Memphis Blue Devils
West
Benton Panthers
El Dorado Wildcats
Greenwood Bulldogs
Lake Hamilton Wolves
Russellville Cyclones
Sheridan Yellowjackets
Siloam Springs Panthers
(Texarkana) Arkansas Razorbacks
Class 5A
The following conferences exist within the 5A classification for the 2016–18 school years:
East
Batesville Pioneers
Blytheville Chickasaws
Forrest City Mustangs
Greene County Tech Golden Eagles
Nettleton Raiders
Paragould Rams
Valley View Blazers
Wynne Yellowjackets
West
Alma Airedales
Clarksville Panthers
Farmington Cardinals
Greenbrier Panthers
Harrison Golden Goblins
Maumelle Hornets
Morrilton Devil Dogs
Vilonia Eagles
Central
Beebe Badgers
J. A. Fair War Eagles
Little Rock Christian Warriors
McClellan Crimson Lions
Mills Comets
Little Rock Parkview Patriots
Pulaski Academy Bruins
Sylvan Hills Bears
South
Camden Fairview Cardinals
De Queen Leopards
Hope Bobcats
Hot Springs Trojans
Hot Springs Lakeside Rams
Magnolia Panthers
Watson Chapel Wildcats
White Hall Bulldogs
Class 4A
The following conferences exist within the 4A classification for the 2016–18 school years:
Region 1
Berryville Bobcats
Gentry Pioneers
Gravette Lions
Huntsville Eagles
Lincoln Wolves
Pea Ridge Blackhawks
Prairie Grove Tigers
Shiloh Christian Saints
Region 2
Arkansas Baptist Eagles
Central Arkansas Christian Mustangs
E-Stem Mets (BB)
Heber Springs Panthers
Helena-West Helena Central Cougars
Lonoke Jackrabbits
Riverview Raiders
Southside–Batesville Southerners
Stuttgart Ricebirds
Region 3
Brookland Bearcats
Cave City Cavemen
Gosnell Pirates
Harrisburg Hornets
Highland Rebels
Pocahontas Redskins
Trumann Wildcats
Jonesboro Westside Warriors
Region 4
Booneville Bearcats
Dardanelle Sand Lizards
Dover Pirates
Ozark Hillbillies
Pottsville Apaches
Subiaco Academy Trojans
Waldron Bulldogs
West Fork Tigers
Region 7
Arkadelphia Badgers
Ashdown Panthers
Bauxite Miners
Fountain Lake Cobras
Malvern Leopards
Mena Bearcats
Nashville Scrappers
Joe T. Robinson Senators
Region 8
Crossett Eagles
DeWitt Dragons
Dollarway Cardinals
Dumas Bobcats
Hamburg Lions
Monticello Billies
Star City Bulldogs
Warren Lumberjacks
Class 3A
The conference membership within the 3A Classification are adjusted for schools that do not field a football team. The following conferences exist within the 3A classification for the 2016–18 school years:
Football
Region 1
Clinton Yellowjackets
Elkins Elks
Green Forest Tigers
Greenland Pirates
Marshall Bobcats
Melbourne Bearkatz
Mountain View Yellowjackets
Yellville–Summit Panthers
Region 2
Bald Knob Bulldogs
Barton Bears
Cedar Ridge Timberwolves
Episcopal Collegiate Wildcats
Harding Academy Wildcats
Lee Trojans
Mayflower Eagles
Rose Bud Ramblers
Region 3
Corning Bobcats
Hoxie Mustangs
Manila Lions
Newport Greyhounds
Osceola Seminoles
Piggott Mohawks
Rivercrest Colts
Walnut Ridge Bobcats
Region 4
Atkins Red Devils
Cedarville Pirates
Charleston Tigers
Lamar Warriors
Mansfield Tigers
Paris Eagles
Perryville Mustangs
Two Rivers Gators
Region 5
Bismarck Lions
Centerpoint Knights
Glen Rose Beavers
Gurdon Go-Devils
Haskell Harmony Grove Cardinals
Horatio Lions
Jessieville Lions
Prescott Curley Wolves
Region 6
Drew Central Pirates
Fordyce Redbugs
Fouke Panthers
Genoa Central Dragons
Junction City Dragons
Lakeside Lake Village Beavers
McGehee Owls
Smackover Buckaroos
Basketball
Region 1 West
Cedarville Pirates
Charleston Tigers
Elkins Elks
Greenland Pirates
Haas Hall Mastiffs
Mansfield Tigers
Region 1 East
Bergman Panthers
Clinton Yellowjackets
Green Forest Tigers
Marshall Bobcats
Melbourne Bearkatz
Mountain View Tigers
Valley Springs Tigers
Yellville–Summit Panthers
Region 2
Bald Knob Bulldogs
Barton Bears
Cedar Ridge Timberwolves
Harding Academy Wildcats
KIPP: Delta Prep
Lee Trojans
Newport Greyhounds
Tuckerman Bulldogs
Region 3
Corning Bobcats
Hoxie Mustangs
Manila Lions
Osceola Seminoles
Piggott Mohawks
Rivercrest Colts
Riverside Rebels
Walnut Ridge Bobcats
Region 4
Atkins Red Devils
Jessieville Lions
Lamar Warriors
Paris Eagles
Perryville Mustangs
Two Rivers Gators
Region 5
Bismarck Lions
Episcopal Collegiate Wildcats
Glen Rose Beavers
Haskell Harmony Grove Cardinals
LISA Academy Jaguars
Mayflower Eagles
Rose Bud Ramblers
Region 7
Centerpoint Knights
Cossatot River Eagles
Fouke Panthers
Genoa Central Dragons
Gurdon Go-Devils
Horatio Lions
Prescott Curley Wolves
Region 8
Drew Central Pirates
Fordyce Redbugs
Junction City Dragons
Lakeside Lake Village Beavers
McGehee Owls
Smackover Buckaroos
Class 2A
The conference membership within the 2A Classification are adjusted for schools that do not field a football team. The following conferences exist within the 2A classification for the 2016–18 school years:
Football
Region 3
Cross County Thunderbirds
Earle Bulldogs
East Poinsett County Warriors
KIPP: Blytheville Prep
Midland Mustangs
Marked Tree Indians
Rector Cougars
Salem Greyhounds
Region 4
Danville Little Johns
Decatur Bulldogs
Hackett Hornets
J. D. Leftwich Rattlers
Lavaca Golden Arrows
Mountainburg Dragons
Western Yell County Wolverines
Johnson County Westside Rebels
Region 5
Bigelow Panthers
Conway Christian Eagles
Cutter–Morning Star Eagles
England Lions
Hector Wildcats
Magnet Cove Panthers
Poyen Indians
Quitman Bulldogs
Region 6
Augusta Red Devils
Brinkley Tigers
Carlisle Bisons
Clarendon Lions
Des Arc Eagles
Hazen Hornets
Marvell Mustangs
McCrory Jaguars
Palestine–Wheatley Patriots
Region 7
Dierks Outlaws
Foreman Gators
Lafayette County Cougars
Mineral Springs Hornets
Mount Ida Lions
Mountain Pine Red Devils
Murfreesboro Rattlers
Spring Hill Bears
Region 8
Bearden Bears
Hampton Bulldogs
Camden Harmony Grove Hornets
Hermitage Hustlin' Hermits
Parkers Chapel Trojans
Rison Wildcats
Strong Bulldogs
Woodlawn Bears
Basketball
Region 2
Buffalo Island Central Mustangs
Cotter Warriors
East Poinsett County Warriors
Flippin Bobcats
Marked Tree Indians
Marmaduke Greyhounds
Salem Greyhounds
Sloan–Hendrix Greyhounds
Region 3
Augusta Red Devils
Brinkley Tigers
Carlisle Bisons
Clarendon Lions
Cross County Thunderbirds
Des Arc Eagles
Earle Bulldogs
Hazen Hornets
McCrory Jaguars
Palestine–Wheatley Patriots
Region 4 West
Arkansas Arts Academy
Danville Little Johns
Eureka Springs Highlanders
Hackett Hornets
J. D. Leftwich Rattlers
Lavaca Golden Arrows
Mountainburg Dragons
Johnson County Westside Rebels
Region 4 East
Bigelow Panthers
Conway Christian Eagles
England Lions
Hector Wildcats
Jacksonville Lighthouse School
Pangburn Tigers
Quitman Bulldogs
St. Joseph Bulldogs
White County Central Bears
7 West
Blevins Hornets
Caddo Hills Indians
Cutter–Morning Star Eagles
Foreman Gators
Magnet Cove Panthers
Mountain Pine Red Devils
Murfreesboro Rattlers
Poyen Indians
7 East
Bearden Bears
Camden Harmony Grove Hornets
Lafayette County Cougars
Parkers Chapel Trojans
Rison Wildcats
Spring Hill Bears
Class 1A
The following conferences exist within the 1A classification for the 2016–18 school years:
1 West
County Line Indians
Hartford Hustlers
Mulberry Yellowjackets
Oark Hornets
Scranton Rockets
St. Paul Saints
Western Yell County Wolverines
1 Northwest
Alpena Leopards
Decatur Bulldogs
Haas Hall: Bentonville
Kingston Yellowjackets
Lead Hill Tigers
Omaha Eagles
1 East
Bruno–Pyatt Patriots
Deer Antlers
Jasper Pirates
Mount Judea Eagles
St. Joe Wildcats
Western Grove Warriors
2 North
Calico Rock Pirates
Hillcrest Screamin' Eagles
Izard County Cougars
Mammoth Spring Bears
Norfork Panthers
Viola Longhorns
2 South
Bradford Eagles
Concord Pirates
Midland Mustangs
Rural Special Rebels
Shirley Blue Devils
South Side Bee Branch Hornets
Timbo Tigers
Greers Ferry West Side Eagles
3 East
Armorel Tigers
Bay Yellowjackets
Crowley's Ridge Academy Falcons
KIPP: Blytheville Prep
Maynard Tigers
Rector Cougars
Ridgefield Christian Warriors
5 North
Abundant Life Owls
Academics Plus Falcons
Avilla Christian Academy
Guy–Perkins Thunderbirds
LISA Academy North Jaguars
Marvell Mustangs
Mount Vernon–Enola Warhawks
Nemo Vista Red Hawks
Sacred Heart Rebels
Wonderview Daredevils
7 West
Acorn Tigers
Dierks Outlaws
Kirby Trojans
Mineral Springs Hornets
Mount Ida Lions
Oden Timberwolves
Umpire Wildcats
7 East
Bradley Bears
Emerson Pirates
Nevada Blue Jays
Ouachita Warriors
Taylor Tigers
Trinity Christian Warriors
8 East
Dermott Rams
Hampton Bulldogs
Hermitage Hustlin' Hermits
Sparkman Raiders
Strong Bulldogs
Woodlawn Bears
State championships
Academic competitions
The state's Quiz Bowl competitions are organized by the Arkansas Governor's Quiz Bowl Association (AGQBA) as sanctioned by the AAA.
List of Arkansas state high school quiz bowl champions
Each spring, the Arkansas Governor's Quiz Bowl Association holds the state tournament finals for each classification. These matches are broadcast on the Arkansas Educational Television Network (AETN).
7A classification
(Prior to 2006-2007 school year Arkansas had only five classification divisions.)
6A classification
(Prior to 2006-2007 school year Arkansas had only five classification divisions.)
5A classification
4A classification
3A classification
2A classification
1A classification
Fall sports
List of Arkansas state high school football champions
To decide a winner of each classification, each conference sends the top 4 teams within them to attend the state playoffs. All number 1 seed schools get a first round bye. The playoffs are in a single elimination tournament that decides the best teams in a classification. Rounds are played weekly until two teams remain in the tournament. The two remaining teams will play at a set location to decide the state champion in the classification. These rules for playoffs apply to football only.
List of Arkansas state high school volleyball champions
2016 – Fayetteville (3), Jonesboro (12), Valley View (11), Brookland (3), Paris (2)
2015 – Fayetteville (2), Marion (3), Valley View (10), Shiloh Christian, Paris
2014 – Bentonville (5), Russellville (4), Paragould (2) Mena, Mansfield (4)
2013 – FS Southside (8), Jonesboro (11), Paragould, Valley View (9), Mansfield (3)
2012 – Fayetteville, Russellville (3), Nettleton (3), Valley View (8), Mansfield (2)
2011 – Bentonville (4), Marion (2), Greenwood, Valley View (7), Harding Academy
2010 – Bentonville (3), Marion, Nettleton (2), Valley View (6), Crowley's Ridge Academy (6)
2009 – FS Southside (7), Benton, Siloam Springs (7), Jonesboro Westside (6), Mansfield
2008 – Bentonville (2), Jonesboro (10), Siloam Springs (6), Valley View (5), Lavaca
2007 – Bentonville, Lake Hamilton, Siloam Springs (5), Jonesboro Westside (5), Brookland (2)
2006 – FS Southside (6), Jonesboro (9), Siloam Springs (4), Valley View (4), Brookline
2005 – Russellville (7), Siloam Springs (3), Valley View (3)
2004 – FS Southside (5), Siloam Springs (2), Valley View (2)
2003 – FS Southside (4), Morrilton (2), Valley View
2002 – Jonesboro (8), Morrilton, Crowley's Ridge (5)
2001 – Jonesboro (7), Siloam Springs, Jonesboro Westside (4)
2000 – FS Southside (3), Harrison, Crowley's Ridge (4)
1999 – FS Southside (2), Crowley's Ridge (3)
1998 – Conway, Crowley's Ridge (2)
1997 – FS Southside, Crowley's Ridge
1996 – Jonesboro (6), Harrisburg (4)
1995 – Jonesboro (5), Harrisburg (3)
1994 – Jonesboro (4), Jonesboro Westside (3)
1993 – Mount St. Mary (2), Harrisburg (2)
1992 – Jonesboro (3), Jonesboro Westside (2)
1991 – North Little Rock, Harrisburg
1990 – Cabot (2), Arkadelphia (7)
1989 – Cabot, Arkadelphia (6)
1988 – Mount St. Mary, Arkadelphia (5)
1987 – Jonesboro (2), Nettleton
1986 – LR Central, Arkadelphia (4)
1985 – Texarkana, Arkadelphia (3)
1984 – West Helena Central (4), Arkadelphia (2)
1983 – West Helena Central (3), Jonesboro Westside
1982 – Russellville (2), Arkadelphia
1981 – Russellville, Morrilton
1980 – West Helena Central (2), Magnolia (2)
1979 – Jonesboro, Magnolia
1978 – West Helena Central, Ashdown
1977 – Sylvan Hills, Mountain Home (2)
1976 – Mountain Home
List of Arkansas state high school girls cross country champions
The following is a (fall sport) list of Arkansas state champions in girls cross country:
2016 – Bentonville, Siloam Springs, Little Rock Christian, Heber Springs, Genoa Central, Quitman
2015 – Bentonville, Siloam Springs, Little Rock Christian, Pottsville, Genoa Central, Trinity Christian
2014 – Bentonville, Siloam Springs, Little Rock Christian, Ozark, Genoa Central, Trinity Christian
2013 – Fayetteville, Lake Hamilton, Little Rock Christian, Heber Springs, Genoa Central, Acorn
2012 – Rogers Heritage, Lake Hamilton, Little Rock Christian, Heber Springs, Melbourne, Acorn
2011 – Rogers, Lake Hamilton, Siloam Springs, De Queen, Harding Academy, Acorn
2010 – Rogers, Van Buren, Batesville, De Queen, Rose Bud, Acorn
2009 – Bentonville, Mountain Home, Batesville, Shiloh Christian, Elkins, Trinity Christian
2008 – Bentonville, Mountain Home, Batesville, De Queen, Elkins, Des Arc
2007 – Rogers, Mountain Home, Batesville, Heber Springs, Green Forest, Des Arc
2006 – Bentonville, Lake Hamilton, Batesville, Heber Springs, Genoa Central, West Side GF
2005 – Rogers, Batesville, Heber Springs, Genoa Central
2004 – Bentonville, Batesville, Heber Springs, Harding Academy
2003 – Rogers, Harrison, De Queen, LR Lutheran
2002 – Bryant, Siloam Springs, Berryville, Harding Academy
2001 – Fayetteville, Siloam Springs, Berryville, Harding Academy
2000 – Bentonville, Harrison, Berryville, Harding Academy
1999 – Bentonville, Harrison, Berryville, Decatur
1998 – Bentonville, Harrison, Berryville, Shiloh Christian
1997 – Bentonville, Harrison, Berryville, Shiloh Christian
1996 – Fayetteville, Harrison, Eureka Springs, DeValls Bluff
1995 – Bryant, Harrison, Shiloh Christian
1994 – FS Southside, Harrison, Shiloh Christian
1993 – Rogers, Harrison, Glenwood
1992 – Rogers, Vilonia, Eureka Springs
1991 – Rogers, Vilonia, Eureka Springs
1990 – Rogers, Lake Hamilton, Eureka Springs
1989 – Rogers, Batesville, Eureka Springs
1988 – Fayetteville, Batesville, Caddo Hills
1987 – Rogers, Lake Hamilton, Altus-Denning
1986 – Conway, Lake Hamilton, Lamar
1985 – Rogers, Lake Hamilton, Lamar
1984 – Rogers, Vilonia, DeValls Bluff
1983 – Rogers, Batesville, Gentry
1982 – Rogers, Vilonia, Bradford
1981 – Rogers, Bradford
1980 – Rogers, Berryville
List of Arkansas state high school boys cross country champions
The following is a (fall sport) list of Arkansas state champions in boys cross country:
2016 – Rogers, Lake Hamilton, Maumelle, Heber Springs, Green Forest, Acorn
2015 – Fayetteville, Lake Hamilton, Harrison, Heber Springs, Green Forest, West Side
2014 – Rogers, Lake Hamilton, Maumelle, Heber Springs, Green Forest, West Side
2013 – Rogers, Lake Hamilton, Harrison, Maumelle, Elkins, Eureka Springs
2012 – Bentonville, Mountain Home, LR Christian, Heber Springs, Elkins, Caddo Hills
2011 – Bentonville, Mountain Home, LR Christian, De Queen, Elkins, Caddo Hills
2010 – Bentonville, Russellville, LR Christian, Heber Springs, Elkins, Caddo Hills
2009 – Bentonville, Lake Hamilton, Siloam Springs, Shiloh Christian, Elkins, Crowley's Ridge
2008 – Rogers, Lake Hamilton, Siloam Springs, Heber Springs, Elkins, Trinity Christian
2007 – Rogers, Lake Hamilton, Harrison, De Queen, Shiloh Christian, Jasper
2006 – Rogers, Lake Hamilton, Siloam Springs, Heber Springs, Genoa Central, Jasper
2005 – Rogers, Beebe, Berryville, Jasper
2004 – Rogers, Greene County Tech, Heber Springs, Jasper
2003 – Rogers, Siloam Springs, De Queen, LR Lutheran
2002 – Rogers, Vilonia, De Queen, LR Lutheran
2001 – Russellville, LR Fair, Berryville, Acorn
2000 – Mountain Home, Siloam Springs, Berryville, Acorn
1999 – Rogers, Siloam Springs, Berryville, Eureka Springs
1998 – Rogers, Siloam Springs, Berryville, Acorn
1997 – Russellville, Siloam Springs, Berryville, Acorn
1996 – Rogers, Crossett, Berryville, Pottsville
1995 – Rogers, Sheridan, Eureka Springs
1994 – Rogers, Sheridan, Eureka Springs
1993 – Rogers, Sheridan, Eureka Springs
1992 – Bryant, Lake Hamilton, Eureka Springs
1991 – Bryant, Berryville, Eureka Springs
1990 – Rogers, Berryville, Eureka Springs
1989 – Rogers, Berryville, Eureka Springs
1988 – Rogers, Berryville, Eureka Springs
1987 – Conway, Crossett, Eureka Springs
1986 – Fayetteville, Crossett, Eureka Springs
1985 – Fayetteville, Harrison, Pea Ridge
1984 – Fayetteville, Crossett, Gentry
1983 – Fayetteville, Crossett, Central Arkansas Christian
1982 – LR Central, Bentonville, Gentry
1981 – LR Central, Berryville
1980 – LR Parkview, Ozark
1979 – LR Central, Ozark
1978 – Cabot, Ozark
1977 – LR Central, Berryville
1976 – LR Central, Berryville
1975 – LR Central, Fayetteville, Monticello, Berryville, Harding Academy
1974 – LR Hall, Fayetteville, Cabot, Berryville, Emerson
1973 – LR Hall, Fayetteville, Batesville, Berryville, Emerson
1972 – LR Central, Fayetteville, Searcy, Berryville, Emerson
1971 – LR Central, Fayetteville, Searcy, Berryville, Plainview
1970 – LR Central, Fayetteville, Searcy, Ozark, Kensett
1969 – LR Central, Fayetteville, Searcy, Beebe, Kensett
1968 – LR Central, Searcy, Charleston, Judsonia
1967 – LR Central, Searcy, Charleston, Prairie Grove
1966 – LR Central, Searcy, Beebe
1965 – Fayetteville, Conway, Charleston, Stamps
1964 – LR Central, Conway, Beebe, Stamps
1963 – LR Central
1962 – LR Central
1961 – LR Central
1960 – LR Central
1959 – LR Central
1958 – North Little Rock
1957 – LR Central
1956 – Little Rock
1955 – Little Rock
List of Arkansas state high school golf champions
Winter sports
List of Arkansas state high school dance champions
The state competitive dance championships are held annually in November or December.
List of Arkansas state high school cheer champions
The state competitive cheer championships are held annually in November or December.
List of Arkansas state high school basketball champions
The basketball season begins each November with the state basketball championship tournament held annually in late February and March.
List of Arkansas state high school boys bowling champions
The bowling season begins each November with the state bowling championship tournament held annually in late February.
According to the AAA Bowling Handbook, all Arkansas Activities Association rules will be followed. Rules for competition shall be those of the United States Bowling Congress (USBC) American Bowling Alliance. Arkansas Activities Association rules prevail in case of a conflict with standard USBC rules.
List of Arkansas state high school girls bowling champions
According to the AAA Bowling Handbook, all Arkansas Activities Association rules will be followed. Rules for competition shall be those of the United States Bowling Congress (USBC) American Bowling Alliance. Arkansas Activities Association rules prevail in case of a conflict with standard USBC rules.
List of Arkansas state high school wrestling champions
Arkansas became the 49th state to add high school wrestling when the Arkansas Activities Association approved wrestling as a sanctioned sport for the 2008–09 season. The wrestling season begins each November with the state wrestling championship tournament held annually in late February. The state tournament combines wrestlers from the 7A and 6A classifications and a separate competition for the 1A through 5A classifications.
List of Arkansas state high school swimming and diving champions
Spring sports
List of Arkansas state high school soccer champions
Boys Soccer:
2019 - Springdale (3), Russellville (5), Valley View (2), Central Arkansas Christian (3)
2018 - FS Northside (2), Russellville (4), Lakeside Hot Springs, Warren
2017 - Rogers, Siloam Springs (4), Hot Springs (2), Dardanelle (2)
2016 - Bentonville (4), Siloam Springs (3), Hot Springs, Dardanelle
2015 - Bentonville (3), Russellville (3), De Queen (6), Central Arkansas Christian (2)
2014 - Bentonville (2), Russellville (2), De Queen (5), Green Forrest
2013 - FS Northside, Searcy (6), Little Rock Christian (3), Valley View
2012 – Springdale (2), Russellville, Siloam Springs (2), De Queen (4)
2011 – LR Catholic (5), Searcy (5), Siloam Springs, De Queen (3)
2010 – LR Catholic (4), Searcy (4), Little Rock Christian (2), De Queen (2)
2009 – LR Catholic (3), Searcy (3), Little Rock Christian, De Queen
2008 – Conway, Searcy (2), Harrison (6), Central Arkansas Christian
2007 – LR Catholic (2), Searcy, Pulaski Academy (3), Clarksville
2006 – Van Buren, Harrison (5)
2005 – Bentonville, Harrison (4)
2004 – Conway, Harrison (3)
2003 – Springdale, Harrison (2)
2002 – LR Catholic, Harrison
2001 – Pulaski Academy (2)
2000 – Pulaski Academy
1999 – Fayetteville
1998 – North Little Rock
Girls Soccer:
2019 - Bryant (2), Little Rock Christian (5), Harrison (7), Central Arkansas Christian (9)
2018 - Rogers (4), Siloam Springs (5), Little Rock Christian (4), Central Arkansas Christian (8)
2017 - Bentonville (8), Siloam Springs (4), Harrison (6), Central Arkansas Christian (7)
2016 - Bentonville (7), Siloam Springs (3), Harrison (5), Central Arkansas Christian (6)
2015 – Bryant, Siloam Springs (2), Little Rock Christian (3), Gentry
2014 – Bentonville (6), Siloam Springs, Harrison (4), Valley View
2013 – Bentonville (5), Searcy (4), Shiloh Christian, Central Arkansas Christian (5)
2012 – Bentonville (4), Russellville, Central Arkansas Christian (4), Pulaski Academy (6)
2011 – Conway, Mountain Home (2), Harrison (3), Pulaski Academy (5)
2010 – Bentonville (3), Searcy (3), Little Rock Christian (2), Conway St. Joseph (2)
2009 – Bentonville (2), Mountain Home, Little Rock Christian, Conway St. Joseph
2008 – Mount St. Mary, Searcy (2), Pulaski Academy (4), Central Arkansas Christian (3)
2007 – Bentonville, Searcy, Pulaski Academy (3), Central Arkansas Christian (2)
2006 – Rogers (3), Central Arkansas Christian
2005 – Rogers (2), Pulaski Academy (2)
2004 – Rogers, Harrison (2)
2003 – LR Central (2), Pulaski Academy
2002 – LR Central, Harrison
2001 - Fayetteville (4)
2000 – Fayetteville (3)
1999 – Fayetteville (2)
1998 – Fayetteville
List of Arkansas state high school baseball champions
List of Arkansas state high school softball champions
Fast Pitch
2017 – Bentonville (2), Sheridan (3), De Queen, Pottsville, Rose Bud, Rison, Taylor (4)
2016 – Bentonville, Sheridan (2), Vilonia (3), Mena (2), Bald Knob (3), Spring Hill (2), Nemo Vista (3)
2015 – North Little Rock (7), Greenwood, Vilonia (2), Mena, Bald Knob (2), Spring Hill, Scranton (2)
2014 – North Little Rock (6), Benton (3), White Hall (3), Brookland, Bald Knob, Foreman (7), Midland
2013 – North Little Rock (5), Russelville, White Hall (2), Nashville (3), Benton Harmony Grove (4), Magnet Cove, Taylor (3)
2012 – Bryant (6), Lake Hamilton (4), White Hall, Nashville (2), Mansfield, Junction City, Taylor (2)
2011 – Bryant (5), Searcy, Wynne, Farmington, Atkins, Foreman (6), Nemo Vista (2)
2010 – Bryant (4), Mountain Home, Greenbrier, Nashville, Arkansas Baptist (4), Foreman (5), Armorel
2009 – North Little Rock (4), Lake Hamilton (3), Wynne, Dardanelle, Perryville, Foreman (4), Scranton
2008 – North Little Rock (3), Mountain Home, Nettleton, Ashdown, Elkins, Foreman (3), Nemo Vista
2007 – Fayetteville, Lake Hamilton (2), Vilonia, Dardanelle, Elkins, Foreman (2), West Side GF
2006 – Fayetteville, Marion, Central Arkansas Christian, Foreman, Lockesburg
2005 – Benton (2), Batesville, Farmington, Arkansas Baptist (3), Taylor
2004 – Benton, Hope, Booneville, Benton Harmony Grove (3), Lockesburg
2003 – Texarkana, Hope, Prairie Grove (3), Benton Harmony Grove (2), Ouachita
2002 – North Little Rock (2), Nettleton, Prairie Grove (2), Benton Harmony Grove
2001 – North Little Rock, Batesville, Prairie Grove, Newark
2000 – Rogers, Lake Hamilton, Farmington
1999 – Sheridan
Slow Pitch
2003 – McCrory
2002 – Hoxie
2001 – Parkers Chapel, Ouachita
2000 – Sylvan Hills, Murfreesboro, Lockesburg (2)
1999 – Bryant (3), Nashville, Cedarville, Lockesburg
1998 – Benton, Greenwood, Southside Batesville, Arkansas Baptist (2), Guy-Perkins
1997 – Bryant (2), Batesville, Nettleton, Arkansas Baptist
1996 – Bryant, Vilonia, Barton, St. Joseph
List of Arkansas state high school tennis champions
List of Arkansas state high school track and field champions
See also
List of high schools in Arkansas
List of school districts in Arkansas
Mississippi Association of Independent Schools
NFHS
References
External links
1904 establishments in Arkansas
Activities Association, Arkansas
High school sports associations in the United States
High school sports in Arkansas
Activities Association, Arkansas
Activities Association, Arkansas
Sports leagues established in 1904
|
23025664
|
https://en.wikipedia.org/wiki/List%20of%20C%20Sharp%20software
|
List of C Sharp software
|
C# is a programming language. The following is a list of software programmed in it:
Banshee, a cross-platform open-source media player.
Beagle, a search system for Linux and other Unix-like systems.
Colectica, a suite of programs for use in managing official statistics and statistical surveys using open standards.
Chocolatey, an open source package manager for Windows.
Docky, a free and open-source application launcher for Linux.
FlashDevelop, an integrated development environment (IDE) for development of Adobe Flash websites, web applications, desktop applications and video games.
GameMaker Studio 2, a game engine with an editor written in C#
HandBrake, a free and open-source transcoder for digital video files.
KeePass, a free and open-source password manager primarily for Windows.
Low Orbit Ion Cannon (LOIC), an open-source network stress testing and denial-of-service attack application.
Lphant, a peer-to-peer file sharing client.
Microsoft Visual Studio, an integrated development environment (IDE) from Microsoft. Also programmed in C++.
MonoDevelop, an open source integrated development environment.
NMath, a numerical package for the Microsoft .NET Framework.
Open Dental, a dental practice management software.
OpenRA, a free remake of the classic Command & Conquer game.
osu!, a free and open-source (before freeware) Indie rhythm game with 4 modes for Microsoft Windows, Linux and macOS.
Paint.NET, a freeware raster graphics editor program for Microsoft Windows, developed on the .NET Framework..
Pinta, an open-source, cross-platform bitmap image drawing and editing program.
SharpDevelop, a free and open source integrated development environment (IDE) for the .NET Framework.
Windows Installer XML (WiX), a free software toolset that builds Windows Installer packages from XML.
Lists of software
|
3684940
|
https://en.wikipedia.org/wiki/Free%20Download%20Manager
|
Free Download Manager
|
Free Download Manager is a download manager for Windows, macOS, Linux and Android.
FDM was initially proprietary software, but was free and open-source software between versions 2.5 and 3.9.7. Starting with version 3.0.852 (15 April 2010), the source code was made available in the project's Subversion repository instead of being included with the binary package. This continued until versions 3.9.7. The source code for version 5.0 and newer is not available and the GNU General Public License agreement has been removed from the app.
Features
The GUI presents several tabs that organize types of downloads and allow access to different features in the program.
Download information view that shows each download's progress bar, file preview, community opinions if any are written for that download and a log showing connection status.
Download acceleration
Dropbox for file drag-and-drop
HTTP and FTP download support
Enhanced audio/video files support
RTSP/MMS download support
Batch downloading support for downloading a set of files
Segmented file transfer: Splits large file into parts (specified in the settings of the software) and downloads simultaneously
BitTorrent support (based on Libtorrent), Magnet URI scheme support
Flash video download from sites like YouTube and Google Video (exclude Android)
Resuming broken downloads, if permitted by server
Zip files partial download, lets users to download only the necessary part of a zip file.
Simultaneous downloading from several mirrors
Support bandwidth throttling via three fully customizable traffic modes: light, medium and heavy.
Import list of URLs from clipboard
Integrates with the browser being used to track URL or Copy functions if downloadable content is found
Remote control via Internet
Smart file management and powerful scheduler
Portable mode, users can easily create its portable version and avoid the need to install and configure the program on each computer.
Active Spyware and Adware protection using active communication among users and also through installed Antivirus software on the computer.
Tabs
Downloads – This is the focal point of the program, which is simply a download manager. Users can also create groups with folders to which files with specific extensions will be downloaded.
Flash video downloads – This feature helps users to download FLV video files from YouTube, Google Video and many other sites.
Torrents – Allows to download the torrent files
Scheduler – Users can create and manage lists of tasks to be executed at a preset time. Tasks include launching external programs, starting and stopping downloads, and shutting down the computer in all possible ways.
Site Explorer – This feature is an FTP client.
Site Manager – This feature allows users to tell FDM how to act with specific sites, such as websites that require authentication, or how many download connections a website can accept simultaneously from the user.
HTML Spider – This feature can download a website by following and downloading links recursively.
See also
BitTorrent client
Comparison of file sharing applications
Comparison of download managers
Comparison of YouTube downloaders
References
External links
Free Download Manager Review
BitTorrent clients for Linux
Android (operating system) software
2004 software
Download managers
Free BitTorrent clients
Free software programmed in C++
Windows-only free software
macOS software
Freeware
Formerly proprietary software
Portable software
Free software
Free and open-source software
BitTorrent clients
GNU Project software
|
12117975
|
https://en.wikipedia.org/wiki/Collaboration-oriented%20architecture
|
Collaboration-oriented architecture
|
Collaboration Oriented Architecture (COA) is a computer system that is designed to collaborate, or use services, from systems that are outside of the operators control. Collaboration Oriented Architecture will often use Service Oriented Architecture to deliver the technical framework.
Collaboration Oriented Architecture is the ability to collaborate between systems that are based on the Jericho Forum principles or "Commandments".
Bill Gates and Craig Mundie (Microsoft) clearly articulated the need for people to work outside of their organizations in a secure and collaborative manner in their opening keynote to the RSA Security Conference in February 2007.
Successful implementation of a Collaboration Oriented Architecture implies the ability to successfully inter-work securely over the Internet and will typically mean the resolution of the problems that come with de-perimeterisation.
Etymology
The term Collaboration Oriented Architectures was defined and developed in a meeting of the Jericho Forum at a meeting held at HSBC on 6 July 2007.
Definition
The key elements that qualify a security architecture as a Collaboration Oriented Architecture are as follows;
Protocol: Systems use appropriately secure protocols to communicate.
Authentication: The protocol is authenticated with user and/or system credentials.
Federation: User and/or systems credentials are accepted and validated by systems that are not under your (locus of) control.
Network Agnostic: The design does not rely on a secure network, thus it will operate securely from an Intranet to raw-Internet
Trust: The collaborating system have the capacity to be able to confirm to a specified degree of confidence that the components in a transaction chain have.
Risk: The collaborating systems can make a risk assessment on any transaction based on the communicated levels of required trust, based on the required degree of identity, confidentiality, integrity, availability.
Authentication
Working in a collaborative multi-sourced environment implies the need for authentication, authorization and accountability which must interoperate / exchange outside of your locus / area of control.
People/systems must be able to manage permissions of resources and rights of users they don't control
There must be capability of trusting an organization, which can authenticate individuals or groups, thus eliminating the need to create separate identities
In principle, only one instance of person / system / identity may exist, but privacy necessitates the support for multiple instances, or one instance with multiple facets, often referred to as personas
Systems must be able to pass on security credentials /assertions
Multiple loci (areas) of control must be supported
References
External links
http://www.jerichoforum.org
Open SOA Collaboration
Service Component Architecture Specifications
A collaboration-oriented software architecture modeling system
Enterprise collaboration with Service Oriented Architecture (SOA)
Collaboration Services in a Services Oriented Architecture
Computer security
|
16503473
|
https://en.wikipedia.org/wiki/Charles%20Platt%20%28author%29
|
Charles Platt (author)
|
Charles Platt (born 26 April 1945 in London, England) is a British author, journalist and computer programmer. He relocated from England to the United States during 1970 and is a naturalized U.S. citizen. He has one child, Rose Fox, who edits science-fiction, fantasy, and horror book reviews. Platt is the nephew of Robert Platt, Baron Platt of Grindleford.
Fiction
Platt's novel The Silicon Man has been endorsed by William Gibson as "A plausible, well-crafted narrative exploring cyberspace in a wholly new and very refreshing way".
As a fiction writer, Charles Platt has also used pseudonyms: Aston Cantwell (1983), Robert Clarke (Less Than Human, a science-fiction comedy of 1986) and Charlotte Prentiss (historical and prehistory novels, between 1981 and 1999). He contributed to the series of Playboy Press erotic novels with the house pseudonym Blakely St. James that was shared by many other writers during the 1970s.
Platt is also known for writing the novel The Gas during 1970 for the Ophelia Press (OPH-216), an imprint of publisher Maurice Girodias's Olympia Press. (Girodias also published several of Barry N. Malzberg's early novels.) When Platt's novel was published in the United Kingdom by Savoy Books during 1980, copies were seized by the UK's Director of Public Prosecutions.
Platt wrote a variety of science-fiction novels, including Garbage World, Protektor, and Free Zone, and two books in Piers Anthony's Chthon universe, titled Plasm and Soma. He ceased writing science fiction after 1990.
Nonfiction
From 1980 to 1982, Platt interviewed about forty major science-fiction writers such as Andre Norton, Philip K. Dick, J.G. Ballard, Frank Herbert, Isaac Asimov, Kurt Vonnegut, Jr, Ray Bradbury, John Brunner. These interviews were the basis for two books of profiles, Dream Makers (1980) and Dream Makers II (1983). They were nominated for Hugo Awards, and received a Locus Award.
In a review of a book (Hammer's Slammers) by David Drake, Platt asserted that Drake wouldn't write such "queasy voyeurism" if he had really seen war. Drake, a Vietnam veteran, has since taken to including despicable characters named "Platt" in his writings.
Platt began writing for Wired magazine in its third issue, and ultimately became one of its senior writers, contributing more than thirty full-length features. He was an early user of the internet service provider MindVox and wrote five books on computers and computer programming during that period. His nonfiction has appeared in publications such as Omni, The Washington Post, and the Los Angeles Times.
While covering the 1994 Hackers on Planet Earth Conference for his article "Hackers: Threat or Menace?" in Issue 2.11 of Wired Magazine, Mr. Platt annoyed attendees by his interjections during the panel discussion entitled "What is this Cryptography Stuff and Why Should I Care?" Mr. Platt repeatedly inquired loudly "Where's the crime?", an exclamation later adopted as a nickname for him by some hackers. The conference organizer, Eric Corley (aka Emmanuel Goldstein) penned a rebuttal to Platt's article and commentary on his methods that was published partially in the "Rants and Raves" section of Wired, Issue 3.02.
Platt's book Make:Electronics was published in December, 2009 by O'Reilly Media. An introductory-level hands-on tutorial, it is available in conjunction with kits of components from Maker Shed. Make:More Electronics (a sequel) and volumes 1, 2, and 3 of Encyclopedia of Electronic Components have since been published, followed by Make: Tools, a basic tutorial in the use of hand tools. All of Platt's books sharing the Make: logo are illustrated with his own drawings and photographs.
Computer programming
Platt acquired an early desktop computer, an Ohio Scientific C4P, and learned to write game programs for it which were distributed as shareware. Subsequently, he wrote educational software published by Trillium Press, and participated in the first conference on cellular automata at MIT, where he demonstrated MS-DOS-based software that he composed and sold by mail order. His program to generate the Mandelbrot Set was also self-published and sold primary to university mathematical departments. He is the author of six computer books, from the satirical Micro-Mania to the instructional Graphics Guide to the Commodore 64. For many years he taught computer graphics classes in Adobe Illustrator and Photoshop at The New School for Social Research in New York City.
Editing and publishing
Platt joined Michael Moorcock's New Worlds (magazine) team as de facto art director and graphic designer from 1967 to 1970. Although not trained as a graphic designer, he was largely responsible for the collage-like appearance of much of the magazine at the time.
During 1970 Charles Platt became a consulting editor for Avon Books company, acquiring work for their science-fiction list. Subsequently, he performed a similar role for the short-lived paperback trade-name Condor Publishing, and was science-fiction editor for Franklin Watts, Inc.
During the 1980s Platt self-published The Patchin Review, a magazine of literary criticism and commentary emphasizing science fiction. Although each issue sold only 1,000 copies, the venture acquired notoriety for its edgy attitude and attracted contributions from many then-well-known science fiction editors and authors, including Philip K. Dick, Gregory Benford, Brian W. Aldiss, David Hartwell, and others.
During 2007 Platt became a section editor for Make (magazine), for which he had already been a frequent contributor. In 2011 he became a contributing editor to the magazine, and retains that title currently.
Cryonics
Platt became interested in cryonics during 1990 after visiting the Alcor Life Extension Foundation. He wrote a book on the subject, Life Unlimited, for which a contract was issued by Wired Books; the publisher ceased doing business, and the text remains unpublished. Platt became President of CryoCare Foundation, which he co-initiated during 1993. He was Director of Suspension Services for Alcor, a company which may be best known for cryopreserving Ted Williams's head and body after he died. During 2004 Platt became a director and General Manager of Suspended Animation, Inc., based in Boynton Beach, Florida. Suspended Animation pursues R&D to develop equipment and procedures for use in mitigating ischemic injury immediately after cardiac arrest in terminal patients who have made arrangements for cryopreservation. Platt resigned his jobs with the company at the end of 2006. He continued to design and build prototypes of rapid cooling equipment for the company until 2010, and coauthored a pending patent (application number 20110040359, dated February 2011). His final work on a device that could cool patients after cardiac arrest, with potential applications in conventional medicine, was completed for a California laboratory in 2011. It employs a breathable perfluorocarbon liquid and uses the lungs as a heat exchanger in a process known as partial liquid ventilation (see liquid breathing).
Selected bibliography
Fiction
Novels and novellas
Garbage World (1967)
The Gas (1970)
The City Dwellers (1970)
Planet of the Voles (1971)
Twilight of the City (1978)
Less Than Human (1986)
Aton/Worlds of Chthon series (continuation of the series originally by Piers Anthony)
3 Plasm (1987)
4 Soma (1988)
Free Zone (1988)
The Silicon Man (1991)
Protektor (1996)
Short stories
One of Those Days (1964)
Lone Zone (1965)
The Disaster Story (1966)
The Failures (1966)
The Rodent Laboratory (1966)
Direction (1969)
A Cleansing of the System (1972)
The Coldness (1973)
The New York Times (1973)
Anthologies edited
New Worlds Quarterly an anthology series related to New Worlds magazine
New Worlds 6 (UK, 1973) with Michael Moorcock
This also appeared as New Worlds #5 (US, 1974) with Michael Moorcock
New Worlds 7 (UK, 1974) with Hilary Bailey
This also appeared as New Worlds #6 (US, 1975) with Hilary Bailey
Nonfiction
Dream Makers series
1 Dream Makers: The Uncommon People Who Write Science Fiction (1980)
2 Dream Makers, Volume II: The Uncommon Men & Women Who Write Science Fiction (1983)
Dream Makers: Science Fiction and Fantasy Writers at Work (1987)
Micromania: The Whole Truth About Home Computers (1984)
Graphics Guide to the Commodore 64 (1984) Sybex Computer Books
How to be a Happy Cat (1986) with Gray Joliffe
Loose Canon (2001)
Make: Electronics: Learning by Discovery (2009)
Encyclopedia of Electronic Components Volume 1 (2012)
Encyclopedia of Electronic Components Volume 2 (2014)
Make: More Electronics (2014)
Encyclopedia of Electronic Components Volume 3 (2016)
Make: Tools (2016)
Easy Electronics (2017)
Notes
References
Clute, John and Peter Nicholls (eds). The Encyclopedia of Science Fiction. New York: St Martin's Griffin, 1993 (2nd edition 1995). .
External links
Charles Platt's Electronics Pages Current web site of Charles Platt, accessed April 22, 2019.
The Web Site of Charles Platt (Inaccessible, as of December 1, 2013.)
Charles Platt bibliography (fiction) - Fantastic Fiction (UK)
Suspended Animation Official corporate site
1945 births
Writers from London
Living people
American science fiction writers
American technology writers
British speculative fiction critics
American speculative fiction critics
20th-century American novelists
American male novelists
Cryonicists
Naturalized citizens of the United States
Science fiction critics
Cellular automatists
Wired (magazine) people
American transhumanists
20th-century American male writers
20th-century American non-fiction writers
American male non-fiction writers
|
32370526
|
https://en.wikipedia.org/wiki/Nabil%20Ayad
|
Nabil Ayad
|
Nabil Ayad is an academic in the field of diplomacy and international governance. He is currently a member of the International Institute for Strategic Studies, the Royal Institute of International Affairs and an Associate Member of the London Diplomatic Association.
Ayad coined the term "virtual diplomacy" in 1986. During that time period, he pioneered exploration of information technology's impact on diplomacy. He has done extensive pioneering work in the area of diplomacy and through his vision, Diplomacy has become a discipline unto itself, and London Diplomatic Academy has been recognised as the world leader in the field.
In recognition of his contribution to world diplomacy and the training of the new generation of diplomats in Central Asia, and the development of education in the Republic of Uzbekistan, the government of Uzbekistan conferred two honours on Dr. Ayad: an Honorary Doctorate of Science by the University of World Economy and Diplomacy, Foreign Ministry of Uzbekistan, September 1999, and an Honorary Doctor of Philosophy by the Tashkent State University of Oriental Studies.
Dr. Ayad lectures on Diplomacy in Islam; Intelligence and National Security and Intercultural Communication, as part of the MA degree in diplomatic studies. In 2011, Dr. Ayad introduced four master's degree programs at London Academy of Diplomacy on the following:
International Diplomacy
International Business and Diplomacy
International Security and Diplomacy
International Communication and Diplomacy.
Prior to joining UEA London in August 2010, Dr. Ayad pioneered in 1980 the introduction of integrated diplomatic training programmes at the University of Westminster and organised courses and training programmes for diplomats and other government officials from the Commonwealth, Arab World, Africa, Eastern and Central Europe, the Caribbean, Central Asia and China. Most of these training programmes were sponsored by the British Foreign and Commonwealth Office and the British Council as well as groups sponsored by their own governments such as Kuwait, Iraq, United Arab Emirates, Saudi Arabia and China.
He was also involved in the supervision of research students. For example, during the academic year 2009–2010, four of his research students have been awarded PhD degrees on topics including:
Towards an E-Government: The Case of Dubai
Diplomatic Negotiations: Romania's Accession to the European Union: a Case Study.
Effective Diplomacy and Nation-Building: A Critical Study of the Tribal Diplomacy Adopted by three Arabian Gulf Clans (and its contribution to the Establishment of two modern nation states -1716-1826).
Paradigms in Caribbean Trade Diplomacy: Negotiating the Economic Partnership with the EU.
Since 1995, he has organised a series of international symposia entitled Diplomacy Beyond 2000 and Diplomacy in the 21st century in London and Paris for the benefit of the student body. The conferences have attracted members of the London and Paris Diplomatic Corps, senior UK government officials, academics and decision makers from overseas governments. Conferences included:
Diplomacy Beyond 2000, April 1995
Are Diplomats Really Necessary?, April 1996
The Information Explosion: A Challenge for Diplomacy, April 1997
Diplomacy and Divinity: Religion in International Relations, April 1998
The Impact of Technology on Intelligence and Security, March 1999
Ethics in International Practice April 2000
Divinity, Diplomacy and Development, May 2000, Paris
Refugees and Minorities in International Relations, April 2001
Institutional Corruption and Good Governance, May 2001, Paris
Media and Terrorism, December 2001, Paris
The UN and the Media in War and Peace, October 2002
Diplomacy and Gender, April 2003
Reforming the UN and the Future of Multilateralism, March 2004
International Security and the Dynamics of the New Diplomacy: Image Projection and Reputation Management, May 2006 (organised in conjunction with Foreign Affairs Canada)
The International Dimensions of European Values May 2007
Transformational Public Diplomacy: Shaping the Future of International Relations, April 2008 (organised in conjunction with the American Embassy, London and University of Southern California, centre on Public Diplomacy.)
In March 2012 Dr. Ayad will organise the seventeenth international symposium in the series of Diplomacy in the 21st Century entitled: "Diplomatic Practice, Global Commerce and International Security in the Age of Heteropolarity"
At London Academy of Diplomacy, Dr. Ayad continues the tradition of innovation in diplomatic training and the conduct of international relations in a rapidly changing international environment in the age of heteropolarity.
Selected publications
2009: Strategic Public Diplomacy: Shaping the Future of International Relations (with Daryl Copelad) The Diplomatic Academy of London, University of Westminster 2009
The Impact of Technology on Intelligence and Security (edited), Diplomatic Academy of London Press, University of Westminster 2006
2005: Diplomacy and Divinity: Religion in International Relations (edited with Sir Peter Marshall), Diplomatic Academy of London Press, University of Westminster 2005
2004: Towards the Virtual University: Trends and Strategies
1999: Are Diplomats Really Necessary? The Hydra in a Mutating Environment Edited with Sir Peter Marshall, University of Westminster Press, 1999
1999: The Information Explosion: A Challenge for Diplomacy edited with Sir Peter Marshall, University of Westminster Press, 1999
1996: Diplomacy beyond 2000 edited with Sir Peter Marshall, University of Westminster Press, 1996
1990: Edited The Dynamics of Diplomacy by Sir Peter Marshall, The Diplomatic Academy of London, 1990
Articles in books
“Threats to Global Security from Terrorism: Intelligence Services and Non-State Actors” in The Impact of Technology on Intelligence and Security. Edited by Nabil Ayad, The Diplomatic Academy of London Press, 2006
“Information Technology and the Future of Diplomatic Training,” in Diplomacy beyond 2000, edited with Sir Peter Marshall, University of Westminster Press, 1999
“Information Technology and Diplomatic Training: The Hydra in a Mutating Environment,” in Are Diplomats Really Necessary? Edited with Sir Peter Marshall, University of Westminster Press, 1999
“The Information Explosion and the Future of Diplomatic Training,” in The Information Explosion: A Challenge for Diplomacy, edited with Sir Peter Marshall, University of Westminster Press, 1999
Lectures
International Security in the Age of Fear at China Foreign Affairs University, October 2008, Beijing, China
Member of the panel on ‘The Role of the Media in the Arab-Israel Relations: Stereotyping or Bridging Gaps'? June 2009, House of Lords, London
“Information Technology and the Future of Diplomatic Training,” 1st International Symposium Diplomacy Beyond 2000, University of Westminster, April 1995
A series of Lectures on Diplomatic Training Information Technology, at the Uzbek Ministry for Foreign Affairs, University of World Economy and Diplomacy, and the Tashkent State University for Oriental Studies, June 1995
“Information Technology and Diplomatic Training: The Hydra in a Mutating Environment,” 2nd International Symposium: Diplomacy Beyond 2000
Are Diplomats Really Necessary?” University of Westminster, April 1996
“The Impact of Information Technology on Diplomacy,” Institute of Diplomacy and Foreign Affairs, Malaysian Ministry for Foreign Affairs, Kuala Lumpur, August 1996
“Information Technology and the Dynamics of Diplomacy,” Institute of Foreign Affairs, Ministry for Foreign Affairs, Bangkok, Thailand, August 1996
“Information Technology, the Media, and Diplomacy,” the Diplomatic Institute of Education and Training, Indonesian Ministry for Foreign Affairs, Jakarta, November 1996
“The Impact of the Information Revolution on the Organisation of the Ministry for Foreign Affairs and Diplomatic Practice,” Ministry for Foreign Affairs, Doha, Qatar, July 1997
“International Security “, the German Foundation of International Development, Foreign Ministry, Berlin, February 2000. Participated in a simulation exercise on the UN and Water Resources Disputes
Sources
http://www.globaldiplomaticacademy.com/bio.htm
http://nabilayad-geodiplomatics.com/lad.htm
http://culture-multicultures.blogspot.com/2010/11/interview-with-mr-nabil-ayad.html
Biography at the Commission on Globalisation Conference
Living people
Year of birth missing (living people)
Place of birth missing (living people)
International relations scholars
|
39442452
|
https://en.wikipedia.org/wiki/Troy%20Trojans%20softball
|
Troy Trojans softball
|
The Troy Trojans softball team represents Troy University in NCAA Division I college softball. The team participates in the Sun Belt Conference. The Trojans play their home games at Troy Softball Complex located on the university's campus. The program is one of the Top 50 winningest softball programs in the Division I, and has an overall record of 988–660–4 () as of the end of the 2021 season.
History
Upon Troy University's athletics moving all sports to the NCAA's Division I in 1993, the Troy softball program was started that same year and officially began their first season in 1994 under head coach Melanie Davis. Under Davis' leadership, the program immediately became a competitive softball program, finishing their first season in Division I with a 40–13 record, including a 4–3 win over an already prominent program in Georgia Tech.
In just Troy's third season of playing softball (1996), the team managed to make history by winning their first ever conference title and receiving a bid to play in an NCAA Regional. The team finished the season with a 47–22–1 record, winning the Mid-Continent Conference tournament title. The Lady Trojans would receive a bid to play in the NCAA Play-In Series versus Southeast Missouri State, where they would sweep the Redhawks by scores of 3–2 and 1–0. The ladies would then receive a bid to play in the NCAA West Regional as the #4 seed. In their first game against Arizona, the Trojans were outmatched, losing 0–8 to the Wildcats. The Trojans were knocked out of the tournament after dropping a heartbreaker in the Regional's elimination game against South Florida, 5–6.
Melanie Davis would resign as head coach of Troy at the end of the 2014 season, compiling a 780–506–4 record. Under Davis' direction, her Trojans defeated many Top 25 teams and other prominent programs, including Florida State, Louisiana, Auburn, Georgia Tech, Nebraska, Michigan, Ole Miss, and Penn State.
In 2015, Beth Mullins was hired as head coach.
Coaches
Attendance Records
NCAA Top 50 Attendance
Highest Game Attendance
Below is a list of Troy's top single-game attendance records.
Facilities
The place the Trojans call home is the Troy Softball Complex, built in 2002 on the campus of Troy University. In 2014, the entire complex underwent a $3 million renovation project. The official seating capacity was expanded to 800, with 120 of the seats being chairback seating. The Dodds Center was also built in 2014 during the renovation, which is an 8,000 sq. ft. state-of-the-art facility that houses coaches offices, player lounge, locker rooms, athletic training rooms, pitching area, and indoor batting cages.
Additionally, the natural grass playing surface was replaced and ProGrass artificial turf was installed in the outfield. The press box and coaches offices were completely renovated and modernized. The Troy Softball Complex saw an upgrade to the seating areas and a large patio was installed over the visitor’s dugout.
Wins vs. Top 25
Troy has collected 21 wins versus Top 25 ranked competition during the program's relatively short existence.
All rankings from NFCA Coaches' Poll
Yearly Results
Championships
1996 – Mid-Continent Conference Tournament Champions
1999 – Atlantic Sun Conference West Division Champions
2005 – Atlantic Sun Conference Regular Season Champions
NCAA Regional Results
References
|
24722
|
https://en.wikipedia.org/wiki/P-code%20machine
|
P-code machine
|
In computer programming, a p-code machine (portable code machine) is a virtual machine designed to execute p-code (the assembly language or machine code of a hypothetical central processing unit (CPU)). This term is applied both generically to all such machines (such as the Java virtual machine (JVM) and MATLAB precompiled code), and to specific implementations, the most famous being the p-Machine of the Pascal-P system, particularly the UCSD Pascal implementation, among whose developers, the p in p-code was construed to mean pseudo more often than portable, thus pseudo-code meaning instructions for a pseudo-machine.
Although the concept was first implemented circa 1966—as O-code for the Basic Combined Programming Language (BCPL) and P code for the language Euler—the term p-code first appeared in the early 1970s. Two early compilers generating p-code were the Pascal-P compiler in 1973, by Kesav V. Nori, Urs Ammann, Kathleen Jensen, Hans-Heinrich Nägeli, and Christian Jacobi, and the Pascal-S compiler in 1975, by Niklaus Wirth.
Programs that have been translated to p-code can either be interpreted by a software program that emulates the behavior of the hypothetical CPU, or translated into the machine code of the CPU on which the program is to run and then executed. If there is sufficient commercial interest, a hardware implementation of the CPU specification may be built (e.g., the Pascal MicroEngine or a version of a Java processor).
Benefits and weaknesses of implementing p-code
Compared to direct translation into native machine code, a two-stage approach involving translation into p-code and execution by interpreting or just-in-time compilation (JIT) offers several advantages.
It is much easier to write a small p-code interpreter for a new machine than it is to modify a compiler to generate native code for the same machine.
Generating machine code is one of the more complicated parts of writing a compiler. By comparison, generating p-code is much easier because no machine-dependent behaviour must be considered in generating the bytecode. This makes it useful for getting a compiler up and running quickly.
Since p-code is based on an ideal virtual machine, a p-code program is often much smaller than the same program translated to machine code.
When the p-code is interpreted, the interpreter can apply additional run-time checks that are difficult to implement with native code.
One of the significant disadvantages of p-code is execution speed, which can sometimes be remedied via JIT compiling. P-code is often also easier to reverse-engineer than native code.
In the early 1980s, at least two operating systems achieved machine independence through extensive use of p-code. The Business Operating System (BOS) was a cross-platform operating system designed to run p-code programs exclusively. The UCSD p-System, developed at The University of California, San Diego, was a self-compiling and self-hosting operating system based on p-code optimized for generation by the Pascal language.
In the 1990s, translation into p-code became a popular strategy for implementations of languages such as Python, Microsoft P-Code in Visual Basic, and Java bytecode in Java.
The language Go uses a generic, portable assembly as a form of p-code, implemented by Ken Thompson as an extension of the work on Plan 9 from Bell Labs. Unlike Common Language Runtime (CLR) bytecode or JVM bytecode, there is no stable specification, and the Go build tools do not emit a bytecode format to be used at a later time. The Go assembler uses the generic assembly language as an intermediate representation, and Go executables are machine-specific statically linked binaries.
UCSD p-Machine
Architecture
Like many other p-code machines, the UCSD p-Machine is a stack machine, which means that most instructions take their operands from a stack, and place results back on the stack. Thus, the add instruction replaces the two topmost elements of the stack with their sum. A few instructions take an immediate argument. Like Pascal, the p-code is strongly typed, supporting boolean (b), character (c), integer (i), real (r), set (s), and pointer (a) data types natively.
Some simple instructions:
Insn. Stack Stack Description
before after
adi i1 i2 i1+i2 add two integers
adr r1 r2 r1+r2 add two reals
inn i1 s1 is1 set membership; b1 = whether i1 is a member of s1
ldi i1 i1 i1 load integer constant
mov a1 a2 a2 move
not b1 b1 -b1 boolean negation
Environment
Unlike other stack-based environments (such as Forth and the Java virtual machine) but very similar to a real target CPU, the p-System has only one stack shared by procedure stack frames (providing return address, etc.) and the arguments to local instructions. Three of the machine's registers point into the stack (which grows upwards):
SP points to the top of the stack (the stack pointer).
MP marks the beginning of the active stack frame (the mark pointer).
EP points to the highest stack location used in the current procedure (the extreme pointer).
Also present is a constant area, and, below that, the heap growing down towards the stack. The NP (the new pointer) register points to the top (lowest used address) of the heap. When EP gets greater than NP, the machine's memory is exhausted.
The fifth register, PC, points at the current instruction in the code area.
Calling conventions
Stack frames look like this:
EP ->
local stack
SP -> ...
locals
...
parameters
...
return address (previous PC)
previous EP
dynamic link (previous MP)
static link (MP of surrounding procedure)
MP -> function return value
The procedure calling sequence works as follows: The call is introduced with
mst n
where n specifies the difference in nesting levels (remember that Pascal supports nested procedures). This instruction will mark the stack, i.e. reserve the first five cells of the above stack frame, and initialise previous EP, dynamic, and static link. The caller then computes and pushes any parameters for the procedure, and then issues
cup n, p
to call a user procedure (n being the number of parameters, p the procedure's address). This will save the PC in the return address cell, and set the procedure's address as the new PC.
User procedures begin with the two instructions
ent 1, i
ent 2, j
The first sets SP to MP + i, the second sets EP to SP + j. So i essentially specifies the space reserved for locals (plus the number of parameters plus 5), and j gives the number of entries needed locally for the stack. Memory exhaustion is checked at this point.
Returning to the caller is accomplished via
retC
with C giving the return type (i, r, c, b, a as above, and p for no return value). The return value has to be stored in the appropriate cell previously. On all types except p, returning will leave this value on the stack.
Instead of calling a user procedure (cup), standard procedure q can be called with
csp q
These standard procedures are Pascal procedures like readln() (csp rln), sin() (csp sin), etc. Peculiarly eof() is a p-Code instruction instead.
Example machine
Niklaus Wirth specified a simple p-code machine in the 1976 book Algorithms + Data Structures = Programs. The machine had 3 registers - a program counter p, a base register b, and a top-of-stack register t. There were 8 instructions:
lit 0, a : load constant a
opr 0, a : execute operation a (13 operations: RETURN, 5 math functions, and 7 comparison functions)
lod l, a : load variable l,a
sto l, a : store variable l,a
cal l, a : call procedure a at level l
int 0, a : increment t-register by a
jmp 0, a : jump to a
jpc 0, a : jump conditional to a
This is the code for the machine, written in Pascal:
const
amax=2047; {maximum address}
levmax=3; {maximum depth of block nesting}
cxmax=200; {size of code array}
type
fct=(lit,opr,lod,sto,cal,int,jmp,jpc);
instruction=packed record
f:fct;
l:0..levmax;
a:0..amax;
end;
var
code: array [0..cxmax] of instruction;
procedure interpret;
const stacksize = 500;
var
p, b, t: integer; {program-, base-, topstack-registers}
i: instruction; {instruction register}
s: array [1..stacksize] of integer; {datastore}
function base(l: integer): integer;
var b1: integer;
begin
b1 := b; {find base l levels down}
while l > 0 do begin
b1 := s[b1];
l := l - 1
end;
base := b1
end {base};
begin
writeln(' start pl/0');
t := 0; b := 1; p := 0;
s[1] := 0; s[2] := 0; s[3] := 0;
repeat
i := code[p]; p := p + 1;
with i do
case f of
lit: begin t := t + 1; s[t] := a end;
opr:
case a of {operator}
0:
begin {return}
t := b - 1; p := s[t + 3]; b := s[t + 2];
end;
1: s[t] := -s[t];
2: begin t := t - 1; s[t] := s[t] + s[t + 1] end;
3: begin t := t - 1; s[t] := s[t] - s[t + 1] end;
4: begin t := t - 1; s[t] := s[t] * s[t + 1] end;
5: begin t := t - 1; s[t] := s[t] div s[t + 1] end;
6: s[t] := ord(odd(s[t]));
8: begin t := t - 1; s[t] := ord(s[t] = s[t + 1]) end;
9: begin t := t - 1; s[t] := ord(s[t] <> s[t + 1]) end;
10: begin t := t - 1; s[t] := ord(s[t] < s[t + 1]) end;
11: begin t := t - 1; s[t] := ord(s[t] >= s[t + 1]) end;
12: begin t := t - 1; s[t] := ord(s[t] > s[t + 1]) end;
13: begin t := t - 1; s[t] := ord(s[t] <= s[t + 1]) end;
end;
lod: begin t := t + 1; s[t] := s[base(l) + a] end;
sto: begin s[base(l)+a] := s[t]; writeln(s[t]); t := t - 1 end;
cal:
begin {generate new block mark}
s[t + 1] := base(l); s[t + 2] := b; s[t + 3] := p;
b := t + 1; p := a
end;
int: t := t + a;
jmp: p := a;
jpc: begin if s[t] = 0 then p := a; t := t - 1 end
end {with, case}
until p = 0;
writeln(' end pl/0');
end {interpret};
This machine was used to run Wirth's PL/0, a Pascal subset compiler used to teach compiler development.
Microsoft P-Code
P-Code is a name for several of Microsoft's proprietary intermediate languages. They provided an alternate binary format to machine code. At various times, Microsoft have said p-code is an abbreviation for either packed code or pseudo code.
Microsoft p-code was used in Visual C++ and Visual Basic. Like other p-code implementations, Microsoft p-code enabled a more compact executable at the expense of slower execution.
Other implementations
See also
Bytecode
Intermediate representation
Joel McCormack, designer of the NCR Corporation version of the p-code machine
Runtime system
Token threading
References
Further reading
(NB. Has Pascal sources of the P4 compiler and interpreter, usage instructions.)
(NB. Has the p-code of the P4 compiler, generated by itself.)
, including packaging and pre-compiled binaries; a friendly fork of the
(NB. Especially see the articles Pascal-P Implementation Notes and Pascal-S: A Subset and its Implementation.)
External links
Stack-based virtual machines
Pascal (programming language)
Programming language implementation
Articles with example Pascal code
|
217828
|
https://en.wikipedia.org/wiki/JXTA
|
JXTA
|
JXTA (Juxtapose) was an open-source peer-to-peer protocol specification begun by Sun Microsystems in 2001. The JXTA protocols were defined as a set of XML messages which allow any device connected to a network to exchange messages and collaborate independently of the underlying network topology.
As JXTA was based upon a set of open XML protocols, it could be implemented in any modern computer language. Implementations were developed for Java SE, C/C++, C# and Java ME. The C# Version used the C++/C native bindings and was not a complete re-implementation in its own right.
JXTA peers create a virtual overlay network which allows a peer to interact with other peers even when some of the peers and resources are behind firewalls and NATs or use different network transports. In addition, each resource is identified by a unique ID, a 160 bit SHA-1 URN in the Java binding, so that a peer can change its localization address while keeping a constant identification number.
Status
"In November 2010, Oracle officially announced its withdrawal from the JXTA projects". As of August 2011, the JXTA project has not yet been continued or otherwise announced to retain operations, neither a decision was made on the assembly of its Board nor an answer by Oracle regarding a pending request to move the source-code to Apache license version 2.
Protocols in JXTA
Peer Resolver Protocol
Peer Information Protocol
Rendezvous Protocol
Peer Membership Protocol
Pipe Binding Protocol
Endpoint Routing Protocol
Categories of peers
JXTA defines two main categories of peers: edge peers and super-peers. The super-peers can be further divided into rendezvous and relay peers. Each peer has a well defined role in the JXTA peer-to-peer model.
The edge peers are usually defined as peers which have transient, low bandwidth network connectivity. They usually reside on the border of the Internet, hidden behind corporate firewalls or accessing the network through non-dedicated connections.
A Rendezvous peer is a special purpose peer which is in charge of coordinating the peers in the JXTA network and provides the necessary scope to message propagation. If the peers are located in different subnets then the network should have at least one Rendezvous peer.
A Relay peer allows the peers which are behind firewalls or NAT systems to take part in the JXTA network. This is performed by using a protocol which can traverse the firewall, like HTTP, for example.
Any peer in a JXTA network can be a rendezvous or relay as soon as they have the necessary credentials or network/storage/memory/CPU requirements.
Advertisements
An Advertisement is an XML document which describes any resource in a P2P network (peers, groups, pipes, services, etc.). The communication in JXTA can be thought as the exchange of one or more advertisements through the network.
Pipes
Pipes are a virtual communication channel used by JXTA to exchange messages and data. Pipes are asynchronous, unreliable, and unidirectional. There are basically three types of pipes:
Unicast
Uni-cast Secure
Propagate
Peer groups
A peer group provides a scope for message propagation and a logical clustering of peers. In JXTA, every peer is a member of a default group, NetPeerGroup, but a given peer can be member of many sub-groups at the same time. A peer may play different roles in different groups; it may act as an edge peer in one group, but a rendezvous in another.
Each group should have at least one rendezvous peer and it is not possible to send messages between two groups.
Rendezvous network
The Rendezvous peers have an optimized routing mechanism which allows an efficient propagation of messages pushed by edge peers connected to them. This is achieved through the use of a loosely consistent network.
Each Rendezvous peer maintains a Rendezvous Peer View (RPV), a list of known rendezvous peers ordered by the Peer ID. There is not any mechanism to enforce the consistency of all RPVs across the JXTA network, so a given RPV can have a temporary or permanent inconsistent view of the other rendezvous peers. As soon as there is a low churn rate, that is, a stable network where peers don't join or leave too frequently, the RPV list of each peer will converge as each rendezvous peer exchange a random subset of its RPV with other rendezvous peers from time to time.
When an edge peer publishes an Advertisement, the index of this advertisement is pushed to the rendezvous through a system called Shared Resource Distributed Index (SRDI). After that, the rendezvous applies a Distributed Hash Table (DHT) function so that it can forward the index to another peer in the RPV list. For replication purposes, it will send this index to the neighbours of the chosen rendezvous peer in the RPV list.
The lookup process requires the use of the same DHT function to discover the rendezvous peer which is in charge of storing that index. Once the rendezvous peer is reached it will forward the query to the edge peer which published the advertisement and this peer will get in touch with the peer which issues the query.
If the DHT function cannot find a peer which is in charge of the advertisement then the query will be forwarded up and down the RPV list until a match is found, the query is aborted, or it reaches the limits of the RPV list. This process is called random walk.
See also
Peer-to-peer
Rendezvous protocol
Chimera.
References
External links
Official web site
Java implementation of JXTA
french site
Overview of JXTA
Sonatype Repo
Distributed data storage
Cross-platform free software
Free network-related software
Java platform
Network protocols
Sun Microsystems software
|
91037
|
https://en.wikipedia.org/wiki/Lewis%20County%2C%20West%20Virginia
|
Lewis County, West Virginia
|
Lewis County is a county in the U.S. state of West Virginia. As of the 2010 census, the population was 16,372. Its county seat is Weston. The county was formed in 1816 from Harrison County.
Geography
According to the U.S. Census Bureau, the county has a total area of , of which is land and (1.2%) is water.
In 1863, West Virginia's counties were divided into civil townships, with the intention of encouraging local government. This proved impractical in the heavily rural state, and in 1872 the townships were converted into magisterial districts. Lewis County was initially divided into five townships: Battelle, Jane Lew, Lincoln, Sheridan, and Willey. Between 1870 and 1880, these were renamed "Collins Settlement", "Court House", "Freemans Creek", "Hackers Creek", and "Skin Creek". In the 1990s, Collins Settlement and Court House Districts were consolidated into one district, known as "Courthouse-Collins Settlement"; Hackers Creek and Skin Creek were also consolidated, forming "Hackers Creek-Skin Creek".
Major highways
Interstate 79
U.S. Highway 19
U.S. Highway 48
U.S. Highway 33/119
West Virginia Route 4
Adjacent counties
Harrison County (north)
Upshur County (east)
Webster County (south)
Braxton County (southwest)
Gilmer County (west)
Doddridge County (northwest)
Demographics
2000 census
As of the census of 2000, there were 16,919 people, 6,946 households, and 4,806 families living in the county. The population density was 44 people per square mile (17/km2). There were 7,944 housing units at an average density of 21 per square mile (8/km2). The racial makeup of the county was 98.59% White, 0.13% Black or African American, 0.20% Native American, 0.29% Asian, 0.08% from other races, and 0.70% from two or more races. 0.50% of the population were Hispanic or Latino of any race.
There were 6,946 households, out of which 28.60% had children under the age of 18 living with them, 54.60% were married couples living together, 10.50% had a female householder with no husband present, and 30.80% were non-families. 26.90% of all households were made up of individuals, and 13.00% had someone living alone who was 65 years of age or older. The average household size was 2.40 and the average family size was 2.88.
In the county, the population was spread out, with 22.10% under the age of 18, 7.70% from 18 to 24, 28.00% from 25 to 44, 25.90% from 45 to 64, and 16.40% who were 65 years of age or older. The median age was 40 years. For every 100 females there were 94.20 males. For every 100 females age 18 and over, there were 91.40 males.
The median income for a household in the county was $27,066, and the median income for a family was $32,431. Males had a median income of $27,906 versus $18,733 for females. The per capita income for the county was $13,933. 19.90% of the population and 16.30% of families were below the poverty line. 27.00% of those under the age of 18 and 11.20% of those 65 and older were living below the poverty line.
2010 census
As of the 2010 United States Census, there were 16,372 people, 6,863 households, and 4,570 families living in the county. The population density was . There were 7,958 housing units at an average density of . The racial makeup of the county was 97.9% white, 0.5% black or African American, 0.3% Asian, 0.2% American Indian, 0.1% from other races, and 1.0% from two or more races. Those of Hispanic or Latino origin made up 0.6% of the population. In terms of ancestry, 17.5% were American, 15.0% were German, 9.9% were Irish, and 7.2% were English.
Of the 6,863 households, 28.1% had children under the age of 18 living with them, 50.9% were married couples living together, 10.9% had a female householder with no husband present, 33.4% were non-families, and 28.5% of all households were made up of individuals. The average household size was 2.35 and the average family size was 2.84. The median age was 43.4 years.
The median income for a household in the county was $33,293 and the median income for a family was $42,281. Males had a median income of $31,950 versus $25,945 for females. The per capita income for the county was $18,240. About 13.6% of families and 19.6% of the population were below the poverty line, including 25.3% of those under age 18 and 12.9% of those age 65 or over.
Politics
Communities
City
Weston (county seat)
Town
Jane Lew
Magisterial districts
Courthouse-Collins Settlement
Freemans Creek
Hackers Creek-Skin Creek
Unincorporated communities
Aberdeen
Alkires Mills
Alum Bridge
Arnold
Aspinall
Bablin
Bealls Mills
Ben Dale
Bennett
Berlin
Brownsville
Butchersville
Camden
Churchville
Copley
Cox Town
Crawford
Emmart
Freemansburg
Gaston
Georgetown
Homewood
Horner
Ireland
Jackson Mill
Jacksonville
Kitsonville
Lightburn
McGuire Park
Orlando
Pickle Street
Roanoke
Turnertown
Walkersville
Valley Chapel
Vadis
See also
National Register of Historic Places listings in Lewis County, West Virginia
Stonewall Jackson Lake
Stonewall Resort State Park
Lewis County Schools
Footnotes
References
1816 establishments in Virginia
Populated places established in 1816
Counties of Appalachia
|
45075279
|
https://en.wikipedia.org/wiki/Outline%20of%20patents
|
Outline of patents
|
The following outline is provided as an overview of and topical guide to patents:
Patent – set of exclusive rights granted by a sovereign state to an inventor or assignee for a limited period of time in exchange for detailed public disclosure of an invention. An invention is a solution to a specific technological problem and is a product or a process. Patents are a form of intellectual property.
What type of thing is a patent?
A patent can be described as all of the following:
Property – one or more components (rather than attributes), whether physical or incorporeal, of a person's estate; or so belonging to, as in being owned by, a person or jointly a group of people or a legal entity like a corporation or even a society.
Intellectual property –
Types of patents
Biological patent – the scope and reach of biological patents vary among jurisdictions, and may include biological technology and products, genetically modified organisms and genetic material. The applicability of patents to substances and processes wholly or partially natural in origin is a subject of debate.
Business method patent – includes patents on new types of e-commerce; and on methods of doing business in insurance, banking, tax compliance, etc. A business method may be defined as "a method of operating any aspect of an economic enterprise".
Tax patent – discloses and claims a system or method for reducing or deferring taxes. In September 2011, President Barack Obama signed legislation passed by the U.S. Congress that effectively prohibits the granting of tax patents in general.
Chemical patent – patent for an invention in the chemical or pharmaceuticals industry. Not a special legal form of patent.
Design patent –
Essential patent –
Insurance patent –
Medical patent –
Software patent –
Submarine patent –
Patent process
Patent application – request pending at a patent office for the grant of a patent for the invention described and claimed by that application. An application consists of a description of the invention (the patent specification), together with official forms and correspondence relating to the application.
Divisional patent application – type of patent application which contains matter from a previously filed application (the so-called parent application). Whilst a divisional application is filed later than the parent application, it may retain its parent's filing date, and will generally claim the same priority.
Patent drawing – drawing in a patent application that illustrates the invention, or some of its embodiments (which are particular implementations or methods of carrying out the invention), or the prior art. Drawings may be required by law to be in a particular form, and the requirements may vary depending on the jurisdiction.
Patent prosecution – interaction between applicants and their representatives, and a patent office with regard to a patent, or an application for a patent. Broadly, patent prosecution can be split into pre-grant prosecution, which involves negotiation with a patent office for the grant of a patent, and post-grant prosecution, which involves issues such as post-grant amendment and opposition.
Public participation in patent examination – used in some forms to help identifying relevant prior art and, more generally, to help assessing whether patent applications and inventions meet the requirements of patent law, such as novelty, inventive step or non-obviousness, and sufficiency of disclosure.
Patent term adjustment – process of extending the term of a US patent. Its intention is to accommodate for delays caused by the US patent office during the Prosecution of a US patent application. The total PTA is an addition to the 20-year lifespan of a US patent.
History of patents
History of patent law – generally considered to have started with the Venetian Statute of 1474 and the 1624 English Statute of Monopolies.
History of United States patent law – this started even before the U.S. Constitution was adopted, with some state-specific patent laws. The history spans over more than three centuries.
Patent caveat – was a legal document filed with the United States Patent Office. Caveats were instituted by the U.S. Patent Act of 1836, but were discontinued in 1909, with the U.S. Congress abolishing the system formally in 1910.
Patent model – was a scratch-built miniature model no larger than 12" by 12" by 12" (approximately 30 cm by 30 cm by 30 cm) that showed how an invention works. It was one of the most interesting early features of the United States patent system.
1836 U.S. Patent Office fire – second of several disastrous fires in the history of the U.S. Patent Office. Its cause was ultimately determined to be accidental. Many patent documents and models from the preceding three decades were irretrievably lost. As a result of the fire, Congress and the newly legally revamped Patent Office changed the way it handled its recordkeeping, assigning numbers to patents and requiring multiple copies of supporting documentation.
X-Patents – all the patents issued by the United States Patent and Trademark Office from July 1790 (when the first U.S. patent was issued), to July 1836. The actual number is unknown, but the best estimate is 9,957. The records were burned in a fire, in December 1836, while in temporary storage. No copies or rosters were maintained by the government at the time, leaving only the inventors’ copies to reconstruct the collection.
Confederate Patent Office – agency of the Confederate States of America charged with issuing patents on inventions. is known to have issued 266 patents, and likely it issued some more during the early months of 1865. Unfortunately, the records it contained were destroyed in a fire. Very few patent documents issued by the CPO, likely fewer than 10, are known to survive.
1877 U.S. Patent Office fire – second of several disastrous fires in the history of the U.S. Patent Office. It occurred in the Old Patent Office Building in Washington, D.C., on 27 September 1877. Although the building was constructed to be fireproof, many of its contents were not; some 80,000 models and some 600,000 copy drawings were destroyed. No patents were completely lost, however, and the Patent Office soon reopened.
Wright brothers patent war – the Wrights' preoccupation with suing infringers and collecting license fees hindered their development of new aircraft designs, and by 1910 Wright aircraft were inferior to those made by other firms in Europe. Aviation development in the U.S. was suppressed to such an extent that when the country entered World War I no acceptable American-designed aircraft were available, and U.S. forces were compelled to use French machines.
Smartphone patent wars – since 2009, ongoing business battle by smartphone manufacturers including Sony, Google, Apple Inc., Samsung, Microsoft, Nokia, Motorola, Xiaomi, and HTC, among others, in patent litigation. The conflict is part of the wider "patent wars" between multinational technology and software corporations.* State Committee on Standardization, Metrology and Patents (Azerbaijan) –
Patent theory
Economics and patents – Patents are an incentive system designed to encourage innovation. By conferring rights on the owner to exclude competitors from the market (and thus providing a higher probability of financial rewards in the market place), patents offer the incentive for people to study and create new technology.
Prizes as an alternative to patents – Some authors advocating patent reform have proposed the use of prizes as an alternative to patents. Critics of the current patent system, such as Joseph E. Stiglitz, are critical of patents because they fail to provide incentives for innovations which are not commercially marketable.
Patent-related business concepts
Patent cliff – phenomena of patent expiration dates and an abrupt drop in sales that follows for a group of products capturing high percentage of a market. Usually, these phenomena are noticed when they affect blockbuster products. A blockbuster product in the pharmaceutical industry, for example, is defined as a product with sales exceeding US$1 billion per year.
Patent family – patents for a single invention in multiple countries.
Triadic patent – series of corresponding patents filed at the European Patent Office (EPO), the United States Patent and Trademark Office (USPTO) and the Japan Patent Office (JPO), for the same invention, by the same applicant or inventor. Triadic patents form a special type of patent family.
Patent holding company – company that holds patents on behalf of one or more other companies but does not necessarily manufacture products or supply services based upon the patents held.
Patent portfolio – collection of patents owned by a single entity, such as an individual or corporation. The patents may be related or unrelated. Patent applications may also be regarded as included in a patent portfolio.
Patent-related business strategies and techniques
Patent ambush – when a member of a standard-setting organization withholds information, during participation in development and setting a standard, about a patent that the member or the member's company owns, has pending, or intends to file, which is relevant to the standard, and subsequently the company asserts that a patent is infringed by use of the standard as adopted.
Defensive patent aggregation – practice of purchasing patents or patent rights to keep such patents out of the hands of entities that would assert them against operating companies.
Evergreening – variety of legal and business strategies by which technology producers with patents over products that are about to expire retain royalties from them, by either taking out new patents (for example over associated delivery systems, or new pharmaceutical mixtures), or by buying out or frustrating competitors, for longer periods of time than would normally be permissible under the law.
Patent monetization – generation of revenue or the attempt to generate revenue by a person or company by selling or licensing the patents it owns.
Offensive patent aggregation – purchasing of patents in order to assert them against companies that would use the inventions protected by such patents (operating companies) and to grant licenses to these operating companies in return for licensing fees or royalties.
Open patent – patented invention that can freely be distributed under a copyleft-like license. The invention could be used as is, or improved, in which case the patent improvement would have to be re-licensed to the institution that holds the original patent, and from which the original work was licensed.
Patent pooling – forming a consortium of at least two companies who agree to cross-license patents relating to a particular technology. The creation of a patent pool can save patentees and licensees time and money, and, in case of blocking patents, it may also be the only reasonable method for making an invention available to the public.
Patent privateering – when a party, typically a patent assertion entity, authorized by another party, often a technology corporation, uses intellectual property to attack other operating companies. Privateering provides a way for companies to assert intellectual property against their competitors with a significantly reduced risk of retaliation and as a means for altering their competitive landscape.
Patent troll – person or company who enforces patent rights against accused infringers in an attempt to collect licensing fees, but does not manufacture products or supply services based upon the patents in question, thus engaging in economic rent-seeking.
Patent visualisation – application of information visualisation. The number of patents has been increasing steadily, thus forcing companies to consider intellectual property as a part of their strategy. So patent visualisation like patent mapping is used to quickly view patent portfolios.
Patent mapping – graphical modeling used in patent visualisation. This practice "enables companies to identify the patents in a particular technology space, verify the characteristics of these patents, and ... identify the relationships among them, to see if there are any zones of infringement." Patent mapping is also referred to as patent landscaping.
Patent war – "battle" between corporations or individuals to secure patents for litigation, whether offensively or defensively. There are ongoing patent wars between the world's largest technology and software corporations. Contemporary patent wars are a global phenomenon, fought by multinational corporations based in the United States, China, Europe, Japan, Korea and Taiwan.
Patent watch – process for monitoring newly issued patents, as well as possibly pending patent applications, to assess whether any of these patent rights might be of interest or might be annoying.
Patent law
Double patenting –
Glossary of patent law terms –
Large and small entities in patent law –
Patentability – meeting the relevant legal conditions to be granted a patent. By extension, patentability also refers to the substantive conditions that must be met for a patent to be held valid.
Patentable subject matter –
Novelty –
Novelty under the European Patent Convention –
Inventive step or non-obviousness –
Inventive step under the European Patent Convention –
Non-obviousness in United States patent law –
Industrial applicability –
Utility –
Sufficiency of disclosure –
Patent case law –
Patent claim types –
Patent infringement –
Enforcement of European patents –
Patent infringement in Canadian law –
Patent infringement under United Kingdom law –
Patent infringement under United States law –
Patent law cases, United States –
Software patent law
Software patent debate –
Software patents and free software –
Software patents under the European Patent Convention –
Software patents under TRIPs Agreement –
Sufficiency of disclosure –
Disclosure of the invention under the European Patent Convention –
Term of patent –
Term of patent in the United States –
Unity of invention –
Unity of invention under the European Patent Convention –
Patent courts
Patent court –
2014 Danish Unified Patent Court membership referendum –
Federal Patent Court –
Federal Patent Court of Germany –
Federal Patent Court of Switzerland –
Patents Court –
Unified Patent Court –
United States Court of Customs and Patent Appeals –
Patent-related lawsuits
Amazon.com Inc. v. Canada (Commissioner of Patents) –
Harvard College v. Canada (Commissioner of Patents) –
Schlumberger Canada Ltd. v. Canada (Commissioner of Patents) –
Shell Oil Co. v. Commissioner of Patents –
Tennessee Eastman Co. v. Commissioner of Patents –
Ralf Sieckmann v Deutsches Patent und Markenamt –
Patent legislation
Copyright, Designs and Patents Act 1988 –
Drug Price Competition and Patent Term Restoration Act –
Patent Act –
Patent Act (Canada) –
Patent Act of 1790 –
Patent Act of 1836 –
Patent Act of 1922 –
Patent Act of 1952 –
Patent Reform Act –
Patent Reform Act of 2005 –
Patent Reform Act of 2007 –
Patent Reform Act of 2009 –
Patent and Designs Act 1911 –
Patents Act 2004 –
Plant Patent Act of 1930 –
Patent treaties
Convention on the Unification of Certain Points of Substantive Law on Patents for Invention –
European Convention on the International Classification of Patents for Invention –
European Convention relating to the Formalities required for Patent Applications –
Eurasian Patent Convention –
European Patent Convention –
Amendments under the European Patent Convention –
Claims under the European Patent Convention –
Disclosure of the invention under the European Patent Convention –
Divisional applications under the European Patent Convention –
Inventive step under the European Patent Convention –
Novelty under the European Patent Convention –
Observations by third parties under the European Patent Convention –
Petition for review under the European Patent Convention –
Restitutio in integrum under the European Patent Convention –
Software patents under the European Patent Convention –
Unity of invention under the European Patent Convention –
Patent Cooperation Treaty –
Computer programs and the Patent Cooperation Treaty –
Patent Law Treaty –
Substantive Patent Law Treaty –
Parties to patent treaties
Parties to international patent treaties –
Patent law by region
Australian patent law –
Canadian patent law –
Defences and remedies in Canadian patent law –
Novelty and non-obviousness in Canadian patent law –
Presumption of validity in Canadian patent law –
Software patents under Canadian patent law –
Sufficiency of disclosure in Canadian patent law –
Utility in Canadian patent law –
Subject matter in Canadian patent law –
European patent law –
Patent law of the European Union –
German patent law –
Unitary patent (proposed) –
Japanese patent law –
Patent law of the People's Republic of China –
Patent law in Hong Kong –
United Kingdom patent law
Software patents under United Kingdom patent law –
United States patent law –
Biological patents in the United States –
Software patents under United States patent law –
Term of patent in the United States –
Patent administration
Backlog of unexamined patent applications –
South African patent system –
Patent offices
Patent and Trademark Office –
Patent office –
Directorate of Patents and Trademarks (Albania) –
Patent offices in Europe –
Danish Patent and Trademark Office –
European Patent Office –
Appeal procedure before the European Patent Office –
Case Law of the Boards of Appeal of the European Patent Office –
List of decisions and opinions of the Enlarged Board of Appeal of the European Patent Office –
Fees in proceedings before the European Patent Office –
Grant procedure before the European Patent Office –
Official Journal of the European Patent Office –
Guidelines for Examination in the European Patent Office –
Limitation and revocation procedures before the European Patent Office –
Opposition procedure before the European Patent Office –
European Patent Office Reports –
Representation before the European Patent Office –
Standing Advisory Committee before the European Patent Office –
Italian Patent and Trademark Office –
Patent Office of the Republic of Latvia –
Netherlands Patent Office –
Polish Patent Office –
Spanish Patent and Trademark Office –
Swedish Patent and Registration Office –
GCC Patent Office –
Indian Patent Office –
Israel Patent Office –
Japan Patent Office –
Patent office in Indonesia –
United States Patent and Trademark Office –
Specific patents
U.S. Patent No. 1 –
Abraham Lincoln's patent –
Cabilly patents – two US patents issued to Genentech and City of Hope which relate to the "fundamental technology required for the artificial synthesis of antibody molecules." The name refers to lead inventor Shmuel Cabilly, who was awarded the patent while working at City of Hope in the 1980s.
Edison patents –
Nikola Tesla patents –
Hendrik Wade Bode patents –
Reginald Tessenden patents –
Software patents –
Steam technology patents –
X-patents –
Patent-related organizations
Coalition for 21st Century Patent Reform –
American Innovators for Patent Reform –
Chartered Institute of Patent Attorneys –
Coalition for Patent Fairness –
Eurasian Patent Organization –
European Patent Institute –
European Patent Judges' Symposium –
European Patent Lawyers Association –
European Patent Organisation –
Administrative Council of the European Patent Organisation – one of the two organs of the European Patent Organisation, the other being the European Patent Office
Institute of Patentees and Inventors –
International Patent Institute –
Japan Patent Attorneys Association –
National Association of Patent Practitioners –
Nordic Patent Institute –
Patent Office Professional Association –
Software Patent Institute –
The United States Patent Association –
Turkish Patent Institute –
World Intellectual Property Organization (WIPO) –
World Intellectual Property Indicators – an annual report published by WIPO, providing a range of indicators covering the areas of intellectual property
Patent-related publications
Official Journal of the European Patent Office –
People associated with patents
Patent attorneys and agents –
People associated with patent law –
People who have headed the United States Patent Office –
Top United States patent recipients –
See also
Glossary of patent law terms – presents terms used in patent law, including special types of patents and patent applications
Outline of intellectual property
References
External links
This is a list of topics related to patents.
Other
Copyright on the content of patents and in the context of patent prosecution
Criticism of patents
Cross-licensing
epoline
Espacenet
European Patent Office Reports (EPOR)
Evergreening
Global Dossier
Google Patents
INID codes
Innovation and its Discontents (book)
International Patent Documentation Center (INPADOC)
International Patent Classification (IPC)
Internet as a source of prior art
Invention
Invention promotion firm
Large and small entities in patent law
List of patent case law
List of people associated with patent law
List of top United States patent recipients
Markman hearing
Open-source hardware
Patent application
Patent attorney
Patent classification
Patent court
Patent examiner
Patent holding company
Patent infringement
Patent misuse
Patent monetization
Patent Office 1836 fire (United States)
Patent pirate
Patent pool
Patent portfolio
Patent privateer
Patent prosecution
Patent Prosecution Highway (PPH)
Patent thicket
Patent troll
Patent visualisation
Pirate Party
Public participation in patent examination
Scams in intellectual property
United States Patents Quarterly
Patent law lists
Patents
Patents
|
152036
|
https://en.wikipedia.org/wiki/S-100%20bus
|
S-100 bus
|
The S-100 bus or Altair bus, IEEE 696-1983 (withdrawn), is an early computer bus designed in 1974 as a part of the Altair 8800. The bus was the first industry standard expansion bus for the microcomputer industry. computers, consisting of processor and peripheral cards, were produced by a number of manufacturers. The bus formed the basis for homebrew computers whose builders (e.g., the Homebrew Computer Club) implemented drivers for CP/M and MP/M. These microcomputers ran the gamut from hobbyist toy to small business workstation and were common in early home computers until the advent of the IBM PC.
Architecture
The bus is a passive backplane of 100-pin printed circuit board edge connectors wired in parallel. Circuit cards measuring 5 × 10-inches serving the functions of CPU, memory, or I/O interface plugged into these connectors. The bus signal definitions closely follow those of an 8080 microprocessor system, since the Intel 8080 microprocessor was the first microprocessor hosted on the bus. The 100 lines of the bus can be grouped into four types: 1) Power, 2) Data, 3) Address, and 4) Clock and control.
Power supplied on the bus is bulk unregulated +8 Volt DC and ±16 Volt DC, designed to be regulated on the cards to +5 V (used by TTL ICs), -5 V and +12 V for Intel 8080 CPU IC, ±12 V RS-232 line driver ICs, +12 V for disk drive motors. The onboard voltage regulation is typically performed by devices of the 78xx family (for example, a 7805 device to produce +5 volts). These were linear regulators which are commonly mounted on heat sinks.
The bi-directional 8-bit data bus of the Intel 8080 is split into two unidirectional 8-bit data buses. The processor could use only one of these at a time. The Sol-20 used a variation that had only a single 8-bit bus and used the now-unused pins as signal grounds to reduce electronic noise. The direction of the bus, in or out, was signaled using the otherwise unused DBIN pin. This became universal in the market as well, making the second bus superfluous. Later, these two 8-bit buses would be combined to support a 16-bit data width for more advanced processors, using the Sol's system to signal the direction.
The address bus is 16-bits wide in the initial implementation and later extended to 24-bits wide. A bus control signal can put these lines in a tri-state condition to allow direct memory access. The Cromemco Dazzler, for example, is an early card that retrieved digital images from memory using direct memory access.
Clock and control signals are used to manage the traffic on the bus. For example, the DO Disable line will tristate the address lines during direct memory access. Unassigned lines of the original bus specification were later assigned to support more advanced processors. For example, the Zilog Z-80 processor has a non-maskable interrupt line that the Intel 8080 processor does not. One unassigned line of the bus then was reassigned to support the non-maskable interrupt request.
History
During the design of the Altair, the hardware required to make a usable machine was not available in time for the January 1975 launch date. The designer, Ed Roberts, also had the problem of the backplane taking up too much room. Attempting to avoid these problems, he placed the existing components in a case with additional "slots", so that the missing components could be plugged in later when they became available. The backplane is split into four separate cards, with the CPU on a fifth. He then looked for an inexpensive source of connectors, and he came across a supply of military surplus 100-pin edge connectors. The 100-pin bus was created by an anonymous draftsman, who selected the connector from a parts catalog and arbitrarily assigned signal names to groups of connector pins.
A burgeoning industry of "clone" machines followed the introduction of the Altair in 1975. Most of these used the same bus layout as the Altair, creating a new industry standard. These companies were forced to refer to the system as the "Altair bus", and wanted another name in order to avoid referring to their competitor when describing their own system. The "" name, short for "Standard 100", was coined by Harry Garland and Roger Melen, co-founders of Cromemco. While on a flight to attend the Atlantic City PC '76 microcomputer conference in August 1976, they shared the cabin with Bob Marsh and Lee Felsenstein of Processor Technology. Melen went over to them to convince them to adopt the same name. He had a beer in his hand and when the plane hit a bump, Melen spilt some the beer on Marsh. Marsh agreed to use the name, which Melen ascribes to him wanting to get Melen to leave with his beer.
The term first appeared in print in a Cromemco advertisement in the November 1976 issue of Byte magazine. The first symposium on the bus, moderated by Jim Warren, was held November 20, 1976 at Diablo Valley College with a panel consisting of Harry Garland, George Morrow, and Lee Felsenstein. Just one year later, the Bus would be described as "the most used busing standard ever developed in the computer industry."
Cromemco was the largest of the manufacturers, followed by Vector Graphic and North Star Computers. Other innovators were companies such as Alpha Microsystems, IMS Associates, Inc., Godbout Electronics (later CompuPro), and Ithaca Intersystems. In May 1984, Microsystems published a comprehensive product directory listing over 500 "/IEEE-696" products from over 150 companies.
The bus signals were simple to create using an 8080 CPU, but increasingly less so when using other processors like the 68000. More board space was occupied by signal conversion logic. Nonetheless by 1984, eleven different processors were hosted on the bus, from the 8-bit Intel 8080 to the 16-bit Zilog Z-8000. In 1986, Cromemco introduced the XXU card, designed by Ed Lupin, utilizing a 32-bit Motorola 68020 processor.
IEEE-696 Standard
As the bus gained momentum, there was a need to develop a formal specification of the bus to help assure compatibility of products produced by different manufacturers. There was also a need to extend the bus so that it could support processors more capable than the Intel 8080 used in the original Altair Computer. In May 1978, George Morrow and Howard Fullmer published a “Proposed Standard for the Bus” noting that 150 vendors were already supplying products for the Bus. This proposed standard documented the 8-bit data path and 16-bit address path of the bus and stated that consideration was being given to extending the data path to 16 bits and the address path to 24 bits.
In July 1979 Kells Elmquist, Howard Fullmer, David Gustavson, and George Morrow published a "Standard Specification for Bus Interface Devices."
In this specification the data path was extended to 16 bits and the address path was extended to 24 bits. The IEEE 696 Working Group, chaired by Mark Garetz, continued to develop the specification which was proposed as an IEEE Standard and approved by the IEEE Computer Society on June 10, 1982.
The American National Standards Institute (ANSI) approved the IEEE standard on September 8, 1983. The computer bus structure developed by Ed Roberts for the Altair 8800 computer had been extended, rigorously documented, and now designated as the American National Standard IEEE Std 696–1983.
Retirement
IBM introduced the IBM Personal Computer in 1981 and followed it with increasingly capable models: the XT in 1983 and the AT in 1984. The success of these computers cut deeply into the market for bus products. In May 1984, Sol Libes (who had been a member of the IEEE-696 Working Group) wrote in Microsystems: "there is no doubt that the S-100 market can now be considered a mature industry with only moderate growth potential, compared to the IBM PC-compatible market".
As the IBM PC products captured the low-end of the market, machines moved up-scale to more powerful OEM and multiuser systems. Banks of bus computers were used, for example, to process the trades at the Chicago Mercantile Exchange; the United States Air Force deployed bus machines for their mission planning systems. However throughout the 1980s the market for bus machines for the hobbyist, for personal use, and even for small business was on the decline.
The market for bus products continued to contract through the early 1990s, as IBM-compatible computers became more capable. In 1992, the Chicago Mercantile Exchange, for example, replaced their bus computers with the IBM model PS/2. By 1994 the bus industry had contracted sufficiently that the IEEE did not see a need to continue supporting the IEEE-696 standard. The IEEE-696 standard was retired on June 14, 1994.
References
External links
"S100 Computers", A website containing many photos of cards, documentation, and history
""Cromemco" based, S-100 micro-computer", Robert Kuhmann's images of several cards
"Herb's S-100 Stuff", Herbert Johnson's collection of history
"IEEE-696 / Bus Documentation and Manuals Archive", Howard Harte's manuals collection
Computer buses
S-100
IEEE standards
Computer-related introductions in 1974
Cromemco
S-100 machines
|
247041
|
https://en.wikipedia.org/wiki/Swinburne%20University%20of%20Technology
|
Swinburne University of Technology
|
Swinburne University of Technology (often simply called Swinburne) is a public research university based in Melbourne, Australia. It was founded in 1908 as the Eastern Suburbs Technical College by George Swinburne to serve those without access to further education in Melbourne's eastern suburbs. Its main campus is in Hawthorn, a suburb of Melbourne, 7.5 km from the Melbourne central business district.
In addition to its main Hawthorn campus, it has campuses in the Melbourne metropolitan area at Wantirna and Croydon; in Sarawak, Malaysia; and in Sydney.
In the 2022 QS World University Rankings, it placed 19th in Australia and moved up 50 places to 321st globally.
In the 2020 Student Experience Survey, Swinburne was ranked equal 1st place in Victoria for the ’entire education experience’ for undergraduate students, with an overall satisfaction rate of 80 per cent.
History
Swinburne University of Technology has its origins in the Eastern Suburbs Technical College, which was established in 1908 in the Melbourne suburb of Hawthorn by George Swinburne. In 1913, the institution changed its name from Hawthorn College to Swinburne Technical College. It later became known as the Swinburne Institute of Technology.
In the late 1980s, the Outer Eastern University Planning Council advocated for a new university to be established in outer eastern Melbourne. The area had the second lowest university participation rate in Melbourne, after the Mornington Peninsula. Partially in response to this advocacy, in 1990 Swinburne established it's "Eastern Campus" in Mooroolbark (sometimes described as Lilydale), on the site of the recently closed MDA Grammar School. However, students could not attend until 1992 due to council planning negotiation, and the campus was officially opened on 6 April 1992. By 1993, it was known as the "Mooroolbark Campus".
The Dawkins reforms to Australian higher education in the early 1990s lead to many tertiary colleges being merged or split-up, and many given university status.
On 1 January 1992, the university was given the Prahran Campus of Victoria College and the co-located Prahran College of TAFE, both of which had evolved from the Prahran Mechanics' Institute (established in 1854).
Swinburne attained university status on 1 July 1992 with the passage of the Swinburne University of Technology Act.
In 1997, Swinburne opened a campus at Lilydale, replacing it's nearby one at Mooroolbark. In 1998, it merged with the Outer East Institute of TAFE and began operating from campuses at Croydon and Wantirna.
In 1999, Swinburne established the National Institute of Circus Arts (NICA).
In 2000, the university opened a campus in Sarawak, Malaysia, as a partnership between the university and the Sarawak State Government.
In 2008, it collaborated with two other universities in forming The Centre for Social Impact. In February 2011, the university opened the Advanced Technologies Centre, a 22,000 square metre building of modern architectural design at its Hawthorn campus, known locally as "the cheese grater building".
Following a series of funding cuts announced by the Victorian Government to vocational education in May 2012, Swinburne announced that it would close its Lilydale and Prahran campuses. Lilydale campus officially closed on 1 July 2013. The university sold its Prahran campus to the Northern Melbourne Institute of TAFE in 2014. The Lilydale campus was taken over by Box Hill Institute in 2016.
In 2015, Swinburne launched its law school. Through a partnership with Leo Cussen Centre for Law, Swinburne Law School is the only law school in Victoria accredited by the Victorian Legal Admissions Board (VLAB) to enable students to accelerate their admission to legal practice by completing their practical legal training during the final year of their studies.
Campuses
Hawthorn
The Hawthorn campus is Swinburne's main campus. It hosts a range of vocational, undergraduate, and postgraduate programs.
Wantirna
Wantirna is a TAFE-specific campus. The campus also offers courses in areas including health and community services, visual arts, business and accounting.
Croydon
The university's Croydon campus is a TAFE-specific campus, with a focus on training in trades such as building, carpentry, electrical and plumbing.
Prahran
Swinburne no longer operates a "Prahran Campus" (occupying and replacing buildings of the previous by Prahran College). Currently it is the home of the National Institute of Circus Arts (NICA).
Sarawak, Malaysia
The Swinburne University of Technology Sarawak Campus is located in Kuching, Sarawak, Malaysia.
Parramatta
The Parramatta campus is quite small and located in a public library building as a tenant. It has connections to Sydney's bus, tram, metro and train networks as well as having a large taxi rink attached to the building.
Swinburne Online
Swinburne Online is the online arm of the university. Swinburne Online was founded in 2011 after a 50-50 joint venture between Swinburne University of Technology and SEEK Learning seeking to capitalise on increasing demand for off-campus education.
Swinburne Online was originally created under the name Swinburne Direct, with an initial $10 million investment. It was formed to maximise the Australian Government's decision to lift caps on Commonwealth-supported university places from 2012, a policy which intended to increase the number of 25- to 34-year-olds with bachelor's degrees to 40 per cent by 2025.
Swinburne Online originally provided higher education degrees at both bachelor and masters level. As of April 2015, it offered over twenty courses in business, communication, design, education, and social science. However, as of September 2015, Swinburne Online has begun offering vocational education.
In April 2015, CEO Denice Pitt expressed a public desire to expand internationally to offer degrees to international students.
In 2014 Swinburne Online was ranked fourth in Australia's 100 fastest growing companies. Its earnings before interest, tax, depreciation and amortisation grew by 48% to $29.8 million in 2014–15.
Research institutes and centres
, Swinburne has six research institutes:
Data Science Research Institute (launched 2017)
Iverson Health Innovation Research Institute (launched 2017)
Manufacturing Futures Research Institute (launched 2016)
Smart Cities Research Institute (launched 2017)
Social Innovation Research Institute (launched 2017)
Space Technology and Industry Institute (2021)
The Swinburne Institute for Social Research formerly (until 2017) existed within the Faculty of Health, Arts and Design, It included the Public Interest Journalism Foundation (PIJ Foundation), which produced YouComm News. As of 2020, PIJF has evolved into an independent organisation, now named Public Interest Journalistic Freedom, which is partially crowd-funded.
The Centre for Social Impact Swinburne (CSI Swin), established in 2014, is (was?) in the Faculty of Business and Law. It is part of the national network that also includes the University of New South Wales and the University of Western Australia. There are many other research centres, including the Centre for Astrophysics and Supercomputing, the Centre for Mental Health, and the Centre for Human Psychoppharmacology.
Academic profile
Rankings
Swinburne is internationally recognized
for the output from international partnership research. Swinburne performed fairly well in the 2020 Global Nature Index ranking, especially when compared with universities in the Asia-Pacific region. According to the CWTS Leiden rankings in 2020, Swinburne ranked 2nd in the world for Mathematics and Computer Science. Swinburne ranked 10th in Australia in the 2020-2021 European Commission-sponsored global U-Multirank ranking, behind Australian National University.
Swinburne's consistent research and innovation outputs
are presented in the updated Swinburne Research Impact Magazine and Swinburne is also renowned for producing favorable academic-industry partnership.
Swinburne was ranked top 100 in the fields of computer science and engineering, automation and control and civil engineering by the Academic Ranking of World Universities in 2021.
Swinburne was also ranked 19th in Australia and in the top 100 in the world for art and design in the 2022 QS World University Rankings, making it one of the top art and design schools.
Swinburne has been placed in the top 200 for computer science engineering, mechanical engineering and civil engineering in Shanghai Ranking's Global Ranking of Academic Subjects in 2019.
The university was listed in the top 50 for art and design subject area by the 2020 QS World Rankings of Universities by Subject.
Swinburne also performed well in the Times Higher Education World University Rankings 2021 with Swinburne ranked in the top 200 for Engineering & technology, top 250 for Computer Science and Physical Sciences. Social Sciences ranked 301-400th, Business & Economics ranked 401-500th and Clinical, pre-clinical & health positioned at 501-600th in 2021. In 2021, Swinburne has improved in the subject areas of physical sciences, business and economics, computer sciences and engineering and technology in the Times Ranking.
Swinburne Business School is a Member of The Centre for Social Impact. Swinburne has won the 2019 Australian Business Award on Business Innovation of the World Business Awards. Swinburne 's Faculty of Business and Law (Swinburne Business School) ranked in the top 25% Economists and Institutions in Australia and 272nd Business School in the world as of October 2019. Australia's only Graduate School of Entrepreneurship (AGSE) is located in Swinburne. Swinburne Business School issues the quarterly Australian Leadership Index. Swinburne ranked 351-400th in the Business & Management Studies in 2019 by QS World University Rankings, 301-400th
in Business and Economics in the 2020 Times Higher Education World University Rankings and Business Administration ranked 201-300th by Shanghai Ranking in 2019. There were four Swinburne Master programs that ranked in top 200 worldwide by Eduniversal in 2019. Swinburne's online MBA ranked in the top 35（Tier One）internationally by the CEO Magazine 2019 ranking. Swinburne is affiliated with Globally Responsible Leadership Initiative and accredited by AACSB and Principles for Responsible Management Education (PRME).
Student life
Swinburne Student Union (SSU)
Swinburne Student Union (SSU) is the independent student representative body of Swinburne University of Technology in Melbourne, Australia. Membership is opt-in for all students.
Faculty
Notable alumni
Garth Davis: film director, Lion (2016)
Houman Younessi: International authority and expert on information technology and biotechnology.
Andrew Dominik: film director, Chopper (2000), The Assassination of Jesse James by the Coward Robert Ford (2007), Killing Them Softly (2012), and the documentary One More Time with Feeling (2016).
Karl von Möller: film director, D'art (2019), Not Quite Hollywood: The Wild, Untold Story of Ozploitation! (2008)
Mark Hartley: film director, Not Quite Hollywood: The Wild, Untold Story of Ozploitation! (2008)
Bridget Hustwaite, Triple J radio presenter, television presenter, journalist and author
Richard Lowenstein: film director, "Autoluminescent" (documentary film on the life of Rowland S. Howard; 2011), He Died with a Felafel in His Hand (2001), Dogs in Space (1986), "Strikebound" (1984)
L. Scott Pendlebury (1914–1986): landscape and portrait artist; instructor (1946–1963), head of art school (1963–1974) at Swinburne Technical College
Margaret Jane Gurney (born 1943): Australian artist (Swinburne Technical College)
Sam Hammington: comedian who is primarily active in South Korea
Amanda Howard: true crime writer and serial killer specialist
David Williamson: Australian dramatist and playwright
Gillian Armstrong: Australian director.
See also
Centre for Astrophysics and Supercomputing
Education in Australia
List of universities in Australia
National Institute of Circus Arts
Prahran Mechanics' Institute
References
External links
University website
Technical universities and colleges in Australia
Australian vocational education and training providers
Universities in Melbourne
TAFE Colleges in Melbourne
1992 establishments in Australia
Educational institutions established in 1992
Science and technology in Melbourne
|
50738117
|
https://en.wikipedia.org/wiki/Software%20relicensing
|
Software relicensing
|
Software relicensing is applied in open-source software development when software licenses of software modules are incompatible and are required to be compatible for a greater combined work. Licenses applied to software as copyrightable works, in source code as binary form, can contain contradictory clauses. These requirements can make it impossible to combine source code or content of several software works to create a new combined one.
Motivation and description
Sometimes open-source software projects get stuck in a license incompatibility situation. Often the only feasible way to resolve this situation is re-licensing of all participating software parts. For successful relicensing the agreement of all involved copyright holders, typically the developers, to a changed license is required. While in the free and open-source domain achieving 100% coverage of all authors is often impossible due to the many contributors involved, often it is assumed that a great majority is sufficient. For instance, Mozilla assumed an author coverage of 95% to be sufficient. Others in the free and open-source software (FOSS) domain, such as Eric S. Raymond, came to different conclusions regarding the requirements for relicensing of a whole code base.
Cases
An early example of an open-source project that did successfully re-license for license compatibility reasons is the Mozilla project and their Firefox browser. The source code of Netscape's Communicator 4.0 browser was originally released in 1998 under the Netscape Public License/Mozilla Public License but was criticised by the FSF and OSI for being incompatible. Around 2001 Time Warner, exercising its rights under the Netscape Public License, and at the request of the Mozilla Foundation, relicensed all code in Mozilla that was under the Netscape Public License (including code by other contributors) to an MPL 1.1/GPL 2.0/LGPL 2.1 tri-license, thus achieving GPL-compatibility.
The Vorbis library was originally licensed as LGPL, but in 2001 the license was changed to the BSD license with endorsement of Richard Stallman to encourage adoption.
The VLC project also has a complicated license history due to license compatibility: in 2007 it decided for license compatibility reasons to not upgrade to the just released GPLv3. After the VLC was removed from Apple App Store at the beginning of 2011, in October 2011 the VLC project re-licensed the VLC library part from the GPLv2 to the LGPLv2 to achieve better compatibility. In July 2013 the VLC application could then be resubmitted to the iOS App Store relicensed under the Mozilla Public License.
7-Zip's LZMA SDK, originally dual-licensed under both the GNU LGPL and Common Public License, with an additional special exception for linked binaries, was placed by Igor Pavlov in the public domain on December 2, 2008.
The GNU TLS project adopted the LGPLv3 license in 2011 but in 2013 relicensed their code back to LGPLv2.1 due to serious license compatibility problems.
The GNU Free Documentation License in version 1.2 is not compatible with the widely used Creative Commons Attribution-ShareAlike license, which was a problem, for instance, for the Wikipedia. Therefore, at the request of the Wikimedia Foundation, the FSF added, with version 1.3 of the GFDL, a time-limited section allowing specific types of websites using the GFDL to additionally offer their work under the CC BY-SA license. Following in June 2009, the Wikimedia Foundation migrated their projects (Wikipedia, etc.) by dual licensing to the Creative Commons Attribution-ShareAlike as main license, additional to the previously used GFDL. An improved license compatibility with the greater free content ecosystem was given as reason for the license change.
In 2010 the OGRE project changed their license from the LGPL to the MIT License; a simpler license text was given as reason.
Another case was the relicensing of GPLv2 licensed linux kernel header files to the BSD license by Google for their Android library Bionic. To get rid of the GPL, Google claimed that the header files were cleaned from any copyright-able work, reducing them to non-copyrightable "facts". This interpretation was challenged for instance by Raymond Nimmer, a law professor at the University of Houston Law Center.
In November 2013 POV-Ray was relicensed under the Affero General Public License version 3 (or later), after being distributed since 1991 under a FOSS-incompatible, non-commercial source available custom POV-Ray license. POV-Ray was developed before FOSS licenses became widely used, therefore the developers wrote their own license which became later a problem due to license incompatibility with the FOSS ecosystem.
In 2014 the FreeCAD project changed their license from GPL to LGPLv2 due to GPLv3/GPLv2 incompatibilities.
In 2014 Gang Garrison 2 relicensed from GPLv3 to MPL for improved library compatibility.
Also the Dolphin project changed its license from "GPLv2 only" to "GPLv2 or any later" for better compatibility in May 2015.
In June 2015 mpv started the relicensation process of the project's GPL licensed source code for improved license compatibility under LGPLv2 by getting consent from the majority (95%+) of the contributing developers. In August 2016 approx. 90% of the authors could be reached and consented. In October 2017 the switch was finalized.
In July 2015 Seafile switched for improved license compatibility, especially with Git, from the GPLv3 to the GPLv2.
In 2015 Natron was relicensed from MPL to the GPLv2 to allow better commercialization.
In 2016 MAME achieved a relicensing of the code base to BSD/GPL after struggling for years with an own written custom license, with non-commercial license terms.
In August 2016 the MariaDB Corporation relicensed the database proxy server MaxScale from GPL to the non-FOSS but source-available and time-limited Business source license (BSL) which defaults back after three years to GPL. In 2017 followed version 1.1, revised with feedback also from Bruce Perens.
For a long time D back-end source code was available but under a non-open source conform license, because it was partially developed at Symantec and couldn't be relicensed as open source. On April 9, 2017, also the back-end part could be relicensed to the open-source Boost Software License.
On July 27, 2017 Microsoft Research changed the license of space combat simulator Allegiance from the MSR shared source license, under which the game was opened in 2004, to the MIT license.
See also
License compatibility
Backward compatibility
Forward compatibility
License proliferation
References
Copyright licenses
|
23494044
|
https://en.wikipedia.org/wiki/Michael%20Georgeff
|
Michael Georgeff
|
Michael Peter Georgeff is a computer scientist and entrepreneur who has made contributions in the areas of Intelligent Software Agents and eHealth.
Georgeff is a former program director in the Artificial Intelligence Center at SRI International, Menlo Park, California, and former director of the Australian Artificial Intelligence Institute Ltd., at the University of Melbourne. Georgeff is Founder and Chief Executive Officer of Precedence Health Care and Professor in the Faculty of Medicine, Nursing and Health Sciences at Monash University.
Early life and education
Georgeff has a BSc in Physics and Mathematics from Melbourne University, Australia, a B.E. in Aeronautical Engineering from Sydney University, and a PhD from Imperial College London.
Career
While at SRI International, Georgeff was involved in the development of the Procedural Reasoning System and its application to monitor the Reaction Control System of the NASA Space Shuttle Discovery in 1997. Georgeff's work on PRS popularized the field of Intelligent agents and defined the Belief-Desire-Intention software model for programming intelligent agents. In 1988, Georgeff was invited back to Australia to start the Australian Artificial Intelligence Institute which continued work developing and commercializing intelligent agent technology. While at the AAII, Georgeff started Agentis International to explore the commercialization of Intelligent agent technology.
Georgeff was instrumental in at least the following contributions to the field of Intelligent Software Agents: Procedural Reasoning System: An intelligent agent architecture and framework and seminal example of the BDI software model; and Belief-Desire-Intention software model: An intentional software framework for programming intelligent agents based on the BDI cognitive model.
In the early 2000s, Georgeff joined Monash University as director of the e-Health Research Unit of the Monash Institute of Health Services Research, to investigate the application of advanced ICT to health and medicine. Georgeff founded and is CEO of Precedence Health Care, a company dedicated to investigating the commercialization of eHealth technology.
He was the academic supervisor of Rodney Brooks (former director of the MIT Media lab, and founder of IRobot), and Christian Guttmann (global head of Artificial Intelligence and Vice President at Tieto, professor at UNSW).
References
External links
Agentis Software
DBLP: Michael P. Georgeff
Monash University e-Health Research Unit
Precedence Health Care Homepage
Artificial intelligence researchers
Australian computer scientists
Cognitive scientists
Living people
SRI International people
Year of birth missing (living people)
|
856718
|
https://en.wikipedia.org/wiki/Keypunch
|
Keypunch
|
A keypunch is a device for precisely punching holes into stiff paper cards at specific locations as determined by keys struck by a human operator. Other devices included here for that same function include the gang punch, the pantograph punch, and the stamp. The term was also used for similar machines used by humans to transcribe data onto punched tape media.
For Jacquard looms, the resulting punched cards were joined together to form a paper tape, called a "chain", containing a program that, when read by a loom, directed its operation.
For Hollerith machines and other unit record machines the resulting punched cards contained data to be processed by those machines. For computers equipped with a punched card input/output device the resulting punched cards were either data or programs directing the computer's operation.
Early Hollerith keypunches were manual devices. Later keypunches were electromechanical devices which combined several functions in one unit. These often resembled small desks with keyboards similar to those on typewriters and were equipped with hoppers for blank cards and stackers for punched cards. Some keypunch models could print, at the top of a column, the character represented by the hole(s) punched in that column. The small pieces punched out by a keypunch fell into a chad box, or (at IBM) chip box, or bit bucket.
In many data processing applications, the punched cards were verified by keying exactly the same data a second time, checking to see if the second keying and the punched data were the same (known as two pass verification). There was a great demand for keypunch operators, usually women, who worked full-time on keypunch and verifier machines, often in large keypunch departments with dozens or hundreds of other operators, all performing data input.
In the 1950s, Remington Rand introduced the UNITYPER, which enabled data entry directly to magnetic tape for UNIVAC systems. Mohawk Data Sciences subsequently produced an improved magnetic tape encoder in 1965, which was somewhat successfully marketed as a keypunch replacement. The rise of microprocessors and inexpensive computer terminals led to the development of additional key-to-tape and key-to-disk systems from smaller companies such as Inforex and Pertec.
Keypunches and punched cards were still commonly used for both data and program entry through the 1970s but were rapidly made obsolete by changes in the entry paradigm and by the availability of inexpensive CRT computer terminals. Eliminating the step of transferring punched cards to tape or disk (with the added benefit of saving the cost of the cards themselves) allowed for improved checking and correction during the entry process. The development of video display terminals, interactive timeshared systems and, later, personal computers allowed those who originated the data or program to enter it directly instead of writing it on forms to be entered by keypunch operators.
Stamping Jacquard cards, 1801 through 1890
Jacquard cards were said to be stamped or cut (not punched). The first Jacquard cards were stamped by hand, sometimes using a guide plate. An improvement was to place the card between two perforated metal plates (hinged together), insert punches according to the desired pattern, then pass the assembly through a press to cut the card. These essentially manual processes were replaced by machines; piano machines (the name taken from the keys), operated by keyboards and comparable in function to unit record keypunches, becoming the most common.
Hollerith and IBM keypunches, 1890 through 1930s
Herman Hollerith's first device for punching cards from the 1890s was ...any ordinary ticket punch, cutting a round hole 3/16 of an inch in diameter. Use of such a punch was facilitated by placing the holes to be used near the edges of the card. Hollerith soon developed a more accurate and simpler to use Keyboard Punch, using a pantograph to link a punch mechanism to a guide pointer that an operator would place over the appropriate mark in a 12 by 20 matrix to line up a manual punch over the correct hole in one of 20 columns.
In 1901 Hollerith patented a mechanism where an operator pressed one of 12 keys to punch a hole, with the card automatically advancing to the next column. This first-generation Type 001 keypunch used 45 columns and round holes. In 1923 The Tabulating Machine Company introduced the first electric keypunch, the Type 011 Electric Keypunch, a similar looking device where each key closed an electrical contact that activated a solenoid which punched the hole. The 80 column punched card format was introduced in 1928. Later Hollerith keypunches included the Type 016 Motor-Driven Electric Duplicating Keypunch (1929), the Type 31 Alphabetical Duplicating Punch (1933), and the Type 32 Alphabetical Printing Punch (1933).
"Alphabetical duplicating keypunches recorded alphabetic information in tabulating cards so that complete words and names, together with numerical data, could be later printed by an alphabetical accounting machine. The Type 31 Alphabetical Duplicating Punch was introduced by IBM in 1933, and it automatically ejected one card and fed another in 0.65 second. These machines were equipped with separate alphabetical and numerical keyboards. The alphabetical keyboard was similar to a conventional manual typewriter except that the shift, tab, backspace and character keys were eliminated, and a skip, release, stacker and '1' key were provided." – IBM Archives
Post-WW II IBM keypunches and verifiers for 80-column cards
Most IBM keypunch and verifiers used a common electrical/mechanical design in their keyboards to encode the mechanical keystrokes. As a key was depressed, a link on the keystem tripped a corresponding set of bails at the top of the keyboard assembly. The bails in turn made (closed) contacts to encode the characters electrically. As each key stroke was detected by the machine, a feed-back circuit energized a pair of magnets with a bail which restored the keystem mechanically, reset the bails performing the electrical encoding, and gave the "feel" and sound to the operator of a completed action. Each machine had a tendency to develop a "feel" of its own based on several variables such as the amount of wear, dirt, and clearance of the bail contacts within the keyboard, as well as factors in the base machine. The keyboards, however, had no provision for adjusting the "feel" other than the correct adjustment of the contacts on the restore bail contacts and the encoding bail contacts. Special function keys such as shift, release, duplication and others, had only electrical contacts under their stems, with no mechanical linkage to the bail assembly for encoding.
IBM keypunches such as the 024, 026, and 029 provided for the mounting of a program card that controlled various functions, such as tabbing and automatic duplication of fields from the previous card. The later 129 used electronic circuit cards to store simple programs written by the keypunch operator.
IBM 024, 026 Card Punches
The IBM 024 Card Punch and IBM 026 Printing Card Punch were announced in 1949. They were almost identical, with the exception of the printing mechanism. The heart of the 024 and 026 keypunches was a set of twelve precision punches, one per card row, each with an actuator of relatively high power. Punch cards were stepped across the punch one column at a time, and the appropriate punches were activated to create the holes, resulting in a distinctive "chunk, chunk" sound as columns were punched. Both machines could process 51-, 60-, 66-, and 80-column cards.
The 026 could print the punched character above each column. By 1964 there were ten versions with slightly different character sets. The scientific versions printed parentheses, equal sign and plus sign in place of four less frequently used characters in the commercial character sets.
Logic consisted of diodes, 25L6 vacuum tubes and relays. The tube circuits used 150VDC, but this voltage was only used to operate the punch-clutch magnet. Most other circuits used 48VDC.
Characters were printed using a 5 × 7 dot matrix array of wires; the device from which it derived the shape of the character was a metal plate, called the "code plate," with space for 1960 pins (35 pins times 56 printable characters). If the dot was not to be printed in a given character, the pin was machined off. By correctly positioning the plate and pressing it against one end of the array of printing wires, only the correct wires were pressed against the ribbon and then the punched card. (This printer mechanism was generally considered by IBM Customer Engineers to be difficult to repair. One of the most common problems was wires breaking in the tightly curved narrow tube between the code plate and the ribbon—extracting the fragments and replacing the bundle of 35 wires was very tedious). The printing mechanism was prone to be damaged if a user attempted to duplicate "binary" cards with non-standard punch patterns. These could cause the code-plate positioning mechanism to try to shift the plate beyond its intended range of motion, sometimes causing damage. Turning off printing did not actually prevent the damage, as many people assumed, because the code-plate mechanism remained engaged with the punch unit and shifted the code plate. Turning off printing only suppressed pressing the printing pins into the ribbon and card.
Raymond Loewy, industrial designer of "streamlined" motifs who also designed railway passenger cars of the 1930s and 1940s, did the award-winning external design of the 026/024 Card Punches for IBM. Their heavy steel construction and rounded corners (photos) indeed echo the industrial Art Deco style.
IBM 056 Card Verifier
The IBM 056 was the verifier companion to the 024 Card Punch and 026 Printing Card Punch. The verifier was similar to the 026 keypunch except for a red error lens in the machine cover lower center. The verifier operator entered exactly the same data as the keypunch operator and the verifier machine then checked to see if the punched data matched. Successfully verified cards had a small notch punched on the right hand edge.
The IBM 056 verifier used most of the same mechanical and electrical components as the 024/026 keypunches with the exception of the punch unit and print head. The punch unit had sensing pins in place of the punches. The holes sensed or not sensed would trip a contact bail when the configuration was other than that entered by the verifier operator. This stopped the forward motion of the card, and presented a red error light on the machine cover. The notching mechanism was located in the area occupied by the print mechanism on a 026 printing keypunch. It had a solenoid which drove the notching mechanism, and another that selected the top notch punch or end of card punch.
When an operator keying data to be verified encountered an error, the operator was given a second and third try to re-enter the data that was supposed to be in the field. If the third try was incorrect an error notch was put on the top of the card over the column with the error and the "OK" punch at the end of the card was not enabled. The data on the card could actually be correct, since the verifier operator was just as likely to make an error as the keypunch operator. However, with three tries, the operator was less likely to repeatedly make the same error. Some verifier operators were able to guess the error on the card created by the previous keypunch operator, defeating the purpose of the verify procedure, and thus some machines were altered to allow only one entry and error notched on the second try.
Cards with error notches were re-punched (using an 024 or 026) usually by "duplicating" up to the column in error, then entering the correct data. The duplicating function was accomplished by feeding the card through the punch station without punching it. At the next station sensing pins read the holes present in the original card and transferred the data to the punching station and onto a blank card. Columns with errors were corrected instead of being duplicated. The corrected card was then verified to check the data again and be "OK notched".
Typewriter Card Punches
The first combination of card punch and typewriter, permitting selected text to be typed and punched, was developed by the Powers company in 1925. The IBM 824 Typewriter Card Punch was an IBM 024 where the 024 keyboard was replaced by an IBM electric typewriter. Similarly, the IBM 826 used an IBM 026 Keypunch.
IBM 029 Card Punch
Introduced with System/360 in 1964, the 029 had new character codes for parentheses, equal and plus as well as other new symbols used in the EBCDIC code. The IBM 029 was mechanically similar to the IBM 026 and printed the punched character on the top of the card using the same kind of mechanism as the 026, although it used a larger code plate with 2240 printing-pin sites due to the larger set of characters in EBCDIC.
The 029's logic consisted of wire contact relays on later models and reed relays and diodes on SMS cards for early ones. The more "advanced" reed relays used at first proved to be less reliable than expected, causing IBM to revert to the older-style wire-contact relay-based design. All ran on 48 volts DC, and did not require the vacuum tubes that were used in the 024/026. A common additional feature made available (at additional cost) was the leading zeros feature (termed "Left-Zero"). This was delivered by an additional set of four SMS cards. The field was programmed for leading zeros using the program card. If it was (say) a six digit field, the operator only had to key in the actual value (for example 73). The feature would then fill the field by punching the leading four zeros, followed by the 73, in effect right justifying the field, thus: 000073.
IBM 5924 Key Punch
The IBM 5924 Key Punch was the 029 model T01 attached with a special keyboard in IBM's 1971 announcement of the IBM Kanji System, the keypunch operator's left hand selecting one of 15 shift keys and the right hand selecting one of 240 Kanji characters for that shift. It introduced the computer processing of Chinese, Japanese and Korean languages that typically used large character sets over 10,000 characters.
IBM 059 Card Verifier
The IBM 059 was the Verifier companion to the IBM 029 Card Punch. In design, it differed radically from the earlier 056 verifier, in that it used optical sensing of card holes instead of mechanical sensing pins. This made the 059 much quieter than the 056 (which was often louder than the 024 keypunch). The optical sensors used a single light source, which was distributed to various sites within the machine via fiber-optic lightpipes. Despite the technology, the basic mode of operation remained essentially the same as with the 056.
Ironically, not all verifier operators appreciated the noise reduction. When used in a room also containing 029 keypunch machines, the verifier operators sometimes missed the auditory feedback provided by the loud "thunk" noise emitted by the older 056. Some were known to compensate by hitting the keys harder, sometimes actually wearing out keyboard parts.
IBM 129 Card Data Recorder
Introduced with the System/370 in 1971, the IBM 129 was capable of punching, verifying, and use as an auxiliary, on line, 80 column card reader/punch for some computers. A switch on the keyboard console provided the ability to toggle between the punch and verify modes.
The transistorized IBM 129 Card Data Recorder's primary advantage over other IBM keypunches was that it featured an electronic 80-column buffer to hold the card image. When using earlier IBM keypunches, a keystroke error required the card to be ejected by pressing the Release and Register keys, the error corrected by pressing the Duplicate key until the error column was reached, typing the correct data for the rest of that card, then pressing the Release key and manually removing the bad card from the output card stacker before it was placed in the deck (this required some practice, but quickly became an automatic action that you no longer had to think about). With the 129, a keystroke error could be erased by pressing the Backspace key and re-keyed. The entire 80-column card was punched automatically, as fast as the mechanism could go, when the Release key was pressed.
Logic was in SLT modules on a swing out, wire-wrapped backplane.
A secondary advantage of the 129 was that the speed of the keying operation was not limited by punching each column at the time of the keystroke.
The 129 could store six programs in its memory, selectable by a rotary switch. Unlike earlier keypunch machines, the program cards were read into memory via the regular card-feed path, and were not wrapped around a "program drum".
Thanks to its use of electronic memory, the 129 did not have a separate "read station" with a pin-sense unit to enable duplication of data from one card to the next. Instead, duplication was based on the stored image of the previous card. Cards could also be "read-in" through an optical read unit integrated into the punch station.
Program card
IBM 024, 026, and 029 keypunches and their companion verifiers, the 056 and 059, could be programmed to a limited extent using a Program Card, also known as a drum card. The keypunch or verifier could be programmed to automatically advance to the beginning of each field, default to certain character types within the field, duplicate a field from the previous card, and so on. Program cards were an improvement over the Skip Bar used in some earlier keypunches.
The program was encoded on a punched card and could be prepared on any keypunch (a keypunch would operate even if no program card was in place). The program card was wrapped around the program drum, and clamped in place. The drum rotated as the card being punched moved through the punching mechanism. The holes in the program card were sensed by an array of starwheels that would cause levers to rise and fall as the holes in the program card passed beneath the starwheels, activating electrical contacts. The program was encoded in the top six rows [12,11,0,1,2,3]. If the optional Second Program feature was installed, another program could be encoded in the bottom six rows [4,5,6,7,8,9]. A switch let the operator select which program to use. The central cover on the keypunch could be tilted open toward the operator and a locking lever released, allowing the program drum to be removed and replaced.
The program card was punched with characters that controlled its function as follows:
Many programming languages, such as FORTRAN, RPG, and the IBM Assembler, coded operations in specific card columns, such as 1, 10, 16, 36, and 72. The program card for such a setup might be coded as:
1.......10........20........30........40........50........60........70........80
1AAAAAAAA1AAAAA1AAAAAAAAAAAAAAAAAAA1AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA &&&&&&&&
In this example, if the keypunch operator typed a few characters at the beginning of the card and then pressed the skip key, the keypunch would tab to column 10. When a program code of blank is followed by "Field Definition" (12) (or (4) for program 2), it defines a "Numeric Shift" field. In the example above, columns 72-80 are defined in the program as a Numeric Shift field. In practice, this definition would likely be used for punching a special symbol as a "continuation character" in column 72, and then columns 73-80 could either be punched with a card sequence number or the card could be released at that point, if no further typing was required.
Note: "Field Definition" (12) and "Alphabetic Shift" (1) prints as an A.
If program 2 codes were punched, invalid characters could be generated that the printer did not know how to print, some of which could even damage the printer.
Program cards could automate certain tasks, such as "gang punching", the insertion of a constant field into each card of a deck of cards. For amusement, program cards could even be set up to play music by gang-punching "noisy" characters (characters represented by many holes, usually special characters) and "quiet" numbers and letters in rhythmic patterns.
IBM 5496 Data Recorder for 96 column cards
In 1969, IBM introduced the System/3 family of low-end business computers which featured a new, smaller-sized, 96 column punched card. The IBM 5496 Data Recorder, a keypunch with print and verify functions, and IBM 5486 Card Sorter were made for these 96-column cards.
Powers, Remington Rand (UNIVAC) keypunches
Beginning around 1906, an employee of the United States Census Bureau, James Powers, developed the Powers Keypunch, which was specific to the census application and had 240 keys. In 1911, Powers formed Powers Accounting Machine Company. That company was taken over by Remington Rand in 1927. Remington Rand's UNIVAC division made keypunches for their 90-column cards and similar machines for the IBM 80-column card. Their 90-column keypunches used a mechanical system developed by Remington Rand to avoid IBM patent issues (long before the acquisition of Eckert–Mauchly Computer Corporation). UNIVAC keypunches stored the sequence of characters for an entire card, then punched all its holes in a single pass, which allowed for corrections instead of wasting a card in case of error.
Remington Rand keypunches included: UNIVAC Card Code Punch Type 306-5, 90 Column Alphabetical (Types 306-2, 306-3), 90 Column Numerical (Types 204-2, 204-3), Portable Electric Punch Type 202, Spot Punch Type 301, and the Automatic Verifying Machine Type 313.
The Type 306-2 provided for verification; the cards were passed through the keypunch a second time and keyed again. The verify-punching of the same cards in the same sequence ... results in the elongation of perforations for correct information. Round perforations indicate incorrect information. Complete and rapid detection of errors is performed mechanically by the Automatic Verifying Machine
The UNIVAC 1710 Verifying Interpreting Punch was introduced in 1969.
Keypunch as a verb
Saying that something would be keypunched (to keypunch as a verb), now that the actual device called a keypunch has become obsolete, refers to data entry.
This use of the verb has replaced the former process, described
as "When a key is struck on a keypunch, it prints the character on the top of the card
but also punches a series of holes that the computer"
can interpret."
Transition to direct data entry
In the 1950s, Remington Rand introduced the UNITYPER, which enabled data entry directly to magnetic tape for UNIVAC systems. Mohawk Data Sciences subsequently produced an improved magnetic tape encoder in 1965, which was somewhat successfully marketed as a keypunch replacement. In the mid-1970s, the rise of microprocessors and inexpensive computer terminals led to the development of additional key-to-tape and key-to-disk systems from smaller companies such as Inforex and Pertec.
Punched cards were still commonly used for data entry and programming until the mid-1980s. However, eliminating the step of transferring punched cards to tape or disk (with the added benefit of saving the cost of the cards themselves) allowed for improved checking and correction during the data entry process. The development of video display terminals, interactive timeshared systems and, later, personal computers allowed workers who originated the data to enter it directly instead of writing it on forms to be entered by data entry clerks.
See also
Punched card
Punched card input/output
Hollerith code
Unit record equipment
Computer programming in the punched card era
List of IBM products
Chad (paper)
References
Further reading
Columbia University Computing History: IBM Key Punches
External links
Columbia University Computing History: IBM Keypunches
IBM Archives: IBM 029 — Card Punch
IBM Archives: Working for the railroad (001 keypunch)
IBM Punched Card Accounting Machines (1955)
American inventions
Punched card
IBM keypunches
UNIVAC unit record equipment
Unit record equipment
|
2297722
|
https://en.wikipedia.org/wiki/Nitin%20Saxena
|
Nitin Saxena
|
Nitin Saxena (born 3 May 1981) is an Indian scientist in mathematics and theoretical computer science. His research focuses on computational complexity.
He attracted international attention for proposing the AKS Primality Test in 2002 in a joint work with Manindra Agrawal and Neeraj Kayal, for which the trio won the 2006 Fulkerson Prize, and the 2006 Gödel Prize. They provided the first unconditional deterministic algorithm to test an n-digit number for primality in a time that has been proven to be polynomial in n. This research work came out as a part of his undergraduate study.
Early life and education
He is an alumnus of Boys' High School And College, Allahabad. He graduated with his B.Tech in Computer Science and Engineering from Indian Institute of Technology Kanpur in 2002. He received his PhD from the Department of Computer Science and Engineering of the same institute in 2006 with the Dissertation titled "Morphisms of Rings and Applications to Complexity".
Career
He was awarded the Distinguished Alumnus Award of the Indian Institute of Technology Kanpur in 2003 for his work in computational complexity theory. He was appointed at the Centrum Wiskunde & Informatica (CWI) starting as a postdoc researcher from September 2006 onwards. He was a Bonn Junior Fellow at the University of Bonn from Summer 2008 onwards. He joined the Department of Computer Science and Engineering at IIT Kanpur as faculty in April 2013.
Saxena was awarded the 2018 Shanti Swarup Bhatnagar Prize for his work in Algebraic Complexity Theory. One of the youngest awardees, Saxena’s research interests include Computational Complexity and Algebraic Geometry.
References
External links
Nitin Saxena's Homepage
Profile of Nitin Saxena at the IIT Kanpur Alumni Association
.
1981 births
Living people
Indian computer scientists
Gödel Prize laureates
IIT Kanpur alumni
University of Bonn faculty
Recipients of the Shanti Swarup Bhatnagar Award in Mathematical Science
|
8803642
|
https://en.wikipedia.org/wiki/EFx%20Factory
|
EFx Factory
|
The EFx Factory (Architectural-Guidance Software Factory) is created by Microsoft, and one of the first implementations of a software factory.
The ‘EFx Factory’ implements the .NET Distributed Architecture for Service-Oriented applications and services.
The factory is based upon an Architectural Application Framework called Enterprise Framework that describes a physical Microsoft .NET architecture leveraging Microsoft Enterprise Library and other service-oriented patterns from Microsoft patterns & practices.
History
Initially, (circa 2003, .NET Framework 1.0-1.1, Visual Studio 2002–2003) ‘Enterprise Framework’ (EFx) was built to meet customer demand for an implementation of the .NET architecture. The framework was based upon implementation patterns harvested from several enterprise solution implementations, for various customers. This framework implemented the layered .NET architecture and leveraged, and extended Enterprise Library to provide a complete framework for authoring applications and services on the .NET platform.
This application framework evolved along with changes in the .NET platform, emerging Microsoft technologies and changes in industry service orientation patterns. The framework delivered a set of class libraries containing base implementations of the architectural layers prescribing certain technologies (such as ASMX), and ‘infrastructural services’ which developers used to address the cross-cutting concerns for the architectural layers: Exception handling, Authentication, Authorization, Logging etc. The framework extended Enterprise Library, and implemented several real-world security providers necessary for many customers of the time with heterogeneous technology environments. In addition, many best practice patterns, specifically concerning exception handling were built upon Enterprise Library to solve these requirements in an enterprise context. The framework also provided blocks that were not packaged in Enterprise Library, such as a validation block. It provided useful abstractions of Enterprise Library specific to this solution domain, that offered simplified APIs, and the framework unified the API with typing of string parameters.
The primary challenge for developers was learning the patterns of the framework, and hand crafting the applications and services from blank solutions, without availability (at that time) of code templates. This resulted in prolific cut and pasting of code from the Reference Implementation code, itself highly vulnerable to manual error.
Circa 2005, several technologies emerged from Microsoft that enabled the use of templates, automation and modeling of these types of applications and services, including: Visual Studio 2005, Visual Studio Modeling (Distributed Application and System Designers), the Guidance Automation Toolkit (GAT), and the Domain-Specific Language Toolkit (DSL). Using these new technologies, the framework was able to evolve systematically into an implementation of a software factory. In that process, many of the constraints of the framework were lifted to enable further flexibility of the products which the factory could assemble. Primarily - the removal of the prescription of technology in the architectural layers, and the ability to deal effectively with change during the development of the applications and services. The factory introduced, through domain modeling, several new abstractions and utilized automation that were previously not possible.
This factory was one of the first factories to combine DSL diagrams with GAT recipes, as well as extending the Distributed Application and System Designers of Visual Studio with GAT recipes. The factory makes extensive use of recipes: for automating changes to solution structure and property changes to that structure, providing wizards to configure the models the factory provides, generating project templates for work products and automating menial tasks for the factory user.
By 2007, development on the EFx Factory ceased, and many of the concepts it had pioneered were to be absorbed by the future software factory platform from Microsoft, and adopted by software factories from patterns & practices (such as the Web Service Software Factory).
Core features
The following list exemplifies the features of this factory from others of its period.
Architectural Product Model
The factory was one of the first factories to be designed on a factory 'Product Model' (part of the factory schema), and the factory provides a logical architectural view (and supporting runtime) for creating/modifying the work products of the factory, for the developer. This logical model separates the logical design of the factory product ‘Product Explorer’ from the physical implementation normally viewed and modified in ‘Solution Explorer’ of Visual Studio. In this way the physical structure of the solution artifacts could be separated from the logical architectural structure of the work products of the product. The factory user could now focus upon the architecture of the product, and author it using models and other abstractions, whilst the factory manages the creation, and placement of its source artifacts.
Distributed application and system designer integration
The factory integrates with, and extends, the Distributed Application and System Designers installed with Visual Studio Team Edition for Software Architects. The Visual Studio provided diagrams such as the Application Designer and System Designers provide a means to define the high-level application (and services) in an enterprise and compose those into black box systems, which themselves can be composed into larger systems. The factory extends these designers to add a number of new shapes representing the implementation of those applications and services. These new shapes can then be implemented to provide the specific projects and solution templates to represent their physical structure in the factory product. These templates added a new set of diagram files to represent the internal component parts of the application and service layers. These diagrams define the specification of the application or service layers, and give the user a navigation path (drill-down) from the high-level applications into the inner implementation details.
Composability and technology extensibility
The factory models (using DSL's) the internal implementation of the applications and services based upon a logical, technology-independent architecture and SOA patterns. This architecture is composed of several layers which are then extended and implemented by pluggable ‘Artefact Generators’ (or ‘technology providers’). The technology providers provide a technology specific implementation (and view) of each layer.
An example of such a layer would be the ‘Service Contract’ layer of a web service, containing service interfaces, service operations and data contracts.
This factory was the first factory to provide an extensibility mechanism with which 3rd parties (such as Global SI's and ISV's and community domain experts) would provide technology tailored implementations of the various layers. These technology providers would take the form of other external factories (or factorettes), that would integrate into the EFx factory to enhance and expose technology specific views of the architectural models, and ultimately, transform those into source artefacts. This technology separation capability allowed a 'variant factory' to be packaged up and deployed to include: the technology-independent core factory (and its models) with several ‘Artefact Generators’ providing the technology implementations. The factory enabled the composability of variant factories that could build solutions to suit a multitude of real-world heterogeneous technology environments.
See also
Factorette
Software Factory (Microsoft .NET)
External links
MSDN Whitepaper — The EFx Architectural-Guidance Software Factory
Factory Blog — EFx Software Factory
Service-oriented architecture-related products
Software architecture
Information technology management
Microsoft software factories
|
11177823
|
https://en.wikipedia.org/wiki/Multi-link%20trunking
|
Multi-link trunking
|
Multi-link trunking (MLT) is a link aggregation technology developed at Nortel in 1999. It allows grouping several physical Ethernet links into one logical Ethernet link to provide fault-tolerance and high-speed links between routers, switches, and servers.
MLT allows the use of several links (from 2 up to 8) and combines them to create a single fault-tolerant link with increased bandwidth. This produces server-to-switch or switch-to-switch connections that are up to 8 times faster. Prior to MLT and other aggregation techniques, parallel links were underutilized due to Spanning Tree Protocol’s loop protection.
Fault-tolerant design is an important aspect of Multi-Link Trunking technology. Should any one or more than one link fail, the MLT technology will automatically redistribute traffic across the remaining links. This automatic redistribution is accomplished in less than half a second (typically less than 100 millisecond) so no outage is noticed by end users. This high speed recovery is required by many critical networks where outages can cause loss of life or very large monetary losses in critical networks. Combining MLT technology with Distributed Split Multi-Link Trunking (DSMLT), Split multi-link trunking (SMLT), and R-SMLT technologies create networks that support the most critical applications.
A general limitation of standard MLT is that all the physical ports in the link aggregation group must reside on the same switch. SMLT, DSMLT and R-SMLT technologies removes this limitation by allowing the physical ports to be split between two switches.
Split multi-link trunking
Split multi-link trunking (SMLT) is a Layer-2 link aggregation technology in computer networking originally developed by Nortel as an enhancement to standard multi-link trunking (MLT) as defined in IEEE 802.3ad.
Link aggregation or MLT allows multiple physical network links between two network switches and another device (which could be another switch or a network device such as a server) to be treated as a single logical link and load balance the traffic across all available links. For each packet that needs to be transmitted, one of the physical links is selected based on a load-balancing algorithm (usually involving a hash function operating on the source and destination Media Access Control (MAC) address information). For real-world network traffic this generally results in an effective bandwidth for the logical link equal to the sum of the bandwidth of the individual physical links. Redundant links that were once unused due to Spanning Tree’s loop protection can now be used to their full potential.
A general limitation of standard link aggregation, MLT or EtherChannel is that all the physical ports in the link aggregation group must reside on the same switch. The SMLT, DSMLT and RSMLT protocols remove this limitation by allowing the physical ports to be split between two switches, allowing for the creation of Active load sharing high availability network designs that meet five nines availability requirements.
SMLT topologies
The two switches between which the SMLT is split are known as aggregation switches and form a logical cluster which appears to the other end of the SMLT link as a single switch.
The split may be at one or at both ends of the MLT. If both ends of the link are split, the resulting topology is referred to as an "SMLT square" when there is no cross-connect between diagonally opposite aggregation switches, or an "SMLT mesh" when each aggregation switch has a SMLT connection with both aggregation switches in the other pair. If only one end is split, the topology is referred to as an SMLT triangle.
In an SMLT triangle, the end of the link which is not split does not need to support SMLT. This allows non-Avaya devices including third-party switches and servers to benefit from SMLT. The only requirement is that IEEE 802.3ad static mode must be supported.
Operation
The key to the operation of SMLT is the Inter-Switch Trunk (IST). The IST is a (standard) MLT connection between the aggregation switches which allows the exchange of information regarding traffic forwarding and the status of individual SMLT links.
For each SMLT connection, the aggregation switches have a standard MLT or individual port with which an SMLT identifier is associated. For a given SMLT connection, the same SMLT ID must be configured on each of the peer aggregation switches.
For example, when one switch receives a response to an ARP request from an end station on a port that is part of an SMLT, it will inform its peer switch across the IST and request the peer to update its own ARP table with a record pointing to its own connection with the corresponding SMLT ID.
In general, normal network traffic does not traverse the IST unless this is the only path to reach a host which is connected only to the peer switch. By ensuring all devices have SMLT connections to the aggregation switches, traffic never needs to traverse the IST and the total forwarding capacity of the switches in the cluster is also aggregated.
The communication between peer switches across the IST allows both unicast and multicast routing information to be exchanged allowing protocols such as Open Shortest Path First (OSPF) and Protocol Independent Multicast-Sparse Mode (PIM-SM) to operate correctly.
Failure scenarios
The use of SMLT not only allows traffic to be load-balanced across all the links in an aggregation group but also allows traffic to be redistributed very quickly in the event of link or switch failure. In general the failure of any one component results in a traffic disruption lasting less than half a second (normal less than 100 millisecond) making SMLT appropriate in environments running time- and loss-sensitive applications such as voice and video.
In a network using SMLT, it is often no longer necessary to run a spanning tree protocol of any kind since there are no logical bridging loops introduced by the presence of the IST. This eliminates the need for spanning tree reconvergence or root-bridge failovers in failure scenarios which causes interruptions in network traffic longer than time-sensitive applications are able to cater for.
Product support
SMLT is supported within the following Avaya Ethernet Routing Switch (ERS) and Virtual Services Platform (VSP) Product Families: ERS 1600, ERS 5500, ERS 5600, ERS 7000, ERS 8300, ERS 8800, ERS 8600, MERS 8600, VSP 9000
SMLT is fully interoperable with devices supporting standard MLT (IEEE 802.3ad static mode).
R-SMLT
Routed-SMLT (R-SMLT) is a computer networking protocol developed at Nortel as an enhancement to split multi-link trunking (SMLT) enabling the exchange of Layer 3 information between peer nodes in a switch cluster for resiliency and simplicity for both L3 and L2.
In many cases, core network convergence time after a failure is dependent on the length of time a routing protocol requires to successfully converge (change or re-route traffic around the fault). Depending on the specific routing protocol, this convergence time can cause network interruptions ranging from seconds to minutes. The R-SMLT protocol works with SMLT and distributed Split Multi-Link Trunking (DSMLT) technologies to provide sub-second failover (normally less than 100 milliseconds) so no outage is noticed by end users. This high speed recovery is required by many critical networks where outages can cause loss of life or very large monetary losses in critical networks.
RSMLT routing topologies providing an active-active router concept to core SMLT networks. The protocol supports networks designed with SMLT or DSMLT triangles, squares, and SMLT or DSMLT full mesh topologies, with routing enabled on the core VLANs. R-SMLT takes care of packet forwarding in core router failures and works with any of the following protocol types: IP Unicast Static Routes, RIP1, RIP2, OSPF, BGP and IPX RIP.
Product support
R-SMLT is supported on Avaya's Ethernet Routing Switch ERS 8600, ERS 8800, VSP9000, ERS 8300 and MERS 8600 products.
Distributed multi-link trunking
Distributed multi-link trunking (DMLT) or distributed MLT is a proprietary computer networking protocol designed by Nortel Networks, and now owned by Extreme Networks, used to load balance the network traffic across connections and also across multiple switches or modules in a chassis. The protocol is an enhancement to the Multi-Link Trunking (MLT) protocol.
DMLT allows the ports in a trunk (MLT) to span multiple units of a stack of switches or to span multiple cards in a chassis, preventing network outages when one switch in a stack fails or a card in a chassis fails.
DMLT is described in an expired United States Patent.
Distributed split multi-link trunking
Distributed split multi-link trunking (DSMLT) or Distributed SMLT is a computer networking technology developed at Nortel to enhance the Split Multi-Link Trunking (SMLT) protocol. DSMLT allows the ports in a trunk to span multiple units of a stack of switches or to span multiple cards in a chassis, preventing network outages when one switch in a stack fails or one card in a chassis fails.
Fault-tolerance is a very important aspect of Distributed Split Multi-Link Trunking (DSMLT) technology. Should any one switch, port, or more than one link fail, the DSMLT technology will automatically redistribute traffic across the remaining links. Automatic redistribution is accomplished in less than half a second (typically less than 100 milliseconds) so no outage is noticed by end users. This high speed recovery is required by many critical networks where outages can cause loss of life or very large monetary losses in critical networks. Combining Multi-Link Trunking (MLT), DMLT, SMLT, DSMLT and R-SMLT technologies create networks that support the most critical networks.
Product support
SMLT is supported on Avaya's Ethernet Routing Switch 1600, 5500, 8300, ERS 8600, MERS 8600, VSP-7000 and VSP-9000 products.
References
Further reading
Technical Brief Split Multi-Link Trunking Ethernet Routing Switch 8600
Desktop Connectivity
Using Distributed Multi-Link Trunking
Distributed multi-link trunking method and apparatus Google Patents
Distributed multi-link trunking method and apparatus Patent Genius
Distributed multi-link trunking method and apparatus Patent Storm
External links
Tolly Benchmarks -Retrieved 29 July 2011
See IEEE.org for info on 802.3ad standard -Retrieved 29 July 2011
Avaya
Communication circuits
Ethernet
Link protocols
Network topology
Nortel protocols
Bonding protocols
Nortel
Network architecture
Reliability engineering
Articles containing video clips
|
31064767
|
https://en.wikipedia.org/wiki/A.%20R.%20D.%20Prasad
|
A. R. D. Prasad
|
Dr A.R.D. Prasad is an Indian Library and Information Science Academic, Information professional and Information scientist. Dr Prasad teaches at Documentation Research and Training Centre (DRTC), Bangalore as Professor of Library and Information Science and he is retired Head of DRTC, which is India's only proper ischool with a very strong research program. His areas of specialisation include Artificial intelligence-Applications in LIS, Natural language processing, Digital Libraries, Hypertext and Multimedia applications, Institutional repository, Open-source software used in Libraries, Open Access to Information, Semantic Web Technology, Free and open source software etc. His other area of interests are Mythology, Buddhism, Philosophy and Indian History. He is pioneer in the promotion and development of Open-source software used in Libraries and Information Centres in India, Open access (publishing) and Open Access movement. He is visiting Faculty of University of Trento, Italy.
Early life
He has Master of Arts (M.A), M.Phil. in Philosophy, BLIS, ADIS (from DRTC, ISI) and obtained his doctorate (PhD) on "Application of Natural Language Processing Tools and Technique in Developing Subject Indexing Languages" from Karnatak University, Dharwad.
Career
Dr. Prasad is senior faculty at Documentation Research and Training Centre (DRTC). He joined DRTC as a lecturer on 4 June 1990.
Memberships and association
Member, Working Group, National Knowledge Commission, Government of India.
Member, DSpace Governance Advisory Committee
Member, Project Evaluation committee on E-Infrastructure, European Commission, Brussels.
Member, UGC Curriculum Development Committee
Member, UGC ETDs Guidelines (Electronic Theses and Dissertations)
Member, Retro-conversion committee of National Library of India
Consultant, United Nations-Food and Agriculture Organization (UN-FAO)
A Fulbright Scholar(1999)
Mentor, Google Summer of Code
Invited Speaker, Indian National Science Congress, 2006, Hyderabad
Literary and scientific activities
Currently he is active in European Commissions FP7-FET project on Living Knowledge. He is Editor of the Proceedings of the International Conference on Semantic Web and Digital Libraries (ICSD-2007). He is also guest Editor of Online Information Review, V.32(4),2008, special edition on Semantic Web and Web Design.
Published Work
Peer reviewed articles in international Periodicals
Devika P. Madalli and A.R.D. Prasad: Vyasa: a knowledge representation system for automatic management of analytico-synthetic system. accepted for the 7th International Conference of Society for Knowledge Organisation. 10–13 July Granada, Spain.
Pijush Kanti Panigrahi and A.R.D. Prasad : An Inference Engine for Time Isolates of Colon Classification Schedule. 6th International Study Conference on Classification Research organised by FID/CR and University College London. June 16?18, 1997, London.
Devika V. Aptagiri, Gopinath M.A. and A. R. D. Prasad. A knowledge Representation Paradigm for Automating POPSI. Knowledge Organization. V 22(3/4). 1995. pp. 162–167.
A.R.D. Prasad. Prometheus: An Automatic Indexing System. 4th International Conference of the ISKO. 15–18 July 1996. Washington, DC.
M.A.Gopinath and A.R.D.Prasad. A Knowledge Representation Model for Analytico-Synthetic Classification. In: Knowledge Organization and Quality Management, Edited by Hanne Albrechtsen and Susanne Oernager. Indeks Verlag, Frankfurt. 1994.
Durga Shankar Rath and ARD Prasad. Heuristics for identification of Bibliographic Elements from Title Pages. Approved for publication in International Cataloguing and Bibliographic Control. To be published in December 2003.
ARD Prasad and Durga Shankar Rath. Heuristics for identification of Bibliographic Elements from Verso of Title Pages. Sent for publication in Library Hitech.
Ralf Depping: vascoda.de and the system of the German virtual subject libraries. In: Prasad, A.R.D. & Madalli, D.P. (eds.): International Conference on Semantic Web and Digital Libraries (ICSD 2007), 21–23 February 2007: 304–314. (pdf file, 730 KB)
Papers in Indian Periodicals
A.R.D. Prasad. Z39.50 for Retrieving MARC21 Records in Batch mode. In Workshop on Information Resource Management, Documentation Research & Training Centre, ISI, Bangalore, 13–15 March 2002.
A. R. D. Prasad. Metadata:Cataloguing of Web Resources Using Dublin Core and Marc21. In Digital Libraries:Content Creation, Access and Management. USEFI-IIT Delhi workshop. IIT, New Delhi. 18–22 December 2001.
A. R. D. Prasad. A Brief Introduction of Z39.50. NACLIN- 2001. University of Hyderabad. 6–9 November 2001.
A R D Prasad. Creation of Digital Libraries in Indian Languages Using Unicode. Paper presented at the Joint Workshop on Digital Libraries. USEFI, DRTC, and University of Mysore. Mysore. 12–16 March 2001.
A.R.D. Prasad. Working with Digital Information using WWWISIS on Linux. In. CALIBER 2001. INFLIBNET and University of Pune, Pune, 15–16 March 2001. pp. 32–45.
A R D Prasad. Using Multimedia Database with WWWISIS on Win9x/NT. Paper presented at the Workshop on Multimedia and Internet Technologies. Documentation Research Training Centre. Bangalore. 26–28 February 2001.
A R D Prasad : Chaos! Thy Name is Internet. In: DRTC Workshop on Information Management including ISO 9000 QMS. DRTC, ISI Bangalore. 6–8 January 1999.
A R D Prasad and Smitha Srishaila. File formats for Multimedia. Article published in the book Multimedia: its applications in Library and Information Science. T.R. Publications, Madras. 1998.
Unit writer for the Postgraduate Diploma in Library Automation and Networking, Distance Education Programme. Editor. University of Hyderabad, Hyderabad. 1998.
A R D Prasad and A Aruna. A Prototype LAN Model for Indian Universities. Paper presented at the National Seminar on Information Technology Applications in Libraries and Information Centers. Vidyasagar University. Medinipur. 24–25 March 1998
A R D Prasad and A Aruna. Penelope's Web: New challenges to Librarians. 17th Annual Convention and Conference of the SIS on Virtual Libraries: Internet based Library and Information Services. University of Hyderabad, Hyderabad. 12–14 March 1998.
A R D Prasad: Internet: Connectivity Issues. Paper presented in the DRTC Workshop on Practical Orientation to Internet. DRTC, Bangalore. 28–30 Jan 1998.
A.R.D Prasad: Browsers: Interface to the Web. Paper presented in the DRTC Workshop on Practical Orientation to Internet.DRTC, Bangalore 28–30 Jan 1998.
A.R.D Prasad: Customising Web browsing through Internet Channels. Paper presented in the DRTC Workshop on Practical Orientation to Internet. DRTC, Bangalore 28–30 Jan 1998.
A.R.D Prasad: Interfacing the Web: An overview of alternatives. Paper presented in the DRTC Workshop on Practical Orientation to Internet. DRTC, Bangalore. 28–30 Jan 1998.
Madhuchanda Bhattacharyya and A R D Prasad. Internet Webcasters. Paper presented in the 21st All India IASLIC Conference on Information Superhighway: its impact on Library and Information Services in India, Tamil Nadu Agricultural University, Coimbatore, 26–29 December 1997.
A.R.D Prasad, Smitha Srishaila and P.H.Akkamahadevi: Natural Language Interface to Databases. Paper Accepted for the 16th Annual Convention and Conference of the Society for Information Science. 29–31 January 1997. Bhuvaneshwar.
A.R.D Prasad and Prasenjit Kar: Self Sufficiency versus Resource Sharing: Implications in Library networks. Paper presented in the XVII National Seminar of IASLIC. 10–13 Dec 1996. Calcutta.
A.R.D Prasad: Some reflections on the Impact of Information Technology on Library Science Profession. Paper presented in the DRTC workshop on Advances in Information Technology. Oct 28–30,1996. Bangalore.
A.R.D Prasad and Devika V Aptagiri: Multimedia Technology: An overview of hardware aspects. Paper presented in the DRTC workshop on Advances in Information Technology. Oct 28–30,1996. Bangalore.
Smitha Srishaila and A.R.D Prasad: An Overview of Multimedia File Formats. Paper presented in the DRTC workshop on Advances in Information Technology. Oct 28–30,1996. Bangalore.
A.R.D. Prasad. IDA: A retrospective conversion software for OCLC, LC, BNB and Bookfind CD-ROM Databases. DESIDOC Bulletin of Information Technology, V 15(3). May 1995. pp 13–17.
Devika V. Aptagiri, Sudhanshu Bala Satapathy and A.R.D. Prasad. Optical Character Recognition ib building bibliographic databases. In. XX IASLIC Conference. 26–29 Dec 1995. Lucknow.
Devika V.Aptagiri and A.R.D.Prasad. Computer Assisted Thesaurus Construction. In: Research and Teaching in Classification and Indexing, Edited by M.A.Gopinath. DRTC Annual Seminar, 9–11 August, 94. Bangalore.
A.R.D. Prasad and Ranjan Sinha Takur. Automatic Identification of Key Terms from Book Titles In: Research and Teaching in Classification.
A.R.D. Prasad and C.R. Karisiddappa. Declarative programming and Thesaurus Construction. In: Database Production and Distribution, Edited by N.Seshagiri, I.K. Ravichandra Rao and N.V.Satyanarayana. Tata Mc Graw-Hill, New Delhi. 1993.
A.R.D. Prasad and Bidyut Baran Kar. Parsing Boolean Expressions Using Definite Clause Grammar. Library Science with a slant to Documentation, v.31 (1), March, 94. pp. 24–26.
A.R.D. Prasad. Introduction to Artificial Intelligence In: Artificial Intelligence and its Applications to Library and Information Work, Edited by A.R.D. Prasad. DRTC Refresher Seminar, 26–28 May, 93. Bangalore.
A.R.D. Prasad. Logic and Logic Programming In: Artificial Intelligence and its Applications to Library and Information Work, Edited by A.R.D. Prasad, Drtc Refresher Seminar, 26–28 May 93, Bangalore.
A.R.D. Prasad. Natural Language Processing In: Artificial Intelligence and its Applications to Library and Information Work, Edited by A.R.D. Prasad, DRTC Refresher Seminar, 26–28 May 93, Bangalore.
A.R.D. Prasad. Towards a Common command Language. In: Energizing Library and Information Services, Edited by M.A. Gopinath. DRTC Refresher Seminar, 20—22 May 1992. Bangalore.
A.R.D. Prasad. Natural Language Processing Techniques in Information retrieval: An Overview. In: Information Retrieval, Edited by I.K.Ravichandra Rao. Annual Seminar, 5–7 Feb, '92. Bangalore.
A.R.D. Prasad. Guidelines for design and development for Computer Assisted Instruction (CAI) Software. In: 9th IATLIS Conference held at Visakhapatnam, 9–11 August 1992.
A.R.D. Prasad. Optical Character Recognition. In: Current Research in Library and Information Science, Edited by S. Seetharama and C.R. Karisiddappa. RBSA Publishers, Jaipur, 1993.
A.R.D. Prasad. Database Management Systems. In: Dimensions of Library and Information Science. Edited by V. Venkatappaiah, Concept Publishers, 1990.
A.R.D. Prasad. A Case for Artificial Intelligence in Library and Information Science Curriculum. In: Specialization in Library and Information Science Education. 8th IATLIS Conference held at Bangalore, 17—19 January 1990.
References
External links
http://www.grl2020.net/uploads/position_papers/A.R.D.%20Prasad.pdf
A.R.D. Prasad | Documentation Research and Training Centre
http://www.ignca.nic.in/PDF_data/kn_digital001_pdf_data/T2a_Development_Digital_Repository.pdf
https://web.archive.org/web/20110721150059/http://ir.inflibnet.ac.in/dxml/bitstream/handle/1944/551/323-329(cal%2007).pdf?sequence=1
http://crl.du.ac.in/ical09/invitations.pdf
Wayback Machine
Karnatak University alumni
Living people
1954 births
Scientists from Bangalore
Indian statisticians
Natural language processing researchers
Data miners
|
7639649
|
https://en.wikipedia.org/wiki/Green%20threads
|
Green threads
|
In computer programming, green threads or virtual threads are threads that are scheduled by a runtime library or virtual machine (VM) instead of natively by the underlying operating system (OS). Green threads emulate multithreaded environments without relying on any native OS abilities, and they are managed in user space instead of kernel space, enabling them to work in environments that do not have native thread support.
Etymology
Green threads refers to the name of the original thread library for the programming language Java (that was released in version 1.1 and then Green threads were abandoned in version 1.3 to native threads). It was designed by The Green Team at Sun Microsystems.
Performance
On a multi-core processor, native thread implementations can automatically assign work to multiple processors, whereas green thread implementations normally cannot. Green threads can be started much faster on some VMs. On uniprocessor computers, however, the most efficient model has not yet been clearly determined.
Benchmarks on computers running the Linux kernel version 2.2 (released in 1999) have shown that:
Green threads significantly outperform Linux native threads on thread activation and synchronization.
Linux native threads have slightly better performance on input/output (I/O) and context switching operations.
When a green thread executes a blocking system call, not only is that thread blocked, but all of the threads within the process are blocked. To avoid that problem, green threads must use asynchronous I/O operations, although the increased complexity on the user side can be reduced if the virtual machine implementing the green threads spawns specific I/O processes (hidden to the user) for each I/O operation.
There are also mechanisms which allow use of native threads and reduce the overhead of thread activation and synchronization:
Thread pools reduce the cost of spawning a new thread by reusing a limited number of threads.
Languages which use virtual machines and native threads can use escape analysis to avoid synchronizing blocks of code when unneeded.
Green threads in the Java virtual machine
Original implementation: Green Threads
In Java 1.1, green threads were the only threading model used by the Java virtual machine (JVM), at least on Solaris. As green threads have some limitations compared to native threads, subsequent Java versions dropped them in favor of native threads.
An exception to this is the Squawk virtual machine, which is a mixture between an operating system for low-power devices and a Java virtual machine. It uses green threads to minimize the use of native code, and to support migrating its isolates.
Kilim and Quasar
are open-source projects which implement green threads on later versions of the JVM by modifying the Java bytecode produced by the Java compiler (Quasar also supports Kotlin and Clojure).
Future implementation: Project Loom
Project Loom: Virtual threads is a lightweight user-mode scheduled alternative to standard OS managed threads. Virtual threads are mapped to OS threads in a many-to-many relationship, in contrast to the many-to-one relationship from the original implementation.
Green threads in other languages
There are some other programming languages that implement equivalents of green threads instead of native threads. Examples:
Chicken Scheme uses lightweight user-level threads based on first-class continuations
Common Lisp
CPython with greenlet, eventlet and gevent, PyPy
Crystal offers fibers
D offers fibers, used for asynchronous I/O
Dyalog APL terms them threads
Erlang
Go
Haskell
Julia uses green threads for its Tasks.
Limbo
Lua uses coroutines for concurrency. Lua 5.2 also offers true C coroutine semantics through the functions lua_yieldk, lua_callk, and lua_pcallk. The CoCo extension allows true C coroutine semantics for Lua 5.1.
Nim provides asynchronous I/O and coroutines
occam, which prefers the term process instead of thread due to its origins in communicating sequential processes
Perl supports green threads through coroutines
PHP supports green threads through coroutines
Ruby before version 1.9
Racket (native threads are also available through Places)
Rust runs system threads natively; however, it supports green threads through third-party libraries like Tokio.
SML/NJ's implementation of Concurrent ML
Smalltalk (most dialects: Squeak, VisualWorks, GNU Smalltalk, etc.)
Stackless Python supports either preemptive multitasking or cooperative multitasking through microthreads (termed tasklets).
Tcl has coroutines and an event loop
The Erlang virtual machine has what might be called green processes – they are like operating system processes (they do not share state like threads do) but are implemented within the Erlang Run Time System (erts). These are sometimes termed green threads, but have significant differences from standard green threads.
In the case of GHC Haskell, a context switch occurs at the first allocation after a configurable timeout. GHC threads are also potentially run on one or more OS threads during their lifetime (there is a many-to-many relationship between GHC threads and OS threads), allowing for parallelism on symmetric multiprocessing machines, while not creating more costly OS threads than needed to run on the available number of cores.
Occam is unusual in this list because its original implementation was made for the Transputer, and hence no virtual machine was needed. Later ports to other processors have introduced a virtual machine modeled on the design of the Transputer, an effective choice because of the low overheads involved.
Most Smalltalk virtual machines do not count evaluation steps; however, the VM can still preempt the executing thread on external signals (such as expiring timers, or I/O becoming available). Usually round-robin scheduling is used so that a high-priority process that wakes up regularly will effectively implement time-sharing preemption:
[
[(Delay forMilliseconds: 50) wait] repeat
] forkAt: Processor highIOPriority
Other implementations, e.g., QKS Smalltalk, are always time-sharing. Unlike most green thread implementations, QKS also supports preventing priority inversion.
See also
Async/await
Light-weight process
Coroutine
Java virtual machine
Global interpreter lock
Fiber (computer science)
GNU Portable Threads
Protothreads
References
External links
"Four for the ages", JavaWorld article about Green threads
Green threads on Java threads FAQ
Threads (computing)
Java platform
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.