source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/Tunneling%20protocol | In computer networks, a tunneling protocol is a communication protocol which allows for the movement of data from one network to another. It involves allowing private network communications to be sent across a public network (such as the Internet) through a process called encapsulation.
Because tunneling involves repackaging the traffic data into a different form, perhaps with encryption as standard, it can hide the nature of the traffic that is run through a tunnel.
The tunneling protocol works by using the data portion of a packet (the payload) to carry the packets that actually provide the service. Tunneling uses a layered protocol model such as those of the OSI or TCP/IP protocol suite, but usually violates the layering when using the payload to carry a service not normally provided by the network. Typically, the delivery protocol operates at an equal or higher level in the layered model than the payload protocol.
Uses
A tunneling protocol may, for example, allow a foreign protocol to run over a network that does not support that particular protocol, such as running IPv6 over IPv4.
Another important use is to provide services that are impractical or unsafe to be offered using only the underlying network services, such as providing a corporate network address to a remote user whose physical network address is not part of the corporate network.
Circumventing firewall policy
Users can also use tunneling to "sneak through" a firewall, using a protocol that the firewall would normally block, but "wrapped" inside a protocol that the firewall does not block, such as HTTP. If the firewall policy does not specifically exclude this kind of "wrapping", this trick can function to get around the intended firewall policy (or any set of interlocked firewall policies).
Another HTTP-based tunneling method uses the HTTP CONNECT method/command. A client issues the HTTP CONNECT command to an HTTP proxy. The proxy then makes a TCP connection to a particular server:port, and relays data between that server:port and the client connection. Because this creates a security hole, CONNECT-capable HTTP proxies commonly restrict access to the CONNECT method. The proxy allows connections only to specific ports, such as 443 for HTTPS.
Other tunneling methods able to bypass network firewalls make use of different protocols such as DNS, MQTT, SMS.
Technical overview
As an example of network layer over network layer, Generic Routing Encapsulation (GRE), a protocol running over IP (IP protocol number 47), often serves to carry IP packets, with RFC 1918 private addresses, over the Internet using delivery packets with public IP addresses. In this case, the delivery and payload protocols are the same, but the payload addresses are incompatible with those of the delivery network.
It is also possible to establish a connection using the data link layer. The Layer 2 Tunneling Protocol (L2TP) allows the transmission of frames between two nodes. A tunnel is not encrypted |
https://en.wikipedia.org/wiki/Jetix | Jetix (stylized in all caps) was a children's entertainment brand owned by The Walt Disney Company. The brand was for a slate of action/adventure-related programming blocks and television channels. Jetix programming mainly originated from the Saban Entertainment library, airing live-action and animated series with some original programming.
Jetix was first launched as a programming block in the United States on Toon Disney on February 14, 2004, to compete with Cartoon Network's Toonami block, and in Europe in April 2004. By the end of 2004, Jetix began completely replacing the international Fox Kids channels around the world, the first being the French version in August 2004, and the last one being the German version, in June 2005.
Although it was commercially successful, the Jetix brand was later discontinued in 2009. All international channels were rebranded as either Disney XD or Disney Channel due to The Walt Disney Company's focus on its "Disney," "ABC," and "ESPN" brands. After the shutdown of the last Jetix channel in Russia (replaced with Disney Channel Russia) on August 10, 2010, and with the shutdown of Jetix Play in the Middle East on September 1, 2010 (which was replaced with Playhouse Disney, later Disney Junior) the Jetix brand officially ceased usage.
History
The development of the Jetix brand and launch in the United States
In January 2004, Fox Kids Europe, Fox Kids Latin America (both of which were purchased by Disney in 2001 as part of Fox Family Worldwide) and the ABC Cable Networks Group agreed to rename its then current operations under a single brand, called Jetix, which helped strengthen its then operations into a single force. The Jetix name was applied to its programming blocks which aired on ABC Family and Toon Disney, its television channels in Europe and Latin America, along with its program library and merchandising. After the end of Fox Kids in the US, much of the content previously aired on the block migrated to ABC Family and Toon Disney; the international Fox Kids networks kept operating despite their US forerunner becoming defunct.
The Jetix name was chosen after the company conducted international research specifically with a number of children's focus groups. Many of the children picked the name as it implied action and adventure, and the company was able to use the name internationally due to its ambiguity. Bruce Steinberg, chairman and chief executive officer of Fox Kids Europe, explain that Jetix would help strengthen Fox Kids Europe's partnership with Disney while building new alliances to continue to successfully leverage its programming library and distribution.
On Valentine's Day 2004, Toon Disney and ABC Family launched Jetix with Jetix Cards Live, the world's first concurrently online and telecast trading card game. ABC Family aired Jetix on weekdays from 7am to 9am and weekends 7am to 12 noon ET/PT. The block also aired on Toon Disney Monday through Thursday from 7pm to 9pm ET/PT and weekends f |
https://en.wikipedia.org/wiki/C-One | The C-One is a single-board computer (SBC) created in 2002 as an enhanced version of the Commodore 64, a home computer popular in the 1980s. Designed by Jeri Ellsworth and Jens Schönfeld from Individual Computers, who manufactured the boards themselves, the C-One has been re-engineered to allow cloning of other 8-bit computers.
Design
The machine uses a combination of configurable Altera field-programmable gate array (FPGA) chips and modular CPU expansion cards to create compatibility modes that duplicate the function of many older home computers. The default CPU is the W65C816S (by Western Design Center) which is used in Commodore 64 compatibility mode as well as the C-One's native operating mode. The C-One is not merely a software emulator, it loads various core files from a card to configure the FPGA hardware to recreate the operation of the core logic chipsets found in vintage computers. This provides for a very accurate and customizable hardware emulation platform. The C-One is not limited to recreating historical computers: its programmable core logic can be used to create entirely new custom computer designs.
In 2004, the platform was expanded to include an Amstrad CPC core made by Tobias Gubener.
In 2006, Peter Wendrich ported his FPGA-64 project (originally intended for a Xilinx FPGA) and enhanced it for the C-One. This core supported both PAL and NTSC machine emulation, and aimed to be cycle-exact and emulate many of the bugs and quirks of the original hardware.
In 2008, after development of an "Extender" card which added a third FPGA, Tobias Gubener added Amiga 500 compatibility by porting Dennis van Weeren's Minimig code to the board. This core replaced the physical 68000 CPU and the PIC chip from the original with his own TG68 CPU core on the FPGA. developments to this core include features not possible with the original Minimig board.
In 2009, Peter Wendrich released a "preview" of a next-generation C64 core called "Chameleon 64", with a greatly expanded specification compared to his earlier core. A new version of the CPC core was also released in mid-2009, featuring an embedded SymbOS core for control of device emulation, and a clock unlocked mode for CPU speeds of up to 80 MHz.
So far, C-One circuit boards have been produced by German company Individual Computers, and they sell for €333 with the FPGA extender card.
See also
C64 Direct-to-TV
Sprinter (computer)
1chipMSX
References
External links
Wiki
Retroputing's forum on the C-One
Yahoo's C-One Group
Yahoo group for technical discussion about development of cores for the C-One
Home computer remakes
Microcomputers
6502-based home computers
Home computers
Commodore 64
Amstrad CPC
Reconfigurable computing |
https://en.wikipedia.org/wiki/Action%21%20%28programming%20language%29 | Action! is a procedural programming language and integrated development environment written by Clinton Parker for the Atari 8-bit family. The language, which is similar to ALGOL, compiles to high-performance code for the MOS Technology 6502 of the Atari computers. Action! was distributed on ROM cartridge by Optimized Systems Software starting in 1983. It was one of the company's first bank-switched 16 kB "Super Cartridges". The runtime library is stored in the cartridge; to make a standalone application requires the Action! Toolkit which was sold separately by OSS.
Parker, working with Henry Baker, had previously developed Micro-SPL, a systems programming language for the Xerox Alto. Action! is largely a port of Micro-SPL concepts to the Atari with changes to support the 6502 processor and the addition of an integrated fullscreen editor and debugger.
Action! was used to develop at least two commercial products—the HomePak productivity suite and Games Computers Play client program—and numerous programs in ANALOG Computing and Antic magazines. The editor inspired the PaperClip word processor. The language was not ported to other platforms.
The assembly language source code for Action! was made available under the GNU General Public License by the author in 2015.
Development environment
Action! is one of the earlier examples of the OSS SuperCartridge format. ROM cartridges on the Atari were normally limited to 8 kB, which limited its ability to support larger programs. The SuperCartridge had 16 kB organized as four 4 kB blocks, two of which were visible at any time. The lower 4 kB did not change, and system could bank switch between the other three blocks by changing the value in address $AFFF.
Action! used this design by breaking the system into four sections, the editor, the compiler, a monitor for testing code and switching between the editor and compiler, and the run-time library. The run-time library is stored in the cartridge itself. To distribute standalone applications requires a separate run-time package which was sold by OSS as the Action! Toolkit.
Action! constructs were designed to map cleanly to 6502 opcodes, to provide high performance without needing complex optimizations in the one-pass compiler. For example, local variables are assigned fixed addresses in memory, instead of being allocated on a stack of activation records. This eliminates the significant overhead associated with stack management, which is especially difficult in the case of the 6502's 256-byte stack. However, this precludes the use of recursion.
Unlike the integrated Atari BASIC and Atari Assembler Editor environments, the Action! editor does not use line numbers. It has a fullscreen, scrolling display capable of displaying two windows, and includes block operations and global search and replace.
The monitor serves as a debugger, allowing an entire program or individual functions to be run, memory to be displayed and modified, and program execution to be tra |
https://en.wikipedia.org/wiki/Rail%20transport%20in%20Italy | The Italian railway system is one of the most important parts of the infrastructure of Italy, with a total length of of which active lines are 16,723 km. The network has recently grown with the construction of the new high-speed rail network. Italy is a member of the International Union of Railways (UIC). The UIC Country Code for Italy is 83.
The network
RFI (Rete Ferroviaria Italiana, Italian Rail Network), a state owned infrastructure manager which administers most of the Italian rail infrastructure. The total length of RFI active lines is , of which are double tracks. Lines are divided into 3 categories:
fundamental lines (fondamentali), which have high traffic and good infrastructure quality, comprise all the main lines between major cities throughout the country. Fundamental lines are long;
complementary lines (complementari), which have less traffic and are responsible for connecting medium or small regional centers. Most of these lines are single track and some are not electrified;
node lines (di nodo), which link complementary and fundamental lines near metropolitan areas for a total .
Most of the Italian network is electrified (). Electric system is 3 kV DC on conventional lines and 25 kV AC on high-speed lines.
The Italian rail network comprises also other minor regional lines controlled by other companies, such as Ferrovie Emilia Romagna and Ferrovie del Sud Est, for a total of
History
The first railway in Italy was the Napoli-Portici line, built in 1839 to connect the city of Naples to the Royal Palace of Portici. After the creation of the Kingdom of Italy in 1861, a project was started to build a network from the Alps to Sicily, in order to connect the country.
The first high-speed train was the Italian ETR 200, which in July 1939 went from Milan to Florence at , with a top speed of . With this service, the railway was able to compete with the upcoming airplanes. The Second World War stopped these services.
After the Second World War, Italy started to repair the damaged railways, and built nearly of new tracks.
Nowadays the rail tracks and infrastructure are managed by Rete Ferroviaria Italiana (RFI), while the train and the passenger section is managed mostly by Trenitalia. Both are Ferrovie dello Stato (FS) subsidiaries, once the only train operator in Italy.
High-speed rail
High-speed trains were developed during the 1960s. E444 locomotives were the first standard locomotives capable of top speed of , while an ALe 601 electrical multiple unit (EMU) reached a speed of during a test. Other EMUs, such as the ETR 220, ETR 250 and ETR 300, were also updated for speeds up to . The braking systems of cars were updated to match the increased travelling speeds.
On 25 June 1970, work was started on the Rome–Florence Direttissima, the first high-speed line in Italy. It included the bridge on the Paglia river, then the longest in Europe. Works were completed in the early 1990s.
In 1975, a program for a widespread updating |
https://en.wikipedia.org/wiki/Higher%20education%20in%20Iran | Iran has a large network of private, public, and state affiliated universities offering degrees in higher education. State-run universities of Iran are under the direct supervision of Iran's Ministry of Science, Research and Technology (for non-medical universities) and Ministry of Health and Medical Education (for medical schools). According to article 3 of the Constitution of the Islamic Republic of Iran, Iran guarantees "free education and physical training for everyone at all levels, and the facilitation and expansion of higher education." ...
History
Pre-Islamic era
The existence of pre-Islamic era universities such as the School of Nisibis, Sarouyeh, Reishahr, and The Academy of Gundishapur provide examples of precedence of academic institutions of science that date back to ancient times.
Islamic era
The traditions and heritage of these centers of higher learning were later carried on to schools such as Iran's Nizamiyya, and Baghdad's House of Wisdom, during the Islamic era.
Nizamiyyah institutes were among the first well organized institutions of higher learning in the Muslim world. The quality of education was among the highest in the Islamic world, and they were even renowned in Europe. They were supported financially, politically, and spiritually by the royal establishment and the elite class. Some scholars have suggested that the establishment of the Nizamiyya madrasas was in fact an attempt to thwart the growing influence of another group of Muslims, the Ismailis, in the region. Indeed, Nizam al-Mulk devoted a significant section in his famous Books of Politics (Siyāsatnāma) to refuting the Ismaili doctrines.
The most famous and celebrated of all the nizamiyyah schools was Al-Nizamiyya of Baghdad (established 1065), where Khwaja Nizam al-Mulk appointed the distinguished philosopher and theologian, al-Ghazali, as a professor. Persian poet Sa'di was a student of the Baghdad Nizamiyyah. Other nizamiyyah schools were located in Nishapur, Amol, Balkh, Herat and Isfahan.
Modern
It was Abbas Mirza who first dispatched Iranian students to Europe for a western education.
The history of the establishment of western style academic universities in Iran (Persia) dates back to 1851 with the establishment of Darolfonoon – which was founded as a result of the efforts of the royal vizier Mirza Taghi Khan Amir Kabir, aimed at training and teaching Iranian experts in many fields of science and technology.
In 1855 "The Ministry of Science" was first established, and Ali Gholi Mirza I'tizad al-saltaneh (علیقلی میرزا اعتضاد السلطنه) was appointed Iran's first Minister of Science by Nasereddin Shah.
By the 1890s Darolfonoon was competing with other prominent institutions of modern learning. The Military College of Tehran (Madraseh-ye Nezam), established in 1885 with a budget of 10,000-12,000 tomans, was its first rival; and in 1899 the College of political sciences (Madraseh-ye olum-e siyasi) was organized within the Foreign ministry.
The Mi |
https://en.wikipedia.org/wiki/House%20%28TV%20series%29 | House (also called House, M.D.) is an American medical drama television series that originally ran on the Fox network for eight seasons, from November 16, 2004, to May 21, 2012. The series' main character is Dr. Gregory House (Hugh Laurie), an unconventional, misanthropic medical genius who, despite his dependence on pain medication, leads a team of diagnosticians at the fictional Princeton–Plainsboro Teaching Hospital (PPTH) in New Jersey. The series' premise originated with Paul Attanasio, while David Shore, who is credited as creator, was primarily responsible for the conception of the title character.
The series' executive producers included Shore, Attanasio, Attanasio's business partner Katie Jacobs, and film director Bryan Singer. It was filmed largely in a neighborhood and business district in Los Angeles County's Westside called Century City. The show received high critical acclaim, and was consistently one of the highest rated series in the United States.
House often clashes with his fellow physicians, including his own diagnostic team, because many of his hypotheses about patients' illnesses are based on subtle or controversial insights. His flouting of hospital rules and procedures frequently leads him into conflict with his boss, hospital administrator and Dean of Medicine Dr. Lisa Cuddy (Lisa Edelstein). House's only true friend is Dr. James Wilson (Robert Sean Leonard), head of the Department of Oncology.
During the first three seasons, House's diagnostic team consists of Dr. Robert Chase (Jesse Spencer), Dr. Allison Cameron (Jennifer Morrison) and Dr. Eric Foreman (Omar Epps). At the end of the third season, this team disbands. Rejoined by Foreman, House gradually selects three new team members: Dr. Remy "Thirteen" Hadley (Olivia Wilde), Dr. Chris Taub (Peter Jacobson) and Dr. Lawrence Kutner (Kal Penn). Chase and Cameron continue to appear occasionally in different roles at the hospital. Kutner dies late in season five; early in season six, Cameron departs the hospital, and Chase returns to the diagnostic team. Thirteen takes a leave of absence for most of season seven, and her position is filled by medical student Martha M. Masters (Amber Tamblyn). Cuddy and Masters depart before season eight; Foreman becomes the new Dean of Medicine, while Dr. Jessica Adams (Odette Annable) and Dr. Chi Park (Charlyne Yi) join House's team.
House was among the top 10 series in the United States from its second season through the fourth season. Distributed to 66 countries, House was the most-watched television program in the world in 2008. The show received numerous awards, including five Primetime Emmy Awards, two Golden Globe Awards, a Peabody Award, and nine People's Choice Awards. On February 8, 2012, Fox announced that the eighth season, then in progress, would be its last. The series finale aired on May 21, 2012, following an hour-long retrospective.
Production
Conception
In 2004, David Shore and Paul Attanasio, along with Attanasio's |
https://en.wikipedia.org/wiki/The%20Lost%20Crown%20of%20Queen%20Anne | The Lost Crown of Queen Anne is a text-based adventure computer game written by Robert Wayne Atkinsfor the Commodore 64 and MS-DOS and is a part of the Classic Adventure Series. It was also included on Big Blue Disk #28 and Loadstar #57.
In the game, the player must find Queen Anne's crown. In the game's fictional plot, the crown went missing shortly after the Queen's death in 1714, and was last known to be in the possession of a Sheikh in the Arabian Desert.
Plot
The game begins in the Arabian Desert, where the player's camel has gone lame, and they are out of food and water. Throughout the game, the player must avoid starvation, dehydration, poison traps, and other dangers. The game ends when the player either finds the crown, or dies.
Certain elements of the game are randomized. Although text-based, the screen is split into a map, area description, and inventory of items. At the bottom of the screen are statistics such as hunger, thirst, number of treasures found, total moves, and score.
Legacy
The game was made available by the developer (together with the other games of his career) for download free of charge in 2003.
References
Commodore 64 games
DOS games
Adventure games
Freeware games
Video games developed in the United States
Softdisk |
https://en.wikipedia.org/wiki/1938%20in%20rail%20transport |
Events
January
January 1 – Creation of the following European railway networks under government control:
SNCF (Société Nationale des Chemins de fer Français), bringing the principal railway companies of France together.
NS (Nederlandsche Spoorwegen), merging the Hollandsche IJzeren Spoorweg-Maatschappij (HSM) and the Maatschappij tot Exploitatie van Staatsspoorwegen (SS) in the Netherlands.
January 22 – The Pacific Electric Whittier Line is truncated to Walker.
February
February 22 – The Atchison, Topeka and Santa Fe Railway introduces the El Capitan passenger train between Chicago and Los Angeles.
February 26 – A second all-lightweight trainset enters service on the Super Chief.
March
March 6 – The Pacific Electric Walker Line is discontinued.
March 18 – Bundesbahn Österreich (BBÖ, Federal Railway of Austria) integrated into Deutsche Reichsbahn.
March 27 – Atchison, Topeka and Santa Fe Railway inaugurates the San Diegan passenger train between Los Angeles and San Diego.
May
May 8 — President Manuel L. Quezon inaugurates regular services on the Main Line South of the Manila Railroad in Del Gallego, Camarines Sur. Trial runs already began five months prior.
May 15
The Lake Shore Electric Railway in Ohio ceases operations.
Inauguration of a major Nederlandse Spoorwegen electrification scheme in the central Netherlands, centred on Utrecht.
June
June 1 – Pacific Electric's Owensmouth Line and San Fernando Line are truncated to Sherman Way.
June 15 – New York Central Railroad introduces an all-streamlined consist on the 20th Century Limited and also introduces the New England States passenger train between Chicago and Boston.
June 16 – The Pike's Peak Cog Railway in Colorado operates gasoline-powered railcar number 7, the first rack railcar in the world, for the first time.
June 19 – Custer Creek train wreck kills at least 47 near Saugus, Montana. A bridge, weakened by a flash flood, collapses under the Milwaukee Road's Olympian plunging the locomotive and seven lead cars into the rain-swollen creek. It remains the worse rail disaster in Montana history.
June 30 – London Underground 1938 Stock enters public service, on Northern line.
July
July 3 – The London and North Eastern Railway 4-6-2 Mallard reaches a speed of 126 mph (203 km/h), the highest certified speed for a steam locomotive.
July 31 – The Pennsylvania Railroad, in its public timetable issued today, boasts that “19% of all passengers are carried on the Pennsylvania Railroad.”
October
October – Electro-Motive Corporation introduces the EMC E4.
November
November 1 – Passenger service ends on the Maine narrow gauge Monson Railroad.
December
December 13 – The Reading Railroad's Crusader passenger train is introduced.
December 15
The first diesel locomotives in the southeast United States, EMC E4s, appear on the Orange Blossom Special.
The second section of the Itō Line, connecting Ajiro to Itō in Japan, opens.
December 23 – Jean Renoir's film of La Bê |
https://en.wikipedia.org/wiki/Default%20route | In computer networking, the default route is a configuration of the Internet Protocol (IP) that establishes a forwarding rule for packets when no specific address of a next-hop host is available from the routing table or other routing mechanisms.
The default route is generally the address of another router, which treats the packet the same way: if a route matches, the packet is forwarded accordingly, otherwise the packet is forwarded to the default route of that router. The route evaluation process in each router uses the longest prefix match method to obtain the most specific route. The network with the longest subnet mask or network prefix that matches the destination IP address is the next-hop network gateway. The process repeats until a packet is delivered to the destination host, or earlier along the route, when a router has no default route available and cannot route the packet otherwise. In the latter case, the packet is dropped and an ICMP Destination Unreachable message may be returned. Each router traversal counts as one hop in the distance calculation for the transmission path.
The device to which the default route points is often called the default gateway, and it often carries out other functions such as packet filtering, firewalling, or proxy server operations.
The default route in Internet Protocol Version 4 (IPv4) is designated as the zero address, in CIDR notation. Similarly, in IPv6, the default route is specified by . The subnet mask is specified as , which effectively specifies all networks and is the shortest match possible. A route lookup that does not match any other rule falls back to this route.
In the highest-level segment of a network, administrators generally point the default route for a given host towards the router that has a connection to a network service provider. Therefore, packets with destinations outside the organization's LAN, typically destinations on the Internet or a wide area network, are forwarded to the router with the connection to that provider.
References
Internet architecture
Routing |
https://en.wikipedia.org/wiki/Desktop%20search | Desktop search tools search within a user's own computer files as opposed to searching the Internet. These tools are designed to find information on the user's PC, including web browser history, e-mail archives, text documents, sound files, images, and video. A variety of desktop search programs are now available; see this list for examples. Most desktop search programs are standalone applications. Desktop search products are software alternatives to the search software included in the operating system, helping users sift through desktop files, emails, attachments, and more.
Desktop search emerged as a concern for large firms for two main reasons: untapped productivity and security. According to analyst firm Gartner, up to 80% of some companies' data is locked up inside unstructured data — the information stored on a user's PC, the directories (folders) and files they've created on a network, documents stored in repositories such as corporate intranets and a multitude of other locations. Moreover, many companies have structured or unstructured information stored in older file formats to which they don't have ready access.
The sector attracted considerable attention in the late 2004 to early 2005 period from the struggle between Microsoft and Google. According to market analysts, both companies were attempting to leverage their monopolies (of web browsers and search engines, respectively) to strengthen their dominance. Due to Google's complaint that users of Windows Vista cannot choose any competitor's desktop search program over the built-in one, an agreement was reached between US Justice Department and Microsoft that Windows Vista Service Pack 1 would enable users to choose between the built-in and other desktop search programs, and select which one is to be the default. As of September 2011, Google ended life for Google Desktop.
Technologies
Most desktop search engines build and maintain an index database to improve performance when searching large amounts of data. Indexing usually takes place when the computer is idle and most search applications can be set to suspend indexing if a portable computer is running on batteries, in order to save power. There are notable exceptions, however: Voidtools' Everything Search Engine, which performs searches over only file names, not contents, is able to build its index from scratch in just a few seconds. Another exception is Vegnos Desktop Search Engine, which performs searches over filenames and files' contents without building any indices. An index may also not be up-to-date, when a query is performed. In this case, results returned will not be accurate (that is, a hit may be shown when it is no longer there, and a file may not be shown, when in fact it is a hit). Some products have sought to remedy this disadvantage by building a real-time indexing function into the software. There are disadvantages to not indexing. Namely, the time to complete a query can be significant, and the issued query c |
https://en.wikipedia.org/wiki/Datacasting | Datacasting (data broadcasting) is the broadcasting of data over a wide area via radio waves. It most often refers to supplemental information sent by television stations along with digital terrestrial television (DTT), but may also be applied to digital signals on analog TV or radio. It generally does not apply to data inherent to the medium, such as PSIP data that defines virtual channels for DTT or direct broadcast satellite system, or to things like cable modems or satellite modems, which use a completely separate channel for data.
Overview
Datacasting often provides news, weather forecasting, traffic reporting, stock market, and other information which may or may not relate to the carried programs. It may also be interactive, such as gaming, shopping, or education. An electronic program guide is usually included, although it somewhat stretches the definition, as this is often considered inherent to the digital broadcast standard.
The ATSC, DVB and ISDB standards allow for broadband datacasting via DTT, though they do not necessarily define how. The overscan and VBI are used for analog TV, for moderate and low bandwidths (including closed captioning in the VBI) respectively. DirectBand and RDS/RBDS are medium and narrow subcarriers used for analog FM radio. The EUREKA 147 and HD Radio standards both allow for datacasting on digital radio, defining a few basics but also allowing for later expansion.
The term IP Datacasting (IPDC) is used in DVB-H for the technical elements required to send IP packets over DVB-H broadband downstream channel combined with a return channel over a mobile communications network such as GPRS or UMTS. The set of specifications for IP Datacast (phase1) was approved by the DVB project in October 2005.
Datacasting services around the world
North America
Ambient Information Network
Ambient Information Network, a datacasting network owned by Ambient Devices presently hosted by U.S.A. Mobility, a U.S. paging service which focuses on information of interest to the local (or larger) area, such as weather and stock indices, and personalized information will be provided with a paid ambient subscription on that particular device.
RBDS
A slight variation of the European Radio Data System, RBDS is carried on a 57kHz subcarrier on FM radio stations. While originally intended for program-associated data, it can also be used for datacasting purposes including paging and dGPS.
DirectBand
DirectBand, owned by Microsoft, uses the 67.65 kHz subcarrier leased from FM radio stations. This subcarrier delivers about 12 kbit/s (net after error correction) of data per station, for over 100 MB per day per city. Data includes traffic, sports, weather, stocks, news, movie times, calendar appointments, and local time.
MovieBeam
The now-defunct MovieBeam service used dNTSC technology by Dotcast to transmit 720p HDTV movies in the lower vestigial sideband of NTSC analog TV. The set-top box stored the movies to be viewed on demand for a |
https://en.wikipedia.org/wiki/CGL | CGL may refer to:
Cambridge Greek Lexicon
Catalyst Game Labs
Core OpenGL: Apple Computer's Macintosh Quartz windowing system interface to the Mac OS X implementation of the OpenGL specification
Conway's Game of Life
Chengalpattu Junction railway station (station code), in Tamil Nadu, India
Chronic granulocytic leukemia, also known as Chronic myelogenous leukemia
Confederazione Generale del Lavoro
Commercial General Liability, a common type of liability insurance
CGL (charity) |
https://en.wikipedia.org/wiki/Danny%20Antonucci | Daniel Edward Antonucci (, ; born February 27, 1957) is a Canadian animator, director, producer, and writer. Antonucci is most known for creating the Cartoon Network animated comedy series Ed, Edd n Eddy. He also created Lupo the Butcher, Cartoon Sushi, and The Brothers Grunt.
Antonucci dropped out of the Sheridan College of Visual Arts to take a job as an animator at Hanna-Barbera and worked on a number of series, including Fables of the Green Forest, The Flintstone Comedy Show, Scooby-Doo and Scrappy-Doo, The Smurfs, and Richie Rich. He continued his career in Vancouver, working on animated shorts and television commercials for International Rocketship Limited, and created his first solo work, the animated short Lupo the Butcher. At MTV, Antonucci worked on a number of commercials, his series The Brothers Grunt, and the animation showcase program Cartoon Sushi, which he co-created with Keith Alcorn. He went on to create Ed, Edd n Eddy for Cartoon Network. In 2008, Antonucci signed to WildBrain.
Throughout his career, Antonucci won a number of awards. Many of his commercials for Converse, ESPN and Levi's won a number of awards. Lupo the Butcher was a successful short and is considered to be a cult classic.
Early life
Antonucci's parents were Italian immigrants to Canada. His experiences as a child in an immigrant family deeply influenced his later work, such as Lupo the Butcher.
Antonucci attended the Sheridan College of Visual Arts but quit to take a job as an animator at Canimage Production, a division of Hanna-Barbera.
Career
Starting his career as an animator, Antonucci worked on numerous shows, including The Flintstone Comedy Show, Scooby-Doo and Scrappy-Doo, The Smurfs, and Richie Rich.
Intending to move to Los Angeles in 1984 to find more work, Antonucci landed in Vancouver, British Columbia. He landed a job at International Rocketship Limited, animating short films and television commercials. His first effort was on the short film Hooray for Sandbox Land.
International Rocketship Limited, foundation of a.k.a. Cartoon, and MTV work
Antonucci's first solo work was Lupo the Butcher, produced by International Rocketship Limited, about a short-tempered butcher who swears at the meat he is cutting and gets extremely mad at the smallest mistakes. Antonucci explains the short arose out of his own frustration at having to work in children's film for so long, and to try his hand at creating a full-fledged character on film. The short animated film screened at several film festivals, including Spike and Mike's Sick and Twisted Festival of Animation in the United States.
The 'Lupo' character was eventually licensed by the Converse athletic shoe company. This led to additional work, including animated commercials for Levi Strauss & Co. ESPN, Converse and MTV. He also originally created a mascot for Cartoon Network, known as the jester, as well as the mascot's bumpers.
On April 1, 1994, Antonucci started an animation company named a.k.a. Cart |
https://en.wikipedia.org/wiki/THOMAS | THOMAS was the first online database of United States Congress legislative information. A project of the Library of Congress, it was launched in January 1995 at the inception of the 104th Congress and retired on July 5, 2016; it has been superseded by Congress.gov.
Contents
The resource was a comprehensive, Internet-accessible source of information on the activities of Congress, including:
bills and resolutions
texts
summaries and status
voting results, including how individual members voted
Congressional Record, including the daily digest
presidential nominations
treaties
The database was named after Thomas Jefferson, who was the third President of the United States. "THOMAS" was an acronym for "The House [of Representatives] Open Multimedia Access System".
The website allowed users to share legislative information via several social networking sites, and there were proposals for an application programming interface.
Library of Congress Legislative Data Challenge
The Library of Congress created the Markup of US Legislation in Akoma Ntoso challenge in July 2013 to create representations of selected US bills using the most recent Akoma Ntoso standard within a couple months for a $5,000 prize, and the Legislative XML Data Mapping challenge in September 2013 to produce a data map for US bill XML and UK bill XML to the most recent Akoma Ntoso schema within a couple months for a $10,000 prize.
In December 2013, the Library of Congress announced "Jim Mangiafico as the winner of our first legislative data challenge, Markup of US Legislation in Akoma Ntoso and the $5,000 prize".
In February 2014, Jim Mangiafico and Garrett Schure as the winners of the Library of Congress Second Legislative Data Challenge.
References
External links
THOMAS (now redirects to Congress.gov)
Computer-related introductions in 1995
Government databases in the United States
Government-owned websites of the United States
Library of Congress
Online law databases |
https://en.wikipedia.org/wiki/P.%20J.%20Plauger | Phillip James (P.J. or Bill) Plauger (; born January 13, 1944, Petersburg, West Virginia) is an author, entrepreneur and computer programmer. He has written and co-written articles and books about programming style, software tools, and the C programming language, as well as works of science fiction.
Personal life and career
Plauger worked at Bell Labs from 1969 to 1975, where he coauthored Elements of Programming Style and Software Tools with Brian Kernighan. In 1978, he founded Whitesmiths, the first company to sell a C compiler and Unix-like operating system (Idris). He has since been involved in C and C++ standardization and is now the president of Dinkumware. In January 2009 he became the convener of the ISO C++ standards committee, but in October 2009 he tendered his resignation after failing to pass a resolution to stop processing any new features in order to facilitate the promised shipping date for the C++0x standard.
Plauger has been credited with inventing pair programming while leading Whitesmiths Ltd.
Plauger has written a number of science fiction stories, notably "Child of All Ages", first published in the March 1975 issue of Analog, which features a protagonist who has achieved immortality at the cost of never growing beyond childhood. The story was nominated for the Hugo and Nebula awards in 1976. Plauger won the John W. Campbell Award for Best New Writer in 1975—notably beating John Varley for the award—and subsequently sold a story to The Last Dangerous Visions.
Plauger holds a bachelor's degree in physics from Princeton University and a PhD in nuclear physics from Michigan State University.
Dinkumware
Dinkumware is an American software company specializing in core libraries for C/, owned and operated by P.J. Plauger. It is based in Concord, Massachusetts.
The company has provided the C++ Standard Library implementation that ships with Microsoft since 1996 and Embarcadero C++Builder since 2005, and supplies and libraries to the embedded community. It also provides libraries for Java and other tools, including "proofers" to test for library adherence to the standard.
Nonfiction works
The Elements of Programming Style (1974, revised 1978) with Brian W. Kernighan
Software Tools (1976) with Brian W. Kernighan
Software Tools in Pascal (1981) with Brian W. Kernighan
The Standard C library (1992)
Programming on Purpose, collected essays from the magazine Computer Language
Volume I: Essays on Software Design (1992)
Volume II: Essays on Software People (1993)
Volume III: Essays on Software Technology (1993)
The Draft Standard C++ Library (1995)
Standard C: A Reference (1989, revised 1992, revised 1996) with Jim Brodie
The C++ Standard Template Library (2001) with Alexander Stepanov, Meng Lee, and David Musser
References
External links
Personal website
Dinkumware company website
1944 births
20th-century American novelists
American male novelists
American science fiction writers
John W. Campbell Award for Best New Writ |
https://en.wikipedia.org/wiki/F%C3%ADorsc%C3%A9al | Fíor Scéal is an Irish language documentary series broadcast on Irish language television channel TG4 about aspects of world current affairs and other topics. The series is based on programming funded by SBS in Australia and by a French production company, this series in Ireland has been repackaged for an Irish audience.
The etymology of the name comes from fíor, meaning "true" and scéal meaning "story". The audio is spoken in the Irish language and any applicable native languages and there are subtitles in English. Among the presenters are Eibhlín Ní Choistealbha, Máire T. Ní Mhadaoin, Maolra Mac Donnchadha, and Alex Hijmans. Programmes typically run for 60 minutes.
External links
TG4 website
Fíor Scéal at tg4.ie
Irish documentary television series
Irish-language television shows
TG4 original programming |
https://en.wikipedia.org/wiki/Poppa%27s%20Got%20a%20Brand%20New%20Badge | "Poppa's Got a Brand New Badge" is the twenty-second and final episode of the thirteenth season of the American animated television series The Simpsons. It first aired on the Fox network in the United States on May 22, 2002. In the episode, a massive heatwave causes the residents of Springfield to install large air conditioning devices in their homes. This leads the Springfield Nuclear Power Plant to overload, causing two town-wide blackouts to occur. The Springfield Police Department are unable to face the riots that follow, prompting Homer, dissatisfied with the police's incompetence, to start his own security company, called SpringShield.
"Poppa's Got a Brand New Badge" was directed by Pete Michels and written by Dana Gould, who also pitched the idea for the episode. It features American actor Joe Mantegna as recurring character Fat Tony, and includes references to Dragnet, High Noon and The Sopranos.
In its original broadcast, the episode was seen by approximately 5.3 million viewers, finishing in 53rd place in the ratings the week it aired. Following its home video release on August 24, 2010, the episode received mixed reviews from critics.
The episode was dedicated to the memory of Stephen Jay Gould who died two days before it aired. He had voiced himself in the ninth-season episode "Lisa the Skeptic".
Plot
Springfield is in the midst of a massive heat wave. Every building in the town has installed a large air conditioning device. However, this draws a lot of power from the Springfield Nuclear Power Plant. Despite the safety measures Mr. Burns has taken (cutting power to the orphanage), the plant is at full power. At home, without an air conditioning device, the Simpsons have to follow an old-fashioned fan. Homer decides to give them a taste of winter by plugging in his dancing Santa Claus. This overloads the plant and causes a town-wide blackout. After Lenny and Carl accidentally crash their cars into a store with no active alarm and decide to loot it, widespread rioting and looting occur. The police try to intervene, but are powerless to stop the massive crime wave.
The next day, Springfield has been devastated by the crime wave. Mayor Quimby decides to take legal action by forming a blue-ribbon committee. At the Simpsons' house, someone steals Lisa's Malibu Stacy collection. Homer decides to take action by looking for it. He finds the culprit, Jimbo Jones, and later foils a robbery by Snake Jailbird at the Kwik-E-Mart. He goes through a very long list of his previous jobs (during which Marge puts curlers in her hair off-screen) and decides that he likes the idea of combining his love of helping and hurting people. Homer forms his own security company called "SpringShield". Although it only has Homer, Lenny, and Carl, it is more efficient and more successful than the Springfield Police Department. When Quimby sees Chief Wiggum trying to shoot a Piñata with a shotgun while blindfolded, in a fit of rage he dismisses Wiggum and makes Ho |
https://en.wikipedia.org/wiki/Terak | Terak may refer to:
Terak Corporation, a defunct American computer company based in Scottsdale, Arizona
Terak 8510/a, the company's 1977 graphical workstation
Terak Township (), a township of Wuqia County in Xinjiang Uygur Autonomous Region, China
King Terak, a minor Star Wars character |
https://en.wikipedia.org/wiki/Signal%20propagation%20delay | Propagation delay is the time duration taken for a signal to reach its destination. It can relate to networking, electronics or physics.
Networking
In computer networks, propagation delay is the amount of time it takes for the head of the signal to travel from the sender to the receiver. It can be computed as the ratio between the link length and the propagation speed over the specific medium.
Propagation delay is equal to d / s where d is the distance and s is the wave propagation speed. In wireless communication, s=c, i.e. the speed of light. In copper wire, the speed s generally ranges from .59c to .77c. This delay is the major obstacle in the development of high-speed computers and is called the interconnect bottleneck in IC systems.
Electronics
In electronics, digital circuits and digital electronics, the propagation delay, or gate delay, is the length of time which starts when the input to a logic gate becomes stable and valid to change, to the time that the output of that logic gate is stable and valid to change. Often on manufacturers' datasheets this refers to the time required for the output to reach 50% of its final output level from when the input changes to 50% of its final input level. This may depend on the direction of the level change, in which case separate fall and rise delays tPHL and tPLH or tf and tr are given. Reducing gate delays in digital circuits allows them to process data at a faster rate and improve overall performance. The determination of the propagation delay of a combined circuit requires identifying the longest path of propagation delays from input to output and by adding each propagation delay along this path.
The difference in propagation delays of logic elements is the major contributor to glitches in asynchronous circuits as a result of race conditions.
The principle of logical effort utilizes propagation delays to compare designs implementing the same logical statement.
Propagation delay increases with operating temperature, as resistance of conductive materials tends to increase with temperature. Marginal increases in supply voltage can increase propagation delay since the upper switching threshold voltage, VIH (often expressed as a percentage of the high-voltage supply rail), naturally increases proportionately. Increases in output load capacitance, often from placing increased fan-out loads on a wire, will also increase propagation delay. All of these factors influence each other through an RC time constant: any increase in load capacitance increases C, heat-induced resistance the R factor, and supply threshold voltage increases will affect whether more than one time constants are required to reach the threshold. If the output of a logic gate is connected to a long trace or used to drive many other gates (high fanout) the propagation delay increases substantially.
Wires have an approximate propagation delay of 1 ns for every of length. Logic gates can have propagation delays ranging from more |
https://en.wikipedia.org/wiki/AT%26T%20Computer%20Systems | AT&T Computer Systems is the generic name for American Telephone & Telegraph's unsuccessful attempt to compete in the computer business. In return for divesting the local Bell Operating Companies (Baby Bells), AT&T was allowed to have an unregulated division to sell computer hardware and software. The company made the 3B series computers.
Background
In the early 1980s, the Bell Labs Processor Division had developed several computer ranges, primarily for internal Bell System use: the 3B20D ("D" for Duplex); the commercial simplex version 3B20S, which competed with the DEC VAX; and the 3B5 and 3B15 computers for billing and telecom switching control applications, which used the world's first 32-bit microprocessor, the Bellmac 32A.
Formation post-divestiture
After divestiture of the Bell System on January 1, 1984, AT&T was required to put its computer business into a fully separated subsidiary called AT&T Information Systems (ATTIS, without the ampersand or hyphen). Software was developed in New Jersey (at Murray Hill, Summit, Holmdel, and Piscataway), and software, hardware, and system solutions were developed in Naperville and Lisle, Illinois. After a couple of years of court hearings, AT&T was allowed to pull the business back into the mainstream corporate organization, and it was renamed AT&T Data Systems Group, which had three divisions: Computer, Terminals (the Teletype Corporation of Skokie, Illinois), and Printers. AT&T Data Systems Group was announced to the public in 1991. In 1992 the Terminals division was sold to Memorex-Telex, and the Printer division, which had only bought OEM equipment from Genicom, was phased out. By the mid-1990s, this left only AT&T Computer Systems.
AT&T Computer Systems (abbreviated AT&T-CS) was the home of the UNIX System V operating system, originally developed in the Bell Labs Research Division. The important System V Interface Definition (SVID) was written, attempting to standardize the various flavors of Unix, and define the official interfaces which made up a Unix operating system. In 1988, AT&T announced its intent to buy up to a 20% stake in Sun Microsystems, a company then best known for making high-end Unix workstations. Upset at their academic-minded supplier (Bell Labs) now turned competitor (AT&T-CS), the "Gang of Seven" Unix system vendors founded the Open Software Foundation (OSF), each contributing source code from their UNIX SVR3 versions. AT&T founded the UNIX International organization as a response to the OSF. But by the late 1980s, AT&T had almost given up, sold most of its stake in Sun, spun the Unix business off as Unix System Laboratories (which was later bought by Novell), canceled its WE 32000 (aka BELLMAC) and CRISP (C Reduced Instruction Set Processor) microprocessor product lines, and just concentrated on networked server computer systems. See also Unix wars.
3B series computers
Throughout the 1980s and early 1990s, AT&T-CS produced many "firsts" in the computer world, besides |
https://en.wikipedia.org/wiki/%27Scuse%20Me%20While%20I%20Miss%20the%20Sky | "Scuse Me While I Miss the Sky" is the sixteenth episode of the fourteenth season of the American animated television series The Simpsons. It originally aired on the Fox network in the United States on March 30, 2003.
Plot
Declan Desmond, an opinionated British documentary film producer, films a documentary at Springfield Elementary School on the students' lives. He interviews Bart as he gets hit by a ball of dirt thrown by Nelson and breaks down in tears. Later, Declan belittles Lisa as she talks about the multiplicity of her interests, insinuating that she could neither be happy nor successful juggling too many hobbies or passions. Hurt by his criticism, Lisa resolves to find a single passion to which she can devote herself; astronomy. She convinces Homer to buy her a telescope, but discovers that light pollution from the city is blocking her view of the sky. After a discussion with Professor Frink, Lisa starts a petition to reduce the city's light pollution. After gaining enough signatures, Mayor Quimby agrees to turn off the streetlights, leading to a clear view of the stars, at which many people from Springfield marvel.
Meanwhile, Bart is looking for a way to regain his popularity after being humiliated. After seeing Nelson parading around with stolen car hood ornaments, he decides to steal one off Fat Tony's car. Milhouse and Bart are foiled on their first attempt because Quimby is pressured to switch the lights back on due to rising crime. Yet the light level is set too high which means that no one can sleep so Lisa, still wanting to see the light pollution reduced, and Bart, still wanting to steal Fat Tony's hood ornament, take a now sleep-deprived Homer to the power plant and overload the generators causing a power outage, which ends the light pollution, but before the angry citizens can attack, Lisa points out a meteor shower and the town looks on in wonderment while Bart sneaks off and steals Fat Tony's hood ornament, with Don McLean's song "Vincent" playing in the background.
The show ends with a montage of clips from Declan's documentary.
Production
By this time in the show's history, there had been an "ever-present fear that as the show ages it risks 'jumping the shark. The Simpsons writers satirized the term's namesake (an episode of Happy Days in which Fonzie jumps over a shark on water skis) in the episode, which has a couch gag where the Simpson family jump over a tank full of sharks in a similar fashion (the gag had previously been used in the episode "How I Spent My Strummer Vacation"). Executive producer Al Jean said, "We figured that if we said it first, then they couldn't say it". The writers included a line where Carl Carlson mentions his Icelandic heritage, as well as the fact that Homer, Moe and Lenny show absolutely no interest in what he's saying. This would later become both the basis and an explicit reference point in the episode The Saga of Carl, where Carl rips off the winnings from a lottery ticket he jointly |
https://en.wikipedia.org/wiki/Windows%20Mobile | Windows Mobile was a family of mobile operating systems developed by Microsoft for smartphones and personal digital assistants.
Its origin dated back to Windows CE in 1996, though Windows Mobile itself first appeared in 2000 as Pocket PC 2000 which ran on Pocket PC PDAs. It was renamed "Windows Mobile" in 2003, at which point it came in several versions (similar to the desktop versions of Windows) and was aimed at business and enterprise consumers. When initially released in the mid-2000s, it was to be the portable equivalent of what Windows desktop OS was: a major force in the then-emerging mobile/portable areas.
Following the rise of newer smartphone OSs (iOS and Android) Windows Mobile never equalled the success and faded rapidly in the following years. By February 2010, Microsoft announced the more modern and consumer-focused Windows Phone to supersede Windows Mobile. As a result, Windows Mobile has been deprecated since existing devices and software are incompatible with Windows Phone. The last version of Windows Mobile, released after the announcement of Windows Phone, was 6.5.5. After this, Microsoft ceased development on Windows Mobile in order to concentrate on Windows Phone.
Microsoft released a similarly-named Windows 10 Mobile in 2015 which was part of the Windows Phone series, and it is unrelated to the former Windows Mobile operating systems.
Features
Most versions of Windows Mobile have a standard set of features, such as multitasking and the ability to navigate a file system similar to that of Windows 9x and Windows NT, including support for many of the same file types. Similarly to its desktop counterpart, it comes bundled with a set of applications that perform basic tasks. Internet Explorer Mobile is the default web browser, and Windows Media Player is the default media player used for playing digital media. The mobile version of Microsoft Office is the default office suite.
Internet Connection Sharing, supported on compatible devices, allows the phone to share its Internet connection with computers via USB and Bluetooth. Windows Mobile supports virtual private networking over PPTP protocol. Most devices with mobile connectivity also have a Radio Interface Layer. The Radio Interface Layer provides the system interface between the Cell Core layer within the Windows Mobile OS and the radio protocol stack used by the wireless modem hardware. This allows OEMs to integrate a variety of modems into their equipment.
The user interface changed dramatically between versions, only retaining similar functionality. The Today Screen, later called the Home Screen, shows the current date, owner information, upcoming appointments, e-mails, and tasks. The taskbar displays the current time as well as the volume level. Devices with a cellular radio also show the signal strength on said taskbar.
History
Windows Mobile is based on the Windows CE kernel and first appeared as the Pocket PC 2000 operating system. It includes a suite of basic a |
https://en.wikipedia.org/wiki/Diodes%20%28disambiguation%29 | Diode is a device that is a two-terminal electronic component that conducts electric current in only one direction.
Diode or Diodes may also refer to:
Data diode, a type of unidirectional computer network
Diodes Incorporated, a global manufacturer and supplier of application specific standard products within the broad discrete, logic and analog semiconductor markets
The Diodes, a Canadian punk/new wave band
See also
DIOD, ICAO code for Odienné Airport in Côte d'Ivoire |
https://en.wikipedia.org/wiki/List%20of%20sail%20frigates%20of%20the%20Ottoman%20Empire | This is a list of Ottoman Empire and allied sail and steam frigates of the period 1650-1867:
The guns listed are sometimes approximate as it's difficult to get accurate data for early Ottoman warships.
Algiers Eyalet
? 37 - Spanish Nuestra Señora de Trapana
El-Merikane 36 (1797, ex-Crescent) was built at Portsmouth, NH, as tribute for the Dey of Algiers and launched from the U.S. Navy Yard on 29 June 1797; stricken 1805
Mashouda 46 (1802) Stephen Decatur, Jr, of the U.S. Navy, captured her in 1815; the U.S. returned her. She was sunk at Algiers 1816
El-Portugaziye 36 (ex-Portuguese "N.a S.a do Bom Despacho, Cisne" (1779-1802; 36 guns), captured 1802 in the Mediterranean and sunk at Algiers during the Bombardment of Algiers (1816)
Grande frigate 50 (1805) - Sunk at Algiers 1816
El-Tunisiye 44 (1804, ex-Tunisian, obtained 1811) - Sunk at Algiers 1816
El-Jazairiye 38 (1812) - ?
? 32 (ex-Moroccan El-Mansouriye, obtained 1817) - Storm 1822
Rehber Iskender 40 (1818) - Egyptian 1830, stricken before 1836
Meftah el-Jihad 46 (~1820?) - Egyptian 1830, stricken after 1838
Bel Houaz/El-Touloniye (1822) - French 1830, BU 1830/31
Tripolitania Eyalet
? 32 (ex-French, captured 1668)
Looking Glass (34) - Burnt 1676
Sancta Chiara (24) - Burnt 1676
Philadelphia (36) – ex-, captured 1803; a U.S. naval boarding party under Lieutenant Stephen Decatur, Jr. set fire to her in 1804, destroying her
Ottoman Empire
17th century
? 34 - Captured by Venice 1660
? 25 - Captured by Venice 1660
? 30 - Captured by Venice 1662
? 24 - Captured by Venice 1662
? 36 (ex-French, captured 1668)
? 30 (ex-French, captured 1668)
18th century
(6 frigates) - Burnt at the Battle of Chesma 1770
? - Burnt 1772
? 30 - Burnt 1772
(7 frigates) 30 - Burnt 1772
? 30 - Sunk 1772
Napoleonic era
? 28 (ex-French Brune, captured 1799)
? 40 (ex-French Justice, captured 1801)
? 40 - Aground and sunk 1807
? 36 - Aground and sunk 1807
? 36 - Aground and sunk 1807
? 32 - Aground and sunk 1807
Uri Bahar (British Royal Navy (RN) version of the name; 40 guns) - The RN took possession of her on 21 March 1807 during the Alexandria expedition of 1807. Uri Bahar had twenty-eight 18-pounder guns on her upper deck, and six 8-pounder guns and six 18-pounder carronades on her QD and Fc. There is no record that the RN evere commissioned her. It disposed of her i in 1809.
Uri Nasard (RN version of the name; 34 guns) - The RN took possession of her on 21 March 1807 during the Alexandria expedition of 1807. The Royal Navy commissioned Uri Nasard circa January 1808. Captain George Hony (or Honey) took command of Uri Nasard. She was armed with twenty-six 12-pounder guns on her upper deck, and eight 6-pounders (QD/Fc). The RN disposed of her in 1809. * * Meskeni-ghazi 50 (A)
Bedr-i Zafar 50 (A)
Fakih-i Zafar 50 (A)
Nessim 50 - Aground and burnt 1807
Iskenderiye 44 (A)
Badere Zafer/Bedr-i zafar 52 - captured her on 5/6 July 1808. In 1847 the Admiralty issued the clasp "Seahor |
https://en.wikipedia.org/wiki/Balaji%20Telefilms | Balaji Telefilms is an Indian company that produces Indian soap operas, reality TV, comedy, game shows, entertainment, and factual programming in several Indian languages. Balaji Telefilms is promoted by Ekta Kapoor and Shobha Kapoor and is a public company listed at Bombay Stock Exchange and National Stock Exchange of India.
In the 2000s the company went on to produce some historic blockbusters which include, Kyunki Saas Bhi Kabhi Bahu Thi, Kahaani Ghar Ghar Kii, Kaahin Kissii Roz, Kasautii Zindagii Kay, Kahiin to Hoga, Kkusum and Kasamh Se amongst several others.
In the 2010s the company went on to produce several hugely successful drama series which includes Pavitra Rishta, Tere Liye, Pyaar Kii Ye Ek Kahaani, Bade Achhe Lagte Hain, Jodha Akbar, Yeh Hai Mohabbatein, Kumkum Bhagya, Meri Aashiqui Tum Se Hi, Kasam Tere Pyaar Ki, Kundali Bhagya, Yeh Hai Chahatein and Bhagya Lakshmi.
Since 2015, the company introduced several seasonal format weekend drama thriller series which went out to be highly rated series amongst which includes Naagin (TV series) (running currently in its 6th season), Kavach (TV series) (2 seasons), Brahmarakshas (2 seasons), Haiwaan : The Monster, Daayan (TV series) and Qayamat Ki Raat amongst several others.
In 2017, the company launched its biography, Kingdom of the Soap Queen: The Story of Balaji Telefilms.
History
The company is registered as 'Balaji Telefilms Private Limited' on 11 November 1994 in Mumbai, India, with the objective of creating serials and other entertainment content by Ekta Kapoor and Shobha Kapoor. Balaji has specialized in formatted programming that can be adapted for languages around the nation as well as abroad. One notable success Kyunki Saas Bhi Kabhi Bahu Thi. Other examples include Kahaani Ghar Ghar Kii, Kaahin Kissii Roz, Kahiin to Hoga,Kasautii Zindagii Kay, Kkusum, Kutumb, Kohi Apna Sa, Kasamh Se, Pavitra Rishta, Parichay, Kya Hua Tera Vaada, Jodha Akbar, Bade Achhe Lagte Hain, Yeh Hai Mohabbatein, Naagin, Kumkum Bhagya and Kundali Bhagya The later five are dubbed and re-produced in several languages across India and Asia. In recent years the company has been expanding its reality show output with shows such as titles such as Box Cricket League on Sony TV.
Balaji was incorporated as a public limited company on 29 February 2000, and its name was changed to 'Balaji Telefilms Ltd' on 19 April 2000. The company made public issue of 28,00,000 equity shares of 10 each at a premium of 120 aggregating 36.40 crore. The issue included a book-built portion of 25,20,000 equity shares and a fixed price portion of 2,80,000 equity shares. In the same year, Nine Network Entertainment India Pvt. Ltd, a wholly-owned subsidiary of Nine Broadcasting India Pvt. Ltd., merged with Balaji Telefilms Ltd. During 2000–04 the stock market capitalization grew sixteenfold to 571 crores when Star India acquired a 26% stake in the business.
Balaji Telefilms started a media training institute in 2010. Known as ICE In |
https://en.wikipedia.org/wiki/Bill%20Roscoe | Andrew William Roscoe is a Scottish computer scientist. He was Head of the Department of Computer Science, University of Oxford from 2003 to 2014, and is a Professor of Computer Science. He is also a Fellow of University College, Oxford.
Education and career
Roscoe was born in Dundee, Scotland. He studied for a degree in mathematics at University College, Oxford, from 1975 to 1978, graduating with the top mark for his year in the university. He went on to work at the Computing Laboratory and received his DPhil in 1982. He was appointed Tutorial Fellow at University College in 1983 and served as Senior Tutor from 1993 to 1997. He was head of the Department of Computer Science 2003-08 and 2009–14.
Research
Professor Roscoe works in the area of concurrency theory, in particular the semantic underpinning of Communicating Sequential Processes (CSP) and the associated occam programming language with Sir Tony Hoare. He co-founded Formal Systems (Europe) Limited and worked on the algorithms for the Failures-Divergence Refinement (FDR) tool.
References
External links
Bill Roscoe home page
Living people
People from Dundee
People educated at the High School of Dundee
Alumni of University College, Oxford
Scottish computer scientists
Members of the Department of Computer Science, University of Oxford
Formal methods people
Fellows of University College, Oxford
Scottish scholars and academics
1956 births |
https://en.wikipedia.org/wiki/List%20of%20network%20protocols%20%28OSI%20model%29 | This article lists protocols, categorized by the nearest layer in the Open Systems Interconnection model. This list is not exclusive to only the OSI protocol family. Many of these protocols are originally based on the Internet Protocol Suite (TCP/IP) and other models and they often do not fit neatly into OSI layers.
Layer 1 (physical layer)
Telephone network modems
IrDA physical layer
USB physical layer
EIA RS-232, EIA-422, EIA-423, RS-449, RS-485
Ethernet physical layer 10BASE-T, 10BASE2, 10BASE5, 100BASE-TX, 100BASE-FX, 1000BASE-T, 1000BASE-SX and other varieties
Varieties of 802.11 Wi-Fi physical layers
DSL
ISDN
T1 and other T-carrier links, and E1 and other E-carrier links
ITU Recommendations: see ITU-T
IEEE 1394 interfaces
TransferJet
Etherloop
ARINC 818 Avionics Digital Video Bus
G.hn/G.9960 physical layer
CAN bus (controller area network) physical layer
Mobile Industry Processor Interface physical layer
Infrared
Frame Relay
FO Fiber optics
X.25
Layer 2 (data link layer)
ARCnet Attached Resource Computer NETwork
ARP Address Resolution Protocol
ATM Asynchronous Transfer Mode
CHAP Challenge Handshake Authentication Protocol
CDP Cisco Discovery Protocol
DCAP Data Link Switching Client Access Protocol
Distributed Multi-Link Trunking
Distributed Split Multi-Link Trunking
DTP Dynamic Trunking Protocol
Econet
Ethernet
FDDI Fiber Distributed Data Interface
Frame Relay
ITU-T G.hn
HDLC High-Level Data Link Control
IEEE 802.11 WiFi
IEEE 802.16 WiMAX
LACP Link Aggregation Control Protocol
LattisNet
LocalTalk
L2F Layer 2 Forwarding Protocol
L2TP Layer 2 Tunneling Protocol
LLDP Link Layer Discovery Protocol
LLDP-MED Link Layer Discovery Protocol - Media Endpoint Discovery
MAC Media Access Control
Q.710 Simplified Message Transfer Part
Multi-link trunking Protocol
NDP Neighbor Discovery Protocol
PAgP - Cisco Systems proprietary link aggregation protocol
PPP Point-to-Point Protocol
PPTP Point-to-Point Tunneling Protocol
PAP Password Authentication Protocol
RPR IEEE 802.17 Resilient Packet Ring
SLIP Serial Line Internet Protocol (obsolete)
StarLAN
Space Data Link Protocol, one of the norms for Space Data Link from the Consultative Committee for Space Data Systems
STP Spanning Tree Protocol
Split multi-link trunking Protocol
Token Ring a protocol developed by IBM; the name can also be used to describe the token passing ring logical topology that it popularized.
Virtual Extended Network (VEN) a protocol developed by iQuila.
VTP VLAN Trunking Protocol
VLAN Virtual Local Area Network
Network Topology
Asynchronous Transfer Mode (ATM)
IS-IS, Intermediate System - Intermediate System (OSI)
SPB Shortest Path Bridging
MTP Message Transfer Part
NSP Network Service Part
TRILL (TRansparent Interconnection of Lots of Links)
Layer 2.5
ARP Address Resolution Protocol
MPLS Multiprotocol Label Switching
PPPoE Point-to-Point Protocol over Ethernet
TIPC Transparent Inter-process Communication
|
https://en.wikipedia.org/wiki/System%20Idle%20Process | In Windows NT operating systems, the System Idle Process contains one or more kernel threads which run when no other runnable thread can be scheduled on a CPU. In a multiprocessor system, there is one idle thread associated with each CPU core. For a system with hyperthreading enabled, there is an idle thread for each logical processor.
The primary purpose of the idle process and its threads is to eliminate what would otherwise be a special case in the scheduler. Without the idle threads, there could be cases when no threads were runnable (or "Ready" in terms of Windows scheduling states). Since the idle threads are always in a Ready state (if not already Running), this can never happen. Thus whenever the scheduler is called due to the current thread leaving its CPU, another thread can always be found to run on that CPU, even if it is only the CPU's idle thread. The CPU time attributed to the idle process is therefore indicative of the amount of CPU time that is not needed or wanted by any other threads in the system.
The scheduler treats the idle threads as special cases in terms of thread scheduling priority. The idle threads are scheduled as if they each had a priority lower than can be set for any ordinary thread.
Because of the idle process's function, its CPU time measurement (visible through, for example, Windows Task Manager) may make it appear to users that the idle process is monopolizing the CPU. However, the idle process does not use up computer resources (even when stated to be running at a high percent). Its CPU time "usage" is a measure of how much CPU time is not being used by other threads.
In Windows 2000 and later the threads in the System Idle Process are also used to implement CPU power saving. The exact power saving scheme depends on the operating system version and on the hardware and firmware capabilities of the system in question. For instance, on x86 processors under Windows 2000, the idle thread will run a loop of halt instructions, which causes the CPU to turn off many internal components until an interrupt request arrives. Later versions of Windows implement more complex CPU power saving methods. On these systems the idle thread will call routines in the Hardware Abstraction Layer to reduce CPU clock speed or to implement other power-saving mechanisms.
There are more detailed sources of such information available through Windows' performance monitoring system (accessible with the perfmon program), which includes more finely grained categorization of CPU usage. A limited subset of the CPU time categorization is also accessible through the Task Manager, which can display CPU usage by CPU, and categorized by time spent in user vs. kernel code.
See also
List of Microsoft Windows components
Idle (CPU)
Microsoft Windows
HLT (x86 instruction)
Process Explorer
References
Windows NT architecture |
https://en.wikipedia.org/wiki/Steering%20law | The steering law in human–computer interaction and ergonomics is a predictive model of human movement that describes the time required to navigate, or steer, through a 2-dimensional tunnel. The tunnel can be thought of as a path or trajectory on a plane that has an associated thickness or width, where the width can vary along the tunnel. The goal of a steering task is to navigate from one end of the tunnel to the other as quickly as possible, without touching the boundaries of the tunnel. A real-world example that approximates this task is driving a car down a road that may have twists and turns, where the car must navigate the road as quickly as possible without touching the sides of the road. The steering law predicts both the instantaneous speed at which we may navigate the tunnel, and the total time required to navigate the entire tunnel.
The steering law has been independently discovered and studied three times (Rashevsky, 1959; Drury, 1971; Accot and Zhai, 1997). Its most recent discovery has been within the human–computer interaction community, which has resulted in the most general mathematical formulation of the law.
The steering law in human–computer interaction
Within human–computer interaction, the law was rediscovered by Johnny Accot and Shumin Zhai, who mathematically derived it in a novel way from Fitts's law using integral calculus, experimentally verified it for a class of tasks, and developed the most general mathematical statement of it. Some researchers within this community have sometimes referred to the law as the Accot–Zhai steering law or Accot's law (Accot is pronounced ah-cot in English and ah-koh in French). In this context, the steering law is a predictive model of human movement, concerning the speed and total time with which a user may steer a pointing device (such as a mouse or stylus) through a 2D tunnel presented on a screen (i.e. with a bird's eye view of the tunnel), where the user must travel from one end of the path to the other as quickly as possible, while staying within the confines of the path. One potential practical application of this law is in modelling a user's performance in navigating a hierarchical cascading menu.
Many researchers in human–computer interaction, including Accot himself, find it surprising or even amazing that the steering law model predicts performance as well as it does, given the almost purely mathematical way in which it was derived. Some consider this a testament to the robustness of Fitts's law.
In its general form, the steering law can be expressed as
where T is the average time to navigate through the path, C is the path parameterized by s, W(s) is the width of the path at s, and a and b are experimentally fitted constants. In general, the path may have a complicated curvilinear shape (such as a spiral) with variable thickness W(s).
Simpler paths allow for mathematical simplifications of the general form of the law. For example, if the path is a straight tun |
https://en.wikipedia.org/wiki/Goanet | Goanet is a mailing list related to the state of Goa, located on the western coast of India. It was started in 1994 and, in 2015, celebrated 21 years of operation. Primarily an email-based network (with smaller operations on Facebook and the web), it has been considered influential in connecting Goans across the globe, especially in the diaspora.
History
It was started in 1994 by a (then) 17-year-old student Herman Carneiro, and since then has grown into being the most influential electronic mailing list linked to Goa.
Carneiro studied Chemical Engineering (Northeastern University in Boston), and has an M.Sc. in Control of Infectious Diseases from the London School of Hygiene & Tropical Medicine. He was at Imperial College, London. He has worked in biomedical research at LeukoSite, Inc. and then at PerSeptive Biosystems, process design at Pharm-Eco laboratories, and capital engineering projects at Kodak. Carneiro was at Whitehead Institute, MIT, where he was a team manager for the Human Genome Project. Later, as part of his Masters-degree program, he designed and carried out a research project for the World Health Organization in Cambodia on sustainable interventions to prevent dengue fever outbreaks in the region. He has also conducted research in new drug discovery at Pfizer, Inc., and has worked for the Massachusetts Department of Public Health as an epidemiologist. Herman has also been keen sportsman and represented Kenya in the East and Central African Junior Tennis Championships in 1992 and 1993.
Launch
Goanet was started on 25 August 1994 with approximately 20 members. The mailing list was run from Carneiro's university e-mail account. According to Carneiro: "Netters were asked to put a * in their subject line to indicate a message to be posted on the list as opposed to private e-mail. The list grew slowly but steadily. Pretty soon we had 100 members and by that time I could not cope forwarding all the e-mail. So, I requested that a mailing list program be set up for Goanet on my university's server. I was successful and Goanet found its home for next 4 years."
On the Goacom server
Goanet had real-time archives on the web and the membership continued to grow steadily. In 1998, Goanet moved to the Goacom server. This allowed Goanet to expand even further. Carneiro has argued that Goanet (also called Goa-Net and GoaNet earlier) has been "more than a mailing list from the start -- it's been a virtual community."
Run by volunteers
Volunteers of Goanet have included Bosco D'Mello (Canada), Eddie Fernandes (UK), Vivian Coelho (USA), Eustaquio Santimano (Denmark), Sunila Muzawar (UAE), Frederick Menezes (Goa), among others. Among the first members were Jacqueline Carneiro (USA), Jeannette Carneiro (USA), Peter D'Souza (USA), Maria D'Souza (USA), Ulysses and Kendy Menezes (Kuwait), Kevin Coutinho, Craig Rodrigues (Canada), Marlon Menezes (US), Brendan Fernandes (Australia), Joanne Fernandes (Australia), Tashlyn Gonzalves (Australia), and |
https://en.wikipedia.org/wiki/Lexicon%20%28game%29 | Lexicon is a computer-assisted role-playing game invented by Neel Krishnaswami and popularised by the indie role-playing game community. As originally proposed, it is played online using wiki software. Players assume the role of scholars who write the history and background of a particular fictitious time, setting, or incident. As the game goes on, the players collaboratively create an elaborately interwoven account.
Each game is a series of 26 turns, keyed to the letters of the alphabet from A to Z. On the first turn, each player must write an Encyclopedia-style entry beginning with the letter A, citing and linking to two entries that are not yet written. These are called "undefined" entries. Undefined entries must begin with a letter later in the alphabet.
The 25 subsequent turns proceed consecutively through the letters of the alphabet, one letter per turn. In a turn, each player writes one entry that begins with the turn's specified letter. If one or more undefined entries are available that begin with the letter, a player must choose and write an undefined entry before any new entries can be created under that letter. A new entry must create and link to two undefined entries, and must also link to an entry written on a previous turn. Near the endgame, when sufficient undefined entries exist to occupy all players for the remainder of the game, no new undefined entries may be created.
Many variants exist, such as covering two or three letters per turn, or starting each player on a different letter. Some games permit other players to post comments or expansions of earlier entries. The optional "Rule of X" treats X (or any other appropriate letter) as a wild card; entries for the X turn may begin with any letter. "Telephone pad" is a shorter variant with 8 turns (corresponding to the letters on a telephone keypad) instead of 26 turns (one per letter of the alphabet).
See also
Epic Legends Of The Hierarchs: The Elemenstor Saga
References
External links
Lexicon: An RPG — the original idea for Lexicon.
Lexicon Rules and Variants — A collection and clarification of the original rules, combined with a compilation of almost every variant.
An (old) list of Lexicon games
The New Metamorphoses: A Lexicon
Collaborative fiction
Indie role-playing games
Universal role-playing games
Role-playing games introduced in 2003 |
https://en.wikipedia.org/wiki/Sara%20Pezzini | Sara Magdalene Pezzini is a fictional superheroine starring in the Witchblade series. Sara also appeared in a Turner Network Television live-action feature film and TV series of the same name and she was portrayed by Yancy Butler. She is an NYPD homicide detective whose life changed when she came into contact with a powerful ancient weapon known as the Witchblade, which bestows its wielder with supernatural powers.
Fictional biography
Sara Magdalene Pezzini was born November 18, 1970, and is of Italian descent. Her major enemies are Kenneth Irons and Ian Nottingham.
As one of the current hosts of the Witchblade, Sara has been granted many unique abilities, including the power and ability to heal herself, to create (often very revealing) armor over her skin (as the Witchblade tends to rip away all of her clothes), to shoot energy blasts, to extend razor sharp tendrils and even winged flight. She has yet to explore the full limits of the Witchblade, and thus does not know what other mystical magical abilities it possesses. When not overly active, the Witchblade can assume the form of a bracelet, allowing her to wear the entity without drawing attention. The Witchblade is a male entity of both light and dark which represents both order and chaos. It is the offspring of the Angelus and the Darkness; as such, Sara does not have complete control over its actions and reactions.
Sara first appeared in Cyblade/Shi: The Battle for Independents #1 (January 1995). She had wanted nothing more in her life than to be a good cop. As a homicide detective in New York City, life was challenging enough, but for Sara, those were simpler times. While on an undercover case at the Rialto Theater, both she and her partner, Michael Yee (named Danny Woo in the TV series), were mortally wounded. At this same theater was a man named Kenneth Irons, who had brought a gauntlet known as the Witchblade. Irons was in search of the secrets to unlocking his full power and ability.
While Sara lay dying, the Witchblade made his choice to include her in the long line of women that he has shared his power with. The entity healed Sara's wounds and allowed her to survive the resulting confrontation. Since then, she has seen many things she never knew existed, fought creatures that have no place on Earth, and longed for the days of a typical NYPD detective. But she continues her struggle with the Witchblade, believing that she can do more good with the entity than without. So the battle for control continues, as Sara learns more about this entity and struggles to stem his violent nature.
Some of Sara's allies include the Magdalena, Lara Croft, Vampirella, and Jackie Estacado. Two crossovers pitted her against Wolverine and the titular creatures from the Alien and Predator franchises. In the comics recently, Sara has been through a grueling ordeal fighting off a giant demon (a false "god" summoned by a group of priests), in the midst of which her partner, Jake McCarthy, was left wounde |
https://en.wikipedia.org/wiki/Semantic%20grid | A semantic grid is an approach to grid computing in which information, computing resources and services are described using the semantic data model. In this model, the data and metadata are expressed through facts (small sentences), becoming directly understandable for humans. This makes it easier for resources to be discovered and combined automatically to create virtual organizations (VOs). The descriptions constitute metadata and are typically represented using the technologies of the Semantic Web, such as the Resource Description Framework (RDF).
Like the Semantic Web, the semantic grid can be defined as
"an extension of the current grid in which information and services are given well-defined meaning, better enabling computers and people to work in cooperation."
This notion of the semantic grid was first articulated in the context of e-Science, observing that such an approach is necessary to achieve a high degree of easy-to-use and seamless automation, enabling flexible collaborations and computations on a global scale.
The use of semantic web and other knowledge technologies in grid applications are sometimes described as the knowledge grid.
Semantic grid extends this by also applying these technologies within the grid middleware.
Some semantic grid activities are coordinated through the Semantic Grid Research Group of the Global Grid Forum.
Notes
See also
Business Intelligence 2.0
LSID
Semantic Web Rule Language
Semantic Grid System - A CSS grid framework .
External links
ONTOGRID: EU-funded research project for enabling semantic grid applications
Semantic Grid Dagstuhl Seminar
A semantic grid oriented to e-tourism
Grid computing
Semantic Web |
https://en.wikipedia.org/wiki/West%20Virginia%20Public%20Broadcasting | West Virginia Public Broadcasting (WVPB) is the public television and radio state network serving the U.S. state of West Virginia. It is owned by the West Virginia Public Broadcasting Authority, an agency of the state government that holds the licenses for all Public Broadcasting Service (PBS) and National Public Radio (NPR) member stations licensed in West Virginia. It is headquartered in Charleston with studios in Morgantown and Beckley.
On January 1, 2015, West Virginia PBS and West Virginia Public Radio merged their brands, branding exclusively as "West Virginia Public Broadcasting" across radio and television.
Television
The first public television station in West Virginia signed on July 14, 1969 under the callsign WMUL-TV, broadcasting from Marshall University in Huntington. In 1981, WMUL-TV changed its call letters to WPBY-TV; two years later, the public station at West Virginia University in Morgantown, WWVU-TV, was renamed WNPB-TV. WPBY-TV and WNPB-TV received their new call letters to underline that the operations were managed by the state educational broadcasting authority, and not the university system. In 1992, the state completed a microwave link that permitted it to convert WNPB and the state's third PBS station, WSWP-TV in Grandview to become repeaters of WPBY-TV in Huntington and form a state network. On January 5, 2015, WPBY-TV changed its call letters to WVPB-TV as part of an effort to unify all of West Virginia Public Broadcasting's services under a single brand; the television network had previously been branded as "West Virginia PBS," a name that was phased out starting on January 1, 2015.
The state network has a total of five low-powered repeaters serving other areas out of the range of the three full-powered stations, most notably Wheeling and Parkersburg. Three directly repeat WNPB, one repeats WVPB and one repeats WSWP.
In the past the network showed some Marshall University and West Virginia University sports content, but has abandoned this practice due to Conference USA/Big 12 exclusivity agreements with commercial and cable outlets.
The current local content consists of a daily recap of the state legislative session, shows produced by the West Virginia University medical school, and student produced news from campus weekly products from Marshall University and West Virginia State University. It also broadcasts original documentaries on West Virginia history and culture, as well as live musical performances of Mountain Stage and the West Virginia Music Hall of Fame.
The combined footprint of WVPB's television network covers almost all of West Virginia, as well as portions of Kentucky, Maryland, Ohio, Pennsylvania and Virginia. It is carried on the basic tier of all cable systems in West Virginia.
TV stations
Notes:
Translators
W34FE-D (previously W51EG-D) has been silent since February 2020, when T-Mobile began using its spectrum for wireless services; it relocated to channel 34 effective October 6, 2022.
On |
https://en.wikipedia.org/wiki/Yonam%20Institute%20of%20Technology | Yonam Institute of Technology, also Yonam Engineering College, is a private technical college located in Jinju, South Gyeongsang province, South Korea. It offers courses in computer electronics, hardware design, industrial information design, and related fields.
Sister colleges
Within South Korea, the Yonam Institute maintains sisterhood relationships with Cheonan Yonam College, which was also established by the Yonam Educational Foundation. Internationally, it has relations with seven schools in seven countries: Canberra Institute of Technology in Australia, Changchun Institute of Technology in China, the Fachhochschule Augsburg in Germany, Nippon Bunri University in Japan, Northumbria University in the United Kingdom, St. John's and St. Mary's Institute of Technology in Taiwan, and Laguardia Community College in the United States.
See also
List of colleges and universities in South Korea
Education in South Korea
External links
Official school website, in Korean
Universities and colleges in South Gyeongsang Province |
https://en.wikipedia.org/wiki/Yong-in%20Songdam%20College | Yong-in Songdam College is a private technical college in Yongin City, Gyeonggi province, South Korea. It employs about 100 instructors. Most courses of study are related to computers or digital technology.
History
The college was founded in 1995. Its president was Choi Yeong-cheol (최영철), who continues to serve in that capacity.
Sister schools
Yong-in Songdam maintains international sisterhood relations with three American institutions (Madonna University, the Community Colleges for International Development, Kapiolani Community College), three Russian institutions (the State University of Management, Institute of World Economy and International Relations, Moscow State University of Industrial and Applied Arts), and one Canadian institution (St. Clair College).
See also
List of colleges and universities in South Korea
Education in South Korea
External links
Official school website, in Korean
Official school website, in English
Universities and colleges in Gyeonggi Province
Yongin
Educational institutions established in 1995
1995 establishments in South Korea |
https://en.wikipedia.org/wiki/Click%21%20Network | Click! Network is an open access broadband cable system owned by Tacoma Power, a part of Tacoma Public Utilities in Tacoma, Washington. It provides cable television and Internet connectivity for residents and businesses in Tacoma, University Place, Fircrest, Lakewood and Fife.
Back in the late 1990s there was talk of deregulation of the power industry, much like the banking and airlines industries flourished shortly after their deregulations. Utility companies are traditionally a very conservative business with relatively little change or innovation since the beginning of the century. Tacoma Power's management team had the foresight to look into the future and predict some of the results that would come from deregulation of power companies. Deregulation would mean that power companies would no longer have their protected monopolies and they would be forced into more of a delivery business since they would still own the wires. To strengthen Tacoma Power's position in this type of a business environment Steven Klein, then Superintendent, suggested that they invest in an innovation in their power delivery system, i.e. the "SmartMeter".
When Tacoma Power started drawing up plans to develop a 100 million dollar fiber-optic network to link its power substations, and saw potential value for its customers at little additional cost to the utility to expanding the network to offer cable television, high-speed Internet and high-speed data services to the community. After originally approaching TCI Cable to be the cable television service provider and being turned down, Tacoma Power decided to create their own cable company. These services compete with the existing Comcast service providers in the area. Commercial high-speed data services began in 1997, cable TV in 1998, and high-speed Internet services over cable modem in 1999. Click! is one of the largest municipal telecommunications systems in the United States.
In 2000, the State of Washington passed RCW 54.16.330, effectively preventing further research and development of Click! Network until its repeal in 2021 during the COVID-19 Pandemic, a period of over 20 years.
In 2020, Click! Network was sold by the Tacoma Public Utilities to Rainier Connect. The utilities would continue to own the lines, but Rainier Connect would run all operations and provide maintenance. The contract was for 20 years with two extensions. The transfer of day to day operations was highly controversial amongst the Tacoma population, but was ultimately supported due to the restrictions imposed by the State of Washington nearly 20 years prior. Controversies arose again after the state level restrictions were repealed in 2021.
After six months, Rainier Connect started migrating legacy set top box TV customers to an IPTV system. This move was also controversial among the Tacoma population, much of whom had limited technical skills and would have significant trouble adapting to an IPTV system.
Click! Network remains a highly |
https://en.wikipedia.org/wiki/The%20Story%20of%20Mel | The Story of Mel is an archetypical piece of computer programming folklore. Its subject, Melvin Kaye, is an exemplary "Real Programmer" whose subtle techniques fascinate his colleagues.
Story
Ed Nather's The Story of Mel details the extraordinary programming prowess of a former colleague of his, "Mel", at Royal McBee Computer Corporation. Although originally written in prose, Nather's story was modified by someone into a "free verse" form which has become widespread.
Little is known about Mel Kaye, beyond the fact that he was credited with doing the "bulk of the programming" on the 1959 ACT-1 compiler for the Royal McBee LGP-30 computer. In Nather's story, Kaye is portrayed as being prone to avoiding optimizing assemblers in favor of crafting code to take advantage of hardware quirks, for example taking advantage of the rotation of the LGP-30's drum memory to avoid writing delay loops into the code.
The story, as written by Nather, involved Kaye's work on rewriting a blackjack program from the LGP-30 to a newer Royal McBee system, the RPC-4000; company sales executives had requested to modify the program so that they could flip a front panel switch and cause the program to lose (and the user to win). Kaye reluctantly acceded to the request, but to his own delight, he got the test wrong, and the switch would instead cause the program to win every time (and the user to lose).
Subsequent to Kaye's departure, Nather was asked to fix the bug. While examining the code, he was puzzled to discover that it contained what appeared to be an infinite loop, yet control did not remain inside the loop. Eventually he realized that Kaye was using self-modifying code to process elements of an array, and had coded the loop in such a way as to take advantage of an Integer overflow. Adding 1 to the address field of an instruction that referred to address x normally just changed the address to x+1. But when x was already the highest possible address, not only did the address wrap around to 0, but a 1 was carried into the bits from which the opcode would be read—in this case changing the opcode to "jump to" so that the full instruction became "jump to address 0". This impressed Nather so much that, out of respect, he gave up the task and reported that he could not find the bug.
The early computers of IAS machine design had no index register. Using self-modifying code was necessary for array operations. The LGP-30 instruction did "replace the contents of the address portion of the word in memory location 2000 with the contents of the address portion of the word in the accumulator" to ease writing self-modifying code.
History
The essay was originally published in the Usenet news group "net.followup" on May 21, 1983, by utastro!nather (the UUCP email address of Ed Nather at the time).
The Royal McBee computers were developed and manufactured by Librascope, and the documentation written for the blackjack program was written by Mel Kaye of Librascope Inc. The |
https://en.wikipedia.org/wiki/Jon%20Kleinberg | Jon Michael Kleinberg (born 1971) is an American computer scientist and the Tisch University Professor of Computer Science and Information Science at Cornell University known for his work in algorithms and networks. He is a recipient of the Nevanlinna Prize by the International Mathematical Union.
Early life and education
Jon Kleinberg was born in 1971 in Boston, Massachusetts to a mathematics professor father and a computer consultant mother. He received a Bachelor of Science degree in computer science from Cornell University in 1993 and a PhD from Massachusetts Institute of Technology in 1996. He is the older brother of fellow Cornell computer scientist Robert Kleinberg.
Career
Since 1996 Kleinberg has been a professor in the Department of Computer Science at Cornell, as well as a visiting scientist at IBM's Almaden Research Center. His work has been supported by an NSF Career Award, an ONR Young Investigator Award, a MacArthur Foundation Fellowship, a Packard Foundation Fellowship, a Sloan Foundation Fellowship, and grants from Google, Yahoo!, and the NSF. He is a member of the National Academy of Engineering and the American Academy of Arts and Sciences. In 2011, he was elected to the United States National Academy of Sciences. In 2013 he became a fellow of the Association for Computing Machinery.
Research
Kleinberg is best known for his work on networks. One of his best-known contributions is the HITS algorithm, developed while he was at IBM. HITS is an algorithm for web search that builds on the eigenvector-based methods used in algorithms and served as the full-scale model for PageRank by recognizing that web pages or sites should be considered important not only if they are linked to by many others (as in PageRank), but also if they link to many others. Search engines themselves are examples of sites that are important because they link to many others. Kleinberg realized that this generalization implies two different classes of important web pages, which he called "hubs" and "authorities". The HITS algorithm is an algorithm for automatically identifying the leading hubs and authorities in a network of hyperlinked pages.
Kleinberg is also known for his work on algorithmic aspects of the small world experiment. He was one of the first to realize that Stanley Milgram's famous "six degrees" letter-passing experiment implied not only that there are short paths between individuals in social networks but also that people seem to be good at finding those paths, an apparently simple observation that turns out to have profound implications for the structure of the networks in question. The formal model in which Kleinberg studied this question is a two dimensional grid, where each node has both short-range connections (edges) to neighbours in the grid and long-range connections to nodes further apart. For each node v, a long-range edge between v and another node w is added with a probability that decays as the second power of the distance b |
https://en.wikipedia.org/wiki/Mules | Mules may refer to:
Mules (train), passenger trains operated by Amtrak running between St. Louis and Kansas City, Missouri as part of the Missouri Service train network
People
Charles Mules (1837–1927), third Anglican Bishop of Nelson, New Zealand
Horace Charles Mules, Commissioner in Sind, British India, from 1903 to 1904
John W. H. Mules, after whom the practice of Mulesing is named
Justine Mules (born 1994), Australian rules footballer
Sports teams
Mules, the sports teams of Leilehua High School, Wahiawa, Hawaii
Mules, the sports teams of Muleshoe High School, Muleshoe, Texas
Mules, the sports teams of Muhlenberg College, Allentown, Pennsylvania
Central Missouri Mules and Jennies, the sports teams of the University of Central Missouri
Colby Mules, the sports teams of Colby College, in Waterville, Maine
New Britain Mules, a 1930s American Basketball League team
Newark Bears (basketball), an American Basketball League team renamed the Newark Mules for the 1934 season; merged with the New Britain Jackaways to form the New Britain Mules in the second half of the season
St. Louis Mules, a member of the American Soccer League in the 1972 season
See also
Mule (disambiguation)
Mule (surname) |
https://en.wikipedia.org/wiki/The%20Dick%20Cavett%20Show | The Dick Cavett Show is the title of several talk shows hosted by Dick Cavett on various television networks, including:
ABC daytime, (March 4, 1968–January 24, 1969) originally titled This Morning
ABC prime time, Tuesdays, Wednesdays & Fridays (May 26 – September 19, 1969)
ABC late night (December 29, 1969 – January 1, 1975)
CBS prime time, Saturdays (August 16 – September 6, 1975; this version was actually more of a variety show)
PBS, early evenings, weeknights (October 10, 1977 – October 8, 1982)
USA Network prime time (September 30, 1985 – September 23, 1986)
ABC late night, Tuesdays & Wednesday nights (September 22 – December 30, 1986)
CNBC (April 17, 1989 – January 26, 1996)
TCM (2006–2007)
Cavett normally taped his programs in New York City, though occasionally he would venture elsewhere, including Los Angeles, New Orleans and London.
Show history
The Dick Cavett Show refers to television programs on the ABC, PBS, USA and CNBC networks hosted by comedian, comedy writer and author Dick Cavett between 1968 and 1995 in New York. The first daytime show featured Gore Vidal, Muhammad Ali and Angela Lansbury. ABC pressured Cavett to get prominent celebrities on the show, although subsequent shows without them got higher ratings and more critical acclaim.
A well-received summer replacement prime-time series that aired three times per week led to the memorable late-night talk show that ran from December 29, 1969, to January 1, 1975, opposite NBC's The Tonight Show Starring Johnny Carson. Cavett took the time slot over from The Joey Bishop Show. In addition to his usual monologue, Cavett opened each show reading selected questions written by audience members, to which he would respond with witty rejoinders. ("What makes New York so crummy these days?" "Tourists.")
While Cavett and Carson shared many of the same guests, Cavett was receptive to rock and roll artists to a degree unusual at the time, as well as to authors, politicians and other personalities outside the entertainment field. The wide variety of guests, combined with Cavett's literate and intelligent approach to comedy, appealed to a significant enough number of viewers to keep the show running for several years despite the competition from Carson's show. Carson's move to southern California in the early 1970s to focus on Hollywood celebrities also helped to minimize guest overlap.
The late-night show's 45-minute midpoint would always be signaled by the musical piece "Glitter and Be Gay" from Leonard Bernstein's Candide. The Candide snippet became Cavett's theme song and was used as the introduction to his later PBS series, and was played by the house band on his various talk show appearances.
Typically each show had several guests, but occasionally Cavett would devote an entire show to a single guest. Among those receiving such special treatment (some more than once) were Groucho Marx, Laurence Olivier, Judy Garland, Katharine Hepburn (without an audience), Bette Davis, Or |
https://en.wikipedia.org/wiki/SASE | SASE may refer to:
Sarajevo Stock Exchange, in Bosnia and Herzegovina
Secure access service edge, a networking and security technology
Self-addressed stamped envelope, used for expediting a reply via mail
Self-amplified spontaneous emission, a process by which a laser beam is created
Snow and Avalanche Study Establishment, a laboratory of the India Defence Research & Development Organization
Specific application service element, in the OSI computer networking model
See also
Sase (disambiguation) |
https://en.wikipedia.org/wiki/Brother%20Industries | is a Japanese multinational electronics and electrical equipment company headquartered in Nagoya, Japan. Its products include printers, multifunction printers, desktop computers, consumer and industrial sewing machines, large machine tools, label printers, typewriters, fax machines, and other computer-related electronics. Brother distributes its products both under its own name and under OEM agreements with other companies.
History
Brother's history began in 1908 when it was originally called Yasui Sewing Machine Co in Nagoya, Japan. In 1955, Brother International Corporation (US) was established as their first overseas sales affiliate. In 1958 a European regional sales company was established in Dublin. The corporate name was changed to Brother Industries, Ltd. in 1962. Brother entered the printer market during its long association with Centronics.
In 1968 the company moved its UK headquarters to Audenshaw, Manchester, after acquiring the Jones Sewing Machine Company, a long-established British sewing machine maker.
In March 2005, "Brother Communication Space" (now the Brother Museum), a corporate museum that also serves as a public relations facility, opened in Nagoya.
In December 2011, Brother diversified its offerings by acquiring Nefsis, an innovator in web-based remote collaboration and conferencing software.
In November 2012, Brother announced that it had built the last UK-made typewriter at its north Wales factory. It had made 5.9 million typewriters in its Wrexham factory since it opened in 1985. Brother donated the last machine to London's Science Museum.
As of 31 March 2020, Brother's annual sales revenue had reached 637,259 million yen (US$6,044,666,710 at October 2020 exchange rates).
Sewing and embroidery machines
In 2010, the sewing divisions of Brother Industries around Europe were consolidated into one larger company called "Brother Sewing Machines Europe GmbH". With a turnover in excess of €80 million, it is the 4th largest company under the Brother Industries Ltd umbrella of organisations.
Brother Industries manufactures mechanical sewing machines in Zhuhai, China and computerised sewing & embroidery machines in Taiwan. A new sewing machine factory was opened in 2012 in Đồng Nai Province, Vietnam, which is the largest single brand sewing machine factory in the world.
In September 2012, Brother Industries manufactured their 50 millionth home sewing machine.
In May 2017, Brother Industries manufactured their 60 millionth home sewing machine.
As for Industrial sewing machines, Brother introduced S-7300A “NEXIO” is the world's first lockstitch sewing machine which adopts the Electronic Feed. NEXIO are world's first IoT applicable industrial sewing machines . The visualization by connecting sewing machine and computer technology enables the customer to analyze, manage processes and speed up productivity improvement and maintenance work.
History
In 1908, Kanekichi Yasui established Yasui Sewing and Co. that provided |
https://en.wikipedia.org/wiki/San%20Francisco%20cable%20car%20system | The San Francisco cable car system is the world's last manually operated cable car system and an icon of the city of San Francisco. The system forms part of the intermodal urban transport network operated by the San Francisco Municipal Railway, which also includes the separate E Embarcadero and F Market & Wharves heritage streetcar lines, and the Muni Metro modern light rail system. Of the 23 cable car lines established between 1873 and 1890, only three remain (one of which combines parts of two earlier lines): two routes from downtown near Union Square to Fisherman's Wharf, and a third route along California Street.
While the cable cars are used to a certain extent by commuters, the vast majority of the millions of passengers who use the system every year are tourists, and as a result, the wait to get on can often reach two hours or more. They are among the most significant tourist attractions in the city, along with Alcatraz Island, the Golden Gate Bridge, and Fisherman's Wharf.
San Francisco's cable cars are listed on the National Register of Historic Places and is one of only two street railways to be named a National Historic Landmark, along with the St. Charles Streetcar Line in New Orleans.
History
Beginnings
In 1869, Andrew Smith Hallidie had the idea for a cable car system in San Francisco, reportedly after witnessing an accident in which a streetcar drawn by horses over wet cobblestones slid backwards, killing the horses. Hallidie solicited financial support in 1871 and 1872, and his primary backers were Henry L. Davis, Joseph Britton, and James Moffit.
The first successful cable-operated street running train was the Clay Street Hill Railroad, which had its inaugural run on August 2, 1873. The promoter of the line was Hallidie, and the engineer was William Eppelsheimer; both Hallidie and Eppelsheimer obtained several patents for their work on the Clay Street line. The line involved the use of grip cars, which carried the grip that engaged with the cable, towing trailer cars; the design was the first to use grips. The term "grip" became synonymous with the operator.
The line started regular service on September 1, 1873, and its success led it to become the template for other cable car transit systems. It was a financial success, and Hallidie's patents were enforced on other cable car promoters, making him wealthy.
Accounts differ as to the precise degree of Hallidie's involvement in the inception of the line, and to the exact date on which it first ran. According to the franchise granted by the city, operations were required to begin by August 1, 1873. A retrospective published in 1895 stated that a single car was run over the line at 4 am on the morning of August 1 with few witnesses to ensure the franchise would not expire. Eppelsheimer would later bring a suit against Hallidie and the Clay Street Hill RR in June 1877 over patents, but dismissed it voluntarily the following March.
Expansion
The next cable car line to open w |
https://en.wikipedia.org/wiki/Andrew%20Voss | Andrew Voss (born 7 September 1966) is an Australian rugby league commentator and radio and television personality who works for Fox League.
Voss previously worked for the SKY Network Television as a commentator, and at the Nine Network, including Today, NRL Footy Show, The Sunday Footy Show and The Sunday Roast. He and Eddie Hemmings (rugby league) are the two commentators for the video game Rugby League Live 4.
Career
In the 1990s and 2000s, Voss hosted several of the Nine Network's rugby league-related TV shows. He began appearing on The Footy Show in 1997 as a regular guest, starring in different sketches and in group discussions.
In time, he was the Nine's Network's number-two rugby league caller behind Ray Warren. In 2012, he was demoted to the number-three caller behind Ray Hadley. This occurred after Hadley strongly and personally criticised Voss for jokingly questioning on-air the likeness of a statue of Warren erected in Warren's hometown of Junee, New South Wales. Voss then sued Hadley for defamation, and the matter was settled out of court. It was revealed in 2011 that Voss had had a long-running feud with Hadley, dating back to 1994 when they both worked at Sydney radio station 2UE.
Voss has covered various other sporting events, including the Sydney Olympic Games, Melbourne Commonwealth Games and the Vancouver Winter Olympic Games. He travelled to London to cover the 2012 Summer Olympics.
In 2006, Voss was the lead commentator on Torvill and Dean's Dancing on Ice.
In 2009, Andrew was a fill-in sports presenter on the Nine Network's Today between Mondays and Thursdays, in addition to presenting every Friday in place of Cameron Williams.
Also in 2009, Voss hosted Australia's Greatest Athlete for the Nine Network, a program which screened on Saturday afternoons.
He joined UK Premier Sports as the lead commentator for their coverage of the 2013 Rugby League World Cup, telecast in Australia on 7mate. In 2013, he also called the New Zealand Warriors' games for Sky Sport in New Zealand. Voss has made the term "let's have some fun" his own. He mainly uses the term at the start of most matches.
From 2018, Voss started a show called The Fan on Fox League, which runs on Tuesday nights.
References
External links
ICMI profile
Nine News presenters
Living people
1966 births
Australian rugby league commentators
Fox Sports (Australian TV network) people |
https://en.wikipedia.org/wiki/SeaWiFS | SeaWIFS (Sea-Viewing Wide Field-of-View Sensor) was a satellite-borne sensor designed to collect global ocean biological data. Active from September 1997 to December 2010, its primary mission was to quantify chlorophyll produced by marine phytoplankton (microscopic plants).
Instrument
SeaWiFS was the only scientific instrument on GeoEye's OrbView-2 (AKA SeaStar) satellite, and was a follow-on experiment to the Coastal Zone Color Scanner on Nimbus 7. Launched August 1, 1997 on an Orbital Sciences Pegasus small air-launched rocket, SeaWiFS began scientific operations on September 18, 1997 and stopped collecting data on December 11, 2010, far exceeding its designed operating period of 5 years. The sensor resolution is 1.1 km (LAC, "Local Area Coverage") and 4.5 km (GAC, "Global Area Coverage"). The sensor recorded information in the following optical bands:
The instrument was specifically designed to monitor ocean characteristics such as chlorophyll-a concentration and water clarity. It was able to tilt up to 20 degrees to avoid sunlight from the sea surface. This feature is important at equatorial latitudes where glint from sunlight often obscures water colour. SeaWiFS had used the Marine Optical Buoy for vicarious calibration.
The SeaWiFS Mission is an industry/government partnership, with NASA's Ocean Biology Processing Group at Goddard Space Flight Center having responsibility for the data collection, processing, calibration, validation, archive and distribution. The current SeaWiFS Project manager is Gene Carl Feldman.
Chlorophyll estimation
Chlorophyll concentrations are derived from images of the ocean's color. Generally speaking, the greener the water, the more phytoplankton are present in the water, and the higher the chlorophyll concentrations. absorbs more blue and red light than green, with the resulting reflected light changing from blue to green as the amount of chlorophyll in the water increases. Using this knowledge, scientists were able to use ratios of different reflected colors to estimate chlorophyll concentrations.
Many formulas estimate chlorophyll by comparing the ratio of blue to green light and relating those ratios to known chlorophyll concentrations from the same times and locations as the satellite observations. The color of light is defined by its wavelength, and visible light has wavelengths from 400 to 700 nanometers, progressing from violet (400 nm) to red (700 nm). A typical formula used for SeaWiFS data (termed OC4v4) divides the reflectance of the maximum of several wavelengths (443, 490, or 510 nm) by the reflectance at 550 nm. This roughly equates to a ratio of blue light to green light for two of the numerator wavelengths, and a ratio of two different green wavelengths for the other possible combination.
The reflectance (R) returned by this formula is then plugged into a cubic polynomial that relates the band ratio to chlorophyll.
This formula, along with others, was derived empirically using obse |
https://en.wikipedia.org/wiki/Q-learning | Q-learning is a model-free reinforcement learning algorithm to learn the value of an action in a particular state. It does not require a model of the environment (hence "model-free"), and it can handle problems with stochastic transitions and rewards without requiring adaptations.
For any finite Markov decision process, Q-learning finds an optimal policy in the sense of maximizing the expected value of the total reward over any and all successive steps, starting from the current state. Q-learning can identify an optimal action-selection policy for any given finite Markov decision process, given infinite exploration time and a partly-random policy. "Q" refers to the function that the algorithm computes – the expected rewards for an action taken in a given state.
Reinforcement learning
Reinforcement learning involves an agent, a set of states , and a set of actions per state. By performing an action , the agent transitions from state to state. Executing an action in a specific state provides the agent with a reward (a numerical score).
The goal of the agent is to maximize its total reward. It does this by adding the maximum reward attainable from future states to the reward for achieving its current state, effectively influencing the current action by the potential future reward. This potential reward is a weighted sum of expected values of the rewards of all future steps starting from the current state.
As an example, consider the process of boarding a train, in which the reward is measured by the negative of the total time spent boarding (alternatively, the cost of boarding the train is equal to the boarding time). One strategy is to enter the train door as soon as they open, minimizing the initial wait time for yourself. If the train is crowded, however, then you will have a slow entry after the initial action of entering the door as people are fighting you to depart the train as you attempt to board. The total boarding time, or cost, is then:
0 seconds wait time + 15 seconds fight time
On the next day, by random chance (exploration), you decide to wait and let other people depart first. This initially results in a longer wait time. However, less time is spent fighting the departing passengers. Overall, this path has a higher reward than that of the previous day, since the total boarding time is now:
5 second wait time + 0 second fight time
Through exploration, despite the initial (patient) action resulting in a larger cost (or negative reward) than in the forceful strategy, the overall cost is lower, thus revealing a more rewarding strategy.
Algorithm
After steps into the future the agent will decide some next step. The weight for this step is calculated as , where (the discount factor) is a number between 0 and 1 (). Assuming , it has the effect of valuing rewards received earlier higher than those received later (reflecting the value of a "good start"). may also be interpreted as the probability to succeed (or survive) at e |
https://en.wikipedia.org/wiki/Guild%20Software | Guild Software is a small independent computer game developer located in Milwaukee, Wisconsin (USA) founded in 1998. Guild Software is best known for creating Vendetta Online, a first-person MMORPG that uses their in-house NAOS game engine. In 2009, the studio was voted a Reader's Choice Award for Favorite Company by MMOsite.com.
In 2013, Guild Software's Vendetta Online was widely reported as the first MMORPG to support the Oculus Rift, making it potentially the first persistent online world with native support for a consumer Virtual reality headset.
Beyond game development, the company also created and maintains the free and popular Android app Barometer HD, allowing simple measurement and graphing of barometric pressure on devices equipped with pressure sensors.
Management
John Bergman — CEO, game design, artwork
Ray Ratelis — VP of engineering
References
External links
Guild Software Website
NAOS Engine
Video game companies of the United States
Video game companies established in 1998
Video game development companies
Companies based in Milwaukee
Mobile game companies |
https://en.wikipedia.org/wiki/The%20Bold%20Ones | The Bold Ones is the umbrella title for several television series. It was produced by Universal Television and broadcast on NBC from 1969 to 1973. It was a wheel format series, an NBC programming approach also used by that network in series such as The Name of the Game and the NBC Mystery Movie.
Segments
During the four years of the series there were four segments, three of which rotated the first two seasons; in the third the two survivors, The New Doctors and The Lawyers alternated, then The New Doctors in year four was the sole, remaining occupant under The Bold Ones umbrella. Just as in its wheel predecessor, The Name of the Game, a season consisted of 24 originals with 8 shows filmed for each segment. However, in the debut season the police work forming the setting of The Protectors resulted in its order being reduced by two because of the new politically induced mandate by the networks to their suppliers, the studios, to curtail on-screen violence, action and danger which of course cop shows would not exist without at least some mayhem. So, The New Doctors was the beneficiary, being handed two extra episodes.
Both violence-free The New Doctors and The Lawyers segments of The Bold Ones received pick-ups for a second season while The Protectors became a sacrificial lamb of sorts to be replaced by The Senator starring Hal Holbrook. While The Senator was by far the most critically acclaimed of the four versions of The Bold Ones, NBC dumped it in favor of alternating every week The New Doctors and The Lawyers for the third season. For the final season, an abbreviated fourth, The New Doctors and its 15 episodes were the sole occupant in The Bold Ones wheel.
Listed here are all four elements:
The Bold Ones: The New Doctors (1969–73) starred E.G. Marshall, David Hartman, and John Saxon (who was replaced by Robert Walden in the final season).
The Bold Ones: The Lawyers (1969–72) starred Burl Ives, Joseph Campanella, and James Farentino. This series was based on the TV movies The Sound of Anger and The Whole World Is Watching.
The Bold Ones: The Protectors (1969–70) starred Leslie Nielsen and Hari Rhodes as an often conflicting police official and district attorney. This series was based on the TV movie Deadlock.
The Bold Ones: The Senator (1970–71) starred Hal Holbrook. This series was based on the TV movie A Clear and Present Danger.
The New Doctors was based at the "David Craig Institute for New Medicine", named after E.G. Marshall's character Dr. David Craig. David Hartman played Dr. Paul Hunter, with John Saxon (seasons one, two and three) as Dr. Theodore Stuart, replaced in season four by Robert Walden as Dr. Martin Cohen. These stories were medical dramas.
Drs. Craig and Hunter appeared in a two-part crossover story with Ironside, "Five Days in the Death of Sgt. Brown". The crossover was produced between the departure of Saxon and the casting of Walden, and featured Vic Morrow as a third main character. The story has since been edite |
https://en.wikipedia.org/wiki/Orthogonal%20instruction%20set | In computer engineering, an orthogonal instruction set is an instruction set architecture where all instruction types can use all addressing modes. It is "orthogonal" in the sense that the instruction type and the addressing mode vary independently. An orthogonal instruction set does not impose a limitation that requires a certain instruction to use a specific register so there is little overlapping of instruction functionality.
Orthogonality was considered a major goal for processor designers in the 1970s, and the VAX-11 is often used as the benchmark for this concept. However, the introduction of RISC design philosophies in the 1980s significantly reversed the trend against more orthogonality.
Modern CPUs often simulate orthogonality in a preprocessing step before performing the actual tasks in a RISC-like core. This "simulated orthogonality" in general is a broader concept, encompassing the notions of decoupling and completeness in function libraries, like in the mathematical concept: an orthogonal function set is easy to use as a basis into expanded functions, ensuring that parts don’t affect another if we change one part.
Basic concepts
At their core, all general purpose computers work in the same underlying fashion; data stored in a main memory is read by the central processing unit (CPU) into a fast temporary memory (e.g. CPU registers), acted on, and then written back to main memory. Memory consists of a collection of data values, encoded as numbers and referred to by their addresses, also a numerical value. This means the same operations applied to the data can be applied to the addresses themselves. While being worked on, data can be temporarily held in processor registers, scratchpad values that can be accessed very quickly. Registers are used, for example, when adding up strings of numbers into a total.
Single instruction, single operand
In early computers, the instruction set architecture (ISA) often used a single register, in which case it was known as the accumulator. Instructions included an address for the operand. For instance, an ADD address instruction would cause the CPU to retrieve the number in memory found at that address and then add it to the value already in the accumulator. This very simple example ISA has a "one-address format" because each instruction includes the address of the data.
One-address machines have the disadvantage that even simple actions like an addition require multiple instructions, each of which takes up scarce memory, and requires time to be read. Consider the simple task of adding two numbers, 5 + 4. In this case, the program would have to load the value 5 into the accumulator with the LOAD address instruction, use the ADD address instruction pointing to the address for the 4, and finally SAVE address to store the result, 9, back to another memory location.
Single instruction, multiple operands
Further improvements can be found by providing the address of both of the operands in a single i |
https://en.wikipedia.org/wiki/MLton | MLton is an open-source whole-program optimizing compiler for Standard ML. MLton development began in 1997, and continues with a worldwide community of developers and users, who have helped to port MLton to a number of platforms. MLton was a participating organization in the 2013 Google Summer of Code.
MLton aims to produce fast executables, and to encourage rapid prototyping and modular programming by eliminating inefficiencies often associated with high-level features. It also aims to facilitate large-scale programming through the MLBasis system, simplifying modularity and management of namespaces. As a whole-program compiler, it is notable for lacking an interactive top-level, common amongst Standard ML environments.
MLton includes several libraries in addition to the basis including ML Language Processing Tools with an implementation of ANTLR, and MLRISC with code generators for reduced instruction set CPUs. It also implements features that aid in porting code from SML/NJ, one of the more popular SML implementations, including support for SML/NJ's compilation manager.
See also
References
External links
MLton webpage
ML programming language family |
https://en.wikipedia.org/wiki/Free%20store | Free store may refer to:
Give-away shop, a shop where all items are available at no cost
In computer programming, a region of memory used for dynamic memory management |
https://en.wikipedia.org/wiki/Identity%20%28object-oriented%20programming%29 | In object-oriented programming, object-oriented design and object-oriented analysis, the identity of an object is its being distinct from any other object, regardless of the values of the objects' properties. Having identity is a fundamental property of objects.
This is closely related to the philosophical concept of identity.
Identity and references
A reference can be used to refer to an object with a specific identity. A reference contains the information that is necessary for the identity property to be realized in the programming language, and allows access to the object with the identity. A type of a target of a reference is a role. Typically, references are isomorphic to memory addresses. However, multiple such references can refer to the same object, if some form of address mapping is present (virtual addresses / page tables / memory segments).
Object identity is less useful as a semantic concept in environments or situations in which the structure of objects is not encapsulated, and two objects are considered to be the same object based on having identical properties, even if they are not actually the same physical instance (structural equivalence). However, object identity can nevertheless provide optimization. A function which tests whether two arguments are the same object can quickly short circuit to an affirmative answer if the two arguments have the same identity (are references to the same instance). Only if the argument are distinct objects do the individual properties need to be considered to determine equality, which is a more expensive operation. For instance, bignum integers may be heap-allocated objects such that two bignums are considered to be the same if they represent the same number. It might be a waste of machine cycles in the equality function not to take advantage of the discovery that the two arguments being compared are references to the same bignum.
Consequences of identity
Identity of objects allows objects to be treated as black boxes. The object need not expose its internal structure. It can still be referred to, and its other properties can be accessed via its external behaviour associated with the identity. The identity provides a mechanism for referring to such parts of the object that are not exposed in the interface. Thus, identity is the basis for polymorphism in object-oriented programming.
Identity allows comparison of references. Two references can be compared whether they are equal or not. Due to the identity property, this comparison has special properties. If the comparison of references indicates that the references are equal, then it's clear that the two objects pointed by the references are the same object. If the references do not compare equal, then it's not necessarily guaranteed that the identity of the objects behind those references is different. The object identity of two objects of the same type is the same, if every change to either object is also a change to the other object.
|
https://en.wikipedia.org/wiki/Small | Small may refer to:
Science and technology
SMALL, an ALGOL-like programming language
Small (anatomy), the lumbar region of the back
Small (journal), a nano-science publication
<small>, an HTML element that defines smaller text
Arts and entertainment
Fictional characters
Small, in the British children's show Big & Small
Other uses
Small, of little size
Small (surname)
"Small", a song from the album The Cosmos Rocks by Queen + Paul Rodgers
See also
Smal (disambiguation)
List of people known as the Small
Smalls (disambiguation) |
https://en.wikipedia.org/wiki/Supreme%20Ruler%202010 | Supreme Ruler 2010 is a computer wargame in which a player controls all aspects of a region's government and attempts to unite a world of fragmented states in the year of 2010.
The game was produced by BattleGoat Studios and released by Strategy First in 2005.
Official support for Supreme Ruler 2010 ended in August 2006 with the release of the 6th update. The final version of the game was 4.6.1.
A sequel, Supreme Ruler 2020, was released in 2008 by publisher Paradox Interactive.
Reception
Supreme Ruler 2010 received "average" reviews according to the review aggregation website Metacritic.
Brett Todd of GameSpot praised the game's ease of play and quantity of scenarios but criticized the difficulty as being artificially inflated. Barry Brenesal of IGN gave praise to its gameplay and interfaces but criticized the AI and the numerous bugs.
References
External links
Supreme Ruler 2010 official website
SupremeWiki
2005 video games
Akella games
Alternate history video games
Black Bean Games games
Government simulation video games
Grand strategy video games
Multiplayer and single-player video games
Strategy First games
Supreme Ruler
Video games developed in Canada
Video games set in 2010
Windows games
Windows-only games |
https://en.wikipedia.org/wiki/ISO%2020022 | ISO 20022 is an ISO standard for electronic data interchange between financial institutions. It describes a metadata repository containing descriptions of messages and business processes, and a maintenance process for the repository content. The standard covers financial information transferred between financial institutions that includes payment transactions, securities trading and settlement information, credit and debit card transactions and other financial information.
The repository contains a huge amount of financial services metadata that has been shared and standardized across the industry. The metadata is stored in UML models with a special ISO 20022 UML Profile. Underlying all of this is the ISO 20022 metamodel – a model of the models. The UML profile is the metamodel transformed into UML. The metadata is transformed into the syntax of messages used in financial networks. The first syntax supported for messages was XML Schema.
ISO 20022 is widely used in financial services. Organizations participating in ISO 20022 include SWIFT. ISO 20022 is the successor to ISO 15022; originally ISO 20022 was called ISO 15022 2nd Edition. ISO 15022 was the successor of ISO 7775.
Parts of the standard
ISO 20022 Financial services – Universal financial industry message scheme.
Management of the standard
The Standard is issued by ISO Technical Committee 68 (TC68), which is responsible for Financial Services in ISO.
The Standard is managed by Sub Committee 9 (SC 9) "Information exchange for financial services".
The Working Group 4 (WG4), a sub-group of SC 9, who works on the next revision of ISO 20022.
The Standard defines a Registration Management Group (RMG) Composed of senior industry experts. It is the highest registration body.
SEG Standard Evolution Group composed of industry experts in specific business domains of the financial industry
SWIFT is the Registration Authority (RA) for ISO 20022. RA is the guardian of the ISO 20022 financial repository. The AG 1 Group oversees the performance of RA.
Adoption
A 2015 report by the United States's Federal Reserve System classified Europe having "mature adopters" of ISO 20022; India, South Africa, Japan, Singapore, and Switzerland as having "growing adopters"; and Australia, Canada, the United Kingdom, and New Zealand as having "interested adopters". The report concluded that the Federal Reserve should push for ISO 20022 adoption within the United States financial system.
Australia's New Payments Platform, launched in February 2018, uses ISO 20022 messaging.
The Reserve Bank of New Zealand plans to support ISO 20022 from November 2022 onward.
In July 2018, the Federal Reserve Board of Governors requested comments on the proposed adoption of the ISO 20022 message format in a migration beginning in 2020 and ending in 2023.
Nordic countries launched the P27 payment platform.
The Eurosystem in March 2023 switched its real-time gross settlement to T2, which follows ISO 20022. The switch invo |
https://en.wikipedia.org/wiki/F%20%28programming%20language%29 | F is a modular, compiled, numeric programming language, designed for scientific programming and scientific computation. F was developed as a modern Fortran, thus making it a subset of Fortran 95. It combines both numerical and data abstraction features from these languages. F is also backwards compatible with Fortran 77, allowing calls to Fortran 77 programs. F was implemented on top of compilers from NAG, Fujitsu, Salford Software and Absoft. It was later included in the g95 compiler.
Overview
F is designed to be a minimal subset of Fortran, with only about one hundred intrinsic procedures. Language keywords and intrinsic function names are reserved keywords in F and no other names may take this exact form. F contains the same character set used in Fortran 90/95 with a limit of 132 characters. Reserved words are always written in lowercase. Any uppercase letter may appear in a character constant. Variable names do not have restriction and can include upper and lowercase characters.
Operators
F supports many of the standard operators used in Fortran. The operators supported by F are:
Arithmetic operators: +, -, *, /, **
Relational operators: <, <=, ==, /=, >, >=
Logical operators: .not., .and., .or., .eqv., .neqv.
character concatenation: //
The assignment operator is denoted by the equal sign =. In addition, pointer assignment is denoted by =>. Comments are denoted by the ! symbol:
variable = expression ! assignment
pointer => target ! pointer assignment
Data types
Similar to Fortran, the type specification is made up of a type, a list of attributes for the declared variables, and the variable list. F provides the same types as Fortran, except that double precision floating point variables must be declared as real with a kind with a kind parameter:
! type [,attribute list] :: entity declaration list
real :: x, y ! declaring variables of type real x,y without an attribute list
integer (kind = long), dimension (100) :: x ! declaring variable of type big integer array with the identifier x
character (len = 100) :: student_name ! declaring a character type variable with len 100
F does not have intrinsic support for object-oriented programming, but it does allow for records:
type, public :: City
character (len = 100) :: name
character (len = 50) :: state
end type City
Variable declarations are followed by an attribute list. The attributes allowed are parameter, public, private, allocatable, dimension, intent, optional, pointer, save and target. The attribute list is followed by ::, which is part of the syntax. F also allows for optional initialization in the list of objects. All items in a list will have the same attributes in a given type declaration statement. In addition, declarations are attribute oriented instead of entity oriented.
Statement and control flow
F supports 3 statements for control flow: if, a basic conditional, case, a switch statement, and do, a conditional while loop. The return, stop, cycle, and exit |
https://en.wikipedia.org/wiki/Orin%20Kerr | Orin Samuel Kerr (born June 2, 1971) is an American legal scholar and professor of law at the UC Berkeley School of Law. He is known as a scholar in the subjects of computer crime law and internet surveillance. Kerr is one of the contributors to the law-oriented blog titled The Volokh Conspiracy.
Early life and education
Kerr was born in 1971 in New York. His father is a survivor of the Holocaust. After graduating from Tower Hill School in Wilmington, Delaware, in 1989, Kerr studied mechanical engineering and aerospace engineering at Princeton University, graduating in 1993 with a Bachelor of Science in Engineering magna cum laude. He then did graduate study in mechanical engineering at Stanford University, where he received a Master of Science degree in 1994.
Kerr then attended Harvard Law School, where he was an executive editor of the Harvard Journal of Law and Public Policy and an editor of the Harvard Journal of Law & Technology. He graduated in 1997 with a Juris Doctor, magna cum laude.
Career
Kerr was a law clerk for Judge Leonard I. Garth of the U.S. Court of Appeals for the Third Circuit from 1997 to 1998. From 1998 to 2001, he was a trial attorney in the Computer Crime and Intellectual Property Section of the U.S. Department of Justice's Criminal Division. In 2001, he joined the faculty of George Washington University Law School.
In 2003, Kerr took a leave of absence from the law school to clerk for Justice Anthony M. Kennedy of the United States Supreme Court during October Term 2003. In 2009, he served U.S. Senator John Cornyn of the Senate Judiciary Committee as Special Counsel for Supreme Court Nominations during Sonia Sotomayor's confirmation as Supreme Court Justice; a year later, he again served as an advisor to Cornyn, this time on the Supreme Court confirmation of Elena Kagan.
Kerr was one of the lawyers for alleged MySpace "cyberbully" Lori Drew. His blog contributions at The Volokh Conspiracy often focus on developments in internet privacy law. He has been regarded as a leading scholar on Fourth Amendment jurisprudence in electronic communications and surveillance. Kerr was repeatedly cited in the Ninth Circuit's 2008 opinion Quon v. Arch Wireless Operating Co., Inc., which held that users have a reasonable expectation of privacy in the content of text messages and e-mails. The Supreme Court later took up the case, as Ontario v. Quon, and unanimously reversed. Kerr argued before the Supreme Court in the 2011 case Davis v. United States.
In response to a 2011 comment by Chief Justice John Roberts criticizing the irrelevancy of legal scholarship for focusing on issues such as Immanuel Kant's influence on 18th century evidentiary approaches in Bulgaria, Kerr wrote a short, humorous paper on the topic in 2015, finding that such influence was highly improbable.
Kerr filed an amicus curiae in support of the United States in Carpenter v. United States, a case concerning the government's seizure of an individual's historical c |
https://en.wikipedia.org/wiki/WLOS | WLOS (channel 13) is a television station licensed to Asheville, North Carolina, United States, broadcasting ABC and MyNetworkTV programming to Western North Carolina and Upstate South Carolina. It is owned by Sinclair Broadcast Group in an effective duopoly with WMYA-TV (channel 40) in Anderson, South Carolina. WLOS maintains studios on Technology Drive (near I-26/US 74) in Asheville and a transmitter on Mount Pisgah in Haywood County, North Carolina.
WLOS-TV began broadcasting in September 1954 as the ABC affiliate for Asheville and most of the western Carolinas and the city's second TV station. It was founded by the Skyway Broadcasting Corporation, owner of WLOS radio, and owned by Wometco Enterprises from 1958 to 1987; Sinclair has owned it since 1996. Its local news coverage has historically focused on western North Carolina, in contrast to the other major stations in the market, all of which broadcast from studios in South Carolina.
History
Early years
Prior to the 1948 freeze on television station applications imposed by the Federal Communications Commission (FCC), Skyway Broadcasting Corporation—owner of Asheville radio stations WLOS (1380 AM) and WLOS-FM 99.9—had applied for the use of channel 7, one of three channels assigned to the city along with channel 5 (applied for by actress Mary Pickford) and 12. However, the major overhaul of TV allocations accompanying the introduction of ultra high frequency (UHF) channels would result in only one VHF channel being allotted to Asheville: 13, along with UHF 56 (educational) and 62. The Skyway Broadcasting Company, corporate parent of WLOS, applied for channel 13 on December 7, 1951. It was soon joined by WSKY (1230 AM) in August 1952 and WWNC (570 AM), owned by the Asheville Citizen-Times Company, in March 1953. WSKY was out of the contest by August 1953, as was the Community Television Company, but Asheville tax attorney William W. Orr then filed in October, bringing the field back up to three contenders for channel 13.
However, in December 1953, the field cleared, and Orr and the Citizen-Times Company withdrew their applications to allow WLOS to get the construction permit; the latter received an option to buy stock in Skyway, though it was cautioned that such would require additional FCC approval. The next step was securing a transmitter site. WLOS immediately proposed to erect a tower atop Mount Pisgah, which was met with divided sentiment. Civic groups favored the location and claimed it was the only site in the mountainous area from which the station could provide regional coverage; others derided what they felt as the commercialization of the well-known summit. A United States Forest Service hearing in February 1954 drew 50 attendees and thousands of letters, telegrams, and postcards, but the federal government approved the Pisgah tower site at the end of February. Meanwhile, the station acquired the Battle House, a 1925-built residence on Macon Avenue described by The Asheville Ci |
https://en.wikipedia.org/wiki/Wireless%20WAN | Wireless wide area network (WWAN), is a form of wireless network.
The larger size of a wide area network compared to a local area network requires differences in technology.
Wireless networks of different sizes deliver data in the form of telephone calls, web pages, and video streaming.
A WWAN often differs from wireless local area network (WLAN) by using mobile telecommunication cellular network technologies such as 2G, 3G, 4G LTE, and 5G to transfer data. It is sometimes referred as Mobile Broadband. These technologies are offered regionally, nationwide, or even globally and are provided by a wireless service provider. WWAN connectivity allows a user with a laptop and a WWAN card to surf the web, check email, or connect to a virtual private network (VPN) from anywhere within the regional boundaries of cellular service. Various computers can have integrated WWAN capabilities.
A WWAN may also be a closed network that covers a large geographic area. For example, a mesh network or MANET with nodes on buildings, towers, trucks, and planes could also be considered a WWAN.
A WWAN may also be a low-power, low-bit-rate wireless WAN, (LPWAN), intended to carry small packets of information between things, often in the form of battery operated sensors.
Since radio communications systems do not provide a physically secure connection path, WWANs typically incorporate encryption and authentication methods to make them more secure. Some of the early GSM encryption techniques were flawed, and security experts have issued warnings that cellular communication, including WWAN, is no longer secure. UMTS (3G) encryption was developed later and has yet to be broken.
See also
Private Shared Wireless Network
Wide area network
Wireless LAN
Wi-Fi
Satellite Internet access
References
Wide area networks
Wireless networking |
https://en.wikipedia.org/wiki/Johnson%27s%20algorithm | Johnson's algorithm is a way to find the shortest paths between all pairs of vertices in an edge-weighted directed graph. It allows some of the edge weights to be negative numbers, but no negative-weight cycles may exist. It works by using the Bellman–Ford algorithm to compute a transformation of the input graph that removes all negative weights, allowing Dijkstra's algorithm to be used on the transformed graph. It is named after Donald B. Johnson, who first published the technique in 1977.
A similar reweighting technique is also used in Suurballe's algorithm for finding two disjoint paths of minimum total length between the same two vertices in a graph with non-negative edge weights.
Algorithm description
Johnson's algorithm consists of the following steps:
First, a new node is added to the graph, connected by zero-weight edges to each of the other nodes.
Second, the Bellman–Ford algorithm is used, starting from the new vertex , to find for each vertex the minimum weight of a path from to . If this step detects a negative cycle, the algorithm is terminated.
Next the edges of the original graph are reweighted using the values computed by the Bellman–Ford algorithm: an edge from to , having length , is given the new length .
Finally, is removed, and Dijkstra's algorithm is used to find the shortest paths from each node to every other vertex in the reweighted graph. The distance in the original graph is then computed for each distance ( , ), by adding to the distance returned by Dijkstra's algorithm.
Example
The first three stages of Johnson's algorithm are depicted in the illustration below.
The graph on the left of the illustration has two negative edges, but no negative cycles. The center graph shows the new vertex , a shortest path tree as computed by the Bellman–Ford algorithm with as starting vertex, and the values computed at each other node as the length of the shortest path from to that node. Note that these values are all non-positive, because has a length-zero edge to each vertex and the shortest path can be no longer than that edge. On the right is shown the reweighted graph, formed by replacing each edge weight by . In this reweighted graph, all edge weights are non-negative, but the shortest path between any two nodes uses the same sequence of edges as the shortest path between the same two nodes in the original graph. The algorithm concludes by applying Dijkstra's algorithm to each of the four starting nodes in the reweighted graph.
Correctness
In the reweighted graph, all paths between a pair and of nodes have the same quantity added to them. The previous statement can be proven as follows: Let be an path. Its weight W in the reweighted graph is given by the following expression:
Every is cancelled by in the previous bracketed expression; therefore, we are left with the following expression for W:
The bracketed expression is the weight of p in the original weighting.
Since the reweighting adds the same am |
https://en.wikipedia.org/wiki/Dun%20%26%20Bradstreet | The Dun & Bradstreet Corporation is an American company that provides commercial data, analytics, and insights for businesses. Headquartered in Jacksonville, Florida, the company offers a wide range of products and services for risk and financial analysis, operations and supply, and sales and marketing professionals, as well as research and insights on global business issues. It serves customers in government and industries such as communications, technology, strategic financial services, and retail, telecommunications, and manufacturing markets. Often referred to as D&B, the company's database contains over 500 million business records worldwide.
History
1800s
Dun & Bradstreet traces its history to July 20, 1841, with formation of The Mercantile Agency in New York City by Lewis Tappan. Recognizing the need for a centralized credit reporting system, Tappan formed the company to create a network of correspondents who would provide reliable, objective credit information to subscribers. As an advocate for civil rights, Tappan used his abolitionist connections to expand and update the company's credit information.
Despite accusations of personal privacy invasion, by 1844 the Mercantile Agency had over 280 clients. The agency continued to expand, opening offices in Boston, Philadelphia, and Baltimore. By 1849, Tappan retired, allowing Benjamin Douglass to take over the booming business.
In 1859, Douglass transferred the company to Robert Graham Dun, who immediately changed the firm's name to R. G. Dun & Company. Over the next 40 years, Graham Dun continued to expand the business across international boundaries.
1900s
In March 1933, Dun merged with competitor John M. Bradstreet to form today's Dun & Bradstreet. The merger was engineered by Dun's CEO, Arthur Whiteside. Whiteside's successor, J. Wilson Newman, worked to extend the company's range of products and services, expanding the company dramatically during the 1960s by engineering ways to apply new technologies to evolving operations.
Moody's, a credit reporting agency, was acquired by Dun & Bradstreet in 1962. The Dun & Bradstreet Data Universal Numbering System (D&B D-U-N-S Number) was invented in 1963. Other companies acquired during this time included R.H. Donnelley, Official Airline Guides, Thomas Y. Crowell Co., Funk & Wagnalls, Technical Publishing, and McCormack & Dodge, all since divested.
In 1986, Dun & Bradstreet acquired the education data company Market Data Retrieval (MDR). That year, Dun & Bradstreet sold Technical Publishing to Cahners Publishing.
In 1996, the company restructured, creating three entities: Dun & Bradstreet, Nielsen, and the Cognizant Corporation. Cognizant Corporation included Nielsen TV Ratings, Gartner Group, Clarke-O'Neill, Erisco, and several other lesser known entities. In 1999, Cognizant Corporation spun off Nielsen TV Ratings and shortly thereafter divested all its holdings, emerging as IMS Health. IMS Health continued to hold its prize incubator co |
https://en.wikipedia.org/wiki/DNI | DNI may stand for:
Direct neural interface, a brain-computer interface
Direct normal irradiance, a measure of the solar irradiance striking a surface held normal to the line of sight to the sun
Direct normal insolation, also known as direct insolation, a measure of the solar irradiance striking a surface held normal to line of sight to the sun
Digital Network Intelligence, the NSA term for the collection of data from the Internet
Director of National Intelligence, a Cabinet-level executive position that oversees the United States Intelligence Community
Director of Naval Intelligence (disambiguation)
Documento Nacional de Identidad (disambiguation) or "National Identity Document" in Spanish
Dole Nutrition Institute founded by the Dole Food Company
Do not intubate, an alternate term for "do not resuscitate"
Do not install, a term sometimes used in Printed circuit board design to denote the omitting of a component
Do not interact, a term used to deter people or a certain group of people from interacting with someone or something.
Lower Grand Valley Dani language (ISO 639 code: dni)
Wad Medani Airport (IATA airport code: DNI), an airstrip in Sudan
See also
D'ni, a culture in the Myst series
DNIS, a telephone service feature |
https://en.wikipedia.org/wiki/TeleVideo | TeleVideo Corporation was a U.S. company that achieved its peak of success in the early 1980s producing computer terminals. TeleVideo was founded in 1975 by K. Philip Hwang, a Utah State University, Hanyang University graduate born in South Korea who had run a business producing CRT monitors for arcade games since 1975. The company was headquartered in San Jose, California.
TeleVideo's terminal protocol was popular in the early days of microcomputers and was widely supported by applications as well as terminal emulators (often referred to as "TeleVideo 925 emulation").
TeleVideo also built CP/M-compatible 8-bit desktop and portable personal computers based on the Z80 processor. Up to sixteen of these machines could be connected to proprietary multi-user systems through serial interfaces.
In April 1983, TeleVideo introduced an MS-DOS 2.0-compatible personal computer based on the Intel 8088. This was introduced as the Model TS-1603 and included 128 KB RAM (expandable up to 256 KB), integrated monitor, modem and keyboard. The Model TS-1603 ran both TeleVideo PC DOS 2.0 and CP/M-86 1.1.
The company later turned to manufacturing Windows-compatible thin client computers, but eventually sold this business line to Neoware in October 2005. The latter was subsequently taken over by Hewlett-Packard in 2007.
On March 14, 2006, TeleVideo, Inc. filed a voluntary petition for reorganization under Chapter 11 of the United States Bankruptcy Code.
After more than 35 years in business and with millions of terminals sold worldwide, TeleVideo discontinued the manufacturing and sales of all terminal products as of September 30, 2011.
Products
Terminals: TeleVideo 905, 910, 912, 914, 920, 921, 922, 924, 925, 9320, 935, 950, 955, 965, 970, 990, 995-65, Personal Terminal
Graphic boards for Terminals: 914GR, 924GR, 970GR
CP/M systems: TeleVideo TS-800, TS-802, TS-803
CP/M Plus and MP/M II: TeleVideo TS-804 (4 users for MP/M II)
CP/M-86/MS-DOS systems: TeleVideo TS-1603
TeleVideo TPC-1, a portable CP/M system similar to the Osborne-1
Early multi-user systems: TeleVideo TS-806 (6 users), TS-816 (16 users)
[80286 IBM AT clone TELECAT 286], a small green desktop IBM AT clone with a 6 or 8 MHz 80286 CPU Trademark filing for TELECAT-286 1986
References
External links
Official website (mostly defunct)
TS-802 CP/M personal computer
Marcus Bennett's TeleVideo Documentation resource
History of Televideo founders
Background on TS-1603 All In One Computer
Terminals Wiki
1975 establishments in California
2011 disestablishments in California
American companies established in 1975
American companies disestablished in 2011
Companies based in San Jose, California
Companies that filed for Chapter 11 bankruptcy in 2006
Computer companies established in 1975
Computer companies disestablished in 2011
Defunct companies based in the San Francisco Bay Area
Defunct computer companies of the United States
Defunct computer hardware companies
Manufacturing companies establish |
https://en.wikipedia.org/wiki/Harmonic%20Vector%20Excitation%20Coding | Harmonic Vector Excitation Coding, abbreviated as HVXC is a speech coding algorithm specified in MPEG-4 Part 3 (MPEG-4 Audio) standard for very low bit rate speech coding. HVXC supports bit rates of 2 and 4 kbit/s in the fixed and variable bit rate mode and sampling frequency of 8 kHz. It also operates at lower bitrates, such as 1.2 - 1.7 kbit/s, using a variable bit rate technique. The total algorithmic delay for the encoder and decoder is 36 ms.
It was published as subpart 2 of ISO/IEC 14496-3:1999 (MPEG-4 Audio) in 1999. An extended version of HVXC was published in MPEG-4 Audio Version 2 (ISO/IEC 14496-3:1999/Amd 1:2000).
MPEG-4 Natural Speech Coding Tool Set uses two algorithms: HVXC and CELP (Code Excited Linear Prediction). HVXC is used at a low bit rate of 2 or 4 kbit/s. Higher bitrates than 4 kbit/s in addition to 3.85 kbit/s are covered by CELP.
Technology
Linear Predictive Coding
HVXC uses Linear predictive coding (LPC) with block-wise adaptation every 20ms. The LPC parameters are transformed into Line spectral pair (LSP) coefficients, which are jointly quantized. The LPC residual signal is classified as either voiced or unvoiced. In the case of voiced speech, the residual is coded in a parametric representation (operating as a vocoder), while in the case of unvoiced speech, the residual waveform is quantized (thus operating as a hybrid speech codec).
Voiced (Harmonic) Residual Coding
In voiced segments, the residual signal is represented by two parameters: the pitch period and the spectral envelope. The pitch period is estimated from the peak values of the autocorrelation of the residual signal. In this process, the residual signal is compared against shifted copies of itself, and the shift which yields the greatest similarity by the measure of linear dependence is identified as the pitch period. The spectral envelope is represented by a set of amplitude values, one per harmonic. To extract these values, the LPC residual signal is transformed into the DFT-domain. The DFT-spectrum is segmented into bands, one band per harmonic. The frequency band for the m-th harmonic consists of the DFT-coefficients from (m-1/2)ω0 to (m+1/2)ω0, ω0 being the pitch frequency. The amplitude value for the m-th harmonic is chosen to optimally represent these DFT-coefficients. Phase information is discarded in this process. The spectral envelope is then coded using variable-dimension weighted vector quantization. This process is also referred to as Harmonic VQ.
To make a speech with a mixture of voiced and unvoiced excitation sound more natural and smooth, three different modes of voiced speech (Mixed Voiced-1, Mixed Voiced-2, Full Voiced) are differentiated. The degree of voicing is determined by the value of the normalized autocorrelation function at a shift of one pitch period. Depending on the chosen mode, different amounts of band-pass Gaussian noise are added to the synthesized harmonic signal by the decoder.
Voiceless (VXC) Residual Coding
Unvo |
https://en.wikipedia.org/wiki/Tracing | Tracing may refer to:
Computer graphics
Image tracing, digital image processing to convert raster graphics into vector graphics
Path tracing, a method of rendering images of three-dimensional scenes such that the global illumination is faithful to reality
Ray tracing (graphics), techniques in computer graphics
Boundary tracing (also known as contour tracing), a segmentation technique that identifies the boundary pixels of the digital region
Software engineering
Tracing (software), a method of debugging in computer programming
System monitoring
Application performance management
Physics
Ray tracing (physics), a method for calculating the path of waves or particles
Dye tracing, tracking various flows using dye added to the liquid in question
Other uses
Tracing (art), copying an object or drawing, especially with the use of translucent tracing paper
Tracing (criminology), determining crime scene activity from trace evidence left at crime scenes
Tracing (law), a legal process by which a claimant demonstrates what has happened to their property
Anterograde tracing, and Retrograde tracing, biological research techniques used to map the connections of neurons
Call tracing, a procedure that permits an entitled user to be informed about the routing of data for an established connection
Curve sketching, a process for determining the shape of a geometric curve
Family Tracing and Reunification, a process whereby disaster response teams locate separated family members
Tracking and tracing, a process of monitoring the location and status of property in transit
Curve tracing, a method for analyzing the characteristics of semiconductors; see Semiconductor curve tracer
Tracing (as with a gun or camera), tracking an object, as with the use of tracer ammunition
Contact tracing, finding and identifying people in contact with someone with an infectious disease
See also
Trace (disambiguation)
Tracer (disambiguation)
Tracking (disambiguation) |
https://en.wikipedia.org/wiki/Allowed%20cell%20rate | The allowed cell rate is the rate in cells per second at which a source device may send data in ATM networks. It is bounded by the minimum cell rate and the peak cell rate.
References
ITU-T recommendations
Temporal rates |
https://en.wikipedia.org/wiki/Zultrax | Zultrax was a multi-network peer-to-peer application. Supported networks are ZEPP and gnutella. Zultrax runs under the Microsoft Windows operating system.
Zultrax was originally developed in 2001 by Peter Bartholomeus. It is coded using Borland Delphi. Development and support stopped in 2009.
The aim of Zultrax was to provide ease of use combined with the encrypted ZEPP network. This network was fully concentrated around the concepts of swarming and privacy protection.
References
External links
Review by Ian Harac for PC World
Interview with Zultrax
Gnutella clients
Windows-only shareware |
https://en.wikipedia.org/wiki/Esterel | Esterel is a synchronous programming language for the development of complex reactive systems. The imperative programming style of Esterel allows the simple expression of parallelism and preemption. As a consequence, it is well suited for control-dominated model designs.
The development of the language started in the early 1980s, and was mainly carried out by a team of Ecole des Mines de Paris and INRIA led by Gérard Berry in France. Current compilers take Esterel programs and generate C code or hardware (RTL) implementations (VHDL or Verilog).
The language is still under development, with several compilers out. The commercial version of Esterel is the development environment Esterel Studio. The company that commercialize it (Synfora) initiated a normalization process with the IEEE in April 2007 however the working group (P1778) dissolved March 2011. The reference manual is publicly available.
The Multiform Notion of Time
The notion of time used in Esterel differs from that of non-synchronous languages in the following way: The notion of physical time is replaced with the notion of order. Only the simultaneity and precedence of events are considered. This means that the physical time does not play any special role. This is called multiform notion of time. An Esterel program describes a totally ordered sequence of logical instants. At each instant, an arbitrary number of events occur (including 0). Event occurrences that happen at the same logical instant are considered simultaneous. Other events are ordered as their instances of occurrences. There are two types of statements: Those that take zero time (execute and terminate in the same instant) and those that delay for a prescribed number of cycles.
Signals
Signals are the only means of communication. There are valued and non-valued signals. They are further categorized as being input, output, or local signals. A signal has the property of being either present or absent in an instant. Valued signals also contain a value. Signals are broadcast across the program, and that means any process can read or write a signal. The value of a valued signal can be determined in any instant, even if the signal is absent. The default status of a signal is absent. Signals remain absent until they are explicitly set to present using the emit statement.
Communication is instantaneous, that means that a signal emitted in a cycle is visible immediately. Note that one can communicate back and forth in the same cycle.
Signal Coherence rules
Each signal is only present or absent in a cycle, never both.
All writers run before any readers do.
Thus
present A else
emit A
end
is an erroneous program, since the writer "emit A" shall run before the reader "present A", whereas this program requires "present A" to be performed first.
The language statements
Primitive Esterel statements
Pure Esterel has eleven primitive statements.
Derived Esterel statements
Esterel has several derived constructions:
Other E |
https://en.wikipedia.org/wiki/Radical%20Routes | Radical Routes is a UK-based network of housing co-ops. The organisation supports new and established co-ops through loan finance, training workshops, practical support, and national gatherings.
History
Radical Routes emerged in 1986 from a network of people in London and Hull who wanted to develop workers' co-operatives. The network agreed its common aims and adopted the name Radical Routes in 1988, and became incorporated as Radical Routes Limited in 1992. In 1998 Rootstock Limited was incorporated as an investment scheme supporting Radical Routes co-operatives. The original house in Hockley was set up as the 'New Education Housing Co-op'.
According to Rootstock, between 1991 and 2012 Radical Routes made over sixty loans to member co-ops – totaling over £1m – with no co-operatives defaulting on loan payments. These loans have typically been used by member housing co-ops, in addition to finance from traditional lenders, to buy property.
Work
Radical Routes provides small loans (up to about £50,000) to member co-operatives. Decisions on making loans are made collectively by other member co-operatives, this has been described as "peer-group loan appraisal".
Radical Routes publishes booklets on subjects such as How to set up a Housing Co-operative and How to set up a Worker Co-operative.
With Cooperatives UK they launched proposals for an independent co-operative regulator after the government announced that it would be abolishing the FSA. Previously the FSA had regulated co-operatives, which were registered as industrial and provident societies.
Radical Routes is developing a ‘co-op cluster’ model for co-op housing with groups of housing co-ops combining their assets to buy new properties outright, eliminating mortgage interest.
Membership
Member co-operatives are expected to commit to a share of Radical Routes' workload as volunteers, and work toward radical social change.
The organisation has 36 members: 32 housing co-ops and 4 worker co-ops.
Limitations
A 2014 round table report by Radical Routes and Friends Provident Foundation identified carpet bagging, among other things, as a systemic weakness within the existing housing co-op framework. 'Carpet bagging' refers to established co-ops significantly reducing their rents or, rarely, selling their property for private gain. The report explores ways in which the systematic weaknesses might be addressed, mentioning the Mietshäuser Syndikat model as having provably solved the carpet bagging issue.
See also
Mietshäuser Syndikat
Triodos Bank
References
External links
Official website
Cooperative federations
Co-operatives in the United Kingdom
1992 establishments in the United Kingdom
Organizations established in 1992
Companies based in the London Borough of Haringey |
https://en.wikipedia.org/wiki/Olivier%20Danvy | Olivier Danvy is a French computer scientist specializing in programming languages, partial evaluation, and continuations. He is a professor at Yale-NUS College in Singapore.
Danvy received his PhD degree from the Université Paris VI in 1986.
He is notable for the number of scientific papers which acknowledge his help. Writing in Nature, editor Declan Butler reports on an analysis of acknowledgments on nearly one third of a million scientific papers and reports that Danvy is "the most thanked person in computer science".
Danvy himself is quoted as being "stunned to find my name at the top of the list", ascribing his position to a "series of coincidences": he is multidisciplinary, is well travelled, is part of an international PhD programme, is a networker, and belongs to a university department with a long tradition of having many international visitors.
References
External links
Home page
About AU: Olivier Danvy – Professor
AU Home page
Year of birth missing (living people)
Living people
Pierre and Marie Curie University alumni
French computer scientists
French expatriates in Denmark
Danish computer scientists
Programming language researchers
Academic staff of Aarhus University |
https://en.wikipedia.org/wiki/LHCb%20experiment | The LHCb (Large Hadron Collider beauty) experiment is a particle physics detector experiment collecting data at the Large Hadron Collider at CERN. LHCb is a specialized b-physics experiment, designed primarily to measure the parameters of CP violation in the interactions of b-hadrons (heavy particles containing a bottom quark). Such studies can help to explain the matter-antimatter asymmetry of the Universe. The detector is also able to perform measurements of production cross sections, exotic hadron spectroscopy, charm physics and electroweak physics in the forward region. The LHCb collaboration, who built, operate and analyse data from the experiment, is composed of approximately 1260 people from 74 scientific institutes, representing 16 countries. Chris Parkes succeeded on July 1, 2020 as spokesperson for the collaboration from Giovanni Passaleva (spokesperson 2017-2020). The experiment is located at point 8 on the LHC tunnel close to Ferney-Voltaire, France just over the border from Geneva. The (small) MoEDAL experiment shares the same cavern.
Physics goals
The experiment has wide physics program covering many important aspects of heavy flavour (both beauty and charm), electroweak and quantum chromodynamics (QCD) physics. Six key measurements have been identified involving B mesons. These are described in a roadmap document that formed the core physics programme for the first high energy LHC running in 2010–2012. They include:
Measuring the branching ratio of the rare Bs → μ+ μ− decay.
Measuring the forward-backward asymmetry of the muon pair in the flavour-changing neutral current Bd → K* μ+ μ− decay. Such a flavour changing neutral current cannot occur at tree-level in the Standard Model of Particle Physics, and only occurs through box and loop Feynman diagrams; properties of the decay can be strongly modified by new physics.
Measuring the CP violating phase in the decay Bs → J/ψ φ, caused by interference between the decays with and without Bs oscillations. This phase is one of the CP observables with the smallest theoretical uncertainty in the Standard Model, and can be significantly modified by new physics.
Measuring properties of radiative B decays, i.e. B meson decays with photons in the final states. Specifically, these are again flavour-changing neutral current decays.
Tree-level determination of the unitarity triangle angle γ.
Charmless charged two-body B decays.
The LHCb detector
The fact that the two b-hadrons are predominantly produced in the same forward cone is exploited in the layout of the LHCb detector. The LHCb detector is a single arm forward spectrometer with a polar angular coverage from 10 to 300 milliradians (mrad) in the horizontal and 250 mrad in the vertical plane. The asymmetry between the horizontal and vertical plane is determined by a large dipole magnet with the main field component in the vertical direction.
Subsystems
The Vertex Locator (VELO) is built around the proton interaction region. It is us |
https://en.wikipedia.org/wiki/Fat%20Man%20and%20Little%20Boy%20%28The%20Simpsons%29 | "Fat Man and Little Boy" is the fifth episode of the sixteenth season of the American animated television series The Simpsons. It originally aired on the Fox network in the United States on December 12, 2004.
The episode was directed by Mike B. Anderson and written by Joel H. Cohen.
Plot
After losing his last baby tooth, Bart does not enjoy playing with his toys anymore and feels that he is maturing. To get out of his depression and express his emotions, Bart writes sarcastic and insulting phrases on his T-shirts. The shirts make him popular in town, and Bart sets up a stand in front of his house selling them. His business is shut down for not having a vending license, and he goes to a retailer's convention to obtain one. While leaving, he meets Goose Gladwell, a Willy Wonka-type salesman who sells joke products. Bart agrees to sell his shirts at Gladwell's store, making him the primary source of income in the family after Homer quits his job.
Fearing that Bart has replaced him, Homer decides to nurture Lisa. They quickly bond, and Homer sees her entry for the science fair: a history of nuclear physics and a scale model of the first nuclear reactor. However, Martin shows them his project, a childlike robot. Homer helps Lisa ensure her project's victory by stealing plutonium from the power plant and using it to make her reactor fully operational. Meanwhile, Bart learns that Gladwell has sold the rights to the shirts under a contract that allows him to stop paying Bart. Homer stands up for Bart by threatening to detonate his nuclear reactor and destroy Gladwell's store. Gladwell accepts defeat, giving Bart and Homer all the money he has. As they leave, Bart thanks Homer for straightening things out.
Cultural references
The title of the episode references the atomic bombings of Hiroshima and Nagasaki: "Fat Man" is the name of the bomb dropped on Nagasaki, and "Little Boy" was the one dropped on Hiroshima. At the start of the episode, Lisa and Janey sing "Miss Susie." Bart finds that the Tooth Fairy has donated in his name to the United Way of America, rather than giving him a quarter. The toys that Bart disposes of are based on Spirograph, Etch A Sketch, Hungry Hungry Hippos, Monopoly, Parcheesi, Silly Putty, and Rock 'Em Sock 'Em Robots. He gives his toys a Viking funeral, and the Sea Captain quotes Robert Frost's poem "Nothing Gold Can Stay". Marge and Homer list "support our troops" and "Keep On Truckin'" as examples of T-shirt slogans. Moe asks if Bart has any T-shirts with "Calvin peeing on Hobbes." This references the newspaper comic Calvin and Hobbes, and a series of bootleg stickers depicting Calvin urinating on various logos and symbols. The designs on Krusty's T-shirt line include Itchy dressed as Austin Powers, SpongeBob SquarePants, and a Confederate, and Scratchy modeled after Osama bin Laden. Lisa's model of science history contains displays of scientists Marie Curie, Wilhelm Röntgen, and Albert Einstein. Goose Gladwell looks simil |
https://en.wikipedia.org/wiki/MSQL | Mini SQL (abbreviated mSQL) is a lightweight database management system from Hughes Technologies.
History
In 1993–94 David Hughes developed a network monitoring and management system called Minerva. The design of this system required a database management system to store its configuration and working data. To enable future portability, Hughes elected to use a Structured Query Language interface between the application and the database management system, despite the fact that at the time there was no free or inexpensive SQL database management implementation available. Hughes therefore developed a translation program which provided an SQL interface to the free Postgres DBMS (which did not use SQL). This product was named miniSQL, or mSQL. In time it became clear that Postgres did not perform adequately on the low-specification systems used to run Minerva, so mSQL developed into a lightweight database management system in its own right, implementing a limited subset of the SQL standard, but performing well on minimally specified hardware.
mSQL was the first low-cost SQL-based database management system. Combined with the free Linux operating system, the availability of relatively powerful low-cost PC hardware, and the development of World Wide Web standards and technologies, mSQL was an important factor in the early development of interactive, dynamic web applications, particularly in the period 1994–1997, after which it was increasingly supplanted by the more highly featured MySQL. mSQL had a large and widespread install base by the late 1990s.
License
Despite being offered in source code form, and being strongly associated with open source software, mSQL itself has never been offered under an open source license.
mSQL is provided free for non-commercial use. A typical license for commercial use in 1997 would cost $170, compared to a "five-digit purchase price" for its full-featured competitors.
Current status
By 1996, development on mSQL began to stagnate and MySQL arose to fill that void. By 1999, MySQL had surpassed mSQL in popularity and today mSQL has less visibility. At this time the database system is more often licensed by other companies for use in their products than used by end-users directly. mSQL is actively maintained and developed primarily to support its licensees and internal use within Hughes Technologies products and projects. It is still provided under a license that allows its use free of charge for non-commercial, educational and charitable activities. mSQL 4.4 was released in October 2021.
Host languages
mSQL originally supported several host languages:
C, included with the software
Perl
Java via mSQL-JDBC
Delphi
Tcl
PHP
See also
List of relational database management systems
Comparison of relational database management systems
References
External links
Proprietary database management systems
1993 software |
https://en.wikipedia.org/wiki/Drew%20Gooden | Andrew Melvin Gooden III (born September 24, 1981) is an American former professional basketball player who is currently a broadcaster for Monumental Sports Network. The power forward played 14 seasons in the National Basketball Association (NBA). Gooden played college basketball for the Kansas Jayhawks, where he was a consensus first-team All-American in 2002. He earned NBA All-Rookie First Team honors with the Memphis Grizzlies after they selected him in the first round of the 2002 NBA draft with the fourth overall pick.
High school career
As a senior at El Cerrito High School, Gooden led his Gauchos to the 1999 California Interscholastic Federation Boys' Division III championship game. Washington Union High School (led by future NBA guard DeShawn Stevenson) won the championship game over El Cerrito HS by a score of 77–71.
College career
Gooden joined fellow freshmen Nick Collison and Kirk Hinrich for the 1999–2000 season at Kansas. Although at times, Gooden was frustrated with the way things were going his freshman year, he finally adjusted to coach Roy Williams' system.
In his freshman year, the Jayhawks went 24–10 and lost to Duke in the round of 32 during the 2000 NCAA basketball tournament. The next season, the Jayhawks went 26–7 and fell to Illinois in the 2001 NCAA basketball tournament Sweet Sixteen.
In 2002, he led the nation in rebounding and was named NABC National Player of the Year. The Jayhawks went 33–4, including 16–0 in Big 12 Conference play to win Kansas its first conference championship since 1998. The Jayhawks advanced to their first Final Four in the 2002 NCAA basketball tournament since 1993, however, they lost to the eventual national champion Maryland in the semifinal.
For being named NABC Player of the Year for 2002, Gooden's jersey (#0) was retired in 2003. The ceremony occurred at halftime of a Kansas home game with Kansas State in what would have been Gooden's senior year had he not foregone his senior year for the NBA.
Professional career
Memphis Grizzlies (2002–2003)
Gooden declared himself for the draft after his junior year. Out of Kansas, Gooden was selected as the 4th overall pick by the Memphis Grizzlies in the 2002 NBA draft.
Orlando Magic (2003–2004)
In March 2003, Gooden and Gordan Giriček were traded to the Orlando Magic for Mike Miller, Ryan Humphrey, and two draft picks.
Cleveland Cavaliers (2004–2008)
On July 23, 2004, the Cleveland Cavaliers acquired Gooden, Anderson Varejão, and Steven Hunter for Tony Battie and two second-round draft picks from the Orlando Magic via trade. On January 20, 2005, Gooden led the Cavaliers to a win over the Bucks with a career-high 33 points, including 27 in the second half.
Gooden re-signed with the Cavaliers for three more years on August 14, 2006. He agreed to a three-year, $23 million contract.
In the 2006–07 NBA season, he averaged 11.1 points per game and 8.5 rebounds per game.
Chicago Bulls (2008–2009)
On February 21, 2008, at the 2007–08 season' |
https://en.wikipedia.org/wiki/AGM-53%20Condor | In 1962, the U.S. Navy issued a requirement for a long-range high-precision air-to-surface missile. The missile, named the AGM-53A Condor, was to use a television guidance system with a data link to the launching aircraft similar to the system of the then projected AGM-62 Walleye.
Development history
Because of numerous problems in the development phase, the first flight of an XAGM-53A missile did not occur before March 1970.
On 4 February 1971, in its first live warhead test, a Condor made a direct hit on the ex-US navy destroyer escort , while tests later that year demonstrated the ability to hit targets at a range of . The AGM-53 program was cancelled in March 1976. Its long range and potentially high precision made the Condor a very powerful weapon, but it was much more expensive than contemporary tactical air-to-ground weapons. The secure data link contributed a significant portion to total missile cost, and it certainly didn't help that this link was still somewhat unreliable.
Description
The Condor was to be a long-range missile to be used for high-precision stand-off attacks. The missile was launched by the strike aircraft from a distance of up to to the general target area. When the AGM-53 approached the expected target position, the image of the TV camera in the missile's nose was transmitted back to the operator in the launching aircraft. The operator could switch between wide and narrow field-of-view images to find a suitable target.
As soon as a target for the missile had been selected, the operator could either fly the missile manually until impact, or lock the Condor on the target and rely on the missile's capability to home on the final aiming point. The Condor's linear shaped charge warhead detonated on impact.
A variant of the Condor was anticipated to carry the W73 nuclear warhead, a derivative of the B61 nuclear bomb. Details on the W73 are poorly documented, and it never entered production or service.
Operators
: The AGM-53 was cancelled before entering service.
References
Friedman, Norman (1983). US Naval Weapons. Conway Maritime Press.
Gunston, Bill (1979). The Illustrated Encyclopedia of Rockets and Missiles. Salamander Books Ltd.
Pretty, R.T; Archer, D.H.R. (eds.) (1973). Jane's Weapon Systems 1972–73. Jane's Information Group.
AGM-053
Abandoned military rocket and missile projects of the United States |
https://en.wikipedia.org/wiki/Use-define%20chain | Within computer science, a Use-Definition Chain (UD Chain) is a data structure that consists of a use, U, of a variable, and all the definitions, D, of that variable that can reach that use without any other intervening definitions. A UD Chain generally means the assignment of some value to a variable.
A counterpart of a UD Chain is a Definition-Use Chain (DU Chain), which consists of a definition, D, of a variable and all the uses, U, reachable from that definition without any other intervening definitions.
Both UD and DU chains are created by using a form of static code analysis known as data flow analysis. Knowing the use-def and def-use chains for a program or subprogram is a prerequisite for many compiler optimizations, including constant propagation and common subexpression elimination.
Purpose
Making the use-define or define-use chains is a step in liveness analysis, so that logical representations of all the variables can be identified and tracked through the code.
Consider the following snippet of code:
int x = 0; /* A */
x = x + y; /* B */
/* 1, some uses of x */
x = 35; /* C */
/* 2, some more uses of x */
Notice that x is assigned a value at three points (marked A, B, and C). However, at the point marked "1", the use-def chain for x should indicate that its current value must have come from line B (and its value at line B must have come from line A). Contrariwise, at the point marked "2", the use-def chain for x indicates that its current value must have come from line C. Since the value of the x in block 2 does not depend on any definitions in block 1 or earlier, x might as well be a different variable there; practically speaking, it is a different variable — call it x2.
int x = 0; /* A */
x = x + y; /* B */
/* 1, some uses of x */
int x2 = 35; /* C */
/* 2, some uses of x2 */
The process of splitting x into two separate variables is called live range splitting. See also static single assignment form.
Setup
The list of statements determines a strong order among statements.
Statements are labeled using the following conventions: , where i is an integer in ; and n is the number of statements in the basic block
Variables are identified in italic (e.g., v,u and t)
Every variable is assumed to have a definition in the context or scope. (In static single assignment form, use-define chains are explicit because each chain contains a single element.)
For a variable, such as v, its declaration is identified as V (italic capital letter), and for short, its declaration is identified as . In general, a declaration of a variable can be in an outer scope (e.g., a global variable).
Definition of a Variable
When a variable, v, is on the LHS of an assignment statement, such as , then is a definition of v. Every variable (v) has at least one definition by its declaration (V) (or initialization).
Use of a Variable
If variable, v, is on the RHS of statement , there is a statement, with i < j and , that it is a |
https://en.wikipedia.org/wiki/Reverse%20DNS%20lookup | In computer networks, a reverse DNS lookup or reverse DNS resolution (rDNS) is the querying technique of the Domain Name System (DNS) to determine the domain name associated with an IP address – the reverse of the usual "forward" DNS lookup of an IP address from a domain name. The process of reverse resolving of an IP address uses PTR records. rDNS involves searching domain name registry and registrar tables. The reverse DNS database of the Internet is rooted in the .arpa top-level domain.
Although the informational RFC 1912 (Section 2.1) recommends that "every Internet-reachable host should have a name" and that "for every IP address, there should be a matching PTR record," it is not an Internet Standard requirement, and not all IP addresses have a reverse entry.
Historical usage
The modern "reverse DNS lookup" should not be confused with the now-obsolete "inverse query" (IQUERY) mechanism specified in :
The IQUERY message type was always "optional" and "never achieved widespread use"; it was "permanently retired" in 2002 with the adoption of .
Implementation details
IPv4 reverse resolution
Reverse DNS lookups for IPv4 addresses use the special domain in-addr.arpa. In this domain, an IPv4 address is represented as a concatenated sequence of four decimal numbers, separated by dots, to which is appended the second level domain suffix .in-addr.arpa. The four decimal numbers are obtained by splitting the 32-bit IPv4 address into four octets and converting each octet into a decimal number. These decimal numbers are then concatenated in the order: least significant octet first (leftmost), to most significant octet last (rightmost). It is important to note that this is the reverse order to the usual dotted-decimal convention for writing IPv4 addresses in textual form.
For example, to do a reverse lookup of the IP address the PTR record for the domain name 4.4.8.8.in-addr.arpa would be looked up, and found to point to dns.google.
If the A record for dns.google in turn pointed back to then it would be said to be forward-confirmed.
Classless reverse DNS method
Historically, Internet registries and Internet service providers allocated IP addresses in blocks of 256 (for Class C) or larger octet-based blocks for classes B and A. By definition, each block fell upon an octet boundary. The structure of the reverse DNS domain was based on this definition. However, with the introduction of Classless Inter-Domain Routing, IP addresses were allocated in much smaller blocks, and hence the original design of pointer records was impractical, since autonomy of administration of smaller blocks could not be granted. RFC 2317 devised a methodology to address this problem by using CNAME records.
IPv6 reverse resolution
Reverse DNS lookups for IPv6 addresses use the special domain ip6.arpa (previously ip6.int). An IPv6 address appears as a name in this domain as a sequence of nibbles in reverse order, represented as hexadecimal digits as subdomains. For exam |
https://en.wikipedia.org/wiki/Tom%20Goes%20to%20the%20Mayor | Tom Goes to the Mayor is an American adult animated series created by Tim Heidecker and Eric Wareheim for Cartoon Network's late night programming block, Adult Swim. It premiered on November 14, 2004 and ended on September 25, 2006 with a total of thirty episodes.
History
Tom Goes to the Mayor began as a web cartoon on timanderic.com. It was popular enough to get a web sequel, in which David Cross guest stars. Bob Odenkirk noticed the show's potential, and began producing it for Adult Swim.
Adult Swim has described Tom Goes to the Mayor as "one of the most polarizing shows" they have ever had, indicating that viewers "either love it or hate it."
Overview
Tom Peters (Tim Heidecker) has just moved to Jefferton, an unpleasant, rundown town filled with strip malls and buffets. Episodes usually focus on Tom going to the mayor (Eric Wareheim), hence the title of the show, with various ideas for business and civic endeavors, and the Mayor tweaks those ideas and causes them to backfire in horrible and destructive ways, leaving Tom to answer for them.
The show features a crude but distinctive limited animation style made by taking photos of the cast with different facial expressions and body language. The photos are then filtered using the "photocopy" image filter in Adobe Photoshop, resulting in the show's unique monochromatic blue and white images resembling Ditto machine copies. There are some live-action scenes, usually on a television set within the show.
Many characters, segments, and content from Tom Goes to the Mayor have resurfaced in Tim and Eric Awesome Show, Great Job!, including the Channel 5 Married News Team, the Cinco Company, Gibbons, and even a live-action version of Tom Goes to the Mayor used as an opening for the episode "Pepperoni".
Characters
Tom Peters (Tim Heidecker) – Tom Peters (né Pickle) is a good-natured 32-year-old entrepreneur whose ideas are often turned into disasters due to continuous inept interference from the mayor. Tom comes across as weak-willed, timid and lacking in self-esteem, never calling out the mayor on his irrational behavior and allowing himself to be used and manipulated by everyone he comes into contact with. He is often taunted by his stepchildren (from wife Joy's previous marriage), not to mention the rants he receives from Joy. Tom has no apparent job (besides "local entrepreneur") and drives a Maluch that has severe emission problems. A common running gag on the show is that despite Tom's name being very simple, it is nearly always misspelled when written out, such as "Tom Petres", "Thom P. Tiers" and "Taumpy Tearrs." Another running gag to the show is Tom mispronouncing words; for example, when presenting his résumé to the Mayor, he pronounces it as "resume". He also never uses profanity and instead uses phrases like "shirt", "crickets", etc. – even going so far as to refer to a dam as a "darn". His first wife was a woman named Pat, who is now married to her husband Cal.
The Mayor (Eric War |
https://en.wikipedia.org/wiki/Lagrange%20Point%20%28video%20game%29 | is a role-playing video game developed and published by Konami for the Family Computer. The game was released exclusively in Japan on April 26, 1991. The title of the game references Lagrangian points, the five positions in space where a body of negligible mass could be placed which would then maintain its position relative to two existing massive bodies.
Lagrange Point has the distinction of being one of only two games ever released with Konami's Virtual ROM Controller VII (VRC7) sound generator integrated circuit, which allowed for a drastic improvement in the quality of the music and sound effects used in the game. The game was never localized for Western audiences, however, an unofficial English translation was released in 2014 by Aeon Genesis.
Gameplay
Plot
In the 22nd century, mankind has begun to emigrate into outer space. Three huge space colonies were constructed at a Lagrange point: the Isis Cluster; two artificial biospheres, named Land-1 and Land-2, and a satellite. In the year 0024 (55 years after the cluster was constructed), a biohazard outbreak occurred on Land 2. All attempts at contact were met with nothing but static. Now a research team led by their pilot, approaches Land-1.
Upon arrival, the team was attacked by a group of robots and the shuttle exploded due to the damage during the battle, knocking Gene out immediately after.
Gene then awakened in the medical centre of Isis City to find one of his team members fatally wounded. Said team member informs Gene that their goal was to find a researcher at Land-2's Bio Research Lab, and Gene sets off to find him, wherever he is in Land-2.
Development and release
Reception
Notes
References
External links
Lagrange Point at GameFAQs
Lagrange Point at MobyGames
1991 video games
Japan-exclusive video games
Konami games
Nintendo Entertainment System games
Nintendo Entertainment System-only games
Science fiction video games
Video games scored by Aki Hata
Video games developed in Japan |
https://en.wikipedia.org/wiki/MEX%20%28windowing%20system%29 | MEX (Multiple EXposure) was a windowing system created by Silicon Graphics, used on 68k-based IRIS systems and early IRIS 4D systems. MEX was originally loaded over a network through the utilization of GL1 routines kept on a remote host machine, usually a VAX. When the IRIS 1400 workstation and GL2-W (IRIX) were introduced, MEX was allowed to run locally. MEX was used in IRIX from the GL2-W2.1.0 release to the 4D1-2.3 release.
With the introduction of 4D1-3.0 (IRIX 3.0), and the complete migration to MIPS processors, support for the GL / GL2 powered MEX ended in the late 1980s, replaced by Sun Microsystems' NeWS and the 4Sight window manager.
References
Computer-related introductions in 1985
Windowing systems
SGI graphics |
https://en.wikipedia.org/wiki/Gigapackets | Gigapackets are billions (109) of packets or datagrams. The packet is the fundamental unit of information in computer networks.
Data transfer rates in gigapackets per second are associated with high speed networks, especially fiber optic networks. The bit rates that are used to create gigapackets are in the range of gigabits per second. These rates are seen in network speeds of gigabit Ethernet or 10 Gigabit Ethernet and SONET Optical Carrier rates of OC-48 at 2.5 Gbit/s and OC-192 at 10 Gbit/s.
References
Packets (information technology)
Units of information |
https://en.wikipedia.org/wiki/CBC%20Television | CBC Television (also known as CBC TV) is a Canadian English-language broadcast television network owned by the Canadian Broadcasting Corporation, the national public broadcaster. The network began operations on September 6, 1952. Its French-language counterpart is ICI Radio-Canada Télé.
With main studios at the Canadian Broadcasting Centre in Toronto, CBC Television is available throughout Canada on over-the-air television stations in urban centres, and as a must-carry station on cable and satellite television providers. CBC Television can also be live streamed on its CBC Gem video platform. Almost all of the CBC's programming is produced in Canada. Although CBC Television is supported by public funding, commercial advertising revenue supplements the network, in contrast to CBC Radio and public broadcasters from several other countries, which are commercial-free.
Overview
CBC Television provides a complete 24-hour network schedule of news, sports, entertainment, and children's programming; in most cases, it feeds the same programming at the exact local times nationwide, except to the Newfoundland Time Zone, where programs air 30 minutes "late".
On October 9, 2006, at 6:00 a.m., the network switched to a 24-hour schedule, becoming one of the last major English-language broadcasters to transition to such a schedule. Most CBC-owned stations previously signed off the air during the early morning hours (typically from 1:00 a.m. to 6:00 a.m.).
Instead of the infomercials aired by most private stations, or a simulcast of CBC News Network in the style of BBC One's nightly simulcast of BBC News Channel, the CBC uses the time to air repeats, including local news, primetime series, films and other programming from the CBC library.
Its French counterpart, ICI Radio-Canada Télé, which continued to sign off every night for several years after that, now broadcasts a simulcast of its sister news network Ici RDI after regular programming ends for the night until the next programming day begins.
While historically there has been room for regional differences in the schedule, as there is today (see "Stations", below), for CBC-owned stations, funding has decreased to the point that most of these stations no longer broadcast any significant local programming beyond local newscasts and an edition of the summer regional documentary series Absolutely Canadian.
Until 1998, the network carried a variety of American programs in addition to its core Canadian programming, directly competing with private Canadian broadcasters such as CTV and Global. Since then, it has restricted itself to Canadian programs, a handful of British programs, and a few American films and off-network repeats. Since this change, the CBC has sometimes struggled to maintain ratings comparable to those it achieved before 1995, although it has seen somewhat of a ratings resurgence in recent years. In the 2007–08 season, popular series such as Little Mosque on the Prairie and The Border helped t |
https://en.wikipedia.org/wiki/D-VHS | D-VHS is a digital video recording format developed by JVC, in collaboration with Hitachi, Matsushita, and Philips. The "D" in D-VHS originally stood for "Data", but JVC renamed the format as "Digital VHS". Released in December of 1997, it uses the same physical cassette format and recording mechanism as S-VHS, but requires higher-quality and more expensive tapes and is capable of recording and displaying both standard-definition and high-definition content. The content data format is in MPEG transport stream, the same data format used for most digital television applications. It used MPEG-2 encoding and was standarized as IEC 60774-5.
Design
As a final effort for VHS, the D-VHS system had significant advantages as a highly versatile domestic recorder (the other tape-based formats are DV and Digital8, which never gained any traction except as camcorder media), but given the wholesale move to DVD and then hard disk drive (HDD) recording, the format failed to make any headway into the video market.
Existing tape media is bulky and more expensive than hard drives. Although cable companies are gradually switching to the H.264 codec, this should not be an issue for D-VHS units since they can act purely as data stores (like a hard drive but using tape instead), and thereby pass the previously recorded H.264 data directly to the Set-top Box or TV (via i.Link/FireWire). Another alternative is a lengthy transfer to a computer for viewing. Finally, since machines are no longer manufactured, maintenance of current recorders may prove difficult.
D-VHS's primary advantage is that it is still the best way to archive encrypted high definition material from cable programming in the US. Cable, satellite companies, TiVo, and PCs equipped with cable card tuners all offered high-definition digital video recorders, but archival has proven to be an obstacle, as proprietary boxes have restrictions on moving encrypted content. Outside of D-VHS, only HD capture devices that use an analog conversion process, such as the Hauppauge HD PVR, have enabled removal of encrypted content off many of the above proprietary boxes. This uses an analog conversion process, producing slightly degraded but still high definition grade recordings. D-VHS, on the other hand, does not need to take advantage of this so-called "analog hole", since D-VHS makes a pure bit-for-bit recording with no conversion necessary. This is made possible by compliance with CCI flag values carried by the digital streams, wherein only D-VHS is allowed to digitally move recordings of content originally flagged as Copy Once off of a DVR device and onto a D-VHS tape. This programming that complies with the CCI flags then marks such material on the tape such that no second generation copies can be made from the tape itself, though additional copies can still be made directly from the original DVR unit to additional tapes.
Monthly rental fees to cable, TiVo, and satellite were also less with D-VHS.
The only |
https://en.wikipedia.org/wiki/Matt%20Blaze | Matt Blaze is an American researcher who focuses on the areas of secure systems, cryptography, and trust management. He is currently the McDevitt Chair of Computer Science and Law at Georgetown University, and is on the board of directors of the Tor Project.
Work
Blaze received his PhD in computer science from Princeton University.
In 1992, while working for AT&T, Blaze implemented a strong cryptographic package known as "CFS", the Cryptographic File System, for Unix, since ported to Linux. CFS uses Network File System as its transport mechanism, allowing users to encrypt selected directory hierarchies, but mount them unencrypted after providing the key. In November, 1993, he presented a paper on this project, "A Cryptographic File System for Unix", at the 1st ACM Conference on Computer and Communications Security. Blaze also published a paper "Key Management in an Encrypting File System", in the Proceedings USENIX Summer 1994 Technical Conference.
In the early 1990s, at the height of the "crypto war", Blaze was a participant in the Cypherpunks mailing list and in 1994, he found a critical weakness in the wiretapping mechanisms of the Clipper chip.
His paper, Protocol Failure in the Escrowed Encryption Standard, pointed out that the Clipper's escrow system had a serious vulnerability: a brute-force attack could allow the Clipper chip to be used as an encryption device, while disabling the key escrow capability. Later during this time, he was one of the authors of a seminal paper on calculating secure key lengths.
After leaving Bell, Blaze was an associate professor of computer and information science at the University of Pennsylvania from 2004 to 2018. Blaze has noted a long-term conflict with the university's locksmith over his master key & safecracking publications. He then joined the faculty at Georgetown University, on a joint appointment at Georgetown Law and the department of computer science.
In 2015, Blaze was part of a team of proponents that included Steven M. Bellovin, J. Alex Halderman, Nadia Heninger, and Andrea M. Matwyshyn who successfully proposed a security research exemption to Section 1201 of the Digital Millennium Copyright Act.
In July 2016, the complete board of the Tor Project resigned and announced a new board, including Matt Blaze.
In 2018, crypto Visa card company Monaco paid Blaze an undisclosed amount for the rights to the domain Crypto.com. Blaze had registered the domain in 1993 and sellers have estimated that the value of the domain was US$5–10 million.
Education
Ph.D., Computer Science, January 1993. Princeton University. (Dissertation: Caching in Large-Scale Distributed File Systems)
M.A., Computer Science, June 1989. Princeton University
M.S., Computer Science, May 1988. Columbia University
B.S., January 1986. City University of New York (Hunter College)
Publications
Ioannidis, John; Blaze, Matt. The Architecture and Implementation of Network-Layer Security Under Unix, in Proc. of the 4th USENIX Securit |
https://en.wikipedia.org/wiki/Air%20Niugini | Air Niugini Limited is the national airline of Papua New Guinea, based in Air Niugini House on the property of Port Moresby International Airport, Port Moresby. It operates a domestic network from Port Moresby to 12 major airports while its subsidiary company, Link PNG, operates routes to minor airports. It also operates international services in Asia, Oceania, and Australia on a weekly basis. Its main base is Port Moresby International Airport, which is located in 7 Mile, Port Moresby, Papua New Guinea. Niugini is the Tok Pisin word for New Guinea.
History
The airline was established in November 1973 as the national airline of Papua New Guinea with the government holding 60% of the shares, Ansett (16%), Qantas (12%) and Trans Australia Airlines (TAA) (12%). It started as an exclusively domestic carrier; however it expanded to offer international services shortly thereafter. In founding the airline, the government aimed to encourage regional development in a country without an extensive road network. The airline was established using DC-3 and Fokker F27 aircraft.
In 1975 when PNG gained independence, pilots from the two airlines operating for the government were from Ansett Australia and Trans Australia Airlines. The majority of these pilots elected to return to these companies and continue their careers in Australia. This left a huge shortage in the pilot strength (over 95%) and consequently replacements were recruited from both Australia and New Zealand. These pilots had little or no experience in airline operations and few if any skills or experience operating in the extremely hostile environs of PNG.
Nonetheless, they were trained by the outgoing pilots from Ansett and TAA and with the first class training behind them continued to provide safe and reliable services to all of PNG. When Air Niugini took over the international routes - then operated by Qantas - once again the senior pilots were called upon to convert from basic turboprop aircraft (F27) to B707-338C 4-engine jet aircraft. Considerable alarm was expressed that these "jungle pilots" could not possibly operate large jet aircraft hitherto flown by Qantas flight crews. Again with excellent training and support from Qantas, the PX crews converted successfully to the venerable B707 and from there took over all the check and training on those two aircraft and continued thereafter to the various replacement aircraft being primarily A300-B4, A310-300, B757 and B767.
There were two crashes internally on the domestic operation with the total loss of one F28 aircraft and one DHC7, both due to pilot error. No deaths or injuries occurred in either crash.
International services commenced very early on in the history of the airline with a leased Boeing 720 from 6 February 1976 to 2 February 1977. This was later replaced with a Boeing 707 purchased from Qantas. During the late 1970s, internal services were performed by a combination of Fokker F28 jet and Fokker F27 turbo-prop aircraft. By |
https://en.wikipedia.org/wiki/First%20Cambodia%20Airlines | First Cambodia Airlines (SC: 柬埔寨第一航空) was a privately owned airline based in Cambodia. Because of financial problems, it ceased operations in 2004.
Code data
IATA Code: F6
ICAO Code: FCC
Callsign: FIRST CAMBODIA
History
The airline was established in February 2004, but ceased operations on 2 August 2004 after financial difficulties meant its aircraft had to be returned to the lessor.
Services
First Cambodia Airlines operated services from Phnom Penh to Singapore, Kuala Lumpur and Guangzhou.
Fleet
The First Cambodia Airlines fleet consisted of 1 leased Airbus A320-232 aircraft from ILFC.
External links
First Cambodia Airlines Former Fleet Detail
Defunct airlines of Cambodia
Airlines established in 2004
Airlines disestablished in 2004
Cambodian companies established in 2004 |
https://en.wikipedia.org/wiki/United%20States%20Computer%20Emergency%20Readiness%20Team | The United States Computer Emergency Readiness Team (US-CERT) is an organization within the Department of Homeland Security’s (DHS) Cybersecurity and Infrastructure Security Agency (CISA). Specifically, US-CERT is a branch of the Office of Cybersecurity and Communications' (CS&C) National Cybersecurity and Communications Integration Center (NCCIC).
US-CERT is responsible for analyzing and reducing cyber threats, vulnerabilities, disseminating cyber threat warning information, and coordinating incident response activities.
The division brings advanced network and digital media analysis expertise to bear on malicious activity targeting the networks within the United States and abroad.
Background
The concept of a national Computer Emergency Response Team (CERT) for the United States was proposed by Marcus Sachs (Auburn University) when he was a staff member for the U.S. National Security Council in 2002 to be a peer organization with other national CERTs such as AusCERT and CERT-UK, and to be located in the forthcoming Department of Homeland Security (DHS). At the time the United States did not have a national CERT. Amit Yoran (Tenable, Inc., CEO), DHS's first Director of the National Cyber Security Division, launched the United States Computer Emergency Readiness Team (US-CERT) in September 2003 to protect the Internet infrastructure of the United States by coordinating defense against and responding to cyber-attacks. The first Director of the US-CERT was Jerry Dixon (CrowdStrike, CISO); with the team initially staffed with cybersecurity experts that included Mike Witt (NASA, CISO), Brent Wrisley (Punch Cyber, CEO), Mike Geide (Punch Cyber, CTO), Lee Rock (Microsoft, SSIRP Crisis Lead), Chris Sutton (Export-Import Bank of the United States, CISO & CPO), Jay Brown (USG, Senior Exec Cyber Operations), Mark Henderson (IRS, Online Cyber Fraud), Josh Goldfarb (Security Consultant), Mike Jacobs (Treasury, Director/Chief of Operations), Rafael Nunez (DHS/CISA), Ron Dow (General Dynamics, Senior Program Mgr), Sean McAllister (Network Defense Protection, Founder), Kevin Winter (Deloitte, CISO-Americas), Todd Helfrich (Attivo, VP), Monica Maher (Goldman Sachs, VP Cyber Threat Intelligence), Reggie McKinney (VA) and several other cybersecurity experts. In January 2007, Mike Witt was selected as the US-CERT Director, who was then followed by Mischel Kwon (Mischel Kwon and Associates) in June 2008. When Mischel Kwon departed in 2009, a major reorganization occurred which created the National Cybersecurity and Communications Integration Center (NCCIC).
US-CERT is the 24-hour operational arm of the NCCIC which accepts, triages, and collaboratively responds to incidents, provides technical assistance to information system operators, and disseminates timely notifications regarding current and potential security threats, exploits, and vulnerabilities to the public via its National Cyber Awareness System (NCAS).
US-CERT operates side-by-side with the Industrial |
https://en.wikipedia.org/wiki/National%20Cyber%20Security%20Division | The National Cyber Security Division (NCSD) is a division of the Office of Cyber Security & Communications, within the United States Department of Homeland Security's Cybersecurity and Infrastructure Security Agency. Formed from the Critical Infrastructure Assurance Office, the National Infrastructure Protection Center, the Federal Computer Incident Response Center, and the National Communications System, NCSD opened on June 6, 2003. The NCSD mission is to collaborate with the private sector, government, military, and intelligence stakeholders to conduct risk assessments and mitigate vulnerabilities and threats to information technology assets and activities affecting the operation of the civilian government and private sector critical cyber infrastructures. NCSD also provides cyber threat and vulnerability analysis, early warning, and incident response assistance for public and private sector constituents. NCSD carries out the majority of DHS’ responsibilities under the Comprehensive National Cybersecurity Initiative. The FY 2011 budget request for NCSD is $378.744 million and includes 342 federal positions. The current director of the NCSD is John Streufert, former chief information security officer (CISO) for the United States Department of State, who assumed the position in January 2012.
Strategic objectives and priorities
Strategic Objectives
To protect the cyber infrastructure, NCSD has identified two overarching objectives:
To build and maintain an effective national cyberspace response system.
To implement a cyber-risk management program for protection of critical infrastructure.
Priorities
Continued development of the EINSTEIN system’s capabilities as a critical tool in protecting the Federal Executive Branch civilian departments and agencies.
Development of the National Cyber Incident Response Plan (NCIRP) in full collaboration with the private sector and other key stakeholders. NCIRP ensures that all national cybersecurity partners understand their roles in cyber incident response and are prepared to participate in a coordinated and managed process.
Increase the security of automated control systems that operate elements of the national critical infrastructure.
Organization
NCSD is funded through the following three Congressionally appropriated Programs, Projects and Activities (PPA): United States Computer Emergency Readiness Team (US-CERT), Strategic Initiatives, and Outreach and Programs:
US-CERT leverages technical competencies in federal network operations and threat analysis centers to develop knowledge and knowledge management practices. US-CERT provides a single, accountable focal point to support federal stakeholders as they make key operational and implementation decisions and secure the Federal Executive Branch civilian networks. It does so through a holistic approach that enables federal stakeholders to address cybersecurity challenges in a manner that maximizes value while minimizing risks associated with techn |
https://en.wikipedia.org/wiki/Microsoft%20Office%202003 | Microsoft Office 2003 (codenamed Office 11) is an office suite developed and distributed by Microsoft for its Windows operating system. Office 2003 was released to manufacturing on August 19, 2003, and was later released to retail on October 21, 2003, exactly two years after the release of Windows XP. It was the successor to Office XP and the predecessor to Office 2007. The Mac OS X equivalent, Microsoft Office 2004 for Mac was released on May 11, 2004.
New features in Office 2003 include information rights management; new collaboration features; improved support for SharePoint, smart tags, and XML; and extended use of Office Online services. Office 2003 introduces two new programs to the Office product lineup: InfoPath, a program for designing, filling, and submitting electronic structured data forms; and OneNote, a note-taking program for creating and organizing diagrams, graphics, handwritten notes, recorded audio, and text. It also introduces the Picture Manager graphics software to open, manage, and share digital images.
With the release of Office 2003, Microsoft rebranded the Office productivity suite as an integrated system dedicated to information workers. As a result, Microsoft appended the "Office" branding to the names of all programs. Office 2003 is also the first version with support for Windows XP colors and visual styles, and introduces updated icons. The Office logo was also updated, eliminating the puzzle motif in use since Office 95. Office 2003 is the last version of Office to include the traditional menu bar and toolbar interface across all programs, and also the last version to include the "97 - 2003" file format as the default file format.
Office 2003 is incompatible with Windows NT 4.0, Windows 98, Windows ME and earlier versions of Windows. Minimum required operating systems for Office 2003 are Windows 2000 SP3 or later, Windows XP, Windows Server 2003, Windows Vista, Windows Server 2008, Windows 7 and Windows Server 2008 R2. It is officially unsupported on Windows 8, Windows Server 2012, or later versions of Windows.
Microsoft released a total of three service packs for Office 2003 throughout its lifecycle. Service Pack 1 was released on July 27, 2004, Service Pack 2 was released on September 27, 2005, and Service Pack 3 was released on September 17, 2007. Mainstream support for Office 2003 ended on April 14, 2009, and extended support ended on April 8, 2014, the same dates that mainstream and extended support ended for Windows XP.
New features
The core applications, Word, Excel, PowerPoint, and Access, had only minor improvements from Office XP. Outlook 2003 received improved functionality in many areas, including better email and calendar sharing and information display, complete Unicode support, search folders, colored flags, Kerberos authentication, RPC over HTTP, and Cached Exchange mode. Another key benefit of Outlook 2003 was the improved junk mail filter. Tablet and pen support was introduced in the productiv |
https://en.wikipedia.org/wiki/Microsoft%20Office%20XP | Microsoft Office XP (codenamed Office 10) is an office suite which was officially revealed in July 2000 by Microsoft for the Windows operating system. Office XP was released to manufacturing on March 5, 2001, and was later made available to retail on May 31, 2001, less than five months prior to the release of Windows XP. It is the successor to Office 2000 and the predecessor of Office 2003. A Mac OS X equivalent, Microsoft Office v. X was released on November 19, 2001.
New features in Office XP include smart tags, a selection-based search feature that recognizes different types of text in a document so that users can perform additional actions; a task pane interface that consolidates popular menu bar commands on the right side of the screen to facilitate quick access to them; new document collaboration capabilities, support for MSN Groups and SharePoint; and integrated handwriting recognition and speech recognition capabilities. With Office XP, Microsoft incorporated several features to address reliability issues observed in previous versions of Office. Office XP also introduces separate Document Imaging, Document Scanning, and Clip Organizer applications. The Office Assistant (commonly known as "Clippy"), which was introduced in Office 97 and widely reviled by users, is disabled by default in Office XP; this change was a key element of Microsoft's promotional campaign for Office XP.
Office XP is incompatible with Windows 95 and earlier versions of Windows. Office XP is compatible with Windows NT 4.0 SP6 or later, Windows 98, Windows 2000, Windows Me, Windows XP, Windows Server 2003, Windows Vista, Windows Server 2008 and Windows Server 2008 R2. It is not officially supported on Windows 7 or later versions of Windows. It is the last version of Microsoft Office to support Windows NT 4.0 SP6 or later, Windows 2000 before SP3, Windows 98, and Windows Me as the following version, Microsoft Office 2003 only supports Windows 2000 SP3 or later.
Office XP received mostly positive reviews upon its release, with critics praising its collaboration features, document protection and recovery functionality, and smart tags; however, the suite's handwriting recognition and speech recognition capabilities were criticized and were mostly viewed as inferior to similar offerings from competitors. As of May 2002, over 60 million Office XP licenses had been sold.
Microsoft released three service packs for Office XP during its lifetime. Mainstream support for Office XP ended on July 11, 2006, and extended support ended on July 12, 2011.
History
At a meeting with financial analysts in July 2000, Microsoft demonstrated Office XP, then known by its codename, Office 10, which included a subset of features Microsoft designed in accordance with what at the time was known as the .NET strategy, one by which it intended to provide extensive client access to various web services and features such as speech recognition. SharePoint Portal Server 2001, then codenamed Tahoe, wa |
https://en.wikipedia.org/wiki/Nested%20function | In computer programming, a nested function (or nested procedure or subroutine) is a function which is defined within another function, the enclosing function. Due to simple recursive scope rules, a nested function is itself invisible outside of its immediately enclosing function, but can see (access) all local objects (data, functions, types, etc.) of its immediately enclosing function as well as of any function(s) which, in turn, encloses that function. The nesting is theoretically possible to unlimited depth, although only a few levels are normally used in practical programs.
Nested functions are used in many approaches to structured programming, including early ones, such as ALGOL, Simula 67 and Pascal, and also in many modern dynamic languages and functional languages. However, they are traditionally not supported in the (originally simple) C-family of languages.
Effects
Nested functions assume function scope or block scope. The scope of a nested function is inside the enclosing function, i.e. inside one of the constituent blocks of that function, which means that it is invisible outside that block and also outside the enclosing function. A nested function can access other local functions, variables, constants, types, classes, etc. that are in the same scope, or in any enclosing scope, without explicit parameter passing, which greatly simplifies passing data into and out of the nested function. This is typically allowed for both reading and writing.
Nested functions may in certain situations (and languages) lead to the creation of a closure. If it is possible for the nested function to escape the enclosing function, for example if functions are first class objects and a nested function is passed to another function or returned from the enclosing function, then a closure is created and calls to this function can access the environment of the original function. The frame of the immediately enclosing function must continue to be alive until the last referencing closure dies and non-local automatic variables referenced in closures can therefore not be stack allocated. This is known as the funarg problem and is a key reason why nested functions was not implemented in some simpler languages as it significantly complicates code generation and analysis, especially when functions are nested to various levels, sharing different parts of their environment.
Examples
An example using Pascal syntax (with ALGOL, Modula 2, Oberon, Ada, etc. similar):
function E(x: real): real;
function F(y: real): real;
begin
F := x + y
end;
begin
E := F(3) + F(4)
end;
The function F is nested within E. Note that E's parameter x is visible also in F (as F is a part of E) while both x and y are invisible outside E and F respectively.
Similarly, in Standard ML:
fun e (x : real) =
let
fun f y = x+y
in
f 3 + f 4
end;
One way to write the same example in Haskell syntax:
e :: Float -> Float
e x = f 3 + f 4 where f y = x + y
The same e |
https://en.wikipedia.org/wiki/CableCARD | CableCARD is a special-use PC Card device that allows consumers in the United States to view and record digital cable television channels on digital video recorders, personal computers and television sets on equipment such as a set-top box not provided by a cable television company. The card is usually provided by the local cable operator, typically for a nominal monthly fee.
In a broader context, CableCARD refers to a set of technologies created by the United States cable television industry to allow devices from non-cable companies to access content on the cable networks. Some technologies not only refer to the physical card, but also to a device ("Host") that uses the card. Some CableCARD technologies can be used with devices that have no physical CableCARD.
The CableCARD was the outcome of a U.S. federal government objective, directed in the Telecommunications Act of 1996, to provide a robust competitive retail market for set-top boxes so consumers did not have to use proprietary equipment from the cable operators. It was believed that this would provide consumers with more choices and lower costs.
A 2020 FCC decision removed the requirement for cable companies to provide CableCARDs, but they are still required to provide consumer access options via "separable security".
Background
The portion of the Telecommunications Act of 1996 which resulted in the creation of CableCARDs is known as Section 629, instructing the Federal Communications Commission (FCC) to:
Multichannel video programming refers to cable or satellite television. A driving motivation of this passage was to foster the kind of consumer choices that resulted after the Federal government landmark Carterfone ruling requiring telephone companies to allow consumers to purchase third-party telephones for attachment to the phone company network. The thought was that consumers would benefit from wider choices due to competition between consumer electronics (CE) manufacturers unaffiliated with cable companies.
The FCC was charged with working with the industry to carry out the directives of the 1996 law. On June 11, 1998, after securing proposals and recommendations from interested parties, the FCC ordered that cable companies would provide a separable security access device by July 1, 2000, which could be used by third-party devices to access digital cable networks. The separable security device was referred to in FCC regulations as a "Point of Deployment" (POD) module. After many requests for delay from the cable industry, the first CableCARD devices became available from third-party manufacturers in August 2004.
As of November 1, 2011, all US cable operators were required to allow self-installation of CableCARDs by consumers.
Integration ban
A major concern was that cable operators were not motivated to provide efficient security access mechanisms to equipment competitors. To address this, the FCC directed that by January 1, 2005, that cable operators must use the same separa |
https://en.wikipedia.org/wiki/Scores | Scores may refer to:
Scores New York, a strip club in New York
Scores (album), a 2004 album by Barry Manilow
Scores, an album by Welsh band Hybrid
Scores (computer virus), a computer virus affecting Macintosh computers
Scores (restaurant), a restaurant chain in Canada
Scores on the doors, a term for published and displayed food hygiene results
The Scores, a neighbourhood in St Andrews, Scotland
See also
SCORE (disambiguation)
Score (disambiguation)
The Score (disambiguation) |
https://en.wikipedia.org/wiki/Tries | Tries may refer to the plural form of:
Try (rugby)
Try, a conversion (gridiron football)
Trie, a prefix tree in computer science |
https://en.wikipedia.org/wiki/Computer-assisted%20telephone%20interviewing | Computer-assisted telephone interviewing (CATI) is a telephone surveying technique in which the interviewer follows a script provided by a software application. It is a structured system of microdata collection by telephone that speeds up the collection and editing of microdata and also permits the interviewer to educate the respondents on the importance of timely and accurate data. The software is able to customize the flow of the questionnaire based on the answers provided, as well as information already known about the participant. It is used in B2B services and corporate sales.
CATI may function in the following manner:
A computerized questionnaire is administered to respondents over the telephone.
The interviewer sits in front of a computer screen.
Upon command, the computer dials the telephone number to be called.
When contact is made, the interviewer reads the questions posed on the computer screen and records the respondent's answers directly into the computer.
Interim and update reports can be compiled instantaneously, as the data are being collected.
CATI software has built-in logic, which also enhances data accuracy.
The program will personalize questions and control for logically incorrect answers, such as percentage answers that do not add up to 100 percent.
The software has built-in branching logic, which will skip questions that are not applicable or will probe for more detail when warranted.
Automated dialers are usually deployed to lower the waiting time for the interviewer, as well as to record the interview for quality purposes.
Automated computer telephone interviewing
Automated computer telephone interviewing (ACTI) is a technique by which a computer with speaker-independent voice recognition capabilities asks respondents a series of questions, recognizes then stores the answers, and is able to follow scripted logic and branch intelligently according to the flow of the questionnaire based on the answers provided, as well as information known about the participant. This technique is also referred to as interactive voice response (IVR).
See also
Computer-assisted personal interviewing
Computer-assisted web interviewing
Random digit dialling
References
Marketing Research. School of Business & Accountancy, Ngee Ann Polytechnic. Jonas Lee. Pearson.
Speaker recognition
Survey methodology |
https://en.wikipedia.org/wiki/Phase%20correlation | Phase correlation is an approach to estimate the relative translative offset between two similar images (digital image correlation) or other data sets. It is commonly used in image registration and relies on a frequency-domain representation of the data, usually calculated by fast Fourier transforms. The term is applied particularly to a subset of cross-correlation techniques that isolate the phase information from the Fourier-space representation of the cross-correlogram.
Example
The following image demonstrates the usage of phase correlation to determine relative translative movement between two images corrupted by independent Gaussian noise. The image was translated by (30,33) pixels. Accordingly, one can clearly see a peak in the phase-correlation representation at approximately (30,33).
Method
Given two input images and :
Apply a window function (e.g., a Hamming window) on both images to reduce edge effects (this may be optional depending on the image characteristics). Then, calculate the discrete 2D Fourier transform of both images.
Calculate the cross-power spectrum by taking the complex conjugate of the second result, multiplying the Fourier transforms together elementwise, and normalizing this product elementwise.
Where is the Hadamard product (entry-wise product) and the absolute values are taken entry-wise as well. Written out entry-wise for element index :
Obtain the normalized cross-correlation by applying the inverse Fourier transform.
Determine the location of the peak in .
Commonly, interpolation methods are used to estimate the peak location in the cross-correlogram to non-integer values, despite the fact that the data are discrete, and this procedure is often termed 'subpixel registration'. A large variety of subpixel interpolation methods are given in the technical literature. Common peak interpolation methods such as parabolic interpolation have been used, and the OpenCV computer vision package uses a centroid-based method, though these generally have inferior accuracy compared to more sophisticated methods.
Because the Fourier representation of the data has already been computed, it is especially convenient to use the Fourier shift theorem with real-valued (sub-integer) shifts for this purpose, which essentially interpolates using the sinusoidal basis functions of the Fourier transform. An especially popular FT-based estimator is given by Foroosh et al. In this method, the subpixel peak location is approximated by a simple formula involving peak pixel value and the values of its nearest neighbors, where is the peak value and is the nearest neighbor in the x direction (assuming, as in most approaches, that the integer shift has already been found and the comparand images differ only by a subpixel shift).
The Foroosh et al. method is quite fast compared to most methods, though it is not always the most accurate. Some methods shift the peak in Fourier space and apply non-linear optimization to maximize the correl |
https://en.wikipedia.org/wiki/2%E2%80%933%E2%80%934%20tree | In computer science, a 2–3–4 tree (also called a 2–4 tree) is a self-balancing data structure that can be used to implement dictionaries. The numbers mean a tree where every node with children (internal node) has either two, three, or four child nodes:
a 2-node has one data element, and if internal has two child nodes;
a 3-node has two data elements, and if internal has three child nodes;
a 4-node has three data elements, and if internal has four child nodes;
2–3–4 trees are B-trees of order 4; like B-trees in general, they can search, insert and delete in O(log n) time. One property of a 2–3–4 tree is that all external nodes are at the same depth.
2–3–4 trees are isomorphic to red–black trees, meaning that they are equivalent data structures. In other words, for every 2–3–4 tree, there exists at least one and at most one red–black tree with data elements in the same order. Moreover, insertion and deletion operations on 2–3–4 trees that cause node expansions, splits and merges are equivalent to the color-flipping and rotations in red–black trees. Introductions to red–black trees usually introduce 2–3–4 trees first, because they are conceptually simpler. 2–3–4 trees, however, can be difficult to implement in most programming languages because of the large number of special cases involved in operations on the tree. Red–black trees are simpler to implement, so tend to be used instead.
Properties
Every node (leaf or internal) is a 2-node, 3-node or a 4-node, and holds one, two, or three data elements, respectively.
All leaves are at the same depth (the bottom level).
All data is kept in sorted order.
Insertion
To insert a value, we start at the root of the 2–3–4 tree:
If the current node is a 4-node:
Remove and save the middle value to get a 3-node.
Split the remaining 3-node up into a pair of 2-nodes (the now missing middle value is handled in the next step).
If this is the root node (which thus has no parent):
the middle value becomes the new root 2-node and the tree height increases by 1. Ascend into the root.
Otherwise, push the middle value up into the parent node. Ascend into the parent node.
Find the child whose interval contains the value to be inserted.
If that child is a leaf, insert the value into the child node and finish.
Otherwise, descend into the child and repeat from step 1.
Example
To insert the value "25" into this 2–3–4 tree:
Begin at the root (10, 20) and descend towards the rightmost child (22, 24, 29). (Its interval (20, ∞) contains 25.)
Node (22, 24, 29) is a 4-node, so its middle element 24 is pushed up into the parent node.
The remaining 3-node (22, 29) is split into a pair of 2-nodes (22) and (29). Ascend back into the new parent (10, 20, 24).
Descend towards the rightmost child (29). (Its interval (24, ∞) contains 25.)
Node (29) has no leftmost child. (The child for interval (24, 29) is empty.) Stop here and insert value 25 into this node.
Deletion
The simplest possibility to delet |
https://en.wikipedia.org/wiki/Internet%20Server%20Application%20Programming%20Interface | The Internet Server Application Programming Interface (ISAPI) is an n-tier API of Internet Information Services (IIS), Microsoft's collection of Windows-based web server services. The most prominent application of IIS and ISAPI is Microsoft's web server.
The ISAPI has also been implemented by Apache's module so that server-side web applications written for Microsoft's IIS can be used with Apache. Other third-party web servers like Zeus Web Server offer ISAPI interfaces, too.
Microsoft's web server application software is called Internet Information Services, which is made up of a number of "sub-applications" and is very configurable. ASP.NET is one such slice of IIS, allowing a programmer to write web applications in their choice of programming language (VB.NET, C#, F#) that's supported by the Microsoft .NET CLR. ISAPI is a much lower-level programming system, giving much better performance, at the expense of simplicity.
ISAPI applications
ISAPI consists of two components: Extensions and Filters. These are the only two types of applications that can be developed using ISAPI. Both Filters and Extensions must be compiled into DLL files which are then registered with IIS to be run on the web server.
ISAPI applications can be written using any language which allows the export of standard C functions, for instance C, C++, Delphi. There are a couple of libraries available which help to ease the development of ISAPI applications, and in Delphi Pascal the Intraweb components for web-application development. MFC includes classes for developing ISAPI applications. Additionally, there is the ATL Server technology which includes a C++ library dedicated to developing ISAPI applications.
Extensions
ISAPI Extensions are true applications that run on IIS. They have access to all of the functionality provided by IIS. ISAPI extensions are implemented as DLLs that are loaded into a process that is controlled by IIS. Clients can access ISAPI extensions in the same way they access a static HTML page. Certain file extensions or a complete folder or site can be mapped to be handled by an ISAPI extension.
Filters
ISAPI filters are used to modify or enhance the functionality provided by IIS. They always run on an IIS server and filter every request until they find one they need to process. Filters can be programmed to examine and modify both incoming and outgoing streams of data. Internally programmed and externally configured priorities determine in which order filters are called.
Filters are implemented as DLLs and can be registered on an IIS server on a site level or a global level (i.e., they apply to all sites on an IIS server). Filters are initialised when the worker process is started and listens to all requests to the site on which it is installed.
Common tasks performed by ISAPI filters include:
Changing request data (URLs or headers) sent by the client
Controlling which physical file gets mapped to the URL
Controlling the user name and password |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.