source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/Eunicycle | A Eunicycle is a computer-controlled, partially self-balancing, motorized unicycle invented by Trevor Blackwell. It uses a computer control system similar to the one used by the Segway HT that servos its wheel to balance itself by keeping the contact point of the wheel below the center of mass of the vehicle in the front-to-back direction. To balance from side to side, the rider must rotate the vehicle the same way a unicyclist does, enabling the balancing servo to balance in the new direction.
The Eunicycle is based on an open design; the engineering drawings and control software source code are available from the website.
See also
Bicycle and motorcycle dynamics
Self-balancing unicycle
Uno dicycle
Wheel in B.C. (comic strip)
B.C.'s_Quest_for_Tires
External links
http://tlb.org/#eunicycle
Cycle types
Unicycling
Free software
Open hardware vehicles |
https://en.wikipedia.org/wiki/Dog%20City | Dog City is an animated television series that was produced by Nelvana Limited and Jim Henson Productions in association with Channel 4 and Global Television Network. The series ran for three seasons, airing on Fox Kids from September 26, 1992, to November 26, 1994; in Canada, the series aired on YTV until 2000. The series contained both animation made by Nelvana, and puppetry by Jim Henson Productions - similar to Little Muppet Monsters - and invoked a mixture of detective fiction with police comedy.
The series starred Kevin Clash as Eliot Shag, a German Shepherd animator, and the voice talents of Ron White as Ace Hart, a cartoon German Shepherd private detective who Eliot animates. Each episode of Dog City focus on the exploits of Ace as he tackles various crimes around the titular Dog City, based on the stories Eliot devises from events that happen in real-life that inspire him, with the pair often interacting with each other during work to animate an episode of Ace's cartoon series. Dog City was spawned following an hour-long live-action television film, titled Dog City: The Movie, which was created for an episode of The Jim Henson Hour in 1989, with the muppet cast created for the film incorporated into the series.
Television film
Dog City was originally an hour-long, broadcast on May 5, 1989, as an episode of The Jim Henson Hour, featuring the characters as puppets. In Dog City: The Movie, Ace Yu inherits a bar-restaurant called the Dog House following the death of his Uncle Harry and is harassed for protection money by crime syndicate boss Bugsy Them (who was responsible for the death of Uncle Harry. Harry as it turns out, was actually Ace's father). Refusing to pay or fight him, Bugsy kidnaps Ace's love interest, Colleen. There are car chases and shoot-em-ups and rubber duckies involved in the action. In the end, Ace defeats Bugsy and gets the girl.
Characters
Ace Yu (performed by Kevin Clash) - A German Shepherd adopted by Chinese Pekingese parents. Although Ace's puppet is a Hand-Rod Puppet, it is later modified into a Live-Hand Puppet when it was used to play Eliot in the TV series.
Colleen Barker (performed by Fran Brill) - A Rough Collie who serves as Ace's love interest. The name was later used in TV series.
Bugsy Them (performed by Jim Henson) - A vain bulldog crime boss who is proud of his tail. His puppet is later used to play Bruno in the TV series.
Miss Belle (performed by Camille Bonora) - A poodle that is the key associate and the wife of Bugsy Them.
Mad Dog (performed by Steve Whitmire) - Bugsy Them's dimwitted St. Bernard henchman. His puppet is later used to play Bowser in the TV series.
Scruffy (performed by Gord Robertson) - Bugsy Them's henchman who is always scratching at his fleas.
Laughing Boy (performed by Rickey Boyd) - Bugsy Them's henchman who is always laughing and cracking jokes.
Bubba (performed by Jerry Nelson) - The bartender at the Dog House. He is a recycled and modified version of the Wolfhound |
https://en.wikipedia.org/wiki/Network%20emulation | Network emulation is a technique for testing the performance of real applications over a virtual network. This is different from network simulation where virtual models of traffic, network models, channels, and protocols are applied. The aim is to assess performance, predict the impact of change, or otherwise optimize technology decision-making.
Methods of emulation
Network emulation is the act of testing the behavior of a network (5G, wireless, MANETs, etc) in a lab. A personal computer or virtual machine runs software to perform the network emulation; a dedicated emulation device is sometimes used for link emulation.
Networks introduce delay, errors, and drop packets. The primary goal of network emulation is to create an environment whereby users can connect the devices, applications, products, and/or services being tested to validate their performance, stability, or functionality against real-world network scenarios. Once tested in a controlled environment against actual network conditions, users can have confidence that the item being tested will perform as expected.
Emulation, simulation, and traffic generation
Emulation differs from simulation in that a network emulator appears to be a network; end-systems such as computers can be attached to the emulator and will behave as if they are attached to a network. A network emulator mirrors the network which connects end-systems, not the end-systems themselves.
Network simulators are typically programs that run on a single computer, take an abstract description of the network traffic such as a flow arrival process, and yield performance statistics such as throughput, delay, loss etc.
These products are typically found in the Development and QA environments of Service Providers, Network Equipment Manufacturers, and Enterprises.
Network emulation software
Software developers typically want to analyze the response time and sensitivity to packet loss of client-server applications and emulate specific network effects (of 5G, Smart homes, industrial IOT, military networks, etc.,) with different round-trip-times, throughputs, bit error rates, and packet drops.
Two open-source network emulators are Common Open Research Emulator (CORE) and Extendable Mobile Ad hoc Network Emulator (EMANE). They both support operation as network black boxes, i.e. external machines/devices can be hooked up to the emulated network with no knowledge of emulation. They also support both wired and wireless network emulation with various degrees of fidelity. A CORE is more useful for quick network layouts (layer 3 and above) and single-machine emulation. EMANE is better suited for distributed high-fidelity large-scale network emulation (layers 1/2).
The most popular network simulation software packages, OPNET and Tetcos NetSim, also have emulation modules for real-time device connectivity. In general simulation tools with emulation capabilities provide more sophistication than emulation devices. Emulation devices o |
https://en.wikipedia.org/wiki/Global%20Teen%20Challenge | Global Teen Challenge is a network of Christian faith-based corporations intended to provide rehabilitation services to people struggling with addiction. It was founded by David Wilkerson in 1960. The global headquarters is in Columbus, Georgia, United States.
There is little public record of what goes on in Teen Challenge facilities. Questions have been raised about whether the practices of the organization are abusive and cult-like. In the United States, there are no federal laws or agencies that regulate organizations like Teen Challenge.
History
Teen Challenge was founded in 1961 by David Wilkerson, an Assemblies of God pastor who left a rural Pennsylvania church to work on the street among teenage gang members and socially marginalized people in New York City and who, perhaps, is best known for later authoring The Cross and the Switchblade and founding Times Square Church. Teen Challenge started its first residential program in December 1962, in a house in Brooklyn, New York.
In 1973, 12 years after the ministry began, Teen Challenge established a national headquarters. In 1995, Global Teen Challenge was founded to assist the growing number of Teen Challenges starting up outside the US, but struggling to acquire the necessary resources and training. In 2022, Global Teen Challenge had more than 1,400 accommodation centers in 129 countries around the world.
Programs
The organization offers rehabilitation programs of a general duration of 12 months to help young people to get out of addictions of all kinds (alcoholism, drugs, crime, prostitution, etc.). In the past it forced participants to sign ‘civil rights waivers’ under duress, and to this day requires parents/guardians to sign waivers giving over unconditional control of their child, and stating they will not “interfere with the custody and management of said minor in any way.” The centres use practices such as enforced silence and banning communication (verbal and visual) between participants for perceived infractions, or on suspicion that the participant is gay - sometimes for months; monitoring and censoring all phone conversations with people outside of the programme (eg parents).
Studies of program effectiveness
In 1973, Archie Johnston compared results of Teen Challenge with that of a transactional analysis approach at a Terminal Island Federal Correctional Institution therapeutic community, and with a third group who received no treatment. While the numbers of subjects was small (17 in each group), he found evidence to support his recommendation that, while Teen Challenge was an "effective" treatment (with a drug recidivism rate after 29 months of 32%), Transactional Analysis was a "very effective" treatment (with a comparable 16% rate), suggesting that perhaps the lower recidivism rates were a result of TA changing the addiction concept of the self-image more thoroughly and at a slower pace. He hoped that Teen Challenge would incorporate some psychotherapy into their treatmen |
https://en.wikipedia.org/wiki/Network%20simulation | In computer network research, network simulation is a technique whereby a software program replicates the behavior of a real network. This is achieved by calculating the interactions between the different network entities such as routers, switches, nodes, access points, links, etc. Most simulators use discrete event simulation in which the modeling of systems in which state variables change at discrete points in time. The behavior of the network and the various applications and services it supports can then be observed in a test lab; various attributes of the environment can also be modified in a controlled manner to assess how the network/protocols would behave under different conditions.
Network simulator
A network simulator is a software program that can predict the performance of a computer network or a wireless communication network. Since communication networks have become too complex for traditional analytical methods to provide an accurate understanding of system behavior, network simulators are used. In simulators, the computer network is modeled with devices, links, applications, etc., and the network performance is reported. Simulators come with support for the most popular technologies and networks in use today such as 5G, Internet of Things (IoT), Wireless LANs, mobile ad hoc networks, wireless sensor networks, vehicular ad hoc networks, cognitive radio networks, LTE etc.
Simulations
Most of the commercial simulators are GUI driven, while some network simulators are CLI driven. The network model/configuration describes the network (nodes, routers, switches, links) and the events (data transmissions, packet error, etc.). Output results would include network-level metrics, link metrics, device metrics etc. Further, drill down in terms of simulations trace files would also be available. Trace files log every packet, every event that occurred in the simulation and is used for analysis. Most network simulators use discrete event simulation, in which a list of pending "events" is stored, and those events are processed in order, with some events triggering future events—such as the event of the arrival of a packet at one node triggering the event of the arrival of that packet at a downstream node.
Network emulation
Network emulation allows users to introduce real devices and applications into a test network (simulated) that alters packet flow in such a way as to mimic the behavior of a live network. Live traffic can pass through the simulator and be affected by objects within the simulation.
The typical methodology is that real packets from a live application are sent to the emulation server (where the virtual network is simulated). The real packet gets 'modulated' into a simulation packet. The simulation packet gets demodulated into a real packet after experiencing effects of loss, errors, delay, jitter etc., thereby transferring these network effects into the real packet. Thus it is as-if the real packet flowed through a real network |
https://en.wikipedia.org/wiki/European%20route%20E47 | European route E47 is a road (part of the United Nations international E-road network) connecting Lübeck in Germany to Helsingborg in Sweden via the Danish capital, Copenhagen. It is also known as the Vogelfluglinie (German) or Fugleflugtslinjen (Danish). The road is of motorway standard all the way except for in Germany and 6 km (4 miles) of city roads in Helsingør; there are also two ferry connections.
Improvements
A fixed link between Germany and Denmark was planned to have been completed by 2020, now delayed to 2029. It will be a tunnel rather than a bridge.
The road across Fehmarn will be widened from two to four lanes before the tunnel opens. A construction start ceremony was held for this on 25 august 2023.
Although a bridge-tunnel combination (the Øresund Bridge) has been constructed between Denmark and Sweden further south, a very frequent ferry service continues to operate between Helsingør in Denmark and the northern terminus of the E47 at Helsingborg in Sweden. There are plans to build a tunnel here as well, the HH Tunnel, which does not have any financing approved or time plan set.
Other road numbers
The ferry route Helsingborg–Helsingør is part of E47 according to the UN definition, and signposted so in Denmark, but the ferry is not signposted with any road number in Sweden. The ferry was part of E4 until 1992, but was signposted so for several further years in Sweden.
The Danish E-roads have no other national numbers (the national number is the same as the E-number, here 47, but only the E-sign is posted). Between Helsingborg and Eskilstrup on the island of Falster, 160 km, the E47 shares road with the E55. Since 2018 E55 is not signposted between Helsingør and Køge. Between Køge and Copenhagen (29 km), also the E20 shares the same road. Danish roads 9 and 19 share roads with the E47 short parts.
In Germany the motorway has the national number BAB 1. The part without motorway has the national number B 207. This part is a kind of expressway without any roads crossing on the same level. It has a number of road crossings built like motorway exits.
At the introduction of the new numbering scheme in 1992, the E47 was originally devised to continue from Helsingborg northward through Sweden and Norway to Gothenburg, Oslo, Trondheim and finally Olderfjord, replacing almost all of the old European route E6. After negotiations between UNECE and the Swedish and Norwegian authorities, this plan was abandoned, and the E6 remains designated as such, both on signage and in the official documents, throughout its entire old length in Scandinavia (including the snippets Trelleborg–Malmö and Malmö–Helsingborg, which are concurrent with the E22 and the E20 respectively, and were never intended to become parts of the E47). A similar solution was made for the E4 through Sweden. These two roads are the most conspicuous exceptions to the rule that even numbers signify west-to-east E-roads.
Exits and service areas in Denmark
3 Espergærde
4 K |
https://en.wikipedia.org/wiki/Mastering | Mastering may refer to
Mastering (audio), the process of preparing and transferring recorded audio from a source containing the final mix to a data storage device, the master
Stem mastering, contains the same process as ordinary mastering but the individual audio tracks are grouped together into a few separated stems like drums, instruments, voices, etc.
Bus mastering, a feature supported by many data bus architectures that enables a device connected to the bus to initiate transactions
See also
Master (disambiguation) |
https://en.wikipedia.org/wiki/Archie%20Williams%20High%20School | Archie Williams High School is a public secondary school located in San Anselmo, California. It is named after a former math and computing teacher Archie Williams, who was also a gold medalist in the 1936 Summer Olympics, a flight instructor with the Tuskegee Airmen, and one of the first African-American meteorologists. It was originally named Sir Francis Drake High School, after Francis Drake. It changed its name in 2021, after the George Floyd protests spurred a worldwide reexamination of place names and monuments connected to racism.
The school was established in 1951 as the second high school in the Tamalpais Union High School District. It is located at 1327 Sir Francis Drake Boulevard, situated on a 21-acre (85,000 m2) campus bordered by two creeks. The site was formerly known as Cordone Gardens.
The graduation rate in 2015 was approximately 99%.
History
Archie Williams High School was founded as Sir Francis Drake High School (aka Drake High School) in 1951 to serve students in grades 9–12 from Corte Madera, Larkspur, Kentfield, Greenbrae, Ross, San Anselmo, Fairfax, Woodacre, Lagunitas, Forest Knolls, San Geronimo, and Nicasio. This was the second high school to be introduced into the Tamalpais Union High School District, the first being Tamalpais High School. In 1958, Redwood High School opened to accommodate students from Corte Madera, Larkspur, Kentfield, Ross, and Greenbrae.
From 1971 until 1984, Drake High School operated a separate "School Within A School" (SWAS) within the pre-1950 Devonshire Hall, for students who wanted to explore alternative community-building, interactive, and experiential pedagogy. SWAS was a pioneer in developing such an alternative school within a public school system.
Between 1992 and 1995, Drake High School started a new program of small learning communities due to the poor performance of students, which was affecting the perception of the school. Drake has received two state grants for these programs; one in 1996–1997 and the other being in 2000. Since then, there have been four Freshman-Sophomore Academies and two Junior-Senior Academies.
Name change
During the protests against police brutality and racism that followed the murder of George Floyd, school officials initiated a process to consider changing the name of Sir Francis Drake High School, citing "the racist and violent acts of Francis Drake, a slave trader, slave owner, and colonizer, and the legacy of white supremacy he represents," and noting that "honoring such a person is counter to the values held by our community and counter to the lessons and values we wish our students and colleagues to learn." During the renaming process, the school adopted the temporary name "High School 1327", a reference to its address. On May 6, 2021, an elected school committee composed of students, parents and staff voted unanimously to rename the school after former teacher and Olympic athlete Archie Williams. The Tamalpais United School District Board of Tr |
https://en.wikipedia.org/wiki/Sky%20Angel | Sky Angel was a U.S. operator of Christian television networks; it operated three channels, Angel One, Angel Two, and KTV, all of which were exclusive to Dish Network. The company's corporate headquarters were located in Naples, Florida. The company also operated a Chattanooga, Tennessee location where programming, engineering and network operations resided.
The company previously operated as a Christian-oriented television provider carrying religious and family-oriented programming, first as a satellite television service, and later as an over-the-top internet television provider. The shift to an IPTV platform was later accompanied by the spin-off of the provider's secular offerings into a second service known as FAVE TV.
On January 14, 2014, Sky Angel ceased its IPTV business, citing that because it did not fall under the traditional legal definition of a multichannel video programming distributor, it was unable to employ legal remedies for its allegations that broadcasters were discriminating against its business model by preventing carriage of their channels.
History
1980–1995: early years
Sky Angel was formed in 1980 by Robert Johnson Sr., who aimed to create a faith-based television service that would be free of the objectionable content he had found on television. Johnson obtained an allocation of 8 direct-broadcast satellite frequencies for the service, and reached a deal with Dish Network to use space on its EchoStar III satellite.
1996–2008: satellite service
Sky Angel satellite service launched in 1996. The channel lineup would consist primarily of religious networks, along with other secular television networks which the service considered to be family-oriented. The service featured 36 channels in its lineup as of November 2002, consisting of 20 television channels and 16 radio channels. Sky Angel reached around 115,000 subscribers, mostly within the Central United States.
On April 1, 2008, Sky Angel discontinued its satellite service operations, as it declined to invest around $400 million to replace the aging EchoStar III satellite, and it sold its DBS frequencies to EchoStar. Customers were encouraged to sign up to Sky Angel IPTV. The company was criticized for refusing to provide lifelong satellite subscribers with lifelong IPTV service.
2007–2013: IPTV transition
On January 22, 2007, Sky Angel partnered with ShifTV to launch Sky Angel IPTV service in Canada. By October 2007, this partnership has dissolved due to ShifTV being restructured to launch an adult pornography service. On July 10, 2007, Sky Angel launched a separate IPTV service in the United States. This involved a partnership with NeuLion to develop a new over-the-top IPTV-based platform, which offered increased channel capacity and network DVR support. Sky Angel has also contemplated offering internet and mobile television services, but declined to do so.
In September 2012, Sky Angel launched its "Sky Angel 2.0" platform, offering services featuring religious |
https://en.wikipedia.org/wiki/NetBIOS%20over%20TCP/IP | NetBIOS over TCP/IP (NBT, or sometimes NetBT) is a networking protocol that allows legacy computer applications relying on the NetBIOS API to be used on modern TCP/IP networks.
NetBIOS was developed in the early 1980s, targeting very small networks (about a dozen computers). Some applications still use NetBIOS, and do not scale well in today's networks of hundreds of computers when NetBIOS is run over NBF. When properly configured, NBT allows those applications to be run on large TCP/IP networks (including the whole Internet, although that is likely to be subject to security problems) without change.
NBT is defined by the RFC 1001 and RFC 1002 standard documents.
Services
NetBIOS provides three distinct services:
Name service for name registration and resolution (ports: 137/udp and 137/tcp)
Datagram distribution service for connectionless communication (port: 138/udp)
Session service for connection-oriented communication (port: 139/tcp)
NBT implements all of those services.
Name service
In NetBIOS, each participant must register on the network using a unique name of at most 15 characters. In legacy networks, when a new application wanted to register a name, it had to broadcast a message saying "Is anyone currently using that name?" and wait for an answer. If no answer came back, it was safe to assume that the name was not in use. However, the wait timeout was a few seconds, making the name registration a very lengthy process, as the only way of knowing that a name was not registered was to not receive any answer.
NBT can implement a central repository, or Name Service, that records all name registrations. An application wanting to register a name would therefore contact the name server (which has a known network address) and ask whether the name is already registered, using a "Name Query" packet. This is much faster, as the name server returns a negative response immediately if the name is not already in the database, meaning it is available. The Name Service, according to RFCs 1001 and 1002, is called NetBIOS Naming Service or NBNS. Microsoft WINS is an implementation of NBNS. It is worth saying that due to constant development of the way in which the Name Service handles conflict or merges, "group names" varies from vendor to vendor and can even be different by version e.g. with the introduction of a service pack.
The packet formats of the Name Service are identical to DNS. The key differences are the addition of NetBIOS "Node Status" query, dynamic registration and conflict marking packets. They are encapsulated in UDP. Later implementation includes an optional Scope part of the name, making NetBIOS name hierarchical like DNS, but this is seldom used.
In addition, to start a session or to send a datagram to a particular host rather than to broadcast the datagram, NBT will have to determine the IP address of the host with a given NetBIOS name; this is done by broadcasting a "Name Query" packet, and/or sending it to the NetBIOS name |
https://en.wikipedia.org/wiki/Nine%20News | Nine News (stylised 9News) is the national news service of the Nine Network in Australia. Its flagship program is the hour-long 6:00 pm state bulletin, produced by Nine's owned-and-operated stations in Sydney, Melbourne, Brisbane, Adelaide, Perth and Darwin. National bulletins also air on weekday mornings, weekend afternoons and most nights of the week after 10:30pm. In addition, a supplementary regional news program for the Gold Coast in Queensland airs each weeknight as well as regional bulletins for Northern NSW and the Gold Coast under the name of NBN News air seven nights a week.
Up until the mid-2000s, Nine News was generally the highest-rating news service in Australia, but in 2005 it was overtaken by the rival Seven News before it regained the lead on a national basis in 2013. The network's Director of News and Current Affairs is Darren Wick.
National bulletins
Nine News: Early Edition
Nine News: Early Edition is a half-hour bulletin airing at 5:00am on weekdays, presented from TCN studios in North Sydney by Alex Cullen.
The bulletin was originally pre-recorded and was presented as the "AM Edition" of the Qantas Inflight News, a daily news bulletin for passengers of Qantas airways. Early morning bulletins were introduced in the early 1990s as Daybreak and, later, National Nine Early News until 2003 when Today was extended to begin at 6am. The Early News resumed for a brief time at 6am in February 2005 and was presented by Sharyn Ghidella and Chris Smith before again being cancelled in July the same year. Amber Sherlock, Alicia Loxley, Belinda Russell, Julie Snook and Lara Vella have previously presented the bulletin. In mid-2014, Julie Snook replaced Belinda Russell to present. After two years in the role, Julie Snook was promoted to the sports department and Lara Vella replaced her.
In October 2014, a new era of the bulletin launched with its contract ending with Qantas. The bulletin was renamed Nine News: Early Edition with a dedicated 9news.com.au news feed on the right of screen, finance and weather flipper at the bottom, a look-ahead to Today and the presenter taking up less than three-quarters of the screen. There was a look at the newspaper front pages which showed the front pages of the Sydney and Melbourne papers The Australian, The Courier Mail and The Advertiser. There was even a live cross in which the bulletin prior to October was pre-recorded.
Nine Morning News
Nine Morning News airs at 11:30am on weekdays, presented from TCN studios in North Sydney by Mark Burrows on Monday and Davina Smith on Tuesday – Friday. Lizzie Pearl and Mark Burrows are the main fill in presenters with Jayne Azzopardi, Sophie Walsh and Kate Creedon also filling in from time to time.
The morning bulletin, originally known as National Nine Morning News, has been broadcast since 1981 and was originally presented by Eric Walters. The bulletin was extended from thirty minutes to a full hour on Monday 4 May 2009. From 2004 to October 2008 the bulle |
https://en.wikipedia.org/wiki/Robert%20S.%20Barton | Robert Stanley "Bob" Barton (February 13, 1925 – January 28, 2009) was the chief architect of the Burroughs B5000 and other computers such as the B1700, a co-inventor of dataflow architecture, and an influential professor at the University of Utah.
His students at Utah have had a large role in the development of computer science.
Barton designed machines at a more abstract level, not tied to the technology constraints of the time. He employed high-level languages and a stack machine in his design of the B5000 computer. Its design survives in the modern Unisys ClearPath MCP systems. His work with stack machine architectures was the first implementation in a mainframe computer.
Barton died on January 28, 2009, in Portland, Oregon, aged 83.
Career
Barton was born in New Britain, Connecticut in 1925 and received his BA in 1948, and his MS in 1949 in Mathematics, from the University of Iowa. His early experience with computers was when he worked in the IBM Applied Science Department in 1951.
In 1954, he joined the Shell Oil Company Technical Services, working on programming applications. He worked at Shell Development, a research group in Texas where he worked with a Burroughs/Datatron 205 computer. In 1958, he studied Irving Copi and Jan Łukasiewicz's work on symbolic logic and Polish notation, and considered its application to arithmetic expression processing on a computer.
Barton joined Burroughs Corporation, ElectroData Division, in Pasadena, California in the late 1950s. He managed a system programming group in 1959 which developed a compiler named BALGOL for the language ALGOL 58 on the Burroughs 220 computer.
In 1960, he became a consultant for Beckman Instruments working on data collection from satellite systems, for Lockheed Corporation working on satellite systems and organizing of data processing services, and for Burroughs continuing to work on the design concepts of the B5000.
After an assignment in Australia in 1963 for Control Data Corporation, he returned in 1965 to join the Computer Science staff of the Department of Electrical Engineering at the University of Utah where, from 1968 to 1973, his colleagues included David C. Evans, Ivan Sutherland, and Thomas Stockham. His Ph.D. students at the University of Utah were Duane Call, cofounder of Computer System Architects; Alan Ashton, cofounder of WordPerfect; and Al Davis, University of Utah professor of computer science. Other Utah students that he influenced included: Alan Kay, James H. Clark cofounder of Silicon Graphics, John Warnock, cofounder of Adobe Systems, Ed Catmull of Pixar, Henri Gouraud (Gouraud shading) and Bui Tuong Phong (Phong shading).
After 1973, he devoted his full-time to Burroughs Systems Research in La Jolla, San Diego, California, working on new computer architectures and systems programming.
Awards
IEEE 1977 W. Wallace McDowell Award Recipient. “For his innovative architectural computer concepts, such as stack processing, data stored with self-descr |
https://en.wikipedia.org/wiki/Enterprise%20architecture | Enterprise architecture (EA) is a business function concerned with the structures and behaviours of a business, especially business roles and processes that create and use business data. The international definition according to the Federation of Enterprise Architecture Professional Organizations is "a well-defined practice for conducting enterprise analysis, design, planning, and implementation, using a comprehensive approach at all times, for the successful development and execution of strategy. Enterprise architecture applies architecture principles and practices to guide organizations through the business, information, process, and technology changes necessary to execute their strategies. These practices utilize the various aspects of an enterprise to identify, motivate, and achieve these changes."
The United States Federal Government is an example of an organization that practices EA, in this case with its Capital Planning and Investment Control processes. Companies such as Independence Blue Cross, Intel, Volkswagen AG, and InterContinental Hotels Group also use EA to improve their business architectures as well as to improve business performance and productivity. Additionally, the Federal Enterprise Architecture's reference guide aids federal agencies in the development of their architectures.
Introduction
As a discipline, EA "proactively and holistically lead[s] enterprise responses to disruptive forces by identifying and analyzing the execution of change" towards organizational goals. EA gives business and IT leaders recommendations for policy adjustments and provides best strategies to support and enable business development and change within the information systems the business depends on. EA provides a guide for decision making towards these objectives. The National Computing Centre's EA best practice guidance states that an EA typically "takes the form of a comprehensive set of cohesive models that describe the structure and functions of an enterprise. The individual models in an EA are arranged in a logical manner that provides an ever-increasing level of detail about the enterprise."
Important players within EA include enterprise architects and solutions architects. Enterprise architects are at the top level of the architect hierarchy, meaning they have more responsibilities than solutions architects. While solutions architects focus on their own relevant solutions, enterprise architects focus on solutions for and the impact on the whole organization. Enterprise architects oversee many solution architects and business functions. As practitioners of EA, enterprise architects support an organization's strategic vision by acting to align people, process, and technology decisions with actionable goals and objectives that result in quantifiable improvements toward achieving that vision. The practice of EA "analyzes areas of common activity within or between organizations, where information and other resources are exchanged to guide f |
https://en.wikipedia.org/wiki/Speedup | In computer architecture, speedup is a number that measures the relative performance of two systems processing the same problem. More technically, it is the improvement in speed of execution of a task executed on two similar architectures with different resources. The notion of speedup was established by Amdahl's law, which was particularly focused on parallel processing. However, speedup can be used more generally to show the effect on performance after any resource enhancement.
Definitions
Speedup can be defined for two different types of quantities: latency and throughput.
Latency of an architecture is the reciprocal of the execution speed of a task:
where
v is the execution speed of the task;
T is the execution time of the task;
W is the execution workload of the task.
Throughput of an architecture is the execution rate of a task:
where
ρ is the execution density (e.g., the number of stages in an instruction pipeline for a pipelined architecture);
A is the execution capacity (e.g., the number of processors for a parallel architecture).
Latency is often measured in seconds per unit of execution workload. Throughput is often measured in units of execution workload per second. Another unit of throughput is instructions per cycle (IPC) and its reciprocal, cycles per instruction (CPI), is another unit of latency.
Speedup is dimensionless and defined differently for each type of quantity so that it is a consistent metric.
Speedup in latency
Speedup in latency is defined by the following formula:
where
Slatency is the speedup in latency of the architecture 2 with respect to the architecture 1;
L1 is the latency of the architecture 1;
L2 is the latency of the architecture 2.
Speedup in latency can be predicted from Amdahl's law or Gustafson's law.
Speedup in throughput
Speedup in throughput is defined by the formula:
where
Sthroughput is the speedup in throughput of the architecture 2 with respect to the architecture 1;
Q1 is the throughput of the architecture 1;
Q2 is the throughput of the architecture 2.
Examples
Using execution times
We are testing the effectiveness of a branch predictor on the execution of a program. First, we execute the program with the standard branch predictor on the processor, which yields an execution time of 2.25 seconds. Next, we execute the program with our modified (and hopefully improved) branch predictor on the same processor, which produces an execution time of 1.50 seconds. In both cases the execution workload is the same. Using our speedup formula, we know
Our new branch predictor has provided a 1.5x speedup over the original.
Using cycles per instruction and instructions per cycle
We can also measure speedup in cycles per instruction (CPI) which is a latency. First, we execute the program with the standard branch predictor, which yields a CPI of 3. Next, we execute the program with our modified branch predictor, which yields a CPI of 2. In both cases the execution workload is the same |
https://en.wikipedia.org/wiki/Quest%20%28disambiguation%29 | A quest is a journey toward a goal.
Quest may also refer to:
Computing
Quest Development, a software company
Quest Oracle Community, not-for-profit organization
QuEST, research program
Quest Software, a management software company
Quantum Experiments using Satellite Technology, India's Quantum communication satellite.
Entertainment
Film and television
Quest (1996 film), an animated short
Quest (2006 film), an Indian drama film
Quest (2017 film), an American documentary film
Quest (TV channel), a UK TV channel
Quest (American TV network), a US over-the-air television network
Quest (Canadian TV series), a 1960s television anthology
Jonny Quest, a fictional character
Richard Quest (born 1962), English television journalist
Gaming
Quest (gamebook)
Quest (video gaming), a task in a video game
Quest 64, a 1998 Nintendo 64 game
Quest Corporation, a video game company
Oculus Quest, a virtual reality headset by Oculus
Meta Quest 2, a successor to the Oculus Quest
Meta Quest Pro, another model of the Oculus Quest
Meta Quest 3, another successor to the Oculus Quest
Music
Quest (band), an American jazz band
Quest (singer) (born 1982), Filipino hip-hop and R&B singer and songwriter
Quest, an American jazz group led by Don Randi
Quest, a 2016 mini-album by Japanese band White Ash
Quest Crew, a dance crew
Organizations
Quest Aircraft, an aircraft manufacturer
Quest Community Newspapers, a newspaper company in Queensland, Australia
Quest Diagnostics, a clinical laboratory services company
Quest International, a flavor and fragrances company
Quaid-e-Awam University of Engineering, Science & Technology, Pakistan
Quest University, Canada
Periodicals
Quest (British magazine), a fortnightly science/technology magazine for youth
Quest (Dutch magazine), monthly science/technology magazine in the Netherlands
Quest (Indian magazine)
Quest (lifestyle magazine)
Quest (Theosophical magazine), a publication of the Theosophical Society in America
QUEST: An African Journal of Philosophy
Quest: The History of Spaceflight, a quarterly journal
Quest, a publication of the Ambassador International Cultural Foundation
Science
Shell Canada Quest Energy project carbon capture and storage
Q and U Extragalactic Submillimeter Telescope, part of cosmic microwave background polarization experiment
QUEST (Cluster of Excellence), a collaborative research project in Germany
Quasar Equatorial Survey Team, an astronomical survey in Venezuela
Quaternion estimator algorithm, a solution to Wahba's problem
Quest Joint Airlock, part of the International Space Station
QUEST Q-shu University Experiment with Steady-State Spherical Tokamak, a fusion research experimental device on the campus of Kyushu University in Fukuoka, Japan
Other
Quest (cigarette), a cigarette brand by Vector Tobacco
"Quest" (Anderson novelette), a novelette by Poul Anderson
Quest (ship), a 1917 sealing ship and polar exploration vessel
Quest, a model of velomobile
Nissan |
https://en.wikipedia.org/wiki/Java%20OpenGL | Java OpenGL (JOGL) is a wrapper library that allows OpenGL to be used in the Java programming language. It was originally developed by Kenneth Bradley Russell and Christopher John Kline, and was further developed by the Sun Microsystems Game Technology Group. Since 2010, it has been an independent open-source project under a BSD license. It is the reference implementation for Java Bindings for OpenGL (JSR-231).
JOGL allows access to most OpenGL features available to C language programs through the use of the Java Native Interface (JNI). It offers access to both the standard GL* functions along with the GLU* functions; however the OpenGL Utility Toolkit (GLUT) library is not available for window-system related calls, as Java has its own windowing systems: Abstract Window Toolkit (AWT), Swing, and some extensions.
Design
The base OpenGL C API, as well as its associated Windowing API, are accessed in JOGL via Java Native Interface (JNI) calls. As such, the underlying system must support OpenGL for JOGL to work.
JOGL differs from some other Java OpenGL wrapper libraries in that it merely exposes the procedural OpenGL API via methods on a few classes, rather than trying to map OpenGL functionality onto the object-oriented programming paradigm. Indeed, most of the JOGL code is autogenerated from the OpenGL C header files via a conversion tool named GlueGen, which was programmed specifically to facilitate the creation of JOGL.
Status and standardization
, JOGL provides full access to the OpenGL 4.5 specification as well as almost all vendor extensions (and OpenCL, OpenMAX and OpenAL). The 1.1.0 version is the reference implementation for JSR-231 (Java Bindings for OpenGL). The 1.1.1 release gave limited access to GLU NURBS, providing rendering of curved lines and surfaces via the traditional GLU APIs. The 2.3.2 release added support for OpenGL versions up to 4.5, and OpenGL ES versions up to 3.2.
Wayland and Vulkan support is planned.
Java2D-OpenGL interoperability
Since the Java SE 6 version of the Java language, Java2D (the API for drawing two dimensional graphics in Java) and JOGL have become interoperable, allowing it to :
Overlay Swing components (lightweight menus, tooltips, and other widgets) on top of OpenGL rendering.
Draw 3D OpenGL graphics on top of Java2D rendering (see here for a button with an OpenGL icon).
Use 3D graphics anywhere where ordinarily a Swing widget would be used. (Inside a JTable, JTree, ...)
Draw Java2D graphics on top of 3D OpenGL rendering.
Tutorials
OpenGL ES 2 sample
Hello Triangle, gl3 and gl4 Hello Triangle and Texture. The samples are offered in Java and Kotlin
Java OpenGL Sample Pack, porting of g-truc OpenGL Sample Pack. The over 230 samples illustrate almost all OpenGL features ranging from ES 2.0 up to the last GL extensions, same of them usually also called AZDO (Almost Zero Driver Overhead).
modern jogl examples, Porting of Learning Modern 3D Graphics Programming, Jason L. McKesson. Java and Kotl |
https://en.wikipedia.org/wiki/Conjugate%20gradient%20method | In mathematics, the conjugate gradient method is an algorithm for the numerical solution of particular systems of linear equations, namely those whose matrix is positive-definite. The conjugate gradient method is often implemented as an iterative algorithm, applicable to sparse systems that are too large to be handled by a direct implementation or other direct methods such as the Cholesky decomposition. Large sparse systems often arise when numerically solving partial differential equations or optimization problems.
The conjugate gradient method can also be used to solve unconstrained optimization problems such as energy minimization. It is commonly attributed to Magnus Hestenes and Eduard Stiefel, who programmed it on the Z4, and extensively researched it.
The biconjugate gradient method provides a generalization to non-symmetric matrices. Various nonlinear conjugate gradient methods seek minima of nonlinear optimization problems.
Description of the problem addressed by conjugate gradients
Suppose we want to solve the system of linear equations
for the vector , where the known matrix is symmetric (i.e., AT = A), positive-definite (i.e. xTAx > 0 for all non-zero vectors in Rn), and real, and is known as well. We denote the unique solution of this system by .
Derivation as a direct method
The conjugate gradient method can be derived from several different perspectives, including specialization of the conjugate direction method for optimization, and variation of the Arnoldi/Lanczos iteration for eigenvalue problems. Despite differences in their approaches, these derivations share a common topic—proving the orthogonality of the residuals and conjugacy of the search directions. These two properties are crucial to developing the well-known succinct formulation of the method.
We say that two non-zero vectors u and v are conjugate (with respect to ) if
Since is symmetric and positive-definite, the left-hand side defines an inner product
Two vectors are conjugate if and only if they are orthogonal with respect to this inner product. Being conjugate is a symmetric relation: if is conjugate to , then is conjugate to . Suppose that
is a set of mutually conjugate vectors with respect to , i.e. for all .
Then forms a basis for , and we may express the solution of in this basis:
Left-multiplying the problem with the vector yields
and so
This gives the following method for solving the equation : find a sequence of conjugate directions, and then compute the coefficients .
As an iterative method
If we choose the conjugate vectors carefully, then we may not need all of them to obtain a good approximation to the solution . So, we want to regard the conjugate gradient method as an iterative method. This also allows us to approximately solve systems where n is so large that the direct method would take too much time.
We denote the initial guess for by (we can assume without loss of generality that , otherwise consider the system A |
https://en.wikipedia.org/wiki/Robotix | Robotix is a 1985 American animated series based on the original Milton Bradley toyline of the same name featured on the Super Sunday programming block. The toyline is of the construction type that includes motors, wheels and pincers and similar to the Erector Set and K'Nex. The series follows the conflict between the peaceful Protectons and the warmongering Terrakors on the prehistoric alien world Skalorr V in the distant past and two groups of humans from the year 200X who get caught up in it.
The show was produced by Sunbow Productions and Marvel Productions and animated in Japan by Toei Animation, which also animated other cartoons featured on Super Sunday.
Characters
Protectons
Argus "Ark" Power Electronixus (voiced by Arthur Burghardt): Leader of the Protectons. Before his transfer into his Robotix body, he was the chief-in-command of the Protectonian spacecraft city Zanadon and had a romantic relationship with Nara. He is compassionate and brave and tries to help the humans. He despises killing to the point that he would rather hurt himself than allow anybody to use him to kill another being. He almost suffered a nervous breakdown upon discovering that his mind and life force were downloaded into his robot shell. It is a monster dragon/dog hybrid with a head on a long neck usable as a ramrod and a hook for a right hand that changes into a gun and crossed between a firetruck and an airliner. Memorable transformations and features include a car-like form, a compact mode with shrunken arms and legs, laser cannons deploying from his chest and an additional K-series drone monster dog known as K-9. Pilot of choice: Exeter.
Bront (voiced by Frank Welker): Strongest tough-guy-like member of the Protectons. Before his transfer into his Robotix body, he maintained Zanadon's command center and initiated its battle mode. He is close friends with Jerrok, who often teased him in the past because of his meager size. Their trust was strained when Bront was wrongly accused of sabotaging Zanadon's reactor and almost attacked Kontor and Jerrok, but their partnership was soon re-established. His Robotix body is a monster dragon hybrid with four wheels on walker legs extendable for river crossing that change into feet. Memorable transformations and features include a car-like form with a deployable grabber, an extreme extension of his torso to form a ladder, a deployable twin-shell canister laser cannon on his forehead and hands that transform into smaller legs and combinine into a drill, a two-man space control cockpit capsule, a cam-operated jaw, swivel joints and articulated elbows. Pilot of choice: Tauron.
Jerrok (voiced by Neil Ross): Second-in-command of the Protectons and a friend of Bront, he helped him activate Zanadon's battle mode. He used to tease Bront as he was twice as tall as him, but after his transfer, he acquired the smallest Robotix body. It is crossed between a police motorcycle and a racing car. With that robot shell being the fastest |
https://en.wikipedia.org/wiki/Bullwinkle%20J.%20Moose | Bullwinkle J. Moose is a fictional character and one of the two main protagonists of the 1959–1964 ABC network animated television series Rocky and His Friends and The Bullwinkle Show, often collectively referred to as Rocky and Bullwinkle, produced by Jay Ward and Bill Scott. When the show changed networks in 1961, the series moved to NBC and was retitled The Bullwinkle Show, where it stayed until 1964. It then returned to ABC, where it was in repeats for nine more years. It has been in syndication ever since.
In 1996, Bullwinkle was ranked #32 on TV Guides 50 Greatest TV Stars of All Time.
Creation
Jay Ward and his business partner Alex Anderson created Bullwinkle for The Frostbite Falls Review, a storyboard idea which was never developed into a series. They gave him the name "Bullwinkle Jay Moose" after Clarence Bullwinkel, who owned a Ford dealership at College and Claremont, in Oakland, California, because they thought it was a funny name. Both Bullwinkle and Rocky were given the middle initial "J" in reference to Jay Ward.
From his debut along with Rocky, Bullwinkle's gloves were blue. Later in the second story arc and for the rest of the series, they become white. Also, in contemporary promotion art, Bullwinkle's antlers are a yellow in contrast to the rest of his body; originally they were brown.
Biography
Bullwinkle shared a house with his best friend Rocket "Rocky" J. Squirrel in the fictional small town of Frostbite Falls, Minnesota, a spoof of the real-life American town of International Falls, Minnesota. Bullwinkle attended college at "Wossamotta U" (a play on "What's the matter with you") on a football scholarship. He is a long-time supporter of the Bull Moose Party, and at one time was the part-owner, part-governor of the island of Moosylvania. Bullwinkle is shown at numerous times to be quite wealthy. In seasons 1 and 2, he makes reference to having an Uncle Dewlap, who bequeathed Bullwinkle vast amounts of wealth (in the form of a cereal boxtop collection and an Upsidaisium mine); he also has a large petty cash stockpile hidden in his mattress that he accumulated delivering newspapers (as revealed in "The Last Angry Moose"). In the half-cartoon, half-live-action movie The Adventures of Rocky and Bullwinkle, Bullwinkle receives an Honorary Mooster's Degree from Wossamotta U, due to the nefarious plans of Boris Badenov.
Personality
Bullwinkle was noted for being well-intentioned, but also quite foolish, which made for a source of jokes and plot devices during the show's run. Despite this, the so-called "moronic moose" often aided the brains of the "moose-and-squirrel" duo, Rocky, during their various adventures. Although on opposite ends of the I.Q. scale, he and the "plucky squirrel" had a shared sense of optimism, persistence and traditional ethics and moral standards. Although not as brainy as Rocky, Bullwinkle often made references breaking the fourth wall, so he was not always as clueless as he appeared. His apparent l |
https://en.wikipedia.org/wiki/Bart%20vs.%20Australia | "Bart vs. Australia" is the sixteenth episode of the sixth season of the American animated television series The Simpsons. It originally aired on the Fox network in the United States on February 19, 1995. In the episode, Bart is indicted for fraud in Australia, and the family travels to the country so Bart can apologize.
The episode was written by Bill Oakley and Josh Weinstein and directed by Wes Archer. It features cultural references to films such as Mad Max 2 and Crocodile Dundee. "Bart vs. Australia" acquired a Nielsen rating of 9.1 and was the fourth-highest-rated show on the Fox network the week it aired.
Plot
Bart notices that the water in the bathroom sink always drains counter-clockwise. Lisa explains (incorrectly) that water only drains clockwise in the Southern Hemisphere due to the Coriolis effect. Bart makes phone calls to various countries in the Southern Hemisphere to confirm this, such as a research station in Antarctica, Buenos Aires, Santiago and Burkina Faso. When Lisa points out how expensive overseas calls are, Bart instead makes a collect call to Australia, where a boy named Tobias Drundridge answers the phone. Bart impersonates an adult bureaucrat and is told the sink and toilet are both draining clockwise. Frustrated, Bart asks Tobias to check his neighbors' toilets. The call takes six hours to complete, since Tobias lives in the rural locality of Squatter's Crag and Bart fails to hang up the phone.
Three weeks later, Tobias's father Bruno is billed $900 for the phone call. An enraged Bruno calls Bart and demands payment, but Bart only taunts him. However, Bruno's neighbor Gus is a federal Member of Parliament, who reports the matter to the Prime Minister. After Bart ignores several letters from the Prime Minister and the Solicitor-General, the government of Australia indicts him for fraud. A U.S. State Department official arrives and explains that Bart has worsened already acrimonious Australia–United States relations. When Marge refuses to allow the State Department to imprison Bart for five years to placate Australia, the State Department settles on having Bart publicly apologize in Australia.
The Simpsons arrive in Australia and stay in the U.S. Embassy in Canberra. When Bart sees a sign prohibiting foreign visitors from bringing in invasive species, he leaves his pet bullfrog at the airport. A kangaroo puts the frog in its marsupial pouch, introducing it into the wild. Bart makes his public apology, but an unsatisfied Parliament demands Bart receive a "booting" — a kick on the buttocks with an oversize boot — as corporal punishment. Desperate, Bart and Homer escape and the family flees to the embassy, chased by a large, angry mob. After a stand-off, the two governments propose a compromise: one kick from the Prime Minister, through the gate of the embassy, with a regular wing-tip shoe. Marge protests, but Bart agrees to the punishment. However, Bart dodges the kick, moons the Australians with the words "Don't tr |
https://en.wikipedia.org/wiki/Common%20Address%20Redundancy%20Protocol | The Common Address Redundancy Protocol or CARP is a computer networking protocol which allows multiple hosts on the same local area network to share a set of IP addresses. Its primary purpose is to provide failover redundancy, especially when used with firewalls and routers. In some configurations, CARP can also provide load balancing functionality. CARP provides functionality similar to Virtual Router Redundancy Protocol (VRRP) and to Cisco Systems' Hot Standby Router Protocol (HSRP). It is implemented in several BSD-based operating systems and has been ported to Linux (ucarp).
Example
If there is a single computer running a packet filter, and it goes down, the networks on either side of the packet filter can no longer communicate with each other, or they communicate without any packet filtering. If, however, there are two computers running a packet filter, running CARP, then if one fails, the other will take over, and computers on either side of the packet filter will not be aware of the failure, so operation will continue as normal. In order to make sure the new active/primary operates the same as the old one, the packet filter used must support synchronization of state between the two computers.
Principle of redundancy
A group of hosts using CARP is called a "group of redundancy". The group of redundancy allocates itself an IP address which is shared or divided among the members of the group. Within this group, a host is designated as "active/primary". The other members are "standby". The main host is that which "takes" the IP address. It answers any traffic or ARP request brought to the attention of this address. Each host can belong to several groups of redundancy. Each host must have a second unique IP address.
A common use of CARP is the creation of a group of redundant firewalls. The virtual IP address allotted to the group of redundancy is indicated as the address of the default router on the computers behind this group of firewalls. If the main firewall breaks down or is disconnected from the network, the virtual IP address will be taken by one of the firewall slaves and the service availability will not be interrupted.
History
In the late 1990s the Internet Engineering Task Force (IETF) began work on a protocol for router redundancy. In 1997, Cisco informed the IETF that it had patents in this area and, in 1998, pointed out its patent on HSRP. Nonetheless, IETF continued work on VRRP. After some debate, the IETF VRRP working group decided to approve the standard, despite its reliance on patented techniques, as long as Cisco made the patent available to third parties under reasonable and non-discriminatory licensing terms. Because VRRP fixed problems with the HSRP protocol, Cisco began using VRRP instead, while still claiming it as its own.
Cisco informed the OpenBSD developers that it would enforce its patent on HSRP. Cisco's position may have been due to their lawsuit with Alcatel. As Cisco's licensing terms prevented |
https://en.wikipedia.org/wiki/Autodesk%20Animator | Autodesk Animator is a 2D computer animation and painting program published in 1989 for MS-DOS. It was considered groundbreaking when initially released.
Functionality
Animator gave the ability to do frame-by-frame animation (creating each frame as an individual picture, much like Traditional animation) . Animator Studio also had tweening features (transforming one shape into another by letting the computer draw each in-between shape onto a separate frame). Animator and Animator Pro supported FLI and FLC animation file formats, while Animator Studio also supported the AVI format. Animator was particularly strong in Palette based editing, effects (like Color cycling) and animations a favored technology in the time of indexed CGA and VGA graphics modes.
Unlike other DOS software from that time, Animator was not restricted by the 640 kilobyte conventional memory limitation as it utilized a DOS extender by Phar Lap. Animator's combination of twenty tools multiplied by twenty inks, 3D 'optics,' unparalleled palette handling, custom fonts and many other useful features (such as its own internal scripting language POCO), put it many years ahead of better known animation tools of the time.
Development history
Animator originates back to its author's Jim Kent earlier program Cyber Paint for the Atari ST. Jim Kent evolved in 1989 his software into Animator for Gary Yost's "Yost Group" for 80286 PCs with MS-DOS. Animator was then licensed to Autodesk, who published the software as Autodesk Animator.
Releases
Animator was debuted at SIGGRAPH 1989, featuring a VGA graphics mode of 320×200 pixels with 256 colors.
In July 1991, the successor Animator Pro was released, with the significant improvement of allowing almost any resolution and color depth. The software was sold for approx. $800, significantly more expensive than the previous version, addressing the professional audience.
The 1995 released Animator Studio was a complete re-write for Windows 95, but was not anymore developed by the Yost Group.
Abandonment and legacy
Eventually development of the product ended and support was discontinued by Autodesk. The trademark for "Autodesk Animator", filed on December 18, 1989, expired on July 21, 1997.
Jim Kent kept copyrights to the 300,000 lines source code base of Animator Pro, and allowed it to be made available publicly under the open-source BSD license in 2009. The original 256 color Animator version for DOS is also provided as a freeware download. After some initial code review porting to modern platforms was started on GitHub. As of April 2014 most of the assembly language source code had been ported to platform-agnostic C code and SDL was used as the target back-end framework.
Reception
Animator was considered to be groundbreaking in the field of computer animation when it was initially released. In 1989 Animator won PC Magazines "6th Annual Technical Excellence Award for Graphics".
Also, video game developers used the software for intros |
https://en.wikipedia.org/wiki/Breaking%20news | Breaking news, also called late-breaking news, a special report, special coverage, or a news flash, is a current issue that warrants the interruption of scheduled programming in order to report its details. News broadcasters also use the term for continuing coverage of events of broad interest to viewers, attracting accusations of sensationalism.
Formats
Breaking news has been common to U.S. mass media since the 1930s, when the mass adoption of radio allowed the public to learn about new events without the need to print an extra edition of a newspaper.
Television
When a news event warrants an interruption of current non-news programming (or, in some cases, regularly scheduled newscasts), the broadcaster will usually alert all of its affiliates, telling them to stand by for the interruption. The network's feed will then switch to a countdown sequence, to allow any affiliated stations to switch to the network feed. If a national network newscast is in progress when the breaking news event occurs, the newscast will pause temporarily to allow other network affiliates to join the feed. There is then an opening graphic, with a distinctive music cue. The open is followed by the introduction of a news anchor, who welcomes the viewer to the broadcast and introduces the story at hand. Lower thirds and other graphics may also be altered to convey a sense of urgency.
Breaking news reports are often incomplete because reporters have only a basic awareness of the story. For example, major U.S. broadcast networks analyzed the search warrant affidavit related to the FBI search of Mar-a-Lago in real time, while on the air, breaking into programming immediately after the document was released. The Radio Television Digital News Association (RTDNA) maintains a list of guidelines for broadcasters reporting breaking news.
Talking heads
Breaking news reports often face the same problems in reporting: no footage of the incident, no reporters at the scene, and little available information. To be able to report on current affairs despite this, many networks either employ full-time (typical in the United States) or contact freelance (typical in the United Kingdom) experts and pundits to be "talking heads". These people have either experience or expertise and are considered reliable by the general public. They have been common on television, and can also appear on radio.
In the United States, the competitive nature of commercial networks has allowed for pundits to develop their skills and dedicate themselves to respond to breaking news with analysis in a variety of fields, most often political. These talking heads can be paid millions to work exclusively for a network. In the United Kingdom, TV talking heads are sometimes considered filler who talk around the subject. They are not full-time employees of networks and are not always paid – when they are it is a flat fee for the slot – and will be urgently called in to discuss the relevant field (in which they will typi |
https://en.wikipedia.org/wiki/Blit%20%28computer%20terminal%29 | Blit is a programmable raster graphics computer terminal designed by Rob Pike and Bart Locanthi Jr. of Bell Labs and released in 1982.
History
The Blit programmable bitmap graphics terminal was designed by Rob Pike and Bart Locanthi Jr. of Bell Labs in 1982. The Blit technology was commercialized by AT&T and Teletype. In 1984, the DMD (dot-mapped display) 5620 was released, followed by models 630 MTG (multi-tasking graphics) in 1987 and 730 MTG in 1989. The 5620 used a Western Electric 32100 processor (aka Bellmac 32) and had a 15" green phosphor display with 800×1024×1 resolution (66×88 characters in the initial text mode) interlaced at 30 Hz. The 630 and 730 had Motorola 68000 processors and a 1024×1024×1 monochrome display at 60 Hz (most had amber displays, but some had white or green displays).
The folk etymology for the Blit name is that it stands for Bell Labs Intelligent Terminal, and its creators have also joked that it actually stood for Bacon, Lettuce, and Interactive Tomato. However, Rob Pike's paper on the Blit explains that it was named after the second syllable of bit blit, a common name for the bit-block transfer operation that is fundamental to the terminal's graphics. Its original nickname was Jerq, inspired by a joke used during a demo of a Three Rivers' PERQ graphic workstation and used with permission.
Functionality
When initially switched on, the Blit looked like an ordinary textual "dumb" terminal, although taller than usual. However, after logging into a Unix host (connected to the terminal through a serial port), the host could (via special escape sequences) load software to be executed by the processor of the terminal. This software could make use of the terminal's full graphics capabilities and attached peripherals such as a computer mouse. Normally, users would load the window systems mpx (or its successor mux), which replaced the terminal's user interface by a mouse-driven windowing interface, with multiple terminal windows all multiplexed over the single available serial-line connection to the host.
Each window initially ran a simple terminal emulator, which could be replaced by a downloaded interactive graphical application, for example a more advanced terminal emulator, an editor, or a clock application. The resulting properties were similar to those of a modern Unix windowing system; however, to avoid having user interaction slowed by the serial connection, the interactive interface and the host application ran on separate systems—an early implementation of distributed computing.
Window systems
Pike wrote two window systems for the Blit, mpx for 8th Edition Unix and mux for 9th Edition, both sporting a minimalistic design. The design of these influenced the later Plan 9 window systems 8½ and rio. When the Blit was commercialized as the DMD 5620, a variant of mpx called "layers" was added to SVR3.
9front (a Plan 9 fork) contains a Blit emulator that runs its original firmware, which can be used with mux (ava |
https://en.wikipedia.org/wiki/Digital%20Blasphemy | Digital Blasphemy is a commercial website for computer wallpapers designed and created by independent Computer-generated imagery artist Ryan Bliss, an English and Computer Science graduate from the University of Iowa. The name Digital Blasphemy was chosen because of the "Godlike" feeling Bliss experienced when creating worlds through artwork.
The site is subscription-based, but a free gallery is available to non-members. Images in the free gallery are rotated regularly with fresh images, and are presented in various screen resolutions. In addition, the free gallery provides multi-monitor samples and mobile device images for Android devices, as well as BlackBerry, iPhone, and Palm. The member gallery includes all available artwork numbering over 820, not including image alternate forms.
Some images have additional forms and are in a section known as the "Picklejar". This provides the same images in different colors or presentations, or similar images with removed, added, or changed content or elements. At times, the original image ends up in the Picklejar section and the updated and improved image takes its place in the main gallery. A way to browse Pickle Jar images was added in June 2014.
Designs
Typical designs include science fiction and fantasy, space imagery, planetscapes, landscapes, cityscapes, seascapes, underwater scenes, interiors, abstracts, fractals. There are also images depicting seasons and seasonal events, special occasions, and holidays such as Halloween, Christmas, the Fourth of July, Saint Patrick's Day, and Valentine's Day.
Wallpapers come in many display resolutions up to 7680 x 1600, including widescreen and multi-monitor formats to accommodate various monitor configurations. Only subscribers have access to the highest resolution wallpapers. As of July 2007, many wallpapers were converted to display on mobile devices such as cell phones and tablets, and the first 1080p animated wallpaper was created.
Digital Blasphemy wallpapers were used in Stardock's weather product, The Natural Desktop.
Reception
Digital Blasphemy's work has been recommended by Lifehacker, PC World, Yahoo! Internet Life, and the G4TV television show The Screen Savers. In January 2012 Digital Blasphemy was named "The Most Popular Wallpaper Website" by readers of Lifehacker.com.
At its high of popularity, Digital Blasphemy's most popular works included Tropic of Cancer and Tropic of Capricorn.
References
External links
Digital Blasphemy
Art websites |
https://en.wikipedia.org/wiki/Micha%C5%82%20Zalewski | Michał Zalewski (born 19 January 1981), also known by the user name lcamtuf, is a computer security expert and "white hat" hacker from Poland. He is a former Google Inc. employee (until 2018), and currently the VP of Security Engineering at Snap Inc.
He has been a prolific vulnerability researcher and a frequent Bugtraq poster since the mid-1990s, and has written a number of programs for Unix-like operating systems. In 2005, Zalewski wrote Silence on the Wire: A Field Guide to Passive Reconnaissance and Indirect Attacks, a computer security book published by No Starch Press and subsequently translated into a number of languages. In 2011, Zalewski wrote The Tangled Web: A Guide to Securing Modern Web Applications, also published by No Starch Press.
For his continued research on browser security, he was named one of the 15 most influential people in security and among the 100 most influential people in IT.
Zalewski was one of the original creators of Argante, a virtual open source operating system. Among other projects, he also created p0f and American fuzzy lop.
Reported bugs
This vulnerability made an appearance on The Matrix Reloaded.
Firefox wyciwyg:// cache vulnerability
References
External links
Michał Zalewski's personal home page
Michał Zalewski's personal blog
Interview with Michał Zalewski at OnLamp
1981 births
Living people
People associated with computer security
Google employees |
https://en.wikipedia.org/wiki/AmigaBASIC | AmigaBASIC is an interpreted BASIC programming language implementation for the Amiga, designed and written by Microsoft. AmigaBASIC shipped with AmigaOS versions 1.1 to 1.3. It succeeded MetaComCo's ABasiC, which was included in AmigaOS 1.0 and 1.1, and was superseded by ARexx, a REXX-style scripting language, from AmigaOS version 2.0 onwards.
History and description
AmigaBASIC provided not only the common BASIC language, but also attempted to provide an easy-to-use API for the Amiga's unique graphics and sound capabilities. OBJECT commands, for example, made it easy to create moving objects – sprites and bobs that could be drawn with an external drawing program, Object editor, that was supplied with AmigaBASIC. An unusual feature of the language is that it theoretically allowed the calling of handwritten assembly language subprograms; however, this feature never worked because of a bug that failed to align the assembly language instructions correctly on a word boundary, as required by the Amiga's native MC68000 processor.
Compute!, a popular computer magazine published while AmigaBASIC was still being shipped, included many AmigaBASIC type-in programs in their articles. These were typically implementations of simple programs such as rudimentary games, system and file utilities and desk accessories such as analog clocks and address books.
AmigaBASIC itself was rendered obsolete because of incompatibilities with AmigaOS 2.0 and the hardware successors to the Motorola 68000 CPU. Some incompatibilities were due to the disregard of programming guidelines set forth by Commodore. However, there were a number of third-party compiled BASIC languages released for the Amiga that could compile AmigaBASIC programs with minimal changes, like A/C BASIC or Cursor (see below). Some of these compiled BASICs continued to work with AmigaOS 2.0, and as they were compiled rather than interpreted, they generally ran much faster than the original.
Although AmigaBASIC was superseded by ARexx in AmigaOS 2.0, the two languages had very different functions and capabilities. Hobbyist programmers had changed by the time of AmigaOS 2.0's release and were more likely to be interested in scripting existing third party applications than in writing new programs entirely from scratch. ARexx was seen as better fitting their needs than BASIC.
Along with Microsoft's very similar BASIC for the Macintosh, AmigaBASIC was the first BASIC interpreter from Microsoft to not require line numbers, adopting instead a top-down approach to executing the lines of code, and labels to indicate the GOTO instruction where to jump. However programs that contained line numbers were able to run; the line numbers were simply treated as labels for the purpose of flow control. It was also the first Microsoft interpreted language capable of calling OS functions and dynamic libraries through the command LIBRARY. For example: LIBRARY Graphics.library command invokes the standard Amiga Graphics.library |
https://en.wikipedia.org/wiki/Packed%20storage%20matrix | A packed storage matrix, also known as packed matrix, is a term used in programming for representing an matrix. It is a more compact way than an m-by-n rectangular array by exploiting a special structure of the matrix.
Typical examples of matrices that can take advantage of packed storage include:
symmetric or hermitian matrix
Triangular matrix
Banded matrix.
Code examples (Fortran)
Both of the following storage schemes are used extensively in BLAS and LAPACK.
An example of packed storage for hermitian matrix:
complex:: A(n,n) ! a hermitian matrix
complex:: AP(n*(n+1)/2) ! packed storage for A
! the lower triangle of A is stored column-by-column in AP.
! unpacking the matrix AP to A
do j=1,n
k = j*(j-1)/2
A(1:j,j) = AP(1+k:j+k)
A(j,1:j-1) = conjg(AP(1+k:j-1+k))
end do
An example of packed storage for banded matrix:
real:: A(m,n) ! a banded matrix with kl subdiagonals and ku superdiagonals
real:: AP(-kl:ku,n) ! packed storage for A
! the band of A is stored column-by-column in AP. Some elements of AP are unused.
! unpacking the matrix AP to A
do j=1,n
forall(i=max(1,j-kl):min(m,j+ku)) A(i,j) = AP(i-j,j)
end do
print *,AP(0,:) ! the diagonal
Arrays
Matrices |
https://en.wikipedia.org/wiki/List%20of%20busiest%20airports%20by%20cargo%20traffic | The world's thirty busiest airports by cargo traffic for various periods (data provided by Airports Council International). Numbers listed refer to loaded and unloaded freight in metric tonnes, including transit freight.
2022 final statistics
ACI's 2022 preliminary figures released in April 2023 are as follows.
2021 final statistics
ACI's 2021 final figures released in July 2022 are as follows.
2020 final statistics
ACI's 2020 final figures released in November 2021 are as follows.
2019 final statistics
ACI's 2019 preliminary figures released in May 2020 are as follows.
2018 final statistics
ACI's 2018 final figures released in September 2019 are as follows.
2017 final statistics
ACI's 2017 final figures are as follows.
2016 final statistics
ACI's 2016 final figures are as follows.
2015 statistics
ACI's 2015 figures are as follows.
2014 statistics
ACW's 2014 figures are as follows.
2013 preliminary statistics
ACI's 2013 preliminary full year figures are as follows.
1. Volume includes transit freight
2012 preliminary statistics
ACI's 2012 preliminary full year figures are as follows.
1. Volume includes transit freight
2011 preliminary statistics
ACI's 2011 preliminary full year figures are as follows.
1. Volume includes transit freight
2010 preliminary statistics
ACI's 2010 preliminary full year figures are as follows.
1. Volume includes transit freight
2009 final statistics
ACI's 2009 final full year figures are as follows.
1. Volume includes transit freight
2008 final statistics
ACI's 2008 final full year figures are as follows.
1. Volume includes transit freight
2007 final statistics
ACI's final full year figures are as follows.
1. Volume includes transit freight
2006 final statistics
ACI's final full year figures are as follows.
1. Volume includes transit freight
2005 final statistics
ACI's final full year figures are as follows.
1. Volume includes transit freight
2004 final statistics
ACI's final full year figures are as follows.
1. Volume includes transit freight
2003 final statistics
ACI's final full year figures are as follows.
1. Volume includes transit freight
2002 final statistics
ACI's final full year figures are as follows.
1. Volume includes transit freight
See also
List of busiest airports by international passenger traffic
List of busiest airports by passenger traffic
List of busiest airports by aircraft movements
Largest cargo airports in the United States
References
External links
Airports Council International
Air Cargo World
Cargo traffic
Airports |
https://en.wikipedia.org/wiki/Europaeum | The Europaeum is a network of nineteen universities in Europe. It was conceived of in 1990–1991 by Lord Weidenfeld and Sir Ronnie Grierson and they persuaded Roy Jenkins, who had just become Chancellor of the University of Oxford, to push this initiative in conjunction with the universities of Leiden, and Bologna. It has subsequently been supporting the "advancement of education through the encouragement of European studies in the University of Oxford and other European institutions of higher education having links with Oxford."
Outline
The Europaeum aims to promote movement of academic staff and students between these institutions, with ‘the study of the languages, history, cultures and professions of the people of Europe’. It brings together talented students and faculty working in the Humanities and the Social Sciences, to promote a better ‘sense of Europe’ through collaboration and academic mobility.
The Europaeum's mission
to promote excellence in academic research and teaching collaboration between Europaeum partners
to develop a 'pool of talent' to carry out research and inquiry into problems confronting Europe
to act as an open academic network linking Europaeum partners and other bodies in the joint pursuit of study
to provide opportunities for the joint undertaking of new pan-European initiatives
to explore new ways for universities to fulfil their many roles in the new Learning Age
to train and educate future leaders for a new Europe
For almost three decades, the Europaeum has successfully encouraged collaboration between European research universities, facilitated tripartite dialogue between academics, students, and those working in the public and private sectors, and has contributed to European-wide debates about culture, politics, and society, as well as established excellent faculty collaboration and student exchange; earned a reputation for organising strikingly successful student Spring and Summer Schools, public debates, seminars, joint teaching programmes, lectures and workshops; and run high quality linked scholarship schemes.
The Europaeum Scholars Programme (launched in 2018) is the latest venture to bring together the values and vision of the Europaeum, with a focus on themes such as inclusion, sustainability, and growth and development.
The Europaeum's belief is that today, we need more not less international collaboration, more not less emphasis on universities engaging with the wider society, and more not less connection between the disciplines. Fresh cohorts of talented young people, committed to making a difference for the better, are essential to shaping the future of Europe for the better.
History
1992–2000
The Europaeum's international network was launched in 1992 by Oxford, Leiden and Bologna. Oxford played the lead role, both spearheading a significant fund-raising drive across Europe, and giving the consortium the status of an official university department. The Europaeum helped to spawn two indepe |
https://en.wikipedia.org/wiki/Bad%20command%20or%20file%20name | "Bad command or file name" is a common and ambiguous error message in MS-DOS and some other operating systems.
COMMAND.COM, the primary user interface of MS-DOS, produces this error message when the first word of a command could not be interpreted. For MS-DOS, this word must be the name of an internal command, executable file or batch file, so the error message provided an accurate description of the problem but easily confused novices. Though the source of the error had to be the first word (often a mistyped command), the wording gave the impression that files named in later words were damaged or had illegal filenames. Later, the wording of the error message was changed for clarity. Windows NT displays the following error message instead (where "foo" is replaced by the word causing error):
Some early Unix shells produced the equally cryptic "" for the same reasons. Most modern shells produce an error message similar to "".
See also
Abort, Retry, Fail?
List of DOS commands
References
Computer error messages
DOS on IBM PC compatibles |
https://en.wikipedia.org/wiki/Krusty%20Gets%20Kancelled | "Krusty Gets Kancelled" is the twenty-second and final episode of the fourth season of the American animated television series The Simpsons. It first aired on the Fox network in the United States on May 13, 1993. In the episode, a new show featuring ventriloquist Arthur Crandall and his dummy Gabbo premieres in Springfield and competes with Krusty the Clown's show. Krusty's show is soon canceled. Bart and Lisa decide to help Krusty get back on the air by staging a comeback special.
The episode was written by John Swartzwelder, and directed by David Silverman. Following the success of "Homer at the Bat", the writers wanted to try a similar guest star-heavy episode, except with celebrities instead of baseball players. The episode proved quite difficult, as many of the actors asked to guest star declined at the last minute and the comeback special portion was nearly scrapped. Johnny Carson, Hugh Hefner, Bette Midler, Luke Perry, and the Red Hot Chili Peppers (Flea, Anthony Kiedis, Arik Marshall and Chad Smith) all guest star as themselves and appear on Krusty's special. Elizabeth Taylor and Barry White, both of whom guest-starred in previous episodes this season, make cameo appearances.
Plot
Following a mysterious viral marketing campaign, ventriloquist Arthur Crandall announces that a new television program starring his ventriloquist's dummy Gabbo will air in direct competition with the established Krusty the Clown Show. At first, Krusty is unimpressed by Gabbo and vows to fight back, but quickly pales to Gabbo's clever tactics and great reviews. Krusty even tries to use a dummy of his own, but its gruesome appearance and poor condition scare off many of the children in the audience. To make matters worse, Itchy and Scratchy move to Gabbo's show, forcing Krusty to instead show a bizarre 1950s Eastern European cartoon before his ratings hit rock-bottom and his show is eventually canceled.
Out of work and penniless, Krusty falls on hard times and begins suffering from depression. Meanwhile, Bart and Lisa, who had disliked Gabbo from the start, decide to try to help Krusty. Bart sneaks into the studio and secretly records Gabbo referring to children of Springfield as "SOBs", which damages his reputation, though this backfires when Kent Brockman says the same insult the end of his news program and is subsequently fired. After visiting Krusty's home and seeing photos of him with multiple celebrities, Bart and Lisa suggest that Krusty host a live comeback special. They begin recruiting Krusty's celebrity friends to appear on the special and help Krusty get back into shape before the special airs. The only celebrity who doesn't participate in the event is Elizabeth Taylor, who was told by her agent that "a couple of grade-school kids" (Bart and Lisa) wanted her to appear on "a Krusty Special" who promptly told them to buzz off. Taylor agrees with him, but upon seeing the show, Taylor decides to fire her agent. Sideshow Mel emotionally reunites with Kru |
https://en.wikipedia.org/wiki/Dudley%20Tunnel | Dudley Tunnel is a canal tunnel on the Dudley Canal Line No 1, England. At about long, it is now the second longest canal tunnel on the UK canal network today. (Standedge Tunnel is the longest, at , and the Higham and Strood tunnel is now rail only). However, since the Dudley Tunnel is not continuous this status is sometimes questioned: (the main tunnel is , Lord Ward's tunnel is and Castle Mill basin is ).
In 1959 the British Transport Commission sought to close the tunnel but this led to an Inland Waterways Association-organised massed protest cruise in 1960. The tunnel was however closed in 1962; and was further threatened with permanent closure by British Railways who wished to replace a railway viaduct at the Tipton portal with an embankment and a culvert. However, this never happened as the railway was closed in 1968 and the disused bridge demolished in the 1990s.
The tunnel was reopened in 1973, as a result of restoration, which had been a collaboration between local volunteers (originally the Dudley Canal Tunnel Preservation Society, later the Dudley Canal Trust), and the local authority, Dudley Borough Council. The opening ceremony was advertised as "TRAD 1973 - Tunnel Reopening at Dudley".
Construction of the tunnel(s)
When a private Act of Parliament to construct a canal near Dudley was obtained in 1776, it did not include Dudley Tunnel. It authorised a route that started in two fields called Great Ox Leasow and Little Ox Leasow, a little to the south of the tunnel site near Peartree Lane in Dudley, and ran southwards to an end-on junction with the Stourbridge Canal, authorised by a separate act on the same day. The principal shareholders included Lord Dudley and Ward and Thomas Talbot Foley. Shareholders had contributed the authorised capital of £7,000 by July 1778, and the canal was completed on 14 June 1779, at a total cost of £9,700. The Stourbridge Canal opened in December.
Quite separately, Lord Dudley and Ward was mining limestone in the Castle Mill and Wren's Next area, further to the north. This was brought up to the surface, and transported overland. In 1775, he started building a private canal, which branched from the 473 ft Wolverhampton Level of the Birmingham Canal at Tipton, and reached Tipton Colliery through a tunnel. This was known as Lord Dudley and Ward's branch, and the first phase was completed by 1 June 1778. It was later extended to Castle Mill, where a basin was constructed.
The Dudley Canal and Stourbridge Canal then looked at an extension northwards from Dudley, to join the Birmingham Canal. This would involve a long tunnel, and Lord Dudley and Ward agreed to sell his branch canal and tunnel to the company. The enterprise was authorised by another Act of Parliament, obtained in July 1785, which was steered through the parliamentary process by Lord Dudley and Ward. He was thanked for his efforts, but the company argued that he received sufficient benefit from the convenience of the Dudley Canal and t |
https://en.wikipedia.org/wiki/List%20of%20Brussels%20Metro%20stations | This list of Brussels metro and premetro stations includes all the underground stations in the Brussels metro and premetro network, arranged by line. The premetro refers to sections of the Brussels tramway network which run underground and at metro frequency.
Line 1
Line 1 replaces former Line 1B since 4 April 2009. Line 1 does not service though the stations between Erasme/Erasmus and Jacques Brel, which are now serviced by Line 5.
Line 2
Line 2 was expanded in April 2009 in order to connect the stations Delacroix and Gare de l'Ouest/Weststation. In this way the line now forms a loop between starting and ending in the Simonis/Elisabeth station complex, known as Simonis on its upper level and Elisabeth on its lower level. Most of this line (between Yser/IJzer and Brussels-South railway station) runs under the Brussels small ring.
Line 5
The Line 5 replaces the former Line 1A since 4 April 2009 between Herrmann-Debroux and Beekkant. The section of former Line 1A between Beekkant and King Baudouin is now serviced by Line 6. The section of Line 5 between Beekkant and Erasme/Erasmus was formerly serviced by Line 1B.
Line 6
Line 6 replaces the former Line 1A between Beekkant and King Baudouin since 4 April 2009. It also runs under the Brussels small ring as does Line 2.
North-South Axis
The Brussels tram routes 3 and 4 use the North-South Axis and run on surface outside the city centre. The common section offers a high service frequency during daytime hours between Vanderkindere in the municipality of Uccle and the Brussels-North railway station. It shares 4 connections with metro lines and also links two major train stations with access to Thalys and Eurostar trains at Brussels-South railway station.
Greater Ring Axis
The Greater Ring Axis is an underground section under the greater ring of Brussels used by tram routes 7, and 25.
External links
Official website
Metro
Brussels
Metro stations |
https://en.wikipedia.org/wiki/Content%20security | Content security may refer to:
Network security, the provisions and policies adopted to prevent and monitor unauthorized access, misuse, modification, or denial of a computer network
Content filtering, software designed and optimized for controlling what content is permitted to a reader via the Internet
Digital rights management, a class of technologies used by manufacturers, publishers, copyright holders, and individuals to control the use of digital content and devices after sale
See also
Content Security Policy
Buzzword |
https://en.wikipedia.org/wiki/Parts%20book | A parts book or parts catalogue or Illustrated part catalogue is a book published by manufacturers which contains the illustrations, part numbers and other relevant data for their products or parts thereof.
Parts books were often also issued as microfiche, though this has fallen out of favour. Now, many manufacturers offer this information digitally in an electronic parts catalogue. This can be locally installed software, or a centrally hosted web application. Usually, an electronic parts catalogue enables the user to virtually disassemble the product into its components to identify the required part(s).
In the automotive industry, electronic parts catalogues are also able to access specific vehicle information, usually through an online look-up of the vehicle identification number. This will identify specific models, allowing the user to correctly identify the required part and its relevant part number.
See also
ETKA
Product information management
Parts locator
Electronic Parts Catalogue (EPC)
Sources
https://www.skybrary.aero/index.php/Illustrated_Parts_Catalogue
Catalog Design Handbook – Marketing Principles so as typography and printing industry standards applied to catalog design
Manufacturing
Automotive industry |
https://en.wikipedia.org/wiki/Concordancer | A concordancer is a computer program that automatically constructs a concordance. The output of a concordancer may serve as input to a translation memory system for computer-assisted translation, or as an early step in machine translation.
Concordancers are also used in corpus linguistics to retrieve alphabetically or otherwise sorted lists of linguistic data from the corpus in question, which the corpus linguist then analyzes.
A number of concordancers have been published
notably
Oxford Concordance Program (OCP), a concordancer first released in 1981 by Oxford University Computing Services claims to be used in over 200 organisations worldwide.
See also
COCOA (digital humanities)
Cross-reference
Ctags
KWIC
Language industry
Statistically improbable phrase
References
Concordancer
Corpus linguistics
Machine translation |
https://en.wikipedia.org/wiki/Physics%20engine | A physics engine is computer software that provides an approximate simulation of certain physical systems, such as rigid body dynamics (including collision detection), soft body dynamics, and fluid dynamics, of use in the domains of computer graphics, video games and film (CGI). Their main uses are in video games (typically as middleware), in which case the simulations are in real-time. The term is sometimes used more generally to describe any software system for simulating physical phenomena, such as high-performance scientific simulation.
Description
There are generally two classes of physics engines: real-time and high-precision. High-precision physics engines require more processing power to calculate very precise physics and are usually used by scientists and computer-animated movies. Real-time physics engines—as used in video games and other forms of interactive computing—use simplified calculations and decreased accuracy to compute in time for the game to respond at an appropriate rate for game play. A physics engine is essentially a big calculator that does mathematics needed to simulate physics.
Scientific engines
One of the first general purpose computers, ENIAC, was used as a very simple type of physics engine. It was used to design ballistics tables to help the United States military estimate where artillery shells of various mass would land when fired at varying angles and gunpowder charges, also accounting for drift caused by wind. The results were calculated a single time only, and were tabulated into printed tables handed out to the artillery commanders.
Physics engines have been commonly used on supercomputers since the 1980s to perform computational fluid dynamics modeling, where particles are assigned force vectors that are combined to show circulation. Due to the requirements of speed and high precision, special computer processors known as vector processors were developed to accelerate the calculations. The techniques can be used to model weather patterns in weather forecasting, wind tunnel data for designing air- and watercraft or motor vehicles including racecars, and thermal cooling of computer processors for improving heat sinks. As with many calculation-laden processes in computing, the accuracy of the simulation is related to the resolution of the simulation and the precision of the calculations; small fluctuations not modeled in the simulation can drastically change the predicted results.
Tire manufacturers use physics simulations to examine how new tire tread types will perform under wet and dry conditions, using new tire materials of varying flexibility and under different levels of weight loading.
Game engines
In most computer games, speed of the processors and gameplay are more important than accuracy of simulation. This leads to designs for physics engines that produce results in real-time but that replicate real world physics only for simple cases and typically with some approximation. More often than |
https://en.wikipedia.org/wiki/Xplanet | Xplanet is a renderer for planetary and Solar System images, capable of producing various types of graphics depicting the Solar System. It is normally used to create computer wallpapers, which may be updated with the latest cloud maps or the regions of Earth which are in sunlight. Xplanet is free software released under the GNU GPL.
Flat maps
Xplanet can be used to produce projected maps of any planet (but typically Earth), for example Mollweide projections which show the whole Earth at once, or Mercator projections with a rectangular appearance suitable for filling the screen.
It is possible to overlay clouds or text (such as the location of recent events) onto these maps; a popular option is shading areas currently experiencing night.
Planetary images
Xplanet can also be used to render more general views of objects in the Solar System, such as a view of the Earth from the Moon. In more recent versions, Xplanet depicts eclipses, and some of its images show Jupiter's moons casting an eclipse onto the planet.
Technical
Xplanet runs on Linux, Mac OS X and other Unix operating systems and also on Microsoft Windows, and was derived from an older Unix application called xearth.
It can either generate wallpaper, save the resulting image, or produce textual output detailing the locations of various objects.
Configuration is done by modifying a text file. The Windows version comes with a simple editor called winXPlanetBG to assist in updating the configurations and helps to download the cloud maps automatically. OSXplanet is an interactive wallpaper derivative for the Mac OS X.
Incorporation into other utilities
The c-squares mapper, a web-based mapping utility constructed at CSIRO in Australia in 2002 for displaying the spatial extent of c-squares on the surface of the Earth, was upgraded in 2005–2006 to incorporate Xplanet software in order to display "globe views" (example at right). These views are user-rotatable and zoomable and can offer more realistic views for either Pacific Ocean- or polar- centred data than are possible with a flat map (e.g. equirectangular) projection. A technical description of the c-squares mapper installation process (version 3 onwards), which also requires installation of Xplanet, is available at http://www.marine.csiro.au/csquares/mapper_README.html (also available via Sourceforge).
XplanetFX
XplanetFX is a GTK-frontend for Xplanet under Linux. It provides a simple to use GUI to configure Xplanet and schedule renderings. It also claims to produce higher quality renderings. XplanetFX is free software released under a permissive vanity license.
See also
Wikipedia:Producing maps with xplanet
EarthDesk
References
External links
Project page
winXPlanetBG a Windows GUI
Sample output of xplanet: ISS-Position
Sample output of xplanet: Mercator view of earth enhanced with various data like satellites, quakes, active volcanos
XplanetFX a Linux GUI
GIS software
Free science software
Astronomy software
Free educat |
https://en.wikipedia.org/wiki/Bicycle%20Network | Bicycle Network is an Australian charity, one of the largest cycling membership organisations in the world (45,000 members, 2015), whose mission is to have More People Cycling More Often. Before 2011 it was known as Bicycle Victoria.
Bicycle Network is financially self-supporting and independent. It is primarily funded by its major events and membership subscriptions. Some events and programs receive specific government and commercial sponsorship, though Bicycle Network maintains financial independence as an organisation. This independence allows the organisation to lobby in the interests of bicycle riders without perceived external financial pressure, although this is debated by critics (see below).
Currently, Bicycle Network employs about 60 permanent staff and has a number of additional staff on contract for events and special projects, as well as using the services of volunteers for events. Alison McCormack became the first female CEO in 2022, succeeding Craig Richards, and has campaigned for increasing the numbers of women cyclists. Before Richards, Harry Barber had been the CEO since 1996. Bicycle Network has its head office in Melbourne, and an office in Hobart, Tasmania. They also have a workshop in Sunshine North, Victoria.
History
1970s
The organisation was established in 1975 as the Bicycle Institute of Victoria. It became an incorporated association in 1986 and a new constitution was adopted on 7 November 2005. Incorporation and the formal renaming of the organisation to Bicycle Victoria occurred on 5 December 2005.
The formation of the Bicycle Institute of Victoria in 1974 was instigated by Brian Dixon MP, Victorian State Government Minister for Youth, Sport and Recreation. Dixon, creator of the famous Life. Be in it. fitness campaign, brought together a group of bicycle advocates, including Keith Dunstan, to help form the BIV. Dunstan went on to become the founding president of the Institute. Rupert Hamer's Government also formed the State Bicycle Committee (SBC) which was originally within the Ministry of Transport. Under Dixon, the SBC reported directly to the Minister. Only after about 1990 did it have to report through VicRoads.
When Bicycle Victoria was founded in 1975, the renaissance of cycling in Australia was gathering momentum. Bikes were becoming popular again for recreation and cyclists were becoming accepted on the road once more. Founding president, Keith Dunstan, records in his memoir Confessions of a Bicycle Nut: "By the late 70s I was called a '—–– idiot' only once a month instead of every day".
In April 1976, the first edition of the newsletter Pedal Power announced that the fledgling Bicycle Institute of Victoria aimed to cater "for the need of the majority of cyclists who urgently need safe, convenient and pleasant places to ride". The chief campaigners were Dunstan and Alan Parker, who immediately began pressuring State and local government on everything from lanes on roads to citywide planning.
In 197 |
https://en.wikipedia.org/wiki/DONKEY.BAS | Donkey, often known by its filename DONKEY.BAS, is a video game written in 1981, and included with early versions of the IBM PC DOS operating system distributed with the original IBM PC. It is a top-down driving game in which the player must avoid hitting donkeys. The game was written by Microsoft co-founder Bill Gates and early employee Neil Konzen.
Although on the game's title screen it is simply named Donkey, it is often referred to by its filename of DONKEY.BAS. All BASIC programs used the ".BAS" extension, and MS-DOS compatible operating systems that came before Windows 95 display file names in upper case. These conventions are often maintained when the game is referred to in writing.
Gameplay
DONKEY.BAS is a simple driving game in which the player controls a car but cannot steer, accelerate or brake, only changing lanes to avoid a series of donkeys on the road. There is no goal other than to avoid donkeys.
The game uses the CGA display mode, the only colour graphics mode available on the original IBM PC. The mode allows four colours but in DONKEY.BAS there are usually only three on screen.
The center of the screen shows a vertical scrolling road with two lanes; the areas on either side of the road are used for scores and instructions. The player's car is driving up the road and every few seconds a donkey will appear at random on one side of the road at the top of the screen. As the donkey moves down the screen, the player can press the space bar to switch between lanes to avoid the donkey. If the car hits the donkey, both car and donkey explode, and parts of the graphics are scattered to the four corners of the screen to the sound of a short monophonic tune played through the PC speaker, with the word "BOOM!" displayed on the left side of the screen. If the player avoids the donkey, it will scroll off the bottom of the screen, with the words "Donkey loses!" displayed on the right side of the screen, and after a few seconds another will appear. There is never more than one donkey on the screen at any one time.
The game keeps the score between the player and the donkeys. If the car hits a donkey, the donkey gets a point and the player is returned to the start of the road. As the car avoids donkeys, it moves slowly up the screen, giving the player less time to react when donkeys appear. If the car avoids enough donkeys, the player receives a point and the car is moved back to the bottom of the road. The game displays the number of points earned by the player and donkey, but does not end or change when a particular score is reached.
The Esc key quits the game.
Sprites are rendered slightly differently between the QBasic interpreter and the original IBM BASICA/GW-BASIC interpreter.
Development
When IBM was developing its personal computer in the late 1970s and early 1980, it contracted Microsoft to develop an operating system and a version of the BASIC programming language to release with the new computer. The operating system was re |
https://en.wikipedia.org/wiki/WGIB | WGIB (91.9 FM) is a non-profit radio station that originates programming from Birmingham, Alabama, United States. The station is currently owned by Glen Iris Baptist School, and is licensed to serve Birmingham, Alabama, United States. The station was assigned the WGIB call letters by the Federal Communications Commission on September 20, 1982.
WGIB is relayed on a series of low-powered FM translators and full-powered WQEM at 101.5 MHz in Columbiana, Alabama. The station's audio is also streamed on the internet.
Simulcast
WQEM (101.5 FM) is a radio station broadcasting a Religious radio format as a simulcast of WGIB. WQEM is licensed to serve Columbiana, Alabama, USA. The station is currently owned by Glen Iris Baptist School.
WQEM was purchased from Clear Channel Communications in 2002. Glen Iris kept the WQEM call sign for the station after its purchase. The station was assigned the WQEM call letters by the Federal Communications Commission on August 3, 1998. Before its purchase by Glen Iris Baptist School, WQEM served as a repeater of Top 40 station WQEN, whose signal at the time did not adequately cover the southern suburbs of Birmingham.
Translators
See also
W16DS-D, a co-owned low-power television station
References
External links
WGIB Online
WQEM Online
GIB
GIB
Radio stations established in 1984
Jefferson County, Alabama
1984 establishments in Alabama |
https://en.wikipedia.org/wiki/Schrijver | Schrijver means "writer" in Dutch. As a surname, it may refer to various people. See:
Schrijver
Alexander Schrijver (b. 1948), Dutch mathematician and computer scientist
Isaq Schrijver (c. 1650 – c. 1706), Dutch explorer in South Africa
Loretta Schrijver (b. 1956), Dutch television host
Peter Schrijver (1576–1660), Dutch writer and scholar better known as "Petrus Scriverius"
Peter Schrijver (b. 1963), Dutch linguist and Celtologist
Skriver
Ina Skriver (b. 1949), Danish actress and model
Josephine Skriver (b. 1993), Danish model
Schrijvers
:de:Petrus Hermanus Schrijvers (b. 1939), Dutch classical philologist (predominantly Latinist), also known as Piet Schrijvers
Piet Schrijvers (1946–2022), Dutch football goalkeeper and manager
Siebe Schrijvers (b. 1996), Belgian footballer
De Schrijver
:de:Karel De Schrijver (1908–1992), Belgian composer, conductor and violinist
Maurits De Schrijver (b. 1951), Belgian footballer
Jean De Schryver (1916–unknown), Belgian boxer
Dutch-language surnames
Occupational surnames |
https://en.wikipedia.org/wiki/Anti-phishing%20software | Anti-phishing software consists of computer programs that attempt to identify phishing content contained in websites, e-mail, or other forms used to accessing data (usually from the internet) and block the content, usually with a warning to the user (and often an option to view the content regardless). It is often integrated with web browsers and email clients as a toolbar that displays the real domain name for the website the viewer is visiting, in an attempt to prevent fraudulent websites from masquerading as other legitimate websites.
Most popular web browsers comes with built-in anti-phishing and anti-malware protection services, but almost none of the alternate web browsers have such protections.
Password managers can also be used to help defend against phishing, as can some mutual authentication techniques.
Types of anti-phishing software
Email security
According to Gartner, "email security refers collectively to the prediction, prevention, detection and response framework used to provide attack protection and access protection for email." Email security solution may be : Email security spans gateways, email systems, user behavior, content security, and various supporting processes, services and adjacent security architecture.
Security awareness computer-based training
According to Gartner, security awareness training include one or more of the following capabilities: Ready-to-use training and educational content, Employee testing and knowledge checks, Availability in multiple languages, Phishing and other social engineering attack simulations, Platform and awareness analytics to help measure the efficacy of the awareness program.
Notable client-based anti-phishing programs
avast!
Avira Premium Security Suite
Earthlink ScamBlocker (discontinued)
eBay Toolbar
Egress Defend
ESET Smart Security
G Data Software G DATA Antivirus
GeoTrust TrustWatch
Google Safe Browsing (used in Mozilla Firefox, Google Chrome, Opera, Safari, and Vivaldi)
Kaspersky Internet Security (discontinued)
Kaspersky Anti-Virus (discontinued)
McAfee SiteAdvisor
Microsoft SmartScreen (used in Microsoft Edge, Internet Explorer, and Microsoft Outlook)
Mozilla Thunderbird
Netcraft Toolbar
Netscape
Norton 360
Norton Internet Security
PhishTank SiteChecker
Quick Heal
Windows Mail - default Windows Vista e-mail client
WOT (Web Of Trust) - browser extension
ZoneAlarm
Service-based anti-phishing
Google Safe Browsing
OpenDNS
PhishTank
Anti-phishing effectiveness
An independent study conducted by Carnegie Mellon University CyLab titled "Phinding Phish: An Evaluation of Anti-Phishing Toolbars" and released November 13, 2006 tested the ability of ten anti-phishing solutions to block or warn about known phishing sites and not block or warn about legitimate sites (not exhibit false-positives), as well as the usability of each solution. Of the solutions tested, Netcraft Toolbar, EarthLink ScamBlocker and SpoofGuard were able to correctly identify over 75% of the sites teste |
https://en.wikipedia.org/wiki/Methanopyri | In taxonomy, the Methanopyri are a class of the Euryarchaeota.
References
Further reading
Scientific journals
Scientific books
Scientific databases
External links
Archaea classes
Euryarchaeota |
https://en.wikipedia.org/wiki/Empirical%20risk%20minimization | Empirical risk minimization (ERM) is a principle in statistical learning theory which defines a family of learning algorithms and is used to give theoretical bounds on their performance. The core idea is that we cannot know exactly how well an algorithm will work in practice (the true "risk") because we don't know the true distribution of data that the algorithm will work on, but we can instead measure its performance on a known set of training data (the "empirical" risk).
Background
Consider the following situation, which is a general setting of many supervised learning problems. We have two spaces of objects and and would like to learn a function (often called hypothesis) which outputs an object , given . To do so, we have at our disposal a training set of examples where is an input and is the corresponding response that we wish to get from .
To put it more formally, we assume that there is a joint probability distribution over and , and that the training set consists of instances drawn i.i.d. from . Note that the assumption of a joint probability distribution allows us to model uncertainty in predictions (e.g. from noise in data) because is not a deterministic function of but rather a random variable with conditional distribution for a fixed .
We also assume that we are given a non-negative real-valued loss function which measures how different the prediction of a hypothesis is from the true outcome . For classification tasks these loss functions can be scoring rules.
The risk associated with hypothesis is then defined as the expectation of the loss function:
A loss function commonly used in theory is the 0-1 loss function: .
The ultimate goal of a learning algorithm is to find a hypothesis among a fixed class of functions for which the risk is minimal:
For classification problems, the Bayes classifier is defined to be the classifier minimizing the risk defined with the 0–1 loss function.
Empirical risk minimization
In general, the risk cannot be computed because the distribution is unknown to the learning algorithm (this situation is referred to as agnostic learning). However, we can compute an approximation, called empirical risk, by averaging the loss function on the training set; more formally, computing the expectation with respect to the empirical measure:
The empirical risk minimization principle states that the learning algorithm should choose a hypothesis which minimizes the empirical risk:
Thus the learning algorithm defined by the ERM principle consists in solving the above optimization problem.
Properties
Computational complexity
Empirical risk minimization for a classification problem with a 0-1 loss function is known to be an NP-hard problem even for a relatively simple class of functions such as linear classifiers. Nevertheless, it can be solved efficiently when the minimal empirical risk is zero, i.e., data is linearly separable.
In practice, machine learning algorithms cope with thi |
https://en.wikipedia.org/wiki/Case%20preservation | When a computer file system stores file names, the computer may keep or discard case information. When the case is stored, it is called case preservation.
A system that is not case-preserving is necessarily case-insensitive, but it is possible and common for a system to be case-insensitive, yet case-preserving. This combination is often considered most natural for people to understand, because most people prefer using the correct capitalization but will still recognize others. For example, if someone refers to the "uNiTeD states oF AMERICA," it is understood to mean the United States of America, even though the capitalization is incorrect.
macOS, current versions of the Microsoft Windows operating systems and all versions of Amiga OS are case-preserving and case-insensitive in most cases. Since they are case-insensitive, when requesting a file by name any capitalization can be used, in contrast to case-sensitive systems where only a single capitalization would work. But as they are case-preserving, when viewing a file's name it will be presented with the capitalization used when the file was created. On a non-case-preserving system, arbitrary capitalization would be displayed instead, such as all upper- or lower-case. Also, in case-insensitive but case preserving file systems there cannot be a readme.txt and a Readme.txt in the same folder.
Examples of systems with various case-sensitivity and case-preservation exist among file systems:
Computer file systems |
https://en.wikipedia.org/wiki/Fujitsu%20Siemens%20Computers | Fujitsu Siemens Computers GmbH was a Japanese and German vendor of information technology. The company was founded in 1999 as a 50/50 joint venture between Fujitsu Limited of Japan and Siemens of Germany. On April 1, 2009, the company became Fujitsu Technology Solutions as a result of Fujitsu buying out Siemens' share of the company.
The offerings of Fujitsu Siemens Computers extended from handheld and notebook PCs through desktops, server and storage, to IT data center products and services. Fujitsu Siemens Computers had a presence in key markets across Europe, the Middle East and Africa, while products marketed elsewhere were sold under the Fujitsu brand, with the services division extending coverage up to 170 countries worldwide.
Fujitsu Siemens Computers placed a focus on "green" computers, and was considered a leader or innovator in Green IT, across ecological and environmental markings such as Energy Star and Nordic swan.
Fujitsu Siemens sponsored McLaren Mercedes Formula-1 team in 1999 and 2000.
History
On the Fujitsu side, the origins of the company could be traced back to the mid-1980s merger of the PC divisions of Finnish Nokia and Swedish Ericsson, when Ericsson PCs were known for their ergonomics and bright colors. In 1991, Nokia Data was sold to the British International Computers Limited (ICL). Later ICL was absorbed by Fujitsu. Ironically, Fujitsu was originally the data division of Fuji Electric, whose name was derived from its founders; "Fu" from the Furukawa Electric zaibatsu, and "Ji" from jiimensu, the Japanese transliteration for Siemens.
The Nokia MikroMikko line of compact desktop computers continued to be produced at the Kilo factories in Espoo, Finland. Components, including motherboards and Ethernet network adapters were manufactured locally, until production was moved to Taiwan. Internationally the MikroMikko line was marketed by Fujitsu as the ErgoPro.
Also on the Fujitsu side, the company fully acquired Amdahl corporation in 1997 which was a manufacturer of IBM compatible mainframes. The mainframe market was an area where Siemens also had a strong presence in, especially in Europe. The mainframe strategy of Siemens was different however as it produced its own line of mainframes that were not IBM compatible. Before the acquisition of Amdahl, Fujitsu also already had its own division that produced IBM compatible mainframes so the Amdahl acquisition was part of a market consolidation effort.
The German half of the company, Siemens Nixdorf Informationssysteme, was the result of the merger of Nixdorf Computer with Siemens' data and information technology branch.
In 2003, the company won the Wharton Infosys Business Transformation Award for their use of information technology in an industry-transforming way.
It was announced in November 2008 that Fujitsu would buy out Siemens' stake in the joint venture for approximately €450m with effect from April 1, 2009. Fujitsu Siemens was the last major Japanese/European com |
https://en.wikipedia.org/wiki/Work%20Flow%20Language | Work Flow Language, or WFL ("wiffle") is the process control language for the Burroughs large systems, including the Unisys ClearPath/MCP series, and their operating system Master Control Program. Developed soon after the B5000 in 1961, WFL is the ClearPath equivalent of the Job Control Language (JCL) on IBM mainframes and the shell scripts of Unix-like operating systems. Unlike JCL, WFL is a high-level structured language complete with subroutines (procedures and functions) with arguments and high-level program control flow instructions. WFL programs are compiled to binary executables like any other MCP subject.
WFL is used for high-level system operations, such as running tasks, moving and copying files, providing high-level recoverability. Thus it is not a general purpose language in that you would not use it to do general computations. You can open and close files to check their attributes for example; however, you cannot read or change their contents in WFL – that you do in a general purpose language, and invoke it as a task from WFL.
WFL has a high-level ALGOL-like readable syntax. It has none of the low-level assembler-like commands of JCL like //SYSIN DD, etc. in order to connect hardware devices and open files for programs. All WFL constructs deal with the high-level abstractions of tasks and files. Parameters are also real HLL parameters, not the $1, $2... style position parameters of shell scripts.
WFL also has an instruction block command which is used to give operators instructions needed to run the current job. These instructions are displayed using the 'IB' operator command.
WFL was a compiled language on the medium systems. Because some OS interfaces may change from release to release, Medium Systems WFL code included a copy of the source in the object file. Upon executing a WFL job it would check to determine if the object was compatible with the OS version. If not it would trigger a recompile of the object using the source embedded in the object code.
See also
Burroughs large systems
Sources
ALGOL 60 dialect
Burroughs mainframe computers
Scripting languages
Mainframe computer software |
https://en.wikipedia.org/wiki/Sudden%20Motion%20Sensor | The Sudden Motion Sensor (SMS) is Apple's motion-based data protection system used in their notebook computer systems. Apple introduced the system January 1, 2005 in its refreshed PowerBook line, and included it in the iBook line July 26, 2005. Since that time, Apple has included the system in all of their non-SSD portable systems (since October 2006), now the MacBook Pro and MacBook Air.
With a triaxial accelerometer, the shock detector detects sudden acceleration, such as when the computer is dropped, and prepares the relatively fragile hard disk drive mechanism for impact. The system disengages the disk drive heads from the hard disk platters, preventing data loss and drive damage from a disk head crash. When the computer is stable, the drive operates normally again. A clicking noise can be heard when the sudden motion sensor activates.
Broadly speaking, there have been two types of Sudden Motion Sensor. The sensor used in the G4-based laptops resolved shifts of 1/52 g (e.g. the dynamic range was close to 6-bit), while the sensor used in the current Intel-based laptops have an 8-bit resolution (250 scale divisions). In at least one model of Intel-based laptop, the MacBook Pro 15", Apple uses the Kionix KXM52-1050 three-axis accelerometer chip, with dynamic range of +/- 2g and bandwidth up to 1.5 kHz.
Aftermarket hardware problems
Among the MacBook and MacBook Pro community there have been several owners who installed aftermarket hard drives already equipped with anti-shock features who reported experiencing kernel panic errors whenever their unit was physically moved. This is believed to be due to a conflict between SMS and the new drive's anti-shock function. The Western Digital Scorpio series of notebook hard drives have been the most frequently reported as being susceptible to this problem. In practically all cases, disabling SMS alleviated this problem without any negative performance impact.
See also
Active hard-drive protection
External links
Apple.com: Sudden Motion Sensor disable instructions
SeisMac: Displays seismic data obtained from your SMS
AMSTracker by Amit Singh, Command line utility for reading data from the Sudden Motion Sensor
Macintosh computers |
https://en.wikipedia.org/wiki/Globe%20Telecom | Globe Telecom, Inc., commonly shortened as Globe, is a major provider of telecommunications services in the Philippines. The company operates the largest mobile network in the Philippines and one of the largest fixed-line and broadband networks.
The company's principal shareholders are Ayala Corporation and Singtel. It is listed on the Philippine Stock Exchange under the ticker symbol GLO and had a market capitalization, capitalization loan from Philippine Gold Reserves worth ₱363 billion in Physical Currency as accounted including profit' rolling thru every employee and infrastructure at the end of August 2021, Seventy percent of which represent the electronic Token for loading. Globe Group even bought gold from mining companies to be sold to Bangko Sentral ng Pilipinas.
Globe offers commercial wireless services through its 2G, 3G, 3.5G HSPA+, 4G LTE, and LTE-A networks, with 5G currently being deployed in key areas in the Philippines. Its 5G coverage is available in over 3,000 locations all over the country, and nearly 100% of the population in the National Capital Region, Davao City, and Cebu.
In 2016, Globe introduced its Globe Lifestyle brand as a way to connect to its customers through fashion. It also launched two entertainment divisions: Anima (formerly Globe Studios), which focuses on film and television production, and Globe Live, which focuses on live concerts and musical events.
History
On December 8, 1928, the Philippine Legislature passed Act No. 3495 granting the Robert Dollar Company (a corporation organized and existing under the laws of the State of California), a franchise to operate wireless long-distance message services in the Philippines. Subsequently, the Legislature passed Act No. 4150 on November 28, 1934, to transfer the franchise and privileges of the Robert Dollar Company to Globe Wireless Limited, which was incorporated in the Philippines on January 15, 1935.
In 1965, Globe Wireless Limited was merged with Mackay Radio & Telegraph Company and Philippine Press Wireless to form Globe-Mackay Cable and Radio Corporation ("Globe-Mackay"), with the transfer of Mackay's franchise to Globe Wireless Limited approved by the Congress through Republic Act No. 4491 enacted on June 19, 1965. By Republic Act No. 4630 enacted in the same date by the Congress, its franchise was further expanded to allow Globe-Mackay to operate international communications systems. Globe-Mackay was granted a new franchise on December 24, 1980, by Batasang Pambansa, under Batas Pambansa Blg. 95, extending it for 50 years.
In 1974, Ayala Corporation began its investing in Globe-Mackay. Globe-Mackay offered its shares to the public on August 11, 1975, becoming the first telecommunications company in the country to do so.
In 1991, Globe-Mackay merged with Clavecilla Radio Corporation, a domestic telecommunications pioneer, to form GMCR, Inc. The merger gave GMCR the capability to provide all forms of telecommunications to address the internation |
https://en.wikipedia.org/wiki/UDBC | UDBC may refer to:
Open Database Connectivity
United Districts Basketball Club
Ural Drum&Bass Community |
https://en.wikipedia.org/wiki/Novell%20Storage%20Services | Novell Storage Services (NSS) is a file system used by the Novell NetWare operating system. Support for NSS was introduced in 2004 to SUSE Linux via low-level network NCPFS protocol. It has some unique features that make it especially useful for setting up shared volumes on a file server in a local area network.
NSS is a 64-bit journaling file system with a balanced tree algorithm for the directory structure. Its published specifications (as of NetWare 6.5) are:
Maximum file size: 8 EB
Maximum partition size: 8 EB
Maximum device size (Physical or Logical): 8 EB
Maximum pool size: 8 EB
Maximum volume size: 8 EB
Maximum files per volume: 8 trillion
Maximum mounted volumes per server: unlimited if all are NSS
Maximum open files per server: no practical limit
Maximum directory tree depth: limited only by client
Maximum volumes per partition: unlimited
Maximum extended attributes: no limit on number of attributes.
Maximum data streams: no limit on number of data streams.
Unicode characters supported by default
Support for different name spaces: DOS, Microsoft Windows Long names (loaded by default), Unix, Apple Macintosh
Support for restoring deleted files (salvage)
Support for transparent compression
Support for encrypted volumes
Support for data shredding
See also
NetWare File System (NWFS)
Comparison of file systems
List of file systems
External links
Article about NSS
Novell Storage Services - Features
Compression file systems
Disk file systems
Novell NetWare |
https://en.wikipedia.org/wiki/Slipstream%205000 | Slipstream 5000 is a 3D airplane combat/racing video game developed by The Software Refinery and published by Gremlin Interactive for IBM PC compatible computers in July 1995.
Release
The game is compatible with DOS as well as Windows 95 and Windows 98 via their native DOS support. Later versions of Windows based on the NT kernel have issues with running the game, but it can be run successfully via DOSBox. It was also distributed free with Classic Logitech Wingman Extreme Joysticks during the 1990s. GOG.com released an emulated version for Microsoft Windows, Linux and Mac OS X in 2011.
Slipstream was an unreleased conversion of Slipstream 5000 which in 1996 was being prepared for the Sony PlayStation platform's Japanese market (it was supposed to be later completely reshaped for its European release). Little was publicised about this title, besides its "urban manga" look as the ships were being designed by the Japanese manga artists. It was also in development for the Sega Saturn. Since the 2010s, it has been available for purchase via the website Good Old Games as well as Steam.
Reception
Although sales were not very high due to stiff competition from consoles, the game was generally well received, having 3D graphics and gameplay advanced for its time. While it was soon superseded by console games with superior graphics, Slipstream 5000 was later described as having been years ahead of its competition. PC Gamer magazine US rated it at 89%.
Next Generation gave the PC version of the game three stars out of five.
References
External links
Slipstream 5000 at GameFAQs
1995 video games
Cancelled PlayStation (console) games
DOS games
Flight simulation video games
Science fiction racing games
Games commercially released with DOSBox
Gremlin Interactive games
Linux games
MacOS games
Windows games
Video games developed in the United Kingdom
Multiplayer and single-player video games
The Software Refinery games |
https://en.wikipedia.org/wiki/Dynamic%20array | In computer science, a dynamic array, growable array, resizable array, dynamic table, mutable array, or array list is a random access, variable-size list data structure that allows elements to be added or removed. It is supplied with standard libraries in many modern mainstream programming languages. Dynamic arrays overcome a limit of static arrays, which have a fixed capacity that needs to be specified at allocation.
A dynamic array is not the same thing as a dynamically allocated array or variable-length array, either of which is an array whose size is fixed when the array is allocated, although a dynamic array may use such a fixed-size array as a back end.
Bounded-size dynamic arrays and capacity
A simple dynamic array can be constructed by allocating an array of fixed-size, typically larger than the number of elements immediately required. The elements of the dynamic array are stored contiguously at the start of the underlying array, and the remaining positions towards the end of the underlying array are reserved, or unused. Elements can be added at the end of a dynamic array in constant time by using the reserved space, until this space is completely consumed. When all space is consumed, and an additional element is to be added, then the underlying fixed-size array needs to be increased in size. Typically resizing is expensive because it involves allocating a new underlying array and copying each element from the original array. Elements can be removed from the end of a dynamic array in constant time, as no resizing is required. The number of elements used by the dynamic array contents is its logical size or size, while the size of the underlying array is called the dynamic array's capacity or physical size, which is the maximum possible size without relocating data.
A fixed-size array will suffice in applications where the maximum logical size is fixed (e.g. by specification), or can be calculated before the array is allocated. A dynamic array might be preferred if:
the maximum logical size is unknown, or difficult to calculate, before the array is allocated
it is considered that a maximum logical size given by a specification is likely to change
the amortized cost of resizing a dynamic array does not significantly affect performance or responsiveness
Geometric expansion and amortized cost
To avoid incurring the cost of resizing many times, dynamic arrays resize by a large amount, such as doubling in size, and use the reserved space for future expansion. The operation of adding an element to the end might work as follows:
function insertEnd(dynarray a, element e)
if (a.size == a.capacity)
// resize a to twice its current capacity:
a.capacity ← a.capacity * 2
// (copy the contents to the new memory location here)
a[a.size] ← e
a.size ← a.size + 1
As n elements are inserted, the capacities form a geometric progression. Expanding the array by any constant proportion a ensures that inserting n e |
https://en.wikipedia.org/wiki/Setpoint%20%28control%20system%29 | In cybernetics and control theory, a setpoint (SP; also set point) is the desired or target value for an essential variable, or process value (PV) of a control system, which may differ from the actual measured value of the variable. Departure of such a variable from its setpoint is one basis for error-controlled regulation using negative feedback for automatic control. A setpoint can be any physical quantity or parameter that a control system seeks to regulate, such as temperature, pressure, flow rate, position, speed, or any other measurable attribute.
In the context of PID controller, the setpoint represents the reference or goal for the controlled process variable. It serves as the benchmark against which the actual process variable (PV) is continuously compared. The PID controller calculates an error signal by taking the difference between the setpoint and the current value of the process variable. Mathematically, this error is expressed as:
where is the error at a given time , is the setpoint, is the process variable at time .
The PID controller uses this error signal to determine how to adjust the control output to bring the process variable as close as possible to the setpoint while maintaining stability and minimizing overshoot.
Examples
Cruise control
The error can be used to return a system to its norm. An everyday example is the cruise control on a road vehicle; where external influences such as gradients cause speed changes (PV), and the driver also alters the desired set speed (SP). The automatic control algorithm restores the actual speed to the desired speed in the optimum way, without delay or overshoot, by altering the power output of the vehicle's engine. In this way the error is used to control the PV so that it equals the SP. A widespread of error is classically used in the PID controller.
Industrial applications
Special consideration must be given for engineering applications. In industrial systems, physical or process restraints may limit the determined set point. For example, a reactor which operates more efficiently at higher temperatures may be rated to withstand 500°C. However, for safety reasons, the set point for the reactor temperature control loop would be well below this limit, even if this means the reactor is running less efficiently.
See also
Process control
Proportional–integral–derivative controller
References
Classical control theory
Control devices
Control engineering
Control loop theory
Cybernetics
Process engineering |
https://en.wikipedia.org/wiki/KBMY | KBMY (channel 17) is a television station in Bismarck, North Dakota, United States, affiliated with ABC and MyNetworkTV. Owned by Forum Communications Company, the station maintains a news bureau and advertising sales office on North 15th Street in Bismarck, and its transmitter is located near St. Anthony, North Dakota.
Although identifying as a separate station in its own right, KBMY is considered a semi-satellite of sister station and company flagship WDAY-TV (channel 6) in Fargo, which operates semi-satellite WDAZ-TV (channel 8) in Grand Forks. Internal operations are housed at WDAY-TV's studios on South 8th Street in Fargo. KBMY clears all network programming as provided through its parent WDAY-TV and simulcasts WDAY-TV's newscasts, but airs a separate offering of syndicated programming; there are also separate commercial inserts and legal station identifications.
KMCY (channel 14) in Minot, North Dakota operates as a semi-satellite of KBMY extending the ABC/MyNetworkTV signal into the northern half of the Bismarck–Minot market; this station's news bureau and advertising sales office are located on 2nd St SE in Minot, and its transmitter is located near South Prairie. KMCY simulcasts all network and syndicated programming as provided through KBMY but airs separate local commercial inserts and legal identifications.
History
KBMY signed on for the first time on March 31, 1985, and KMCY signed on for the first time in June 1985; bringing the full ABC schedule to central and western North Dakota and eastern Montana for the first time ever. Before 1985, this area had been one of the last in the United States without full network service. ABC was limited to off-hours clearances on KX Television (KXMC/KXMD/KXMB/KXMA) and Meyer Television (KFYR/KQCD/KMOT/KUMV). From the 1970s onward, some cable subscribers in western North Dakota received the full ABC schedule from KULR-TV (now NBC) from Billings, KFBB-TV from Great Falls, KOTA-TV from Rapid City or KUSA in Denver. The eastern half of the market was served by Fargo's KTHI-TV (now KVLY-TV) until it swapped affiliations with WDAY/WDAZ in 1983. From 1983 onward, cable systems in Bismarck piped in WDAY-TV, while cable systems in Minot piped in WDAZ.
On paper, western North Dakota had been large enough to support three full network affiliates since at least the late 1960s. However, this region is one of the largest geographic markets in the nation, spilling across large slices of North Dakota, Montana, and South Dakota. It is so vast that KX Television and Meyer Television both need four full-power stations to adequately cover it. On paper, the FCC collapsed central and western North Dakota into one giant market in 1957. However, the market was not fully realized until 1980, when Meyer upgraded its low-powered translator in Dickinson to full-powered KQCD, prompting Dickinson's original station, KDIX-TV (now KXMA) to become a separately-owned satellite of KX Television. Additionally, the only available |
https://en.wikipedia.org/wiki/Small-world%20network | A small-world network is a mathematical graph in which most nodes are not neighbors of one another, but the neighbors of any given node are likely to be neighbors of each other. Due to this, most neighboring nodes can be reached from every other node by a small number of hops or steps. Specifically, a small-world network is defined to be a network where the typical distance L between two randomly chosen nodes (the number of steps required) grows proportionally to the logarithm of the number of nodes N in the network, that is:
while the global clustering coefficient is not small.
In the context of a social network, this results in the small world phenomenon of strangers being linked by a short chain of acquaintances. Many empirical graphs show the small-world effect, including social networks, wikis such as Wikipedia, gene networks, and even the underlying architecture of the Internet. It is the inspiration for many network-on-chip architectures in contemporary computer hardware.
A certain category of small-world networks were identified as a class of random graphs by Duncan Watts and Steven Strogatz in 1998. They noted that graphs could be classified according to two independent structural features, namely the clustering coefficient, and average node-to-node distance (also known as average shortest path length). Purely random graphs, built according to the Erdős–Rényi (ER) model, exhibit a small average shortest path length (varying typically as the logarithm of the number of nodes) along with a small clustering coefficient. Watts and Strogatz measured that in fact many real-world networks have a small average shortest path length, but also a clustering coefficient significantly higher than expected by random chance. Watts and Strogatz then proposed a novel graph model, currently named the Watts and Strogatz model, with (i) a small average shortest path length, and (ii) a large clustering coefficient. The crossover in the Watts–Strogatz model between a "large world" (such as a lattice) and a small world was first described by Barthelemy and Amaral in 1999. This work was followed by many studies, including exact results (Barrat and Weigt, 1999; Dorogovtsev and Mendes; Barmpoutis and Murray, 2010).
Properties of small-world networks
Small-world networks tend to contain cliques, and near-cliques, meaning sub-networks which have connections between almost any two nodes within them. This follows from the defining property of a high clustering coefficient. Secondly, most pairs of nodes will be connected by at least one short path. This follows from the defining property that the mean-shortest path length be small. Several other properties are often associated with small-world networks. Typically there is an over-abundance of hubs – nodes in the network with a high number of connections (known as high degree nodes). These hubs serve as the common connections mediating the short path lengths between other edges. By analogy, the small-world net |
https://en.wikipedia.org/wiki/Transport%20network%20analysis | A transport network, or transportation network, is a network or graph in geographic space, describing an infrastructure that permits and constrains movement or flow.
Examples include but are not limited to road networks, railways, air routes, pipelines, aqueducts, and power lines. The digital representation of these networks, and the methods for their analysis, is a core part of spatial analysis, geographic information systems, public utilities, and transport engineering. Network analysis is an application of the theories and algorithms of graph theory and is a form of proximity analysis.
History
The applicability of graph theory to geographic phenomena was recognized at an early date. Many of the early problems and theories undertaken by graph theorists were inspired by geographic situations, such as the Seven Bridges of Königsberg problem, which was one of the original foundations of graph theory when it was solved by Leonhard Euler in 1736.
In the 1970s, the connection was reestablished by the early developers of geographic information systems, who employed it in the topological data structures of polygons (which is not of relevance here), and the analysis of transport networks. Early works, such as Tinkler (1977), focused mainly on simple schematic networks, likely due to the lack of significant volumes of linear data and the computational complexity of many of the algorithms. The full implementation of network analysis algorithms in GIS software did not appear until the 1990s, but rather advanced tools are generally available today.
Network Data
Network analysis requires detailed data representing the elements of the network and its properties. The core of a network dataset is a vector layer of polylines representing the paths of travel, either precise geographic routes or schematic diagrams, known as edges. In addition, information is needed on the network topology, representing the connections between the lines, thus enabling the transport from one line to another to be modeled. Typically, these connection points, or nodes, are included as an additional dataset.
Both the edges and nodes are attributed with properties related to the movement or flow:
Capacity, measurements of any limitation on the volume of flow allowed, such as the number of lanes in a road, telecommunications bandwidth, or pipe diameter.
Impedance, measurements of any resistance to flow or to the speed of flow, such as a speed limit or a forbidden turn direction at a street intersection
Cost accumulated through individual travel along the edge or through the node, commonly elapsed time, in keeping with the principle of friction of distance. For example, a node in a street network may require a different amount of time to make a particular left turn or right turn. Such costs can vary over time, such as the pattern of travel time along an urban street depending on diurnal cycles of traffic volume.
Flow volume, measurements of the actual movement taking place. This |
https://en.wikipedia.org/wiki/Clustering%20coefficient | In graph theory, a clustering coefficient is a measure of the degree to which nodes in a graph tend to cluster together. Evidence suggests that in most real-world networks, and in particular social networks, nodes tend to create tightly knit groups characterised by a relatively high density of ties; this likelihood tends to be greater than the average probability of a tie randomly established between two nodes (Holland and Leinhardt, 1971; Watts and Strogatz, 1998).
Two versions of this measure exist: the global and the local. The global version was designed to give an overall indication of the clustering in the network, whereas the local gives an indication of the embeddedness of single nodes.
Local clustering coefficient
The local clustering coefficient of a vertex (node) in a graph quantifies how close its neighbours are to being a clique (complete graph). Duncan J. Watts and Steven Strogatz introduced the measure in 1998 to determine whether a graph is a small-world network.
A graph formally consists of a set of vertices and a set of edges between them. An edge connects vertex with vertex .
The neighbourhood for a vertex is defined as its immediately connected neighbours as follows:
We define as the number of vertices, , in the neighbourhood, , of a vertex.
The local clustering coefficient for a vertex is then given by a proportion of the number of links between the vertices within its neighbourhood divided by the number of links that could possibly exist between them. For a directed graph, is distinct from , and therefore for each neighbourhood there are links that could exist among the vertices within the neighbourhood ( is the number of neighbours of a vertex). Thus, the local clustering coefficient for directed graphs is given as
An undirected graph has the property that and are considered identical. Therefore, if a vertex has neighbours, edges could exist among the vertices within the neighbourhood. Thus, the local clustering coefficient for undirected graphs can be defined as
Let be the number of triangles on for undirected graph . That is, is the number of subgraphs of with 3 edges and 3 vertices, one of which is . Let be the number of triples on . That is, is the number of subgraphs (not necessarily induced) with 2 edges and 3 vertices, one of which is and such that is incident to both edges. Then we can also define the clustering coefficient as
It is simple to show that the two preceding definitions are the same, since
These measures are 1 if every neighbour connected to is also connected to every other vertex within the neighbourhood, and 0 if no vertex that is connected to connects to any other vertex that is connected to .
Since any graph is fully specified by its adjacency matrix A, the local clustering coefficient for a simple undirected graph can be expressed in terms of A as:
where:
and Ci=0 when ki is zero or one. In the above expression, the numerator counts twice |
https://en.wikipedia.org/wiki/Gotcha%20%28programming%29 | In programming, a gotcha is a valid construct in a system, program or programming language that works as documented but is counter-intuitive and almost invites mistakes because it is both easy to invoke and unexpected or unreasonable in its outcome.
Example
The classic gotcha in C/C++ is the construct
if (a = b) code;
It is syntactically valid: it puts the value of b into a and then executes code if a is non-zero. Sometimes this is even intended. However most commonly it is a typo: the programmer probably meant
if (a == b) code;
which executes code if a and b are equal. Modern compilers will usually generate a warning when encountering the former construct (conditional branch on assignment, not comparison), depending on compiler options (e.g., the -Wall option for gcc). To avoid this gotcha, there is a recommendation to keep the constants in the left side of the comparison, e.g. 42 == x rather than x == 42. This way, using = instead of == will cause a compiler error (see Yoda conditions). Many kinds of gotchas are not detected by compilers, however.
See also
Usability
References
Further reading
External links
C Traps and Pitfalls by Andrew Koenig
C++ Gotchas A programmer's guide to avoiding and correcting ninety-nine of the most common, destructive, and interesting C++ design and programming errors, by Stephen C. Dewhurst
Computer programming folklore
Programming language folklore
Programming language design |
https://en.wikipedia.org/wiki/Yoichi%20Wada | is a former president and representative director of the Japanese video game and publishing company Square Enix as well as its subsidiary Taito. He is also the former chairman of the Computer Entertainment Supplier's Association (CESA), the former chairman of the Digital Content Use Promotion Conference, former president of Shinra Technologies and a former member of the Japanese Brand and Contents Council. He is a current outside director of Metaps.
Personal life
Wada was born on May 28, 1959, in Nagoya, Aichi, Japan. As a teenager and young student, Wada was a fan of Pong, Space Invaders, Donkey Kong and Xevious. When he lived in Warsaw, he also enjoyed games from the Nobunaga's Ambition and Romance of the Three Kingdoms computer game series. Before joining Square, Wada has stated he was an "uneducated consumer", as he was a "big fan" of Final Fantasy but did not know that the company was responsible for the series. He particularly liked early 3D games, including D and titles from the Myst, Resident Evil and Metal Gear series. While CEO Wada proactively tried to play as many Western games as possible, including Uncharted 2: Among Thieves and Call of Duty: Modern Warfare 2, and provided comments about these games to Square Enix's staff.
Career
Pre-Square years
As a student, Wada wanted to become the president of a company quickly, rather than gradually working his way up through his entire career. He set for himself the objective of becoming a president by the age of 40. After receiving a bachelor's degree in law from the University of Tokyo, he went through an apprenticeship in the financial services group and global investment bank Nomura Securities to build a track record of success. Starting in 1984, he served in the group as part of the corporate strategy division, the investment banking division, and the controller division. He also worked at the Ministry of Foreign Affairs of Japan in Warsaw, Poland. In 2000, he decided to join "a company with a 'theme'" and, thinking that one of the themes of the 21st century was "creating society", chose the video game company Square.
Square and Square Enix
Wada joined Square in April 2000. In June, he became an executive director and chief financial officer, the representative director and chief operating officer in September, and the president and chief executive officer in December. He helped reform the company's management system. When Square merged with Enix, he became the new company's president and representative director. Under his presidency, Square Enix acquired the video game companies Taito in 2005 and the British video game publisher Eidos Interactive in 2009. Wada also became the president and representative director of Taito following the subsidiary's restructuring in July 2006. Wada stated at the time that consolidation was a "part of [his] plan" since 2000, as he had foreseen "the first phase of a major reformation of the industry" and had concluded that "there was a limit to what |
https://en.wikipedia.org/wiki/Russ%20Nelson | Russell Nelson (born March 21, 1958) is an American computer programmer. He was a founding board member of the Open Source Initiative and briefly served as its president in 2005.
Career
In 1983, Nelson and Patrick Naughton wrote Painter's Apprentice, a MacPaint clone. Nelson was the author of Freemacs (a variant of Emacs used by FreeDOS).
While attending university, Nelson began developing the collection of drivers later commercially released as the "Crynwr Collection". In 1991, Nelson founded Crynwr Software, a company located in Potsdam, New York, supporting deployment of large-scale e-mail systems, development of packet drivers, Linux kernel drivers, and reverse engineering of embedded systems.
In July 2010, Nelson was working on water quality sensors.
Open Source Initiative
In 1998, Nelson became one of the six first members of the board of directors of the Open Source Initiative.
On February 1, 2005, he was named as the new president of the Open Source Initiative, replacing Eric S. Raymond. On February 7, Nelson published a post to his personal blog titled "Blacks are lazy", which generated controversy. Nelson apologized to those who perceived the post (which he withdrew because it "was not well written") as racist. Nelson resigned as president in early March (the resignation was backdated to February 23), and stated he did not believe himself to be politically savvy enough for the role of president.
Nelson remained on the board of directors of the Open Source Initiative for another six years.
Personal
Nelson is the son of Russell Edward Nelson and Gladys Jacobsen Nelson. Formerly a Quaker, for political reasons he no longer identifies as one, as of 2014. Nelson is a pacifist, and a member of the Libertarian Party of the United States.
Nelson created the first Quaker website in the world, quaker.org, in early 1995. He transferred the website to Friends Publishing Corporation, a Quaker nonprofit, in March 2018.
External links
Russ Nelson's Home Page
Crynwr Software
References
1958 births
Living people
American bloggers
American computer programmers
American libertarians
American male bloggers
American male writers
American political writers
Nelson, Russell
Former Quakers
Free software programmers
Members of the Open Source Initiative board of directors
21st-century American non-fiction writers |
https://en.wikipedia.org/wiki/Fireplane | Fireplane is a computer internal interconnect created by Sun Microsystems.
The Fireplane interconnect architecture is an evolutionary development of Sun's previous Ultra Port Architecture (UPA). It was introduced in October 2000 as the processor I/O interconnect in the Sun Blade 1000 workstation, followed in early 2001 by its use in the Sun Fire and Sun Fire 15K series enterprise servers. These coincided with the popular expansion of the web in the dot com boom and a shift of Sun's main market from Unix workstations to datacenter servers such as the Starfire, supporting high traffic web sites.
Peak performance (in the Sun Blade 1000) reached 67.2 GBytes/second or a sustained 9.6 Gbit/s (2.4 Gbit/s for each processor).
Each generation of Sun architecture had involved upgraded processors and matching upgrades to the bus or interconnect architectures that supported them. By this time, fast access to memory was becoming more important than simple CPU instruction speed for overall performance. Multiprocessors, shared memory, memory caching and switching between CPU and memory were technologies necessary to achieve this.
The Sun Fire 15K series frame allows 18 combined processor and memory expander boards. Each board comprises four processors, four memory modules and I/O processors. The Fireplane interconnect uses 18×18 crossbar switches to connect between them. Overall peak bandwidth through the interconnect is 43 Gbytes per second.
As memory architectures increase in complexity, maintaining cache coherence becomes a greater problem than simple connectivity. Fireplane represents a substantial advance over previous interconnects in this aspect. It combines both snoopy cache and point-to-point directory-based models to give a two-level cache coherence model. Snoopy buses are used primarily for single buses with small numbers of processors; directory models are used for larger numbers of processors. Fireplane combines both, to give a scalable shared memory architecture.
Each expander board implements snooping across the board, with directory coherence across the interconnect. Each board is considered as a 'snooping coherence domain'. Small to mid-sized Fireplane systems, up to 24 processors, use a single coherence domain. Larger systems with more processors use multiple coherence domains across their backplane interconnect. Competing systems from makers such as SGI or the HP Superdome series use only a single level of coherency support and so require the more complex directory coherence to be used throughout.
Fireplane used for smaller servers and workstations is optimised for their single domain performance. They use an increased system clock by 50% to 150 MHz. Snoops per clock cycle are also doubled from one half to one. Together these allow a snooping bandwidth of 150 million addresses per second.
References
External links
Computer-related introductions in 2000
Sun Microsystems hardware
Computer buses |
https://en.wikipedia.org/wiki/List%20of%20Kansas%20locations%20by%20per%20capita%20income | Kansas has the 26th highest per capita income in the United States, at $20,506 (2000). Its personal per capita income is $29,935 (2003).
Kansas counties ranked by per capita income
Note: Data is from the 2010 United States Census Data and the 2006-2010 American Community Survey 5-Year Estimates.
See also
Lists of places in Kansas
References
Kansas
Locations by per capita income
Income |
https://en.wikipedia.org/wiki/The%20Mission%20to%20Seafarers | The Mission to Seafarers (formerly The Missions to Seamen) is a Christian welfare charity serving merchant crews around the world. It operates through a global Mission 'family' network of chaplains, staff and volunteers and provides practical, emotional and spiritual support through ship visits, drop-in seafarers centres and a range of welfare and emergency support services.
Work
The Mission to Seafarers is a mission society of the Anglican Communion which offers help and support to merchant seafarers. The charity provides its services through the chaplains that it appoints to port centres in over 50 countries. Ship visitors supported by volunteers, are able to give free advice about employment issues or personal problems, as well as offer help in maritime emergencies. Through its centres the Mission to Seafarers provides communications, stores, transport services and publishes a bi-monthly news digest for seafarers called The Sea.
Network
The Mission to Seafarers has operations in over 200 ports around the world. In over 120 of these ports, the Mission has seafarers' centres – known as Flying Angel Centres, or Flying Angel Clubs – which offer communications facilities and rest and relaxation areas, and in some cases, accommodation. Sometimes, seafarers' centres are provided in ecumenical partnership with other organisations such as the Apostleship of the Sea. The rest of the charity's presence is made up of part-time or full-time chaplains, who offer onboard support services to seafarers.
Its central office is in the church of St Michael Paternoster Royal, College Hill, London EC4R 2RL. This church, founded by Sir Richard Whittington was rebuilt by Sir Christopher Wren, and contains carvings by Grinling Gibbons. The Church is open Monday to Friday 9am to 4pm excluding holidays.
History
The Mission to Seafarers has its roots in the work of Anglican priest, John Ashley who in 1835 was on the shore at Clevedon with his son who asked him how the people on ships in the Bristol Channel could go to church. Recognising the needs of the seafarers on the four hundred sailing vessels in the Bristol Channel, he created the Bristol Channel Mission. He raised funds, and in 1839 a specially designed mission cutter named Eirene was built with a main cabin which could be converted into a chapel for 100 people.
His work inspired similar ministries in the UK, and it was decided in 1856 that these groups should be formally organised under the name The Mission to Seamen Afloat, at Home and Abroad. In 1858, this name was changed to The Missions to Seamen, and the organisation adopted its Flying Angel logo, still in use to this day.
As shipping transitioned from sail to steam methods, there became a need for places for seafarers to go while they were ashore, as ships could now dock at quaysides because they no longer had to anchor at sea waiting for a favourable wind. In response, the Mission gradually opened centres so that the men could be offered light ref |
https://en.wikipedia.org/wiki/Parallel%20tempering | Parallel tempering, in physics and statistics, is a computer simulation method typically used to find the lowest energy state of a system of many interacting particles. It addresses the problem that at high temperatures, one may have a stable state different from low temperature, whereas simulations at low temperatures may become "stuck" in a metastable state. It does this by using the fact that the high temperature simulation may visit states typical of both stable and metastable low temperature states.
More specifically, parallel tempering (also known as replica exchange MCMC sampling), is a simulation method aimed at improving the dynamic properties of Monte Carlo method simulations of physical systems, and of Markov chain Monte Carlo (MCMC) sampling methods more generally. The replica exchange method was originally devised by Robert Swendsen and J. S. Wang, then extended by Charles J. Geyer, and later developed further by Giorgio Parisi,
Koji Hukushima and Koji Nemoto,
and others.
Y. Sugita and Y. Okamoto also formulated a molecular dynamics version of parallel tempering; this is usually known as replica-exchange molecular dynamics or REMD.
Essentially, one runs N copies of the system, randomly initialized, at different temperatures. Then, based on the Metropolis criterion one exchanges configurations at different temperatures. The idea of this method
is to make configurations at high temperatures available to the simulations at low temperatures and vice versa.
This results in a very robust ensemble which is able to sample both low and high energy configurations.
In this way, thermodynamical properties such as the specific heat, which is in general not well computed in the canonical ensemble, can be computed with great precision.
Background
Typically a Monte Carlo simulation using a Metropolis–Hastings update consists of a single stochastic process that evaluates the energy of the system and accepts/rejects updates based on the temperature T. At high temperatures updates that change the energy of the system are comparatively more probable. When the system is highly correlated, updates are rejected and the simulation is said to suffer from critical slowing down.
If we were to run two simulations at temperatures separated by a ΔT, we would find that if ΔT is small enough, then the energy histograms obtained by collecting the values of the energies over a set of Monte Carlo steps N will create two distributions that will somewhat overlap. The overlap can be defined by the area of the histograms that falls over the same interval of energy values, normalized by the total number of samples. For ΔT = 0 the overlap should approach 1.
Another way to interpret this overlap is to say that system configurations sampled at temperature T1 are likely to appear during a simulation at T2. Because the Markov chain should have no memory of its past, we can create a new update for the system composed of the two systems at T1 and T2. At a given Mo |
https://en.wikipedia.org/wiki/The%20Colour%20of%20Magic%20%28video%20game%29 | The Colour of Magic is a text adventure game developed by Delta 4 and published by Piranha Software, released in 1986. It was released for the ZX Spectrum, Amstrad CPC, and Commodore 64 computers. It is the first Discworld computer game and so far the only one adapted directly from one of the novels, and follows the plot of the book closely.
In 2006, another video game based on The Colour of Magic was released on mobile phones titled Discworld: The Colour of Magic. It is an isometric action game.
References
External links
1980s interactive fiction
1986 video games
Adventure games
Amstrad CPC games
Commodore 64 games
Interactive fiction based on works
Piranha Software games
Single-player video games
Video games based on Discworld
Video games developed in the United Kingdom
Video games set on fictional planets
ZX Spectrum games
Delta 4 games |
https://en.wikipedia.org/wiki/Mac%20OS%20Cyrillic%20encoding | Mac OS Cyrillic is a character encoding used on Apple Macintosh computers to represent texts in the Cyrillic script.
The original version lacked the letter Ґ, which is used in Ukrainian, although its use was limited during the Soviet era to regions outside Ukraine. The closely related MacUkrainian resolved this, differing only by replacing two less commonly used symbols with its uppercase and lowercase forms. The euro sign update of the Mac OS scripts incorporated these changes back into MacCyrillic.
Other related code pages include Mac OS Turkic Cyrillic and Mac OS Barents Cyrillic, introduced by Michael Everson in fonts for languages unsupported by standard MacCyrillic.
Layout
Each character is shown with its equivalent Unicode code point and its decimal code point. Only the second half of the table (code points 128–255) is shown, the first half (code points 0–127) being the same as Mac OS Roman.
{| class="wikitable chset nounderlines" frame="box" style="text-align: center; border-collapse: collapse"
|-
|style="text-align: left; font-family: sans-serif" |
|width=22px | A2
|width=22px | B6
|width=22px | FF
|-
|style="text-align: left" | Macintosh Cyrillic before Mac OS 9.0also Microsoft code page 10007 and IBM code page/CCSID 1283
|
|
|rowspan=2
|-
|style="text-align: left" | Macintosh Ukrainian before Mac OS 9.0also Microsoft code page 10017
|rowspan=2
|rowspan=2
|-
|style="text-align: left" | Macintosh Cyrillic since Mac OS 9.0
|
|}
References
Character sets
Cyrillic |
https://en.wikipedia.org/wiki/Mac%20OS%20Central%20European%20encoding | Mac OS Central European is a character encoding used on Apple Macintosh computers to represent texts in Central European and Southeastern European languages that use the Latin script. This encoding is also known as Code Page 10029. IBM assigns code page/CCSID 1282 to this encoding. This codepage contains diacritical letters that ISO 8859-2 does not have, and vice versa (This encoding supports Estonian, Lithuanian and Latvian while ISO 8859-2 supports Albanian, Croatian and Romanian).
Although a few of the characters which are in Mac OS Central European but not Mac OS Roman are also supported by Mac OS Croatian, these are not encoded at the same positions.
Code page layout
The following table shows the Macintosh Central European encoding. Each character is shown with its equivalent Unicode code point. Only the second half of the table (code points 128–255) is shown, the first half (code points 0–127) being the same as MacRoman or ASCII.
References
Character sets
Central European |
https://en.wikipedia.org/wiki/Individual%20Computers | Individual Computers is a German computer hardware company specializing in retrocomputing accessories for the Commodore 64, Amiga, and PC platforms. Individual Computers produced the C-One reconfigurable computer in 2003. The company is owned and run by Jens Schönfeld.
Products
Catweasel – Universal format floppy disk drive controller card
Retro Replay – Improved version of the C64 Action Replay cartridge
Clone-A – Amiga in FPGA website (coming soon?)
See the PDF extract of Total Amiga Magazine issue 25
MMC64 – MMC and SD Card reader cartridge
MMC Replay – MMC64 and Retro Replay combined in one cartridge, with some improvements
Micromys – An adapter that allows connecting PS/2 compatible mice (including wheel-support) to C64 and Amiga joystick-ports (and all other computers that share the same pin-configuration).
Amiga clock port compatible addons for MMC64, Retro Replay and MMC Replay:
RR-Net: A C64-compatible Network-Interface. Comes in 2 shapes, the old long RR-Net fits Retro Replay and MMC64 (though partly blocking the latter's passthrough expansionport), the new L-shaped RR-Net2 fits MMC64 and MMC Replay and was built with MMC Replay in mind.
Silver Surfer: Highspeed RS232 Interface for Amiga 1200 and 600 (with adapter). Fits onto Retro Replay, MMC64/Replay compatibility unknown.
mp3@c64: hardware mp3 decoding from SD card. Made for MMC64, Retro Replay and MMC Replay compatibility unknown.
Keyrah – An interface that allows the connection of Commodore keyboards to USB-capable computers
C-One – reconfigurable computer
X-Surf – network card
C64 Reloaded - A 1:1 rebuilt C64 motherboard with less power consumption
Indivision – Flicker fixer for Amiga computers
ACA boards - CPU expansion cards for Amiga computers
References
External links
Individual Computers official website
Individual Computers Product Information Wiki
Home computer hardware companies
Electronics companies of Germany
Commodore 64
Amiga companies |
https://en.wikipedia.org/wiki/Birn | Birn or variants may refer to:
BIRN
Biomedical Informatics Research Network (BIRN), a geographically distributed virtual community of shared resources relating to diagnosis and treatment of disease
Balkan Investigative Reporting Network
Berklee College of Music Internet Radio Network
Birn or Birns
Alex Birns (born 1907–1975), Jewish American mobster
Jack Birns (born 1919-2008), American photographer
Jerry Birn (born 1923-2009), American television writer
Laura Birn (born 1981), Finnish actress
Laura Bryan Birn (born 1965), American actress
Other uses
Dál Birn
Lóegaire Birn Búadach, Óengus Osrithe's son
Nem Moccu Birn (died 654), Irish saint |
https://en.wikipedia.org/wiki/Biomedical%20Informatics%20Research%20Network | The Biomedical Informatics Research Network, commonly referred among analysts as “BIRN” is a national proposed project to assist biomedical researchers in their bioscience investigations through data sharing and online collaborations. BIRN provides data-sharing infrastructure, advisory services from a single source and software tools and techniques. This national initiative is funded by NIH Grants, the National Center for Research Resources and the National Institute of General Medical Sciences (NIGMS), a component of the United States National Institutes of Health (NIH).
Overview
To serve the Biomedical community, BIRN is designed to share significant and intensive data between researchers across geographic distance using user driven base software. Participants can transfer data securely and privately, internal and external. All data transfer is designed to be consistent with Health Insurance Portability and Accountability Act of 1996 (HIPAA) privacy and security guidelines.
BIRN also offers documented best practices, expert advice, data-sharing, and query and analysis software tools specific to biomedical research. Its researchers develop authorization capabilities and new data-sharing and engineering tools to assist researchers in making sense of new information.
Structure
BIRN is a collaborative effort between the NIGMS and a variety of nationwide leadership associations: Information Sciences Institute (ISI) at the University of Southern California, University of Chicago, Massachusetts General Hospital, University of California at Irvine, and the University of California at Los Angeles.
Its interdisciplinary team consists of computer scientists, engineers, physicians, biomedical researchers and other technical experts, including grid computing developers Carl Kesselman of USC ISI, and Ian Foster of Argonne National Laboratories. Co-Principal Investigators are:
Carl Kesselman, Ph.D., a professor in the University of Southern California (USC) Daniel J. Epstein Department of Industrial and Systems Engineering, and a Fellow of the Information Sciences Institute (ISI), its highest honor;
Ian Foster, Ph.D., director of the Computation Institute, a joint project between the University of Chicago and Argonne National Laboratory, and associate director of Argonne's Mathematics and Computer Science Division;
Steven G. Potkin, M.D., a professor in the Department of Psychiatry and Human Behavior at the University of California at Irvine (UCI) and Director of UCI's Brain Imaging Center;
Bruce R. Rosen, M.D., Ph.D., a professor of radiology at Harvard Medical School and Health Sciences and Technology at the Harvard-MIT Division of Health Sciences and Technology, and Director of the Athinoula A. Martinos Center for Biomedical Imaging at the Massachusetts General Hospital in Boston, MA;
Jonathan C. Silverstein, M.D., associate director and senior fellow at the University of Chicago-Argonne National Laboratory Computation Institute, and an associate |
https://en.wikipedia.org/wiki/ASIC%20programming%20language | ASIC is a compiler and integrated development environment for a subset of the BASIC programming language. It was released for MS-DOS and compatible systems as shareware. Written by Dave Visti of 80/20 Software, it was one of the few BASIC compilers legally available for download from BBSes. ASIC allows compiling to an EXE or COM file. A COM file for Hello world program is 360 bytes.
ASIC has little or no support for logical operators, control structures, and floating-point arithmetic. These shortcomings resulted in the tongue-in-cheek motto, "ASIC: It's almost BASIC!"
Features
ASIC is strongly impoverished in comparison with its contemporary BASICs. The features of ASIC are selected to make a program be easily and directly compiled into machine language. Thus, many language constructs of ASIC are equivalent to constructs of assembly language.
Program elements
Neither indetifiers, nor keywords are case-sensitive.
Any DIM statements, if specified, must precede all other statements except REM statements or blank lines.
All DATA statements must be placed at the beginning of the program, before all other statement types, except DIM, REM statements, or blank lines).
Expressions
ASIC does not have the exponentiation operator ^.
ASIC does not have boolean operators (AND, OR, NOT etc.).
Arrays
The size of array specified in the DIM statement must be a litteral constant. A single DIM allows to declare only one array.
Input and Output
PRINT's arguments must be a literal or variable. PRINT does not allow to use combined expressions as its arguments, nor does it allow to use strings concatenated with ; or +.
If a PRINT command ends with ; or ,, then the next PRINT command will resume in the position where this one left off, just as though its argument were appended to the argument of the current PRINT command.
The PRINT statement prints integer values six characters wide. They are aligned to the right (no trailing spaces).
LOCATE row, column Moves the text cursor to the position (column, row), where 0 ≤ column and 0 ≤ row. The position (0, 0) is the upper left corner.
Graphics
PSET (row,column),color Turns on the pixel of the color color at position (column, row), where 0 ≤column and 0 ≤ row. The position (0, 0) is the upper left corner.
Control Structures
A boolean condition may be only a comparison of numbers or strings, but not a comparison of combined expressions. A litteral cannot be the left operand of comparison (e.g. can be X = 2, not 2 = X).
Decisions
After THEN, there may be a sequence of statements delimited by ELSE or ENDIF. An example:
IF X < 0 THEN
PRINT "Negative"
ELSE
PRINT "Non-negative"
ENDIF
Contrary to other BASICs, statements cannot be put between THEN and the end of the line.
An if-statement can realize the conditional jump. In this case, after THEN there may be a label.
Looping
In FOR, after TO there may be only a number - literal or variable - but not a combined expression. The STEP clause does not |
https://en.wikipedia.org/wiki/I2O | Intelligent Input/Output (I2O) is a defunct computer input/output (I/O) specification. I2O was originally designed to make use of the Intel i960 microprocessor as the I/O offload engine, bringing channel I/O to the PC. I2O emerged from Intel in the mid 1990s with the publication of the I2O specification in 1996 by the Intelligent I/O Special Interest Group, which dissolved as of 13 October 2000.
I2O's principal architectural components included the I/O processor (IOP) and a split device driver model, with an OSM (OS Module) running in the host operating system and a HDM (Hardware Device Module) running on the I/O processor. This formally separated OS-specific driver functionality from the underlying device, and the two software components used message passing for communications. This split is suggestive of another initiative in which Intel participated at the time, the Uniform Driver Interface (UDI), which sought to establish a common device driver interface spanning multiple software platforms.
I2O was plagued by several problems: the i960 was largely a failure and I2O made systems more expensive in a low cost marketplace. Additionally, the I2O SIG was seen as hostile to open source and insensitive to small players because it charged high fees for participation and was dominated by a few corporate players, notably Microsoft. While it remains unclear which of these factors caused the ultimate failure of I2O, only a few server class machines were ever built with onboard I2O. The I2O-SIG disbanded in October 2000, with a small amount of architectural information being made available via FTP at about the same time.
A number of x86-compatible operating systems provided support (or still do) for I2O, including Windows, Linux (removed in 4.0), Solaris, OpenBSD, and NetWare.
Examples of systems which utilized I2O
Compaq Proliant
HP NetServer LH3000
PERC 4 DC SCSI/i20 on Dell PowerEdge
NEC Express5800
References
External links
sco.com - I20
intel.com - UDI and I2O: Complementary Approaches to Portable, High-performance I/O
intelligent-io.com from the Internet Archive
wired.com - Consortium segregates the bus
Input/output |
https://en.wikipedia.org/wiki/Continuous%20modelling | Continuous modelling is the mathematical practice of applying a model to continuous data (data which has a potentially infinite number, and divisibility, of attributes). They often use differential equations and are converse to discrete modelling.
Modelling is generally broken down into several steps:
Making assumptions about the data: The modeller decides what is influencing the data and what can be safely ignored.
Making equations to fit the assumptions.
Solving the equations.
Verifying the results: Various statistical tests are applied to the data and the model and compared.
If the model passes the verification progress, putting it into practice.
If the model fails the verification progress, altering it and subjecting it again to verification; if it persists in fitting the data more poorly than a competing model, it is abandoned.
External links
Definition by the UK National Physical Laboratory
Applied mathematics |
https://en.wikipedia.org/wiki/Res | Res or RES may refer to:
Sciences
Computing
Russian and Eurasian Security Network
Spanish Supercomputing Network (Red Española de Supercomputación)
Energy
RES - The School for Renewable Energy Science
US Renewable Electricity Standard
Renewable Energy Systems, a UK company
Mathematics
Residue (complex analysis) function
Medicine
Reticuloendothelial system, in anatomy
Archaeology
Répertoire d'Épigraphie Sémitique, a journal publishing Semitic language inscriptions
Latin word meaning "thing"
Entity (disambiguation)
Object (philosophy)
The first word of several Latin phrases:
Res divina (service of the gods)
Res extensa Descartes' physical world
Res gestae (Things done)
Res inter alios acta (A thing done between others)
Res ipsa loquitur (The thing speaks for itself)
Res judicata (A matter [already] judged)
Res nullius (An unowned thing)
Res publica (A public thing), the origin of the word republic
Organizations
Rail Express Systems
Railway Enthusiasts Society, New Zealand
Royal Economic Society, UK
Royal Entomological Society
Places
Resistencia International Airport (IATA airport code: RES)
People
Res (singer), American singer
Arts, entertainment, and media
Literature
RES (magazine), bimonthly
Music
Songs
"R.E.S.", a song by Cardiacs from The Seaside
"The Res", a song by the American band Bright from their self-titled album
See also
RE5 (disambiguation)
Rez (disambiguation) |
https://en.wikipedia.org/wiki/The%20Fat%20and%20the%20Furriest | "The Fat and the Furriest" is the fifth episode of the fifteenth season of the American animated television series The Simpsons. It originally aired on the Fox network in the United States on November 30, 2003.
Plot
Homer goes to Sprawl-Mart, and he buys Marge a "Kitchen Carnival" for Mother's Day, a machine that houses a cotton candy maker, a vat of liquid caramel, and a deep fryer. Eventually Homer uses it to make a giant ball of deep-fried, caramel-covered, cotton candy. When it becomes too dirty and inedible, Marge orders him to take it to the dump. While there, he is confronted by a large grizzly bear, from whom he cowers. The bear eventually wanders off without attacking, annoyed by Homer's tearful cowering. The incident becomes well known due to a nearby hunter with a camera.
Homer becomes a nervous wreck, hallucinating and seeing bears like Winnie-the-Pooh, Paddington Bear, Smokey Bear, the Snuggle Bear, Teddy Grahams, the Chicago Bears, and an "Intensive Care Bear." To add insult to injury, the hunter's tape is shown on the news, and Homer is mocked by many. Homer hires the hunter, named Grant, to assist him in confronting the animal. Homer makes a near-useless suit of armor: despite Marge's objections, Bart, Lenny and Carl join him as they start on their quest.
The four of them make camp in the woods. As his homemade armor is hot, Homer eventually takes it off and bathes in a stream, where he is again attacked by the bear. With Bart, Lenny and Carl dancing to the radio and paying no attention, the bear drags Homer to his cave. Deciding to die facing the bear as a man, Homer later discovers that the bear is only angry and hostile because of the painful electrical prod that Grant attached to the bear's ear. To make sure of it, Homer takes the tag off the bear and tries it on himself, resulting in a lot of pain before taking it off. Because of being freed from the electrical prod, the bear reverts to his friendly state, licking Homer and giving him a bear hug as a thanks.
Realizing this, Homer becomes friends with the bear. In the meantime, Marge and Lisa have discovered Homer, Bart, and the suit of armor missing, and Marge hires Grant to help track Homer down, though Lisa disapproves of Grant's methods to take down the bear. Homer decides to take the bear to a nearby wildlife refuge, but on the way, they are attacked by Grant and other hunters. To ensure the bear's survival, Homer dresses the bear up in the homemade armor, which surprisingly resists the gunfire and allows the bear to reach the wildlife refuge where he is promptly attacked by Stampy the elephant, but then fights back against him for good. It is then the whole family declares to be proud of Homer for his efforts of saving the bear from the hunters, to which he responds that he loves nature.
Cultural references
The title is a parody of the 2001 movie The Fast and the Furious.
After Homer returns home after the incident with the bear, Homer frightened by the fact that b |
https://en.wikipedia.org/wiki/Brush%20with%20Greatness | "Brush with Greatness" is the eighteenth episode of the second season of the American animated television series The Simpsons. It originally aired on the Fox Network in the United States on April 11, 1991. In the episode, Marge enrolls in an art class after Lisa encourages her to revive her former interest in painting. When she wins first prize in a local art competition for a portrait of Homer on the couch in his underwear, Mr. Burns commissions her to paint his portrait. In the subplot, Homer is determined to lose weight after getting stuck in a water slide at an amusement park.
The episode was written by Brian K. Roberts and directed by Jim Reardon. Beatles member Ringo Starr guest starred as himself, while Jon Lovitz starred as Marge's art teacher, Professor Lombardo. The episode features cultural references to films such as Rocky and Gone with the Wind.
Since airing, the episode has received mostly positive reviews from television critics, who praised its central focus on Marge, as well as Starr's role. It acquired a Nielsen rating of 12.0 and was the second highest-rated show on Fox the week it aired.
Plot
The Simpsons go to the Mount Splashmore water park. The park's rescue crew is forced to close the water slide ride after Homer is stuck inside. The crew remove the blocked section of pipe using a large crane, with Homer still stuck inside. That night, the news media poke fun at Homer's massive size during their coverage of his mishap at the water park.
After having found out that he weighs , Homer vows he will diet and get more exercise. While Homer is looking for his weights in the attic, Bart stumbles upon several old paintings of the drummer Ringo Starr that Marge had made as a high school student. Marge reveals she was scolded by her art teacher for painting Starr, on whom she had a crush. She sent a painting to Starr for his "honest opinion", but she never got a response back. After Lisa suggests that Marge take a painting class at Springfield Community College, she paints Homer asleep on the couch in his underwear, earning praise from her teacher, Professor Lombardo. The painting wins the college art show, earning Marge fame and newspaper headlines.
Mr. Burns asks Marge to paint his portrait for a new wing of the Springfield Art Museum. Marge agrees, although she resists Homer's plea to paint Burns as a beautiful man. While Burns is taking a shower at the Simpsons' house, Marge inadvertently sees him naked. Homer finds he has lost 21 pounds from his exercise regimen and now weighs . After Burns disparages Homer's weight and his daughters, Lisa and Maggie, Marge throws Burns out of the house. She is ready to quit until she receives a response from Starr, who, though decades late, praises her portrait of him. Homer encourages Marge to finish the painting.
Marge's painting of a naked, frail and weak Burns is unveiled at the opening of the museum wing, much to both Burns and the crowd's shock, causing Smithers to faint. She explai |
https://en.wikipedia.org/wiki/Herman%27s%20Head | Herman's Head is an American sitcom that aired on the Fox network from September 8, 1991, until April 21, 1994. The series was created by Andy Guerdat and Steve Kreinberg, and produced by Witt/Thomas Productions in association with Touchstone Television. William Ragsdale stars as the title character, Herman Brooks. Herman's thought processes are dramatized in a "Greek chorus"-style interpretation, with four characters representing different aspects of his personality (played by Molly Hagan, Ken Hudson Campbell, Rick Lawless and Peter Mackenzie).
Synopsis
Research assistant Herman Brooks (William Ragsdale) works in the fact-checking department of a major magazine publisher, Waterton Publishing, in Manhattan. Herman, from all outward appearances, embodies the young man on the fast track—ambitious, clever and sensible—but viewers are shown that a struggle of contrasting personality traits are constantly working, and most often arguing, inside his head. His decisions and actions are dramatized with a "Greek chorus"-style interpretation of his thought processes.
The series begins with Herman as mild-mannered, giving in to every passing sexual desire, bedding a lot of women and not being above bending the truth about his life or career status in order to impress women. He makes attempts to settle down every once in a while, which he does not find hard due to his overall willingness to turn a strictly physical connection into love. However, despite his romantic repertoire with women, he sometimes loses them over comical misunderstandings that are often never resolved. These usually occur as a result of Herman's boyish innocence getting him into trouble. During the next couple of seasons, Herman evolves into a more edgy character, more apt to developing outlandish schemes in an attempt to further his career as well as with women, and he becomes more opinionated in situations where previously, he would have conformed to rules, or have been a sycophant.
The psyche
The four characters acting out Herman's emotions each represent a different aspect of his personality, or psyche. As they were intended to be one-dimensional, they often lack in other areas of their character, which leads to frequent squabbles. The characters act in unison when Herman's body is affected, such as having to sneeze, or crying out in pain after being punched in the stomach. They also team up and form factions.
"Angel" (Molly Hagan) represents his sensitivity. As the only female character in his brain, Angel also represents his feminine side, and sometimes uses this fact to manipulate the male characters. She also clashes with Animal about how to treat women because while she wants to treat them with sensitivity and kindness, Animal just wants to have sex.
"Animal" (Ken Hudson Campbell) represents his basic drives of lust and hunger. He is a caricature of fraternities and sororities. In one episode, when Herman's personalities are assessing a sleazy man (Campbell in a dual role |
https://en.wikipedia.org/wiki/Betweenness | Betweenness is an algorithmic problem in order theory about ordering a collection of items subject to constraints that some items must be placed between others. It has applications in bioinformatics and was shown to be NP-complete by .
Problem statement
The input to a betweenness problem is a collection of ordered triples of items. The items listed in these triples should be placed into a total order, with the property that for each of the given triples, the middle item in the triple appears in the output somewhere between the other two items. The items of each triple are not required to be consecutive in the output.
Examples
As an example, the collection of input triples
(2,1,3), (3,4,5), (1,4,5), (2,4,1), (5,2,3)
is satisfied by the output ordering
3, 1, 4, 2, 5
but not by
3, 1, 2, 4, 5.
In the first of these output orderings, for all five of the input triples, the middle item of the triple appears between the other two items
However, for the second output ordering, item 4 is not between items 1 and 2, contradicting the requirement given by the triple (2,4,1).
If an input contains two triples like (1,2,3) and (2,3,1) with the same three items but a different choice of the middle item, then there is no valid solution. However, there are more complicated ways of forming a set of triples with no valid solution, that do not contain such a pair of contradictory triples.
Complexity
showed that the decision version of the betweenness problem (in which an algorithm must decide whether or not there exists a valid solution) is NP-complete in two ways, by a reduction from 3-satisfiability and also by a different reduction from hypergraph 2-coloring. However, it can easily be solved when all unordered triples of items are represented by an ordered triple of the input, by choosing one of the two items that are not between any others to be the start of the ordering and then using the triples involving this item to compare the relative positions of each pair of remaining items.
The related problem of finding an ordering that maximizes the number of satisfied triples is MAXSNP-hard, implying that it is impossible to achieve an approximation ratio arbitrarily close to 1 in polynomial time unless P = NP. It remains hard to solve or approximate even for dense instances that include an ordered triple for each possible unordered triple of items.
The minimum version of the problem restricted to the tournaments was proven to have polynomial time approximation schemes (PTAS). One can achieve an approximation ratio of 1/3 (in expectation) by ordering the items randomly, and this simple strategy gives the best possible polynomial-time approximation if the unique games conjecture is true. It is also possible to use semidefinite programming or combinatorial methods to find an ordering that satisfies at least half of the triples of any satisfiable instance, in polynomial time.
In parameterized complexity, the problem of satisfying as many constraints as possible f |
https://en.wikipedia.org/wiki/Atlantic%20Coast%20Line%2C%20Cornwall | The Atlantic Coast Line is a Network Rail branch line which includes a community railway service in Cornwall, England. The line runs from the English Channel at Par, to the Atlantic Ocean at Newquay.
Route
The Atlantic Coast Line starts from Par station, in the village and port of Par. The station is on the Cornish Main Line, and trains to Newquay use a curve of almost 180 degrees before joining the route of the Cornwall Minerals Railway (CMR), near the former St Blazey station. Parts of the line were originally built by Treffry as a standard-gauge tramway in the later 1840s to serve Newquay Harbour, and opened from Newquay in 1849.
It was upgraded for locomotives in 1874 after it had been acquired by the CMR, which extended the railway across Goss Moor from Bugle to St Dennis to complete the route from St Blazey to Newquay.
Passenger services began between Newquay and Fowey on 20 June 1876. There was no rail connection with the present Par station until 1892 when the broad-gauge main line was 'narrowed' to standard gauge by the Great Western Railway and the connecting curve was built from St Blazey. From St Blazey, the CMR was built along the course of the even earlier Par Canal, originally built to serve the nearby Fowey Consols mine, as far as its terminus at Pontsmill, where the Luxulyan Valley is entered. The thickly wooded terrain and steep granite slopes of this valley surround the fast-flowing River Par, contain a large concentration of early 19th century industrial remains and have been designated a World Heritage Site.
Shortly before reaching Luxulyan station, the line passes under the Treffry Viaduct, an historic railway viaduct and aqueduct that was built in 1844. This both supplied water to the Fowey Consoles mine, and also carried the original line of the Treffry Tramways, a precursor to the CMR.
After Luxulyan, the line passes close to several former and current china clay works, before passing through Bugle and Roche stations.
Between Roche and St Columb Road stations, the line passes through Goss Moor nature reserve, where a low bridge carrying the railway over the A30 road had been the site of accidents when vehicles collided with it. There was a 1986 proposal to abolish the bridge by diverting the line so that trains would have started from St Austell railway station and continued via Burngullow and the old Newquay and Cornwall Junction Railway freight-only line, joining the current route between Roche and St Columb Road at St Dennis Junction. This proposal was later abandoned after a new route for the road was found that avoids the bridge.
After St Columb Road, the line passes through the last intermediate station at Quintrell Downs before reaching the terminus at Newquay.
Mid Cornwall Metro
Government funding of nearly £50,000,000 was announced in January 2023 to create the Mid Cornwall Metro, which will include the Newquay branch. A second platform at Newquay and an additional passing loop on Goss Moor will allow |
https://en.wikipedia.org/wiki/AnnaLee%20Saxenian | AnnaLee Saxenian is a professor and the former Dean of the UC Berkeley School of Information, known widely for her work on technology clusters and social networks in Silicon Valley. She received her BA from Williams College in 1976 and her PhD from Massachusetts Institute of Technology in 1989.
In her book Regional Advantage: Culture and Competition in Silicon Valley and Route 128 (1994), Saxenian proposes a hypothesis to explain why California's Silicon Valley was able to keep up with the fast pace of technological progress during the 1980s, while the vertically integrated firms of the Route 128 beltway fell behind. She argues that the key was Silicon Valley's decentralized organizational form, non-proprietary standards, and tradition of cooperative exchange (sharing information and outsourcing for component parts), in opposition to hierarchical and independent industrial systems in the East Coast of the US.
Her 2006 book, The New Argonauts: Regional Advantage in a Global Economy, explores the globalization of the technology workforce that has occurred as the "brain drain" becomes a "brain circulation" with immigrant Indian, Chinese, and Israeli professionals taking the Silicon Valley entrepreneurial model to their home countries while also maintaining connections with the US.
References
Bibliography
Regional Advantage: Culture and Competition in Silicon Valley and Route 128 Harvard University Press, 1994,
The New Argonauts: Regional Advantage in a Global Economy Harvard University Press, 2007,
Il vantaggio competitivo dei sistemi locali nell'era della globalizzazione. Cultura e competizione nella Silicon Valley e nella Route 128 FrancoAngeli, 2002,
Silicon Valley's new immigrant entrepreneurs Public Policy Institute of California, 1999,
The Silicon Valley-Hsinchu Connection: Technical Communities and Industrial Upgrading Stanford Institute for Economic Policy Research, 1999
Local and Global Networks of Immigrant Professionals in Silicon Valley Public Policy Instit. of CA, 2002,
America's New Immigrant Entrepreneurs 2012
Regional networks and the resurgence of Silicon Valley Institute of Urban & Regional Development, University of California, 1989
The Cheshire Cat's Grin: Innovation, Regional Development and the Cambridge Case Massachusetts Institute of Technology Department of Political Science, 1987
The origins and dynamics of production networks in Silicon Valley Institute of Urban and Regional Development, University of California, 1990
A Fugitive Success: Finland's Economic Future SITRA, 2008,
External links
Year of birth missing (living people)
Living people
American people of Armenian descent
University of California, Berkeley faculty
Williams College alumni
Massachusetts Institute of Technology alumni |
https://en.wikipedia.org/wiki/Sensor%20fusion | Sensor fusion is the process of combining sensor data or data derived from disparate sources such that the resulting information has less uncertainty than would be possible when these sources were used individually. For instance, one could potentially obtain a more accurate location estimate of an indoor object by combining multiple data sources such as video cameras and WiFi localization signals. The term uncertainty reduction in this case can mean more accurate, more complete, or more dependable, or refer to the result of an emerging view, such as stereoscopic vision (calculation of depth information by combining two-dimensional images from two cameras at slightly different viewpoints).
The data sources for a fusion process are not specified to originate from identical sensors. One can distinguish direct fusion, indirect fusion and fusion of the outputs of the former two. Direct fusion is the fusion of sensor data from a set of heterogeneous or homogeneous sensors, soft sensors, and history values of sensor data, while indirect fusion uses information sources like a priori knowledge about the environment and human input.
Sensor fusion is also known as (multi-sensor) data fusion and is a subset of information fusion.
Examples of sensors
Accelerometers
Electronic Support Measures (ESM)
Flash LIDAR
Global Positioning System (GPS)
Infrared / thermal imaging camera
Magnetic sensors
MEMS
Phased array
Radar
Radiotelescopes, such as the proposed Square Kilometre Array, the largest sensor ever to be built
Scanning LIDAR
Seismic sensors
Sonar and other acoustic
Sonobuoys
TV cameras
→Additional List of sensors
Algorithms
Sensor fusion is a term that covers a number of methods and algorithms, including:
Kalman filter
Bayesian networks
Dempster–Shafer
Convolutional neural network
Gaussian processes
Example calculations
Two example sensor fusion calculations are illustrated below.
Let and denote two sensor measurements with noise variances and
, respectively. One way of obtaining a combined measurement is to apply inverse-variance weighting, which is also employed within the Fraser-Potter fixed-interval smoother, namely
,
where is the variance of the combined estimate. It can be seen that the fused result is simply a linear combination of the two measurements weighted by their respective noise variances.
Another method to fuse two measurements is to use the optimal Kalman filter. Suppose that the data is generated by a first-order system and let denote the solution of the filter's Riccati equation. By applying Cramer's rule within the gain calculation it can be found that the filter gain is given by:
By inspection, when the first measurement is noise free, the filter ignores the second measurement and vice versa. That is, the combined estimate is weighted by the quality of the measurements.
Centralized versus decentralized
In sensor fusion, centralized versus decentralized refers to where the fusion of the |
https://en.wikipedia.org/wiki/Network%20processor | A network processor is an integrated circuit which has a feature set specifically targeted at the networking application domain.
Network processors are typically software programmable devices and would have generic characteristics similar to general purpose central processing units that are commonly used in many different types of equipment and products.
History of development
In modern telecommunications networks, information (voice, video, data) is transferred as packet data (termed packet switching) which is in contrast to older telecommunications networks that carried information as analog signals such as in the public switched telephone network (PSTN) or analog TV/Radio networks. The processing of these packets has resulted in the creation of integrated circuits (IC) that are optimised to deal with this form of packet data. Network processors have specific features or architectures that are provided to enhance and optimise packet processing within these networks.
Network processors have evolved into ICs with specific functions. This evolution has resulted in more complex and more flexible ICs being created. The newer circuits are programmable and thus allow a single hardware IC design to undertake a number of different functions, where the appropriate software is installed.
Network processors are used in the manufacture of many different types of network equipment such as:
Routers, software routers and switches (Inter-network processors)
Firewalls
Session border controllers
Intrusion detection devices
Intrusion prevention devices
Network monitoring systems
Network security (secure cryptoprocessors)
Reconfigurable Match-Tables
Reconfigurable Match-Tables were introduced in 2013 to allow switches to operate at high speeds while maintaining flexibility when it comes to the network protocols running on them, or the processing to does to them. P4 is used to program the chips. The company Barefoot Networks was based around these processors and was later purchased by Intel in 2019.
An RMT pipeline relies on three main stages; the programmable parser, the Match-Action tables and the programmable deparser. The parser reads the packet in chunks and processes these chunks to find out which protocols are used in the packet (Ethernet, VLAN, IPv4...) and extracts certain fields from the packet into the Packet Header Vector (PHV). Certain fields in the PHV may be reserved for special uses such as present headers or total packet length. The protocols are typically programmable, and so are the fields to extract. The Match-Action tables are a series of units that read an input PHV, match certain fields in it using a crossbar and CAM memory, the result is a wide instruction that operates on one or more fields of the PHV and data to support this instruction. The output PHV is then sent to the next MA stage or to the deparser. The deparser takes in the PHV as well as the original packet and it's metadata (to fill in missing bits that weren't extra |
https://en.wikipedia.org/wiki/Amnon%20Wolman | Amnon Wolman (Hebrew: אמנון וולמן; born 1955) an Israeli-American musician. He holds a doctorate degree in music composition. His catalogue of compositions includes works involving computer generated and processed sounds, symphonic works, vocal and chamber pieces for different ensembles, film music, and music for theater and dance. His recently premiered pieces include "Picnic Site" used for a choreography by Trisha Brown and Steve Paxton for the Lyon Biannale; "End Divided Road" for Flute and electronics for Mario Carolli at the TRAIETTORIE Festival in Parma, Italy; "Cruising Prohibited when Lights Flashing" for the Gay Gotham Chorus at the Greenwich House, New York; and "and her mind moves upon silence", for harpsichord and electronic sounds, for Vivienne Spiteri in Toronto, Ontario, Canada.
Career
His scores are published by the Israel Music Institute and the Israel Music Center. Before Joining the faculty at Brooklyn College he taught at Northwestern University, Tel Aviv University, Stanford University and the University of California, Berkeley. At Brooklyn College he was a member of the composition faculty and Director of the Brooklyn College Center for Computer Music (BC-CCM).
Wolman's film music was featured at the London, Sydney, Los Angeles (1981, 2001), the San Francisco Film Festivals ('93) Berlin Film Festival ('81), Pop Sustainability Film Festival, Seattle Underground Film Festival], Chicago Underground Film Festival (gold medal), CineVegas, Columbus International Film Festival (2000) (bronze medal) and at the Chicago Film Festival ('82, '92).
Awards
His list of awards includes the Queens' 2000 International Competition at the Queen's College, Oxford and an Honorary Mention at the Musica Nova Competition in Prague, Czech Republic. He was also a finalist at the first Ars Electronica, Linz, finalist at the Karl Sczuka Prize, and awarded the First Prize at the NewComp International Competition '88. He received grants from the Eastman Foundation, Arts International, the Dutch Government, America-Israel Culture Foundation, the Rockefeller Foundation, the Djerassi Foundation, Meet the Composer, and the MacDowell and Yaddo Foundations. He was commissioned for Heinz Holliger, Charles Neidich, Ursula Oppens, Harry Sparnaay, Benny Sluchin, Ensemble Modern, and the Israel Chamber Orchestra among others.
References
External links
Amnon Wolman
Brooklyn College Center for Computer Music (BC-CCM)
21st-century classical composers
Living people
1955 births
20th-century classical composers
American male classical composers
American classical composers
Israeli composers
Pupils of Jacob Druckman
21st-century American composers
20th-century American composers
20th-century American male musicians
21st-century American male musicians
Brooklyn College faculty |
https://en.wikipedia.org/wiki/Papyrus%20Design%20Group | Papyrus Design Group, Inc. was a computer game developer founded in 1987 by David Kaemmer and CEO Omar Khudari. Based in Watertown, Massachusetts, it is best known for its series of realistic sim racing games based on the NASCAR and IndyCar leagues, as well as the unique Grand Prix Legends. Papyrus was acquired by Sierra On-Line in late 1995 and Omar Khudari left Papyrus soon after that. Dave Kaemmer left Papyrus in late 2002, just before the release of NASCAR Racing 2003 Season (NR2003).
On June 5, 2003, NR2003 community modders PWF (Project Wildfire) announced that many of their members would be joining a new group called FIRST.
At the end of the first quarter of 2004, NR2003 was pulled from the shelves due to license expiration. This is when FIRST (later to become iRacing) started its acquisition of the NR2003 code from Vivendi Universal.
The Papyrus website was shut down on April 5, 2004.
On May 28, 2004, Vivendi and Papyrus sold copyrights to FIRST.net, LLC who became the registered owner of the copyrights for NASCAR Racing 2003 Season and would go on to develop iRacing using its engine.
Games developed by Papyrus
Indianapolis 500: The Simulation (1989)
J. R. R. Tolkien's Riders of Rohan (1991) (co-developed with Beam Software)
IndyCar Racing (1993)
Nomad (1993)
NASCAR Racing (1994)
NASCAR Racing for the Sony PlayStation (1996)
Links: The Challenge of Golf (1994) (Sega CD version)
IndyCar Racing II (1995)
NASCAR Racing 2 (1996)
NASCAR Racing: Grand National Series Expansion Pack (1997)
Road Rash (1996) (Windows version)
SODA Off-Road Racing (1997)
Grand Prix Legends (1998)
NASCAR Racing 1999 Edition (1999)
NASCAR Craftsman Truck Series Racing (1999)
NASCAR Racing 3 (1999)
NASCAR Racing 3: Craftsman Truck Series Expansion Pack
NASCAR Legends (1999)
NASCAR Racing 4 (2001)
NASCAR Racing 2002 Season (2002)
NASCAR Racing 2003 Season (2003)
NASCAR Racing 5 (2003) (scrapped Xbox game)
See also
iRacing, a racing simulator developed by David Kaemmer
References
External links
Papyrus Design Group at MobyGames
Sierra Entertainment
Defunct video game companies of the United States
Video game companies established in 1987
Video game companies disestablished in 2004
Video game development companies
Defunct companies based in Massachusetts |
https://en.wikipedia.org/wiki/KVRR | KVRR (channel 15) is a television station in Fargo, North Dakota, United States, affiliated with the Fox network. It is the flagship television property of locally based Red River Broadcasting, which has owned the station since its inception. KVRR's studios are located on South 40th Street and South 9th Avenue in Fargo, and its transmitter is located near Tansem, Minnesota. KVRR also handles master control and some internal operations for sister station and fellow Fox affiliate KQDS-TV in Duluth, Minnesota.
KVRR's programming is simulcast on three full-power satellite stations: KJRR (VHF channel 7) in Jamestown, North Dakota, KBRR (VHF channel 10) in Thief River Falls, Minnesota (serving the Grand Forks area), and KNRR (VHF channel 12) in Pembina, North Dakota (which also covers parts of southern Manitoba, Canada, including Winnipeg).
History
The station first signed on the air on February 14, 1983, under the callsign KVNJ-TV. It was the first independent station in the Dakotas, as well as the first new standalone full-power commercial station to sign on in the Fargo–Grand Forks market in 29 years. WDAZ-TV (channel 8) in Grand Forks had signed on in 1967, but is co-owned with Fargo's WDAY-TV (channel 6).
The station changed its call letters to KVRR in 1985; that year, KBRR signed on from Thief River Falls as a satellite station serving Grand Forks. Satellite station KNRR signed on from Pembina in 1986, with intentions to target Winnipeg and southern Manitoba. Shortly afterward, on October 6, 1986, the three-station network became a charter affiliate of the upstart Fox network. However, like most early Fox affiliates, the stations still programmed themselves as independents, since Fox carried only one program at the time (The Late Show Starring Joan Rivers, which was beaten in the ratings by NBC's The Tonight Show Starring Johnny Carson, from which she was subsequently banned from appearing). KJRR in Jamestown joined KVRR's regional network in 1988. KJRR served as the network's affiliate for the eastern portion of the Bismarck television market (excluding the city of Bismarck itself) until November 1999, when KNDX signed on as Fox's first affiliate in central North Dakota.
In December 1988, KVRR partnered with three other independent stations serving Minnesota—KTMA (now CW affiliate WUCW) in Minneapolis–Saint Paul, KXLI (now Ion Television owned-and-operated station KPXM) in St. Cloud and KXLT-TV (now a Fox affiliate) in Rochester—to create a new regional television network called the Minnesota Independent Network (MIN). Despite good intentions, the network never got off the ground.
The stations also carried programming from the United Paramount Network (UPN) on a tape delay from the network's debut on January 16, 1995, until its programming was dropped in 1998, due to the presence of Minneapolis UPN affiliate KMSP-TV on cable providers in most of KVRR's viewing area (when KMSP became a Fox owned-and-operated station in September 2002, KCPM |
https://en.wikipedia.org/wiki/Armenian%20American%20Political%20Action%20Committee | Armenian American Political Action Committee (A.A.P.A.C.), was founded by Albert A. Boyajian.
It is a grassroots political organization and coordinates with a network of offices, chapters and supporters throughout the United States and affiliated organizations around the world, and concerns of the Armenian-American community on a broad range of issues.
See also
Armenian American lobby
Armenian National Committee of America
Armenian Assembly of America
Armenian Youth Federation
Armenian Diaspora
List of Armenian-Americans
Little Armenia, Los Angeles, California
External links
Armenian American Political Action Committee Official Site
References
Armenia–United States relations
Political advocacy groups in the United States
Armenian-American history
Armenian diaspora |
https://en.wikipedia.org/wiki/White%20pages%20schema | A white pages schema is a data model, specifically a logical schema, for organizing the data contained in entries in a directory service, database, or application, such as an address book. In a white pages directory, each entry typically represents an individual person that makes use of network resources, such as by receiving email or having an account to log into a system.
In some environments, the schema may also include the representation of organizational divisions, roles, groups, and devices. The term is derived from the white pages, the listing of individuals in a telephone directory, typically sorted by the individual's home location (e.g. city) and then by
their name.
While many telephone service providers have for decades published a list of their subscribers in a telephone directory, and similarly corporations published a list of their employees in an internal directory, it was not until the rise of electronic mail systems that a requirement for standards for the electronic exchange of subscriber information between different systems appeared.
A white pages schema typically defines, for each real-world object being represented:
what attributes of that object are to be represented in the entry for that object
what relationships of that object to other objects are to be represented
how is the entry to be named in a DIT
how an entry is to be located by a client searching for it
how similar entries are to be distinguished
how are entries to be ordered when displayed in a list
One of the earliest attempts to standardize a white pages schema for electronic mail use was in X.520 and X.521, part of the X.500 specifications,
that was derived from the addressing requirements of X.400 and defined a Directory Information Tree that mirrored the international telephone system, with entries representing residential and organizational subscribers. This evolved into the Lightweight Directory Access Protocol standard schema in . One of the most widely deployed white pages schemas used in LDAP
for representing individuals in an organizational context is inetOrgPerson, defined in , although versions of Active Directory require a different object class, User. Many large organizations have
also defined their own white pages schemas for their employees or customers, as part of their Identity management architecture. Converting between data bases and directories using different schemas is often the
function of a Metadirectory, and data interchange standards such as Common Indexing Protocol.
Some early directory deployments suffered due to poor design choices in their white pages schema, such as:
attributes used for naming purposes were non-unique in large environments (such as a person's common name)
attributes used for naming purposes were likely to change (such as surnames)
attributes were included which could lead to Identity theft, such as a Social security number
users were required during provisioning to choose attributes which are |
https://en.wikipedia.org/wiki/T%C5%8Dkai%20Television%20Broadcasting | Tokai Television Broadcasting Co., Ltd. (THK, 東海テレビ放送株式会社, often called Tokai TV (東海テレビ)) is a Japanese television station affiliated with Fuji News Network (FNN) and Fuji Network System (FNS), based in Aichi Prefecture, Gifu Prefecture, and Mie Prefecture. It is also known as Tokai Hoso Kaikan.
Offices
Headquarters - 14-27, Higashi-Sakura Itchome, Naka-ku, Nagoya, Aichi Prefecture, Japan
Tokyo Branch Office - Hibiya Chunichi Building, 1-4, Uchisaiwaicho Nichome, Chiyoda, Tokyo
Osaka Branch Office - Breeze Tower, 4-9, Umeda Nichome, Kita-ku, Osaka, Osaka Prefecture
History
1957-1964: founding and early broadcasts
In 1957, around the application for the third television broadcasting licence in the Tokai region seven companies, namely Tokai Broadcasting, Tokai TV, Tokai Radio, Kinki Tokai Broadcasting, Nippon Color TV, Nagoya Broadcasting and Nippon Television launched their bids. Then, the four companies of Tokai Broadcasting, Tokai TV, Tokai Radio, and Kinki Tokai Broadcasting merged into "New Tokai Television" and obtained a TV broadcasting license on October 22, 1957.
The channel number for broadcasting was anticipated to be channel 1 in the Tokai region, although there were voices in the postal office who believed that channel 1 should be used by CBC as it was the first to broadcast. CBC was willing to continue to use channel 5, as its frequency was widely known, and its number was located in the center of the TV channel switching dial at that time, thus, Tokai TV was going to use channel 1.
On December 1 of the same year, New Tokai TV set up an office in the North Hall of the New Nagoya Building, and began preparations for broadcasting. On January 20 of the following year, New Tokai Television established its headquarters in Higashishincho, Higashi-ku, Nagoya City, and on February 17 changed its name to Tokai Television, referred to as THK.
On December 18, 1958, Tokai TV began airing test signals, and began trial broadcasting on the 21st of the same month. At 11:15 on December 25, Tokai TV officially started broadcasting, becoming the 17th private TV station in Japan. At the beginning of the broadcast, Tokai TV and Kansai TV established a network relationship. In 1959, with the launch of Fuji TV, Tokai TV joined the network with Fuji TV as the flagship station, but also broadcast some programs from both Nippon TV and NET TV. In 1961, Tokai TV abolished the off-air period in the afternoon and started broadcasting uninterruptedly from morning to evening. With the launch of Nagoya TV in 1962, Tokai TV stopped broadcasting programs from Nippon TV and NET TV, and became a member of the Fuji TV network. In 1964, Tokai TV broadcast a color program for the first time (the British series Stingray), which was being networked by Fuji TV). Four years later, Tokai TV's self-produced programs were now produced in color. The first self-produced color program was Kazuo Hasegawa's Masterpiece Series.
1965-1987: growth and success
In 1965, Tokai TV la |
https://en.wikipedia.org/wiki/Laff | Laff or LAFF may refer to:
Laff (TV network), digital multicast television network featuring comedy programming
Laff Records, an independent record label
The Laff Stop, a comedy club in Houston, Texas, U.S.
Laff-A-Lympics, a Saturday morning cartoon series
Latin American Film Festival, an annual film festival held in Utrecht, Netherlands
Latin American Foundation for the Future, a UK-based charity supporting street, working and vulnerable children in Peru
Los Angeles Film Festival, an annual film festival held in Westwood, Los Angeles, California, U.S.
Latin American Fisheries Fellowship, a program at the Bren School of Environmental Science & Management
See also
Laffer (disambiguation)
Laughter (disambiguation) |
https://en.wikipedia.org/wiki/Interpretivism%20%28legal%29 | Interpretivism is a school of thought in contemporary jurisprudence and the philosophy of law.
Overview
The main claims of interpretivism are that
Law is not a set of given data, conventions or physical facts, but what lawyers aim to construct or obtain in their practice. This marks a first difference between interpretivism and legal positivism. But the refusal that law be a set of given entities opposes interpretivism to natural law too.
There is no separation between law and morality, although there are differences. This is not in accordance with the main claim of legal positivism.
Law is not immanent in nature nor do legal values and principles exist independently and outside of the legal practice itself. This is the opposite of the main claim of natural law theory.
In the English-speaking world, interpretivism is usually identified with Ronald Dworkin's thesis on the nature of law as discussed in his text titled Law's Empire, which is sometimes seen as a third way between natural law and legal positivism.
The concept also includes continental legal hermeneutics and authors such as Helmut Coing and Emilio Betti. Legal hermeneutics can be seen as a branch of philosophical hermeneutics, whose main authors in the 20th century are Martin Heidegger and Hans-Georg Gadamer, both drawing on Edmund Husserl's phenomenology. Hermeneutics has now expanded to many varied areas of research in the social sciences as an alternative to a conventionalist approach.
In a wider sense, interpretivism includes even the theses of, in chronological order, Josef Esser, Theodor Viehweg, Chaïm Perelman, Wolfgang Fikentscher, António Castanheira Neves, Friedrich Müller, Aulis Aarnio, and Robert Alexy.
External links
Stanford Encyclopedias articles on legal interpretivism, by Nicos Stavropoulos, and on interpretation and coherence in law, by Julie Dickson.
Interpretation (philosophy)
Theories of law |
https://en.wikipedia.org/wiki/DWIM | DWIM (do what I mean) computer systems attempt to anticipate what users intend to do, correcting trivial errors automatically rather than blindly executing users' explicit but potentially incorrect input.
Software
The term was coined by Warren Teitelman in his DWIM package for BBN Lisp, part of his PILOT system, sometime before 1966.
InterLisp
Teitelman's DWIM package "correct[ed] errors automatically or with minor user intervention", similarly to autocorrection for natural language.
Teitelman and his Xerox PARC colleague Larry Masinter later described the philosophy of DWIM in the Interlisp programming environment (the successor of BBN Lisp):
Although most users think of DWIM as a single identifiable package, it embodies a pervasive philosophy of user interface design: at the user interface level, system facilities should make reasonable interpretations when
given unrecognized input. ...the style of interface used throughout Interlisp allows the user to omit various parameters and have these default to reasonable values...
DWIM is an embodiment of the idea that the user is interacting with an agent who attempts to interpret the
user's request from contextual information. Since we want the user to feel that he is conversing with the system,
he should not be stopped and forced to correct himself or give additional information in situations where the correction or information is obvious.
Critics of DWIM claimed that it was "tuned to the particular typing mistakes to which Teitelman was prone, and no others" and called it "Do What Teitelman Means" or "Do What Interlisp Means", or even claimed DWIM stood for "Damn Warren's Infernal Machine."
Emacs
The concept of DWIM has been adopted in augmented form within the context of the GNU Emacs text editor to describe the design philosophy of Emacs Lisp functions or commands that attempt to intelligently "do the right thing" depending on context. The Emacs wiki gives the example of a file copy command that is able to deduce the destination path from a split window configuration that contains two dired buffers, one of which displays the source path; this behaviour also generalises to many applicable dired actions that take two directory paths for arguments.
DWIM behaviour, when available, is often mentioned in a command's name; e.g. GNU Emacs has a comment-dwim function that comments out a selected region if uncommented, or uncomments it when already commented out, while using comment characters and indentation appropriate for the programming language environment and current context.
This kind of DWIM is often not directly concerned with correcting user error but rather guessing user intent from available context. For example, the Emacs Magit package evinces this design philosophy pervasively. Among its numerous diff commands, there is a magit-diff-dwim command, which requires no further input from the user but simply guesses what the user wants to analyse based on the location of the cursor. The |
https://en.wikipedia.org/wiki/Aero%20California | Aero California (at times shortened as AeroCal) was a low-cost airline with its headquarters in La Paz, Baja California Sur, Mexico, operating a network of domestic passenger flights with its hub at the city's Manuel Márquez de León International Airport.
History
The airline was founded in La Paz, Mexico in 1960 as an air taxi operator using a fleet of Cessna and Beechcraft airplanes, initially known as Servicios Aéreos. By the early 1980s the demand for domestic charter flights had grown enough that the larger Douglas DC-3 was added to the fleet. Scheduled services were launched in June 1982, initially interlinking La Paz, Tijuana and Hermosillo using one Convair 340. In 1989, international scheduled jet flights commenced, with Los Angeles being the first destination. By late 1989, the airline was also serving Phoenix and Tucson besides Los Angeles in the U.S. In 1992, San Diego had been added to the list of cities served by Aero California in the U.S. By 1995, the fleet had been upgraded to only include jet aircraft of various McDonnell Douglas DC-9 subtypes.
On April 3, 2006 all operations of Aero California were suspended by the Mexican Secretariat of Communications and Transport, for alleged deficiencies of administrative and operative nature. It was given 90 days to correct the problems and was able to resume services on August 11, 2006. On July 23, 2008 (at a time when the route network consisted of 17 domestic destinations), the airline was again suspended, this time due to an alleged debt with the Mexican Air Traffic Control (SENEAM). This prompted a labor strike of the employees on August 5, which technically continues to the present day. Aero California's license still remains valid to this day.
Fleet
Aero California operated the following aircraft during its existence:
1 Beechcraft 18
16 Boeing 737-200
2 Cessna 185 Skywagon
2 Cessna 206 Stationair
1 Convair 340
2 Douglas C-47 Skytrain
2 Douglas DC-3
5 McDonnell Douglas DC-9-14
7 McDonnell Douglas DC-9-15
23 McDonnell Douglas DC-9-32
The airline was operating an all-jet fleet with DC-9 aircraft when it ceased operations.
Accidents and incidents
Aero California suffered an accident, which occurred on January 29, 1986. A Douglas DC-3 (registered XA-IOR) crashed into a range of hills near Las Lomitas during bad weather and visibility conditions, killing all 18 passengers and 3 crew. The aircraft had been on a scheduled passenger flight from Villa Constitución Airport to Los Mochis Airport.
On July 21, 2004 at 19:33 local time, a Douglas DC-9 (registered XA-BCS) encountered a wind shear upon take-off at Mexico City International Airport to Durango. All 52 passengers and the four crew members survived the accident, but the airframe was damaged beyond repair and written off.
References
External links
Aero California (Archived version of the official website)
Aero California (Archived version of the official website)
Defunct airlines of Mexico
Companies based in La Paz, Baja C |
https://en.wikipedia.org/wiki/Network%20complexity | Network complexity is the number of nodes and alternative paths that exist within a computer network, as well as the variety of communication media, communications equipment, protocols, and hardware and software platforms found in the network.
Simple network: A small LAN with no alternative paths, a single communication protocol, and identical hardware and software platforms across nodes would be classified as a simple network.
Complex network: An enterprise-wide network that uses multiple communication media and communication protocols to interconnect geographically distributed networks with dissimilar hardware and software platforms would be classified as a complex network.
See also
Connectivity (graph theory)
References
Complexity |
https://en.wikipedia.org/wiki/Centrality | In graph theory and network analysis, indicators of centrality assign numbers or rankings to nodes within a graph corresponding to their network position. Applications include identifying the most influential person(s) in a social network, key infrastructure nodes in the Internet or urban networks, super-spreaders of disease, and brain networks. Centrality concepts were first developed in social network analysis, and many of the terms used to measure centrality reflect their sociological origin.
Definition and characterization of centrality indices
Centrality indices are answers to the question "What characterizes an important vertex?" The answer is given in terms of a real-valued function on the vertices of a graph, where the values produced are expected to provide a ranking which identifies the most important nodes.
The word "importance" has a wide number of meanings, leading to many different definitions of centrality. Two categorization schemes have been proposed. "Importance" can be conceived in relation to a type of flow or transfer across the network. This allows centralities to be classified by the type of flow they consider important. "Importance" can alternatively be conceived as involvement in the cohesiveness of the network. This allows centralities to be classified based on how they measure cohesiveness. Both of these approaches divide centralities in distinct categories. A further conclusion is that a centrality which is appropriate for one category will often "get it wrong" when applied to a different category.
Many, though not all, centrality measures effectively count the number of paths (also called walks) of some type going through a given vertex; the measures differ in how the relevant walks are defined and counted. Restricting consideration to this group allows for taxonomy which places many centralities on a spectrum from those concerned with walks of length one (degree centrality) to infinite walks (eigenvector centrality). Other centrality measures, such as betweenness centrality focus not just on overall connectedness but occupying positions that are pivotal to the network's connectivity.
Characterization by network flows
A network can be considered a description of the paths along which something flows. This allows a characterization based on the type of flow and the type of path encoded by the centrality. A flow can be based on transfers, where each indivisible item goes from one node to another, like a package delivery going from the delivery site to the client's house. A second case is serial duplication, in which an item is replicated so that both the source and the target have it. An example is the propagation of information through gossip, with the information being propagated in a private way and with both the source and the target nodes being informed at the end of the process. The last case is parallel duplication, with the item being duplicated to several links at the same time, like a radio broadcast whic |
https://en.wikipedia.org/wiki/Melissa%20Fahn | Melissa Fahn is an American actress and singer, best known as the voice of Gaz Membrane in the Nickelodeon animated series Invader Zim, Dendy in the Cartoon Network animated series OK K.O.! Let's Be Heroes, Hello Kitty in Hello Kitty's Paradise, as well as voicing many anime and video game characters like Edward from Cowboy Bebop, Neptune from Hyperdimension Neptunia and Rider and her various other incarnations in the Fate stay/night franchise. She starred in the Broadway performance of Wicked and various theatre projects in Los Angeles.
Early life and education
Fahn was born in Long Island, New York to Michael and Millie Fahn. She is the youngest of four siblings. She performed dancing at the age of 3. Her family moved to Huntington Beach, California. Her father, a jazz drummer, encouraged her to learn singing and acting in addition to just dancing. She continued in community theater productions and toured with Young Americans. She majored in dance at California State University, Long Beach, but left after one year to devote her time to work and theater.
Career
While working as a receptionist, her voice caught the attention of a casting director for a new Betty Boop featurette, which led to her first voice-over role in The Betty Boop Movie Mystery. Fahn has voiced many animated characters, Edward in Cowboy Bebop, Haruka in Noein, Gaz as well as others in Invader Zim, and Rika Nonaka, Kristy Damon and Nene Amano in Digimon. She is the voice of Neptune in the Hyperdimension Neptunia series.
She performed live on stage worldwide in shows such as Hal Prince's 3hree, Gilligan's Island the Musical, Singin' in the Rain, No, No, Nanette and the rock-operas of Vox Lumiere.
In 2007, Fahn released her music album Avignon which was produced by her husband, Joel Alpers. The album also involved her brother Tom on trombone and sister-in-law Mary Ann McSweeney in bass. Alpers also played drums and percussion.
Wicked
Fahn was a member of the ensemble in the original Broadway cast of Stephen Schwartz's musical Wicked. In March 2004, Fahn became an understudy for the role of Glinda, replacing Melissa Bell Chait who had suffered a minor stroke. Fahn departed the show on October 31, 2004. She later became an original cast member of the Los Angeles sit-down productions, performing in the ensemble and again understudying the role of Glinda before departing on December 30, 2007.
Personal life
Fahn has three older brothers: Mike Fahn is a musician, while Tom Fahn and Jonathan Fahn are fellow voice and stage actors. In 2000, Fahn met musician Joel Alpers in Los Angeles, and they wed at Kauai, Hawaii, in 2002.
Filmography
Animation
Film
Video games
Theater
Live action television and film
Dubbing roles
Anime
Film
Video games
Discography
Avignon (2007)
References
Bibliography
External links
Melissa Fahn, Melissa Charles, Tina Dixon at Crystal Acids Voice Actor Database
Living people
Actresses from Los Angeles
American musical theatre actresses
Am |
https://en.wikipedia.org/wiki/Zipping%20%28computer%20science%29 | In computer science, zipping is a function which maps a tuple of sequences into a sequence of tuples. This name zip derives from the action of a zipper in that it interleaves two formerly disjoint sequences. The inverse function is unzip.
Example
Given the three words cat, fish and be where |cat| is 3, |fish| is 4 and |be| is 2. Let denote the length of the longest word which is fish; . The zip of cat, fish, be is then 4 tuples of elements:
where # is a symbol not in the original alphabet. In Haskell this truncates to the shortest sequence , where :
zip3 "cat" "fish" "be"
-- [('c','f','b'),('a','i','e')]
Definition
Let Σ be an alphabet, # a symbol not in Σ.
Let x1x2... x|x|, y1y2... y|y|, z1z2... z|z|, ... be n words (i.e. finite sequences) of elements of Σ. Let denote the length of the longest word, i.e. the maximum of |x|, |y|, |z|, ... .
The zip of these words is a finite sequence of n-tuples of elements of , i.e. an element of :
,
where for any index , the wi is #.
The zip of x, y, z, ... is denoted zip(x, y, z, ...) or x ⋆ y ⋆ z ⋆ ...
The inverse to zip is sometimes denoted unzip.
A variation of the zip operation is defined by:
where is the minimum length of the input words. It avoids the use of an adjoined element , but destroys information about elements of the input sequences beyond .
In programming languages
Zip functions are often available in programming languages, often referred to as . In Lisp-dialects one can simply the desired function over the desired lists, is variadic in Lisp so it can take an arbitrary number of lists as argument. An example from Clojure:
;; `nums' contains an infinite list of numbers (0 1 2 3 ...)
(def nums (range))
(def tens [10 20 30])
(def firstname "Alice")
;; To zip (0 1 2 3 ...) and [10 20 30] into a vector, invoke `map vector' on them; same with list
(map vector nums tens) ; ⇒ ([0 10] [1 20] [2 30])
(map list nums tens) ; ⇒ ((0 10) (1 20) (2 30))
(map str nums tens) ; ⇒ ("010" "120" "230")
;; `map' truncates to the shortest sequence; note missing \c and \e from "Alice"
(map vector nums tens firstname) ; ⇒ ([0 10 \A] [1 20 \l] [2 30 \i])
(map str nums tens firstname) ; ⇒ ("010A" "120l" "230i")
;; To unzip, apply `map vector' or `map list'
(apply map list (map vector nums tens firstname))
;; ⇒ ((0 1 2) (10 20 30) (\A \l \i))
In Common Lisp:
(defparameter nums '(1 2 3))
(defparameter tens '(10 20 30))
(defparameter firstname "Alice")
(mapcar #'list nums tens)
;; ⇒ ((1 10) (2 20) (3 30))
(mapcar #'list nums tens (coerce firstname 'list))
;; ⇒ ((1 10 #\A) (2 20 #\l) (3 30 #\i)) — truncates on shortest list
;; Unzips
(apply #'mapcar #'list (mapcar #'list nums tens (coerce firstname 'list)))
;; ⇒ ((1 2 3) (10 20 30) (#\A #\l #\i))
Languages such as Python provide a function, older version (Python 2.*) allowed mapping over lists to get a similar effect. in conjunction with the operator unzips a list:
>>> nums = [1, 2, 3]
>>> tens = |
https://en.wikipedia.org/wiki/E%20caudata | The e caudata (, Latin for "tailed e", from — "tail"; sometimes also called the e cedilla, hooked e, or looped e) is a modified form of the letter E that is usually graphically represented in printed text as E with ogonek (ę) but has a distinct history of usage. It was used in Latin from as early as the sixth century to represent the vowel also written ae or æ. In old Gaelic texts from the 13th century, it represented an ea ligature.
In Middle and Early Modern Irish manuscripts, and in unnormalised transcriptions of them, e caudata is used for e, ae, and ea.
In Old Norse manuscripts, e caudata was used for both short and long versions of . In a few texts in Old Norse, it represents short , the result of i-mutation of Proto-Germanic , and contrasts with e, which represents Proto-Germanic . However, because these two vowels eventually merged to in the written varieties of Old Norse, they are commonly both written as e.
Latin
The use of the e caudata in medieval Latin manuscripts, like the use of the ligature æ, was a transitional stage in the gradual change from representing the diphthong ae with the separate letters ae, as it was written throughout antiquity, to representing it with the letter e. (This phoneme was pronounced as in the classical Latin of the late Roman Republic and early to middle Empire, but at some point between the second half of the 2nd century and the beginning of the 4th century AD, its pronunciation changed to [ε], so that it was indistinguishable from the short e in the pronunciation of the late Empire and the Middle Ages; indeed, medieval scribes sometimes hypercorrected by representing with ae, æ, or ę what in classical Latin had been a monophthongal e.) It probably originated as a modified form of the ligature æ with only the lower loop and not the upper line of the a drawn attached to the e, as in medieval manuscripts the diacritic below the e is sometimes drawn as a loop, similar in shape to the loop of the a in æ in some scripts, rather than as an ogonek.
The e caudata first appears in a few uncial and half uncial manuscripts of the 6th century AD and was first used widely in 7th century Italian and Spanish uncial manuscripts; its use spread to Germany and the British Isles in the late 7th and early 8th centuries and to France in the late 8th century. In manuscripts of the 7th and 8th centuries, ae, æ, and ę are all common. By the 10th century the e caudata had mostly replaced the digraph ae, and it remained the most common way of representing the phoneme ae until the 12th century. However, its use remained uneven, as it was used less frequently in texts which used fewer abbreviations for the sake of greater clarity or formality, such as those written in Carolingian minuscule. E-caudata-like diacritics were also sometimes used on ligatures including an e; for instance, the letters aet were sometimes represented by an ampersand with a loop or hook under it, or the letters quae by the abbreviation for |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.