source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/Elliptic%20Curve%20Digital%20Signature%20Algorithm | In cryptography, the Elliptic Curve Digital Signature Algorithm (ECDSA) offers a variant of the Digital Signature Algorithm (DSA) which uses elliptic-curve cryptography.
Key and signature-size
As with elliptic-curve cryptography in general, the bit size of the private key believed to be needed for ECDSA is about twice the size of the security level, in bits. For example, at a security level of 80 bits—meaning an attacker requires a maximum of about operations to find the private key—the size of an ECDSA private key would be 160 bits. On the other hand, the signature size is the same for both DSA and ECDSA: approximately bits, where is the exponent in the formula , that is, about 320 bits for a security level of 80 bits, which is equivalent to operations.
Signature generation algorithm
Suppose Alice wants to send a signed message to Bob. Initially, they must agree on the curve parameters . In addition to the field and equation of the curve, we need , a base point of prime order on the curve; is the multiplicative order of the point .
The order of the base point must be prime. Indeed, we assume that every nonzero element of the ring is invertible, so that must be a field. It implies that must be prime (cf. Bézout's identity).
Alice creates a key pair, consisting of a private key integer , randomly selected in the interval ; and a public key curve point . We use to denote elliptic curve point multiplication by a scalar.
For Alice to sign a message , she follows these steps:
Calculate . (Here HASH is a cryptographic hash function, such as SHA-2, with the output converted to an integer.)
Let be the leftmost bits of , where is the bit length of the group order . (Note that can be greater than but not longer.)
Select a cryptographically secure random integer from .
Calculate the curve point .
Calculate . If , go back to step 3.
Calculate . If , go back to step 3.
The signature is the pair . (And is also a valid signature.)
As the standard notes, it is not only required for to be secret, but it is also crucial to select different for different signatures. Otherwise, the equation in step 6 can be solved for , the private key: given two signatures and , employing the same unknown for different known messages and , an attacker can calculate and , and since (all operations in this paragraph are done modulo ) the attacker can find . Since , the attacker can now calculate the private key .
This implementation failure was used, for example, to extract the signing key used for the PlayStation 3 gaming-console.
Another way ECDSA signature may leak private keys is when is generated by a faulty random number generator. Such a failure in random number generation caused users of Android Bitcoin Wallet to lose their funds in August 2013.
To ensure that is unique for each message, one may bypass random number generation completely and generate deterministic signatures by deriving from both the message and the private |
https://en.wikipedia.org/wiki/Schnorr%20signature | In cryptography, a Schnorr signature is a digital signature produced by the Schnorr signature algorithm that was described by Claus Schnorr. It is a digital signature scheme known for its simplicity, among the first whose security is based on the intractability of certain discrete logarithm problems. It is efficient and generates short signatures. It was covered by which expired in February 2008.
Algorithm
Choosing parameters
All users of the signature scheme agree on a group, , of prime order, , with generator, , in which the discrete log problem is assumed to be hard. Typically a Schnorr group is used.
All users agree on a cryptographic hash function .
Notation
In the following,
Exponentiation stands for repeated application of the group operation
Juxtaposition stands for multiplication on the set of congruence classes or application of the group operation (as applicable)
Subtraction stands for subtraction on the set of congruence classes
, the set of finite bit strings
, the set of congruence classes modulo
, the multiplicative group of integers modulo (for prime , )
.
Key generation
Choose a private signing key, , from the allowed set.
The public verification key is .
Signing
To sign a message, :
Choose a random from the allowed set.
Let .
Let , where denotes concatenation and is represented as a bit string.
Let .
The signature is the pair, .
Note that ; if , then the signature representation can fit into 40 bytes.
Verifying
Let
Let
If then the signature is verified.
Proof of correctness
It is relatively easy to see that if the signed message equals the verified message:
, and hence .
Public elements: , , , , , , . Private elements: , .
This shows only that a correctly signed message will verify correctly; many other properties are required for a secure signature algorithm.
Key leakage from nonce reuse
Just as with the closely related signature algorithms DSA, ECDSA, and ElGamal, reusing the secret nonce value on two Schnorr signatures of different messages will allow observers to recover the private key. In the case of Schnorr signatures, this simply requires subtracting values:
.
If but then can be simply isolated. In fact, even slight biases in the value or partial leakage of can reveal the private key, after collecting sufficiently many signatures and solving the hidden number problem.
Security argument
The signature scheme was constructed by applying the Fiat–Shamir transformation to Schnorr's identification protocol. Therefore, (as per Fiat and Shamir's arguments), it is secure if is modeled as a random oracle.
Its security can also be argued in the generic group model, under the assumption that is "random-prefix preimage resistant" and "random-prefix second-preimage resistant". In particular, does not need to be collision resistant.
In 2012, Seurin provided an exact proof of the Schnorr signature scheme. In particular, Seurin shows that the security proof using the forking lemma is the best po |
https://en.wikipedia.org/wiki/Pizza%20box%20form%20factor | In computing, a pizza box is a style of case design for desktop computers or network switches. Pizza box cases tend to be wide and flat, normally in height, resembling pizza delivery boxes and thus the name. This is in contrast to a tower system, whose case height is much greater than the width and has an "upright" appearance. In modern usage, the term "pizza box" is normally reserved for very flat cases with height no more than , while those taller than 2 inches are referred to as desktop cases instead.
The common setup of a pizza box system is to have the display monitor placed directly on top of the case, which serves as a podium to elevate the monitor more towards the user's eye level, and to have other peripherals placed in front and alongside the case. Occasionally, the pizza box may be laid on its sides in a tower-like orientation.
Data General's Aviion Unix server was the first to coin the expression when it advertised in 1991 with the tagline "Who just fit mainframe power in a pizza box?", but most computers generally referred to as pizza box systems were high-end desktop systems such as Sun Microsystems workstations sold in the 1990s, most notably the SPARCstation 1 and SPARCstation 5. Other notable examples have been among the highest-performing desktop computers of their generations, including the SGI Indy, the NeXTstation, and the Amiga 1000, but the form factor was also seen in budget and lower-end lines such as the Macintosh LC family.
The original SPARCstation 1 design included an expansion bus technology, SBus, expressly designed for the form factor; expansion cards were small, especially in comparison to other expansion cards in use at the time such as VMEbus, and were mounted horizontally instead of vertically. PC-compatible computers in this type of case typically use the PCI expansion bus and are usually either a) limited to one or two horizontally placed expansion cards or b) require special low-profile expansion cards, shorter than the PCI cards regular PCs use.
The density of computing power and stackability of pizza box systems also made them attractive for use in data centers. Systems originally designed for desktop use were placed on shelves inside of 19-inch racks, sometimes requiring that part of their cases be cut off for them to fit. Since the late 1990s, pizza boxes have been a common form factor in office cubicles, data centers or industrial applications, where desktop space, rack room and density are critical. Servers in this form factor, as well as higher-end Ethernet switches, are now designed for rack mounting. Rack mount 1U computers come in all types of configurations and depths.
The pizza box form factor for smaller personal systems and thin clients remains in use well into the 21st century, though it is increasingly being superseded by laptops, nettops or All-in-One PC designs that embed the already size-reduced computer onto the keyboard or display monitor.
References
External links
Pizza box in |
https://en.wikipedia.org/wiki/Inca%2C%20Spain | Inca () is a town on the Spanish island of Mallorca. The population of the municipality is 32,137 (2018) in an area of 58.4 km².
There is a junction station Mallorca rail network with trains to Palma, the island's capital, to Sa Pobla, and to Manacor.
Inca is home of the footwear company "Camper".
Inca is known for its wine cellars. The town, like its neighboring municipality Binissalem, was a mass producer of wine from the 17th to 19th centuries when phylloxera destroyed the industry and its inhabitants turned to other activities such as tanning and leather craftsmanship. Many old wine cellars are being used as restaurants for serving traditional Mallorcan dishes like sopes mallorquines, tombet and gató d'ametlles.
Sister cities
Inca has two sister cities
Lompoc, California, United States of America
Telpaneca, Nicaragua
References
External links
Inca, Mallorca, tourist information and guide
Jewish quarter
Inca Hospital Center
Rail Station
Sport Center Inca
Can Monroig |
https://en.wikipedia.org/wiki/WTVD | WTVD (channel 11) is a television station licensed to Durham, North Carolina, United States, serving as the ABC outlet for the Research Triangle area. Owned and operated by the network's ABC Owned Television Stations division, it maintains primary studios on Liberty Street in downtown Durham, with additional studios and news bureaus in Raleigh, Chapel Hill and Fayetteville. The station's transmitter is located in Auburn, North Carolina. On-air branding uses ABC 11 as a station identifier, with the call letters taking a secondary role.
History
Early years
In 1952, two rival companies each applied for a construction permit to build a television station in Durham on the city's newly allotted VHF channel 11—Herald-Sun Newspapers (publishers of the Durham Morning Herald and the Durham Sun as well as the owners of radio station WDNC) and Floyd Fletcher and Harmon Duncan, the then-owners of WTIK radio. In December 1953, the two sides agreed to join forces and operate the station under the joint banner Durham Broadcasting Enterprises. Originally christened with the "WTIK-TV" call letters, the station had to make a name change after the partners sold WTIK radio as a condition of the permit grant. Ownership chose WTVD and was granted the change, but they had to wait—the call sign had been used in the 1953 20th Century Fox film Taxi for a fictional television station appearing in the movie. At the time, the Federal Communications Commission (FCC) allowed unassigned call letters to be used in fictional works for an exclusive two-year period, making them unavailable for actual broadcast use.
Ten months after being granted its permit, on September 2, 1954, WTVD began broadcasting with a black-and-white film of "The Star-Spangled Banner", followed by You Bet Your Life. It was originally a primary NBC affiliate, with secondary ABC and CBS affiliations. Channel 11 is the Triangle's oldest surviving television station, having signed on a few months after CBS affiliate WNAO-TV (channel 28). The station's initial studios were located in a former tuberculosis sanitorium at Broad Street in Durham, with a transmitter located atop Signal Hill in northern Durham County.
WRAL-TV (channel 5), based in Raleigh and locally owned by the Capitol Broadcasting Company, debuted in December 1956 and took over as the Triangle's NBC affiliate, leaving channel 11 with only ABC. WNAO-TV ceased operations at the end of 1957 due to financial difficulties, and CBS moved its primary affiliation to WTVD. During the late 1950s, the station was also briefly affiliated with the NTA Film Network.
On May 22, 1957, the station's original owners sold their interest in WTVD to Albany, New York-based Hudson Valley Broadcasting Company, owners of WCDA-TV (now WTEN), to form Capital Cities Television Corporation (predecessor of Capital Cities Communications). Around 1958, WTVD built a tower at its present transmitter site in Auburn to increase its signal coverage for the entire Raleigh–Durham–F |
https://en.wikipedia.org/wiki/Radio%20Netherlands%20Worldwide | Radio Netherlands (RNW; ) was a public radio and television network based in Hilversum, producing and transmitting programmes for international audiences outside the Netherlands from 1947 to 2012.
Its services in Dutch ended on 10 May 2012. English and Indonesian language services ceased on 29 June 2012 due to steep budget cuts imposed by the Dutch government and a concomitant change in focus. The last programme broadcast on shortwave was a daily half-hour show in Spanish for Cuba named El Toque (The Touch) on 1 August 2014. It was replaced by RNW Media, a Dutch governmental organisation for free speech and social change around the world.
History
Early days (Philips Radio)
Following a series of experiments on various wavelengths in 1925, reports of good reception from a low-power shortwave transmitter were received from Jakarta on 11 March 1927. Dutch Queen Wilhelmina made what is believed to be the world's first royal broadcast on 1 June 1927, addressing compatriots in the East and West Indies.
Regular international broadcast transmissions started shortly afterwards from the Philips shortwave transmitter in Eindhoven. They used the call sign PHOHI for broadcasts in the Dutch language to the Dutch East Indies (now Indonesia), and PCJJ for broadcasts in English and other languages to the rest of the world.
The Philips company in Eindhoven saw a market for its radios in the Dutch colonies. Its research laboratories received support from companies that were trading goods between The Netherlands and Batavia (now Indonesia). The PHOHI was officially founded on 18 June 1927. In 1928, test transmissions commenced from a site in Huizen, North Holland. It was chosen because of the high water table on the land near the Zuiderzee lake (now Gooimeer). This meant there was a good conductivity for an efficient earth, which led to stronger signals in the target areas.
Around 1929, the Philips call sign was simplified to PCJ.
There were several prewar technical innovations:
The Research Laboratories continued with the development of new transmitters that could operate at shorter wavelengths and could be re-tuned for broadcasts to different parts of the world. By the end of 1936, the power had been raised by connecting a stage with two water-cooled type TA 20/250 valves. This provided a power output of 60 kW at a frequency of 15220 kHz and immediately became the strongest short-wave transmitter in Europe. In 1937, this transmitter was moved from Eindhoven to the PHOHI Transmitter Park in Huizen.
Broadcasts were considerably improved in 1937 with the construction of beam antennas supported by the world's first wooden antenna masts rotatable on two concentric circular rails at the transmitter site in Huizen. In November 2006, a 1/5th size model of this antenna was officially inaugurated on a roundabout a few hundred metres from the original site.
Rotatable curtain array antennas were not in common use until the 1960s, so PCJ was far ahead of its time wi |
https://en.wikipedia.org/wiki/WUVC-DT | WUVC-DT (channel 40) is a television station licensed to Fayetteville, North Carolina, United States, broadcasting the Spanish-language Univision network to the Research Triangle region. It is owned and operated by TelevisaUnivision alongside Raleigh-licensed low-power UniMás station WTNC-LD (channel 26). Both stations share studios on Falls of Neuse Road in Raleigh, while WUVC-DT's transmitter is located northeast of Broadway, North Carolina.
WUVC-TV is also carried on Charter Spectrum's cable systems in the Charlotte and Greensboro–Winston-Salem–High Point markets.
History
WKFT
On February 26, 1980, the Federal Communications Commission (FCC) granted a construction permit to Fayetteville Television, Inc., for a new commercial television station on channel 40 in Fayetteville. The station began broadcasting as independent station WKFT on June 1, 1981; studios were located in the old First Union Bank on Donaldson Street in downtown Fayetteville and transmitted its signal from a tower in unincorporated Cumberland County on Cliffdale Road, with 1.54 million watts of power (the tower site has since been annexed into Fayetteville). Fayetteville Television was organized by Robert Warren, a former Fayetteville reporter for WRAL-TV in Raleigh, who served as WKFT's first general manager, but was never an investor and was let go after only a month. WKFT offered a general entertainment format consisting of cartoons, westerns, religious shows, dramas and classic sitcoms. The station put a fairly decent signal into the southern portion of the Triangle, but was harder to receive in the more densely populated areas of the market.
In 1985, the original owners sold WKFT to SJL Broadcasting, which formed Central Carolina Television to manage the station. The new owners subsequently invested about $5 million to build a new tower in Broadway, near the Harnett–Lee county line. The new transmitter, activated in June 1986, operated with a full five million watts of power. It gave channel 40 a coverage area comparable to the established Triangle stations, got the station on cable systems in the Raleigh–Durham area, and provided grade B coverage as far west as Greensboro. The station also rebranded itself as "Counterforce 40" and significantly upgraded its programming, competing with WLFL, the Triangle's largest independent, which joined the upstart Fox network. However, it operated on a low budget, selling advertising mainly in the southern part of the market.
By 1989, WKFT was in dire financial straits, reportedly from debts owed to film studios for movies shown on the station. It had also failed in a bid to take the NBC affiliation from WPTF-TV (now WRDC). In November, the sale of channel 40 was announced to the Zenox Corporation for $5 million.
WRAL on WKFT
On December 10, 1989, an ice storm collapsed the towers of WRAL-TV and WPTF-TV near Auburn. Within hours, WKFT had reached a deal to simulcast WRAL-TV's programming for almost all of its broadcast day as a |
https://en.wikipedia.org/wiki/Avida | Avida is an artificial life software platform to study the evolutionary biology of self-replicating and evolving computer programs (digital organisms). Avida is under active development by Charles Ofria's Digital Evolution Lab at Michigan State University; the first version of Avida was designed in 1993 by Ofria, Chris Adami and C. Titus Brown at Caltech, and has been fully reengineered by Ofria on multiple occasions since then. The software was originally inspired by the Tierra system.
Design principles
Tierra simulated an evolutionary system by introducing computer programs that competed for computer resources, specifically processor (CPU) time and access to main memory. In this respect it was similar to Core Wars, but differed in that the programs being run in the simulation were able to modify themselves, and thereby evolve. Tierra's programs were artificial life organisms.
Unlike Tierra, Avida assigns every digital organism its own protected region of memory, and executes it with a separate virtual CPU. By default, other digital organisms cannot access this memory space, neither for reading nor for writing, and cannot execute code that is not in their own memory space.
A second major difference is that the virtual CPUs of different organisms can run at different speeds, such that one organism executes, for example, twice as many instructions in the same time interval as another organism. The speed at which a virtual CPU runs is determined by a number of factors, but most importantly, by the tasks that the organism performs: logical computations that the organisms can carry out to reap extra CPU speed as bonus.
Use in research
Adami and Ofria, in collaboration with others, have used Avida to conduct research in digital evolution, and the scientific journals Nature and Science have published four of their papers.
The 2003 paper "The Evolutionary Origin of Complex Features" describes the evolution of a mathematical equals operation from simpler bitwise operations.
Use in education
The Avida-ED project (Avida-ED) uses the Avida software platform within a simplified graphical user interface suitable for use in evolution education instruction at the high school and undergraduate college level, and provides freely available software, documentation, tutorials, lesson plans, and other course materials. The Avida-ED software runs as a web application in the browser, with the user interface implemented in JavaScript and Avida compiled to JavaScript using Emscripten, making the software broadly compatible with devices commonly used in classrooms. This approach has been shown to be effective in improving students' understanding of evolution.
The Avida-ED project was the winner of the 2017 International Society for Artificial Life Education and Outreach Award.
See also
References
"Testing Darwin", Discover Magazine, February 2005.
External links
Avida Software - GitHub
Avida-ED Project - Robert T. Pennock
An Avida Developer's Site
MSU Devo |
https://en.wikipedia.org/wiki/Passive%20attack | A passive attack on a cryptosystem is one in which the cryptanalyst cannot interact with any of the parties involved, attempting to break the system solely based upon observed data (i.e. the ciphertext). This can also include known plaintext attacks where both the plaintext and its corresponding ciphertext are known.
While active attackers can interact with the parties by sending data, a passive attacker is limited to intercepting communications (eavesdropping), and seeks to decrypt data by interpreting the transcripts of authentication sessions. Since passive attackers do not introduce data of their own, they can be difficult to detect.
While most classical ciphers are vulnerable to this form of attack, most modern ciphers are designed to prevent this type of attack above all others.
Attributes
Traffic analysis
Non-evasive eavesdropping and monitoring of transmissions
Because data unaffected, tricky to detect
Emphasis on prevention (encryption) not detection
Sometimes referred to as "tapping"
The main types of passive attacks are traffic analysis and release of message contents.
During a traffic analysis attack, the eavesdropper analyzes the traffic, determines the location, identifies communicating hosts and observes the frequency and length of exchanged messages. He uses all this information to predict the nature of communication. All incoming and outgoing traffic of the network is analyzed, but not altered.
For a release of message content, a telephonic conversation, an E-mail message or a transferred file may contain confidential data. A passive attack monitors the contents of the transmitted data.
Passive attacks are very difficult to detect because they do not involve any alteration of the data. When the messages are exchanged neither the sender nor the receiver is aware that a third party may capture the messages. This can be prevented by encryption of data.
See also
Known plaintext attack
Chosen plaintext attack
Chosen ciphertext attack
Adaptive chosen ciphertext attack
Topics in cryptography
References
Further reading
Cryptography and Network Security By William Stallings
Cryptographic attacks |
https://en.wikipedia.org/wiki/Paul%20Miller%20%28North%20Carolina%20politician%29 | Paul Miller is a former Democratic member of the North Carolina General Assembly representing the state's twenty-ninth House district, including constituents in Durham county. A computer consultant and investment advisor from Durham, North Carolina, Miller served almost three terms in the state House.
Miller borrowed $13,750 in federally insured student loans in 1980 when he was a student at the Massachusetts Institute of Technology. By March 2004, Miller had paid back just $1,700, according to the complaint, and his loan balance had increased to $23,378 with penalties and interest. In December 2004, Miller learned that the government would begin garnishing his wages, so he offered to make monthly payments of $200 to the U.S. Department of Education, the complaint said. Four months later, Miller sent several letters to the garnishment branch of the Department of Education claiming that he had paid the debt in full in 1992 and enclosing copies of five canceled checks from 1992 totaling $20,500. The Department of Education researched the checks and found that instead of being written for $4,100 each as Miller claimed, they had been written for $100 each. Further, the government found that Miller only owed $14,361 in June 1992, not the more than $20,000 he said he had paid.
He resigned amid allegations that he had committed mail fraud when he tried to convince the U.S. Department of Education that he had paid off more than $20,000 in student loans. Miller was arrested June 8, 2006 on charges that he sent copies of doctored checks to the U.S. Department of Education to make it appear that he had paid off more than $20,000 in student loan debt to avoid garnishment of his pay. The U.S. attorney filed a warrant for Miller's arrest in U.S. District Court, charging him with making a false, fictitious or fraudulent statement and using the U.S. Postal Service to execute a scheme to defraud.
When confronted in Atlanta with the copies of the checks archived by the Department of Education, Miller did not admit guilt but agreed to participate in an investigation, the complaint said.
In December 2006, Miller was sentenced to a year's probation and fined $1,000 by a federal judge. After pleading guilty in September 2006 to falsely claiming he paid more than $20,000, a second charge—that he altered checks to support his claim—was dismissed in an agreement with prosecutors.
References
External links
|-
Year of birth missing (living people)
Living people
Democratic Party members of the North Carolina House of Representatives
Massachusetts Institute of Technology alumni
American politicians convicted of fraud
North Carolina politicians convicted of crimes
21st-century American politicians |
https://en.wikipedia.org/wiki/Linda%20P.%20Johnson | Linda Kay Pennell Johnson (May 2, 1945 – February 18, 2020) was a Republican member of the North Carolina House of Representatives, representing the state's 82nd district. She was a computer analyst from Kannapolis, North Carolina.
Johnson graduated from A.L. Brown High School, in Kannapolis, North Carolina, in 1963. She served on the Kannaspolis City Board of Education from 1992 to 2000. She was first elected in 2000, defeating Len Sossamon, who was appointed to finish Richard Lee Moore's term. While battling cancer, she suffered multiple strokes and died in February 2020, while still in office.
Electoral history
2018
2016
2014
2012
2010
2008
2006
2004
2002
2000
References
External links
North Carolina General Assembly page
1945 births
2020 deaths
School board members in North Carolina
Republican Party members of the North Carolina House of Representatives
Women state legislators in North Carolina
People from Kannapolis, North Carolina
21st-century American politicians
21st-century American women politicians |
https://en.wikipedia.org/wiki/ShareReactor | ShareReactor was an index site for files on the eDonkey network and Torrent files. ShareReactor did not host any files; instead, the links it contained were accessible through an eDonkey network and BitTorrent client. The site was taken down by Swiss Police on March 10, 2004, due to the suspicion of breach of copyright and trademark laws. After a long downtime of nearly two years and six months, the site returned online under new ownership. However nearly two months after its return it once again closed down due to lack of popularity. In December 2008 the site was reopened once more brought back to life with help from the Pirate Bay team. Its notability is still known today as a search on any p2p network will show many thousands of files tagged with Sharereactor in their name.
ShareReactor delivers links that can be used together with a P2P client program that understands eD2k links or torrent files.
Origin
The site was founded on August 5, 2001, by someone using the pseudonym 'Gowenna'. The site was initially located at Gowenna.da.ru, which was only a shadow domain. The site was renamed ShareReactor in November 2001 and used an official domain due to its great popularity. In January 2002, it was announced that Gowenna had died in a car accident due to icy road conditions. The site administration was continued by Christian Riesen (aka Simon Moon) who programmed the system and was responsible for technical work on the site and hosting. The site's popularity persisted, eventually even growing further. ShareReactor remained the top eD2k indexing website up until March 2004 when it suddenly was closed due to suspicion of breach of copyright and trademark laws within the country of Switzerland where ShareReactor's owner lived and where ShareReactor was being hosted.
Takedown
ShareReactor was taken down by the local police in the Canton of Thurgau, Switzerland on March 10, 2004, due to the suspicion of breach of copyright and trademark laws. The investigation was reportedly initiated by complaints from the Swiss Anti-Piracy-Federation (SAFE) at the request of several large corporations, one of them presumably being Columbia Tri-Star Inc.
Reopening and Closure
ShareReactor came back online after nearly two years and six months of being offline. Before ShareReactor's full return in September 2006, ShareReactor made a partial return, which was in June 2004 when their forum was put back online. However the difference was all the sections of the forum that featured eD2k links were closed due to the request they received a few months before. The return of ShareReactor's forum was until around November 2004 when the place that was hosting the forum had a major power surge and the servers were destroyed. On the last known occasion of ShareReactor's forum being online, there were around 1,100,000 posts.
When ShareReactor made a full return was on September 4, 2006. Prior to their reopening, a mass e-mail was sent to all the users of ShareReactor and u |
https://en.wikipedia.org/wiki/CITY-DT | CITY-DT (channel 57) is a television station in Toronto, Ontario, Canada, serving as the flagship station of the Citytv network. It is owned and operated by network parent Rogers Sports & Media alongside Omni Television outlets CFMT-DT (channel 47) and CJMT-DT (channel 40). The stations share studios at 33 Dundas Street East on Yonge–Dundas Square in downtown Toronto, while CITY-DT's transmitter is located atop the CN Tower.
The station went on the air on September 28, 1972, by a consortium led by Phyllis Switzer, Moses Znaimer, Jerry Grafstein and Edgar Cowan, as CITY-TV, branded on-air as Citytv on Queen Street. In 1981, the station was sold to CHUM Limited, who retained Znaimer as an executive and moved to its 299 Queen Street West studios in 1987. For the majority of its early life, CITY-TV operated as an independent station, best known for its unconventional approaches to news and other locally produced programming. After having used syndication to bring its original programming to other Canadian markets, CHUM later used CITY-TV as the basis and flagship station of a television system, acquiring and establishing new stations under the Citytv name.
In 2006, CTVglobemedia announced its intent to acquire CHUM Limited, but was required to divest stations due to conflicts with CTV stations it already owned in Citytv's markets. CTV chose to keep the stations of CHUM's secondary A-Channel system, as well as CITY-TV's sister news channel CP24 and its other cable channels MuchMusic, but divested CITY-TV and its sister stations to Rogers Media. Under Rogers ownership, CITY-TV's programming became more conventional in nature.
History
The station first signed on the air on September 28, 1972, broadcasting on UHF channel 79, an allocation given to the station as all of the VHF licences in the Toronto area were taken by other parties. It operated as an independent station, and its transmitter operated at an effective radiated power of 31kW. The founding ownership group Channel Seventy-Nine Ltd. consisted of – among others – Phyllis Switzer, Moses Znaimer, Jerry Grafstein and Edgar Cowan. The four principal owners raised over $2 million to help start up the station, with Grafstein raising about 50% of the required funds, Znaimer raising around 25%, and the remainder being accrued by Switzer and Cowan. The channel 79 licence was granted to the company on November 25, 1971. The station operated from studio facilities located at 99 Queen Street East, near Church Street, at the former Electric Circus nightclub.
The station lost money early on, and was in debt by 1975. Multiple Access Ltd. (the owners of CFCF-TV in Montreal) purchased a 45% interest in the station, and sold its stake to CHUM Limited three years later. CITY was purchased outright by CHUM in 1981 with the sale of Moses Znaimer's interest in the station. Znaimer remained with the station as an executive until 2003, when he retired from his management role but continued to work with the statio |
https://en.wikipedia.org/wiki/China%20Unicom | China United Network Communications Group Co., Ltd. () or China Unicom () (CUniq in short) is a Chinese state-owned telecommunications operator. Started as a wireless paging and GSM mobile operator, it currently provides a range of services including mobile network, long-distance, local calling, data communication, Internet services, and IP telephony. China Unicom is the third-largest wireless carrier in China and the sixth largest mobile provider in the world as of 2022.
History
China Unicom (known as Pinyin: Zhōngguó liánhé tōngxìn yǒuxiàn gōngsī at that time) was founded as a state-owned enterprise in 1994 by the Ministry of Railways, the Ministry of Electronics and the Ministry of Electric Power Industry ; the establishment was approved by the State Council in December 1993.
China Unicom has operated a CDMA network in Macau since October18, 2006 and internet services in North Korea since 2010. , the company had 125 million GSM subscribers and 43 million CDMA subscribers. As of November 2008 the CDMA operations have been moved to China Telecommunications Corporation (China Telecom Group). On 7 January 2009, China Unicom was awarded WCDMA license to expand its business to 3G telecommunication. UMTS (Universal Mobile Telecommunications System) was launched in major cities across China on May 17, 2009.
On July 11, 2020, China Unicom joined hands with LuHan to launch the "FuLu Companion Card", which sounded the forward number for the further development of 5G. LuHan also officially unlocked his new identity and became a "China Unicom Innovation Partner", with the "FuLu companion card" to bring exclusive benefits and surprises to the majority of Unicom users.
IPOs
In February 2000 a subsidiary "China Unicom Hong Kong" was incorporated in Hong Kong and was listed on the Hong Kong Stock Exchange on June 22, 2000.
The intermediate parent company "China Unicom (Hong Kong) Limited" was "China Unicom (BVI) Limited", , the BVI company owned 77.47% shares of China Unicom (H.K.). In turn, China Unicom (H.K.) owned the operating subsidiaries of the group. In 2002, another intermediate parent company "China United Network Communications Limited" was established in Shanghai (headquartered in Beijing), to own 51% stake of "China Unicom (BVI) Limited" as well as listing the shares in the Shanghai Stock Exchange. , state-owned China Unicom Group owned 74.6% shares of the A share company, in turn the A share company owned 73.84% of the BVI company. The BVI company owned 77.47% shares of the red chip company. To sum up, the Chinese Government via A share company, owned 42.67% stake of the operating subsidiaries, as well as additional 20.27% stake by the minority stake in the BVI company.
Merger with China Netcom
On June 2, 2008, China Unicom announced its intention to sell its CDMA business and assets to China Telecommunications Corporation (China Telecom Group) for a combined total of 110 billion RMB and to merge the remainder of the company, in a share |
https://en.wikipedia.org/wiki/Stacking%20window%20manager | A stacking window manager (also called floating window manager) is a window manager that draws and allows windows to overlap, without using a compositing algorithm. All window managers that allow the overlapping of windows but are not compositing window managers are considered stacking window managers, although it is possible that not all use exactly the same methods. Other window managers that are not considered stacking window managers are those that do not allow the overlapping of windows, which are called tiling window managers.
Stacking window managers allow windows to overlap using clipping to allow applications to write only to the visible parts of the windows they present.
The order in which windows are to be stacked is called their z-order.
Hybrid window managers
Some window managers may be able to treat the foreground window in an entirely different way, by rendering it indirectly, and sending its output to the video card to be added to the outgoing raster. While this technique may be possible to accomplish within some stacking window managers, it is technically compositing, with the foreground window and the screen raster being treated the same way two windows would be in a compositing window manager.
Unfortunately interacting with objects outside the original area of the foreground window might also be impossible, since the window manager would not be able to determine what the user is seeing, and would pass such mouse clicks to whatever programs occupied those areas of the screen during the last stacking event.
X Window System
Many windows managers under the X Window System provide stacking window functionality:
4Dwm
9wm
AfterStep
amiwm
awesome
Blackbox
ctwm
cwm
dwm
qpwm
Enlightenment
Fluxbox
FLWM
FVWM
FVWM95
Goomwwm
Hackedbox
IceWM
JWM
KWin (with compositing turned off)
MWM
Mutter
olwm
Openbox
PekWM
PLWM
Sawfish
swm
tvtwm
twm
Window Maker
WindowLab
wm2
wmx
Microsoft Windows
Microsoft Windows 1.0 displayed windows using a tiling window manager. In Windows 2.0, it was replaced with a stacking window manager, which allowed windows to overlap. Microsoft kept the stacking window manager up through Windows XP, which presented severe limitations to its ability to display 3D-accelerated content inside normal windows. Although it was technically possible to produce some visual effects using third-party software. From Windows Vista onward, a new compositing window manager is the default on compatible systems.
History
1970s: The Xerox Alto which contained the first working commercial GUI used a stacking window manager.
Early 1980s: The Xerox Star, successor to the Alto, used tiling for most main application windows, and used overlapping only for dialogue windows removing the need for full stacking.
The Classic Mac OS was one of the earliest commercially successful examples of a GUI which used stacking windows.
GEM predated Microsoft Windows and used stacking, allowing all windows to overlap.
|
https://en.wikipedia.org/wiki/Network-attached%20storage | Network-attached storage (NAS) is a file-level (as opposed to block-level storage) computer data storage server connected to a computer network providing data access to a heterogeneous group of clients. The term "NAS" can refer to both the technology and systems involved, or a specialized device built for such functionality (as unlike tangentially related technologies such as local area networks, a NAS device is often a singular unit).
Overview
A NAS device is optimised for serving files either by its hardware, software, or configuration. It is often manufactured as a computer appliance a purpose-built specialized computer. NAS systems are networked appliances that contain one or more storage drives, often arranged into logical, redundant storage containers or RAID. Network-attached storage typically provide access to files using network file sharing protocols such as NFS, SMB, or AFP. From the mid-1990s, NAS devices began gaining popularity as a convenient method of sharing files among multiple computers, as well as to remove the responsibility of file serving from other servers on the network; by doing so, a NAS can provide faster data access, easier administration, and simpler configuration as opposed to using general-purpose server to serve files.
Accompanying a NAS are purpose-built hard disk drives, which are functionally similar to non-NAS drives but may have different firmware, vibration tolerance, or power dissipation to make them more suitable for use in RAID arrays, a technology often used in NAS implementations. For example, some NAS versions of drives support a command extension to allow extended error recovery to be disabled. In a non-RAID application, it may be important for a disk drive to go to great lengths to successfully read a problematic storage block, even if it takes several seconds. In an appropriately configured RAID array, a single bad block on a single drive can be recovered completely via the redundancy encoded across the RAID set. If a drive spends several seconds executing extensive retries it might cause the RAID controller to flag the drive as "down" whereas if it simply replied promptly that the block of data had a checksum error, the RAID controller would use the redundant data on the other drives to correct the error and continue without any problem. Such a "NAS" SATA hard disk drive can be used as an internal PC hard drive, without any problems or adjustments needed, as it simply supports additional options and may possibly be built to a higher quality standard (particularly if accompanied by a higher quoted MTBF figure and higher price) than a regular consumer drive.
Description
A NAS unit is a computer connected to a network that provides only file-based data storage services to other devices on the network. Although it may technically be possible to run other software on a NAS unit, it is usually not designed to be a general-purpose server. For example, NAS units usually do not have a keyboard or displa |
https://en.wikipedia.org/wiki/Data%20definition%20language | In the context of SQL, data definition or data description language (DDL) is a syntax for creating and modifying database objects such as tables, indices, and users. DDL statements are similar to a computer programming language for defining data structures, especially database schemas. Common examples of DDL statements include CREATE, ALTER, and DROP.
History
The concept of the data definition language and its name was first introduced in relation to the Codasyl database model, where the schema of the database was written in a language syntax describing the records, fields, and sets of the user data model. Later it was used to refer to a subset of Structured Query Language (SQL) for declaring tables, columns, data types and constraints. SQL-92 introduced a schema manipulation language and schema information tables to query schemas. These information tables were specified as SQL/Schemata in SQL:2003. The term DDL is also used in a generic sense to refer to any formal language for describing data or information structures.
Structured Query Language (SQL)
Many data description languages use a declarative syntax to define columns and data types. Structured Query Language (SQL), however, uses a collection of imperative verbs whose effect is to modify the schema of the database by adding, changing, or deleting definitions of tables or other elements. These statements can be freely mixed with other SQL statements, making the DDL not a separate language.
CREATE statement
The create command is used to establish a new database, table, index, or stored procedure.
The CREATE statement in SQL creates a component in a relational database management system (RDBMS). In the SQL 1992 specification, the types of components that can be created are schemas, tables, views, domains, character sets, collations, translations, and assertions. Many implementations extend the syntax to allow creation of additional elements, such as indexes and user profiles. Some systems, such as PostgreSQL and SQL Server, allow CREATE, and other DDL commands, inside a database transaction and thus they may be rolled back.
CREATE TABLE statement
A commonly used CREATE command is the CREATE TABLE command. The typical usage is:
CREATE TABLE [table name] ( [column definitions] ) [table parameters]
The column definitions are:
A comma-separated list consisting of any of the following
Column definition: [column name] [data type] {NULL | NOT NULL} {column options}
Primary key definition: PRIMARY KEY ( [comma separated column list] )
Constraints: {CONSTRAINT} [constraint definition]
RDBMS specific functionality
An example statement to create a table named employees with a few columns is:
CREATE TABLE employees (
id INTEGER PRIMARY KEY,
first_name VARCHAR(50) not null,
last_name VARCHAR(75) not null,
mid_name VARCHAR(50) not null,
dateofbirth DATE not null
);
Some forms of CREATE TABLE DDL may incorporate DML (data manipu |
https://en.wikipedia.org/wiki/Portland%20Pattern%20Repository | The Portland Pattern Repository (PPR) is a repository for computer programming software design patterns. It was accompanied by a companion website, WikiWikiWeb, which was the world's first wiki. The repository has an emphasis on Extreme Programming, and it is hosted by Cunningham & Cunningham (C2) of Portland, Oregon. The PPR's motto is "People, Projects & Patterns".
History
On 17 September 1987, programmer Ward Cunningham, tronnie binghamhen with Tektronix, and Apple Computer's Kent Beck co-published the paper "Using Pattern Languages for Object-Oriented Programs" This paper, about software design patterns, was inspired by Christopher Alexander's architectural concept of "patterns" It was written for the 1987 OOPSLA programming conference organized by the Association for Computing Machinery. Cunningham and Beck's idea became popular among programmers because it helped them exchange programming ideas in a format that is easy to understand.
Cunningham & Cunningham, the programming consultancy that would eventually host the PPR on its Internet domain, was incorporated in Salem, Oregon on 1 November 1991, and is named after Ward and his wife, Karen R. Cunningham, a mathematician, school teacher, and school director. Cunningham & Cunningham registered their Internet domain, c2.com, on 23 October 1994.
Ward created the Portland Pattern Repository on c2.com as a means to help object-oriented programmers publish their computer programming patterns by submitting them to him. Some of those programmers attended the OOPSLA and PLoP conferences about object-oriented programming, and posted their ideas on the PPR.
The PPR is accompanied, on c2.com, by the first ever wiki—a collection of reader-modifiable Web pages—which is called WikiWikiWeb.
References
External links
OOPSLA
Software design patterns
Computing websites |
https://en.wikipedia.org/wiki/DDL | DDL may refer to:
Technology
Data definition language or data description language, relating to databases
Description Definition Language, part of the MPEG-7 standard
Device Description Language, related to field devices for process and factory automation
Digital data logger, a type of data logger, an electronic device that records data over time or in relation to location
Direct download link, hyperlink for file downloads
Dolby Digital Live, real-time audio compression
Drop-down list, graphical user interface control element
An acronym for the Australian light destroyer project
People
Daniel Day-Lewis, actor
Businesses
Det Danske Luftfartselskab, Danish airline
Dutch Defence League, a Dutch offshoot of the English Defence League
Other
Data-driven learning, an approach to learning foreign languages
Den Danske Landinspektørforening, the Danish Association of Chartered Surveyors |
https://en.wikipedia.org/wiki/Nondeterminism | Nondeterminism or nondeterministic may refer to:
Computer science
Nondeterministic programming
Nondeterministic algorithm
Nondeterministic model of computation
Nondeterministic finite automaton
Nondeterministic Turing machine
Indeterminacy in computation (disambiguation)
Other
Indeterminism (philosophy)
See also
Indeterminacy (disambiguation) |
https://en.wikipedia.org/wiki/Digital%20Multiplex%20System | Digital Multiplex System (DMS) is the name shared among several different telephony product lines from Nortel Networks for wireline and wireless operators. Among them are the DMS-1 (originally named the DMS-256) Rural/Urban digital loop carrier, the DMS-10 telephone switch, the DMS SuperNode family of telephone switches (DMS-100, DMS-200, DMS-250, DMS-300, DMS-500, DMS-GSP, DMS-MSC, DMS-MTX), and the S/DMS optical transmission system.
Exploratory development on the technology began at Northern Telecom's Bell Northern Research Labs in Ottawa, Ontario in 1971. The first Class 5 switch, the DMS-10, began service on 21 October 1977 in Fort White, Florida and the first toll switch (Class 4), the DMS-200, entered service in 1979 in Ottawa. The DMS-10 was the first commercially successful Class 5 digital switch in the North American market and had a profound impact on the industry. Of the numerous digital switching products introduced in the North American telephone market in the late 1970s, only the Nortel DMS family is still in production. GENBAND (now Ribbon Communications) acquired Nortel CVAS assets including the DMS line in 2011 and rolled it into its IP-based GENiUS platform. The GENiUS-750nt is the first product to include adaptive nano-tech compression and resynchronization modules from Ericsson, to replace the digital cross-connect (DCS) in place since the earliest DMS releases.
Previously, new technology had entered the telecommunications industry slowly, with the telephone companies amortizing equipment over periods as long as forty years. AT&T was intending to delay the introduction of digital switching until the 1990s. The DMS, with its introduction of digital technology, changed the industry and became one of the antecedents that encouraged the growth of the Internet.
On October 16, 2006, Nortel received a special recognition award from Canada's Telecommunications Hall of Fame for its role in pioneering digital communications with the Digital Multiplex System.
The DMS name arose from a designation for a switching matrix design that was developed in the exploratory phase of the project. The Digital Multiplexed Switch was selected as the basic switching design for the project. The product was intended as a successor for Nortel's first electronic switch, the SP1, and was to be called the SP2. However the DMS acronym was mellifluous and was eventually (1975) adopted as the designation for the DMS-10 and DMS-100 family of products, with the "S" standing for "system" rather than "switch". It was then applied to the entire digital switching family as well as the DMS-1 family of Digital Transmission Concentrators.
DMS is favoured by many European cable operators as the switching platform for their voice networks. The DMS-10 is widely used by rural wireline providers. DMS-100 and 200 switches are widely deployed throughout the U.S. and Canada by Regional Bell Operating Companies, Bell Canada and independent telephone companies as well as the |
https://en.wikipedia.org/wiki/Walter%20Bright | Walter G. Bright is an American computer programmer who created the D programming language, the Zortech C++ compiler, and the Empire computer game.
Early life and education
Bright is the son of the United States Air Force pilot Charles D. Bright. He taught himself computer programming from the type-in programs in BASIC Computer Games.
Bright graduated from Caltech in 1979 with a Bachelor of Science in Mechanical Engineering and a minor in Aeronautical Engineering. While at university he wrote the Empire wargame for the PDP-10 mainframe, completing it in 1977.
Career
Bright wrote Mattel Intellivision games while at Caltech, then worked as a mechanical engineer after graduation. After learning C in the early 1980s he ported Empire to the IBM PC, stating that C "might as well have been called EIL, for 'Empire Implementation Language.'" Bright developed the Datalight C compiler, also sold as Zorland C and later Zortech C.
Bright was the main developer of the Zortech C++ compiler (later Symantec C++, now Digital Mars C++), which was the first C++ compiler to translate source code directly to object code without using C as an intermediate.
D programming language
Bright is the creator of the D programming language. He has implemented compilers for several other languages, and is considered an expert in many areas related to compiler technology. Walter regularly writes scientific and magazine articles about compilers and programming and was a blogger for Dr. Dobb's Journal.
Around 2014, Bright wrote Warp, a fast C/C++ preprocessor written in D, for Facebook.
References
External links
Walter Bright home page
Computerworld Interview with Walter Bright on D Programming Language
American computer programmers
Living people
Programming language designers
Year of birth missing (living people)
California Institute of Technology alumni |
https://en.wikipedia.org/wiki/De%20novo | In general usage, de novo (literally 'of new') is a Latin expression used in English to mean 'from the beginning', 'anew'.
De novo may also refer to:
Science and computers
De novo mutation, a new germline mutation not inherited from either parent
De novo protein design, the creation of a protein sequence that is not based on existing, natural sequences
De novo protein structure prediction, the prediction of a protein's 3D structure, based only on its sequence
De novo synthesis of complex molecules from simple molecules in chemistry
De novo transcriptome assembly, the method of creating a transcriptome without a reference genome, using de novo sequence assembly
De novo gene birth, the emergence of genes from non-coding sequence
De novo assembly in genomics
De Novo classification, a pathway to classify new medical devices provided by the US Federal Food, Drug, and Cosmetic Act
Denovo, a supercomputer project that simulates nuclear reactions; see
Other
De novo review, an appellate standard of review for legal issues
Trial de novo, or a new trial in the legal system
De novo bank, a state bank that has been in operation for five years or less
De Novo, a public housing estate in Kai Tak, Hong Kong
Denovo (band), a 1980s Italian new wave group
Latin words and phrases |
https://en.wikipedia.org/wiki/Samurai%20Jack | Samurai Jack is an American animated action-adventure dystopian television series created by Genndy Tartakovsky for Cartoon Network and Adult Swim. The show is produced by Cartoon Network Studios. Tartakovsky conceived Samurai Jack after finishing his work on his first Cartoon Network original series, Dexter's Laboratory, which premiered in 1996. Samurai Jack took inspiration from Kung Fu, the 1972 televised drama starring David Carradine, Tartakovsky's fascination with samurai culture and the Frank Miller comic series Ronin.
The titular character is an unnamed Japanese samurai prince who wields a mystic katana capable of cutting through virtually anything. He sets out to free his kingdom after it is taken over by an evil, shapeshifting demon lord known as Aku. The two engage in a fierce battle, but just as the prince is about to deal the final strike, Aku sends him forward in time to a dystopian future ruled by the tyrannical demon. Adopting the name "Jack" after being addressed as such by beings in this time period, he quests to travel back to his own time and defeat Aku before he can take over the world. Jack's search for a way back to his own time period transcends Aku's control, but Jack's efforts are largely in vain due to the way back to his home ending up just out of his reach.
Samurai Jack, originally airing for four seasons comprising thirteen episodes each, was broadcast from August 10, 2001, to September 25, 2004, without concluding the overarching story. The show was revived twelve years later for a darker, more mature fifth season that provides a conclusion to Jack's story, with Williams Street assisting in production; it premiered on Cartoon Network's Adult Swim as part of its Toonami programming block on March 11, 2017, and concluded with its final episode (the series finale) on May 20, 2017. Episodes were directed by Tartakovsky, often in collaboration with others.
The series has garnered critical acclaim and won eight Primetime Emmy Awards, including Outstanding Animated Program, as well as six Annie Awards and an OIAF Award. It is widely considered as one of the greatest animated shows of all time.
Premise
Samurai Jack tells the story of an unnamed young prince (voiced by Phil LaMarr) from a kingdom set in feudal Japan, whose father, the emperor of Japan (voiced by Sab Shimono as an elder man; Keone Young as a young emperor), was given a magical katana from three gods — Ra, Rama, and Odin — that he could and had used to defeat and imprison the supernatural shapeshifting demon Aku (Mako, and later Greg Baldwin for Season 5). Eight years later Aku escaped, took over the land, and held the Emperor hostage, but not before the prince was sent away by his mother to travel so that he could train and return with the magic sword to defeat Aku. On his return, the prince-turned-samurai faced and almost defeated Aku, but before he could land a finishing blow, Aku placed a time travel curse and sent him into the distant future, antici |
https://en.wikipedia.org/wiki/Memory%20corruption | Memory corruption occurs in a computer program when the contents of a memory location are modified due to programmatic behavior that exceeds the intention of the original programmer or program/language constructs; this is termed as violation of memory safety. The most likely causes of memory corruption are programming errors (software bugs). When the corrupted memory contents are used later in that program, it leads either to program crash or to strange and bizarre program behavior. Nearly 10% of application crashes on Windows systems are due to heap corruption.
Modern programming languages like C and C++ have powerful features of explicit memory management and pointer arithmetic. These features are designed for developing efficient applications and system software. However, using these features incorrectly may lead to memory corruption errors.
Memory corruption is one of the most intractable class of programming errors, for two reasons:
The source of the memory corruption and its manifestation may be far apart, making it hard to correlate the cause and the effect.
Symptoms appear under unusual conditions, making it hard to consistently reproduce the error.
Memory corruption errors can be broadly classified into four categories:
Using uninitialized memory: Contents of uninitialized memory are treated as garbage values. Using such values can lead to unpredictable program behavior.
Using non-owned memory: It is common to use pointers to access and modify memory. If such a pointer is a null pointer, dangling pointer (pointing to memory that has already been freed), or to a memory location outside of current stack or heap bounds, it is referring to memory that is not then possessed by the program. Using such pointers is a serious programming flaw. Accessing such memory usually causes operating system exceptions, that most commonly lead to a program crash (unless suitable memory protection software is being used).
Using memory beyond the memory that was allocated (buffer overflow): If an array is used in a loop, with incorrect terminating condition, memory beyond the array bounds may be accidentally manipulated. Buffer overflow is one of the most common programming flaws exploited by computer viruses, causing serious computer security issues (e.g. return-to-libc attack, stack-smashing protection) in widely used programs. In some cases programs can also incorrectly access the memory before the start of a buffer.
Faulty heap memory management: Memory leaks and freeing non-heap or un-allocated memory are the most frequent errors caused by faulty heap memory management.
Many memory debuggers such as Purify, Valgrind, Insure++, Parasoft C/C++test, AddressSanitizer are available to detect memory corruption errors.
See also
Storage violation
References
External links
Memory Corruption Tutorial An introduction to exploitation techniques and protection mechanisms
Software bugs
Computer memory
Computer security exploits |
https://en.wikipedia.org/wiki/Britannia%20Manor | Britannia Manor was the residence of game designer Richard Garriott. The name comes from the castle of Lord British, ruler of Britannia, the setting of the Ultima computer role playing game series, which he created. Britannia Manor was situated atop a large hill near Austin, Texas. The home was featured in a 2007 episode of the HGTV television series Secret Spaces on Lifestyles of the Rich and Famous, and on MTV Cribs.
Britannia Manor was also the name given to what has been called the world's most famous haunted house, held in this location every two years from 1988 to 1994.
Design
The manor's medieval design reflected Garriott's interest in the era.
The house was adorned with various medieval items such as crossbows, swords, and armour. It features traps and a network of secret passages and rooms. A secret room in the basement contained some of Garriott's most treasured artifacts, including dinosaur fossils, a coffin with a human skeleton inside it, and an authentic 16th century vampire hunting kit. The house also featured other collections such as hairs from the Glacier snowman, a brick from the Great Wall of China, a Russian spacesuit, and three stained glass windows retrieved from an abandoned church. There was a large collection of automatons. The basement room he referred to as the dungeon, had shrunken heads, mummified remains of parts of people as well as a mummified bird found in a tomb in Egypt, and human skulls.
The house also had an observatory in the main complex. Although part of the house, it was structurally independent from the rest of the house in order to damp out vibrations, as they ruined long-exposure space photos.
Britannia Manor was designed by designer/architect, Alan Barley, of Barley & Pfeiffer Architects in Austin, Texas. In 1996, Garriott hired Moore-Andersson Architects, Austin, to design another house on a nearby riverfront property. The property was situated atop a bluff overlooking the Austin, Texas skyline, the 360 Bridge, and Lake Austin. Britannia Manor Mark 3 will also have a rotating observatory and will be more castle than house. Construction on this house was delayed for some time after the dot com crash. It resumed for a while a few years later, but was put on indefinite hold when Garriott decided in 2008 to spend the majority of his fortune to go into space.
There was a working cannon at the front door and an indoor grotto with hot-and-cold-running rain showers.
After spending several years on the market, the house was sold in December, 2014. The new owner demolished the house in late 2016.
Haunt history
Before 1995, Britannia Manor was famous for hosting the most elaborate haunted house in the US. Garriott spent a great deal of money biannually around Halloween to pay for makeup, tools, construction materials, special effects, and costumes for his haunted house. The actors and techs were all volunteers, many donating hundreds of hours for the honor of being a part of the show, and a fr |
https://en.wikipedia.org/wiki/Arimaa | Arimaa () is a two-player strategy board game that was designed to be playable with a standard chess set and difficult for computers while still being easy to learn and fun to play for humans. It was invented between 1997 and 2002 by Omar Syed, an Indian-American computer engineer trained in artificial intelligence. Syed was inspired by Garry Kasparov's defeat at the hands of the chess computer Deep Blue to design a new game which could be played with a standard chess set, would be difficult for computers to play well, but would have rules simple enough for his then four-year-old son Aamir to understand. ("Arimaa" is "Aamir" spelled backwards plus an initial "a".)
Beginning in 2004, the Arimaa community held three annual tournaments: a World Championship (humans only), a Computer Championship (computers only), and the Arimaa Challenge (human vs. computer). After eleven years of human dominance, the 2015 challenge was won decisively by the computer (Sharp by David Wu).
Arimaa has won several awards including GAMES Magazine 2011 Best Abstract Strategy Game, Creative Child Magazine 2010 Strategy Game of the Year, and the 2010 Parents' Choice Approved Award. It has also been the subject of several research papers.
Rules
Arimaa is played on an 8×8 board with four trap squares. There are six kinds of pieces, ranging from elephant (strongest) to rabbit (weakest). Stronger pieces can push or pull weaker pieces, and stronger pieces freeze weaker pieces. Pieces can be captured by dislodging them onto a trap square when they have no orthogonally adjacent pieces.
The two players, Gold and Silver, each control sixteen pieces. These are, in order from strongest to weakest: one elephant (), one camel (), two horses (), two dogs (), two cats (), and eight rabbits . These may be represented by the king, queen, rooks, bishops, knights, and pawns respectively when one plays using a chess set.
Objective
The main object of the game is to move a rabbit of one's own color onto the home rank of the opponent, which is known as a goal. Thus Gold wins by moving a gold rabbit to the eighth rank, and Silver wins by moving a silver rabbit to the first rank. However, because it is difficult to usher a rabbit to the goal line while the board is full of pieces, an intermediate objective is to capture opposing pieces by pushing or pulling them into the trap squares.
The game can also be won by capturing all of the opponent's rabbits (elimination) or by depriving the opponent of legal moves (immobilization). Compared to goal, these are uncommon.
Setup
The game begins with an empty board. Gold places the sixteen gold pieces in any configuration on the first and second ranks. Silver then places the sixteen silver pieces in any configuration on the seventh and eighth ranks. Diagram 1 shows one possible initial placement.
Movement
After the pieces are placed on the board, the players alternate turns, starting with Gold. A turn consists of making one to four steps. With ea |
https://en.wikipedia.org/wiki/Nibbles%20%28video%20game%29 | Nibbles, also known by the source code's file name NIBBLES.BAS, is a variant of the snake video game concept used to demonstrate the QBasic programming language. Nibbles was written in QBasic by Rick Raddatz, who later went on to create small businesses such as Xiosoft and Bizpad.
Gameplay
The game's objective is to navigate a virtual snake through a walled space while consuming numbers (from 1 through 9) along the way. The player must avoid colliding with walls, other snakes or their own snake. Since the length of the snake increases with each number consumed, the game increases in difficulty over time. After the last number has been eaten, the player progresses to the next level, with more complex obstacles and increased speed. There is a multiplayer mode which allows a second player to control a second snake by using a different set of keys on the same keyboard.
Development
Nibbles was included with MS-DOS version 5.0 and above. Written in QBasic, it is one of the programs included as a demonstration of that programming language. The QBasic game uses the standard 80x25 text screen to emulate an 80x50 grid by making clever use of foreground and background colors, and the ANSI characters for full blocks and half-height blocks. Microsoft's 24kB QBasic version was copyrighted in 1990. Because of MS-DOS's prevalence at that time, it was available on almost every IBM PC compatible in the early 1990s.
See also
GORILLA.BAS
DONKEY.BAS
References
External links
MS-DOS 5 included games at MobyGames
1991 video games
BASIC software
Commercial video games with freely available source code
DOS games
Linux games
MacOS games
Microsoft games
Snake video games
Video games developed in the United States
Windows games |
https://en.wikipedia.org/wiki/Neuromorphic%20engineering | Neuromorphic computing is an approach to computing that is inspired by the structure and function of the human brain. A neuromorphic computer/chip is any device that uses physical artificial neurons to do computations. In recent times, the term neuromorphic has been used to describe analog, digital, mixed-mode analog/digital VLSI, and software systems that implement models of neural systems (for perception, motor control, or multisensory integration). The implementation of neuromorphic computing on the hardware level can be realized by oxide-based memristors, spintronic memories, threshold switches, transistors, among others. Training software-based neuromorphic systems of spiking neural networks can be achieved using error backpropagation, e.g., using Python based frameworks such as snnTorch, or using canonical learning rules from the biological learning literature, e.g., using BindsNet.
A key aspect of neuromorphic engineering is understanding how the morphology of individual neurons, circuits, applications, and overall architectures creates desirable computations, affects how information is represented, influences robustness to damage, incorporates learning and development, adapts to local change (plasticity), and facilitates evolutionary change.
Neuromorphic engineering is an interdisciplinary subject that takes inspiration from biology, physics, mathematics, computer science, and electronic engineering to design artificial neural systems, such as vision systems, head-eye systems, auditory processors, and autonomous robots, whose physical architecture and design principles are based on those of biological nervous systems. One of the first applications for neuromorphic engineering was proposed by Carver Mead in the late 1980s.
Neurological inspiration
Neuromorphic engineering is for now set apart by the inspiration it takes from what we know about the structure and operations of the brain. Neuromorphic engineering translates what we know about the brain's function into computer systems. Work has mostly focused on replicating the analog nature of biological computation and the role of neurons in cognition.
The biological processes of neurons and their synapses are dauntingly complex, and thus very difficult to artificially simulate. A key feature of biological brains is that all of the processing in neurons uses analog chemical signals. This makes it hard to replicate brains in computers because the current generation of computers is completely digital. However, the characteristics of these parts can be abstracted into mathematical functions that closely capture the essence of the neuron's operations.
The goal of neuromorphic computing is not to perfectly mimic the brain and all of its functions, but instead to extract what is known of its structure and operations to be used in a practical computing system. No neuromorphic system will claim nor attempt to reproduce every element of neurons and synapses, but all adhere to the idea that comp |
https://en.wikipedia.org/wiki/Simon%20Plouffe | Simon Plouffe (born June 11, 1956) is a mathematician who discovered the Bailey–Borwein–Plouffe formula (BBP algorithm) which permits the computation of the nth binary digit of π, in 1995. His other 2022 formula allows extracting the nth digit of in decimal. He was born in Saint-Jovite, Quebec.
He co-authored The Encyclopedia of Integer Sequences, made into the website On-Line Encyclopedia of Integer Sequences dedicated to integer sequences later in 1995. In 1975, Plouffe broke the world record for memorizing digits of π by reciting 4096 digits, a record which stood until 1977.
See also
Fabrice Bellard, who discovered in 1997 a faster formula to compute pi.
PiHex
Notes
External links
Plouffe website (in French)
N. J. A. Sloane and S. Plouffe, The Encyclopedia of Integer Sequences, Academic Press, San Diego, 1995, 587 pp. .
1956 births
Living people
Canadian mathematicians
French Quebecers
People from Laurentides |
https://en.wikipedia.org/wiki/Tagged%20union | In computer science, a tagged union, also called a variant, variant record, choice type, discriminated union, disjoint union, sum type or coproduct, is a data structure used to hold a value that could take on several different, but fixed, types. Only one of the types can be in use at any one time, and a tag field explicitly indicates which one is in use. It can be thought of as a type that has several "cases", each of which should be handled correctly when that type is manipulated. This is critical in defining recursive datatypes, in which some component of a value may have the same type as that value, for example in defining a type for representing trees, where it is necessary to distinguish multi-node subtrees and leaves. Like ordinary unions, tagged unions can save storage by overlapping storage areas for each type, since only one is in use at a time.
Description
Tagged unions are most important in functional programming languages such as ML and Haskell, where they are called datatypes (see algebraic data type) and the compiler is able to verify that all cases of a tagged union are always handled, avoiding many types of errors. Compile-time checked sum types are also extensively used in Rust, where they are called enum. They can, however, be constructed in nearly any programming language, and are much safer than untagged unions, often simply called unions, which are similar but do not explicitly track which member of a union is in use currently.
Tagged unions are often accompanied by the concept of a type constructor, which is similar but not the same as a constructor for a class. Type constructors produce a tagged union type, given the initial tag type and the corresponding type.
Mathematically, tagged unions correspond to disjoint or discriminated unions, usually written using +. Given an element of a disjoint union A + B, it is possible to determine whether it came from A or B. If an element lies in both, there will be two effectively distinct copies of the value in A + B, one from A and one from B.
In type theory, a tagged union is called a sum type. Sum types are the dual of product types. Notations vary, but usually the sum type comes with two introduction forms (injections) and The elimination form is case analysis, known as pattern matching in ML-style languages: if has type and and have type under the assumptions and respectively, then the term has type . The sum type corresponds to intuitionistic logical disjunction under the Curry–Howard correspondence.
An enumerated type can be seen as a degenerate case: a tagged union of unit types. It corresponds to a set of nullary constructors and may be implemented as a simple tag variable, since it holds no additional data besides the value of the tag.
Many programming techniques and data structures, including rope, lazy evaluation, class hierarchy (see below), arbitrary-precision arithmetic, CDR coding, the indirection bit and other kinds of tagged pointers, etc.
are usua |
https://en.wikipedia.org/wiki/Racter | Racter is an artificial intelligence program that generates English language prose at random. It was published by Mindscape for IBM PC compatibles in 1984, then later for the Apple II, Macintosh, and Amiga. An expanded version of the software, not the one released through Mindscape, was used to generate the text for the published book The Policeman's Beard Is Half Constructed.
History
Racter, short for raconteur, was written by William Chamberlain and Thomas Etter. The existence of the program was revealed in 1983 in a book called The Policeman's Beard Is Half Constructed (), which was described as being composed entirely by the program. The program originally was written for an OSI which only supported file names at most six characters long, causing the name to be shorted to Racter and it was later adapted to run on a CP/M machine where it was written in "compiled ASIC on a Z80 microcomputer with 64K of RAM." This version, the program that allegedly wrote the book, was not released to the general public. The sophistication claimed for the program was likely exaggerated, as could be seen by investigation of the template system of text generation.
In 1984, Mindscape released an interactive version of Racter, developed by Inrac Corporation, for IBM PC compatibles, and it was ported to the Apple II, Macintosh, and Amiga. The published Racter was similar to a chatterbot. The BASIC program that was released by Mindscape was far less sophisticated than anything that could have written the fairly sophisticated prose of The Policeman's Beard. The commercial version of Racter could be likened to a computerized version of Mad Libs, the game in which you fill in the blanks in advance and then plug them into a text template to produce a surrealistic tale. The commercial program attempted to parse text inputs, identifying significant nouns and verbs, which it would then regurgitate to create "conversations", plugging the input from the user into phrase templates which it then combined, along with modules that conjugated English verbs.
By contrast, the text in The Policeman's Beard, apart from being edited from a large amount of output, would have been the product of Chamberlain's own specialized templates and modules, which were not included in the commercial release of the program.
Reception
PC Magazine described some of Policeman's Beards scenes as "surprising for their frankness" and "reflective". It concluded that the book was "whimsical and wise and sometimes fun". Computer Gaming World described Racter as "a diversion into another dimension that might best be seen before paying the price of a ticket. (Try before you buy!)"
A 1985 review of the program in The New York Times notes that, "As computers move ever closer to artificial intelligence, Racter is on the edge of artificial insanity." It also states that Racter's "always-changing sentences are grammatically correct, often funny and, for a computer, sometimes profound." The article includes e |
https://en.wikipedia.org/wiki/Sigma%206 | Sigma 6 may refer to:
G.I. Joe: Sigma 6, a line of military-themed action figures and toys
SDS Sigma 6, one of the SDS Sigma series of computers made by Scientific Data Systems
Pink Floyd, a British rock group originally called Sigma 6
See also
Six Sigma, a set of techniques and tools for process improvement
68–95–99.7 rule, or Three sigma rule, in statistics |
https://en.wikipedia.org/wiki/SABC%201 | SABC 1 is a South African public television network operated by the South African Broadcasting Corporation (SABC) which carries programming in English and Nguni.
It was created in 1996, after the SABC restructured its television channels. SABC 1 carried much of its programming over from the defunct CCV (Contemporary Community Values) network, which was itself made up of the former TV2, TV3 and TV4 timeshared channels created in the 1980s. SABC 1 generates the widest audience in South Africa due to its programming diversity, airing SABC's longest-running soap-opera, Generations, Uzalo and Skeem Saam.
As of June 2018, the channel started broadcasting in high definition.
History
On 1 January 1982, two television channels were introduced: TV2, broadcasting in Zulu and Xhosa; and TV3, broadcasting in Sotho and Tswana, both targeted at a Black urban audience and airing on a timeshared radio frequency. The main network, now called TV1, divided its programming equally between English and Afrikaans programs, as before. In 1985, a new service called TV4 was introduced, carrying sports and entertainment programming, using the same radio frequency used by both TV2 and TV3, which stopped broadcasting at 9:30 pm.
In 1992, TV2, TV3 and TV4 were merged into a unified network called CCV (Contemporary Community Values) on the same channel frequency. A third network was introduced known as TSS, or TopSport Surplus, with TopSport being the brand name for SABC's sport coverage. However, in 1994, it was replaced by NNTV (National Network TV), a cultural non-commercial network.
In 1996, the SABC reorganised its three television networks with the aim of making them more representative of the country's diverse ethnolinguistic groups. These were rebranded as SABC 1, SABC 2 and SABC 3, respectively.
Programming
SABC 1 is heavily focused on local entertainment that is aimed towards the youth.
Soapies, dramas and telenovelas
The channel has had the title of 'Mzansi's Storyteller' with popular local dramas, and popular soapies Generations: Tand Skeem Saam. Other famed dramas from past years are Yizo Yizo, Zone 14, Intersexions, The Shakespeare in Mzansi Series, etc. However, over recent years, the title has been taken by Mzansi Magic.
Series
The channel has a number of comedy, game shows and reality series such as Nyan'Nyan, Now or Never, It Takes a Village, Plate it up, The next big thing, Ses' Top La, Friends Like These, The Remix, Lip Sync Battle. Initially, it would have rights to broadcast local versions of international franchises like The X Factor, but due to financial constraints, the channel currently focuses on local reality competitions.
Music
The channel airs some of the latest local urban music and playlists on shows like Live Amp and Koze Kuse, while also focusing on traditional indigenous music on shows like Roots, as well as choral music on one of their longest-running show Imizwilili.
Talk and magazine
SABC 1 airs local informative magazine sho |
https://en.wikipedia.org/wiki/SABC%203 | SABC 3 (stylised as S3) is a South African free-to-air public television network owned by the South African Broadcasting Corporation (SABC). It carries programming in English and, few in other South African languages. It has a number of its own reality and talk shows and had lately introduced a new series called “The Estate”.
As of June 2018, it has been broadcasting in high definition.
In April 2021, the channel rebranded and is stylised as S3.
History
On 1 January 1981, two services were introduced, TV2 broadcasting in Zulu and Xhosa and TV3 broadcasting in Sotho and Tswana, both targeted at a Black urban audience. The main channel, now called TV1, was divided evenly between English and Afrikaans, as before. In 1986, a new service called TV4 was introduced, carrying sports and entertainment programming, using the channel shared by TV2 and TV3, which stopped broadcasting at 9:30pm.
In 1991, TV2, TV3 and TV4 were combined into a new service called CCV (Contemporary Community Values). A third channel was introduced known as TSS, or TopSport Surplus, TopSport being the brand name for the SABC's sport coverage, but this was replaced by NNTV (National Network TV), an educational, non-commercial channel, in 1994.
In 1996, the SABC reorganised its three TV channels with the aim of making them more representative of the various language groups. These new channels were called SABC 1, SABC 2 and SABC 3.
SABC3 inherited many of its programs from TV1, South Africa's apartheid-era "white" channel. SABC 3 is targeted at South Africa's affluent English-speaking community; the channel's primary target market is viewers aged 18 to 49. It screens a combination of international programming from the United States and United Kingdom, as well as locally produced soap operas, talk shows and drama series. SABC 3 ranks fourth out of South Africa's five analogue channels in audience ratings.
Programming
SABC3 is the only SABC channel to feature a large proportion of international series. It has deals with studio companies in the US and various television networks in the UK to air some series with a few months' delay from their international airdates.
Soapies, dramas and telenovelas
The channel is known for its longest-running soapie Isidingo, and previously aired local dramas such as High Rollers, and popular international soaps Days of Our Lives and The Bold and the Beautiful, which SABC3 stopped airing because of financial constraints. This upset viewers fond of the soapie and started a petition to keep the show running. The channel currently offers international dramas such as Knightfall, NCIS, House of Cards, MotherFatherSon, Line of Duty, El Chapo & Killing Eve. In April 2021, the channel introduced a new local drama "The Estate" as well as three new telenovelas like Orphans Of A Nation, The Bay and The Red Room.
Children and education
The channel has local children's content such as Challenge SOS, Talent on Track, Yum.Me and Hectic on 3, along with and i |
https://en.wikipedia.org/wiki/SABC%202 | SABC 2 is a South African family public television channel owned by the South African Broadcasting Corporation (SABC). SABC 2 broadcasts programming in English, Afrikaans, Venda, and Tsonga.
As of August 2018, the channel started broadcasting in high definition.
History
SABC began trialling its first television service on 5 May 1975 in South Africa's largest cities, and officially launched its first television channel on 6 January 1976 under the name SABC Television/SAUK-Televisie. On 1 January 1981, it changed its name to TV1, with the launch of two new services: TV2 broadcasting in Zulu and Xhosa and TV3 broadcasting in Sotho and Tswana, both targeted at a Black urban audience and broadcasting on the same television frequency. The main network, now called TV1, divided its broadcasting languages evenly between English and Afrikaans, as before. In 1986, a new service called TV4 was introduced, carrying sports and entertainment programming, also timesharing with TV2 and TV3 on the same frequency, which stopped broadcasting at 9:30pm.
In 1991, TV2, TV3 and TV4 were merged into a new full-fledged network, CCV (Contemporary Community Values). A separate network was introduced, TopSport Surplus (TSS), with TopSport being the brand name for the SABC's sport coverage. However, it was replaced by NNTV (National Network TV), an educational non-commercial channel in 1994.
In 1996, the SABC reorganised its three TV networks with the aim of making them more representative of the various language groups. These were renamed to SABC 1 (formerly CCV), SABC 2 (formerly TV1) and SABC 3 (formerly NNTV). The amount of time allocated to Afrikaans-language programming on the new channel (SABC 2) fell from 50% to 15% - a move that alienated Afrikaans speakers.
Programming
After the SABC restructured its television channels, SABC 2 took the place of the old TV1 channel. The reduced prominence of Afrikaans angered many speakers of the language, although the channel still features a significant amount of Afrikaans programming, including a news broadcast every week night at 19:00 and weekends at 18:00.
M-Net seeing the market need, launched the Afrikaans subscription channel KykNet in 1999 and followed in 2005 with the music channel MK (originally known as MK89.) In 2009, M-Net launched Koowee, a kids channel broadcasting in Afrikaans.
Soapies, dramas and telenovelas
The channel is popular for its two longest-running soapies 7de Laan and Muvhango, dramas such as Erfsonders, Gerramtes in die Kas, Roer Jouy Voete and 90 Plein Street, and Telenovelas such as Keeping Score, Giyani: Land of Blood and Die Senturm.
Series
SABC 2 has in the past, broadcast international series such as NCIS, Pretty Little Liars, Teen Wolf and The Vampire Diaries. However, the channel is currently focused on local reality and actuality series such as Speak Out, Relate, and Saving Our Marriage, comedies such as Ga Re Dumele and Ke Ba Bolleletse, and a few international series such as Ameri |
https://en.wikipedia.org/wiki/Movement%20for%20a%20New%20Society | The Movement for a New Society (MNS) was a U.S.-based network of social activist collectives, committed to the principles of nonviolence, who played a key role in social movements of the 1970s and 1980s.
According to a description from the MNS publication, Building Social Change Communities (1979),
Movement for a New Society (MNS) is a nationwide network of groups working for fundamental social change through nonviolent action. Together we are developing an analysis of present-day society; a vision of a decentralized, democratic and caring social order; a nonviolent revolutionary strategy; and a program based on changed values and changed lives.
History
The precursor to the MNS was A Quaker Action Group (AQAG), founded by Lawrence Scott (Quaker) in 1966. Dissatisfied with the response of the mainstream Quaker church to the United States involvement in the Vietnam War, Scott founded AQAG with the intention of sparking a renewed commitment to the Quaker Peace Testimony.
Frustrated by their failure to achieve this end, AQAG members including Scott and Quaker George Willoughby, refashioned the group as the Movement for A New Society in 1971. Other founding members included Bill Moyer, Berit and George Lakey, Phyllis and Richard Taylor, Lynne Shivers, and Lillian Willoughby.
The members of MNS consciously sought to develop tools and strategies that could be employed to bring about revolutionary change through nonviolent means. The three-part focus of MNS included training for activists, nonviolent direct action and community. The main location for MNS activity was in West Philadelphia. Other locations included Atlanta, Boston, Minneapolis, Ohio, San Francisco, Seattle, Toronto, Tucson, Western Massachusetts and more.
During the 1970s and early 1980s Philadelphia was the base for weekend, two-week and nine-month programs that trained US and international activists in direct action organizing, group process, consensus decision-making, liberation/oppression issues and more. Activist training also happened in other locations and through traveling trainers programs.
MNS did not focus its energies exclusively on one issue or injustice. Its members were involved in working for social change on many fronts, most notably in the movement to end US involvement in the Vietnam war, and during the citizen-led opposition to the expansion of the US nuclear power industry in the mid to late 1970s. MNS members were also active in the anti-nuclear weapons movement, the Pledge of Resistance (anti-US intervention in Central America), feminism, LGBTQ, civil rights, community organizing, and food and worker cooperatives.
MNS was unusual in combining feminist group process, broad analysis of interrelated people's struggles including class and culture, and personal empowerment techniques ranging from music and street theater as political organizing tools to Re-evaluation Counseling. With their group process skills, MNS members often played roles of facilitating meetin |
https://en.wikipedia.org/wiki/Spark%20printing | Spark printing is an obsolete form of computer printing and before that fax and chart recorder printing which uses a special paper coated with a conductive layer over a contrasting backing, originally black carbon over white paper but later aluminium over black paper. Printing on this paper uses pulses of electric current to burn away spots of the conductive layer. Typically, one or more electrodes are swept across the page perpendicular to the direction of paper motion to form a raster of potential burnt spots.
Western Union developed the paper for this printing technology in the late 1940s, under the trademark "Teledeltos". The Western Union "Deskfax" fax machine, announced in 1948, was one of the first printers to use this technology.
Spark printing was a simple and inexpensive technology. The print quality was relatively poor, but at a time when conventional printers cost hundreds of pounds, spark printers' sub-£100 price was a major selling point. The other major downside is that they can only print onto special metallised paper and such an electrosensitive paper is no longer widely available, but is still sold as of 2020.
Models
By 1979, the Comprint 912 was widely advertised as being faster, quieter, and less expensive than competitive matrix printers, with its "special aluminized 'silver paper'" being superior to ordinary paper, and "on those rare occasions when you really do need a plain bond paper copy, just run your Comprint 912 printout through your plain bond copy machine and you've got it."
The Sinclair ZX Printer, introduced in November 1981 for the low-end ZX81 (and later for the ZX Spectrum) home computers used the spark printing method, and retailed for .
In the early 1980s, Casio released a "Mini Electro Printer", the FP-10 for some of their scientific calculators.It used Casio CMP-36x5 paper.
The Hewlett Packard 9120A, which attached to the top of the HP-9100A/B calculator, also used the sparking technique.
Tandy / Radio Shack TRS-80 Screen Printer, Quick Printer, and Quick Printer II all used this same method and special paper.
The Sharp Corporation ELSIMATE EL-8151 portable calculator had a built in spark printer which used silver-colored paper. It is known to be compatible with the Casio CMP-36x5 paper used by the FP-10, despite the Casio paper having a slightly larger core diameter.
Variants
A different spark printer implementation propelled dry toner from a tiny hole in the end of a glass rod, using a high-voltage spark between the platen and print head. The glass toner rod held a solid mass of toner, pushed toward the ejection tip by a spring. This had the advantage of printing onto plain paper, but the disadvantage of the toner not being cured to the paper, and thus easily smudged. Similar to the Sinclair printer, this printer had only one stylus (the toner rod), since the entire plate behind the paper served as the other spark electrode. The printer could only print one line of pixels at a time.
Refer |
https://en.wikipedia.org/wiki/MASSIVE%20%28software%29 | MASSIVE (Multiple Agent Simulation System in Virtual Environment) is a high-end computer animation and artificial intelligence software package used for generating crowd-related visual effects for film and television.
Overview
Massive is a software package developed by Stephen Regelous for use in the visual effects industry. Its primary feature is its ability to rapidly create large groups of agents that can act as individuals, each with their own unique behaviors and actions.
Through the use of fuzzy logic, the software enables every agent to respond individually to its surroundings, including other agents. These reactions affect the agent's behavior, changing how they act by controlling pre-recorded animation clips. Blending between such clips creates characters that move, act, and react realistically. These pre-recorded animations can come from motion-capture sessions or they can be hand-animated in other 3D animation software packages.
In addition to the artificial intelligence abilities of Massive, there are numerous other features, including cloth simulation, rigid body dynamics and graphics processing unit (GPU) based hardware rendering. Massive Software has also created several pre-built agents ready to perform certain tasks, such as stadium crowd agents, rioting mayhem agents and simple agents who walk around and talk to each other.
History
Massive was originally developed in Wellington, New Zealand. Peter Jackson, the director of the Lord of the Rings films (2001–2003), required software that allowed armies of hundreds of thousands of soldiers to fight, a problem that had not been solved in film-making before. Stephen Regelous created Massive to allow Wētā FX to generate many of the award-winning visual effects, particularly the battle sequences, for the Lord of the Rings films. Since then, it has developed into a complete product and has been licensed by a number of other visual effects houses.
Examples
Massive has been used in many productions, both commercials and feature-length films, small-scale and large.
Some significant examples include:
The Lord of the Rings
Rise of the Planet of the Apes
Avatar
The Chronicles of Narnia: The Lion, the Witch and the Wardrobe
King Kong (Jackson, 2005)
Radiohead - Go To Sleep (Music Video)
Flags of our Fathers (besides battle and crowd scenes, even shots of seacraft crossing the Pacific were created with Massive)
Carlton Draught: Big Ad
Mountain, a television commercial for the PlayStation 2 console
I, Robot
Category 7: The End of the World
Blades of Glory
Eragon
The Mummy: Tomb of the Dragon Emperor
Happy Feet
300
The Ant Bully (the first film to use computer-animated characters as Massive agents rather than motion capture. Also first to use facial animation within Massive)
Buffy ("Chosen")
Doctor Who ("Partners in Crime")
Changeling
Speed Racer (Car A.I. and crowds)
WALL-E
Up
Life of Pi (Both the flying fish and meerkat sequences were created with the help of Massive)
Epic
The Hobbit
Da |
https://en.wikipedia.org/wiki/Masada%20%28miniseries%29 | Masada is an American television miniseries that aired on ABC in April 1981. Advertised by the network as an "ABC Novel for Television," it was a fictionalized account of the historical siege of the Masada citadel in Israel by legions of the Roman Empire in AD 73. The TV series' script is based on the 1971 novel The Antagonists by Ernest Gann, with a screenplay written by Joel Oliansky. The siege ended when the Roman armies entered the fortress, only to discover the mass suicide by the Jewish defenders when defeat became imminent.
The miniseries starred Peter O'Toole as Roman legion commander Lucius Flavius Silva, Peter Strauss as the Jewish commander Eleazar ben Ya'ir, and Barbara Carrera as Silva's Jewish mistress. It was O'Toole's first appearance in an American miniseries.
Masada was one of several historical miniseries produced in the early 1980s following the success of the miniseries Roots that aired on the ABC Network in 1977 and Shogun which aired on NBC in 1980.
Plot
Part I
In the year 70 AD, with the fall of Jerusalem and the destruction of the Second Temple, the Jewish rebellion against Roman occupation is declared over, but Eleazar ben Ya'ir and his family flee the city, vowing that the Judean War is not ended. Eleazar and his followers make their headquarters on top of the mountain fortress of Masada. From there they conduct raids on Roman occupied villages in the south of Judea. These guerrilla attacks threaten the credibility of the declared Roman victory. The commanding general of the 10th Legion, Cornelius Flavius Silva, arranges a meeting with Eleazar to negotiate a truce. Returning to Rome, Silva's hopes to implement a truce in Judea are quashed by the Emperor Vespasian, because of political pressures in the Roman Senate. Silva is sent back to Judea after securing the services of veteran Siege Commander Rubrius Gallus. Silva is also informed that his second in command, General Marcus Quadratus, and Head Tribune Merovius, are spies for the emperor's political enemy. While Silva is still in Rome, through the treachery of these two men, the truce is violently broken by the Romans.
Part II
Learning of the breaking of the truce upon his return from Rome, Silva marches the 5,000 men of the 10th Legion to the foot of Masada and lays a siege to the apparently impregnable fortress. He directs Quadratus and Merovius on a suicidal assault of the fortress in order to remove them from his forces and make them an example to any others who share their political leanings. Rubrius Gallus directs that a ramp be built to almost the summit of the mountain, intent on breaking through the Masada walls with the aid of a 50-foot (15.24 m) siege tower that is being constructed out of sight of the rebels. When Eleazar successfully attacks the Roman soldiers building the ramp with catapulted stones, Silva quickly rounds up hundreds of Jews from the surrounding area to use as slaves to continue the work, believing correctly that Eleazar will not att |
https://en.wikipedia.org/wiki/List%20of%20important%20publications%20in%20computer%20science | This is a list of important publications in computer science, organized by field. Some reasons why a particular publication might be regarded as important:
Topic creator – A publication that created a new topic
Breakthrough – A publication that changed scientific knowledge significantly
Influence – A publication which has significantly influenced the world or has had a massive impact on the teaching of computer science.
Artificial intelligence
Computing Machinery and Intelligence
Alan Turing
Mind, 59:433–460, 1950.
Online copy
Description: This paper discusses the various arguments on why a machine can not be intelligent and asserts that none of those arguments are convincing. The paper also suggested the Turing test, which it calls "The Imitation Game" as according to Turing it is pointless to ask whether or not a machine can think intelligently, and checking if it can act intelligently is sufficient.
A Proposal for the Dartmouth Summer Research Project on Artificial Intelligence
John McCarthy
Marvin Minsky
N. Rochester
C.E. Shannon
Online copy
Description: This summer research proposal inaugurated and defined the field. It contains the first use of the term artificial intelligence and this succinct description of the philosophical foundation of the field: "every aspect of learning or any other feature of intelligence can in principle be so precisely described that a machine can be made to simulate it." (See philosophy of AI) The proposal invited researchers to the Dartmouth conference, which is widely considered the "birth of AI". (See history of AI.)
Fuzzy sets
Lotfi Zadeh
Information and Control, Vol. 8, pp. 338–353. (1965).
Description: The seminal paper published in 1965 provides details on the mathematics of fuzzy set theory.
Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference
Judea Pearl
Publisher: Morgan Kaufmann Pub, 1988
Description: This book introduced Bayesian methods to AI.
Artificial Intelligence: A Modern Approach
Stuart J. Russell and Peter Norvig
Prentice Hall, Englewood Cliffs, New Jersey, 1995,
Textbook's website
Description: The standard textbook in Artificial Intelligence. The book web site lists over 1100 colleges.
Machine learning
An Inductive Inference Machine
Ray Solomonoff
IRE Convention Record, Section on Information Theory, Part 2, pp. 56–62, 1957
(A longer version of this, a privately circulated report, 1956, is online).
Description: The first paper written on machine learning. Emphasized the importance of training sequences, and the use of parts of previous solutions to problems in constructing trial solutions to new problems.
Language identification in the limit
E. Mark Gold
Information and Control, 10(5):447–474, 1967
Online version: (HTML) (PDF)
Description: This paper created Algorithmic learning theory.
On the uniform convergence of relative frequencies of events to their probabilities
V. Vapnik, A. Chervonenkis
Theory of Probability and Its |
https://en.wikipedia.org/wiki/Windows%209x | Windows 9x is a generic term referring to a series of Microsoft Windows computer operating systems produced from 1995 to 2000, which were based on the Windows 95 kernel and its underlying foundation of MS-DOS, both of which were updated in subsequent versions. The first version in the 9x series was Windows 95, which was succeeded by Windows 98 and then Windows Me, which was the third and last version of Windows on the 9x line, until the series was superseded by Windows XP.
Windows 9x is predominantly known for its use in home desktops. In 1998, Windows made up 82% of operating system market share.
Internal release versions for versions of Windows 9x are 4.x. The internal versions for Windows 95, 98, and Me are 4.0, 4.1, and 4.9, respectively. Previous MS-DOS-based versions of Windows used version numbers of 3.2 or lower. Windows NT, which was aimed at professional users such as networks and businesses, used a similar but separate version number between 3.1 and 4.0. All versions of Windows from Windows XP onwards are based on the Windows NT codebase.
History
Windows prior to 95
The first independent version of Microsoft Windows, version 1.0, released on November 20, 1985, achieved little popularity. Its name was initially "Interface Manager", but Rowland Hanson, the head of marketing at Microsoft, convinced the company that the name Windows would be more appealing to consumers. Windows 1.0 was not a complete operating system, but rather an "operating environment" that extended MS-DOS. Consequently, it shared the inherent flaws and problems of MS-DOS.
The second installment of Microsoft Windows, version 2.0, was released on December 9, 1987, and used the real-mode memory model, which confined it to a maximum of 1 megabyte of memory. In such a configuration, it could run under another multitasking system like DESQview, which used the 286 Protected Mode.
Microsoft Windows scored a significant success with Windows 3.0, released in 1990. In addition to improved capabilities given to native applications, Windows also allowed users to better multitask older MS-DOS-based software compared to Windows/386, thanks to the introduction of virtual memory.
Microsoft developed Windows 3.1, which included several minor improvements to Windows 3.0, but primarily consisted of bugfixes and multimedia support. It also excluded support for Real mode, and only ran on an Intel 80286 or better processor. In November 1993 Microsoft also released Windows 3.11, a touch-up to Windows 3.1 which included all of the patches and updates that followed the release of Windows 3.1 in early 1992.
Meanwhile, Microsoft continued to develop Windows NT. The main architect of the system was Dave Cutler, one of the chief architects of VMS at Digital Equipment Corporation. Microsoft hired him in August 1988 to create a successor to OS/2, but Cutler created a completely new system instead based on his MICA project at Digital.
Microsoft announced at its 1991 Professional Developers Co |
https://en.wikipedia.org/wiki/Application%20software | An application program (software application, or application, or app for short) is a computer program designed to carry out a specific task other than one relating to the operation of the computer itself, typically to be used by end-users. Word processors, media players, and accounting software are examples. The collective noun "application software" refers to all applications collectively. The other principal classifications of software are system software, relating to the operation of the computer, and utility software ("utilities").
Applications may be bundled with the computer and its system software or published separately and may be coded as proprietary, open-source, or projects. The term "app" usually refers to applications for mobile devices such as phones.
Terminology
In information technology, an application (app), an application program, or application software is a computer program designed to help people perform an activity. Depending on the activity for which it was designed, an application can manipulate text, numbers, audio, graphics, and a combination of these elements. Some application packages focus on a single task, such as word processing; others called integrated software include several applications.
User-written software tailors systems to meet the user's specific needs. User-written software includes spreadsheet templates, word processor macros, scientific simulations, audio, graphics, and animation scripts. Even email filters are a kind of user software. Users create this software themselves and often overlook how important it is.
The delineation between system software such as operating systems and application software is not exact, however, and is occasionally the object of controversy. For example, one of the key questions in the United States v. Microsoft Corp. antitrust trial was whether Microsoft's Internet Explorer web browser was part of its Windows operating system or a separate piece of application software. As another example, the GNU/Linux naming controversy is, in part, due to disagreement about the relationship between the Linux kernel and the operating systems built over this kernel. In some types of embedded systems, the application software and the operating system software may be indistinguishable from the user, as in the case of software used to control a VCR, DVD player, or microwave oven. The above definitions may exclude some applications that may exist on some computers in large organizations. For an alternative definition of an app: see Application Portfolio Management.
Metonymy
The word "application" used as an adjective is not restricted to the "of or on application software" meaning. For example, concepts such as application programming interface (API), application server, application virtualization, application lifecycle management and portable application apply to all computer programs alike, not just application software.
Apps and killer apps
Some applications are available in vers |
https://en.wikipedia.org/wiki/Reference%20management%20software | Reference management software, citation management software, or bibliographic management software is software that stores a database of bibliographic records and produces bibliographic citations (references) for those records, needed in scholarly research. Once a record has been stored, it can be used time and again in generating bibliographies, such as lists of references in scholarly books and articles. Modern reference management applications can usually be integrated with word processors so that a reference list in one of the many different bibliographic formats required by publishers and scholarly journals is produced automatically as an article is written, reducing the risk that a cited source is not included in the reference list. They will also have a facility for importing bibliographic records from bibliographic databases.
Reference management software does not do the same job as a bibliographic database that tries to store records of publications published within a given scope such as a particular academic discipline or group of disciplines. Such bibliographic databases are large and have to be housed on major server installations. Reference management software collects a much smaller database, of the publications that have been used or are likely to be used by a particular researcher or group of researchers, and such a database can easily be stored on an individual's personal computer.
Many reference management applications enable users to search bibliographic records in online bibliographic databases and library catalogs. An early communications protocol used to access library catalogs, and still in service at many libraries, is Z39.50, which predated the invention of the World Wide Web. Although Z39.50 is still in use, today most bibliographic databases are available as web sites that allow exporting selected bibliographic records in various bibliographic data formats that are imported by reference management software.
Citation creators
Citation creators or citation generators are online tools which facilitate the creation of works cited and bibliographies. Citation creators use web forms to take input and format the output according to guidelines and standards, such as the Modern Language Association's MLA Style Manual, American Psychological Association's APA style, The Chicago Manual of Style, or Turabian format. Some citation creators generate only run-time output, while others store the citation data for later use.
In different academic fields
Research on software usage
In 2013, a comparison of usage of EndNote, RefWorks, and Zotero among the legal scholars at the Oxford University Law Faculty was performed by survey. 0% of survey participants used RefWorks; 40% used Endnote; 17% used Zotero, mostly research students. The difficulty of using RefWorks, Endnote, and Zotero by Oxford legal scholars was estimated by the author as well. A comparison of these tools for legal scholars was made across several usage scenarios, inc |
https://en.wikipedia.org/wiki/Signaling%20gateway | A signaling gateway is a network component responsible for transferring signaling messages (i.e. information related to call establishment, billing, location, short messages, address conversion, and other services) between Common Channel Signaling (CCS) nodes that communicate using different protocols and transports. Transport conversion is often from SS7 to IP.
A SIGTRAN Signaling Gateway is a network component that performs packet level translation of signaling from common channel signaling (based upon SS7) to SIGTRAN signaling (based upon IP). The concept of the SIGTRAN signaling gateway was introduced in the IETF document: RFC 2719: Architectural Framework for Signaling Transport.
A signaling gateway can be implemented as an embedded component of some other network element, or can be provided as a stand-alone network element. For example: a signaling gateway is often part of a softswitch in modern VoIP deployments. The signaling gateway function can also be included within the larger operational domain of a Signal Transfer Point (STP).
Protocol conversion gateways can also convert from one network operational paradigm to another – for example, SIP to ISUP for call control, SIP to TCAP for address translation, or SIP to MAP for location or presence.
See also
Media gateway
Voice over IP
Signaling System 7 |
https://en.wikipedia.org/wiki/Extreme%20point | In mathematics, an extreme point of a convex set in a real or complex vector space is a point in that does not lie in any open line segment joining two points of In linear programming problems, an extreme point is also called vertex or corner point of
Definition
Throughout, it is assumed that is a real or complex vector space.
For any say that and if and there exists a such that
If is a subset of and then is called an of if it does not lie between any two points of That is, if there does exist and such that and The set of all extreme points of is denoted by
Generalizations
If is a subset of a vector space then a linear sub-variety (that is, an affine subspace) of the vector space is called a if meets (that is, is not empty) and every open segment whose interior meets is necessarily a subset of A 0-dimensional support variety is called an extreme point of
Characterizations
The of two elements and in a vector space is the vector
For any elements and in a vector space, the set is called the or between and The or between and is when while it is when The points and are called the of these interval. An interval is said to be a or a if its endpoints are distinct. The is the midpoint of its endpoints.
The closed interval is equal to the convex hull of if (and only if) So if is convex and then
If is a nonempty subset of and is a nonempty subset of then is called a of if whenever a point lies between two points of then those two points necessarily belong to
Examples
If are two real numbers then and are extreme points of the interval However, the open interval has no extreme points.
Any open interval in has no extreme points while any non-degenerate closed interval not equal to does have extreme points (that is, the closed interval's endpoint(s)). More generally, any open subset of finite-dimensional Euclidean space has no extreme points.
The extreme points of the closed unit disk in is the unit circle.
The perimeter of any convex polygon in the plane is a face of that polygon.
The vertices of any convex polygon in the plane are the extreme points of that polygon.
An injective linear map sends the extreme points of a convex set to the extreme points of the convex set This is also true for injective affine maps.
Properties
The extreme points of a compact convex set form a Baire space (with the subspace topology) but this set may to be closed in
Theorems
Krein–Milman theorem
The Krein–Milman theorem is arguably one of the most well-known theorems about extreme points.
For Banach spaces
These theorems are for Banach spaces with the Radon–Nikodym property.
A theorem of Joram Lindenstrauss states that, in a Banach space with the Radon–Nikodym property, a nonempty closed and bounded set has an extreme point. (In infinite-dimensional spaces, the property of compactness is stronger than the joint properties of being closed and being bounded.)
|
https://en.wikipedia.org/wiki/Network%20Based%20Application%20Recognition | Network Based Application Recognition (NBAR) is the mechanism used by some Cisco routers and switches to recognize a dataflow by inspecting some packets sent.
The networking equipment which uses NBAR does a deep packet inspection on some of the packets in a dataflow, to determine which traffic category the flow belongs to. Used in conjunction with other features, it may then program the internal application-specific integrated circuits (ASICs) to handle this flow appropriately. The categorization may be done with Open Systems Interconnection (OSI) layer 4 info, packet content, signaling, and so on but some new applications have made it difficult on purpose to cling to this kind of tagging.
The NBAR approach is useful in dealing with malicious software using known ports to fake being "priority traffic", as well as non-standard applications using dynamic ports. That's why NBAR is also known as OSI layer 7 categorization.
On Cisco routers, NBAR is mainly used for quality of service and network security purposes.
References
External links
Network Based Application Recognition: RTP Payload Classification, Cisco.
Block P2P Traffic on a Cisco IOS Router using NBAR Configuration Example, Cisco.
Computer network security |
https://en.wikipedia.org/wiki/Deep%20packet%20inspection | Deep packet inspection (DPI) is a type of data processing that inspects in detail the data being sent over a computer network, and may take actions such as alerting, blocking, re-routing, or logging it accordingly. Deep packet inspection is often used for baselining application behavior, analyzing network usage, troubleshooting network performance, ensuring that data is in the correct format, checking for malicious code, eavesdropping, and internet censorship, among other purposes. There are multiple headers for IP packets; network equipment only needs to use the first of these (the IP header) for normal operation, but use of the second header (such as TCP or UDP) is normally considered to be shallow packet inspection (usually called stateful packet inspection) despite this definition.
There are multiple ways to acquire packets for deep packet inspection. Using port mirroring (sometimes called Span Port) is a very common way, as well as physically inserting a network tap which duplicates and sends the data stream to an analyzer tool for inspection.
Deep Packet Inspection (and filtering) enables advanced network management, user service, and security functions as well as internet data mining, eavesdropping, and internet censorship. Although DPI has been used for Internet management for many years, some advocates of net neutrality fear that the technique may be used anticompetitively or to reduce the openness of the Internet.
DPI is used in a wide range of applications, at the so-called "enterprise" level (corporations and larger institutions), in telecommunications service providers, and in governments.
Background
DPI technology boasts a long and technologically advanced history, starting in the 1990s, before the technology entered what is seen today as common, mainstream deployments. The technology traces its roots back over 30 years, when many of the pioneers contributed their inventions for use among industry participants, such as through common standards and early innovation, such as the following:
RMON
Sniffer
Wireshark
Essential DPI functionality includes analysis of packet headers and protocol fields. For example, Wireshark offers essential DPI functionality through its numerous dissectors that display field names and content and, in some cases, offer interpretation of field values.
Some security solutions that offer DPI combine the functionality of an intrusion detection system (IDS) and an Intrusion prevention system (IPS) with a traditional stateful firewall. This combination makes it possible to detect certain attacks that neither the IDS/IPS nor the stateful firewall can catch on their own. Stateful firewalls, while able to see the beginning and end of a packet flow, cannot catch events on their own that would be out of bounds for a particular application. While IDSs are able to detect intrusions, they have very little capability in blocking such an attack. DPIs are used to prevent attacks from viruses and worms at wire speeds. |
https://en.wikipedia.org/wiki/Socket%20370 | Socket 370, also known as PGA370, is a CPU socket first used by Intel for Pentium III and Celeron processors to first complement and later replace the older Slot 1 CPU interface on personal computers. The "370" refers to the number of pin holes in the socket for CPU pins.
Socket 370 was replaced by Socket 423 in 2000.
Overview
Socket 370 started as a budget-oriented platform for 66 MHz FSB PPGA Mendocino Celeron CPUs in late 1998, as the move to on-die L2 cache eliminated the need for a PCB design as seen on Slot 1.
From late 1999 to late 2000, it was Intel's main desktop socket for 100/133 MHz FSB Coppermine Pentium IIIs. In 2001, the Tualatin Pentium III processors brought changes to the infrastructure which required dedicated Tualatin-compatible motherboards; some manufacturers would indicate this with a blue (instead of white) socket. These late sockets were typically compatible with Coppermine processors, but not older Mendocino Celerons.
Some motherboards that used Socket 370 support Intel processors in dual CPU configurations (e. g. ABIT BP6). Other motherboards allowed the use of a Socket 370 or a Slot 1 CPU, but not at the same time.
The VIA-Cyrix Cyrix III, later renamed the VIA C3, also used Socket 370.
Slotkets are available that allows Socket 370 CPUs to be used on Slot 1 based motherboards. These devices are equipped with their own voltage regulator modules, in order to supply the new CPU with a lower core voltage, which the motherboard would not otherwise allow.
Socket 370 Intel processors mechanical load limits
The weight of a Socket 370 CPU cooler should not exceed 180 grams (6.3 ounces). Heavier coolers may result in damage to the die when the system is improperly handled.
Most Intel Socket 370 processors (Pentium III and Celeron) had mechanical maximum load limits which were designed not be exceeded during heat sink assembly, shipping conditions, or standard use. They came with a warning that load above those limits would crack the processor die and make it unusable. The limits are included in the table below.
Socket 370 Intel processors with integrated heat sink mechanical load limits
All Intel Socket 370 processors with integrated heat sink (Pentium III and Celeron 1.13–1.4 GHz) had mechanical maximum load limits which were designed not be exceeded during heat sink assembly, shipping conditions, or standard use. They came with a warning that load above those limits would crack the processor die and make it unusable. The limits are included in the table below.
See also
List of Intel microprocessors
References
External links
Socket 370 (PGA370)
Intel CPU sockets |
https://en.wikipedia.org/wiki/Data%20engineering | Data engineering refers to the building of systems to enable the collection and usage of data. This data is usually used to enable subsequent analysis and data science; which often involves machine learning. Making the data usable usually involves substantial compute and storage, as well as data processing
History
Around the 1970s/1980s the term information engineering methodology (IEM) was created to describe database design and the use of software for data analysis and processing. These techniques were intended to be used by database administrators (DBAs) and by systems analysts based upon an understanding of the operational processing needs of organizations for the 1980s. In particular, these techniques were meant to help bridge the gap between strategic business planning and information systems. A key early contributor (often called the "father" of information engineering methodology) was the Australian Clive Finkelstein, who wrote several articles about it between 1976 and 1980, and also co-authored an influential Savant Institute report on it with James Martin. Over the next few years, Finkelstein continued work in a more business-driven direction, which was intended to address a rapidly changing business environment; Martin continued work in a more data processing-driven direction. From 1983 to 1987, Charles M. Richter, guided by Clive Finkelstein, played a significant role in revamping IEM as well as helping to design the IEM software product (user data), which helped automate IEM.
In the early 2000s, the data and data tooling was generally held by the information technology (IT) teams in most companies. Other teams then used data for their work (e.g. reporting), and there was usually little overlap in data skillset between these parts of the business.
In the early 2010s, with the rise of the internet, the massive increase in data volumes, velocity, and variety led to the term big data to describe the data itself, and data-driven tech companies like Facebook and Airbnb started using the phrase data engineer. Due to the new scale of the data, major firms like Google, Facebook, Amazon, Apple, Microsoft, and Netflix started to move away from traditional ETL and storage techniques. They started creating data engineering, a type of software engineering focused on data, and in particular infrastructure, warehousing, data protection, cybersecurity, mining, modelling, processing, and metadata management. This change in approach was particularly focused on cloud computing. Data started to be handled and used by many parts of the business, such as sales and marketing, and not just IT.
Tools
Compute
High-performance computing is critical for the processing and analysis of data. One particularly widespread approach to computing for data engineering is dataflow programming, in which the computation is represented as a directed graph (dataflow graph); nodes are the operations, and edges represent the flow of data. Popular implementations includ |
https://en.wikipedia.org/wiki/Video%20game%20art | Video game art is a specialized form of computer art employing video games as the artistic medium. Video game art often involves the use of patched or modified video games or the repurposing of existing games or game structures, however it relies on a broader range of artistic techniques and outcomes than artistic modification and it may also include painting, sculpture, appropriation, in-game intervention and performance, sampling, etc. It may also include the creation of art games either from scratch or by modifying existing games. Notable examples of video game art include Cory Arcangel's Super Mario Clouds and I Shot Andy Warhol, Joseph Delappe's projects including "Dead in Iraq" and the "Salt Satyagraha Online: Gandhi's March to Dandi in Second Life," the 2004-2005 Rhizome Commissions "relating to the theme of games," Paolo Pedercini's Molleindustria games such as "Unmanned" and "Every Day the Same Dream", and Ian Bogost's "Cowclicker."
Artistic modifications are frequently made possible through the use of level editors, though other techniques exist. Some artists make use of machinima applications to produce non-interactive animated artworks, however artistic modification is not synonymous with machinima as these form only a small proportion of artistic modifications. Machinima is distinct from art mods as it relies on different tools, though there are many similarities with some art mods.
Like video games, artistic game modifications are often interactive and may allow for single-player or multiplayer experience. Multiplayer works make use of networked environments to develop new kinds of interaction and collaborative art production.
Techniques
Machinima
Machinima is the use of real-time three-dimensional (3-D) graphics rendering engines to generate computer animation. The term also refers to works that incorporate this animation technique.
In-game intervention and performance
Artists may intervene in online games in a non-play manner, often disrupting games in progress in order to challenge or expose underlying conventions and functions of game play. Examples of this include Anne Marie Schleiner's Velvet-Strike (a project designed to allow players of realistic first person shooter games to use anti-war graffiti within the game to make an artistic statement) and Dead in Iraq (an art project created by Joseph DeLappe in which the player character purposely allows himself to be shot and then recites the names of US soldiers who have died in the Iraq War).
Site-specific installations and site-relative mods
Site-specific installations and site-relative gaming modifications ("mods"), replicate real-world places (often the art gallery in which they are displayed) to explore similarities and differences between real and virtual worlds. An example is What It Is Without the Hand That Wields It, where blood from kills in Counterstrike manifests and spills into a real life gallery.
Real-time performance instruments
Video games can be incorpor |
https://en.wikipedia.org/wiki/Mass%20storage | In computing, mass storage refers to the storage of large amounts of data in a persisting and machine-readable fashion. In general, the term is used as large in relation to contemporaneous hard disk drives, but it has been used large in relation to primary memory as for example with floppy disks on personal computers.
Devices and/or systems that have been described as mass storage include tape libraries, RAID systems, and a variety of computer drives such as hard disk drives, magnetic tape drives, magneto-optical disc drives, optical disc drives, memory cards, and solid-state drives. It also includes experimental forms like holographic memory. Mass storage includes devices with removable and non-removable media. It does not include random access memory (RAM).
There are two broad classes of mass storage: local data in devices such as smartphones or computers, and enterprise servers and data centers for the cloud. For local storage, SSDs are on the way to replacing HDDs. Considering the mobile segment from phones to notebooks, the majority of systems today is based on NAND Flash. As for Enterprise and data centers, storage tiers have established using a mix of SSD and HDD.
Definition
The notion of "large" amounts of data is of course highly dependent on the time frame and the market segment, as storage device capacity has increased by many orders of magnitude since the beginnings of computer technology in the late 1940s and continues to grow; however, in any time frame, common mass storage devices have tended to be much larger and at the same time much slower than common realizations of contemporaneous primary storage technology.
Papers at the 1966 Fall Joint Computer Conference (FJCC) used the term mass storage for devices substantially larger than contemporaneous hard disk drives. Similarly, a 1972 analysis identified mass storage systems from Ampex (Terabit Memory) using video tape, Precision Industries (Unicon 690-212) using lasers and International Video (IVC-1000) using video tape and states "In the literature, the most common definition of mass storage capacity is a trillion bits.". The first IEEE conference on mass storage was held in 1974 and at that time identified mass storage as "capacity on the order of 1012 bits" (1 gigabyte). In the mid-1970s IBM used the term to in the name of the IBM 3850 Mass Storage System, which provided virtual disks backed up by Helical scan magnetic tape cartridges, slower than disk drives but with a capacity larger than was affordable with disks. The term mass storage was used in the PC marketplace for devices, such as floppy disk drives, far smaller than devices that were not considered mass storage in the mainframe marketplace.
Mass storage devices are characterized by:
Sustainable transfer speed
Seek time
Cost
Capacity
Storage media
Magnetic disks are the predominant storage media in personal computers. Optical discs, however, are almost exclusively used in the large-scale distribution of r |
https://en.wikipedia.org/wiki/IEEE%20802.15.4 | IEEE 802.15.4 is a technical standard which defines the operation of a low-rate wireless personal area network (LR-WPAN). It specifies the physical layer and media access control for LR-WPANs, and is maintained by the IEEE 802.15 working group, which defined the standard in 2003. It is the basis for the Zigbee, ISA100.11a, WirelessHART, MiWi, 6LoWPAN, Thread, Matter and SNAP specifications, each of which further extends the standard by developing the upper layers which are not defined in IEEE 802.15.4. In particular, 6LoWPAN defines a binding for the IPv6 version of the Internet Protocol (IP) over WPANs, and is itself used by upper layers like Thread.
Overview
IEEE standard 802.15.4 intends to offer the fundamental lower network layers of a type of wireless personal area network (WPAN) which focuses on low-cost, low-speed ubiquitous communication between devices. It can be contrasted with other approaches, such as Wi-Fi, which offer more bandwidth and requires more power. The emphasis is on very low cost communication of nearby devices with little to no underlying infrastructure, intending to exploit this to lower power consumption even more.
The basic framework conceives a 10-meter communications range with line-of-sight at a transfer rate of 250 kbit/s. Bandwidth tradeoffs are possible to favor more radically embedded devices with even lower power requirements for increased battery operating time, through the definition of not one, but several physical layers. Lower transfer rates of 20 and 40 kbit/s were initially defined, with the 100 kbit/s rate being added in the current revision.
Even lower rates can be used, which results in lower power consumption. As already mentioned, the main goal of IEEE 802.15.4 regarding WPANs is the emphasis on achieving low manufacturing and operating costs through the use of relatively simple transceivers, while enabling application flexibility and adaptability.
Key 802.15.4 features include:
real-time suitability by reservation of Guaranteed Time Slots (GTS).
collision avoidance through CSMA/CA.
integrated support for secure communications.
power management functions such as link speed/quality and energy detection.
Support for time and data rate sensitive applications because of its ability to operate either as CSMA/CA or TDMA access modes. The TDMA mode of operation is supported via the GTS feature of the standard.
IEEE 802.15.4-conformant devices may use one of three possible frequency bands for operation (868/915/2450 MHz).
Protocol architecture
Devices are designed to interact with each other over a conceptually simple wireless network. The definition of the network layers is based on the OSI model; although only the lower layers are defined in the standard, interaction with upper layers is intended, possibly using an IEEE 802.2 logical link control sublayer accessing the MAC through a convergence sublayer. Implementations may rely on external devices or be purely embedded, self-functioni |
https://en.wikipedia.org/wiki/Mini-ITX | Mini-ITX is a motherboard form factor developed by VIA Technologies in 2001. Mini-ITX motherboards have been traditionally used in small-configured computer systems. Originally, Mini-ITX was a niche standard designed for fanless cooling with a low power consumption architecture, which made them useful for home theater PC systems, where fan noise can detract from the cinema experience.
The four mounting holes in a Mini-ITX board line up with four of the holes in ATX-specification motherboards, and the locations of the backplate and expansion slot are the same (though one of the holes used was optional in earlier versions of the ATX spec). Mini-ITX boards can therefore often be used in cases designed for ATX, micro-ATX and other ATX variants if desired.
Mini-ITX motherboards have only one expansion slot. Earlier Mini-ITX motherboards had a standard 33 MHz 5V 32-bit PCI slot, whereas newer motherboards use a PCI Express slot. Many older case designs use riser cards and some even have two-slot riser cards, although the two-slot riser cards are not compatible with all boards. Some boards based around non-x86 processors have a 3.3V PCI slot, and the Mini-ITX 2.0 (2008) boards have a PCI-Express ×16 slot; these boards are not compatible with the standard PCI riser cards supplied with older ITX (Information Technology eXtended) cases.
The HiFive Unmatched RISC-V computer uses a Mini-ITX form factor.
History
In March 2001, the chipset manufacturer VIA Technologies released a reference design for an ITX motherboard, to promote the low power C3 processor they had bought from Centaur Technology, in combination with their chipsets. Designed by Robert Kuo, VIA's chief R&D expert, the 215×191 mm VT6009 ITX Reference Board was demonstrated in "Information PC" and set-top box configurations. At that point, few manufacturers took up the ITX design, but Shuttle, Jetway, etc. produced many ITX based cube computers. Other manufactures instead produced smaller boards based on the very similar 229×191 mm FlexATX configuration.
In October 2001, VIA announced their decision to create a new motherboard division, to provide standardized infrastructure for lower-cost PC iterations, and focus on embedded devices. The result was the November 2001 release of the VT6010 Mini-ITX reference design (again by Robert Kuo), once again touted as an "Information PC", or low cost entry level x86 computing platform. Manufacturers were still reluctant, but customer response was much more receptive, so VIA decided to manufacture and sell the boards themselves. In April 2002 the first Mini-ITX motherboards—VIA's EPIA 5000 (fanless 533 MHz Eden processor) and EPIA 800 (800 MHz C3)—were sold to industrial customers.
Enthusiasts soon noticed the advantages of small size, low noise and power consumption, and started to push the boundaries of case modding into something else—building computers into nearly every object imaginable, and sometimes even creating new cases altogether. Hollowe |
https://en.wikipedia.org/wiki/Defense%20Switched%20Network | The Defense Switched Network (DSN) is a primary information transfer network for the Defense Information Systems Network (DISN) of the United States Department of Defense. The DSN provides the worldwide non-secure voice, secure voice, data, facsimile, and video teleconferencing services for DOD Command and Control (C2) elements, their supporting activities engaged in logistics, personnel, engineering, and intelligence, as well as other Federal agencies.
In 1982, the DSN was designated by the Office of the Secretary of Defense (OSD) and the Joint Chiefs of Staff (JCS) as the provider of long-distance communications service for the DOD. The DSN is designated as a primary system of communication during peacetime, periods of crisis, preattack, non-nuclear, and post-attack phases of war. The network assures nonblocking service for users with "flash" and "flash override" precedence capabilities. Key users include the National Command Authorities, Commanders of the Combatant Commands, and subordinate component commanders. DSN replaced the older Autovon system.
The DSN consists of four subsystems:
Switching,
Transmission,
Timing and Synchronization, and
Network Administration and Management.
The DSN Switching Subsystem consists of multifunction, stand-alone tandem, end office, and remote switching units. Using the transmission, timing, and control elements of the DISN, they interconnect all military locations worldwide and provide end-to-end long-distance common user and dedicated voice, secure voice, data, and video services worldwide.
In addition to nonsecure voice, data, and video services, the DSN will provide transmission, switching, and support services for Secure Telephone Units, Third Generation (STU-IIIs, now obsolete), the Secure Terminal Equipment (STE), the Defense Red Switch Network (DRSN), the dial-up alternative routing for the Unclassified but Sensitive Internet Protocol (IP) Router Network (NIPRNet), and the Secret IP Router Network (SIPRNet). The DSN can also provide access to the Government Emergency Telephone System (GETS).
Area Codes
Eight area codes are used to cover certain geographical areas for regular voice communications:
311 for AFRICOM
312 for the Continental United States (NORTHCOM) and Puerto Rico
313 for the Caribbean
314 for EUCOM
315 for INDOPACOM
317 for Alaska
318 for CENTCOM
319 for Canada (Canadian Switched Network (CSN))
Other area codes are assigned to functional areas:
20x for interface with the United Kingdom's Defence Fixed Telecommunications Service (DFTS)
606 for interface with NATO's Core Network (NCN)
7xx for interface with Australia's Defence Voice Network (DVN)
715 for interface with New Zealand's Defence Telephone Network (DTelN)
References
External links
Defense Information Systems Agency (DISA)
DISA Media Resources Page
A brief history of the DSN US Government Defense Information Systems Agency
DSN Movie US Government Defense Information Systems Agency
DSN Movie Transcript US Governmen |
https://en.wikipedia.org/wiki/CoolWebSearch | CoolWebSearch (also known as CoolWWWSearch or abbreviated as CWS) is a spyware or virus program that installs itself on Microsoft Windows based computers. It first appeared in May 2003.
Effects
CoolWebSearch has numerous capabilities when it is successfully installed on a user's computer. The program can change an infected computer's web browser homepage to 'coolwebsearch.com', and though originally thought to only work on Internet Explorer, recent variants affect Mozilla Firefox as well as Google Chrome, and others. Infected computers can create pop-up ads which redirect to other websites, including pornography sites, collect private information about users, and slow the connection speed.
CoolWebSearch uses various techniques to evade detection and removal, which many common spyware removal programs are unable to properly remove the software. Since CoolWebSearch is bundled with other potentially unwanted software or add-ons, users need to uninstall those unwanted programs first, or CoolWebSearch can return, even after the user has changed their home page and primary search engine.
Some versions of CoolWebSearch are installed through what's known as 'drive-by installation', in which browsing an infected webpage can automatically install CoolWebSearch without the user's knowledge. CoolWebSearch attempts to evade detection by not labelling the ads it presents as such, nor does it provide a EULA, nor any data about itself nor is there a website directly associated with it. Certain variants insert links on random text, leading to advertisements. Others attempt to access websites which are redirected to pay-per-click search engines which may install more malware display ads. Some variants of CoolWebSearch also add links to pornography, and gambling sites to the user's Desktop, Internet Explorer's bookmarks and history. Certain versions attempt to edit users' trusted sites and modify security settings as well as to hide from removal programs. Variants are often named for the effects they have such as msconfig, Msoffice, Mupdate, Msinfo and Svchost32.
Possible creators
The website claims that they are not responsible for the browser hijacking. They run an affiliate program that pays affiliates to direct others to their site with paid advertising links. Coolwebsearch.com's terms of service use the laws of Quebec, Canada, whilst their DNS registration lists an address in the British Virgin Islands, and their web server appears to be run by HyperCommunications in Massachusetts, USA. CoolWebSearch is also linked to CoolWebSearch.org and appears to be related to webcoolsearch.com. Investigation connected Stanislav Avdeyko, the Koobface hacker, with CoolWebSearch.
Variants
CSS Cool Search Search
CWS.Addclass
CWS.Alfasearch
CWS.Bootconf
CWS.CameUp
CWS.Cassandra
CWS.Control
CWS.Ctfmon32
CWS.Datanotary
CWS.Dnsrelay
CWS.Dreplace
CWS.Gonnasearch
CWS.Googlems
CWS.Hiddendll
CWS.Homesearch
CWS.Loadbat
CWS.Look2Me
CWS.Msconfd
CWS.Msconfig
CWS.MSFind
CWS.Msi |
https://en.wikipedia.org/wiki/ITV%20plc | ITV plc is a British media company that holds 13 of the 15 regional television licences that make up the ITV network (Channel 3), the oldest and largest commercial terrestrial television network in the United Kingdom.
ITV plc is listed on the London Stock Exchange and is a constituent of the FTSE 250 Index.
History
Pre-merger
ITV plc was the result of a merger between Granada and Carlton following the various mergers between the companies of the ITV network that had taken place from 1993 when the ownership rules were relaxed.
The first wave of mergers began with Yorkshire Television acquiring Tyne Tees Television in 1992, forming a parent group called Yorkshire-Tyne Tees Television Holdings. In 1994, Carlton Communications – which had owned a 20% stake in Central Independent Television – acquired the remainder of the company and, because of Central's shareholdings, inherited a 20% stake in Meridian Broadcasting. Later that year, Granada acquired London Weekend Television through a hostile takeover worth in the region of £750 million. MAI, which controlled Meridian Broadcasting, acquired Anglia Television; MAI became United News & Media after merging with United Newspapers – owners of The Daily Express in 1996. Ownership rules, that previously restricted ownership of ITV licences by one company to two outright, plus 20% in a third, were relaxed, and so Carlton went on to acquire Westcountry Television (later re-branding it Carlton, along with Central), Granada acquired Yorkshire-Tyne Tees Holdings (with the parent group becoming Granada Media, later simply Granada) and United acquired HTV.
The idiosyncrasies and business model of the future ITV plc operation can be found in the way these new conglomerates operated their franchises. Carlton re-branded all of its stations with its own name, creating a single identity across the whole expanse of its territory. By contrast, Granada and United, while keeping the franchisees' names, centralised their continuity departments – Granada in Leeds and United in Southampton. All three, however, merged the network production operations of their franchises, creating Carlton Productions, Granada Content and United Productions.
By the end of the 1990s, there were three dominating owners of the ITV franchises in England and Wales: Carlton Communications, Granada plc and United News and Media. In 2000, after an aborted merger attempt with Carlton, UNM decided to leave ITV and Granada bought all the UNM franchises, but sold HTV to Carlton in order to comply with the permitted audience percentage covered by a single broadcasting interest. It kept the production arm of HTV, however, renaming it Granada Bristol and moving it out of Bath Road to a new, smaller office in Whiteladies Road (near the BBC). This arm of the company closed in 2006, following later rationalisation of ITV's production operations. The last remaining independent ITV franchise in England and Wales, Border Television, had been bought by Capita |
https://en.wikipedia.org/wiki/Stax | Stax can refer to:
StAX, (Computer Programming) Streaming API for reading and writing XML in Java
Stax Ltd, a Japanese brand of electrostatic headphones
Stax Records, an American record company
Lay's Stax, a brand of potato snack chips sold by Lay's |
https://en.wikipedia.org/wiki/Cold%20Feet | Cold Feet is a British comedy-drama television series produced by Granada Television for the ITV network. The series was created and principally written by Mike Bullen as a follow-up to his 1997 Comedy Premiere special of the same name. The series follows three couples experiencing the ups-and-downs of romance, originally Adam Williams and Rachel Bradley (James Nesbitt and Helen Baxendale), Pete and Jenny Gifford (John Thomson and Fay Ripley) and Karen and David Marsden (Hermione Norris and Robert Bathurst). As the original series progressed, the Giffords divorced and Pete married Jo Ellison (Kimberley Joseph), whilst Karen and David also separated, forming relationships with Mark Cubitt (Sean Pertwee) and Robyn Duff (Lucy Robinson).
The original series was executive-produced by Bullen with Granada's head of comedy Andy Harries, and produced by Christine Langan, Spencer Campbell and Emma Benson. 32 episodes were broadcast over the original five series from 15 November 1998 to 16 March 2003. A revival with all of the original cast except Baxendale began airing from 5 September 2016.
The revived series introduced Ceallach Spellman as Matthew, Adam and Rachel's now teenage son, alongside Karen David as Adam's second wife Angela Zubayr following the death of Rachel, and Art Malik as Angela's business tycoon father Eddie, a love interest for Karen Marsden. Pete and Jenny had remarried whilst David's marriage to Robyn was crumbling. Leanne Best was introduced as Tina Reynolds, Adam's partner following his separation from Angela. After his separation from Robyn, Nikki Kirkbright (Siobhan Finneran) is introduced as David's new partner, and Adam later forms a relationship with Karen.
In 2020, at the conclusion of Series 9, it was announced in a group statement that Cold Feet was being rested for the foreseeable future, with a view to returning once again when the characters have reached the next suitable age for stories to tell.
Background
Series creator Mike Bullen's working relationship with Granada Television began in 1994 when his agent sold his first screenplay, a one-off comedy drama called The Perfect Match, to the company's head of comedy Andy Harries. Harries had been looking for television scripts that would reflect the lives of people from his generation—people in their 30s who were under-represented on television. The Perfect Match, about a man who proposes to his girlfriend at the FA Cup Final and has to deal with constant media attention afterwards, was made and then broadcast in 1995. Harries asked Bullen to pitch more ideas for television to The Perfect Matchs assistant producer Christine Langan. As a fan of American television such as Thirtysomething, Frasier and Hill Street Blues, Bullen pitched Cold Feet, a traditional "boy-meets-girl, boy-loses-girl, boy-wins-girl-back" story told from both sides of the relationship but using elements of fantasy and flashback to distort events to fit a character's point of view. The initial pitch |
https://en.wikipedia.org/wiki/Computer-aided%20engineering | Computer-aided engineering can be defined as the general usage of technology to aid in tasks related to engineering analysis. Any use of technology to solve or assist engineering issues falls under this umbrella.
Overview
Following alongside the consistent improvement in computer graphics and speed, computer aid assists engineers with once complicated and time consuming tasks with the input of information and a press of a button.
It includes finite element analysis (FEA), computational fluid dynamics (CFD), multibody dynamics (MBD), durability and optimization. It is included with computer-aided design (CAD) and computer-aided manufacturing (CAM) in the collective abbreviation "CAx".
The term CAE has been used to describe the use of computer technology within engineering in a broader sense than just engineering analysis. It was in this context that the term was coined by Jason Lemon, founder of SDRC in the late 1970s. This definition is however better known today by the terms CAx and PLM.
CAE systems are individually considered a single node on a total information network and each node may interact with other nodes on the network.
CAE fields and phases
CAE areas covered include:
Stress analysis on components and assemblies using finite element analysis (FEA);
Thermal and fluid flow analysis computational fluid dynamics (CFD);
Multibody dynamics (MBD) and kinematics;
Analysis tools for process simulation for operations such as casting, molding, and die press forming;
Optimization of the product or process.
In general, there are three phases in any computer-aided engineering task:
Pre-processing – defining the model and environmental factors to be applied to it (typically a finite element model, but facet, voxel, and thin sheet methods are also used);
Analysis solver (usually performed on high powered computers);
Post-processing of results (using visualization tools).
This cycle is iterated, often many times, either manually or with the use of commercial optimization software.
CAE in the automotive industry
CAE tools are widely used in the automotive industry. Their use has enabled automakers to reduce product development costs and time while improving the safety, comfort, and durability of the vehicles they produce. The predictive capability of CAE tools has progressed to the point where much of the design verification is done using computer simulations (diagnosis) rather than physical prototype testing. CAE dependability is based upon all proper assumptions as inputs and must identify critical inputs (BJ). Even though there have been many advances in CAE, and it is widely used in the engineering field, physical testing is still a must. It is used for verification and model updating, to accurately define loads and boundary conditions, and for final prototype sign-off.
The future of CAE in the product development process
Even though CAE has built a strong reputation as a verification, troubleshooting and analysis tool, there is still a |
https://en.wikipedia.org/wiki/Duff%27s%20device | In the C programming language, Duff's device is a way of manually implementing loop unrolling by interleaving two syntactic constructs of C: the - loop and a switch statement. Its discovery is credited to Tom Duff in November 1983, when Duff was working for Lucasfilm and used it to speed up a real-time animation program.
Loop unrolling attempts to reduce the overhead of conditional branching needed to check whether a loop is done, by executing a batch of loop bodies per iteration. To handle cases where the number of iterations is not divisible by the unrolled-loop increments, a common technique among assembly language programmers is to jump directly into the middle of the unrolled loop body to handle the remainder.
Duff implemented this technique in C by using C's case label fall-through feature to jump into the unrolled body.
Original version
Duff's problem was to copy 16-bit unsigned integers ("shorts" in most C implementations) from an array into a memory-mapped output register, denoted in C by a pointer. His original code, in C, looked as follows:
send(to, from, count)
register short *to, *from;
register count;
{
do { /* count > 0 assumed */
*to = *from++;
} while (--count > 0);
}
This code assumes that initial . Since the output location is a memory-mapped register, the pointer is not incremented as would be required for a memory-to-memory copy.
If were always divisible by eight, unrolling this loop eight-fold would produce the following:
send(to, from, count)
register short *to, *from;
register count;
{
register n = count / 8;
do {
*to = *from++;
*to = *from++;
*to = *from++;
*to = *from++;
*to = *from++;
*to = *from++;
*to = *from++;
*to = *from++;
} while (--n > 0);
}
Duff realized that to handle cases where is not divisible by eight, the assembly programmer's technique of jumping into the loop body could be implemented by interlacing the structures of a switch statement and a loop, putting the switch's labels at the points of the loop body that correspond to the remainder of :
send(to, from, count)
register short *to, *from;
register count;
{
register n = (count + 7) / 8;
switch (count % 8) {
case 0: do { *to = *from++;
case 7: *to = *from++;
case 6: *to = *from++;
case 5: *to = *from++;
case 4: *to = *from++;
case 3: *to = *from++;
case 2: *to = *from++;
case 1: *to = *from++;
} while (--n > 0);
}
}
Duff's device can similarly be applied with any other size for the unrolled loop, not just eight as in the example above.
Mechanism
Based on an algorithm used widely by programmers coding in assembly for minimizing the number of tests and branches during a copy, Duff's device appears out of place when implemented in C. The device is valid C by virtue of two attributes in C:
Relaxed specification of the statement in the l |
https://en.wikipedia.org/wiki/C%20syntax | The syntax of the C programming language is the set of rules governing writing of software in C. It is designed to allow for programs that are extremely terse, have a close relationship with the resulting object code, and yet provide relatively high-level data abstraction. C was the first widely successful high-level language for portable operating-system development.
C syntax makes use of the maximal munch principle.
Data structures
Primitive data types
The C programming language represents numbers in three forms: integral, real and complex. This distinction reflects similar distinctions in the instruction set architecture of most central processing units. Integral data types store numbers in the set of integers, while real and complex numbers represent numbers (or pair of numbers) in the set of real numbers in floating point form.
All C integer types have and variants. If or is not specified explicitly, in most circumstances, is assumed. However, for historic reasons, plain is a type distinct from both and . It may be a signed type or an unsigned type, depending on the compiler and the character set (C guarantees that members of the C basic character set have positive values). Also, bit field types specified as plain may be signed or unsigned, depending on the compiler.
Integer types
C's integer types come in different fixed sizes, capable of representing various ranges of numbers. The type occupies exactly one byte (the smallest addressable storage unit), which is typically 8 bits wide. (Although can represent any of C's "basic" characters, a wider type may be required for international character sets.) Most integer types have both signed and unsigned varieties, designated by the and keywords. Signed integer types may use a two's complement, ones' complement, or sign-and-magnitude representation. In many cases, there are multiple equivalent ways to designate the type; for example, and are synonymous.
The representation of some types may include unused "padding" bits, which occupy storage but are not included in the width. The following table provides a complete list of the standard integer types and their minimum allowed widths (including any sign bit).
The type is distinct from both and , but is guaranteed to have the same representation as one of them. The and types are standardized since 1999, and may not be supported by older C compilers. Type is usually accessed via the typedef name defined by the standard header stdbool.h.
In general, the widths and representation scheme implemented for any given platform are chosen based on the machine architecture, with some consideration given to the ease of importing source code developed for other platforms. The width of the type varies especially widely among C implementations; it often corresponds to the most "natural" word size for the specific platform. The standard header limits.h defines macros for the minimum and maximum representable values of the standard intege |
https://en.wikipedia.org/wiki/YDS | YDS or yds may refer to:
YDS (Language Proficiency Test administered in Turkey)
Yards
YDS algorithm in computer science
Yosemite Decimal System
Young Democratic Socialists, US
Yiddish Sign Language's ISO 639 code. |
https://en.wikipedia.org/wiki/Spanning%20tree%20%28disambiguation%29 | Spanning tree is a term in the mathematical field of graph theory
Spanning tree may also refer to:
Spanning tree protocol, a network protocol for Ethernet networks
Multiple Spanning Tree Protocol
See also
Minimum spanning tree
Capacitated minimum spanning tree
Distributed minimum spanning tree
Euclidean minimum spanning tree
k-minimum spanning tree
Kinetic minimum spanning tree
Random minimum spanning tree
Rectilinear minimum spanning tree
Degree-constrained spanning tree
Maximum leaf spanning tree
Minimum degree spanning tree
Shortest total path length spanning tree
Kruskal's algorithm, a minimum-spanning-tree algorithm |
https://en.wikipedia.org/wiki/National%20Estuarine%20Research%20Reserve | The National Estuarine Research Reserve System is a network of 30 protected areas established by partnerships between the National Oceanic and Atmospheric Administration (NOAA) and coastal states. The reserves represent different biogeographic regions of the United States. The National Estuarine Research Reserve System protects more than 1.3 million acres of coastal and estuarine habitats for long-term research, water-quality monitoring, education, and coastal stewardship.
Background
For thousands of years, coastal and estuarine environments have provided people with food, safe harbors, transportation access, flood control, and a place to play and relax. The pressures on the nation's coast are enormous and the impacts on economies and ecosystems are becoming increasingly evident. Severe storms, climate change, pollution, habitat alteration and rapid population growth threaten the ecological functions that have supported coastal communities throughout history. Estuaries are the connection between the ocean (or Great Lakes) and the land and humans depend on both for their very existence, so caring for both – and the connection between them – is vital to humans.
The System was established by the Coastal Zone Management Act (CZMA) of 1972 as estuarine sanctuaries and was renamed to estuarine research reserves in the 1988 reauthorization of the CZMA. NOAA provides funding, national guidance and technical assistance. Each reserve is managed on daily basis by a lead state agency or university, with input from local partners.
Reserve staff work with local communities and regional groups to address natural resource management issues, such as non-point source pollution, habitat restoration and invasive species. Through integrated research and education, the reserves help communities develop strategies to deal successfully with these coastal resource issues. Reserves provide adult audiences with training on estuarine issues of concern in their local communities, offer field classes for K-12 students, and provide estuary education to teachers through the Teachers on the Estuary program. Reserves also provide long-term water quality monitoring as well as opportunities for both scientists and graduate students to conduct research in a "living laboratory".
Core programs
Research and monitoring
The National Estuarine Research Reserves serve as living laboratories to support coastal research and long-term monitoring and to provide facilities for on-site staff, visiting scientists and graduate students. They also serve as reference sites for comparative studies on coastal topics such as ecosystem dynamics, human influences on estuarine systems, habitat conservation and restoration, species management, and social science. Additionally, the reserves serve as sentinel sites to better understand the effects of climate change.
The goals of the Reserve System's research and monitoring program include:
ensuring a stable environment for research through long-term |
https://en.wikipedia.org/wiki/The%20Gathering%20%28LAN%20party%29 | The Gathering (abbreviated as "TG" for short) is the second largest computer party in the world (second to DreamHack). It is held annually in Vikingskipet Olympic Arena in Hamar, Norway, and lasts for five consecutive days (starting on the Wednesday in Easter each year). Each year, TG attracts more than 5200 (mostly young) people, with attendance increasing every year.
History
Beginning
In early 1991, Vegard Skjefstad and Trond Michelsen, members of the demogroup Deadline, decided that they wanted to organize a big demoparty in Norway. In the late eighties/early nineties, it was common that demoparties (more commonly called "copyparties" at this time) were organized by large demogroups. Because of this, and the fact that Deadline wasn't particularly well known, Mr. Skjefstad suggested that the group Crusaders should be involved. At this time, The Crusaders was one of Norway's most popular Amiga groups. Partly because of their music disks, but also because of their diskmag, the Crusaders Eurochart. At first, Crusaders weren't too keen on the idea of organizing a party, but when Mr. Skjefstad reminded them about the fact that they always complained about the other parties of the same sort, and that this was their chance to show everyone how it should be done, which caused the Crusaders to agree.
After briefly considering having the party during the fall of 1991, it was decided that Easter would be better. All schools are closed during Easter week and the period from Maundy Thursday to Easter Monday are official holidays in Norway. This meant that most of the target audience would have time off to attend TG, and all organizers and crew could work full-time with TG with a minimum usage of vacation days.
1992–1995
In 1992, 1100 people gathered in Skedsmohallen at Lillestrøm, way more than the expected count of about 800. The following years, TG continued to grow. In 1993 Skedsmohallen again was the venue with 1400 people visiting the party. This was more than the capacity of the venue, making it clear that a bigger venue was required. In 1994 the venue was Rykkinnhallen in Bærum, and the visitor count had risen to 1800 - again more than the venue could hold, which led to intervention by the local fire department who banned indoor sleeping. Consequently, the organizers had to hire a large construction tent and some heavy duty heating equipment (there was still snow on the ground).
No bigger venue could be found and this may have been one reason why Skjefstad and The Crusaders declined to arrange the party in 1995. A group from Stavanger led by Magnar Harestad proposed to host the party instead, and got approval and some backing from the TG crew. They hired Stavanger Ishall, "Siddishallen" and the party was renamed "Gathering 95". However, this caused a sharp drop in attendance, barely 500 people attended, not even filling the hall to half capacity. This may have been due to moving the event away from the Eastern, more densely populated part of No |
https://en.wikipedia.org/wiki/System%206 | System 6 (or System Software 6) is a graphical user interface-based operating system for Macintosh computers, made by Apple Computer. It was released in 1988, and is part of the classic Mac OS series. It is a monolithic operating system, with cooperative multitasking based on an improved MultiFinder. The boxed version cost , and it was included with all new Macintosh computers until 1991, when it was succeeded by System 7.
Overview
MacroMaker
The MacroMaker utility was introduced in System 6. It records mouse and keyboard input as macros, and has a unique user interface intended to look and act like a tape recorder. MacroMaker was criticized for its lack of features when compared to Microsoft's AutoMac III, which was already available commercially. As MacroMaker records only the locations of mouse-clicks inside windows and not what is being clicked on or exactly when, it can not be used to automate actions in more sophisticated programs. The pre-recorded clicks miss buttons if the buttons had moved since the recording, or if they failed to appear upon playback. It records the start and end locations of mouse movements, but does not track the precise path of a movement or support pauses. MacroMaker is not compatible with System 7, in which it is succeeded by AppleScript.
Multitasking
Macintosh gained cooperative multitasking in March 1985 with Andy Hertzfeld's Switcher, which can switch between multiple full-screen applications. It was not integrated, and was only sold separately by Apple. Not many programs and features function correctly with Switcher, and it does not share the screen between applications simultaneously. Systems 5 and 6 have MultiFinder instead, which is much more mature and widely used in System 6. With MultiFinder, the Finder does not quit to free resources, and the system behaves as in the still-familiar multitasking fashion, with the desktop and other applications' windows in the background.
Hardware support
System 6 includes support for the Apple ImageWriter LQ and PostScript laser printers. New software drivers allow the ImageWriter LQ to be used on AppleTalk local area networks and supports the use of tabloid or B-size paper (). System 6 includes QuickerGraf (originally QuickerDraw), system software used to accelerate the drawing of color images on the Macintosh II. It was licensed to Apple and Radius Inc. by its programmer, Andy Hertzfeld.
Limitations
In comparison to the NeXTSTEP operating system of the time, System 6 does not make much use of sound, and its user interface is limited in file management and window displays. System 6's Apple menu cannot be used to launch applications. The icon in the upper right-hand corner of the menu bar simply shows the open application and is not a menu. System 6 supports 24 bits of addressable RAM (random-access memory), which allows for a maximum of 8 megabytes of RAM, with no provision for virtual memory. These limitations were removed in System 7. System 6's version of the HFS |
https://en.wikipedia.org/wiki/PIRCH%20%28IRC%20client%29 | PIRCH or pIRCh is a shareware Internet Relay Chat (IRC) client published by Northwest Computer Services. Its name is an acronym – PolarGeek's IRC Hack.
The last version of the program, known as PIRCH98, was released in 1998. PIRCH has in the past been considered to be the number-two Windows IRC client behind mIRC.
PIRCH inspired the creation of Vortec IRC due to a lack of software updates.
Reception
Forrest Stroud's 1998 review of Pirch stated it has "great selection of features and is an IRC client that will especially appeal to novice IRC users", such as the capability of simultaneous multiple server connections. But Stroud noted, "PIRCH is relatively slow in listing channels for servers and also lacks the capability to filter the number of channels based on the number of users or the ability to sort based on the name of a channel".
In 1999, Joe Barr of LinuxWorld referred to Pirch as a "nice Windows client".
See also
Comparison of Internet Relay Chat clients
References
External links
PIRCH FAQ
Year of introduction missing
Discontinued software
Windows Internet Relay Chat clients
Windows-only shareware |
https://en.wikipedia.org/wiki/Datapoint%27s%20Advanced%20Systems%20Language | DASL (Datapoint's Advanced Systems Language) was a programming language and compiler proprietary to Datapoint. Primarily influenced by Pascal with some C touches, it was created in the early 1980s by Gene Hughes.
The compiler output was assembly language, which was typically processed through a peep-hole optimizer before the assembler and linker.
Reflecting its name, DASL was used for systems programming, mainly by the vendor itself.
External links & References
The Dasl Document
Systems programming languages |
https://en.wikipedia.org/wiki/Solid%20modeling | Solid modeling (or solid modelling) is a consistent set of principles for mathematical and computer modeling of three-dimensional shapes (solids). Solid modeling is distinguished within the broader related areas of geometric modeling and computer graphics, such as 3D modeling, by its emphasis on physical fidelity. Together, the principles of geometric and solid modeling form the foundation of 3D-computer-aided design and in general support the creation, exchange, visualization, animation, interrogation, and annotation of digital models of physical objects.
Overview
The use of solid modeling techniques allows for the automation process of several difficult engineering calculations that are carried out as a part of the design process. Simulation, planning, and verification of processes such as machining and assembly were one of the main catalysts for the development of solid modeling. More recently, the range of supported manufacturing applications has been greatly expanded to include sheet metal manufacturing, injection molding, welding, pipe routing, etc. Beyond traditional manufacturing, solid modeling techniques serve as the foundation for rapid prototyping, digital data archival and reverse engineering by reconstructing solids from sampled points on physical objects, mechanical analysis using finite elements, motion planning and NC path verification, kinematic and dynamic analysis of mechanisms, and so on. A central problem in all these applications is the ability to effectively represent and manipulate three-dimensional geometry in a fashion that is consistent with the physical behavior of real artifacts. Solid modeling research and development has effectively addressed many of these issues, and continues to be a central focus of computer-aided engineering.
Mathematical foundations
The notion of solid modeling as practised today relies on the specific need for informational completeness in mechanical geometric modeling systems, in the sense that any computer model should support all geometric queries that may be asked of its corresponding physical object. The requirement implicitly recognizes the possibility of several computer representations of the same physical object as long as any two such representations are consistent. It is impossible to computationally verify informational completeness of a representation unless the notion of a physical object is defined in terms of computable mathematical properties and independent of any particular representation. Such reasoning led to the development of the modeling paradigm that has shaped the field of solid modeling as we know it today.
All manufactured components have finite size and well behaved boundaries, so initially the focus was on mathematically modeling rigid parts made of homogeneous isotropic material that could be added or removed. These postulated properties can be translated into properties of regions, subsets of three-dimensional Euclidean space. The two common approaches to |
https://en.wikipedia.org/wiki/Paradigm%20%28disambiguation%29 | A paradigm, in science and epistemology, is a distinct concept or thought pattern.
Paradigm may also refer to:
Science and medicine
Paradigm, an experimental setup
Programming paradigm, a style of programming, usually enforced by the programming language used
Minimed Paradigm, an insulin pump made by Minimed/Medtronic
Linguistic paradigm, the complete set of inflectional forms of a word.
Algorithmic paradigm, a common generic method which underlies the designs of a class of algorithms
Books and publishing
Paradigm (comics), a character in the Marvel Comics
Paradigm (Image Comics), an independent comic book series
Paradigm (publisher), a Japanese publishing company
Paradigm Publishing, the post-secondary division of EMC Publishing, LLC
Other uses
Paradigm Concepts, a small-press role-playing game publishing company
Paradigm Entertainment, a video game studio
Paradigm High School, a high school in South Jordan, Utah
Paradigm Secure Communications, provider of satellite communications to the UK Ministry of Defence
Paradigm Talent Agency, a talent and literary agency headquartered in Beverly Hills, CA
Paradigm City, the setting of the anime series Big O
V-STOL Pairadigm, an American aircraft design (intentional misspelling)
Paradigm (video game), a point-and-click adventure video game
"Paradigm", a song by Northlane from the 2019 album Alien
See also
Paradigm shift, a change in the basic assumptions of science
Paradigm Shift (disambiguation)
Paradigmatic analysis, in semiotics the analysis of paradigms embedded in a text |
https://en.wikipedia.org/wiki/Bi-quinary%20coded%20decimal | Bi-quinary coded decimal is a numeral encoding scheme used in many abacuses and in some early computers, including the Colossus. The term bi-quinary indicates that the code comprises both a two-state (bi) and a five-state (quinary) component. The encoding resembles that used by many abacuses, with four beads indicating the five values either from 0 through 4 or from 5 through 9 and another bead indicating which of those ranges (which can alternatively be thought of as +5).
Several human languages, most notably Fula and Wolof also use biquinary systems. For example, the Fula word for 6, jowi e go'o, literally means five [plus] one. Roman numerals use a symbolic, rather than positional, bi-quinary base, even though Latin is completely decimal.
The Korean finger counting system Chisanbop uses a bi-quinary system, where each finger represents a one and a thumb represents a five, allowing one to count from 0 to 99 with two hands.
One advantage of one bi-quinary encoding scheme on digital computers is that it must have 2 bits set (one in the binary field and one in the quinary field), providing a built in checksum to verify if the number is valid or not. (Stuck bits happened frequently with computers using mechanical relays.)
Examples
Several different representations of bi-quinary coded decimal have been used by different machines. The two-state component is encoded as one or two bits, and the five-state component is encoded using three to five bits. Some examples are:
Roman and Chinese abacuses
Stibitz relay calculators at Bell Labs from Model II onwards
FACOM 128 relay calculators at Fujitsu
IBM 650 – seven bits
Two bi bits: 0 5 and five quinary bits: 0 1 2 3 4, with error checking.
Exactly one bi bit and one quinary bit is set in a valid digit. In the pictures of the front panel below and in close-up, the bi-quinary encoding of the internal workings of the machine are evident in the arrangement of the lights – the bi bits form the top of a T for each digit, and the quinary bits form the vertical stem.
(the machine was running when the photograph was taken and the active bits are visible in the close-up and just discernible in the full panel picture)
Remington Rand 409 - five bits
One quinary bit (tube) for each of 1, 3, 5, and 7 - only one of these would be on at the time.
The fifth bi bit represented 9 if none of the others were on; otherwise it added 1 to the value represented by the other quinary bit.
(sold in the two models UNIVAC 60 and UNIVAC 120)
UNIVAC Solid State – four bits
One bi bit: 5, three binary coded quinary bits: 4 2 1 and one parity check bit
UNIVAC LARC – four bits
One bi bit: 5, three Johnson counter-coded quinary bits and one parity check bit
See also
Binary-coded decimal
Binary number
Chisanbop
Finger binary
Quinary
Two-out-of-five code
FACOM 128
References
Further reading
(NB. Supersedes MIL-HDBK-231(AS) (1970-07-01).)
Computer arithmetic
Numeral systems |
https://en.wikipedia.org/wiki/Cyberchase | Cyberchase is an animated sci-fi children's television series that airs on PBS Kids. The series centers around three children from Earth: Jackie, Matt and Inez, who are brought into Cyberspace, a digital universe, in order to protect the world from the villainous Hacker (Christopher Lloyd). They are able to prevent Hacker from taking over Cyberspace by means of problem-solving skills in conjunction with basic math, environmental science and wellness. In Cyberspace, they meet Digit (Gilbert Gottfried (seasons 1-13), Ron Pardo (season 14)), a "cybird" who helps them on their missions.
Cyberchase was created by WNET New York and premiered on PBS Kids on January 21, 2002. In 2010, after the season 8 finale, Cyberchase went on hiatus, but it returned in 2013 for a ninth season, followed by a tenth season in 2015. The eleventh season premiered on October 23, 2017, and the twelfth season premiered on April 19, 2019.
A thirteenth season was announced on October 19, 2020, and premiered on February 25, 2022. A fourteenth season premiered on April 21, 2023.
Plot
Motherboard is the "brain of the giant computer system that oversees all of Cyberspace". Her technician computer scientist, Dr. Marbles, kept her functioning properly until his assistant, the Hacker, turned against them. Dr. Marbles drained Hacker's battery and banished him to the Northern Frontier, where he formulated a plan to launch a virus that would attack Motherboard.
When Jackie, Matt and Inez interact with a library map in the real world, they accidentally allow Hacker access to Motherboard and she becomes infected with the virus. The kids are brought into Cyberspace and join forces with Digit, a creation of the Hacker who escaped his control. Together they protect the world from the Hacker and his clumsy, accident-prone assistants, Buzz and Delete, until they can recover the Encryptor Chip, a device stolen by Hacker that can nullify the virus and bring Motherboard back to full strength.
Cyberspace consists of planet-like bodies called Cybersites, with each site having a theme such as Ancient Egypt, the American Old West, Greek mythology and amusement parks. These sites represent the diversity of websites on the Internet and reflect the many ecosystems and neighborhoods of the Earth. The Cybersquad travels to many of these locations in order to protect them from Hacker and each inhabited Cybersite has a unique type of Cybercitizen they interact with.
Characters
Main
Hacker (also known as The Hacker) (voiced by Christopher Lloyd) is a mad scientist bent on taking over/creating ultimate chaos for Cyberspace, but he is almost always thwarted by the Cybersquad. Hacker was originally created by Dr. Marbles to assist Motherboard, but he rebelled and was exiled to the Northern Frontier. Nevertheless, he does have the potential to become good again, as shown in two episodes where he became a peaceful artist (temporarily) and when he helped the Cybersquad protect the trees in the Northern Fro |
https://en.wikipedia.org/wiki/CHAIN | CHAIN may refer to:
CHAIN (industry standard), an acronym for Ceced Home Appliances Interoperating Network, a standard for a multi-brands home network of interactive household appliances.
Controlled and Harmonised Aeronautical Information Network, a concept of EUROCONTROL to improve the quality of aeronautical data.
Canadian High Arctic Ionospheric Network, an array of ground-based radio instruments
See also
Chain (disambiguation) |
https://en.wikipedia.org/wiki/DASL | DASL may mean:
Datapoint's Advanced Systems Language
Distributed Application Specification Language, developed by Sun Microsystems
DAV Searching and Locating, a WebDAV project
Director of American Sign Language |
https://en.wikipedia.org/wiki/Sprite%20%28operating%20system%29 | Sprite is an experimental Unix-like distributed operating system developed at the University of California, Berkeley by John Ousterhout's research group between 1984 and 1992. Its notable features include support for single system image on computer clusters and the introduction of the log-structured filesystem. The Tcl scripting language also originated in this project.
Early work
Early work on Sprite was based on the idea of making the operating system more "network aware", and thereby at the same time make it invisible to the user. The primary area of work was the building of a new network file system which made heavy use of local client-side caching in order to improve performance. After opening the file and some initial reads, the network is only used on-demand, and most user actions occur against the cache. Similar utilities allow remote devices to be mapped into the local computer's space, allowing for network printing and similar duties.
Many of the key Unix files are based on the network, including things like the password file. All machines in a network share the root directory as well. Other common Unix utilities such as finger were re-written to make them network aware as well, listing all of the people logged on across the network. This makes a Sprite network appear as if it were a single large time-sharing system, or a single-system image.
Another key addition to Sprite is process migration, which allows programs to be moved between machines at any time. The system maintains a list of machines and their state, and automatically moves processes to idle machines to improve local performance. Processes can also be "evicted" from machines to improve their performance, causing the original starter to move it to another machine on the network, or take control of it locally again. Long tasks (like compiling the Sprite system) can appear very fast.
Further development
Work on the "early" Sprite outlined above ended around 1987, but was improved during the next year. Starting in 1990 Sprite was used as the basis for development of the first log-structured file system (LFS), development of which continued until about 1992. LFS dramatically increases the performance of file writes at the expense of read performance. Under Sprite, this tradeoff is particularly useful because most read access is cached anyway—that is, Sprite systems typically perform fewer reads than a normal Unix system. LFS-like systems also allow for much easier crash recovery, which became a major focus of the project during this period. Additional experimentation on striped file systems, both striped across different machines as well as clusters of drives, continued until about 1994.
Discontinuation
Sprite was not a microkernel system, and suffers the same sort of problems as other Unixes in terms of development complexity, becoming increasingly difficult to develop as more functionality was added. By the 1990s it was suffering and the small team supporting the proje |
https://en.wikipedia.org/wiki/Rotation%20%28disambiguation%29 | Rotation is a circular motion of a body about a center.
Rotation may also refer to:
Science, mathematics and computing
Rotation (anatomy)
Rotation (mathematics)
Rotation (medicine), medical student training
Rotation (physics), ratio between a given angle and a full turn of 2π radians
Bitwise rotation, a mathematical operator on bit patterns
Curl (mathematics), a vector operator
Differential rotation, objects rotating at different speeds
Display rotation, of a computer monitor or display
Earth's rotation
Improper rotation or rotoreflection, a rotation and reflection in one
Internal rotation, a term in anatomy
Optical rotation, rotation acting on polarized light
Rotation around a fixed axis
Rotational spectroscopy, a spectroscopy technique
Tree rotation, a well-known method used in order to make a tree balanced.
Arts, entertainment, and media
Music
Rotation (Cute Is What We Aim For album), 2008
Rotation (Joe McPhee album), 1977
Rotation (music), the repeated airing of a limited playlist of songs on a radio station
"Rotate" (song), a song on the album Channel 10 by Capone-N-Noreaga
"Rotation", a song on the 1979 album Rise by Herb Alpert
"Rotation (LOTUS-2)", a song on the 2000 album Philosopher's Propeller by Susumu Hirasawa
Other uses in arts, entertainment, and media
Rotation (film), a 1949 East German film
Rotation (pool), a type of pocket billiards game
Politics
Rotation government, the practice of a government switching Prime Ministers mid-term from an individual in one political party to a different individual in another political party
Other uses
Rotation (aviation), the act of lifting the nose off the runway during takeoff
Rotation, in baseball pitching; see the glossary of baseball
Crop rotation, a farming practice
Job rotation, a business management technique
Robson Rotation, a method of having ballot papers in elections
Stock rotation, a retail practice
See also
Rotator (disambiguation) |
https://en.wikipedia.org/wiki/Stanford%20University%20School%20of%20Engineering | Stanford University School of Engineering is one of the schools of Stanford University. The current dean is Jennifer Widom, the former senior associate dean of faculty affairs and computer science chair. She is the school's 10th dean.
Organization and academics
The school of engineering was established in 1925, when Stanford organized the previously independent academic departments into a school. The original departments in the school were:
Civil engineering, one of the original university departments (1891), later to become civil and environmental engineering
Electrical engineering, taught as a subject prior to being established as a department in 1894
Mechanical engineering, one of the original university departments (1891)
Mining and metallurgy, established in 1918 and eventually disbanded in 1945
Departments added afterwards
Aeronautics and astronautics, started as aeronautical engineering in 1958
Chemical engineering in 1961 (split from chemistry)
Computer science, established in 1965 in the school of humanities and sciences, but moved to the school of engineering in 1985
Materials science and engineering in 1961 (originally known as materials science)
Management science and engineering in the 1950s (originally industrial engineering)
Bioengineering in 2002
Current departments at the school
Aeronautics and astronautics
Bioengineering and chemical engineering (also in the School of Medicine)
Chemical engineering
Civil and environmental engineering
Computer science
Stanford Department of Electrical Engineering
Materials science and engineering
Management science and engineering
Mechanical engineering
In addition, the Institute for Computational and Mathematical Engineering is an interdisciplinary program.
List of deans
Theodore J. Hoover (1925–1936)
Samuel B. Morris (1936–1944)
Frederick E. Terman (1944–1958)
Joseph M. Pettit (1958–1972)
William M. Kays (1972–1984)
James F. Gibbons (1984–1996)
John L. Hennessy (1996–1999)
James D. Plummer (1999–2014)
Persis Drell (2014–2016)
Thomas Kenny (interim dean) (2016–2017)
Jennifer Widom (2017–current)
Department of Electrical Engineering
The Stanford Department of Electrical Engineering, also known as EE; Double E, is a department at Stanford University. Established in 1894, it is one of nine engineering departments that comprise the school of engineering, and in 1971, had the largest graduate enrollment of any department at Stanford University. The department is currently located in the David Packard Building on Jane Stanford Way in Stanford, California.
History
Early developments (1800s-1940s)
Stanford University opened in 1891, and within the year, courses addressing topics such as electrical currents and magnetism were being taught by professors such as A.P. Carman. Professor Frederic A.C. Perrine was the first faculty to teach the subject of electrical engineering at Stanford, in 1893. In 1983, when F.A.C. Perrine was appointed Stanford's first profes |
https://en.wikipedia.org/wiki/List%20of%20alternative%20shells%20for%20Windows | This is a list of software that provides an alternative graphical user interface for Microsoft Windows operating systems. The technical term for this interface is a shell. Windows' standard user interface is the Windows shell; Windows 3.0 and Windows 3.1x have a different shell, called Program Manager. The programs in this list do not restyle the Windows shell, but replace it; therefore, they look and function differently, and have different configuration options.
See also
Comparison of Start menu replacements for Windows 8
Comparison of X Window System desktop environments
Desktop environment
History of the graphical user interface
Microsoft Bob
Removal of Internet Explorer
References
External links
Desktop shell replacement
Computing-related lists |
https://en.wikipedia.org/wiki/Trans-European%20Networks | The Trans-European Networks (TEN) were created by the European Union by Articles 154–156 of the Treaty of Rome (1957), with the stated goals of the creation of an internal market and the reinforcement of economic and social cohesion. To various supporters of this policy, it made little sense to talk of a big EU market, with freedom of movement within it for goods, persons and services, unless the various regions and national networks making up that market were properly linked by modern and efficient infrastructure. The construction of Trans-European Networks was also seen as an important element for economic growth and the creation of employment.
The Treaty Establishing the European Community first provided a legal basis for the TENs. Under the terms of Chapter XV of the Treaty (Articles 154, 155 and 156), the European Union must aim to promote the development of Trans-European Networks as a key element for the creation of the Internal Market and the reinforcement of Economic and Social Cohesion. This development includes the interconnection and interoperability of national networks as well as access to such networks.
According with these objectives, the European Commission developed guidelines covering the objectives, priorities, identification of projects of common interest and broad lines of measures for the three sectors concerned (Transports, Energy and Telecommunications). The European Parliament and the Council approved these guidelines after consultation with the Economic and Social Committee and the Committee of the Regions.
Many projects of common interest have benefited from financial support of the European Union budget through the TEN-budget line as well as the Structural Funds and Cohesion Fund. The European Investment Bank has also greatly contributed to the financing of these projects through loans.
Three classes of network were defined by the treaty:
Trans-European Transport Networks (TEN-T)
Trans-European Energy Networks (TEN-E or TEN-Energy)
Trans-European Telecommunications Networks (eTEN)
References
Some paragraphs from EUROPA: Trans-European Networks; the information on the EUROPA site is subject to a disclaimer and a copyright notice. As a general rule and unless otherwise indicated, the information available on the site may be reproduced on condition that the source is acknowledged.
See also
Trans-European Transport Network (TEN-T)
Trans-European Transport Network Executive Agency (TEN-T EA)
Trans-European Combined Transport network
Trans-European Rail network
Trans-European conventional rail network
Trans-European high-speed rail network (TEN-R)
Trans-European Inland Waterway network
Trans-European road network (TERN)
Trans-European Airport network
Trans-European Seaport network
Archives of Trans European Networks at the Historical Archives of the EU
Economy of the European Union
Transport and the European Union |
https://en.wikipedia.org/wiki/Daemon%20%28computing%29 | In multitasking computer operating systems, a daemon ( or ) is a computer program that runs as a background process, rather than being under the direct control of an interactive user. Traditionally, the process names of a daemon end with the letter d, for clarification that the process is in fact a daemon, and for differentiation between a daemon and a normal computer program. For example, is a daemon that implements system logging facility, and is a daemon that serves incoming SSH connections.
In a Unix environment, the parent process of a daemon is often, but not always, the init process. A daemon is usually created either by a process forking a child process and then immediately exiting, thus causing init to adopt the child process, or by the init process directly launching the daemon. In addition, a daemon launched by forking and exiting typically must perform other operations, such as dissociating the process from any controlling terminal (tty). Such procedures are often implemented in various convenience routines such as daemon(3) in Unix.
Systems often start daemons at boot time that will respond to network requests, hardware activity, or other programs by performing some task. Daemons such as cron may also perform defined tasks at scheduled times.
Terminology
The term was coined by the programmers at MIT's Project MAC. According to Fernando J. Corbató, who worked on Project MAC in 1963, his team was the first to use the term daemon, inspired by Maxwell's demon, an imaginary agent in physics and thermodynamics that helped to sort molecules, stating, "We fancifully began to use the word daemon to describe background processes that worked tirelessly to perform system chores". Unix systems inherited this terminology. Maxwell's demon is consistent with Greek mythology's interpretation of a daemon as a supernatural being working in the background.
In the general sense, daemon is an older form of the word "demon", from the Greek δαίμων. In the Unix System Administration Handbook Evi Nemeth states the following about daemons:
A further characterization of the mythological symbolism is that a daemon is something that is not visible yet is always present and working its will. In the Theages, attributed to Plato, Socrates describes his own personal daemon to be something like the modern concept of a moral conscience: "The favour of the gods has given me a marvelous gift, which has never left me since my childhood. It is a voice that, when it makes itself heard, deters me from what I am about to do and never urges me on".
In modern usage in the context of computer software, the word daemon is pronounced or .
Alternative terms for daemon are service (used in Windows, from Windows NT onwards, and later also in Linux), started task (IBM z/OS), and ghost job (XDS UTS).
After the term was adopted for computer use, it was rationalized as a backronym for Disk And Execution MONitor.
Daemons that connect to a computer network are examples of ne |
https://en.wikipedia.org/wiki/Ibusuki%20District%2C%20Kagoshima | was a district located in Kagoshima Prefecture, Japan.
As of June 30, 2005 population data (following the January 1, 2006 merger), the district had an estimated population of 14,761 and a density of 134 persons per km2. The total area was 110.31 km2.
The day before the dissolution on November 30, 2007, the district had only one town:
District Timeline
On October 15, 1956 - the village of Kiire was elevated to town status.
On November 1, 2004 - the town of Kiire, along with the towns of Kōriyama and Matsumoto (both from Hioki District), and the towns of Sakurajima and Yoshida (both from Kagoshima District), was merged with the expanded city of Kagoshima.
On January 1, 2006 - the towns of Kaimon and Yamagawa were merged into the expanded city of Ibusuki.
On December 1, 2007 - the town of Ei, along with the towns of Chiran and Kawanabe (both from Kawanabe District), was merged to create the city of Minamikyūshū. Ibusuki District was dissolved as a result of this merger.
References
Japanese Wikipedia article on Ibusuki District
Former districts of Kagoshima Prefecture |
https://en.wikipedia.org/wiki/Pointer%20%28computer%20programming%29 | In computer science, a pointer is an object in many programming languages that stores a memory address. This can be that of another value located in computer memory, or in some cases, that of memory-mapped computer hardware. A pointer references a location in memory, and obtaining the value stored at that location is known as dereferencing the pointer. As an analogy, a page number in a book's index could be considered a pointer to the corresponding page; dereferencing such a pointer would be done by flipping to the page with the given page number and reading the text found on that page. The actual format and content of a pointer variable is dependent on the underlying computer architecture.
Using pointers significantly improves performance for repetitive operations, like traversing iterable data structures (e.g. strings, lookup tables, control tables and tree structures). In particular, it is often much cheaper in time and space to copy and dereference pointers than it is to copy and access the data to which the pointers point.
Pointers are also used to hold the addresses of entry points for called subroutines in procedural programming and for run-time linking to dynamic link libraries (DLLs). In object-oriented programming, pointers to functions are used for binding methods, often using virtual method tables.
A pointer is a simple, more concrete implementation of the more abstract reference data type. Several languages, especially low-level languages, support some type of pointer, although some have more restrictions on their use than others. While "pointer" has been used to refer to references in general, it more properly applies to data structures whose interface explicitly allows the pointer to be manipulated (arithmetically via ) as a memory address, as opposed to a magic cookie or capability which does not allow such. Because pointers allow both protected and unprotected access to memory addresses, there are risks associated with using them, particularly in the latter case. Primitive pointers are often stored in a format similar to an integer; however, attempting to dereference or "look up" such a pointer whose value is not a valid memory address could cause a program to crash (or contain invalid data). To alleviate this potential problem, as a matter of type safety, pointers are considered a separate type parameterized by the type of data they point to, even if the underlying representation is an integer. Other measures may also be taken (such as validation & bounds checking), to verify that the pointer variable contains a value that is both a valid memory address and within the numerical range that the processor is capable of addressing.
History
In 1955, Soviet Ukrainian computer scientist Kateryna Yushchenko invented the Address programming language that made possible indirect addressing and addresses of the highest rank – analogous to pointers. This language was widely used on the Soviet Union computers. However, it was unknown ou |
https://en.wikipedia.org/wiki/Pyramid%20Technology | Pyramid Technology Corporation was a computer company that produced a number of RISC-based minicomputers at the upper end of the performance range. It was based in the San Francisco Bay Area of California
They also became the second company to ship a multiprocessor UNIX system (branded DC/OSx), in 1985, which formed the basis of their product line into the early 1990s. Pyramid's OSx was a dual-universe UNIX which supported programs and system calls from both 4.xBSD and AT&T's UNIX System V.
History
Pyramid Technology was formed in 1981 by a number of ex-Hewlett-Packard employees, who were interested in building first-rate minicomputers based on RISC designs.
In March 1995 Pyramid was bought by Siemens AG and merged into their Siemens Computer Systems US unit. In 1998 this unit was split, with the services side of the operation becoming Wincor Nixdorf. In 1999 Siemens and Fujitsu merged their computer operations to form Fujitsu Siemens Computers, and finally Amdahl was added to the mix in 2000.
Products
90x
The first Pyramid Technology series of minicomputers was released in August 1983 as the 90x superminicomputer, which used their custom 32-bit scalar processor running at 8 MHz.
Although the architecture was marketed as a RISC machine, it was actually microprogrammed. It used a "sliding window" register model based on the Berkeley RISC processor, but memory access instructions had complex operation modes that could require many cycles to run. Many register-to-register scalar instructions were executed in a single machine cycle. Initially, floating point instructions were executed totally in microcode, although an optional floating point unit on a separate circuit board was released later. Microprogramming also allowed other non-RISC luxuries such as block move instructions.
Programs had access to 64 registers, and many instructions were triadic. Sixteen registers (registers 48 to 63) were referred to as "global registers" and they correspond to the registers of a typical CPU, in that they are static and always visible. The other 48 registers were actually the top of the subroutine stack. Thirty-two of them (0–31) were local registers for the current subroutine, and registers 32–47 were used to pass up to 16 parameters to the next subroutine called. During a subroutine call, the register stack moved up 32 words, so the caller's registers 32–47 became the called subroutine's registers 0–15. The return instruction dropped the stack by 32 words so return parameters would be visible to the caller in registers 32–47. The stack cache held 16 levels in the CPU and stack overflow and underflow was automatically handled by the microcode of the CPU. The programming model had two stacks, one for the register stack, and one for subroutine local variables. One grew up from a designated address in the middle of the address space, and the other grew down from the top of the user mode address space.
The 90x could accommodate four memory boards, initiall |
https://en.wikipedia.org/wiki/Ms.%20Pac-Man | is a 1982 maze arcade video game developed by General Computer Corporation and published by Midway. It is the first sequel to Pac-Man (1980) and the first entry in the series to not be made by Namco. Controlling the title character, Pac-Man's wife, the player is tasked with eating all of the pellets in an enclosed maze while avoiding four colored ghosts. Eating the larger "power pellets" lets the player eat the ghosts, who turn blue and flee.
General Computer made the game as a modification kit for the original Pac-Man, titled Crazy Otto. However, due to previous legal action with Atari, GCC was forced to present the project to Midway, the North American distributor of Pac-Man. Midway purchased the project and enlisted GCC to use the game as a basis for the sequel to Pac-Man. Multiple names were considered for the game, including Miss Pac-Man and Mrs. Pac-Man, before the final name was chosen for being easier to pronounce. While development had started without Namco's consent, company president Masaya Nakamura was brought in and provided feedback on the player character's design. The company ultimately collected the same royalties on each cabinet as they had with Pac-Man.
Ms. Pac-Man was acclaimed by critics for its improvements to the original gameplay and for having a female protagonist; some have described it as superior to Pac-Man. It has been listed among the greatest video games of all time and as one of the most successful American arcade games ever made. The game's success inspired a variety of successful merchandise, several ports for numerous home consoles and handheld systems, a television cartoon that included Pac-Man, and numerous video game sequels and remakes that spawned a Ms. Pac-Man video game spin-off series. The rights to the game are owned by Namco's successor company, Bandai Namco Entertainment. However, the game and its title character have suffered various legal ownership issues between Namco and General Computer Corporation.
Gameplay
The gameplay is very similar to that of Pac-Man. The player earns points by eating pellets and avoiding ghosts (contact with one causes Ms. Pac-Man to lose a life). Eating an energizer (or "power pellet") causes the ghosts to turn blue, allowing them to be eaten for extra points. Bonus fruits can be eaten for increasing point values, twice per round. As the rounds increase, the speed increases, and energizers generally lessen the duration of the ghosts' vulnerability, eventually stopping altogether.
Differences from the original Pac-Man
The game has four mazes that appear in different color schemes and alternate after each of the game's intermissions are seen. The pink maze appears in levels one and two; the light blue maze appears in levels three, four, and five; the brown maze appears in levels six to nine; and the dark blue maze appears in levels 10 to 14. After level 14, the maze configurations alternate every fourth level.
The first, second, and fourth mazes have two sets of warp |
https://en.wikipedia.org/wiki/State%20highways%20in%20California | The state highway system of the U.S. state of California is a network of highways that are owned and maintained by the California Department of Transportation (Caltrans).
Each highway is assigned a Route (officially State Highway Route) number in the Streets and Highways Code (Sections 300–635). Most of these are numbered in a statewide system, and are known as State Route X (abbreviated SR X). United States Numbered Highways are labeled US X, and Interstate Highways are Interstate X. Under the code, the state assigns a unique Route X to each highway, and does not differentiate between state, US, or Interstate highways.
The California Highway Patrol (CHP) is tasked with patrolling all state highways to enforce traffic laws.
Overview
California's highway system is governed pursuant to Division 1 of the California Streets and Highways Code, which is one of the 29 California Codes enacted by the state legislature. Since July 1 of 1964, the majority of legislative route numbers, those defined in the Streets and Highways Code, match the sign route numbers. For example, Interstate 5 is listed as "Route 5" in the code.
On the other hand, some short routes are instead signed as parts of other routes — for instance, Route 112 and Route 260 are signed as part of the longer State Route 61, and Route 51 is part of Interstate 80 Business.
Concurrences are not explicitly codified in the Streets and Highways Code; such highway segments are listed on only one of the corresponding legislative route numbers — for example, the I-80/I-580 concurrency, known as the Eastshore Freeway, only falls under the Route 80 description in the highway code while the definition of Route 580 is broken into non-contiguous segments.
The state may relinquish segments of highways and turn them over to local control. If the relinquished segment is in the middle of the highway's route, the local jurisdiction is usually required to install and maintain signs directing drivers to the continuation of that highway; they are not generally required to do so if the relinquishment effectively truncates the highway at one end, or is done as part of the process to re-route a highway. The state may also delete a highway completely and turn over an entire state route to local control.
Business routes are not maintained by the state unless they are also assigned legislative route numbers. A route or sections of a route may also be considered unrelinquished - a new alignment has been built, or the legislative definition has changed to omit the section, but the state still owns the roadway — and are officially Route XU. For example, State Route 14U is an old alignment of State Route 14 whose control has not yet been transferred to the City of Santa Clarita.
Some new alignments are considered supplemental and have a suffix of S. For example, an expressway replacement for State Route 86 between approximately three miles north of the Imperial/Riverside County line and Interstate 10 east of Indi |
https://en.wikipedia.org/wiki/Su%20%28Unix%29 | The Unix command , which stands for 'substitute user' (or historically 'superuser'), is used by a computer user to execute commands with the privileges of another user account. When executed it invokes a shell without changing the current working directory or the user environment.
When the command is used without specifying the new user id as a command line argument, it defaults to using the superuser account (user id 0) of the system.
History
The command , including the Unix permissions system and the setuid system call, was part of Version 1 Unix. Encrypted passwords appeared in Version 3. 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 was removed from GNU coreutils as of release 8.18 (2012-08-12) and is currently included in the util-linux package.
Usage
When run from the command line, su asks for the target user's password, and if authenticated, grants the operator access to that account and the files and directories that account is permitted to access.
john@localhost:~$ su jane
Password:
jane@localhost:/home/john$ exit
logout
john@localhost:~$
When used with a hyphen () it can be used to start a login shell. In this mode users can assume the user environment of the target user.
john@localhost:~$ su - jane
Password:
jane@localhost:~$
The command sudo is related, and executes a command as another user but observes a set of constraints about which users can execute which commands as which other users (generally in a configuration file named , best editable by the command ). Unlike , authenticates users against their own password rather than that of the target user (to allow the delegation of specific commands to specific users on specific hosts without sharing passwords among them and while mitigating the risk of any unattended terminals).
Some Unix-like systems implement the user group wheel, and only allow members to become root with . This may or may not mitigate these security concerns, since an intruder might first simply break into one of those accounts. GNU , however, does not support the group wheel for philosophical reasons. Richard Stallman argues that because the group would prevent users from utilizing root passwords leaked to them, the group would allow existing admins to ride roughshod over ordinary users.
See also
Unix security
List of Unix commands
Comparison of privilege authorization features
Further reading
References
External links
su – manual pages from GNU coreutils.
The su command – by The Linux Information Project (LINFO) ()
Unix user management and support-related utilities
System administration |
https://en.wikipedia.org/wiki/Value%20transfer%20system | A value transfer system refers to any system, mechanism, or network of people that receives money for the purpose of making the funds or an equivalent value payable to a third party in another geographic location, whether or not in the same form.
The average size of the payment is an indicator of the system's use. Specialised large-value transfer system have developed because of the large size and critical timing of some payments market participants require services and mechanisms that meet their need for reliability, security, accuracy and timeliness.
A value transfer system may fall into one or more of these groups:
Retail value transfer systems:
Traditional retail value transfer systems, e.g. Bank transfer, Wire transfer, Post offices transfer service or specialist companies such as Western Union
Internet-only value transfer systems, e.g. Electronic money such as PayPal, eGold, Liberty Reserve
Cryptocurrencies: Bitcoin, Litecoin, Ethereum, etc.
Institutional formal value transfer systems, e.g. SWIFT (International), domestic real-time gross settlement (RTGS) systems such as LVTS (Canada), Fedwire (USA), CHAPS (UK)
Informal value transfer systems, e.g. hawala
See also
Digital currency
Electronic funds transfer
Correspondent account
Payment system
References
External links
1996 paper: The Effect of Internet Value Transfer
Financial economics
Payment systems |
https://en.wikipedia.org/wiki/Ternary%20operation | In mathematics, a ternary operation is an n-ary operation with n = 3. A ternary operation on a set A takes any given three elements of A and combines them to form a single element of A.
In computer science, a ternary operator is an operator that takes three arguments as input and returns one output.
Examples
The function is an example of a ternary operation on the integers (or on any structure where and are both defined). Properties of this ternary operation have been used to define planar ternary rings in the foundations of projective geometry.
In the Euclidean plane with points a, b, c referred to an origin, the ternary operation has been used to define free vectors. Since (abc) = d implies a – b = c – d, these directed segments are equipollent and are associated with the same free vector. Any three points in the plane a, b, c thus determine a parallelogram with d at the fourth vertex.
In projective geometry, the process of finding a projective harmonic conjugate is a ternary operation on three points. In the diagram, points A, B and P determine point V, the harmonic conjugate of P with respect to A and B. Point R and the line through P can be selected arbitrarily, determining C and D. Drawing AC and BD produces the intersection Q, and RQ then yields V.
Suppose A and B are given sets and is the collection of binary relations between A and B. Composition of relations is always defined when A = B, but otherwise a ternary composition can be defined by where is the converse relation of q. Properties of this ternary relation have been used to set the axioms for a heap.
In Boolean algebra, defines the formula .
Computer science
In computer science, a ternary operator is an operator that takes three arguments (or operands). The arguments and result can be of different types. Many programming languages that use C-like syntax feature a ternary operator, ?:, which defines a conditional expression. In some languages, this operator is referred to as the conditional operator.
In Python, the ternary conditional operator reads x if C else y. Python also supports ternary operations called array slicing, e.g. a[b:c] return an array where the first element is a[b] and last element is a[c-1]. OCaml expressions provide ternary operations against records, arrays, and strings: a.[b]<-c would mean the string a where index b has value c.
The multiply–accumulate operation is another ternary operator.
Another example of a ternary operator is between, as used in SQL.
The Icon programming language has a "to-by" ternary operator: the expression 1 to 10 by 2 generates the odd integers from 1 through 9.
In Excel formulae, the form is =if(C, x, y).
See also
Median algebra or Majority function
Ternary conditional operator for a list of ternary operators in computer programming languages
Ternary Exclusive or
Ternary equivalence relation
References
External links |
https://en.wikipedia.org/wiki/Head-up%20display | A head-up display, or heads-up display, also known as a HUD () or head-up guidance system (HGS), is any transparent display that presents data without requiring users to look away from their usual viewpoints. The origin of the name stems from a pilot being able to view information with the head positioned "up" and looking forward, instead of angled down looking at lower instruments. A HUD also has the advantage that the pilot's eyes do not need to refocus to view the outside after looking at the optically nearer instruments.
Although they were initially developed for military aviation, HUDs are now used in commercial aircraft, automobiles, and other (mostly professional) applications.
Head-up displays were a precursor technology to augmented reality (AR), incorporating a subset of the features needed for the full AR experience, but lacking the necessary registration and tracking between the virtual content and the user's real-world environment.
Overview
A typical HUD contains three primary components: a projector unit, a combiner, and a video generation computer.
The projection unit in a typical HUD is an optical collimator setup: a convex lens or concave mirror with a cathode-ray tube, light emitting diode display, or liquid crystal display at its focus. This setup (a design that has been around since the invention of the reflector sight in 1900) produces an image where the light is collimated, i.e. the focal point is perceived to be at infinity.
The combiner is typically an angled flat piece of glass (a beam splitter) located directly in front of the viewer, that redirects the projected image from projector in such a way as to see the field of view and the projected infinity image at the same time. Combiners may have special coatings that reflect the monochromatic light projected onto it from the projector unit while allowing all other wavelengths of light to pass through. In some optical layouts combiners may also have a curved surface to refocus the image from the projector.
The computer provides the interface between the HUD (i.e. the projection unit) and the systems/data to be displayed and generates the imagery and symbology to be displayed by the projection unit.
Types
Other than fixed mounted HUD, there are also head-mounted displays (HMDs). These include helmet-mounted displays (both abbreviated HMD), forms of HUD that feature a display element that moves with the orientation of the user's head.
Many modern fighters (such as the F/A-18, F-16, and Eurofighter) use both a HUD and HMD concurrently. The F-35 Lightning II was designed without a HUD, relying solely on the HMD, making it the first modern military fighter not to have a fixed HUD.
Generations
HUDs are split into four generations reflecting the technology used to generate the images.
First Generation—Use a CRT to generate an image on a phosphor screen, having the disadvantage of the phosphor screen coating degrading over time. The majority of HUDs in operation toda |
https://en.wikipedia.org/wiki/Common%20operator%20notation | In programming languages, scientific calculators and similar common operator notation or operator grammar is a way to define and analyse mathematical and other formal expressions. In this model a linear sequence of tokens are divided into two classes: operators and operands.
Operands are objects upon which the operators operate. These include literal numbers and other constants as well as identifiers (names) which may represent anything from simple scalar variables to complex aggregated structures and objects, depending on the complexity and capability of the language at hand as well as usage context. One special type of operand is the parenthesis group. An expression enclosed in parentheses is typically recursively evaluated to be treated as a single operand on the next evaluation level.
Each operator is given a position, precedence, and an associativity. The operator precedence is a number (from high to low or vice versa) that defines which operator takes an operand that is surrounded by two operators of different precedence (or priority). Multiplication normally has higher precedence than addition, for example, so 3+4×5 = 3+(4×5) ≠ (3+4)×5.
In terms of operator position, an operator may be prefix, postfix, or infix. A prefix operator immediately precedes its operand, as in −x. A postfix operator immediately succeeds its operand, as in x! for instance. An infix operator is positioned in between a left and a right operand, as in x+y. Some languages, most notably the C-syntax family, stretches this conventional terminology and speaks also of ternary infix operators (a?b:c). Theoretically it would even be possible (but not necessarily practical) to define parenthesization as a unary bifix operation.
Operator associativity
Operator associativity determines what happens when an operand is surrounded by operators of the same precedence, as in 1-2-3: An operator can be left-associative, right-associative, or non-associative. Left-associative operators are applied to operands in left-to-right order while right-associative operators are the other way round. The basic arithmetic operators are normally all left-associative, which means that 1-2-3 = (1-2)-3 ≠ 1-(2-3), for instance. This does not hold true for higher operators. For example, exponentiation is normally right-associative in mathematics, but is implemented as left-associative in some computer applications like Excel. In programming languages where assignment is implemented as an operator, that operator is often right-associative. If so, a statement like would be equivalent to , which means that the value of c is copied to b which is then copied to a. An operator which is non-associative cannot compete for operands with operators of equal precedence. In Prolog for example, the infix operator is non-associative, so constructs such as are syntax errors.
Unary prefix operators such as − (negation) or sin (trigonometric function) are typically associative prefix operators. When more |
https://en.wikipedia.org/wiki/Operator%20associativity | In programming language theory, the associativity of an operator is a property that determines how operators of the same precedence are grouped in the absence of parentheses. If an operand is both preceded and followed by operators (for example, ^ 3 ^), and those operators have equal precedence, then the operand may be used as input to two different operations (i.e. the two operations indicated by the two operators). The choice of which operations to apply the operand to, is determined by the associativity of the operators. Operators may be associative (meaning the operations can be grouped arbitrarily), left-associative (meaning the operations are grouped from the left), right-associative (meaning the operations are grouped from the right) or non-associative (meaning operations cannot be chained, often because the output type is incompatible with the input types). The associativity and precedence of an operator is a part of the definition of the programming language; different programming languages may have different associativity and precedence for the same type of operator.
Consider the expression a ~ b ~ c. If the operator ~ has left associativity, this expression would be interpreted as (a ~ b) ~ c. If the operator has right associativity, the expression would be interpreted as a ~ (b ~ c). If the operator is non-associative, the expression might be a syntax error, or it might have some special meaning. Some mathematical operators have inherent associativity. For example, subtraction and division, as used in conventional math notation, are inherently left-associative. Addition and multiplication, by contrast, are both left and right associative. (e.g. (a * b) * c = a * (b * c)).
Many programming language manuals provide a table of operator precedence and associativity; see, for example, the table for C and C++.
The concept of notational associativity described here is related to, but different from, the mathematical associativity. An operation that is mathematically associative, by definition requires no notational associativity. (For example, addition has the associative property, therefore it does not have to be either left associative or right associative.) An operation that is not mathematically associative, however, must be notationally left-, right-, or non-associative. (For example, subtraction does not have the associative property, therefore it must have notational associativity.)
Examples
Associativity is only needed when the operators in an expression have the same precedence. Usually + and - have the same precedence. Consider the expression 7 - 4 + 2. The result could be either (7 - 4) + 2 = 5 or 7 - (4 + 2) = 1. The former result corresponds to the case when + and - are left-associative, the latter to when + and - are right-associative.
In order to reflect normal usage, addition, subtraction, multiplication, and division operators are usually left-associative, while for an exponentiation operator (if present) and Knuth' |
https://en.wikipedia.org/wiki/List%20of%20Mac%20software | The following is a list of Mac software – notable computer applications for current macOS operating systems.
For software designed for the classic Mac OS, see List of old Macintosh software.
Audio software
Digital audio workstations
Ableton Live
Ardour
Cubase
Digital Performer
GarageBand
Logic Pro and MainStage
REAPER
Reason
Renoise
Steinberg 2019 Mac Pro
Audio editing
Audacity – digital audio editor
DJing
djay – digital music mixing software
Mixxx – DJ mix software
Notation software
Impro-Visor
Finale
LilyPond
Overture
Misc audio tools
Audio Hijack – audio recorder
baudline – signal analyzer
Cog – open source audio player, supports multiple formats
fre:ac – open source audio converter and CD ripper
ixi software – free improvisation and sketching tools
Jaikoz – music file mass tagger
Max – Cycling 74's visual programming language for MIDI, audio, video; with MSP, Jitter
ReBirth – virtual synth program simulates Roland TR-808, TB-303
Recycle – music loop editor
Discontinued audio apps
Adobe Soundbooth – music and soundtrack editing
Audion – media player
BIAS Peak – mastering
iTunes – audio/video Jukebox by Apple
Logic Express – prosumer music production by Apple
Logic Studio – music writing studio package by Apple
Apple Loops Utility – production and organisation of Apple Loops
Apple Qmaster and Qadministrator
Mainstage – program to play software synthesizers live
QuickTime Pro – pro version of QuickTime
Soundtrack Pro – post production audio editor
WaveBurner – CD mastering and production software
RiffWorks – guitar recording and online song collaboration software
Chat (text, voice, image, video)
Active
Adium – multi-protocol IM client
aMSN
ChitChat
Colloquy – freeware advanced IRC and SILC client
Discord
Fire – open source, multiprotocol IM client
FaceTime – videoconferencing between Mac, iPhone, iPad and iPod Touch
iMessage – instant messaging between Mac, and iDevices
Ircle
Irssi – IrssiX and MacIrssi
Kopete
LiveChat
Microsoft Messenger for Mac
Microsoft Teams
Palringo
Psi (instant messenger)
Skype
Snak
Ventrilo – audio chatroom application
X-Chat Aqua
Yahoo! Messenger
Telegram
Discontinued
AOL Instant Messenger – discontinued as of December 15, 2017
Miiverse - discontinued as of November 7, 2017
iChat – instant messaging and videoconferencing (discontinued since OS X 10.8 Mountain Lion in favor of FaceTime and iMessage)
Children's software
Kid Pix Deluxe 3X – bitmap drawing program
Stagecast Creator – programming and internet authoring for kids
Developer tools and IDEs
Apache Web Server
AppCode – an Objective-C IDE by JetBrains for macOS and iOS development
Aptana – an open source integrated development environment (IDE) for building Ajax web applications
Clozure CL – an open source integrated development environment (IDE) for building Common Lisp applications
Code::Blocks – open source IDE for C++
CodeWarrior – development environment, framework
Coldstone game engine
Dylan
Eclipse – |
https://en.wikipedia.org/wiki/UserLinux | UserLinux was a project to create an operating system based on Debian, and targeted at business customers. The goal was to provide businesses with a freely available, high quality operating system accompanied by certifications, service, and support options.
The project was initiated by Bruce Perens in late 2003. Subsequent to 2005 and the major success of Ubuntu, a commercial Linux distribution based on Debian by Canonical Ltd. with much the same aims as UserLinux, the project lost steam. No software was shipped, and the project was ultimately abandoned.
References
Whither UserLinux? (Linux Weekly News)
UserLinux: Autopsy (Linux Weekly News)
External links
userlinux.com (last archived version in the Webarchive, 2007)
Debian-based distributions
Discontinued Linux distributions
Linux distributions |
https://en.wikipedia.org/wiki/Littoral%20combat%20ship | The Littoral Combat Ship (LCS) is either of two classes of relatively small surface vessels designed for operations near shore by the United States Navy. It was "envisioned to be a networked, agile, stealthy surface combatant capable of defeating anti-access and asymmetric threats in the littorals", although their ability to perform these missions in practice has been called into question.
Littoral Combat Ships are comparable to corvettes found in other navies. The and the are the two LCS variants. Each is slightly smaller than the U.S. Navy's earlier but larger than Cyclone-class patrol ships. Each has the capabilities of a small assault transport, including a flight deck and hangar for housing two SH-60 or MH-60 Seahawk helicopters, a stern ramp for operating small boats, and the cargo volume and payload to deliver a small assault force with fighting vehicles to a roll-on/roll-off port facility. Standard armaments include Mk 110 57 mm guns and RIM-116 Rolling Airframe Missiles. They are also equipped with autonomous air, surface, and underwater vehicles. Possessing lower air defense and surface warfare capabilities than destroyers, the LCS emphasizes speed, flexible mission modules, and a shallow draft.
The first LCS, , was commissioned on 8 November 2008 in Veteran's Park, Milwaukee, Wisconsin. The second ship, the trimaran , was commissioned on 16 January 2010, in Mobile, Alabama. In 2012, ADM Jonathan W. Greenert stated that the LCS would be deployed to Africa in place of destroyers and cruisers. In 2013 and 2014, the Navy's requirement for LCSs was progressively cut from 55 to 32 vessels in favor of a newly proposed frigate more capable of high-intensity combat. In late 2014, the Navy proceeded with a procurement plan for enhanced versions of the LCS and upgraded older ships to meet the program's 52-ship requirement; the modified LCS will be redesignated as FF, or frigate. In December 2015, Secretary of Defense Ashton Carter ordered the Navy to reduce planned LCS and FF procurement from 52 to 40 and downselect to one variant by FY 2019.
In July 2017, the Navy released a request for information for a new multi-mission guided-missile frigate that can perform the same roles as the LCS while having better offensive and defensive capabilities. Almost any existing design that can be adapted to FFG(X) requirements can be considered, extending beyond versions of the two LCS hulls. In April 2020, it was announced that Fincantieri Marinette Marine had won the contract with its FREMM multi-purpose frigate-based design.
Design features
The concept behind the Littoral Combat Ship, as described by former Secretary of the Navy Gordon R. England, is to "create a small, fast, maneuverable and relatively inexpensive member of the DD(X) family of ships". The ship is easy to reconfigure for different roles, including anti-submarine warfare, mine countermeasures, anti-surface warfare, intelligence, surveillance and reconnaissance, homeland defense, marit |
https://en.wikipedia.org/wiki/List%20of%20assets%20owned%20by%20Warner%20Bros.%20Discovery | Warner Bros. Discovery is an American multinational mass media and entertainment conglomerate based in New York City. The company works in the following areas: film, television, cable networks and publishing operations.
The following is a list of major assets that are owned by Warner Bros. Discovery.
Warner Bros. Entertainment
Warner Bros. Studio Facilities
Warner Bros. Museum
Warner Bros. Studios, Burbank
Warner Bros. Studios, Leavesden
Warner Bros. International Dubbing & Subtitling
The Burbank Studios
Warner Bros. Digital Networks
OneFifty
Uninterrupted (joint venture with LeBron James)
Ellen Digital Ventures (joint venture with Ellen DeGeneres)
Sports & Entertainment Digital Network
WBDGE Digital & Online
WBDGE Podcast Network
Private Networks
Food.com
Discovery Digital Studios
Warner Bros. Home Entertainment
Studio Distribution Services (joint venture with Universal Pictures Home Entertainment)
Warner Bros. Anti-Piracy Operations
Discovery Home Entertainment
Warner Bros. Theatre Ventures
DC Studios
WaterTower Music
Fandango Media (25%; with NBCUniversal)
Fandango Movieclips
Movies.com
MovieTickets.com
Fandango Latam
Vudu
Turner Entertainment Co.
Wolper Organization
Warner Bros. Motion Picture Group
Warner Bros. Pictures
New Line Cinema
Warner Bros. Pictures Animation
Castle Rock Entertainment (brand and back library)
Flagship Entertainment Group (China) (49%) (joint venture with China Media Capital (41%) and TVB (10%))
Spyglass Media Group (minority stake)
Warner Bros. Pictures Domestic Distribution (North American exhibition)
Warner Bros. Pictures Distribution International (international distribution and production; most active in France, Germany, Italy, Spain, the United Kingdom, the Republic of Ireland, Japan, South Korea, Argentina, Brazil and Mexico)
Warner Bros. Television Group
Warner Bros. Television Studios
WBTVS Scripted Production
Alloy Entertainment
WBTVS Unscripted Production
Telepictures
Telepictures Music
DC All Access
True Crime Daily
Warner Horizon Unscripted Television
Warner Bros. Television Workshop - the premiere writing program for new writers looking to start and further their career in the world of television. Every year, the Workshop selects up to eight participants out of more than 2,500 submissions and exposes them to Warner Bros. Television's top writers and executives, all with the ultimate goal of earning them a staff position on a Warner Bros.-produced television show. The Warner Bros. Television Writers’ Workshop consists of three components, all geared towards preparing the writer for a successful career in television writing.
Warner Bros. Animation
Blue Ribbon Content
Cartoon Network Studios
Williams Street
Warner Bros. Domestic Television Distribution
Discovery Studios
The CW (12.5% each with Paramount Global; 75% by Nexstar Media Group)
The CW Plus
CW Seed
Warner Bros. International Television Production
WBITVP Australia
WBITVP Belgium
|
https://en.wikipedia.org/wiki/Edinburgh%20Multiple%20Access%20System | The Edinburgh Multi-Access System (EMAS) was a mainframe computer operating system at the University of Edinburgh. The system went online in 1971.
EMAS was a powerful and efficient general purpose multi-user system which coped with many of the computing needs of the University of Edinburgh and the University of Kent (the only other site outside Edinburgh to adopt the operating system).
History
Originally running on the ICL System 4/75 mainframe (based on the design of the IBM 360) it was later reimplemented on the ICL 2900 series of mainframes (as EMAS 2900 or EMAS-2) where it ran in service until the mid-1980s. Near the end of its life, the refactored version was back-ported (as EMAS-3) to the Amdahl 470 mainframe clone, and thence to the IBM System/370-XA architecture (the latter with help from the University of Kent, although they never actually ran EMAS-3). The National Advanced System (NAS) VL80 IBM mainframe clone followed later. The final EMAS system (the Edinburgh VL80) was decommissioned in July 1992.
The University of Kent system went live in December 1979, and ran on the least powerful machine in the ICL 2900 range - an ICL 2960, with 2 MB of memory, executing about 290k instructions per second. Despite this, it reliably supported around 30 users. This number increased in 1983 with the addition of an additional 2 MB of memory and a second Order Code Processor (OCP) (what is normally known as a CPU) running with symmetric multiprocessing. This system was decommissioned in August 1986.
Features
EMAS was written entirely in the Edinburgh IMP programming language, with only a small number of critical functions using embedded assembler within IMP sources. It had several features that were advanced for the time, including dynamic linking, multi-level storage, an efficient scheduler, a separate user-space kernel ('director'), a user-level shell ('basic command interpreter'), a comprehensive archiving system and a memory-mapped file architecture.
Such features led EMAS supporters to claim that their system was superior to Unix for the first 20 years of the latter's existence.
Legacy
The Edinburgh Computer History Project is attempting to salvage some of the lessons learned from the EMAS project and has the complete source code of EMAS online for public browsing.
See also
Atlas Autocode
References
History of computing in the United Kingdom
Time-sharing operating systems
1970s software
University of Edinburgh School of Informatics |
https://en.wikipedia.org/wiki/QVC | QVC (short for "Quality Value Convenience") is an American free-to-air television network and a flagship shopping channel specializing in televised home shopping, owned by Qurate Retail Group. Founded in 1986 by Joseph Segel in West Chester, Pennsylvania, United States, QVC broadcasts to more than 350 million households in seven countries, including channels in the UK, Germany, Japan, and Italy, along with a joint venture in China with China National Radio called CNR Mall.
History
Early era (1986–1992)
QVC's founding and television launch
QVC was founded on June 13, 1986, by Joseph Segel and investors including Ralph Roberts, the founder and chairperson of Comcast. Roberts was able to arrange deals in which cable companies received investment stakes in QVC in exchange for carrying the channel. Sears was one of the first brands that QVC would represent, with a two-year exclusive agreement to sell Sears products through television shopping. The corporation later set a new record for first full-year fiscal sales for a new public company of $112 million. The channel was launched on November 24, 1986, with program hosts Kathy Levine, John Eastman, Ellen Langas, Bob Bowersox, and Cindy Briggs-Moore. Each November 24, QVC celebrated their birthday annually through 2008. Initially broadcasting live from 7:30 p.m. until midnight ET each weekday and 24 hours a day each weekend, the channel extended its live programming to 24/7/364 in January 1987. Former QUBE host and producer, Ron Giles, was named an executive vice president and executive producer at QVC in late 1987. In October 1988, the board of directors elected Michael C. Boyd to the position of senior executive vice president and chief operating officer. In early 1990, Boyd would take the title of president, reportedly to relieve some of Segel's load.
Competitor buy-out attempts
In July 1989, QVC acquired the Cable Value Network, founded by Irwin L. Jacobs. The $380 million deal contributed to a loss of $17 million during the next fiscal quarter, and then led to difficulties in the couple of years that followed.
QVC first offered to buy out the Burbank-based Shop Television Network on March 16, 1991, a bid rejected by its producers and the Los Angeles Superior Court, and which carried blocks of time offering JCPenney merchandise. On May 21, 1991, it acquired the channel and its 4 million subscribers, with a liability of $2 million to its producers, along with a license to carry JCPenney brands on-air.
A QVC offer to buy rival Home Shopping Network in March 1992 was sidetracked by antitrust concerns. On July 12, 1993, QVC offered to acquire Home Shopping in a stock swap valued at about $1.1 billion, but talks faltered when QVC pursued a bid for Paramount in fall 1993. Liberty Media Corp. held a controlling interest in the St. Petersburg, Florida-based Home Shopping Network along with their share of QVC.
Barry Diller, use of QVC for corporate raider attempts (1993–1995)
Diller's takeover an |
https://en.wikipedia.org/wiki/MTRR | MTRR may refer to:
5-methyltetrahydrofolate-homocysteine methyltransferase reductase, a human gene
Memory Type Range Registers, in computer hardware |
https://en.wikipedia.org/wiki/Runtime | Runtime, run-time, or run time may refer to:
Computing
Runtime (program lifecycle phase), the period during which a computer program is executing
Runtime library, a program library designed to implement functions built into a programming language
Runtime system, software designed to support the execution of computer programs
Software execution, the process of performing instructions one by one during the runtime phase
Art and entertainment
The duration of a film, song, or television program
See also
Running Time (film) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.