source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/Inspector%20Sands | "Inspector Sands" is a code phrase used by public transport authorities in the United Kingdom, including Network Rail and London Underground, to alert staff to a fire alarm without needing to evacuate the station. The exact wording depends on the station and the nature of the incident. For example: "Would Inspector Sands please report to the operations room immediately." or "Would Inspector Sands please report to Platform 2."
The automated public address announcement can be generated automatically by the station's fire warning system, or can be triggered from the station control. The message audio file is usually stored as the primary standard emergency announcement on the station PA/VA system. Fire alarms in small buildings automatically activate all fire sounders to instruct occupants to evacuate the building whereas larger public buildings such as railway stations require a staged evacuation procedure to avoid false alarms. The message may indicate that a single fire alarm call point in a public area has been activated and which needs to be corroborated by a station staff before a decision is made whether to evacuate the whole station.
If an automatic fire detector in a non-public area is operated, or more than one device or zone reports a fire, the system will start the evacuation procedure and the fire brigade is automatically called. The announcement can be triggered by the station controller to alert station staff of other incidents which need urgent attention. The automated nature of the announcement and its high priority means that it has occasionally been known to cut into manual (lower priority) announcements being made by station staff. On some railway stations the announcement is also triggered during the routine testing of alarm systems.
History
The code phrase "Mr. Sands" was used in theatres during the late 19th and early 20th centuries to let the staff know that there was a fire backstage. When audiences were alerted of a fire within the building, stampedes occurred. To prevent further disasters, a codename was adopted. As sand buckets were sometimes used to extinguish fires, the code word Mr Sands was used.
See also
References
Disasters on the London Underground
London Underground
Network Rail |
https://en.wikipedia.org/wiki/Super%20Expander | The VIC-1211 Super Expander is a cartridge for the VIC-20 home computer. It was designed to provide several extensions to the BASIC interpreter on the computer, mostly to help with programming graphics and sound. It also provided of extra RAM (of which 136 bytes were used by the cartridge itself). The cartridge was created by Commodore Business Machines (CBM) and released in 1981.
Description
The dialect of BASIC bundled with the VIC-20, Commodore BASIC V2.0, was notorious for its sparse functionality. It didn't even match the features of Commodore's older line of computers, the PET which, at that time, already featured Commodore BASIC version 4.0. As a result, it was outdated by the VIC-20's release and seemed quite primitive compared to BASIC dialects available on other microcomputers. To be fair, the decision by Commodore to recycle the old BASIC, and the fact that it could fit in just ROM (including the KERNAL), helped keep the VIC-20's price to a minimum and so contributed to its huge success. Plus it was stable and almost entirely bug-free, which could not be said of some competing BASICs.
Nevertheless, not only did "VIC BASIC" lack commands considered fundamental to the BASIC language, such as "else" and "renum", but graphics and sound effects were completely unsupported. To use VIC-20's graphics and sound programmers had to "PEEK and POKE" bytes directly from/to the VIC-20's graphics/sound hardware, the 6560 Video Interface Chip (VIC). This made programming quite tedious and error prone since cryptic memory addresses and codes had to be used constantly, mistakes in these would usually crash the computer instead of giving an error message, and many statements were required to do even simple tasks. Such a thing was death in the tiny RAM and slow interpreted BASIC paradigm of the day.
Programmers could mitigate these problems by using machine code, to an extent, but this in itself was a tedious process with a rather steep learning curve. So to address these shortcomings Commodore created the Super Expander cartridge. It provided extra BASIC commands to facilitate using graphics and sound on the VIC-20. It also had commands to read the joystick and lightpen, and unlocked the use of function keys.
Graphics
The VIC-20 did not support high resolution graphics directly. Hi-res graphics were implemented by "painting" the display with characters, and "redefining" the character bitmaps on the fly. This was a complex and long-winded process; implementing it in a BASIC program was virtually useless due to the execution time required to draw anything.
The Super Expander took care of all the hard work. It allowed the programmer to draw points, lines, ellipses and arcs, and to paint enclosed regions, with one-line statements. All the VIC-20's 16 colours could be used, although with restrictions due to limitations of the 6560 chip. Display resolution was 160×160 pixels, throttled down from 192×200 allowed by the 6560 chip, in order to permit per- |
https://en.wikipedia.org/wiki/XFN | XFN may refer to:
Cross-functional team, a group of people with different functional expertise
XHTML Friends Network, an HTML microformat
X/Open Federated Naming, most commonly implemented as the Federated Naming Service
Xinhua Financial Network, the blanket term for the companies and services under Xinhua Holdings
IATA code for Xiangyang Liuji Airport |
https://en.wikipedia.org/wiki/Value%20network | A value network is a graphical illustration of social and technical resources within/between organizations and how they are utilized. The nodes in a value network represent people or, more abstractly, roles. The nodes are connected by interactions that represent deliverables. These deliverables can be objects, knowledge or money. Value networks record interdependence. They account for the worth of products and services. Companies have both internal and external value networks.
Types
External networks include customers/recipients, intermediaries, stakeholders, complementary, open innovation networks and suppliers.
Internal networks focus on key activities, processes and relationships that cut across internal boundaries, such as order fulfillment, innovation, lead processing and customer support. Value is created through exchange and the relationships between roles.
Definition
Christensen defines value network as:
"The collection of upstream suppliers, downstream channels to market, and ancillary providers that support a common business model within an industry. When would-be disruptors enter into existing value networks, they must adapt their business models to conform to the value network and therefore fail at disruption because they become co-opted."
Value configuration
Fjeldstad and Stabell declare a value network as one of three ways by which an organisation generates value. The others are the value shop and value chain.
Their value networks consist of these components:
customers
a service that enables interaction among them
an organization to provide the service.
contracts that enable access to the service
One example of a value network is that formed by social media users. The company provides a service, users contract with the company and immediately have access to the value network of other customers.
A less obvious example is a car insurance company: The company provides insurance. Customers can travel and interact in various ways while limiting risk exposure. The insurance policies represent the company's contracts and the internal processes.
F/S and Christensen's concepts address how a company understands itself and its value creation process, but they are not identical. Christensen's value networks address the relation between a company and its suppliers and the requirements posed by the customers, and how these interact when defining what represents value
in the product that is produced.
Fjeldstad and Stabell's value networks emphasize that the created value is between interacting customers, as facilitated by value networks.
Value constellations
Normann and Ramirez argued in 1993 that strategy is not a fixed set of activities along a value chain. Instead the focus should be on the value creating system. All stakeholders are obligated to produce value. Successful companies conceive of strategy as systematic social innovation.
Verna Allee
Verna Allee defines value networks as any web of relationships that generates b |
https://en.wikipedia.org/wiki/Beaujolais%20effect | Beaujolais effect is the name given to a class of potential semantic errors in Jean Ichbiah's draft specifications for the programming language Ada. The name arose from Ichbiah's promise to give a bottle of Beaujolais nouveau red wine to anyone who could find such a situation in the draft language standard. At least one bottle was actually awarded for such a discovery.
Definition
The Beaujolais effect is a situation where adding or removing a single use clause in an Ada program changes the behavior of the compiled program, a very undesirable effect in a language designed for semantic precision. Ichbiah took steps to prevent the effect when he updated his draft standard to produce the final Ada 83 language standard. The remaining possible situations for producing the effect were later identified by mathematical analysis and addressed by the Ada 95 language standard, making any situation that still resulted in a Beaujolais effect in Ada 83 an illegal construct in the more recent Ada 95 language standard.
In principle, the Beaujolais Effect can occur in other languages that use namespaces or packages, if the language specification does not ensure to make it illegal.
Background
The Ada programming language allows source code to be broken up into library packages containing definitions of data and algorithms that can be used by programs or other library packages. The definitions in a package are made visible by a with clause. For example, if the line –
with Ada.Text_IO;
appears at the top of the source code for a program or package then the data, procedures, and functions declared in the library package Ada.Text_IO can be invoked within that source code. This is the implementation of the namespace concept for Ada.
Thus a program that has the with Ada.Text_IO; directive can "see" the definitions there, and in order to invoke the New_Line procedure in Ada.Text_IO it can be referred to by name,
Ada.Text_IO.New_Line;
and similarly with procedures or functions that require arguments, or with reads/writes to any variables declared in the Ada.Text_IO package.
However, such fully specified names can become quite verbose, so the language standard also supports a use clause that tells the compiler to search the contents of the package when trying to identify names that occur in the source code. Thus if both the lines –
with Ada.Text_IO;
use Ada.Text_IO;
appear at the top of a program, the New_Line procedure in the package Ada.Text_IO is not only visible to the program, but can be invoked by the abbreviated form –
New_Line;
because the use clause tells the compiler what package contains the definition.
However, ambiguity arises if more than one package defines a New_Line procedure with the same or similar parameter profiles. If the program does not resolve the ambiguity, the compiler should reject the program with an error message. Here is an example:
package A is
procedure New_Line (Number_Of_Lines : in Positive := 1);
end A;
w |
https://en.wikipedia.org/wiki/Connectivity%20%28graph%20theory%29 | In mathematics and computer science, connectivity is one of the basic concepts of graph theory: it asks for the minimum number of elements (nodes or edges) that need to be removed to separate the remaining nodes into two or more isolated subgraphs. It is closely related to the theory of network flow problems. The connectivity of a graph is an important measure of its resilience as a network.
Connected vertices and graphs
In an undirected graph , two vertices and are called connected if contains a path from to . Otherwise, they are called disconnected. If the two vertices are additionally connected by a path of length , i.e. by a single edge, the vertices are called adjacent.
A graph is said to be connected if every pair of vertices in the graph is connected. This means that there is a path between every pair of vertices. An undirected graph that is not connected is called disconnected. An undirected graph G is therefore disconnected if there exist two vertices in G such that no path in G has these vertices as endpoints. A graph with just one vertex is connected. An edgeless graph with two or more vertices is disconnected.
A directed graph is called weakly connected if replacing all of its directed edges with undirected edges produces a connected (undirected) graph. It is unilaterally connected or unilateral (also called semiconnected) if it contains a directed path from to or a directed path from to for every pair of vertices . It is strongly connected, or simply strong, if it contains a directed path from to and a directed path from to for every pair of vertices .
Components and cuts
A connected component is a maximal connected subgraph of an undirected graph. Each vertex belongs to exactly one connected component, as does each edge. A graph is connected if and only if it has exactly one connected component.
The strong components are the maximal strongly connected subgraphs of a directed graph.
A vertex cut or separating set of a connected graph is a set of vertices whose removal renders disconnected. The vertex connectivity (where is not a complete graph) is the size of a minimal vertex cut. A graph is called -vertex-connected or -connected if its vertex connectivity is or greater.
More precisely, any graph (complete or not) is said to be -vertex-connected if it contains at least vertices, but does not contain a set of vertices whose removal disconnects the graph; and is defined as the largest such that is -connected. In particular, a complete graph with vertices, denoted , has no vertex cuts at all, but .
A vertex cut for two vertices and is a set of vertices whose removal from the graph disconnects and . The local connectivity is the size of a smallest vertex cut separating and . Local connectivity is symmetric for undirected graphs; that is, . Moreover, except for complete graphs, equals the minimum of over all nonadjacent pairs of vertices .
-connectivity is also called biconnectivity and -connec |
https://en.wikipedia.org/wiki/Ronald%20A.%20Marks | Ronald Anthony Marks FRSA is a former senior Central Intelligence Agency official and Capitol Hill Staffer. He is currently Chairman and CEO of ZPN Cyber and National Security Strategies and an academic focused on Cyber and Intelligence policy issues. His book "Spying in America in the Post 9/11 World: Domestic Threat and the Need for Change," published by Praeger Publishing, focuses on the vast expansion of intelligence collection in America and the need for careful oversight.
Personal
Marks was born in Portland, Oregon in April 1956 and raised in nearby Gresham. He graduated from Gresham High School in 1974. Marks received his B.Sci. in Business Administration and Economics with honors from Lewis & Clark College in 1978. Marks went on to the study at the Northwestern School of Law, Lewis and Clark College (1978–79) and took his M.Sci. in Economics at the University of Oregon in 1982. He is married and lives in McLean, Virginia.
Career
Starting in October 1983, Marks spent 16 years with the CIA. During that time he occupied a number of increasingly senior positions including serving as Senate Liaison for 5 Directors of Central Intelligence. Marks went on to serve two years (1995–96) as Intelligence Counsel to U.S. Senate Majority Leaders Bob Dole and U.S. Senator Trent Lott.
Since leaving government in 1999, Mr. Marks has been a senior executive and owner in several Defense and Intelligence industry companies focused on managed IT services, software, and open source analysis.
From 2005–10, Marks served as Senior Vice President and Director of Washington, D.C. operations for Oxford Analytica, a leading international risk analysis firm focused on geopolitics and economics, based in Oxford, U.K.
In 2011, Marks was appointed and served for three years as Director of Battelle Memorial Institute's Cyber Doctrine Program. He led a series of seminars and produced papers focused on deriving a United States Government Cyber Doctrine that applied to its both domestically and internationally recognizing there is no true separation between the two in the 21st Century.
Academic career and think tank affiliations
Marks currently serves as a Term Visiting Professor at George Mason University's Schar School of Policy and Government, and as a Lecturer on Intelligence issues at Johns Hopkins University M.A. program in Global Security Studies, Krieger School of Arts and Sciences. He is a Lecturer with Road Scholar lecturing on the intelligence community structure and its interactions with Capitol Hill.
In June 2021, Marks was appointed a Non-resident Senior Fellow at the Atlantic Council's Scowcroft Center for Strategy and Security with expertise in cybersecurity, Defense policy and technologies, Intelligence, and National Security.
Marks served as the Spring 2020 Dole Fellow at the University of Kansas Robert J. Dole Institute of Politics. There he conducted seminars with cyber, news, and intelligence experts examining the challenges of "Spying in th |
https://en.wikipedia.org/wiki/Guine%20Bissau%20Airlines | Safari Guiné Bissau Airlines was an airline in Guinea-Bissau. It was founded in 2010 .
Code data
Safari Airlines operated under:
IATA Code: G6
ICAO Code: BSR
Callsign: BISSAU AIRLINES
Defunct airlines of Guinea-Bissau
Airlines established in 2010
Government-owned airlines
2010 establishments in Guinea-Bissau |
https://en.wikipedia.org/wiki/Kalahari%20Express%20Airlines | Kalahari Express Airlines (KEA) was an airline based in Windhoek, Namibia. It was formed in 1998, operating from Eros Airport. KEA merged with Air Namibia in 2001.
Code data
ICAO Code: KEA (not current)
Callsign: KALAHARI (not current)
History
The airline was set to start service in 1997, though as of 1998, service had not yet started. The airline had difficulty in obtaining loans to purchase two Fokker F28-Mark 3000 from Australia. Destinations to be served from Windhoek were Johannesburg and Cape Town.
References
External links
Picture of a Fokker F-28-3000 Fellowship of KEA
Defunct airlines of Namibia
Airlines established in 1998
Airlines disestablished in 2001
Namibian companies established in 1998
2001 disestablishments in Namibia |
https://en.wikipedia.org/wiki/XHarbour | xHarbour is a free multi-platform extended Clipper compiler, offering multiple graphic terminals (GTs), including console drivers, GUIs, and hybrid console/GUIs. xHarbour is backward-compatible with Clipper and supports many language syntax extensions, greatly extended run-time libraries, and extensive third party support.
Like most dynamic languages, xHarbour is also available as a scripting language (standalone application, linkable library, MS ActiveScript engine [Windows Script Host, HTML, ASP]) utilizing an interpreter written in the xHarbour language.
The xHarbour Usenet newsgroup is an active community for discussing xHarbour related questions.
Built-in data types
xHarbour has 6 scalar types: Nil, String, Date, Logical, Number, Pointer, and 4 complex types: Array, Object, CodeBlock, and Hash. A scalar holds a single value, such as a string, number, or reference to any other type. Arrays are ordered lists of scalars or complex types, indexed by number, starting at 1. Hashes, or associative arrays, are unordered collections of any type values indexed by their associated key, which may be of any scalar or complex type.
Literal (static) representation of scalar types:
Nil: NIL
String: "hello", 'hello', [hello], or E"hello\n"
Date: ctod("2005-03-17" )
Logical: .T., .F.
Number: 1, 1.1, -1, 0xFF
Complex Types may also be represent as literal values:
Array: { "String", 1, { "Nested Array" }, .T., FunctionCall(), @FunctionPointer() }
CodeBlock: { |Arg1, ArgN| Arg1 := ArgN + OuterVar + FunctionCall() }
Hash: { "Name" => "John", 1 => "Numeric key", "Name2" => { "Nested" => "Hash" } }
Hashes may use any type including other Hashes as the Key for any element. Hashes and Arrays may contain any type as the Value of any member, including nesting arrays, and Hashes.
Codeblocks may have references to Variables of the Procedure/Function>method in which it was defined. Such Codeblocks may be returned as a value, or by means of an argument passed BY REFERENCE, in such case the Codeblock will "outlive" the routine in which it was defined, and any variables it references, will be a DETACHED variable.
Detached variables will maintain their value for as long as a Codeblock referencing them still exists. Such values will be shared with any other Codeblock which may have access to those same variables. If the Codeblock did not outlive its containing routine, and will be evaluated within the lifetime of the routine in which it is defined, changes to its Detached Variables(s) by means of its evaluation, will be reflected back at its parent routine.
Codeblocks can be evaluated any number of times, by means of the Eval( BlockExp ) function.
Variables
All types can be assigned to named variables. Named variable identifiers are 1 to 63 characters long, start with [A-Z|_] and further consist of the characters [A-Z|0-9|_] up to a maximum of 63 characters. Named variables are not case sensitive.
Variables have one of the following scopes:
LOCAL: Visib |
https://en.wikipedia.org/wiki/Wzonka-Lad | Wzonka-Lad is a Nintendo Game Boy emulator for the Amiga series of home computers.
History
Wzonka-Lad was written by Ville Helin in 68020 assembler.
The reason why Wzonka-Lad came to be was Virtual Game Boy (VGB), a Game Boy emulator written in C ported to Amiga. It ran so slowly on Amiga hardware that Helin decided to write one faster in assembly language.
The emulator requires at least a 68020 processor, provides several options to vary game speed and colours and supports graphics and sound cards (via CyberGraphX and AHI).
In comparison to other Game Boy emulators for Amiga, version 0.64 was slower and more compatible than AmigaGameBoy, but faster than Unix ports like VGB. Version 0.99 was able to achieve playable speed for most games on systems with a 68030 50 MHz processor or higher.
In August 2003, Wzonka-Lad dropped its shareware status, and was released as free software under the GPL-2.0-only license.
References
External links
Wzonka-Lad homepage
Amiga emulation software
Game Boy emulators
Shareware
Assembly language software
Free video game console emulators |
https://en.wikipedia.org/wiki/The%20Amazon%20Trail | The Amazon Trail is an educational computer game created by MECC. It was inspired by the popularity of The Oregon Trail, featuring the areas surrounding the Amazon River and some of its tributaries. In this 2D adventure, the player is asked to set out on a journey up the Amazon, hoping to make it to the lost Inca village of Vilcabamba. Along the way, the player learns about the people who live on and use the river for their survival. The Amazon Trail is known for being significantly more difficult than its predecessors in the franchise, such as The Oregon Trail. It was released in 1993 for MS-DOS, 1994 for Windows 3.x and 1996 for Windows and Macintosh. Amazon Trail II was released as a sequel to this game and Amazon Trail 3rd Edition was a re-release of that sequel with performance enhancements and new additions.
Plot
During the opening sequence, a short animation displays a person asleep in bed, coincidentally, in Peru, Indiana. They are visited during a dream by a jaguar who calls himself the jaguar of the Inca King. The jaguar explains that the Inca people are endangered by malaria and European explorers, and the player will be taken back in time in order to search for cinchona and deliver it to the king. The jaguar from the dream appears throughout the game as a hazy vision, running off a checklist of items desired by the Inca King, and offering various gloomy sentiments about the rainforest in general.
Gameplay
At the start of the game, the player has been transported to Belém, Brazil, and is given the option of choosing one of two native guides (Isabel or Antonio), who offer advice over the course of the game pertinent to navigating the river and maintaining ample supplies and good health. Each guide comes equipped with a slightly different spread of supplies (Antonio has more tents, while Isabel has more food). Players may come across various people along the river, taking photographs of the flora and fauna of the area, fishing, and canoeing.
Players must navigate the treacherous waters of the Amazon to avoid hitting other boats, logs, and whirlpools or paddling up the wrong tributary, travel through the forest in search of exotic plants and animals to photograph and identify, use harpoons to fish in the river and then identify whether the catch is edible, and trade with the individuals encountered at the various stops along the river. In order to aid in identification, each time a picture is taken or fish caught, the player has the option of checking the guide, which lists all of the species in the game except for the "new species".
There are multiple dangers. Capsizing could lead to loss of supplies and injury, or even cause the player to drown resulting in an instant game over. When fishing one has to be wary of spearing an electric eel or stingray as this may lead to a loss of health (though the latter is regarded as edible). The player can contract a variety of diseases (including malaria and yellow fever), requiring multiple da |
https://en.wikipedia.org/wiki/MBC%20Game | MBC Game (Korean: MBC 게임, 엠비씨 게임) was a South Korean specialty television channel owned by MBC Plus Media. The channel primarily broadcast's programming related to video games, but it, along with its competitor Ongamenet, was well known for its extensive coverage of competitive video gaming.
The channel was discontinued on January 31, 2012, and replaced by a music channel, MBC Music.
References
External links
Introduce-MBCGame :: Inside StarCraft
Defunct television channels
Esports television
Munhwa Broadcasting Corporation television networks
Korean-language television stations
Television channels in South Korea |
https://en.wikipedia.org/wiki/Electronic%20lab%20notebook | An electronic lab notebook (also known as electronic laboratory notebook, or ELN) is a computer program designed to replace paper laboratory notebooks. Lab notebooks in general are used by scientists, engineers, and technicians to document research, experiments, and procedures performed in a laboratory. A lab notebook is often maintained to be a legal document and may be used in a court of law as evidence. Similar to an inventor's notebook, the lab notebook is also often referred to in patent prosecution and intellectual property litigation.
Electronic lab notebooks offer many benefits to the user as well as organizations; they are easier to search upon, simplify data copying and backups, and support collaboration amongst many users.
ELNs can have fine-grained access controls, and can be more secure than their paper counterparts. They also allow the direct incorporation of data from instruments, replacing the practice of printing out data to be stapled into a paper notebook.
Types
ELNs can be divided into two categories:
"Specific ELNs" contain features designed to work with specific applications, scientific instrumentation or data types.
"Cross-disciplinary ELNs" or "Generic ELNs" are designed to support access to all data and information that needs to be recorded in a lab notebook.
Solutions range from specialized programs designed from the ground up for use as an ELN, to modifications or direct use of more general programs. Examples of using more general software as an ELN include using OpenWetWare, a MediaWiki install (running the same software that Wikipedia uses), WordPress, or the use of general note taking software such as OneNote as an ELN.
ELN's come in many different forms. They can be standalone programs, use a client-server model, or be entirely web-based. Some use a lab-notebook approach, others resemble a blog.
A good many variations on the "ELN" acronym have appeared. Differences between systems with different names are often subtle, with considerable functional overlap between them. Examples include "ERN" (Electronic Research Notebook), "ERMS" (Electronic Resource (or Research or Records) Management System (or Software) and SDMS (Scientific Data (or Document) Management System (or Software). Ultimately, these types of systems all strive to do the same thing: Capture, record, centralize and protect scientific data in a way that is highly searchable, historically accurate, and legally stringent, and which also promotes secure collaboration, greater efficiency, reduced mistakes and lowered total research costs.
Objectives
A good electronic laboratory notebook should offer a secure environment to protect the integrity of both data and process, whilst also affording the flexibility to adopt new processes or changes to existing processes without recourse to further software development. The package architecture should be a modular design, so as to offer the benefit of minimizing validation costs of any subsequent change |
https://en.wikipedia.org/wiki/Network%20Load%20Balancing%20Services | Network Load Balancing Services (NLBS) is a Microsoft implementation of clustering and load balancing that is intended to provide high availability and high reliability, as well as high scalability. NLBS is intended for applications with relatively small data sets that rarely change (one example would be web pages), and do not have long-running in-memory states. These types of applications are called stateless applications, and typically include Web, File Transfer Protocol (FTP), and virtual private networking (VPN) servers. Every client request to a stateless application is a separate transaction, so it is possible to distribute the requests among multiple servers to balance the load.
One attractive feature of NLBS is that all servers in a cluster monitor each other with a heartbeat signal, so there is no single point of failure.
In its current incarnation in Windows Server 2003, NLBS does not support automatic removal of a failed server from a cluster unless the server is completely offline, or if its NLBS service is stopped. For example, if a web server is returning an error page instead of correct content, it is still perceived as "alive" by NLBS. As such, a monitoring script is typically required on every participating node, which checks the correctness of local web page delivery, and calls the nlb.exe utility to add or remove itself from the cluster as needed.
History
Windows NT Load Balancing Service (WLBS) is a feature of Windows NT that provides load balancing and clustering for applications. WLBS dynamically distributes IP traffic across multiple cluster nodes, and provides automatic failover in the event of node failure. WLBS was replaced by Network Load Balancing Services in Windows 2000.
Auto fail over is also a part in this frame.
Internet Protocol based network software
Microsoft server technology
Load balancing (computing) |
https://en.wikipedia.org/wiki/Generic%20cell%20rate%20algorithm | The generic cell rate algorithm (GCRA) is a leaky bucket-type scheduling algorithm for the network scheduler that is used in Asynchronous Transfer Mode (ATM) networks. It is used to measure the timing of cells on virtual channels (VCs) and or Virtual Paths (VPs) against bandwidth and jitter limits contained in a traffic contract for the VC or VP to which the cells belong. Cells that do not conform to the limits given by the traffic contract may then be re-timed (delayed) in traffic shaping, or may be dropped (discarded) or reduced in priority (demoted) in traffic policing. Nonconforming cells that are reduced in priority may then be dropped, in preference to higher priority cells, by downstream components in the network that are experiencing congestion. Alternatively they may reach their destination (VC or VP termination) if there is enough capacity for them, despite them being excess cells as far as the contract is concerned: see priority control.
The GCRA is given as the reference for checking the traffic on connections in the network, i.e. usage/network parameter control (UPC/NPC) at user–network interfaces (UNI) or inter-network interfaces or network-network interfaces (INI/NNI) . It is also given as the reference for the timing of cells transmitted (ATM PDU Data_Requests) onto an ATM network by a network interface card (NIC) in a host, i.e. on the user side of the UNI . This ensures that cells are not then discarded by UPC/NCP in the network, i.e. on the network side of the UNI. However, as the GCRA is only given as a reference, the network providers and users may use any other algorithm that gives the same result.
Description of the GCRA
The GCRA is described by the ATM Forum in its User-Network Interface (UNI) and by the ITU-T in recommendation I.371 Traffic control and congestion control in B-ISDN . Both sources describe the GCRA in two equivalent ways: as a virtual scheduling algorithm and as a continuous state leaky bucket algorithm (figure 1).
Leaky bucket description
The description in terms of the leaky bucket algorithm may be the easier of the two to understand from a conceptual perspective, as it is based on a simple analogy of a bucket with a leak: see figure 1 on the leaky bucket page. However, there has been confusion in the literature over the application of the leaky bucket analogy to produce an algorithm, which has crossed over to the GCRA. The GCRA should be considered as a version of the leaky bucket as a meter rather than the leaky bucket as a queue.
However, while there are possible advantages in understanding this leaky bucket description, it does not necessarily result in the best (fastest) code if implemented directly. This is evidenced by the relative number of actions to be performed in the flow diagrams for the two descriptions (figure 1).
The description in terms of the continuous state leaky bucket algorithm is given by the ITU-T as follows: "The continuous-state leaky bucket can be viewed as a finite c |
https://en.wikipedia.org/wiki/Advanced%20Simulation%20and%20Computing%20Program | The Advanced Simulation and Computing Program (or ASC) is a super-computing program run by the National Nuclear Security Administration, in order to simulate, test, and maintain the United States nuclear stockpile. The program was created in 1995 in order to support the Stockpile Stewardship Program (or SSP). The goal of the initiative is to extend the lifetime of the current aging stockpile.
History
After the United States' 1992 moratorium on live nuclear testing, the Stockpile Stewardship Program was created in order to find a way to test, and maintain the nuclear stockpile. In response, the National Nuclear Security Administration began to simulate the nuclear warheads using supercomputers. As the stockpile ages, the simulations have become more complex, and the maintenance of the stockpile requires more computing power. Over the years, due to Moore's Law, the ASC program has created several different supercomputers with increasing power, in order to compute the simulations and mathematics.
In celebration of 25 years of ASC accomplishments, the Advanced Simulation and Computing Program has published this report.
Research
The majority of ASC's research is done on super-computers in three different laboratories. The calculations are verified by human calculations.
Laboratories
The ASC program has three laboratories:
Sandia National Laboratories
Los Alamos National Laboratory
Lawrence Livermore National Laboratory
Computing
Current supercomputers
The ASC program currently houses numerous supercomputers on the TOP500 list for computing power. This list changes every six months, so please visit https://top500.org/lists/top500/ for the latest list of NNSA machines. Although these computers may be in separate laboratories, remote computing has been established between the three main laboratories.
Previous supercomputers
ASCI Purple
Red Storm
Blue Gene/L: World's fastest supercomputer, November 2004 – November 2007
Blue Gene Q (aka, Sequoia)
ASCI Q: Installed in 2003, it was a AlphaServer SC45/GS Cluster and reached 7.727 Teraflops. ASQI Q used DEC Alpha 1250 MHz (2.5 GFlops) processors and a Quadrics interconnect. ASCI Q placed as the 2nd fastest supercomputer in the world in 2003.
ASCI White: World's fastest supercomputer, November 2000 – November 2001
ASCI Blue Mountain
ASCI Blue Pacific
ASCI Red: World's fastest supercomputer, June 1997 – June 2000
Elements
Within the ASC program, there are six subdivisions, each having their own role in the extension of the life of the stockpile.
Facility Operations and User Support
The Facility Operations and User Support subdivision is responsible for the physical computers and facilities and the computing network within ASC. They are responsible for making sure the tri-lab network, computing storage space, power usage, and the customer computing resources are all in line.
Computational Systems and Software Environment
The Computational and User Support subdivision is responsi |
https://en.wikipedia.org/wiki/Class%20implementation%20file | In object-oriented programming, a class implementation file is often used to contain the implementation code for the method(s) of a class. Programming languages like C and C++ make use of these implementation files so as to separate the interface and implementation of these methods.
Motivation
Using this structure, a class definition file containing the declaration of the class and its members is also created. If the class definition has been included and the implementation file for its methods is available, the user can instantiate an object of the class. The purpose of this structure is to keep the implementation code hidden, but allow the user to view the design.
Users make use of the public interface of an object so as to make creating objects as simple as possible, ensuring that client code does not distract the user with unnecessary details of the class's implementation.
This allows the user the information needed to use the class effectively, but prevents him or her from damaging the compiled code.
The structure of a class implementation file
An implementation file is used in C++ programming when creating a class definition to split the interface from the implementation. The header file would declare all the member functions (methods) and data methods (fields) that the class has.
The implementation file will contain the actual definition or source code of the methods declared in the header file. This file can start with a header block, which provides comments that describe the purpose of the defined class and any details about the creation of the actual file, such as the author of the file and date the file was created.
It can also include any libraries from the C++ Standard Library that will be used by any of the declared methods in the file. The class implementation file will usually have a line to include the associated header file (see examples below).
Example in C++
An example would be having a class called ExampleClass. The header file of this C++ file would be named "example_class.h" and the implementation file would be "example_class.cc".
An example of the structure of example_class.cc would look like this:
#include "example_class.h"
ExampleClass::ExampleClass() = default;
void ExampleClass::AddSomething(int k) {
...
}
In this example, the implementation for the functions has been omitted, but the functions must be declared in example_class.h like this:
#include <string>
class ExampleClass {
public:
ExampleClass(); // Constructor.
void AddSomething(int k);
private:
std::string name_;
};
Example in Objective-C
Another example of how a class implementation file would be structured can be seen with Objective-C, which is used in iOS programming.
This example will use "ExampleClass". A notable difference between C++ and Objective-C when making use of these implementation files is the extensions used at the end of the files. In C++ it will be .cpp
and in Objective-C it will |
https://en.wikipedia.org/wiki/MSN%20%28disambiguation%29 | MSN is a web portal provided by Microsoft.
MSN may also refer to:
Microsoft
MSN Dial-up, the Internet service provider (originally The Microsoft Network)
Windows Live Messenger, once synonymous with 'MSN' in Internet slang
List of services by MSN, a list that includes several services Microsoft has rebranded
Other
Dane County Regional Airport (IATA airport code MSN) in Madison, Wisconsin
Manufacturer's serial number, a unique identifier assigned by some manufacturers. The abbreviation is typically used by aircraft companies.
Master of Science in Nursing
Maquila Solidarity Network
Medium spiny neuron
Meeker Southern Railroad, which uses the reporting mark 'MSN'
Meter serial number
Mountaineer Sports Network, a former business identity of the West Virginia Radio Corporation
Lionel Messi, Luis Suárez and Neymar, dubbed "MSN", the main attacking trident of Spanish football club FC Barcelona from 2014 to 2017
MSN, the human gene which produces the moesin protein
The National Sports Council of Malaysia, Majlis Sukan Negara Malaysia
See also
MSM (disambiguation) |
https://en.wikipedia.org/wiki/Extensibility | Extensibility is a software engineering and systems design principle that provides for future growth. Extensibility is a measure of the ability to extend a system and the level of effort required to implement the extension. Extensions can be through the addition of new functionality or through modification of existing functionality. The principle provides for enhancements without impairing existing system functions.
An extensible system is one whose internal structure and dataflow are minimally or not affected by new or modified functionality, for example recompiling or changing the original source code might be unnecessary when changing a system’s behavior, either by the creator or other programmers. Because software systems are long lived and will be modified for new features and added functionalities demanded by users, extensibility enables developers to expand or add to the software’s capabilities and facilitates systematic reuse. Some of its approaches include facilities for allowing users’ own program routines to be inserted and the abilities to define new data types as well as to define new formatting markup tags.
Extensible design
Extensible design in software engineering is to accept that not everything can be designed in advance. A light software framework which allows for changes is provided instead. Small commands are made to prevent losing the element of extensibility, following the principle of separating work elements into comprehensible units, in order to avoid traditional software development issues including low cohesion and high coupling and allow for continued development. Embracing change is essential to the extensible design, in which additions will be continual. Each chunk of the system will be workable with any changes, and the idea of change through addition is the center of the whole system design.
Extensible design supports frequent re-prioritization and allows functionality to be implemented in small steps upon request, which are the principles advocated by the Agile methodologies and iterative development. Extensibility imposes fewer and cleaner dependencies during development, as well as reduced coupling and more cohesive abstractions, plus well defined interfaces.
Importance
Fickleness lies at the basis of all software because of human phenomena since software is an "evolving entity" which is developed and maintained by human beings, yielding ongoing system changes in software specification and implementation. Components of a software are often developed and deployed by unrelated parties independently. Adaptable software components are necessary since components from external vendors are unlikely to fit into a specific deployment scenario off-the-rack, taking third party users other than the manufacturer into consideration. Many software systems and software product-lines are derived from a base system, which share a common software architecture or sometimes large parts of the functionality and implementation b |
https://en.wikipedia.org/wiki/Booth%27s%20multiplication%20algorithm | Booth's multiplication algorithm is a multiplication algorithm that multiplies two signed binary numbers in two's complement notation. The algorithm was invented by Andrew Donald Booth in 1950 while doing research on crystallography at Birkbeck College in Bloomsbury, London. Booth's algorithm is of interest in the study of computer architecture.
The algorithm
Booth's algorithm examines adjacent pairs of bits of the 'N'-bit multiplier Y in signed two's complement representation, including an implicit bit below the least significant bit, y−1 = 0. For each bit yi, for i running from 0 to N − 1, the bits yi and yi−1 are considered. Where these two bits are equal, the product accumulator P is left unchanged. Where yi = 0 and yi−1 = 1, the multiplicand times 2i is added to P; and where yi = 1 and yi−1 = 0, the multiplicand times 2i is subtracted from P. The final value of P is the signed product.
The representations of the multiplicand and product are not specified; typically, these are both also in two's complement representation, like the multiplier, but any number system that supports addition and subtraction will work as well. As stated here, the order of the steps is not determined. Typically, it proceeds from LSB to MSB, starting at i = 0; the multiplication by 2i is then typically replaced by incremental shifting of the P accumulator to the right between steps; low bits can be shifted out, and subsequent additions and subtractions can then be done just on the highest N bits of P. There are many variations and optimizations on these details.
The algorithm is often described as converting strings of 1s in the multiplier to a high-order +1 and a low-order −1 at the ends of the string. When a string runs through the MSB, there is no high-order +1, and the net effect is interpretation as a negative of the appropriate value.
A typical implementation
Booth's algorithm can be implemented by repeatedly adding (with ordinary unsigned binary addition) one of two predetermined values A and S to a product P, then performing a rightward arithmetic shift on P. Let m and r be the multiplicand and multiplier, respectively; and let x and y represent the number of bits in m and r.
Determine the values of A and S, and the initial value of P. All of these numbers should have a length equal to (x + y + 1).
A: Fill the most significant (leftmost) bits with the value of m. Fill the remaining (y + 1) bits with zeros.
S: Fill the most significant bits with the value of (−m) in two's complement notation. Fill the remaining (y + 1) bits with zeros.
P: Fill the most significant x bits with zeros. To the right of this, append the value of r. Fill the least significant (rightmost) bit with a zero.
Determine the two least significant (rightmost) bits of P.
If they are 01, find the value of P + A. Ignore any overflow.
If they are 10, find the value of P + S. Ignore any overflow.
If they are 00, do nothing. Use P directly in the next step.
If they |
https://en.wikipedia.org/wiki/Chase%20%28video%20game%29 | Chase is a turn-based computer game in which players are tasked with escaping from robots programmed to pursue and kill them. The player attempts to destroy the robots by moving in such a way that the robots collide with each other or other obstacles. The basic concept has been part of games stretching into the 1970s, and is among the earliest of the "standards" for microcomputer platforms. Many variations exist, the most notable being the home computer-based Escape! and Zombies, Daleks on MacOS and robots on Unix.
The original author of the game remains unknown, but it is highly likely it started on the DTSS system at Dartmouth College in the early 1970s. The first public versions appeared in Creative Computing magazine in early 1976 and a variety of modified versions appeared over the next few years. Daleks and robots both appeared in 1984, leading to another wave of similar versions. New ports continue to appear to this day.
Gameplay
Chase is played on a two-dimensional rectangular grid. The objective of the game is to escape from a number of robots, which have been programmed to kill the player.
The game is turn-based. In the original game, the player character starts at a randomly selected location. In some derivative versions, such as the GNOME version, the player starts at the centre of the grid. The robots start at randomly selected locations on the grid. Every time the player character moves a square in any direction (horizontally, vertically, or diagonally), each robot moves one square closer to their new location, in whichever direction is the shortest path. If the player character collides with a robot, they die and the game ends.
The player attempts to survive by causing the robots to kill themselves by colliding with other objects on the map. There are two major ways this occurs. In earlier versions derived from Chase!, there are a number of deadly objects on the map that will kill either the robots or the player. In later versions derived from robots, the map is initially clear and these hazards are created when two robots collide to create a pile of rubble. In either case, the player is attempting to move in such a way to cause the robots to collide with each other or stationary obstacles.
The player can also teleport into a randomly selected location in cases where escape is otherwise impossible. Teleportation counts as a move, and the robots will respond by moving towards the new location. Because the location is randomly selected, it is possible that the player teleports right into the path of a robot. In some versions of the game, there is a "safe teleport" feature which the player may use a limited number of times (for instance once per level) and there may also be a close-range weapon which kills all robots within the immediate vicinity, the use of which would be limited in a similar way.
A few versions also add a tank, which is not killed when colliding with the other objects and is deadly to all objects. It otherwis |
https://en.wikipedia.org/wiki/Cumbrian%20Coast%20line | The Cumbrian Coast line is a rail route in North West England, running from Carlisle to Barrow-in-Furness via Workington and Whitehaven. The line forms part of Network Rail route NW 4033, which continues (as the Furness line) via Ulverston and Grange-over-Sands to Carnforth, where it connects with the West Coast Main Line.
History
George Stephenson favoured, and carried out preliminary surveys for, a scheme to link England and Scotland by a railway running along the coast between Lancaster and Carlisle, but this 'Grand Caledonian Junction Railway' was never built, the direct route over Shap being preferred. Consequently, the line along the Cumbrian coast is the result of piecemeal railway building (largely to serve local needs) by a number of different companies:
Maryport and Carlisle Railway
Carlisle to Maryport
Promoted to link with Newcastle and Carlisle Railway to give "one complete and continuous line of communication from the German Ocean to the Irish Sea" and to open up the northern (inland) portion of West Cumbrian coalfield. Act of Parliament obtained 1837; first section – Maryport to Arkleby (just short of Aspatria) – opened 1840: line Maryport–Carlisle fully opened 1845. Originally laid single; doubled throughout (to accommodate heavy and profitable mineral traffic) by 1861. Remained independent (and highly profitable) until grouping.
Whitehaven Junction Railway
Maryport to Whitehaven (Bransty) (leased by London and North Western Railway 1865; amalgamated with LNWR 1866).
Whitehaven at this time was dominated by the Lowther family, and its head the Earl of Lonsdale. Attempts supported by William Lowther, 1st Earl of Lonsdale to promote a 'Whitehaven, Maryport and Carlisle Railway' in 1835, had lost out to the Maryport and Carlisle Railway. In 1844 a more limited project for a railway between Whitehaven and Maryport (supported by Lord Lonsdale and both MPs for West Cumberland) got its parliamentary Act. The first Earl had died earlier in 1844, and it was his son, the second Earl, who became chairman of the company and remained so throughout its existence. The line was opened from Maryport to Workington at the end of November 1845, and to Harrington mid-May 1846 Between Whitehaven and Harrington the line ran between cliffs and the sea and landslips, rockfalls, and high tides made construction problematical. A train ran all the way from Maryport to Whitehaven on 19 February 1847, but the passengers left it at Harrington; the line opened for passenger traffic 18 March 1847.
In 1848 two Acts were obtained; one to authorise the raising of further capital to cover overspend on the construction of the existing line, one to make the link with the Whitehaven and Furness Junction Railway (W&FJR) by an elevated railway running to the harbour and then along the harbour front. The harbour link was never built (the W&FJR deciding to proceed with their original intention of a tunnel) but lines were laid down to serve the North Pier. There wer |
https://en.wikipedia.org/wiki/Cellular%20traffic | This article discusses the mobile cellular network aspect of teletraffic measurements. Mobile radio networks have traffic issues that do not arise in connection with the fixed line PSTN. Important aspects of cellular traffic include: quality of service targets, traffic capacity and cell size, spectral efficiency and sectorization, traffic capacity versus coverage, and channel holding time analysis.
Teletraffic engineering in telecommunications network planning ensures that network costs are minimised without compromising the quality of service (QoS) delivered to the user of the network. This field of engineering is based on probability theory and can be used to analyse mobile radio networks, as well as other telecommunications networks.
A mobile handset which is moving in a cell will record a signal strength that varies. Signal strength is subject to slow fading, fast fading and interference from other signals, resulting in degradation of the carrier-to-interference ratio (C/I). A high C/I ratio yields quality communication. A good C/I ratio is achieved in cellular systems by using optimum power levels through the power control of most links. When carrier power is too high, excessive interference is created, degrading the C/I ratio for other traffic and reducing the traffic capacity of the radio subsystem. When carrier power is too low, C/I is too low and QoS targets are not met.
Quality of Service targets
At the time that the cells of a radio subsystem are designed, Quality of Service (QoS) targets are set, for: traffic congestion and blocking, dominant coverage area, C/I, outage probability, handover failure rate, overall call success rate, data rate, delay, etc.
Traffic load and cell size
The more traffic generated, the more base stations will be needed to service the customers. The number of base stations for a simple cellular network is equal to the number of
cells. The traffic engineer can achieve the goal of satisfying the increasing population of customers by increasing the number of
cells in the area concerned, so this will also increases the number of base stations. This method is called cell splitting (and combined with sectorization)
is the only way of providing services to a burgeoning population. This simply works by dividing the cells already present into smaller sizes
hence increasing the traffic capacity.
Reduction of the cell radius enables the cell to accommodate extra traffic.
The cost of equipment can also be cut down by reducing the number of base stations through setting up three neighbouring
cells, with the cells serving three 120° sectors with different channel groups.
Mobile radio networks are operated with finite, limited resources (the spectrum of frequencies available). These resources have to be
used effectively to ensure that all users receive service, that is, the quality of service is consistently maintained. This need to carefully use the limited spectrum, brought about the development of cells in mobile ne |
https://en.wikipedia.org/wiki/Midland%20line%2C%20Perth | The Midland line is a suburban rail service on the Transperth network in Perth, Western Australia. It runs on the Eastern Railway through Perth's eastern suburbs and connects Midland with Perth. Travelling from Midland, the trains terminate at Fremantle on the Fremantle line.
History
The section of the Eastern Railway between Fremantle, Perth and Guildford was the first suburban railway line in Perth, opening on 1 March 1881.
The line was extended from Guildford to Chidlow's Well, opening in March 1884.
Throughout the 1880s, the Eastern Railway line was extended beyond Guildford and Midland Junction along its first route to Chidlow and Northam. The second route varied after Bellevue proceeding to Chidlow via the Swan View Tunnel, Parkerville and Stoneville.
The third route saw the removal of the Bellevue Railway station in its construction, with the new Midland railway terminus replacing the older Midland Junction railway station.
An anomaly of the Midland line timetables in the 1950s and 1960s was that Bellevue was nominally the terminus of the line until 1962. Koongamia, which was a new station prior to Greenmount on the original first route, was the terminus from 1962 to 1966.
In 1966, the stations on the first two Eastern Railway routes as well as the old Midland Junction railway station were closed and the new Midland was constructed to the west and became the new terminus.
Generally, changes from the 1970s saw a significant number of stations on the line moved or turned into island platform stations (to be compatible with the double track, dual-gauge track configuration between East Perth and Midland).
On 24 July 2004, Bassendean became the first station to be upgraded under the "Building Better Stations" project.
In the early decades of the twentieth century, a significant number of rail-crossing accidents between motor vehicles and trains occurred. Unattended crossings were provided with boom gates, flashing lights and bells to counter inattention or risk taking from drivers. Also, crossings were reduced, and in a number of locations, bridges were constructed.
Airport railway connection
In December 2013, the Government of Western Australia announced its intention to construct a railway line branching off the Midland line east of Bayswater station to Forrestfield via Perth Airport. Construction of the Forrestfield–Airport Link commenced in November 2016 and was scheduled to open in 2021. After construction delays it opened on 9 October 2022.
Morley–Ellenbrook line
The future Morley–Ellenbrook line, under construction as a branch northward from the Midland line east of Bayswater station, is due for completion in late-2024.
Description
During hot weather, the tracks can distort. As a result, train speeds are reduced by approximately when the air temperature is above , and by an additional when the air temperature is above .
The Transperth network currently uses fixed block signalling and automatic train protection, which stops |
https://en.wikipedia.org/wiki/Quadrature%20%28geometry%29 | In mathematics, particularly in geometry, quadrature (also called squaring) is a historical process of drawing a square with the same area as a given plane figure or computing the numerical value of that area. A classical example is the quadrature of the circle (or squaring the circle).
Quadrature problems served as one of the main sources of problems in the development of calculus. They introduce important topics in mathematical analysis.
History
Antiquity
Greek mathematicians understood the determination of an area of a figure as the process of geometrically constructing a square having the same area (squaring), thus the name quadrature for this process. The Greek geometers were not always successful (see squaring the circle), but they did carry out quadratures of some figures whose sides were not simply line segments, such as the lune of Hippocrates and the parabola. By a certain Greek tradition, these constructions had to be performed using only a compass and straightedge, though not all Greek mathematicians adhered to this dictum.
For a quadrature of a rectangle with the sides a and b it is necessary to construct a square with the side (the geometric mean of a and b). For this purpose it is possible to use the following: if one draws the circle with diameter made from joining line segments of lengths a and b, then the height (BH in the diagram) of the line segment drawn perpendicular to the diameter, from the point of their connection to the point where it crosses the circle, equals the geometric mean of a and b. A similar geometrical construction solves the problems of quadrature of a parallelogram and of a triangle.
Problems of quadrature for curvilinear figures are much more difficult. The quadrature of the circle with compass and straightedge was proved in the 19th century to be impossible. Nevertheless, for some figures a quadrature can be performed. The quadratures of the surface of a sphere and a parabola segment discovered by Archimedes became the highest achievement of analysis in antiquity.
The area of the surface of a sphere is equal to four times the area of the circle formed by a great circle of this sphere.
The area of a segment of a parabola determined by a straight line cutting it is 4/3 the area of a triangle inscribed in this segment.
For the proofs of these results, Archimedes used the method of exhaustion attributed to Eudoxus.
Medieval mathematics
In medieval Europe, quadrature meant the calculation of area by any method. Most often the method of indivisibles was used; it was less rigorous than the geometric constructions of the Greeks, but it was simpler and more powerful. With its help, Galileo Galilei and Gilles de Roberval found the area of a cycloid arch, Grégoire de Saint-Vincent investigated the area under a hyperbola (Opus Geometricum, 1647), and Alphonse Antonio de Sarasa, de Saint-Vincent's pupil and commentator, noted the relation of this area to logarithms.
Integral calculus
John Wallis algebrised |
https://en.wikipedia.org/wiki/Melting%20points%20of%20the%20elements%20%28data%20page%29 |
Melting point
In the following table, the use row is the value recommended for use in other Wikipedia pages in order to maintain consistency across content.
Notes
All values at standard pressure (101.325 kPa) unless noted. Triple point temperature values (marked "tp") are not valid at standard pressure.
References
WEL
As quoted at http://www.webelements.com/ from these sources:
A.M. James and M.P. Lord in Macmillan's Chemical and Physical Data, Macmillan, London, UK, 1992
G.W.C. Kaye and T.H. Laby in Tables of physical and chemical constants, Longman, London, UK, 15th edition, 1993
Unit is K.
CRC
Unit is °C
LNG
As quoted from:
J.A. Dean (ed), Lange's Handbook of Chemistry (15th Edition), McGraw-Hill, 1999; Section 3; Table 3.2 Physical Constants of Inorganic Compounds
Unit is °C
Hoffer et al.
Lavrukhina et al.
Holman et al.
Not used in this table.
Table
See also
Boiling points of the elements (data page)
List of chemical elements
Properties of chemical elements
Chemical element data pages |
https://en.wikipedia.org/wiki/Boiling%20points%20of%20the%20elements%20%28data%20page%29 |
Boiling point
In the following table, the use row is the value recommended for use in other Wikipedia pages in order to maintain consistency across content.
Table
Notes
Unless noted, all values refer to the normal boiling point at standard pressure (101.325 kPa).
References
Zhang et al.
WebEl
As quoted at http://www.webelements.com/ from these sources:
CRC
Lange
As quoted from:
Otozai et al.
Lavrukhina et al.
See also
Melting points of the elements (data page)
Densities of the elements (data page)
Properties of chemical elements
Chemical element data pages |
https://en.wikipedia.org/wiki/Cabletron%20Systems | Cabletron Systems, Inc., was a manufacturer of networking computer equipment throughout the 1980s and 1990s primarily based in Rochester, New Hampshire, in the United States. They also had manufacturing facilities in Ironton, Ohio, and in Ireland.
History
Cabletron was founded in 1983 in a Massachusetts garage by Craig Benson (who later became New Hampshire's governor) and Robert Levine. As manufacturing and design operations expanded, Cabletron relocated to Rochester, New Hampshire, employing 6,600 people at its peak. In 1996 the company eclipsed US$1 billion in sales. Cabletron found its first success in the 10BASE5 Ethernet market, providing the ST-500, the first Ethernet transceiver that featured diagnostic LEDs, and the LAN-MD, the first commercially viable field-deployable 10BASE5 test set. The early products were critical in the history of Ethernet as 10BASE5 Ethernet was generally difficult to operate and maintain and cabling problems were especially difficult to diagnose. Following on this early success, Cabletron developed one of the first modular Ethernet hubs, the MMAC-8 (and its smaller siblings, the MMAC-5 and the MMAC-3) at the time that 10BASE-T was becoming standardized. By developing high-density 10BASE-T modules (24 or 48 ports per slot), Cabletron was able to reduce the price per port of these hubs to a very affordable level, and by introducing a custom Element Management System known as Prism, made the MMAC-8 easy to maintain.
As Cabletron expanded its reach in the networking business, they initially moved into Layer 3 routing by partnering with Cisco, co-developing a Cisco router that would fit into the MMAC-8 hub. Cabletron ultimately developed its own routing capability, but found it increasingly difficult to compete at the low end of the Ethernet market and continue to invest in high-end routing technology.
Recognizing this fact, Cabletron reorganized as a holding company in 2000, hoping to apply appropriate focus to the different parts of its business as they had evolved over time. The holding company was set up to control four networking firms:
Enterasys Networks of Andover, Massachusetts, which was based on the original core products of Cabletron. Enterasys later merged with Cabletron Systems the holding company, though keeping the Enterasys name, before going public in 2001. Subsequently, Enterasys was taken private in 2006 by The Gores Group, which is owned by Alec Gores. In 2008, The Gores Group acquired a controlling interest in Siemens Enterprise Communications and merged the acquired company with Enterasys, pledging with Siemens to invest up to €350M in the new entity.
Riverstone Networks of Santa Clara, California, which was based on the assets of YAGO Systems, a company acquired by Cabletron as an attempt to move into the Switched Ethernet business. Riverstone Networks was the only actual spin-off of Cabletron's reorganization, and it was later acquired by Lucent Technologies, which in turn subsequently me |
https://en.wikipedia.org/wiki/Autocode | Autocode is the name of a family of "simplified coding systems", later called programming languages, devised in the 1950s and 1960s for a series of digital computers at the Universities of Manchester, Cambridge and London. Autocode was a generic term; the autocodes for different machines were not necessarily closely related as are, for example, the different versions of the single language Fortran.
Today the term is used to refer to the family of early languages descended from the Manchester Mark 1 autocoder systems, which were generally similar. In the 1960s, the term autocoders was used more generically as to refer to any high-level programming language using a compiler.
Examples of languages referred to as autocodes are COBOL and Fortran.
Glennie's Autocode
The first autocode and its compiler were developed by Alick Glennie in 1952 for the Mark 1 computer at the University of Manchester and is considered by some to be the first compiled programming language. His main goal was increased comprehensibility in the programming of Mark 1 machines, which were known for their particularly abstruse machine code. Although the resulting language was much clearer than the machine code, it was still very machine dependent.
Below is an example of Glennie's Autocode function which calculates the formula: . The example omits necessary scaling instruction needed to place integers into variables and assumes that results of multiplication fit into lower accumulator.
c@VA t@IC x@½C y@RC z@NC
INTEGERS +5 →c # Put 5 into c
→t # Load argument from lower accumulator
# to variable t
+t TESTA Z # Put |t| into lower accumulator
-t
ENTRY Z
SUBROUTINE 6 →z # Run square root subroutine on
# lower accumulator value
# and put the result into z
+tt →y →x # Calculate t^3 and put it into x
+tx →y →x
+z+cx CLOSE WRITE 1 # Put z + (c * x) into
# lower accumulator
# and return
User's manual of Glennie's Autocode Compiler mentioned that "the loss of efficiency is no more than 10%".
Impact of Glennie's Autocode on other Manchester users' programming habits was negligible. It wasn't even mentioned in Brooker's 1958 paper called "The Autocode Programs developed for the Manchester University Computers".
Mark 1 Autocode
The second autocode for the Mark 1 was planned in 1954 and developed by R. A. Brooker in 1955 and was called the "Mark 1 Autocode". The language was nearly machine-independent and had floating-point arithmetic, unlike the first one. On the other hand it allowed only one operation per line, offered few mnemonic names and had no way to define user subroutines.
An example code which loads array of size 11 of floating-point numbers from the input would look like this
n1 = 1
1 vn1 = I reads input into v[n[1] |
https://en.wikipedia.org/wiki/Flow%20control%20%28data%29 | In data communications, flow control is the process of managing the rate of data transmission between two nodes to prevent a fast sender from overwhelming a slow receiver. Flow control should be distinguished from congestion control, which is used for controlling the flow of data when congestion has actually occurred. Flow control mechanisms can be classified by whether or not the receiving node sends feedback to the sending node.
Flow control is important because it is possible for a sending computer to transmit information at a faster rate than the destination computer can receive and process it. This can happen if the receiving computers have a heavy traffic load in comparison to the sending computer, or if the receiving computer has less processing power than the sending computer.
Stop-and-wait
Stop-and-wait flow control is the simplest form of flow control. In this method the message is broken into multiple frames, and the receiver indicates its readiness to receive a frame of data. The sender waits for a receipt acknowledgement (ACK) after every frame for a specified time (called a time out). The receiver sends the ACK to let the sender know that the frame of data was received correctly. The sender will then send the next frame only after the ACK.
Operations
Sender: Transmits a single frame at a time.
Sender waits to receive ACK within time out.
Receiver: Transmits acknowledgement (ACK) as it receives a frame.
Go to step 1 when ACK is received, or time out is hit.
If a frame or ACK is lost during transmission then the frame is re-transmitted. This re-transmission process is known as ARQ (automatic repeat request).
The problem with Stop-and-wait is that only one frame can be transmitted at a time, and that often leads to inefficient transmission, because until the sender receives the ACK it cannot transmit any new packet. During this time both the sender and the channel are unutilised.
Pros and cons of stop and wait
Pros
The only advantage of this method of flow control is its simplicity.
Cons
The sender needs to wait for the ACK after every frame it transmits. This is a source of inefficiency, and is particularly bad when the propagation delay is much longer than the transmission delay.
Stop and wait can also create inefficiencies when sending longer transmissions. When longer transmissions are sent there is more likely chance for error in this protocol. If the messages are short the errors are more likely to be detected early. More inefficiency is created when single messages are broken into separate frames because it makes the transmission longer.
Sliding window
A method of flow control in which a receiver gives a transmitter permission to transmit data until a window is full. When the window is full, the transmitter must stop transmitting until the receiver advertises a larger window.
Sliding-window flow control is best utilized when the buffer size is limited and pre-established. During a typical communication betw |
https://en.wikipedia.org/wiki/Data%20Matrix | A Data Matrix is a two-dimensional code consisting of black and white "cells" or dots arranged in either a square or rectangular pattern, also known as a matrix. The information to be encoded can be text or numeric data. Usual data size is from a few bytes up to 1556 bytes. The length of the encoded data depends on the number of cells in the matrix. Error correction codes are often used to increase reliability: even if one or more cells are damaged so it is unreadable, the message can still be read. A Data Matrix symbol can store up to 2,335 alphanumeric characters.
Data Matrix symbols are rectangular, usually square in shape and composed of square "cells" which represent bits. Depending on the coding used, a "light" cell represents a 0 and a "dark" cell is a 1, or vice versa. Every Data Matrix is composed of two solid adjacent borders in an "L" shape (called the "finder pattern") and two other borders consisting of alternating dark and light "cells" or modules (called the "timing pattern"). Within these borders are rows and columns of cells encoding information. The finder pattern is used to locate and orient the symbol while the timing pattern provides a count of the number of rows and columns in the symbol. As more data is encoded in the symbol, the number of cells (rows and columns) increases. Each code is unique. Symbol sizes vary from 10×10 to 144×144 in the new version ECC 200, and from 9×9 to 49×49 in the old version ECC 000 – 140.
Applications
The most popular application for Data Matrix is marking small items, due to the code's ability to encode fifty characters in a symbol that is readable at and the fact that the code can be read with only a 20% contrast ratio.
A Data Matrix is scalable; commercial applications exist with images as small as (laser etched on a silicon device) and as large as a 1 metre (3 ft) square (painted on the roof of a boxcar). Fidelity of the marking and reading systems are the only limitation.
The US Electronic Industries Alliance (EIA) recommends using Data Matrix for labeling small electronic components.
Data Matrix codes are becoming common on printed media such as labels and letters. The code can be read quickly by a barcode reader which allows the media to be tracked, for example when a parcel has been dispatched to the recipient.
For industrial engineering purposes, Data Matrix codes can be marked directly onto components, ensuring that only the intended component is identified with the data-matrix-encoded data. The codes can be marked onto components with various methods, but within the aerospace industry these are commonly industrial ink-jet, dot-peen marking, laser marking, and electrolytic chemical etching (ECE). These methods give a permanent mark which can last up to the lifetime of the component.
Data Matrix codes are usually verified using specialist camera equipment and software. This verification ensures the code conforms to the relevant standards, and ensures readability for the life |
https://en.wikipedia.org/wiki/ACW | ACW may refer to:
Military
American Civil War
Air Control Wing, e.g.:
116th Air Control Wing
461st Air Control Wing
552d Air Control Wing
Other
Acorn Cambridge Workstation, a microcomputer
Ancient Christian Writers, a book series
Anticlockwise
Arts Council of Wales
Ashfield–Colborne–Wawanosh, a municipality in Ontario, Canada
ISO 639-3 code for Hejazi Arabic, a language dialect |
https://en.wikipedia.org/wiki/Andrew%20Morton | Andrew Morton may refer to:
Andrew Morton (computer programmer) (born 1959), Linux kernel programmer/coordinator
Andrew Morton (painter) (1802–1845), English portrait artist
Andrew Morton (writer) (born 1953), biographer of Diana, Princess of Wales, Angelina Jolie, Madonna, amongst others
Andy Morton, Australian rugby league footballer for North Sydney Bears
Andrew Morton (1812–1881), pioneering doctor and coroner of Weetangera, Australian Capital Territory
See also
Andrew Marton (1904–1992), Hungarian-American film director, producer and editor |
https://en.wikipedia.org/wiki/List%20of%20radio%20stations%20in%20Maryland | The following is a list of FCC-licensed radio stations in the U.S. state of Maryland which can be sorted by their call signs, frequencies, cities of license, licensees, and programming formats.
List of radio stations
Defunct
WBIS
WGBG
WHCP-LP
WHFS (historic)
WHRF
WKIK
WRYR-LP
See also
Maryland media
List of newspapers in Maryland
List of television stations in Maryland
Media of locales in Maryland: Baltimore, College Park, Cumberland, Frederick, Gaithersburg
References
Bibliography
External links
(Directory ceased in 2017)
Maryland, DC, Delaware Broadcasters Association
W3EAX Amateur Radio Association, University of Maryland (est. circa 1934)
Mid-Atlantic Antique Radio Club
Images
Maryland
Radio |
https://en.wikipedia.org/wiki/Algebraic%20graph%20theory | Algebraic graph theory is a branch of mathematics in which algebraic methods are applied to problems about graphs. This is in contrast to geometric, combinatoric, or algorithmic approaches. There are three main branches of algebraic graph theory, involving the use of linear algebra, the use of group theory, and the study of graph invariants.
Branches of algebraic graph theory
Using linear algebra
The first branch of algebraic graph theory involves the study of graphs in connection with linear algebra. Especially, it studies the spectrum of the adjacency matrix, or the Laplacian matrix of a graph (this part of algebraic graph theory is also called spectral graph theory). For the Petersen graph, for example, the spectrum of the adjacency matrix is (−2, −2, −2, −2, 1, 1, 1, 1, 1, 3). Several theorems relate properties of the spectrum to other graph properties. As a simple example, a connected graph with diameter D will have at least D+1 distinct values in its spectrum. Aspects of graph spectra have been used in analysing the synchronizability of networks.
Using group theory
The second branch of algebraic graph theory involves the study of graphs in connection to group theory, particularly automorphism groups and geometric group theory. The focus is placed on various families of graphs based on symmetry (such as symmetric graphs, vertex-transitive graphs, edge-transitive graphs, distance-transitive graphs, distance-regular graphs, and strongly regular graphs), and on the inclusion relationships between these families. Certain of such categories of graphs are sparse enough that lists of graphs can be drawn up. By Frucht's theorem, all groups can be represented as the automorphism group of a connected graph (indeed, of a cubic graph). Another connection with group theory is that, given any group, symmetrical graphs known as Cayley graphs can be generated, and these have properties related to the structure of the group.
This second branch of algebraic graph theory is related to the first, since the symmetry properties of a graph are reflected in its spectrum. In particular, the spectrum of a highly symmetrical graph, such as the Petersen graph, has few distinct values (the Petersen graph has 3, which is the minimum possible, given its diameter). For Cayley graphs, the spectrum can be related directly to the structure of the group, in particular to its irreducible characters.
Studying graph invariants
Finally, the third branch of algebraic graph theory concerns algebraic properties of invariants of graphs, and especially the chromatic polynomial, the Tutte polynomial and knot invariants. The chromatic polynomial of a graph, for example, counts the number of its proper vertex colorings. For the Petersen graph, this polynomial is . In particular, this means that the Petersen graph cannot be properly colored with one or two colors, but can be colored in 120 different ways with 3 colors. Much work in this area of algebraic graph theory was motiva |
https://en.wikipedia.org/wiki/Whacking%20Day | "Whacking Day" is the twentieth episode of the fourth season of the American animated television series The Simpsons. It originally aired on the Fox network in the United States on April 29, 1993. The episode revolves around the fictional holiday "Whacking Day", celebrated annually, in which the citizens of Springfield drive snakes into the town square, then fatally club them. After Bart is expelled from school when he injures Superintendent Chalmers, he applies the knowledge he gains from Marge's homeschooling to help Lisa expose the fraudulent and cruel nature of the holiday.
The episode was written by John Swartzwelder and directed by Jeffrey Lynch; Barry White, who had expressed a wish to appear in the show, guest stars as himself. It was pitched by George Meyer, who wanted to create an episode against the mistreatment of snakes. The episode includes the first appearance of Superintendent Chalmers, and features an Itchy & Scratchy parody of Oliver Stone's film JFK. "Whacking Day" won a Genesis Award for "consciousness-raising on behalf of animal issues".
Plot
During an inspection by Superintendent Chalmers at Springfield Elementary School, Principal Skinner lures Bart, Jimbo, Kearney, Dolph, and Nelson into the school's utility basement with the promise of free mountain bikes and locks the door. Bart escapes through a ventilation shaft and takes Groundskeeper Willie's tractor for a joyride, accidentally crashing into Chalmers. Enraged at Bart for costing him a promotion, Skinner promptly expels Bart from the school. After Bart is quickly rejected from a new private Christian school, Marge decides to homeschool him.
Meanwhile, the local holiday Whacking Day is approaching. Each year on May 10, the people of Springfield drive snakes to the center of town and beat them to death. The tradition appalls Lisa, who finds no support from any of the adults of the town. Barry White arrives to begin the festivities, but quickly leaves in disgust when he discovers what the holiday is about.
After Marge takes Bart on a field trip to Olde Springfield Towne, Bart discovers that the origins of Whacking Day, which supposedly involved Jebediah Springfield, is a lie because it conflicts with a major Revolutionary War battle in which he took part, and suggests to Lisa that they lure the snakes to safety by playing music with heavy bass from the stereo speakers. White, who just happens to be walking by, agrees to help by singing "Can't Get Enough of Your Love, Babe", attracting hundreds of snakes into the house.
The pursuing crowd arrives, but they are soon turned around on the subject of Whacking Day by Bart's newfound knowledge. It turns out that the first Whacking Day was actually held in 1924 as an excuse to beat up the Irish. Lisa also tells the town about the positive influences that the snakes have had on the town folks, such as killing rodents. The town agrees to give up the tradition and Skinner is impressed with Bart's efforts and welcomes him back |
https://en.wikipedia.org/wiki/God%20of%20War%20%282005%20video%20game%29 | God of War is an action-adventure hack and slash video game developed by Santa Monica Studio and published by Sony Computer Entertainment (SCE). First released on March 22, 2005, for the PlayStation 2 (PS2) console, it is the first installment in the God of War series and the third chronologically. Loosely based on Greek mythology, it is set in ancient Greece with vengeance as its central motif. The player controls the protagonist Kratos, a Spartan warrior who serves the Olympian gods. The goddess Athena tasks Kratos with killing Ares, the God of War and Kratos' former mentor who tricked Kratos into killing his wife and daughter. As Ares besieges Athens out of hatred for Athena, Kratos embarks on a quest to find the one object capable of stopping the god once and for all: Pandora's Box.
The gameplay of God of War focuses on combo-based combat, achieved through the player's main weapon—the Blades of Chaos—and a secondary weapon acquired later in the game. It features quick time events that require the player to complete various game controller actions in a timed sequence to defeat stronger enemies and bosses. The player can use up to four magical attacks and a power-enhancing ability as alternative combat options. It also features puzzles and platforming elements.
God of War sold more than 4.6 million copies worldwide, making it the fourteenth best-selling PlayStation 2 game of all time. Regarded as one of the best action-adventure games for the platform, it won several "Game of the Year" awards. In 2009, entertainment website IGN named God of War the seventh-best PlayStation 2 game of all time. It has been highly praised for its graphics, sound, story, and gameplay and has been cited as one of the greatest video games ever made. The success of the game led to the development of eight more games and expansion into other media. The game and its first sequel, God of War II, were remastered and released in November 2009 as part of the God of War Collection, and in 2012, the remastered version was re-released as part of the God of War Saga, both for the PlayStation 3. A novelization of the game was published in May 2010, and a film adaptation had been in development for many years but was ultimately canceled.
Gameplay
God of War is a third-person single player action-adventure video game with hack and slash elements, viewed from a fixed camera perspective. The player controls the character Kratos in combo-based combat, platforming, and puzzle game elements, and battles Greek mythological foes that include undead soldiers, harpies, minotaurs, Medusa and the Gorgons, cyclopes, wraiths, Sirens, satyrs, centaurs, cerberuses, and boss opponents—the Hydra and a giant minotaur known as Pandora's Guardian. Platforming elements require the player to climb walls and ladders, jump across chasms, swing on ropes, and balance across beams to proceed through sections of the game. Some puzzles are simple, such as moving a box so that the player can use it as a ju |
https://en.wikipedia.org/wiki/Mario%20Vazquez | Mario Adrián Vázquez (born June 15, 1977) is an American singer from The Bronx, New York City. He competed on American Idol's fourth season, which aired on the FOX network in early 2005.
Biography
Early life
Raised by his single mother, Ada, in the Bronx, Vazquez is an alumnus of Fiorello H. LaGuardia High School of Music & Art and Performing Arts. He was also involved in the CityKids Repertory Company in New York City, which enabled him to travel the country and perform in front of the President and at major charitable functions and shelters. In 2005, he was reunited with his estranged father, Mario Rivera, who discovered that his son was on American Idol while channel surfing.
American Idol
After making it into the final round of twelve contestants on the hit reality show American Idol, Vazquez suddenly dropped out of the competition citing "personal family thing" a few days before the finals started. When the press contacted his mother regarding his decision, she was unaware why he had left the show.
There was much speculation about his decision; Vazquez appeared the next morning on "Good Day New York" on WNYW FOX5, and quashed rumors of a feud with "American Idol" producers or any of his competitors. "American Idol was only positive. They were only wonderful to me, from the beginning through the middle, to the end," he told the show. "It had nothing to do with the contract or anything signed with J Records." J Records is the same company that manages Idol winners Ruben Studdard and Fantasia Barrino. Vazquez later said that he wanted more artistic control and creating his own sound. He felt that since he was now known worldwide as a semi-finalist, he could end the competition and go solo. He believed that his musical success would not make a difference whether he quit as a semi-finalist or participated in the finals round. Vazquez was replaced on the show by Nikko Smith, who had previously been voted out.
Originally making the Top 12, Vazquez withdrew from the show due to personal reasons. He was replaced by Nikko Smith.
Music career-present
In August 2005, Vazquez signed with J Records/Arista Records and worked on an album executive produced by Clive Davis. Vazquez's manager was Arnold Stiefel, who also managed Rod Stewart. He worked with Ne-Yo, Akon, Soulshock and Karlin, Lester Mendez, Scott Storch, and Luny Tunes. Some of these artists' songs with Vasquez did not make the final cut on his album. His first single "Gallery" was released in May 2006, and reached number 35 on the Billboard Hot 100 chart. Vazquez's self-titled album was released September 26, 2006 by Arista Records.
Later that year, Vazquez performed on the Cartoon Network Friday block on August 25, 2006. A second single "One Shot" was released to radio in February 2007.
After leaving J Records in 2008, he worked with a few dance DJs, appearing on collaborations with Hype Jones and Ted Nilsson in 2012.
In 2012, he signed with ELEVEN 34 Records, and began work on his s |
https://en.wikipedia.org/wiki/Stanis%C5%82aw%20Tymi%C5%84ski | Stanisław "Stan" Tymiński (; born January 27, 1948) is a Canadian businessman of Polish origin, dealing in electronics and computers, and a sometime-politician in both Poland and Canada. Although Tymiński was born in Pruszków, he was a completely unknown person in his native Poland until shortly before the 1990 presidential election, he emerged from the first ballot as the second strongest candidate; defeating liberal prime minister Tadeusz Mazowiecki and forcing Solidarity leader Lech Wałęsa to stand a second ballot. After Wałęsa defeated him by a wide margin, Tymiński was a leader of Party X in Poland (1990–1995) and then returned to Canada to resume his business activities. Tymiński also contested the 2005 Polish presidential election.
1990 campaign
In 1990/1991, Tymiński led the Libertarian Party of Canada, a minor party which never received more than 0.3% of the vote. At the same time, he started a political career in his native Poland, where democracy had just been reestablished.
In the first free presidential elections on November 25, 1990, the two most promising candidates were Solidarity leader Lech Wałęsa and prime minister Tadeusz Mazowiecki. Wałęsa, the electrician, union leader and people's tribune, had the image of an emotional, shirtsleeves populist, while lawyer and former Solidarity legal advisor Mazowiecki appeared as a more respectable and intellectual, but also more formal compromiser.
Tymiński ran as a maverick candidate. He overtook Mazowiecki (18.1%) with 23.1% of the vote and placed second behind Wałęsa with 40.0%. As no candidate had achieved the absolute majority, a second ballot was required and held on December 9, 1990. In the second round, Tymiński lost to Wałęsa with just 25.8% of the total vote. The turnout in the ballots was 60.6% and 53.4%, respectively.
The reasons for Tymiński's unexpected success remain unclear. Tymiński promised to create wealth for everyone quickly, and had an image as a patriotic Pole who had "made it" abroad. He was well received at a time when radical political changes were taking place, but the overall economic situation was getting worse: by the end of 1990, unemployment had increased from nearly zero to 6.5 percent, and gross national income had dropped by over 11 percent: the opening up of the economy had had a particularly negative effect on the standard of living for workers in sunset industries, small farmers and pensioners. Many people were increasingly disappointed with the conflict that had broken out within the former anti-communist opposition, making the unknown but seemingly honest and patriotic candidate appealing.
Another potential factor was that Tymiński applied methods of political marketing which were unknown in Poland at that time. A key element of his campaign was a black briefcase he was rarely seen without – allegedly containing "secret documents" that were going to destroy his rivals' careers and that he would present when the time was due. Although the electi |
https://en.wikipedia.org/wiki/Row-%20and%20column-major%20order | In computing, row-major order and column-major order are methods for storing multidimensional arrays in linear storage such as random access memory.
The difference between the orders lies in which elements of an array are contiguous in memory. In row-major order, the consecutive elements of a row reside next to each other, whereas the same holds true for consecutive elements of a column in column-major order. While the terms allude to the rows and columns of a two-dimensional array, i.e. a matrix, the orders can be generalized to arrays of any dimension by noting that the terms row-major and column-major are equivalent to lexicographic and colexicographic orders, respectively.
Data layout is critical for correctly passing arrays between programs written in different programming languages. It is also important for performance when traversing an array because modern CPUs process sequential data more efficiently than nonsequential data. This is primarily due to CPU caching which exploits spatial locality of reference. In addition, contiguous access makes it possible to use SIMD instructions that operate on vectors of data. In some media such as magnetic-tape data storage, accessing sequentially is orders of magnitude faster than nonsequential access.
Explanation and example
The terms row-major and column-major stem from the terminology related to ordering objects. A general way to order objects with many attributes is to first group and order them by one attribute, and then, within each such group, group and order them by another attribute, etc. If more than one attribute participates in ordering, the first would be called major and the last minor. If two attributes participate in ordering, it is sufficient to name only the major attribute.
In the case of arrays, the attributes are the indices along each dimension. For matrices in mathematical notation, the first index indicates the row, and the second indicates the column, e.g., given a matrix , the entry is in its first row and second column. This convention is carried over to the syntax in programming languages, although often with indexes starting at 0 instead of 1.
Even though the row is indicated by the first index and the column by the second index, no grouping order between the dimensions is implied by this. The choice of how to group and order the indices, either by row-major or column-major methods, is thus a matter of convention. The same terminology can be applied to even higher dimensional arrays. Row-major grouping starts from the leftmost index and column-major from the rightmost index, leading to lexicographic and colexicographic (or colex) orders, respectively.
For example, the array
could be stored in two possible ways:
Programming languages handle this in different ways. In C, multidimensional arrays are stored in row-major order, and the array indexes are written row-first (lexicographical access order):
On the other hand, in Fortran, arrays are stored in column-ma |
https://en.wikipedia.org/wiki/HeinOnline | HeinOnline (HOL) is a commercial internet database service launched in 2000 by William S. Hein & Co., Inc. (WSH Co), a Buffalo, New York publisher specializing in legal materials. The company began in Buffalo, New York, in 1961, and is currently based in nearby Getzville, NY. In 2013, WSH Co. was the 33rd largest private company in western New York, with revenues of around $33 million and more than seventy employees.
HeinOnline is a source for traditional legal materials (reported cases, statutes, government regulations, academic law reviews, commercially produced law journals and magazines, and classic treatises), historical, governmental, and political documents, legislative debates, legislative and executive branch reports, world constitutions, international treaties, and reports and other documents of international organizations. The database includes more than 192 million pages of materials “in an online, fully searchable, image-based format".
New product award
In 2001, HeinOnline received the coveted “New Product Award,” from the American Association of Law Libraries. Since then HOL has received this award two more times in recognition of new content libraries added to its constantly expanding database. In 2002, HOL was named as a “Best Commercial Website” by the International Association of Law Libraries. In 2007, EContent Magazine listed HOL among the hundred “companies that matter most in the digital content industry.” The list “represents the best and the brightest digital content companies.” More recently HOL's World's Constitutions Illustrated was named by Choice magazine as an "Outstanding Title" for 2010. A little more than a decade after HOL went live, a publication of the American Association of Law Libraries referred to it as a "groundbreaking product" and as "a leader in online legal literature".
2013 survey
In 2013, a survey of domestic and international law librarians ranked HeinOnline as one of the three most popular "subscription databases" among law libraries throughout the world. This survey ranked HOL just behind the much larger and more highly capitalized Westlaw and Lexis. According to this survey, conducted by a London-based law librarian, “These top three easily dominated the subscription database market across all major law libraries, across the world.” They also “dominated University law school libraries.” Significantly, among “Research Institute Libraries” HOL ranked first while the much larger Lexis and Westlaw dropped to third and fourth. HOL and Westlaw were tied for first among the most popular “subscription databases” in Public Libraries. Among North American law libraries HOL, Lexis and Westlaw were tied for the highest number of subscriptions, in Asia (excluding the Middle East) HOL was tied with Lexis for second place behind Westlaw and in Europe HOL ranked third, behind Westlaw and Lexis. This suggests that the smaller HOL has as great a presence at home and nearly so in Europe and Asia as its much la |
https://en.wikipedia.org/wiki/Odigo%20Messenger | Odigo Messenger was an early social networking service based on instant messaging. Odigo believed in connecting and forming friendships: members would "meet" if two or more visited the same web site simultaneously. Odigo Messenger allowed members to connect to other IM networks, such as ICQ, MSN Messenger, Yahoo! Messenger and AOL Instant Messenger.
Odigo was purchased for an estimated $20 million by the Israeli company Comverse Technology in 2002. Comverse leveraged Odigo server software for instant messaging solutions in cell phones. However, since Comverse had no real interest in maintaining a generic IM service, it eventually shut down the free service in 2004.
The service first became available in 1999 and carried multiple brands during a spell of affiliations with different web services provider. Although originally made available by Odigo, Inc., the service was supplied by Comverse, who used it to help innovate and forward their wireless products.
The word Odigo comes from the Greek "οδηγώ" which means "I guide/lead/drive/steer".
Odigo and the 9/11 investigation
Odigo reported that, two hours before the September 11, 2001 attacks, two of their employees who were working in an Odigo office in Herzliya Pituah, a city near Tel Aviv, received a hostile English electronic instant message non-specifically threatening them that a terrorist attack would happen. They did not mention this to their employer until after they heard reports of a terrorist attack in the United States on the news, after which they informed the company's management. One of Odigo's New York offices was then situated within a mile of the World Trade Center complex. However, the threatening message did not mention the location of an attack.
The company took the initiative in tracking down the originating IP address of the message, giving the information to the FBI, so that the FBI could track down the Internet Service Provider, and the actual sender of the original message. Using the "people-search" function, Odigo users can send anonymous messages anywhere in the world to other users, who they can find based on demographics or location. According to The Washington Post, the message declared "that some sort of attack was about to take place. The notes ended with an anti-Semitic slur. The messages said 'something big was going to happen in a certain amount of time'".
See also
September 11 attacks advance-knowledge conspiracy theories
References
Windows instant messaging clients
Software companies of Israel
September 11 attacks
Defunct instant messaging clients |
https://en.wikipedia.org/wiki/Fieldbus | A fieldbus is a member of a family of industrial digital communication networks used for real-time distributed control. Fieldbus profiles are standardized by the
International Electrotechnical Commission (IEC) as IEC 61784/61158.
A complex automated industrial system is typically structured in hierarchical levels as a distributed control system (DCS). In this hierarchy the upper levels for production managements are linked to the direct control level of programmable logic controllers (PLC) via a non-time-critical communications system (e.g. Ethernet). The fieldbus links the PLCs of the direct control level to the components in the plant of the field level such as sensors, actuators, electric motors, console lights, switches, valves and contactors and replaces the direct connections via current loops or digital I/O signals. The requirement for a fieldbus are therefore time-critical and cost sensitive. Since the new millennium a number of fieldbuses based on Real-time Ethernet have been established. These have the potential to replace traditional fieldbuses in the long term.
Description
A fieldbus is an industrial network system for real-time distributed control. It is a way to connect instruments in a manufacturing plant. A fieldbus works on a network structure which typically allows daisy-chain, star, ring, branch, and tree network topologies. Previously, computers were connected using RS-232 (serial connections) by which only two devices could communicate. This would be the equivalent of the currently used 4–20 mA communication scheme which requires that each device have its own communication point at the controller level, while the fieldbus is the equivalent of the current LAN-type connections, which require only one communication point at the controller level and allow multiple (hundreds) of analog and digital points to be connected at the same time. This reduces both the length of the cable required and the number of cables required. Furthermore, since devices that communicate through a fieldbus require a microprocessor, multiple points are typically provided by the same device. Some fieldbus devices now support control schemes such as PID control on the device side instead of forcing the controller to do the processing.
History
The most important motivation to use a fieldbus in a distributed control system is to reduce the cost for installation and maintenance of the installation without losing the high availability and reliability of the automation system. The goal is to use a two wire cable and simple configuration for field devices from different manufacturers. Depending on the application, the number of sensors and actuators vary from hundreds in one machine up to several thousands distributed over a large plant. The history of the fieldbus shows how to approach these goals.
Precursors of fieldbuses
General Purpose Interface Bus (GPIB)
Arguably the precursor field bus technology is HP-IB as described in IEEE 488 in 1975. "It bec |
https://en.wikipedia.org/wiki/Jacek%20Karpi%C5%84ski | Jacek Karpiński (9 April 1927 21 February 2010) was a Polish pioneer in computer engineering and computer science.
During World War II, he was a soldier in the Batalion Zośka of the Polish Home Army, and was awarded multiple times with a Cross of Valour. He took part in Operation Kutschera (intelligence) and the Warsaw Uprising, where he was heavily wounded.
Later, he became a developer of one of the first machine learning algorithms, techniques for character and image recognition.
After receiving a UNESCO award in 1960, he travelled for several years around the academic centres in the United States, including MIT, Harvard, Caltech, and many others.
In 1971, he designed one of the first minicomputers, the K-202. Because of the policy on computer development in the People's Republic of Poland, belonging to the Comecon that time, the K-202 was never mass-produced.
Karpiński later became a pig farmer, and in 1981, after receiving a passport, emigrated to Switzerland.
He also founded the Laboratory for Artificial Intelligence of the Polish Academy of Sciences in the early 1960s.
Family and childhood
Jacek Karpiński was born on 9 April 1927 in Turin, Italy into a family of Polish intellectuals and alpinists. His father, Adam 'Akar' Karpiński, was a prominent aeronautic engineer (who co-constructed the SL-1 Akar, the first glider constructed entirely by the Poles) and inventor, credited with projects of innovative climbing equipment (crampons, 'Akar-Ramada' tent). His mother, Wanda Czarnocka-Karpińska, was a respected physician who went on to become Dean of the University of Physical Education in Warsaw. Both were pioneers of winter mountaineering in the Tatra Mountains (first successful winter attacks on Banówka, Nowy Wierch, Lodowy Szczyt and others). Adam Karpiński was also a member of a Polish expedition into the Andes, which was the first to climb the peak Mercedario (6720 m.). Karpiński himself was due to be born in the Vallot winter hut near Mont Blanc, but due to the extreme weather conditions, his parents had to retreat to Turin, where their first child was born.
Karpiński had one younger brother, Marek, who also became an electrical engineer. The family moved from Biała Podlaska to Warsaw in 1934, where Wanda took a job at Physical University of Warsaw and Adam worked in PZL (Polish Aviation Works). Karpiński's father died in September 1939 during an expedition to Nanda Devi in the Himalayas. After an unsuccessful attack on the summit, along with Stefan Bernadzikiewicz, he decided to climb the nearby Tirsuli (7039m), where both were killed by an avalanche.
Wartime
Karpiński's life was changed not only by his father's death but by the outbreak of World War II. Despite his young age (fourteen at the time), by pretending to be seventeen, he managed to join the Gray Ranks, a Polish underground paramilitary boy scouts organization, where he served in Grupy Szturmowe (Assault Groups).
In early 1943, he was severely injured while working |
https://en.wikipedia.org/wiki/Robert%20Kowalski | Robert Anthony Kowalski (born 15 May 1941) is an American-British logician and computer scientist, whose research is concerned with developing both human-oriented models of computing and computational models of human thinking. He has spent most of his career in the United Kingdom.
Education
He was educated at the University of Chicago, University of Bridgeport (BA in mathematics, 1963), Stanford University (MSc in mathematics, 1966), University of Warsaw and the University of Edinburgh (PhD in computer science, 1970).
Career
He was a research fellow at the University of Edinburgh (1970–75) and has been at the Department of Computing, Imperial College London since 1975, attaining a chair in Computational logic in 1982 and becoming Emeritus Professor in 1999.
He began his research in the field of automated theorem proving, developing both SL-resolution with Donald Kuehner and the connection graph proof procedure. He developed SLD resolution and the procedural interpretation of Horn clauses, which underpin the operational semantics of backward reasoning in logic programming. With Maarten van Emden, he also developed the minimal model and the fixpoint semantics of Horn clauses, which underpin the logical semantics of logic programming.
With Marek Sergot, he developed both the event calculus and the application of logic programming to legal reasoning. With Fariba Sadri, he developed an agent model in which beliefs are represented by logic programs and goals are represented by integrity constraints.
Kowalski was one of the developers of abductive logic programming, in which logic programs are augmented with integrity constraints and with undefined, abducible predicates. This work led to the demonstration with Phan Minh Dung and Francesca Toni that most logics for default reasoning can be regarded as special cases of assumption-based argumentation.
In his 1979 book, Logic for Problem Solving, Kowalski argues that logical inference provides a simple and powerful model of problem solving that can be used by both humans and computers. In his 2011 book, Computational Logic and Human Thinking - How to be Artificially Intelligent, he argues that the use of computational logic can help ordinary people to improve their natural language communication skills, and that in combination with decision theory, it can be used to improve their practical problem-solving abilities.
In joint work with Fariba Sadri, he has developed the logic and computer language LPS, (Logic Production Systems), which integrates much of his previous work on computational logic. He has continued his interest in the development of artificial intelligence.
Honours and awards
Kowalski was elected a Fellow of the American Association for Artificial Intelligence in 1991, of the European Co-ordinating Committee for Artificial Intelligence in 1999, and the Association for Computing Machinery in 2001. In 2011, he received the IJCAI Award for Research Excellence, "for his contributions to lo |
https://en.wikipedia.org/wiki/Dick%20Hustvedt | Richard "Dick" Irvin Hustvedt (February 18, 1946 – April 15, 2008) was a renowned software engineer, designer and developer of several operating systems including Digital Equipment Corporation's RSX-11, and VMS.
Personal history
Hustvedt was born in Aberdeen, South Dakota and grew up in Radcliff, Kentucky, home of Fort Knox. He attended the University of California, Berkeley studying computer science and was later employed by the Army Security Agency. Following the ASA, Dick worked for the Xerox Corporation on the development of operating systems for their Data Systems division (Xerox DSD Development Programming in El Segundo, California), and was a principal kernel developer of the Xerox Data Systems (XDS) RAD-75, RBM-1 and CP-V operating systems.
He was recruited by Ken Olsen to join Digital Equipment Corporation (DEC) in 1974. He moved from Los Angeles, California to Concord, Massachusetts where he worked at the company headquarters at "The Mill" in Maynard, Massachusetts.
Married to Audrey R. Reith in 1976. Father of sons Eric Hustvedt (1978) and Marc Hustvedt (1979).
On January 13, 1984, he suffered a severe head injury in an automobile accident in Acton, Massachusetts. He resided in New Hampshire at the time of his death on April 15, 2008.
The VAX/VMS development team, now OpenVMS and part of Hewlett-Packard, named a conference room in his honor in Nashua, New Hampshire facility.
DEC
Dick Hustvedt was one of the three principal designers of VMS, along with Dave Cutler and Peter Lipman. VMS was first conceived in 1976 as the operating system for the 32-bit, virtual memory line of computers eventually named VAX. Version V1.0 shipped in 1978 and the VAX and VMS became flagship products for DEC. Hustvedt was also the driving force behind the development of DEC's VAXcluster, which was the first clustering system to achieve commercial success, and was a major selling point for VAX systems.
His sense of humor is behind the fact that the TIMEPROMPTWAIT variable in VMS is famously defined in "microfortnights".
References
"Nothing Stops It: VAX OpenVMS at 20"
"DEC used by Digital itself:" PDP11 Processor Handbook (1973): page 8, "DEC, PDP, UNIBUS are registered trademarks of Digital Equipment Corporation;" page 1-4, "Digital Equipment Corporation (DEC) designs and manufacturers many of the peripheral devices offered with PDP-11's. As a designer and manufacturer of peripherals, DEC can offer extremely reliable equipment... The LA30 DECwriter, a totally DEC-designed and built teleprinter, can serve as an alternative to the Teletype."
Edgar H. Schein, Peter S. DeLisi, Paul J. Kampas, and Michael M. Sonduck, DEC Is Dead, Long Live DEC: The Lasting Legacy of Digital Equipment Corporation (San Francisco: Barrett-Koehler, 2003), .
"VAX-11" 1st Edition - Dick Hustvedt, 1975 [A19] - Stanford
External links
Windows NT and VMS: The Rest of the Story
OpenVMS Frequently Asked Questions (FAQ)
Nothing Stops It: VAX OpenVMS at 20
Dick Hustvedt, t |
https://en.wikipedia.org/wiki/PWA | PWA may refer to:
Aviation
Wiley Post Airport (IATA airport code), Oklahoma City, Oklahoma, U.S.
Pacific Western Airlines
Computing
Pirates with Attitudes, a warez release group
Picasa Web Albums
Progressive web app
Project Web Access, later renamed Project Web App, a component of Microsoft Project Server
Organizations
Provincial Waterworks Authority, a Thai state water supply company
Public Works Administration, the construction agency of the US New Deal program
Patients' Welfare Association in Karachi, Pakistan
Progressive Writers' Association, in pre-partition India
The Polytechnic of Western Australia
Sports
Professional Windsurfers Association; see Windsurfing
Prairie Wrestling Alliance, a Canadian professional wrestling promotion based in Edmonton
Reality of Wrestling or Pro Wrestling Alliance, a US independent professional wrestling promotion
Pro Wrestling America, a defunct independent professional wrestling promotion
Pure Wrestling Association, a Canadian professional wrestling promotion; see Melissa Maughn
Other uses
People With AIDS, an initialism
People with albinism, an initialism
Portuguese West Africa, now Angola
Partial wave analysis, a technique in quantum mechanics
Pixel Wolf Animations, a YouTube channel
See also
Pro Wrestling Women's Alliance |
https://en.wikipedia.org/wiki/Communications%20and%20networking%20riser | Communications and networking riser (CNR) is a slot found on certain PC motherboards and used for specialized networking, audio, and telephony equipment. A motherboard manufacturer can choose to provide audio, networking, or modem functionality in any combination on a CNR card. CNR slots were once commonly found on Pentium III-class motherboards, but have since been phased out in favor of on-board or embedded components.
Technology
Physically, a CNR slot has two rows of 30 pins, with two possible pin configurations: Type A and Type B, each with different pin assignments. CNR Type A uses 8-pin PHY interface, while Type B uses 17-pin media-independent interface (MII) bus LAN interface. Both types carry USB and AC'97 signals.
As with AMR, CNR had the cost savings potential for manufacturers by removing analog I/O components from the motherboard. This allowed the manufacturer to only certify with the US Federal Communications Commission (FCC) for the CNR card, and not the entire motherboard. This resulted in a quicker production-to-market time for new motherboards, and allowed mass-production of CNR cards to be used on multiple motherboards.
The ACR slot was a competing specification developed by a group of third-party vendors. Its principal advantage over CNR was the backwards-compatible slot layout which allowed it to use both AMR and ACR cards. The same group also developed a physically smaller version, the MDC.
History
Intel developed the CNR slot to replace its own audio/modem riser (AMR) technology, drawing on two distinct advantages over the AMR slot it replaced; CNR was both capable of being either software based (CPU-controlled) or hardware accelerated (dedicated ASIC), and was plug-and-play compatible. On some motherboards, a CNR slot replaced the last PCI slot, but most motherboard manufacturers engineered boards which allow the CNR and last PCI slot to share the same space.
With the integration of components such as ethernet and audio into the motherboard, the CNR is obsolete, and is not found on PC motherboards anymore.
See also
Advanced Communications Riser (ACR)
Audio/modem riser (AMR)
GeoPort
Mobile daughter card (MDC)
External links
CNR Specification 1.1
webopedia.com - CNR definition
pinouts.ru - CNR slot pinout and signals
Motherboard expansion slot |
https://en.wikipedia.org/wiki/Wellington%20Internet%20Exchange | The Wellington Internet Exchange (WIX) is an Ethernet-based neutral peering point running over the CityLink metropolitan network in Wellington, New Zealand. It is part of CityLink's ExchangeNET group of peering exchanges.
The Wellington Internet Exchange (WIX) was established to allow entities connected to the CityLink metropolitan network in Wellington to send traffic directly to and from each other rather than via their ISP. This activity is known as peering.
This provides improvements in speed as traffic travels directly between the parties and reduces load on the network by reducing the need for traffic to be duplicated through one or more intermediate ISP routers. In some cases this also avoids traffic being routed "out of town", or incurring ISP's traffic charges.
Each connected entity could add specific details of networks they want to talk to directly to their routers (static routes and bilateral BGP sessions) but this quickly becomes an administrative headache as adds, changes and deletions become time-consuming and error prone if more than a few peering sessions are configured.
The Wellington Internet Exchange provides two route servers which contain routing details for each of the participants. This simplifies peering enormously for most exchange users.
The WIX has been described as a world-first for a distributed metropolitan Ethernet-based Internet exchange. WIX was also the first internet exchange to connect an OpenFlow-controlled device to the public internet.
See also
List of Internet exchange points
References
External links
Wellington Internet Exchange
Internet exchange points in New Zealand |
https://en.wikipedia.org/wiki/Air%20Bangladesh | Air Bangladesh was an airline based in Bangladesh. It was founded in 2000 and dissolved in 2005.
Code data
IATA Code: B9
ICAO Code: BGD
Callsign: AIR BANGLA
Fleet
Air Bangladesh (no relation to Biman Bangladesh Airlines) operated only one older jet aircraft, a Boeing 747-269B(SF) (registration S2-ADT). The aircraft was acquired by Air Bangladesh in August 2004 and was painted in a basic and Kalitta Air color.
Ban in the European Union
Air Bangladesh was banned from entering EU airspace. The reasons for this decision were safety deficiencies, as well as poor transparency of the airline's operations. the Commission assessed that Air Bangladesh should be submitted to a strict operational restriction.
References
External links
Defunct airlines of Bangladesh
Airlines established in 2000
Airlines disestablished in 2005
Bangladeshi companies established in 2000
2005 disestablishments in Bangladesh |
https://en.wikipedia.org/wiki/Interior-point%20method | Interior-point methods (also referred to as barrier methods or IPMs) are a certain class of algorithms that solve linear and nonlinear convex optimization problems.
An interior point method was discovered by Soviet mathematician I. I. Dikin in 1967 and reinvented in the U.S. in the mid-1980s.
In 1984, Narendra Karmarkar developed a method for linear programming called Karmarkar's algorithm, which runs in provably polynomial time and is also very efficient in practice. It enabled solutions of linear programming problems that were beyond the capabilities of the simplex method. In contrast to the simplex method, it reaches a best solution by traversing the interior of the feasible region. The method can be generalized to convex programming based on a self-concordant barrier function used to encode the convex set.
Any convex optimization problem can be transformed into minimizing (or maximizing) a linear function over a convex set by converting to the epigraph form. The idea of encoding the feasible set using a barrier and designing barrier methods was studied by Anthony V. Fiacco, Garth P. McCormick, and others in the early 1960s. These ideas were mainly developed for general nonlinear programming, but they were later abandoned due to the presence of more competitive methods for this class of problems (e.g. sequential quadratic programming).
Yurii Nesterov, and Arkadi Nemirovski came up with a special class of such barriers that can be used to encode any convex set. They guarantee that the number of iterations of the algorithm is bounded by a polynomial in the dimension and accuracy of the solution.
Karmarkar's breakthrough revitalized the study of interior-point methods and barrier problems, showing that it was possible to create an algorithm for linear programming characterized by polynomial complexity and, moreover, that was competitive with the simplex method.
Already Khachiyan's ellipsoid method was a polynomial-time algorithm; however, it was too slow to be of practical interest.
The class of primal-dual path-following interior-point methods is considered the most successful.
Mehrotra's predictor–corrector algorithm provides the basis for most implementations of this class of methods.
Primal-dual interior-point method for nonlinear optimization
The primal-dual method's idea is easy to demonstrate for constrained nonlinear optimization.
For simplicity, consider the following nonlinear optimization problem with inequality constraints:
This inequality-constrained optimization problem is solved by converting it into an unconstrained objective function whose minimum we hope to find efficiently.
Specifically, the logarithmic barrier function associated with (1) is
Here is a small positive scalar, sometimes called the "barrier parameter". As converges to zero the minimum of should converge to a solution of (1).
The gradient of a differentiable function is denoted .
The gradient of the barrier function is
In addition to the original ("pr |
https://en.wikipedia.org/wiki/Grand%20Prix%203 | Grand Prix 3 is a computer racing simulator by MicroProse, released in 2000 by Hasbro Interactive.
Gameplay
The game is known for featuring the 1998 Formula One season (with all drivers except Jacques Villeneuve, who is instead replaced by a fictional character, John Newhouse). In August 2001 an expansion pack, Grand Prix 3 2000 Season, was released, updating the game to feature the 2000 season's cars and drivers (including Villeneuve), as well as the 2 new circuits on the calendar, the Sepang International Circuit in Malaysia and the Indianapolis Motor Speedway.
Reception
Critical reviews
The game received "generally favorable reviews" according to the review aggregation website Metacritic. It was not quite as well received as its predecessors, but at the time was widely considered to be the best racing simulation available.
The editors of Computer Gaming World nominated Grand Prix 3 as the best racing game of 2000, although it lost to Motocross Madness 2. They described Grand Prix 3 as a "precisely tuned" title.
Sales
In Europe, Grand Prix 3 sold 300,000 units in one month. Italy made up above 30,000 sales of this number, while Spain accounted for 6,500. Multiplayer.it attributed the relatively low sales in Spain to that country's rampant software piracy problem.
In the German market, Grand Prix 3 sold 40,000 units in its first three days of availability. Debuting at #2 on Media Control's computer game sales chart for July 2000, it rose to first place the following month, before claiming fourth in September. The Verband der Unterhaltungssoftware Deutschland (VUD) presented Grand Prix 3 with a "Gold" award at the end of that month, indicating sales of at least 100,000 units across Germany, Austria and Switzerland. The game proceeded to place seventh, ninth and 18th on Media Control's charts through the end of 2000.
Although Grand Prix 3 passed the 100,000-sale mark in German-speaking countries, Udo Hoffman of PC Player reported that it had fallen below Hasbro Interactive's projections by late 2000, and that the publisher was "more than a little disappointed" in its performance. The company's product manager, Thomas Sewing, blamed this outcome in part on high competition from other titles with the Formula One license. Grand Prix 3 continued to chart on Media Control's top 30 in 2001, placing 19th in January, 23rd in February and 17th in March.
In the United Kingdom, Grand Prix 3 received a "Silver" certificate from the Entertainment and Leisure Software Publishers Association (ELSPA), for at least 100,000 sales in the region.
References
External links
2000 video games
Formula One video games
Racing simulators
MicroProse games
Multiplayer and single-player video games
Video games developed in the United Kingdom
Video games set in 1998
Video games with expansion packs
Windows games
Windows-only games |
https://en.wikipedia.org/wiki/Perth%20railway%20station | Perth railway station is the largest station on the Transperth network, serving the central business district of Perth, Western Australia. It serves as an interchange between the Airport, Armadale, Fremantle, Midland, and Thornlie lines as well as Transwa's Australind service. It is also directly connected to Perth Underground railway station, which has the Joondalup line and Mandurah line.
History
Establishment
The foundation stone for the original Richard Roach Jewell-designed Perth station was laid on 10 May 1880, with the station opening on 1 March 1881 as part of the Eastern Railway from Fremantle to Guildford. The station had one through platform with a terminating dock platform at the east end; however it soon proved to be inadequate for the growing railway, and after the opening of the Armadale line in 1889 put further stress on the facility it was decided that a larger station would be built.
The new, larger Victorian Free Classical style station building, designed by George Temple-Poole, was opened south of the original station in 1894, with the old building demolished and replaced by a new island platform. The new station building, still in use today, has been expanded numerous times since being built, including the addition of two wings at the east and west ends of the building. A planned third storey and clocktower were never built. A collection of freight and administrative offices and tearooms were also part of the railway station complex. The station initially had the Barrack Street and William Street bridges as limiting factors to its further development, though platforms to the west of the station that ran underneath the Horseshoe Bridge were eventually constructed.
The station was the centre of the Western Australian Government Railways system, with most regional trains originating from the station, and it also served as the headquarters of the agency until 1976. Following the cessation of most regional passenger services, the completion of standard gauge tracks to East Perth station, and the relocation of most administrative offices to the Westrail Centre, by the late 1970s Perth station remained only as a terminus for The Australind service to Bunbury, as well as an interchange for Transperth's suburban services.
The railway building has at times housed various commercial operations as well as police offices. The WA Craft Council was a tenant in the 1980s. For a considerable length of time the forecourt area was used for car parking, though this is no longer the case.
Later development
As early as the 1950s, there were moves and suggestions for the redevelopment of the station area. Starting in 1988 the station underwent a major upgrade as part of the Northern Suburbs Transit System project, which included the construction of a new island platform, a steel and glass roof that covered the central platforms, an adjoining multi-storey car park, and the Citiplace Centre retail and community services hub built on a level a |
https://en.wikipedia.org/wiki/Netpbm | Netpbm (formerly Pbmplus) is an open-source package of graphics programs and a programming library. It is used mainly in the Unix world, where one can find it included in all major open-source operating system distributions, but also works on Microsoft Windows, macOS, and other operating systems.
File formats
Several graphics formats are used and defined by the Netpbm project:
portable pixmap format (PPM),
portable graymap format (PGM)
portable bitmap format (PBM)
are image file formats designed to be easily exchanged between platforms. They are also sometimes referred to collectively as the portable anymap format (PNM), not to be confused with the related portable arbitrary map format (PAM). The "magic number" (Px) at the beginning of a file determines the type, not the file extension, although it is best practice to use the correct extension if possible.
The PBM format was invented by Jef Poskanzer in the 1980s as a format that allowed monochrome bitmaps to be transmitted within an email message as plain ASCII text, allowing it to survive any changes in text formatting. Poskanzer developed the first library of tools to handle the PBM format, Pbmplus, released in 1988. It mainly contained tools to convert between PBM and other graphics formats. By the end of 1988, Poskanzer had developed the PGM and PPM formats along with their associated tools and added them to Pbmplus. The final release of Pbmplus was December 10, 1991.
In 1993, the Netpbm library was developed to replace the unmaintained Pbmplus. It was simply a repackaging of Pbmplus with additions and fixes submitted by people all over the world.
Description
Each file starts with a two-byte magic number (in ASCII) that identifies the type of file it is (PBM, PGM, and PPM) and its encoding (ASCII/"plain" or binary/"raw"). The magic number is a capital P followed by a single-digit number.
A value of P7 refers to the PAM file format that is covered as well by the netpbm library.
The ASCII ("plain") formats allow for human readability and easy transfer to other platforms; the binary ("raw") formats are more efficient in file size but may have native byte-order issues.
In the binary formats, PBM uses 1 bit per pixel, PGM uses 8 or 16 bits per pixel, and PPM uses 24 bits per pixel: 8 for red, 8 for green, 8 for blue. Some readers and writers may support 48 bits per pixel (16 each for R,G,B), but this is still rare.
Conventionally PGM stores values in linear color space, but depending on the application, it can often use either sRGB or a simplified gamma representation. The file data doesn't state which color space it is using, and must be chosen by the user or other software. 16-bit PGM almost always is stored as linear, as gamma correction is usually advantageous only in 8-bit formats.
Usually, 8-bit PPM format stores colors in a nonlinear format, conventionally CIE Rec. 709 for red, green, and blue, adjusted by the CIE Rec. 709 gamma transfer function. However it is very common to |
https://en.wikipedia.org/wiki/McIver%20railway%20station | McIver railway station is a railway station on the Transperth network in Perth, Western Australia. It is located on the Armadale, Thornlie, Midland and Airport lines, 0.9 kilometres from Perth station, providing access to Royal Perth Hospital.
History
The station was opened on 1 September 1989 and named after Ken McIver, a long serving steam engine driver and Labor member of the Western Australian Legislative Assembly for Northam and Avon from 1968 until 1986. The station was purpose-built to provide access directly to Royal Perth Hospital.
Platforms
McIver station is one of the two stations that service the Midland, Airport, Armadale and Thornlie lines, with the other station being Claisebrook. The station saw 564,672 passengers in the 2013-14 financial year.
The following platforms are currently in use at McIver:
It is set to receive Airport line services commencing on 9 October 2022.
Bus routes
References
Railway stations in Australia opened in 1989
Transperth railway stations
Airport line, Perth |
https://en.wikipedia.org/wiki/Claisebrook%20railway%20station | Claisebrook railway station is a railway station on the Transperth network. It is located on the Armadale line, Thornlie line, Midland line, and Airport line, 1.3 kilometres from Perth station serving the suburb of East Perth.
History
Opened in 1883 under the name East Perth, Claisebrook station is a busy junction along the Airport, Midland, Armadale and Thornlie lines lines due to both lines running through the station and the Claisebrook railway depot being next door.
The original railway station was built in timber with hardwood weatherboarding and external and timber lining. Rendered brick fireplaces were built in two of the rooms - possibly the waiting rooms and railway staff room and had very elegant rendered chimney caps providing a balance to the roof.
The Battye library carries the original plans and shows exposed heavy timber trussing of the roof which was very typical of the architecture of railway buildings of the era. The roofing was corrugated iron curved to provide a concave upper surface with the roof overhanging the tracks and providing cover to passengers leaving and arriving at the station. As railway rolling stock grew taller the wide eaves and the timber trussing of the roof were trimmed back giving the roof a truncated appearance.
The station was located centrally between the east and west bound tracks and provided access to both. In 1984 the station was relocated to Whiteman Park to be the Central Station on the light railway system under construction in the majority by the Western Australian Light Railway Preservation Association and the Metropolitan Region Planning Authority funded under Wage Pause and Community Employment Programmes.
In 1969, a new railway terminal was built 600 m away on the Midland line called East Perth, and caused this station to be renamed Claisebrook after a watercourse that is near the station. Between 2002 and 2003 the station was mostly rebuilt with new station structures, signage, platform finishes and a footbridge.
It has received Airport line services since 9 October 2022.
Platforms
The station saw 535,085 passengers in the 2013-14 financial year.
The following platforms are currently in use at Claisebrook:
Bus connections
Connections are available by Yellow CAT, which serves throughout East Perth, West Perth, and the City's centre corridor.
References
East Perth, Western Australia
Railway stations in Australia opened in 1883
Transperth railway stations
Airport line, Perth |
https://en.wikipedia.org/wiki/Jochen%20Liedtke | Jochen Liedtke (26 May 1953 – 10 June 2001) was a German computer scientist, noted for his work on microkernel operating systems, especially in creating the L4 microkernel family.
Career
Education
In the mid-1970s Liedtke studied for a diploma degree in mathematics at the Bielefeld University. His thesis project was to build a compiler for the programming language ELAN, which had been launched for teaching programming in German schools. The compiler was written in ELAN.
Post grad
After his graduation in 1977, he remained at Bielefeld and worked on an Elan environment for the Zilog Z80 microprocessor. This required a runtime system (environment), which he named Eumel ("Extendable Multiuser Microprocessor ELAN-System", but also a colloquial north-German term for a likeable fool). Eumel grew into a complete multi-tasking, multi-user operating system supporting orthogonal persistence, which started shipping (by whom? to whom?) in 1980 and was later ported to Zilog Z8000, Motorola 68000 and Intel 8086 processors. As these processors lacked memory protection, Eumel implemented a virtual machine which added the features missing from the hardware. More than 2000 Eumel systems shipped, mostly to schools, and some to legal practices as a text processing platform.
In 1984, he joined the (GMD), the German National Research Center for Computer Science, which is now a part of the Fraunhofer Society. There, he continued his work on Eumel. In 1987, when microprocessors supporting virtual memory became widely available in the form of the Intel 80386, Liedtke started to design a new operating system to succeed Eumel, which he called L3 ("Liedtke's 3rd system", after Eumel and the ALGOL 60 interpreter he had written in high school). L3 was designed to achieve better performance by using the latest hardware features, and was implemented from scratch. It was mostly backward-compatible with Eumel, thus benefiting from the existing Eumel ecosystem. L3 started to ship in 1989, with total deployment of at least 500.
Both Eumel and L3 were microkernel systems, a popular design in the 1980s. However, by the early 1990s, microkernels had received a bad reputation, as systems built on top were performing poorly, culminating in the billion-dollar failure of the IBM Workplace OS. The reason was claimed to be inherent in the operating-system structure imposed by microkernels. Liedtke, however, observed that the message-passing operation (IPC), which is fundamentally important for microkernel performance, was slow in all existing microkernels, including his own L3 system. His conclusion was that radical redesign was needed. He did this by re-implementing L3 from scratch, dramatically simplifying the kernel, resulting in an order-of-magnitude decrease in IPC cost.
The resulting kernel was later renamed "L4". Conceptually, the main novelty of L4 was its complete reliance on external pagers (page fault handlers), and the recursive construction of address spaces.
This led to |
https://en.wikipedia.org/wiki/Remote%20administration | Remote administration refers to any method of controlling a computer from a remote location. Software that allows remote administration is becoming increasingly common and is often used when it is difficult or impractical to be physically near a system in order to use it. A remote location may refer to a computer in the next room or one on the other side of the world. It may also refer to both legal and illegal (i.e. hacking) remote administration (see Owned and Trojan).
Requirements
Internet connection
Any computer with an Internet connection or on a local area network can be remotely administered.
For non-malicious administration, the user must install or enable server software on the host system in order to be viewed. Then the user/client can access the host system from another computer using the installed software.
Usually, both systems should be connected to the internet, and the IP address of the host/server system must be known. Remote administration is therefore less practical if the host uses a dial-up modem, which is not constantly online and often has a Dynamic IP.
Connecting
When the client connects to the host computer, a window showing the Desktop of the host usually appears. The client may then control the host as if he/she were sitting right in front of it.
Windows has a built-in remote administration package called Remote Desktop Connection. A free cross-platform alternative is VNC, which offers similar functionality.
Common tasks for which remote administration is used
Shutdown
Shutting down or rebooting another computer over a network
Accessing peripherals
Using a network device, like printer
Retrieving streaming data, much like a CCTV system
Modifying
Editing another computer's Registry settings
Modifying system services
Installing software on another machine
Modifying logical groups
Viewing
Remotely assisting others
Supervising computer or internet usage
Access to a remote system's "Computer Management" snap-in
Hacking
Computers infected with malware such as Trojans sometimes open back doors into computer systems which allows malicious users to hack into and control the computer. Such users may then add, delete, modify or execute files on the computer to their own ends.
Notable software
Windows
Windows Server 2003, 2008, Tablet PC Editions, and Windows Vista Ultimate, Enterprise and Business editions come with Microsoft's Microsoft Management Console, Windows Registry Editor and various command-line utilities that may be used to administrate a remote machine. One form of remote administration is remote desktop software, and Windows includes a Remote Desktop Connection client for this purpose.
Windows XP comes with a built-in remote administration tools called Remote Assistance and Remote Desktop, these are restricted versions of the Windows Server 2003 Terminal Services meant only for helping users and remote administration. With a simple hack/patch (derived from the beta version of Windows |
https://en.wikipedia.org/wiki/E-commerce%20payment%20system | An e-commerce payment system (or an electronic payment system) facilitates the acceptance of electronic payment for offline transfer, also known as a subcomponent of electronic data interchange (EDI), e-commerce payment systems have become increasingly popular due to the widespread use of the internet-based shopping and banking.
Credit cards remain the most common forms of payment for e-commerce transactions. As of 2008, in North America, almost 90% of online retail transactions were made with this payment type. It is difficult for an online retailer to operate without supporting credit and debit cards due to their widespread use. Online merchants must comply with stringent rules stipulated by the credit and debit card issuers (e.g. Visa and Mastercard) in accordance with a bank and financial regulation in the countries where the debit/credit service conducts business.
E-commerce payment system often use B2B mode. The security of customer information, business information, and payment information base is a concern during the payment process of transactions under the conventional B2B e-commerce model.
For the vast majority of payment systems accessible on the public Internet, baseline authentication (of the financial institution on the receiving end), data integrity, and confidentiality of the electronic information exchanged over the public network involves obtaining a certificate from an authorized certificate authority (CA) who provides public-key infrastructure (PKI). Even with transport layer security (TLS) in place to safeguard the portion of the transaction conducted over public networks—especially with payment systems—the customer-facing website itself must be coded with great care, so as not to leak credentials and expose customers to subsequent identity theft.
Despite widespread use in North America, there are still many countries such as China and India that have some problems to overcome in regard to credit card security. Increased security measures include use of the card verification number (CVN) which detects fraud by comparing the verification number printed on the signature strip on the back of the card with the information on file with the cardholder's issuing bank.
There are companies that specialize in financial transaction over the Internet, such as Stripe for credit cards processing, Smartpay for direct online bank payments and PayPal for alternative payment methods at checkout. Many of the mediaries permit consumers to establish an account quickly, and to transfer funds between their on-line accounts and traditional bank accounts, typically via automated clearing house (ACH) transactions.
The speed and simplicity with which cyber-mediary accounts can be established and used have contributed to their widespread use, despite the risk of theft, abuse, and the typically arduous process of seeking recourse when things go wrong. The inherent information asymmetry of large financial institutions maintaining information safeg |
https://en.wikipedia.org/wiki/Interactive%20computing | In computer science, interactive computing refers to software which accepts input from the user as it runs.
Interactive software includes commonly used programs, such as word processors or spreadsheet applications. By comparison, non-interactive programs operate without user intervention; examples of these include compilers and batch processing applications that are pre-programmed to run independently.
Interactive computing focuses on real-time interaction ("dialog") between the computer and the operator, and the technologies that enable them.
If the response of the computer system is complex enough, it is said that the system is conducting social interaction; some systems try to achieve this through the implementation of social interfaces.
The nature of interactive computing as well as its impact on users, are studied extensively in the field of computer interaction.
History of interactive computing systems
Ivan Sutherland is considered the father of interactive computing for his work on Sketchpad, the interactive display graphics program he developed in 1963. He later worked at the ARPA Information Processing Techniques Office under the direction of J. C. R. Licklider.
There he facilitated ARPA's research grant to Douglas Engelbart for developing the NLS system at SRI, based on his visionary manifesto published in a 1962 report, in which Engelbart envisioned interactive computing as a vehicle for user interaction with computers, with each other, and with their knowledge, all in a vast virtual information space.
In a 1965 report, Engelbart published his early experiments with pointing devices, including the computer mouse, for composing and editing on interactive display workstations. Engelbart's work on interactive computing at SRI migrated directly to Xerox PARC, from there to Apple, and out into the mainstream. Thus, the tree of evolution for interactive computing generally traces back to Engelbart's lab at SRI.
In December 2008, on the 40th anniversary of his 1968 demo, SRI sponsored a public commemorative event in his honor.
Current research
The need for constant user interaction in interactive computing systems makes it different in many ways from batch processing systems.
Areas of current research include the design of novel programming models and achieving information security and reliability in interactive computing.
IPython is a software system for scientific interactive computing, supporting data visualization, event-driven programming and a number of related GUI toolkits.
The Georgia Institute of Technology's School of Interactive Computing formed in 2007, offering masters and doctoral degrees via collaboration with more than 40 faculties.
The Tangible Media Group of MIT, led by Professor Hiroshi Ishii, seeks to seamlessly couple the dual world of bits and atoms by presenting a dynamic physical form to computation.
See also
Interactivity
Interactive computation
Processing modes
J. C. R. Licklider
Douglas Engelba |
https://en.wikipedia.org/wiki/Xavier%20Leroy | Xavier Leroy (born 15 March 1968) is a French computer scientist and programmer. He is best known for his role as a primary developer of the OCaml system. He is
Professor of software science at Collège de France. Before his appointment at Collège de France in 2018, he was senior scientist (directeur de recherche) at the French government research institution Inria.
Leroy was admitted to the École normale supérieure in Paris in 1987, where he studied mathematics and computer science. From 1989 to 1992 he did his PhD in computer science under the supervision of Gérard Huet.
He is an internationally recognized expert on functional programming languages and compilers. In recent years, he has taken an interest in formal methods, formal proofs and certified compilation. He is the leader of the CompCert project that develops an optimizing compiler for C (programming language), formally verified in Coq.
Leroy was also the original author of LinuxThreads, the most widely used threading package for Linux versions prior to 2.6. Linux 2.6 introduced NPTL, with much more extensive support from the kernel, to replace LinuxThreads.
In 2015 he was named a fellow of the Association for Computing Machinery "for contributions to safe, high-performance functional programming languages and compilers, and to compiler verification." He was awarded the 2016 Milner Award by the Royal Society, the 2021 ACM Software System Award, and the 2022 ACM SIGPLAN Programming Languages Achievement Award.
References
External links
Xavier Leroy's home page
1968 births
École Normale Supérieure alumni
Computer programmers
French computer scientists
Programming language researchers
Living people
Programming language designers
Fellows of the Association for Computing Machinery
Academic staff of the Collège de France |
https://en.wikipedia.org/wiki/Shandong%20Airlines | Shandong Airlines Co,.Ltd. (; nicknamed SDA or ) is an airline based in the Shandong Airlines Center () in Jinan, Shandong. The Chinese carrier operates a sizable domestic network from Jinan, Qingdao and Yantai to major cities across China, together with an international network to regional Asian destinations. The airline's two largest shareholders are Shandong Aviation Group with a 42% controlling stake and Air China, a strategic partner, holding 22.8% of the airlines shares.
Shandong Airlines was established on 12 March 1994 and started operations in September of the same year. In September 1997 it became a founding member of the New Star (Xinxing) Aviation Alliance together with five other Chinese provincial airlines. The purpose of the alliance was to improve finances and deter takeover from larger competitors. The airline's first of many new international services commenced on 8 June 2004 connecting Jinan to Singapore.
On 21 April 2014, Shandong Airlines committed to order 50 Boeing 737s, including 16 Next-Generation 737s and 34 737 MAXes.
Destinations
As of July 2020, Shandong Airlines operates flights to the following destinations:
Codeshare agreements
Shandong Airlines has codeshare agreements with the following airlines:
Air China
Asiana Airlines
China Express Airlines
EVA Air
Qingdao Airlines
Shenzhen Airlines
Sichuan Airlines
Uni Air
Fleet
Current fleet
, Shandong Airlines operates the following aircraft:
Former fleet
References
External links
Official website
Official website
Airlines of China
Chinese brands
Airlines established in 1994
Jinan
Air China
1994 establishments in China
Companies based in Jinan |
https://en.wikipedia.org/wiki/Sniffing | Sniffing can refer to:
Inhalation
Sniffing (behavior), sampling odor by inhalation of the nose
Sniffing attack, a networking security concern
See also
Sniff (disambiguation) |
https://en.wikipedia.org/wiki/BBN%20Butterfly | The BBN Butterfly was a massively parallel computer built by Bolt, Beranek and Newman in the 1980s. It was named for the "butterfly" multi-stage switching network around which it was built. Each machine had up to 512 CPUs, each with local memory, which could be connected to allow every CPU access to every other CPU's memory, although with a substantially greater latency (roughly 15:1) than for its own. The CPUs were commodity microprocessors. The memory address space was shared.
The first generation used Motorola 68000 processors, followed by a 68010 version.
The Butterfly connect was developed specifically for this computer. The second or third generation, GP-1000 models used Motorola 68020's and scaled to 256 CPUs. The later, TC-2000 models used Motorola MC88100's, and scaled to 512 CPUs.
The Butterfly was initially developed as the Voice Funnel, a router for the ST-II protocol intended for carrying voice and video over IP networks. The Butterfly hardware was later used for the Butterfly Satellite IMP (BSAT) packet switch of DARPA's Wideband Packet Satellite Network which operated at multiple sites around the US over a shared 3 Mbit/s broadcast satellite channel. In the late 1980s, this network became the Terrestrial Wideband Network, based on terrestrial T1 circuits instead of a shared broadcast satellite channel and the BSAT became the Wideband Packet Switch (WPS). Another DARPA sponsored project at BBN produced the Butterfly Multiprocessor Internet Gateway (Internet Router) to interconnect different types of networks at the IP layer. Like the BSAT, the Butterfly Gateway broke the contention of a shared bus minicomputer architecture that had been in use for Internet Gateways by combining the routing computations and I/O at the network interfaces and using the Butterfly's switch fabric to provide the network interconnections. This resulted in significantly higher link throughputs.
The Butterfly began with a proprietary operating system called Chrysalis, but moved to a Mach kernel operating system in 1989. While the memory access time was non-uniform, the machine had SMP memory semantics, and could be operated as a symmetric multiprocessor.
The largest configured system with 128 processors was at the University of Rochester Computer Science Department. Most delivered systems had about 16 processors. No known configurations appear to be in museums. At least one system is thought to be sitting within a DARPA autonomous vehicle.
TotalView, the parallel program debugger developed for the Butterfly, outlived the platform and was ported to a number of other massively parallel machines.
See also
Pluribus was an earlier multiprocessor designed at BBN.
References
External links
BBN at Index of Dead Supercomputer Projects - Apparent source for much of this article's text.
Massively parallel computers
Supercomputers |
https://en.wikipedia.org/wiki/WPWR-TV | WPWR-TV (channel 50) is a television station licensed to Gary, Indiana, United States, broadcasting the MyNetworkTV programming service to the Chicago area. It is one of two commercial television stations in the Chicago market to be licensed in Indiana (alongside independent station WJYS [channel 62] in Hammond). WPWR-TV is owned and operated by Fox Television Stations alongside Fox outlet WFLD (channel 32); the stations share studios on North Michigan Avenue in the Chicago Loop and transmitter facilities atop the Willis Tower.
WPWR-TV sold its spectrum space in the Federal Communications Commission (FCC)'s incentive auction, and began channel-sharing with WFLD on June 11, 2018.
History
As an independent station (1982–1995)
Early years with WBBS-TV
The station first signed on the air on April 4, 1982, as a shared station operation broadcasting on UHF channel 60, split between English-language WPWR-TV and Spanish-language WBBS-TV. The shared station was the result of a shared-time agreement between two of the three applicants vying for the channel: HATCO-60—owned by Chicago Hispanic marketing agency owner Marcelino Miyares alongside other partners and the members of a competing applicant, Aurora-Chicago Telecasters—and Metrowest Corporation—owned by Fred Eychaner, which would later become Newsweb Corporation. Both stations operated as independents in their respective languages. WPWR-TV's city of license was Aurora, while WBBS-TV was licensed to West Chicago; each of them operated from the same transmitter on the Sears Tower.
A large percentage of WPWR's programming schedule was occupied by SportsVision, a new pay television service which Eychaner had developed through a deal with Chicago White Sox co-owners Jerry Reinsdorf and Eddie Einhorn. To receive the service, viewers had to rent a set-top converter and pay a monthly fee in order to view SportsVision's event telecasts, involving the Chicago sports teams. However, SportsVision was not a success and transitioned into a cable channel in January 1983, eventually evolving into SportsChannel Chicago.
With SportsVision removed from its schedule, Eychaner began acquiring public domain movies to air on weekends and a few shows that were still owned by fellow independent station WSNS-TV (channel 44, now a Telemundo owned-and-operated station), which began carrying the ONTV subscription entertainment service on a full-time basis in the fall of 1982. These programs ran weekdays from 6:00 to 8:00 a.m. and from 5:00 to 7:00 p.m., as well as from 6:00 a.m. to 7:00 p.m. on weekends; public domain movies also ran during the overnight hours when WBBS signed off for the night. WPWR also chose to compete with rival independent WCIU-TV (channel 26)'s locally produced business news service, Stock Market Observer, by running national business programming from the Financial News Network each weekday from 8:00 a.m. to 5:00 p.m. The FNN simulcast was dropped in January 1984, at which time the station added seve |
https://en.wikipedia.org/wiki/Deep%20Forest%20%28Do%20As%20Infinity%20album%29 | Deep Forest is an album by Do As Infinity which was released in 2001.
Track listing
Chart positions
External links
Deep Forest at Avex Network
Deep Forest at Oricon
2001 albums
Do As Infinity albums
Avex Group albums
Albums produced by Seiji Kameda |
https://en.wikipedia.org/wiki/AAI%20Aerosonde | The AAI Aerosonde is a small unmanned aerial vehicle (UAV) designed to collect weather data, including temperature, atmospheric pressure, humidity, and wind measurements over oceans and remote areas. The Aerosonde was developed by Insitu, and is now manufactured by Aerosonde Ltd, which is a strategic business of AAI Corporation. The Aerosonde is powered by a modified Enya R120 model aircraft engine, and carries on board a small computer, meteorological instruments, and a GPS receiver for navigation. It is also used by the United States Armed Forces for intelligence, surveillance and reconnaissance (ISR).
Design and development
On August 21, 1998, a Phase 1 Aerosonde nicknamed "Laima", after the ancient Latvian deity of good fortune, completed a 2,031 mile (3,270 km) flight across the Atlantic Ocean. This was the first crossing of the Atlantic Ocean by a UAV; at the time, it was also the smallest aircraft ever to cross the Atlantic (the smallest aircraft record was subsequently broken by the Spirit of Butts Farm UAV). Launched from a roof rack of a moving car due to its lack of undercarriage, Laima flew from Newfoundland, Canada to Benbecula, an island off the coast of Scotland in 26 hours 45 minutes in stormy weather, using approximately 1.5 U.S. gallons (1.25 imperial gallons or 5.7 litres) of gasoline (petrol). Other than for take-off and landing, the flight was autonomous, without external control, at an altitude of 5,500 ft (1,680 meters). Aerosondes have also been the first unmanned aircraft to penetrate tropical cyclones, with an initial mission in 2001 followed by eye penetrations in 2005.
Operational history
On 5 March 2012, the U.S. Special Operations Command (SOCOM) awarded AAI a contract to provide the Aerosonde-G for their Mid-Endurance UAS II program. The catapult-launched air vehicle has a takeoff weight depending on engine type, with endurance of over 10 hours and an electro-optic/infrared and laser-pointer payload. The Aerosonde has been employed by SOCOM and U.S. Naval Air Systems Command (NAVAIR) under the designation MQ-19 under service provision contracts. A typical system comprises four air vehicles and two ground control stations that are accommodated in tents or tailored to fit in most vehicles. The system can also include remote video terminals for individual users to uplink new navigation waypoints and sensor commands to, and receive sensor imagery and video from, the vehicle from a ruggedized tablet device. Originally, the Aerosonde suffered from engine-reliability issues, but Textron says it has rectified those issues.
By November 2015, Textron Systems was performing Aerosonde operations in "eight or nine" countries for its users, including the U.S. Marine Corps, U.S. Air Force, and SOCOM, as well as for commercial users consisting of a customer in the oil and gas industry. Instead of buying hardware, customers pay for "sensor hours," and the company decides how many aircraft are produced to meet requireme |
https://en.wikipedia.org/wiki/RasMol | RasMol is a computer program written for molecular graphics visualization intended and used mainly to depict and explore biological macromolecule structures, such as those found in the Protein Data Bank. It was originally developed by Roger Sayle in the early 1990s.
Historically, it was an important tool for molecular biologists since the extremely optimized program allowed the software to run on (then) modestly powerful personal computers. Before RasMol, visualization software ran on graphics workstations that, due to their cost, were less accessible to scholars. RasMol continues to be important for research in structural biology, and has become important in education.
RasMol has a complex licensing version history. Starting with the version 2.7 series, RasMol source code is dual-licensed under a GNU General Public License (GPL), or custom license RASLIC. Starting with version 2.7.5, a GPL is the only license valid for binary distributions.
RasMol includes a scripting language, to perform many functions such as selecting certain protein chains, changing colors, etc. Jmol and Sirius software have incorporated this language into their commands.
Protein Data Bank (PDB) files can be downloaded for visualization from members of the Worldwide Protein Data Bank (wwPDB). These have been uploaded by researchers who have characterized the structure of molecules usually by X-ray crystallography, protein NMR spectroscopy, or cryo-electron microscopy.
Interprocess communication
Rasmol can communicate with other programs via Tcl/Tk on Unix platforms, and via Dynamic Data Exchange (DDE) on Microsoft Windows.
With a multiple sequence alignment program, the responsible Java class can be freely used in other applications.
See also
List of molecular graphics systems
Comparison of software for molecular mechanics modeling
Molecular graphics
Molecule editor
List of free and open-source software packages
References
External links
Download RasMol (production releases)
Source repository (stable)
Source repository (development)
Protein databanks and files
RCSB (Research Collaboratory for Structural Bioinformatics)
Europe
Japan
RasMol development history
Early
Later
Molecular modelling software
Free science software
Free software programmed in C
Free educational software |
https://en.wikipedia.org/wiki/Kexi | Kexi is a visual database applications creator tool by KDE, designed to fill the gap between spreadsheets and database solutions requiring more sophisticated development. Kexi can be used for designing and implementing databases, data inserting and processing, and performing queries. It is developed within the Calligra project but is released separately.
The impetus for developing Kexi came from a noticeable lack of applications having the features of LibreOffice Base, Microsoft Access, FoxPro, Oracle Forms or FileMaker while at the same time being powerful, inexpensive, open-standards-driven and sufficiently portable.
Kexi works natively under Linux/Unix (FreeBSD, OpenBSD, NetBSD, Solaris) and Microsoft Windows operating systems. Older versions were available for Mac OS X (using Homebrew). macOS version was not released but can be compiled.
Kexi application and its frameworks are available under the LGPL. User and developer documentation is available under the GFDL.
History
Kexi development started in 2002. OpenOffice Polska (currently OpenOffice Software) contributed to it largely between 2003 and 2008.
Although Kexi was a KOffice project since the beginning, the first release was independent of KOffice. The first public beta release of Kexi was version 0.1 beta 2 on . The first stable release was 0.9 – made available on . A Kexi version with a lower version number – 0.8 – was shipped afterward with KOffice 1.4 on . Further stable versions of Kexi were released with KOffice 1.5 and 1.6 in 2006.
From 2004 until 2007 OpenOffice Polska made commercial Kexi releases using release years as version numbers. The first release was Kexi 2004 LT on based on Kexi 0.1. The commercial releases concluded with Kexi 2007.1 in March 2007 based on Kexi 1.1.2/1.1.3.
The porting process to KDE Platform 4 took rather long and was finished with the release of KOffice 2.2 in May 2010. Among its new features was a new Report Designer plug-in to replace the KOffice 1.6 stand-alone reporting application Kugar. Kexi 2.3 was released with KOffice 2.3 on with – among other features – a reworked Project Navigator pane.
After the KOffice 2.3 release, Kexi moved into Calligra Suite and both were released as version 2.4 on . The most user-visible change was a redone main user interface dubbed Modern Menu.
Since version 3.1 Kexi again officially supports Microsoft Windows.
Features
Kexi users can choose from various database engines that can be utilized for data and design storage. By default built-in SQLite 3 database engine is used that eliminates a need for installation and maintenance of a database server. For more advanced use Kexi can use database servers such as MySQL/MariaDB, PostgreSQL and Microsoft SQL Server/Sybase. Database servers have to be accessible to user on the same or any other computer.
All database objects – tables, queries, forms, etc. – are stored in tables of a single database (either file or server), making it easy to share data and desi |
https://en.wikipedia.org/wiki/LGP-30 | The LGP-30, standing for Librascope General Purpose and then Librascope General Precision, is an early off-the-shelf computer. It was manufactured by the Librascope company of Glendale, California (a division of General Precision Inc.), and sold and serviced by the Royal Precision Electronic Computer Company, a joint venture with the Royal McBee division of the Royal Typewriter Company. The LGP-30 was first manufactured in 1956, at a retail price of $47,000, .
The LGP-30 was commonly referred to as a desk computer. Its height, width, and depth, excluding the typewriter shelf, was . It weighed about , and was mounted on sturdy casters which facilitated moving the unit.
Design
The primary design consultant for the Librascope computer was Stan Frankel, a Manhattan Project veteran and one of the first programmers of ENIAC. He designed a usable computer with a minimal amount of hardware. The single address instruction set had only 16 commands. Magnetic drum memory held the main memory, and the central processing unit (CPU) processor registers, timing information, and the master bit clock, each on a dedicated track. The number of vacuum tubes was minimized by using solid-state diode logic, a bit-serial architecture and multiple use of each of the 15 flip-flops.
It was a binary, 31-bit word computer with a 4096-word drum memory. Standard inputs were the Flexowriter keyboard and paper tape (ten six-bit characters/second). The standard output was the Flexowriter printer (typewriter, working at 10 characters/second). An optional higher-speed paper tape reader and punch was available as a separate peripheral.
The computer contained 113 electronic tubes and 1450 diodes. The tubes were mounted on 34 etched circuit pluggable cards which also contain associated components. The 34 cards were of only 12 different types. Card-extenders were available to permit dynamic testing of all machine functions. 680 of the 1450 diodes were mounted on one pluggable logic board.
The LGP-30 required 1500 watts operating under full load. The power inlet cord could plug into any standard 115 volt 60-cycle single-phase line. The computer incorporated voltage regulation suitable for powerline variation of 95 to 130 volts. In addition to power regulation, the computer also contained circuitry for a warm-up stage, which minimized thermal shock to the tubes to ensure longer life. The computer contained a cooling fan which directed filtered air through ducts to the tubes and diodes, to extend component life and ensure proper operation. No expensive air conditioning was necessary if the LGP-30 was operated at reasonable temperatures.
There were 32 bit locations per drum word, but only 31 were used, permitting a "restoration of magnetic flux in the head" at the 32nd bit time. Since there was only one address per instruction, a method was needed to optimize allocation of operands. Otherwise, each instruction would wait a complete drum (or disk) revolution each time a |
https://en.wikipedia.org/wiki/Lisa%20on%20Ice | "Lisa on Ice" is the eighth episode of the sixth season of the American animated television series The Simpsons. It was the first broadcast on the Fox network in the United States on November 13, 1994. In the episode, Lisa discovers that she possesses a skill for ice hockey. A rivalry between her and Bart ensues.
The episode was written by Mike Scully and directed by Bob Anderson. Anderson's passion for hockey is what inspired the plot. It features cultural references to films such as Rollerball and The Pope of Greenwich Village. The episode was well-received by critics and acquired a Nielsen rating of 11.6.
Plot
Principal Skinner gathers Springfield Elementary School students at an assembly to announce which subjects they are failing. To her horror, straight-A student Lisa discovers she is failing gym class. When she appeals to her gym teacher, they reach a compromise: Lisa will get a passing grade if she joins a sports program outside of school. She attempts to join several, but fails, which devastates her self-esteem.
Later, the family watches Bart play hockey for his team, the Mighty Pigs, coached by Chief Wiggum. After the game, Bart ridicules his sister for being poor at sports and uses his hockey stick to pelt her with litter. After watching Lisa deflect the litter and catch hockey pucks, Apu, the coach of the Kwik-E-Mart Gougers, thinks she would be a natural and makes her his team's goalie. Lisa excels as goalie and leads her team to its best season ever.
Encouraged by Homer playing favorites, a sibling rivalry develops between Bart and Lisa. It peaks when the town learns that the Gougers will face the Mighty Pigs at their next match. The game is viciously fought, with Bart and Lisa playing their best. With four seconds left, Bart is tripped by Jimbo, giving him a penalty shot against Lisa that will decide the game. As they face off, Bart and Lisa remember the good times they had together when they were younger. After they throw aside their equipment and hug, the match ends in a tie — much to Marge's pride and Homer's distress. Dissatisfied with the outcome, the residents of Springfield riot and trash the arena.
Production
The idea for the episode came from The Simpsons writer Mike Scully, who wanted to do an episode involving ice hockey because of his passion for the sport. Bob Anderson, who also had a small interest in hockey, directed the episode. To better familiarize himself with the sport, Anderson ordered a batch of VHS highlight tapes, watched the NHL playoffs for the first time, and made several trips to scout youth games, taking notes on how players looked stickhandling and shooting.
In his original draft of the episode, Scully had written cameos for Bobby Orr and Wayne Gretzky but, he explained, "they wound up falling out of the story, because we had such a good story with the family." Gretzky eventually ended up appearing in the Season 28 episode "The Nightmare After Krustmas", becoming the first hockey player to guest |
https://en.wikipedia.org/wiki/Wally%20Feurzeig | Wallace "Wally" Feurzeig (June 10, 1927 – January 4, 2013) was an American computer scientist who was co-inventor, with Seymour Papert and Cynthia Solomon, of the programming language Logo, and a well-known researcher in artificial intelligence (AI).
Early life and education
Wallace Feurzeig was born in Chicago to parents Mandel and Pauline Feurzeig. He earned Bachelor of Philosophy and Bachelor of Science degrees from the University of Chicago, and a Master of Science degree from the Illinois Institute of Technology. He worked at Argonne National Laboratory and the University of Chicago before joining Bolt, Beranek and Newman (BBN).
Career
During the early 1960s, Bolt, Beranek and Newman had become a major center of computer science research and innovative applications. In 1962, Wally Feurzeig joined the firm to work with its newly available facilities in the Artificial Intelligence Department, one of the earliest AI organizations. His colleagues were actively engaged in some of the pioneering AI work in computer pattern recognition, natural-language understanding, automated theorem proving, Lisp language development, and robot problem solving.
Much of this work was done in collaboration with distinguished researchers at the Massachusetts Institute of Technology (MIT) such as Marvin Minsky and John McCarthy, who were regular BBN consultants during the early 1960s. Other groups at BBN were doing original work in cognitive science, instructional research and man-computer communication. Some of the first work on knowledge representation and reasoning (semantic networks), question answering, interactive computer graphics, and computer-aided instruction (CAI) was actively underway. J. C. R. Licklider was the spiritual and scientific leader of much of this work, championing the cause of on-line interaction during an era when almost all computing was being done via batch processing.
Wally's initial focus was on expanding the intellectual abilities of extant teaching systems. This led to the first intelligent CAI system, MENTOR, which employed production rules to support problem-solving interactions in medical diagnosis and other decision-making domains. In 1965, Wally organized the BBN Educational Technology Department to further the development of computer methods to improve learning and teaching, and the focus of his work then shifted to investigating programming languages as educational environments. This shift was partly due to two recent technological advances: the invention of computer time-sharing and the development of the first high-level conversational programming language.
The idea of sharing a computer's cycles among autonomous users, working simultaneously, had stirred the imagination in Cambridge in 1963 and 1964. BBN and MIT teams raced to be first to realize this concept, with BBN winning by days and holding the first successful demonstration of computer time-sharing in 1964. BBN's initial system, designed by Sheldon Boilen, supp |
https://en.wikipedia.org/wiki/Pluribus | The Pluribus multiprocessor was an early multi-processor computer designed by BBN for use as a packet switch in the ARPANET. Its design later influenced the BBN Butterfly computer.
The Pluribus had its beginnings in 1972 when the need for a second-generation interface message processor (IMP) became apparent. At that time, the BBN had already installed IMPs at more than thirty-five ARPANET sites. These IMPs were Honeywell 316 and 516 minicomputers. The network was growing rapidly in several dimensions: number of nodes, hosts, and terminals; volume of traffic; and geographic coverage (including plans, now realized, for satellite extensions to Europe and Hawaii).
A goal was established to design a modular machine which, at its lower end, would be smaller and less expensive than the 316's and 516's while being expandable in capacity to provide ten times the bandwidth of, and capable of servicing five times as many input-output (I/O) devices as, the 516. Related goals included greater memory addressing capability and increased reliability.
The designers decided on a multiprocessor approach because of its promising potential for modularity, for cost per performance advantages, for reliability, and because the IMP packet switch algorithms were clearly suitable for parallel processing by independent processors.
Hardware
A Pluribus consisted of two or more standard 19" electronic equipment racks, each divided into four bays. Each bay contained a backplane bus and an independent power supply. A bay might contain a processor bus, a shared memory bus, or an I/O bus. Custom-built bus couplers connected the bays to one another so that the processors could reach the shared memory and the I/O devices.
A 6-processor Pluribus was used as a network switch to interconnect BBN's five Tenex/"Twenex" timesharing systems along with 378 terminals on direct serial and dial-in modem lines. The Pluribus used the Lockheed SUE as its processor. The SUE was similar to DEC's PDP-11.
Software
The Pluribus software implemented MIMD symmetric multiprocessing. Software processes were implemented using non-preemptive multiprogramming. Process scheduling used a hardware device, called the pseudo-interrupt device or PID, that was accessible to both programs and to I/O devices. Each processor ran its own copy of the process scheduler, which would read an integer value from the PID. The value was used to select the process to run. If a program or device needed to signal another process to run, it would write that process' number into the PID. The PID would emit the highest priority process that anyone had requested, and served them out to all processors.
An important aspect of the Pluribus software was the "STAGE" system, which detected system errors and took steps to recover from them. The processor clocks had interrupt handlers which implemented watchdog timers on all processors. If a processor stopped running, another processor would detect it and initiate a recovery. The re |
https://en.wikipedia.org/wiki/Internet%20Tonight | Internet Tonight (1998 – October 1, 2001) was a television program on the cable network ZDTV (later known as TechTV and G4). The show combined the "effervescent moxie" of Michaela Pereira with the "dry wit" of Scott Herriott, to bring the viewers the latest in Internet trends, humor, and news. Due to the production value it was called the "absolute slickest show [TechTV] had" but was canceled when "Paul [Allen] took a dislike to the show ... and just killed it"
A daily, half-hour show, it was on the launch schedule for ZDTV, and strove to be "the show of record about the Net." Segments included Strange Sites, Incredibly Useful Sites, and Home Sweet Homepage. The collection of these links were amassed into an archive called The Big List and on each show Scott's trademark was to yell 'THE BIG LIST' at its first mention. The show had contributing correspondents, most with their own dedicated segment:
The Surf Guru – ZDTV's night watchman and self-proclaimed net expert played by Ed Marques.
Meghan Marx – the host of Love Online with Match.com
Liam Mayclem – the Music Online reporter and
Roving reporter SuChin Pak
References
External links
TechTV original programming
Mass media about Internet culture |
https://en.wikipedia.org/wiki/MIIS | MIIS is an acronym that could refer to a number of things.
Middlebury Institute of International Studies at Monterey, a graduate school in California
MIIS (programming language), a computer programming language
Microsoft Identity Integration Server, Microsoft server software for identity and access management solutions
Mii, a simulated avatar created on the Wii, DS, Wii U, 3DS, and Switch consoles
Multiple Intelligence International School, an international school in Metro Manila, Philippines
See also
MII (disambiguation)
mi2 (disambiguation) |
https://en.wikipedia.org/wiki/Calgary%20Sun | The Calgary Sun is a daily newspaper published in Calgary, Alberta, Canada. It is currently owned by Postmedia Network. First published in 1980, the tabloid-format daily newspaper replaced the long-running tabloid-size The Albertan soon after it was acquired by the publishers of the Toronto Sun. The newspaper, like most of those in the Canadian Sun chain, is known for short, snappy news stories aimed primarily at working-class readers. The layout of the Calgary Sun is partially based on that of British tabloids.
History
The newspaper that would become the Calgary Sun was first published in 1886 as the Calgary Tribune. Prior to its 1980 acquisition by Sun Media, the newspaper was published under the following titles:
1886-1895: Calgary Tribune
1895-1899: Alberta Tribune
1899: Albertan
1899-1902: Albertan and Alberta Tribune
1902-1920: Morning Albertan and Weekly Albertan
1920-1924: Morning Albertan and Western Farmer and Weekly Albertan
1924-1927: Calgary Albertan and Western Farmer and Weekly Albertan
1927-1936: Calgary Albertan
1936-1980: Albertan
1980: Calgary Albertan
Sunshine Girl
A signature feature of Sun-branded newspapers including the Calgary Sun is the "Sunshine Girl," a daily glamour photograph of a female model. The feature uses locally photographed models (both amateur and professional) as well as photographs shot for the national chain. Originally situated on page 3 (similar to the British tabloids the Sun chain originally set out to emulate, which also featured glamour photos on their third page), in the 1990s the feature was relocated to the Sports section. A "Sunshine Boy" feature appeared sporadically in the 1980s and 1990s.
Local weeklies
For many years, the Calgary Sun also published a local weekly, The Calgary Mirror, which covered community news. Sun Media purchased the newspaper in the early 1990s. This publication, which originated in the 1950s and was known at one time as North Hill News, was discontinued in 2001. It was succeeded by FYI Calgary In-Print, a free weekly newspaper intended to be the print equivalent of the Sun's much-publicized FYI Calgary news website (there was also an FYI Toronto newspaper published to tie in with the Toronto Sun website). The new publication was rejected by readers and advertisers and was discontinued in May 2001 during a downsizing of Sun Media. The website abandoned the FYI concept about a year later and rebranded itself as calgarysun.com.
Format
On October 2, 2006, the Calgary Sun underwent a major redesign, adopting the logo already being used by other Sun newspapers and revamping the typeface for its body text and headlines. In February 2007, Sun Media launched a Calgary edition of its free daily, 24 Hours, which shares editors and editorial staff with the Calgary Sun. Sun Media ceased publishing the Calgary edition of 24 Hours in 2013.
Distribution
The Calgary Herald was produced on a daily basis until 2012, when it ceased printing a Sunday edition. Distribution |
https://en.wikipedia.org/wiki/Commit%20charge | In computing, commit charge is a term used in Microsoft Windows operating systems to describe the total amount of virtual memory of all processes that must be backed by either physical memory or the page file. Through the process of paging, the contents of this virtual memory may move between physical memory and the page file, but it cannot exceed the sum of sizes of those two. As a percentage, commit charge is the utilization of this limit.
Virtual memory not related to commit charge includes virtual memory backed by files and all-zero pages backed by nothing.
Overview
The Windows Task Manager utility for Windows XP and Server 2003, in its Performance tab, shows three counters related to commit charge:
Total is the amount of pagefile-backed virtual address space in use, i.e., the current commit charge. This is composed of main memory (RAM) and disk (pagefiles). The corresponding performance counter is called "Committed Bytes".
Limit is the maximum possible value for Total; it is the sum of the current pagefile size plus the physical memory available for pageable contents (this excludes RAM that is assigned to non-pageable areas). The corresponding performance counter is called "Commit Limit".
Peak is the highest amount that the total commit charge has reached since the operating system was last started.
The program Process Explorer reports the same set of values, labeling the Total as Current, and additionally providing percentages of Peak and Current towards the Limit value.
The commit charge increases when any program is opened and used, and goes down when a program is closed. It will also change when already-running programs allocate or free private virtual memory; for example, with the VirtualAlloc and VirtualFree APIs.
In the Task Manager utility under Windows XP and Windows Server 2003, the graphical displays labeled as "PF usage" and "Page File Usage History," despite their labels, reflect not the pagefile contents but the total (or current) commit charge. The height of the graph area corresponds to the commit limit. These do not show how much has actually been written to the pagefile, but only the maximum potential pagefile usage: The amount of pagefile that would be used if all current contents of RAM had to be removed. In Windows 2000 and Windows NT 4.0, these same displays are labeled "Mem usage" but again actually show the commit charge and commit limit. Similar displays in the Task Manager of Windows Vista and later have been changed to reflect usage of physical memory.
In Task Manager's "Processes" display, each process's contribution to the "total commit charge" is shown in the "VM size" column in Windows XP and Server 2003. The same value is labeled "Commit size" in Windows Vista and later. The total commit charge will always be larger than the sum of these values, as the total includes system-wide allocations such as the paged pool.
In the same display, the "Mem Usage" column in Windows XP and Server 2003, or th |
https://en.wikipedia.org/wiki/Reality%20Lab | Reality Lab was a 3D computer graphics API created by RenderMorphics to provide a standardized interface for writing games. It was one of the main contenders in the realtime 3D middleware marketplace at the time, alongside Criterion Software's RenderWare and Argonaut Software's BRender.
Reality Lab was a scene graph API providing real-time rendering that would run with acceptable performance on graphics cards or the host computer's CPU.
After a short time on the market, RenderMorphics was purchased by Microsoft in February 1995 and Reality Lab formed the basis for Direct3D. Microsoft's acquisition statement of RenderMorphics contained a description of Reality Lab:"RenderMorphics' flagship product, Reality Lab(TM), provides high-performance 3-D graphics technology for a variety of personal computer-based games and multimedia applications. Reality Lab has been acclaimed by a wide range of developers, including Autodesk, Creative Labs, Kaleida Labs and Virgin Entertainment."Architecturally Reality Lab was then separated into a low layer immediate mode API and layered upon it the original scene graph API which was afterwards called retained mode API. Direct3D shipped for the first time in the DirectX 2.0 SDK in June 1996.
See also
Qube Software
Glide
References
Covers the early years of DirectX development within Microsoft, including the acquisition of RenderMorphics.
DirectX |
https://en.wikipedia.org/wiki/MSAV | Microsoft Anti-Virus (MSAV) is an antivirus program introduced by Microsoft for its MS-DOS operating system. The program first appeared in MS-DOS version 6.0 (1993)
and last appeared in MS-DOS 6.22. The first version of the antivirus program was basic, had no inbuilt update facility (updates had to be obtained from a BBS and manually installed by the user) and could scan for 1,234 different viruses. Microsoft Anti-Virus for Windows (MWAV), included as part of the package, was a front end that allowed MSAV to run properly on Windows 3.1x.
In 2009, Microsoft launched an in-house antivirus solution named Microsoft Security Essentials, which later was phased out in favor of Microsoft Defender.
History
Microsoft Anti-Virus was supplied by Central Point Software Inc. (later acquired by Symantec in 1994 and integrated into Symantec's Norton AntiVirus product) and was a stripped-down version of the Central Point Anti-Virus (CPAV) product which Central Point Software Inc., had licensed from Carmel Software Engineering in Haifa, Israel. Carmel Software sold the product as Turbo Anti-Virus both domestically and abroad.
Microsoft Anti-Virus for Windows was also provided by Central Point Software.
Features
MSAV featured the "Detect and Clean" strategy and the detection of boot sector and Trojan horse-type viruses (which were typical virus problems at that time).
The program also had an anti-stealth and check sum feature that could be used to detect any changes in normal files. This technology was intended to make up for the unavailability of regular update packages. The final update of MSAV was released in June 1996 by Symantec. The update added the ability to detect polymorphic viruses and the virus definitions were updated to scan for a total of 2,371 viruses.
VSafe TSR
VSafe is a terminate and stay resident component of MSAV that provided real-time virus protection.
By default, VSafe does the following:
Checks executable files for viruses (on execution).
Checks all disks (hard drive and floppy) for boot sector viruses.
Warns of attempts to write to the boot sector or partition table of the hard disk
Warns of formatting that could erase the hard disk.
There are more features that can be enabled, VSafe can:
Warn of attempts of executable files to terminate and stay resident (by normal methods).
Prevent programs from writing to disk.
Warn of attempts to write to the boot sector of a floppy disk.
Warn of attempts to modify executable files.
VSafe had a number of virus definitions embedded within its executable and was capable of loading additional signatures (updates) from an external definition file.
See also
Internet Security
Comparison of antivirus software
Comparison of firewalls
References
Anti-Virus
Antivirus software
1993 software
DOS software
de:Central Point Anti-Virus#Microsoft Anti-Virus |
https://en.wikipedia.org/wiki/CAP%20computer | The Cambridge CAP computer was the first successful experimental computer that demonstrated the use of security capabilities, both in hardware and software. It was developed at the University of Cambridge Computer Laboratory in the 1970s. Unlike most research machines of the time, it was also a useful service machine.
The sign currently on the front of the machine reads:
The CAP project on memory protection ran from 1970 to 1977. It was based on capabilities implemented in hardware, under M. Wilkes and R. Needham with D. Wheeler responsible for the implementation. R. Needham was awarded a BCS Technical Award in 1978 for the CAP (Capability Protection) Project.
Design
The CAP was designed such that any access to a memory segment or hardware required that the current process held the necessary capabilities.
The 32-bit processor featured microprogramming control, two 256-entry caches, a 32-entry write buffer and the capability unit itself, which had 64 registers for holding evaluated capabilities. Floating point operations were available using a single 72-bit accumulator. The instruction set featured over 200 instructions, including basic ALU and memory operations, to capability- and process-control instructions.
Instead of the programmer-visible registers used in Chicago and Plessey System 250 designs, the CAP would load internal registers silently when a program defined a capability. The memory was divided into segments of up to 64K 32-bit words. Each segment could contain data or capabilities, but not both. Hardware was accessed via an associated minicomputer.
All procedures constituting the operating system were written in ALGOL 68C, although a number of other closely associated protected procedures - such as a paginator - are written in BCPL.
Operation
The CAP first became operational in 1976. A fully functional computer, it featured a complete operating system, file system, compilers, and so on. The OS used a process tree structure, with an initial process called the "Master coordinator". This removed the need for separate modes of operation, as each process could directly access the resources of its children. In practice, only two levels were ever used during the CAP's operation.
In 1981 the MACRO SPITBOL version of the SNOBOL4 programming language was implemented on the CAP by Nicholas J. L. Brown.
See also
Plessey System 250
IBM System/38
C.mmp
RSRE Flex
Notes
References
Computers designed in the United Kingdom
Capability systems
One-of-a-kind computers
University of Cambridge Computer Laboratory |
https://en.wikipedia.org/wiki/Financial%20econometrics | Financial econometrics is the application of statistical methods to financial market data. Financial econometrics is a branch of financial economics, in the field of economics. Areas of study include capital markets, financial institutions, corporate finance and corporate governance. Topics often revolve around asset valuation of individual stocks, bonds, derivatives, currencies and other financial instruments.
It differs from other forms of econometrics because the emphasis is usually on analyzing the prices of financial assets traded at competitive, liquid markets.
People working in the finance industry or researching the finance sector often use econometric techniques in a range of activities – for example, in support of portfolio management and in the valuation of securities. Financial econometrics is essential for risk management when it is important to know how often 'bad' investment outcomes are expected to occur over future days, weeks, months and years.
Topics
The sort of topics that financial econometricians are typically familiar with include:
analysis of high-frequency price observations
arbitrage pricing theory
asset price dynamics
optimal asset allocation
cointegration
event study
nonlinear financial models such as autoregressive conditional heteroskedasticity
realized variance
fund performance analysis such as returns-based style analysis
tests of the random walk hypothesis
the capital asset pricing model
the term structure of interest rates (the yield curve)
value at risk
volatility estimation techniques such as exponential smoothing models and RiskMetrics
Research community
The Society for Financial Econometrics (SoFiE) is a global network of academics and practitioners dedicated to sharing research and ideas in the fast-growing field of financial econometrics. It is an independent non-profit membership organization, committed to promoting and expanding research and education by organizing and sponsoring conferences, programs and activities at the intersection of finance and econometrics, including links to macroeconomic fundamentals. SoFiE was co-founded by Robert F. Engle and Eric Ghysels.
Premier-quality journals which publish financial econometrics research include Econometrica, Journal of Econometrics and Journal of Business & Economic Statistics. The Journal of Financial Econometrics has an exclusive focus on financial econometrics. It is edited by Federico Bandi and Andrew Patton, and it has a close relationship with SoFiE.
The Nobel Memorial Prize in Economic Sciences has been awarded for significant contribution to financial econometrics; in 2003 to Robert F. Engle "for methods of analyzing economic time series with time-varying volatility" and Clive Granger "for methods of analyzing economic time series with common trends" and in 2013 to Eugene Fama, Lars Peter Hansen and Robert J. Shiller "for their empirical analysis of asset prices". Other highly influential researchers include Torben G. Ande |
https://en.wikipedia.org/wiki/Zircon%20Airways%20Benin | Zircon Airways Benin was an airline based in Benin. It was founded in 2001 and ceased operations in 2002.
Code data
IATA Code: Z4
ICAO Code: BZW (not current)
Callsign: ZIRCON (not current)
See also
List of defunct airlines of Benin
References
External links
Zircon Airways Benin (archive link, was dead)
Defunct airlines of Benin
Airlines established in 2001
Airlines disestablished in 2002 |
https://en.wikipedia.org/wiki/Inter%20Islands%20Airlines | Inter Islands Airlines was an airline based in Cape Verde.
Code data
IATA Code: H4
ICAO Code: IIN (not current)
Fleet
Operated a leased Embraer Brasilia
References
Defunct airlines of Cape Verde
Airlines established in 2002
Airlines disestablished in 2009 |
https://en.wikipedia.org/wiki/Guinee%20Airlines | Guinee Airlines was an airline based in Guinea. It was founded in 1999 and ceased operations again in 2004.
Code data
Guinee Airlines operated its flight under
IATA Code: J9
ICAO Code: GIF
Callsign: GUINEE AIRLINES
Fleet
Guinee Airlines operated the following aircraft types:
Boeing 737-100
Boeing 737-200
External links
Airline History
Companies of Guinea
Defunct airlines of Guinea
Airlines established in 1999
Airlines disestablished in 2004
1999 establishments in Guinea |
https://en.wikipedia.org/wiki/Commit%20%28data%20management%29 | In computer science and data management, a commit is the making of a set of tentative changes permanent, marking the end of a transaction and providing Durability to ACID transactions. A commit is an act of committing. The record of commits is called the commit log.
In terms of transactions, the opposite of commit is to discard the tentative changes of a transaction, a rollback.
The transaction, commit and rollback concepts are key to the ACID property of databases.
A COMMIT statement in SQL ends a transaction within a relational database management system (RDBMS) and makes all changes visible to other users. The general format is to issue a BEGIN WORK (or BEGIN TRANSACTION, depending on the database vendor) statement, one or more SQL statements, and then the COMMIT statement. Alternatively, a ROLLBACK statement can be issued, which undoes all the work performed since BEGIN WORK was issued. A COMMIT statement will also release any existing savepoints that may be in use.
References
See also
Atomic commit
Two-phase commit protocol
Three-phase commit protocol
Data management
SQL
Transaction processing |
https://en.wikipedia.org/wiki/Covad | Covad Communications Company, also known as Covad Communications Group, was an American provider of broadband voice and data communications. By 2006, the company had 530,000 subscribers, and ranked as the 16th largest ISP in the United States. Covad was acquired by U.S. Venture Partners, who in 2010 announced a three-way merger of MegaPath, Covad, and Speakeasy, creating a single Managed Services Local Exchange Carrier (MSLEC), providing voice and internet services; the new company was named MegaPath.
In January 2015, telecommunications service provider Global Capacity acquired MegaPath's wholesale and direct access business, which included assets acquired from Covad.
The name Covad was derived from acronyms which have varied over time, including COmbined Voice And Data, Copper Over Voice And Data, and in its earliest form, COpper Value ADded.
History
Covad was the first service provider to offer a national DSL broadband service. In addition they offered Voice over IP, T1, Web hosting, managed security, IP and dial-up, and bundled voice and data services directly through Covad's network and through Internet Service Providers, value-added resellers, telecommunications carriers and affinity groups to businesses. Covad broadband services were available in 44 states, including 235 Metropolitan Statistical Areas (MSAs), a services area available to over 50 percent of all businesses. The company was founded in San Jose, CA.
By 2008, Covad added the Samsung Acemap DSLAM to their portfolio on top of their pre-existing Nokia D50 DSLAMs, to allow for ADSL2+ technology, which can reach DSL speeds up to 15 Mbit/s.
The launch of the AceMAP was primarily instigated to provide combined POTS and ADSL2+ service to Earthlink end users and were deployed in more residential areas instead of concentrating on business-centric markets.
Covad was acquired a by private equity firm, Platinum Equity, in April 2008. In 2010, it was sold to U.S. Venture Partners, which merged Covad, and Speakeasy into MegaPath.
The three-way merger produced an executive team comprising the former CEOs of all three former companies: Chairman and CEO (former MegaPath CEO) D. Craig Young, Chief Strategy Officer and Head of Wholesale Markets (former Covad CEO) Pat Bennett, and (former Speakeasy CEO) Bruce Chatterley as President of the Business Markets unit in charge of all non-wholesale customer sales, service and marketing.
In mid-2010, Covad announced Ethernet-over-Copper services (EoCu) in the LA market. The new Ethernet product ran over a Fujitsu Flashwave based Ethernet core and provided symmetrical speeds up to 20 Mbit/s. Ethernet over DS1 service was added soon after. In early 2011, Covad (now as Megapath) announced expansion of the services on a national level by the end of 2012.
In September 2014, Global Capacity announced its plan to buy the assets acquired from Covad from MegaPath. The acquisition was completed on January 1, 2015.
References
External links
Official home |
https://en.wikipedia.org/wiki/Bart%20the%20Daredevil | "Bart the Daredevil" is the eighth episode of the second season of the American animated television series The Simpsons. It originally aired on the Fox network in the United States on December 6, 1990. In the episode, Bart decides he wants to become a daredevil after watching famous stunt performer Lance Murdock at a monster truck rally.
The episode was written by Jay Kogen and Wallace Wolodarsky and directed by Wes Archer. Series creator Matt Groening said that the episode is his favorite of the series, and it is also considered among the series' best by several critics.
Plot
The Simpsons attend a monster truck rally featuring Truckasaurus, a giant robotic dinosaur that crushes their car when they accidentally drive into the arena. The rally's grand finale features a death-defying stunt by legendary daredevil Lance Murdock. The stunt leaves Murdock badly injured and hospitalized, but it inspires Bart to be a daredevil.
Bart injures himself trying to jump the family car on his skateboard. At the hospital, Dr. Hibbert shows Bart a ward full of children who have been hurt by dangerous stunts. Undeterred, Bart keeps performing daredevil stunts, and during a class trip to Springfield Gorge, announces he will jump the gorge on his skateboard the next Saturday.
Lisa persuades him to visit Murdock at the hospital, hoping he will discourage Bart from jumping the gorge, but instead, Murdock encourages Bart to do it.
Homer insists jumping the gorge is too dangerous and forbids Bart to do it. None of Homer's punishments or arguments dissuade Bart, who goes to the gorge that Saturday. As Bart is about to perform the stunt, Homer arrives, tackles Bart and decides to jump the gorge himself to show him what it feels like to see a family member unnecessarily risking their lives.
Not wanting to see his father get hurt on his account, Bart ultimately promises to stop being a daredevil; as Homer hugs Bart in relief, the skateboard accidentally rolls down a hill and flies over the gorge with Homer still on it. It appears Homer will make it safely across, but he loses momentum, and plunges onto several jagged rocks during his fall until he hits the bottom of the gorge. Homer is then airlifted into an ambulance, which crashes into a tree, causing him to fall down the gorge again.
In the hospital, Homer ends up in the same hospital room with Murdock. He tells him, “You think you’ve got guts, try raising my kids!”
Production
The episode was written by Jay Kogen and Wallace Wolodarsky and directed by Wes Archer. The character Lance Murdock was based on Evel Knievel, an American motorcycle daredevil and entertainer famous in the United States and elsewhere between the late 1960s and early 1980s. Kogen, Wolodarsky, and many other members of the Simpsons staff were fans of Knievel's stunts, and Wolodarsky named "Bart the Daredevil" as his favorite episode among the episodes that he wrote for The Simpsons, because it is "near and dear to [his] heart".
Dr. Hibbert m |
https://en.wikipedia.org/wiki/Institute%20of%20Mathematics%2C%20Physics%2C%20and%20Mechanics | Institute of Mathematics, Physics, and Mechanics (; IMFM) is the leading research institution in the areas of mathematics and theoretical computer science in Slovenia. It includes researchers from University of Ljubljana, University of Maribor and University of Primorska. It was founded in 1960.
The IMFM is composed of the following departments:
Department of Mathematrics
Department of Physics
Department of Theoretical Computer Science
The director is Jernej Kozak.
References
External links
Research institutes in Slovenia
Mathematical institutes
Physics research institutes
Scientific organizations established in 1960
Scientific organizations in Ljubljana |
https://en.wikipedia.org/wiki/TWM | Twm or TWM may refer to:
twm, the default window manager for the X Window System
Tanu Weds Manu, a 2011 Hindi romantic comedy film
Tawang language (ISO-639: twm), spoken in India
Teradata Warehouse Miner, data mining software
Third World Media, an American pornographic film studio
Tiling window manager, a class of window managers
Tyne and Wear Metro
People
Twm Carnabwth (1806–1876), Welsh rebel
Twm Morys (born 1961), Welsh poet and musician
Twm o'r Nant (1739–1810), Welsh-language dramatist and poet
Twm Siôn Cati, a figure of Welsh folklore |
https://en.wikipedia.org/wiki/Linux%20for%20PlayStation%202 | Linux for PlayStation 2 (or PS2 Linux) is a kit released by Sony Computer Entertainment in 2002 that allows the PlayStation 2 console to be used as a personal computer. It included a Linux-based operating system, a USB keyboard and mouse, a VGA adapter, a PS2 network adapter (Ethernet only), and a 40 GB hard disk drive (HDD). An 8 MB memory card is required; it must be formatted during installation, erasing all data previously saved on it, though afterwards the remaining space may be used for savegames. It is strongly recommended that a user of Linux for PlayStation 2 have some basic knowledge of Linux before installing and using it, due to the command-line interface for installation.
The official site for the project was closed at the end of October 2009 and communities like ps2dev are no longer active.
Capabilities
The Linux Kit turns the PlayStation 2 into a full-fledged computer system, but it does not allow for use of the DVD-ROM drive except to read PS1 and PS2 discs due to piracy concerns by Sony. Although the HDD included with the Linux Kit is not compatible with PlayStation 2 games, reformatting the HDD with the utility disc provided with the retail HDD enables use with PlayStation 2 games but erases PS2 Linux, though there is a driver that allows PS2 Linux to operate once copied onto the APA partition created by the utility disc. The Network Adapter included with the kit only supports Ethernet; a driver is available to enable modem support if the retail Network Adapter (which includes a built-in V.90 modem) is used. The kit supports display on RGB monitors (with sync-on-green) using a VGA cable provided with the Linux Kit, or television sets with the normal cable included with the PlayStation 2 unit.
The PS2 Linux distribution is based on , a Japanese distribution itself based on Red Hat Linux. PS2 Linux is similar to Red Hat Linux 6, and has most of the features one might expect in a Red Hat Linux 6 system. The stock kernel is Linux 2.2.1 (although it includes the USB drivers from Linux 2.2.18 to support the keyboard and mouse), but it can be upgraded to a newer version such as 2.2.21, 2.2.26 or 2.4.17.
Open-source applications
The Linux kit's primary purpose is amateur software development, but it can be used as one would use any other computer, although the small amount of memory in the PS2 (32MB) limits its applications. Noted open source software that compiles on the kit includes Mozilla Suite, XChat, and Pidgin. Lightweight applications better suited to the PS2's 32MB of RAM include xv, Dillo, Ted, and AbiWord. The default window manager is Window Maker, but it is possible to install and use Fluxbox and FVWM. The USB ports of the console can be connected to external devices, such as printers, cameras, flash drives, and CD drives.
With PS2 Linux, a user can program their own games that will work under PS2 Linux, but not on an unmodified PlayStation 2. Free open source code for games are available for download from PS2 Lin |
https://en.wikipedia.org/wiki/Artworx | Artworx was a Naples, Florida software company that produced and supported a line of computer games (primarily specializing in poker and other card games) from 1981 to 2020. It is named after the founder's given name. At first the company published a variety of games, including titles in adventure and arcade-action genres, but were later best known for a strip poker series.
Some other Artworx titles are Bridge 8.0 and King of Solitaire, although these have not sold as well as the poker games. Artworx' titles were released by partner companies in regional markets: Anco in Europe, CDS Software and Guildhall in the United Kingdom, and Artworx in the rest of the world.
Strip Poker
The Strip Poker series ran from 1982 to 1995 over five games. The player is a presumed male who plays strip poker against attractive women. The games received generally positive reviews over the series history. Critics appreciated the game's sense of humour and for effectively using their limited graphics to create titillating imagery. Others felt that a video game was a depressing way for players to view such content, when alternatives like Playboy were available.
Gameplay
The player, a male poker player, plays a card game against the computer who is represented by an attractive woman. As the player beats the woman in the game, she proceeds to take off items of clothing as a reward. The core models in the series are Suzi and Melissa. Other characters are available in certain games through expansion packs.
Development
In the original game, Douglas McFarland did the graphics while Mitch Garnaat did the coding. In Strip Poker II, graphics are by Douglas McFarland, with programming by both McFarland and Mitch Garnaat.
It was reported Karen Graham, one of the developers, was looking for male models for a version targeted at the female gamer. When asked potential controversy, Graham said that while they were bound to receive complaints with the title, the male version planned for 1988 would have evened things out. It was never released.
Release
Strip Poker: A Sizzling Game of Chance was released in 1982 on Apple II, Atari 8-bit family, Commodore 16, Plus/4, Commodore 64, and IBM PC. Strip Poker II (aka Deluxe Strip Poker) was released in 1988 for Amiga, Apple IIGS, Atari ST, and IBM PC Compatibles. Anco handled European publishing while Artworx handled the American market. Strip Poker II was augmented by Strip Poker II+ and Strip Poker II data disks.
Strip Poker Professional and Strip Poker Professional: Rev B were released on MS-DOS in 1994 and 1995 respectively.
Reception
Tilt enjoyed Strip Poker: A Sizzling Game of Chance's graphics. Computer Gamer felt that picking up a Playboy would be a better alternative to playing this game. Meanwhile Micro praised the game's sense of humour. Video Game Critic felt the game would appeal to players who wanted to see titillating content that was old-fashioned and pixelated. Aktueller Software Markt had a mixed opinion on |
https://en.wikipedia.org/wiki/Crackpot%20index | The Crackpot Index is a number that rates scientific claims or the individuals that make them, in conjunction with a method for computing that number. It was proposed by John C. Baez in 1992, and updated in 1998.
While the index was created for its humorous value, the general concepts can be applied in other fields like risk management.
Baez's crackpot index
The method was initially proposed semi-seriously by mathematical physicist John C. Baez in 1992, and then revised in 1998. The index used responses to a list of 37 questions, each positive response contributing a point value ranging from 1 to 50; the computation is initialized with a value of −5. An earlier version only had 17 questions with point values for each ranging from 1 to 40.
The New Scientist published a claim in 1992 that the creation of the index was "prompted by an especially striking
outburst from a retired mathematician insisting that TIME has INERTIA".
Baez later confirmed in a 1993 letter to New Scientist that he created the index. The index was later published in Skeptic magazine, with an editor's note saying "we know that outsiders to a field can make important contributions and even lead revolutions. But the chances of that happening are rather slim, especially when they meet many of the [Crackpot index] criteria".
Though the index was not proposed as a serious method, it nevertheless has become popular in Internet discussions of whether a claim or an individual is cranky, particularly in physics (e.g., at the Usenet newsgroup sci.physics), or in mathematics.
Chris Caldwell's Prime Pages has a version adapted to prime number research which is a field with many famous unsolved problems that are easy to understand for amateur mathematicians.
Gruenberger's measure for crackpots
An earlier crackpot index is Fred J. Gruenberger's "A Measure for Crackpots" published in December 1962 by the RAND Corporation.
See also
Crank (person)
List of topics characterized as pseudoscience
Pseudophysics
References
External links
The Crackpot Index. by John Baez.
The CRACKPOT Index: A simple method for rating potentially revolutionary contributions to physics
Humour
Usenet
Pseudoscience |
https://en.wikipedia.org/wiki/Low%20Bandwidth%20X | In computing, LBX, or Low Bandwidth X, is a protocol to use the X Window System over network links with low bandwidth and high latency. It was introduced in X11R6.3 ("Broadway") in 1996, but never achieved wide use. It was disabled by default as of X.Org Server 7.1, and was removed for version 7.2.
X was originally implemented for use with the server and client on the same machine or the same local area network. By 1996, the Internet was becoming popular, and X's performance over narrow, slow links was problematic.
LBX ran as a proxy server (). It cached commonly used information — connection setup, large window properties, font metrics, keymaps and so on — and compressed data transmission over the network link.
LBX was never widely deployed as it did not offer significant speed improvements. The slow links it was introduced to help were typically insecure, and RFB (VNC) over a secure shell connection — which includes compression — proved faster than LBX, and also provided session resumption.
Finally, it was shown that greater speed improvements to X could be obtained for all networked environments with replacement of X's antiquated font system as part of the new composited graphics system, along with care and attention to application and widget toolkit design, particularly care to avoid network round trips and hence latency.
See also
Virtual Network Computing (VNC)
xmove - a tool allows you to move programs between X Window System displays
xpra - a more recent tool which is similar to xmove
NX technology, an X acceleration system
References
lbxproxy(1) (man page)
Design and Implementation of LBX: An Experiment Based Standard (.tar.gz archive file) (Keith Packard, Eighth Annual X Technical Conference, The X Resource no. 9, O'Reilly & Associates, 1994)
Broadway/Xweb FAQ (broadwayinfo.com)
The LBX mini-HOWTO v1.04 (Paul D. Smith, 11 December 1997)
An LBX Postmortem (Keith Packard)
X Window System Network Performance (Keith Packard and Jim Gettys, 2003)
Design and Implementation of the X Rendering Extension (Keith Packard, 2001
History of software
X Window System
Proxy servers
X servers
Remote desktop |
https://en.wikipedia.org/wiki/Helsinki%20University%20Central%20Hospital | Helsinki University Central Hospital (HUCH; ; ) is a hospital network in Finland. It is one of the largest hospitals in Europe. It encompasses 17 hospitals in Helsinki, Espoo and Vantaa, and has all major medical specialties represented. The HUCH Hospital Area is one of the five hospital areas making up the Hospital District of Helsinki and Uusimaa (HUS).
HUCH hospitals in Helsinki consist of the following:
Aurora Hospital
Children's Castle
Children's Hospital
Department of Oncology
Eye and Ear Hospital
Meilahti Tower Hospital (Meilahti Hospital)
Meilahti Triangle Hospital
Psychiatrycenter
Skin and Allergy Hospital
Surgical Hospital
Women's Hospital.
HUCH hospitals in Espoo and Vantaa:
Jorvi Hospital
Peijas Hospital
References
Hospital
Hospitals in Finland
Teaching hospitals
Töölö |
https://en.wikipedia.org/wiki/Robert%20Herring%20%28businessman%29 | Robert Shelby Herring Sr. (born 1941) is an American businessman who founded Herring Networks, a media company that launched and currently owns AWE and One America News Network.
Early life and education
Herring was born Alson Shelby Herring in a single-room house in northeastern Louisiana in 1941. The family moved to a farm near Bakersfield, California, in 1948, and later moved near Los Angeles. Herring's father died when he was a teenager; he dropped out of high school and worked to support his family. He would eventually earn his GED.
Perceiving his given first name Alson to sound too feminine, Herring called himself Robert or Bob and legally changed his name to Robert in 2005.
Career
Herring initially worked as a chauffeur and owned several pet shops. In 1972, he acquired a local circuit board factory and renamed it Industrial Circuits. In 1981, he hired Michael Reagan, son of then-President Ronald Reagan, as a salesman at Industrial Circuits. Herring sold Industrial Circuits to Toppan Printing in 1988 for $52 million.
In 1989, Herring created another circuit board company, Herco Technology, with his sons Charles and Robert Jr. as co-owners. In 1994, a Herco employee reported to his supervisors that the facility in San Diego County was illegally flushing copper, prompting an investigation by the Federal Bureau of Investigation (FBI). In 1995, Herring fired the employee, who sued Herco for retaliation and was awarded $78,400 in damages. In November 1997, Herco pleaded guilty to one count of pollution and agreed to pay a criminal fine of $170,000, following a report by a resident in June. For the next three years, the company received pollution violation notices for releasing copper, silver and cyanide into the environment.
In 2000, the Herrings sold the company to Teradyne for $122 million. After Teradyne's stock fell by about half in the next year, the Herrings sued the company, alleging that Teradyne executives had misled them during the negotiations. Teradyne denied any wrongdoing, saying that it had properly disclosed its finances before the deal and that market conditions had shifted. The Herrings lost the lawsuit.
In 2003, Herring founded Herring Networks, a media network based in San Diego. In 2004, Herring launched the cable channel Wealth TV (now AWE). In 2013, the network launched One America News Network, a far-right cable channel known for its pro-Donald Trump coverage.
Political activities
Though Herring has been a conservative since the 1970s, he has occasionally donated to Democrats, including $4,600 to Hillary Clinton in 2007. Herring said under oath that he once voted for Barack Obama for President. The majority of his family's $500,000 in contributions has gone to Republicans.
In 2004, Herring donated $15,000 to help rescue a university talk by left-wing filmmaker Michael Moore after the university cut funding, citing free speech principles.
In 2005, Herring offered $1 million to the husband in the Terri Schiavo ca |
https://en.wikipedia.org/wiki/Captive%20NTFS | Captive NTFS is a discontinued open-source project in the Linux programming community, started by Jan Kratochvíl. It is a driver wrapper around the original Microsoft Windows NTFS file system driver using parts of ReactOS code. By taking this approach, it aimed to provide safe write support to NTFS partitions.
Until the release of NTFS-3G, it was the only Linux NTFS driver with full write support.
On January 26, 2006 Kratochvíl released version 1.1.7 of the package. It restores compatibility with recent Linux kernels by replacing the obsolete LUFS (Linux Userland File System) module with FUSE (File System in Userspace), which as of Linux 2.6.14 has been part of the official Linux kernel.
Captive NTFS requires NTFS.SYS, which cannot be freely distributed for legal reasons. It can either be obtained from an installed Windows system (which most computers with NTFS partitions are likely to have) or extracted from certain Microsoft service packs.
External links
Jan Kratochvil's Captive NTFS home page
Compatibility layers
Disk file systems
Userspace file systems |
https://en.wikipedia.org/wiki/Bomb%20%28icon%29 | The bomb icon (💣) has several different applications in computing, and typically indicates a fatal system error.
In computing
Mac OS
The bomb icon in Mac OS is a symbol designed by Susan Kare that was displayed inside the System Error alert box when the "classic" Macintosh operating system had a crash which the system decided was unrecoverable. Since the classic Mac OS offered little memory protection, an application crash would often take down the entire system.
The bomb symbol first appeared on the original Macintosh in 1984. Often, a reason for the crash, including the error code, was displayed in the dialog. In some cases, a "Resume" button would be available, allowing the user to dismiss the dialog and force the offending program to quit, but most often the resume button would be disabled and the computer would have to be restarted. Originally, the resume button was unavailable unless the running program had provided the OS with code to allow recovery. With the advent of System 7, if the OS thought it could handle recovery, a normal error dialog box was displayed, and the application was forced to quit. This was helped by the classic Mac OS providing a little bit of protection against heap corruption using guard pages; if the application was to crash and the application's heap was corrupt, it could be thrown away.
The debugger program MacsBug was sometimes used even by end users to provide basic (though not always reliable) error recovery, and could be used for troubleshooting purposes, much as the output of a Unix kernel panic or a Windows NT Blue Screen of Death could be. Mac OS Classic bomb boxes were often ridiculed for providing little or no useful information about the error; this was a conscious decision by the Macintosh team to eliminate any information that the end user could not make sense of. The error code was intended to be included in a bug report to the developer.
In Mac OS X, the system architecture is vastly different from that in the classic Mac OS, and an application crash cannot usually bring down the entire system. A kernel panic screen (either text overwritten on the screen in older versions, or simplified to a reboot message in more recent versions) replaces the bomb symbol but appears less often due to the radically different system architecture. The bomb symbol is not used in Mac OS X, but a test application called Bomb.app, specifically written to cause a non-fatal crash, is included with Xcode and uses a rendition of the bomb symbol as its icon.
In the original Mac OS, the system call to display a "bomb box" was called DSError, for "Deep Shit". This was deemed obscene, and became the "System Error Manager".
Atari ST TOS
TOS-based systems, such as the Atari ST, used a row of bombs to indicate a critical system error. The number of bombs displayed revealed information about the occurred error. The error (also called an exception) is reported by the Motorola 68000 microprocessor. The first version of TOS used |
https://en.wikipedia.org/wiki/Citadel%20%28software%29 | Citadel is the name of a bulletin board system (BBS) computer program, and of the genre of programs it inspired. Citadels were notable for their room-based structure (see below) and relatively heavy emphasis on messages and conversation as opposed to gaming and files. The first Citadel came online in 1980 with a single 300 baud modem; eventually many versions of the software, both clones and those descended from the original code base (but all usually called "Citadels"), became popular among BBS callers and sysops, particularly in areas such as the Pacific Northwest, Northern California and Upper Midwest of the United States, where development of the software was ongoing. Citadel BBSes were most popular in the late 1980s and early 1990s, but when the Internet became more accessible for online communication, Citadels began to decline. However, some versions of the software, from small community BBSes to large systems supporting thousands of simultaneous users, are still in use today. Citadel development has always been collaborative with a strong push to keep the source code in the public domain. This makes Citadel one of the oldest surviving FOSS projects.
The Citadel user interface
The utilization of a natural metaphor, the concept of rooms devoted to topics, marked Citadel's main advancement over previous BBS packages in the area of organization. Messages are associated with rooms, to which the user moves in order to participate in discussions; similarly, a room could optionally give access to the underlying file system, permitting the organization of available files in an organic manner. Most installations permitted any user to create a room, resulting in a dynamic ebb and flow closer to true conversation than most other BBS packages achieved. Certain versions of Citadel extend the metaphor of rooms with "hallways" and/or "floors," organizing groups of rooms according to system requirement. By contrast, previous bulletin board software emphasized the availability of files, with a single uncoupled message area that could only be read linearly, forward or backward.
Citadel further improved the user experience in the area of command and control. Based on Alan Kay's philosophy of user-interface design, "Simple things should be simple; complex things should be possible," and influenced by the fact that Citadel was developed in an era of 300 baud modems, the basic and most heavily used commands are accessed via single keystrokes. The most common commands are Goto (the next room with new messages), New messages (display the New messages in the room to the user), and Enter a message into the room. Other single keystroke commands exist as well, such as Known rooms, which lists the rooms known to the user.
This elegantly small command set made the system so usable that many daily users during Citadel's golden era were never aware that Citadel also provided sophisticated capabilities. These are known as the "dot" commands and build logicall |
https://en.wikipedia.org/wiki/Carry%20%28arithmetic%29 | In elementary arithmetic, a carry is a digit that is transferred from one column of digits to another column of more significant digits. It is part of the standard algorithm to add numbers together by starting with the rightmost digits and working to the left. For example, when 6 and 7 are added to make 13, the "3" is written to the same column and the "1" is carried to the left. When used in subtraction the operation is called a borrow.
Carrying is emphasized in traditional mathematics, while curricula based on reform mathematics do not emphasize any specific method to find a correct answer.
Carrying makes a few appearances in higher mathematics as well. In computing, carrying is an important function of adder circuits.
Manual arithmetic
A typical example of carry is in the following pencil-and-paper addition:
1
27
+ 59
----
86
7 + 9 = 16, and the digit 1 is the carry.
The opposite is a borrow, as in
−1
47
− 19
----
28
Here, , so try , and the 10 is got by taking ("borrowing") 1 from the next digit to the left. There are two ways in which this is commonly taught:
The ten is moved from the next digit left, leaving in this example in the tens column. According to this method, the term "borrow" is a misnomer, since the ten is never paid back.
The ten is copied from the next digit left, and then 'paid back' by adding it to the subtrahend in the column from which it was 'borrowed', giving in this example in the tens column.
Mathematics education
Traditionally, carry is taught in the addition of multi-digit numbers in the 2nd or late first year of elementary school. However, since the late 20th century, many widely adopted curricula developed in the United States such as TERC omitted instruction of the traditional carry method in favor of invented arithmetic methods, and methods using coloring, manipulatives, and charts. Such omissions were criticized by such groups as Mathematically Correct, and some states and districts have since abandoned this experiment, though it remains widely used.
Higher mathematics
Kummer's theorem states that the number of carries involved in adding two numbers in base is equal to the exponent of the highest power of dividing a certain binomial coefficient.
When several random numbers of many digits are added, the statistics of the carry digits bears an unexpected connection with Eulerian numbers and the statistics of riffle shuffle permutations.
In abstract algebra, the carry operation for two-digit numbers can be formalized using the language of group cohomology. This viewpoint can be applied to alternative characterizations of the real numbers.
Mechanical calculators
Carry represents one of the basic challenges facing designers and builders of mechanical calculators. They face two basic difficulties: The first one stems from the fact that a carry can require several digits to change: in order to add 1 to 999, the machine has to increment 4 different digits. Another challenge is |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.