source
stringlengths 32
199
| text
stringlengths 26
3k
|
|---|---|
https://en.wikipedia.org/wiki/Vinyl%20emulation
|
Vinyl emulation allows a user to physically manipulate the playback of digital audio files on a computer using the turntables as an interface, thus preserving the hands-on control and feel of DJing with vinyl. This has the added advantage of using turntables to play back audio recordings not available in phonograph form. This method allows DJs to scratch, beatmatch, and perform other turntablism that would be impossible with a conventional keyboard-and-mouse computer interface or less tactile control devices.
A digital vinyl system (DVS) may include a special time-coded vinyl record or be purely software.
Characteristics
Vinyl emulation normally uses special vinyl records which are played on conventional turntables. The vinyl is a recording of analog audio signals often referred to as timecode. The turntables' audio output - the timecode recording - is routed into an analog-to-digital converter, or ADC. This ADC may be a multi-channel soundcard or a dedicated external USB or FireWire audio interface box, DJ controller device or compatible mixer (usually distributed with the software). The ADC sends digital time code information to the software, which then translates the signal into corresponding changes in the playback speed, direction and position of a digital audio file. The audio file will react as if were pressed directly onto the record. The manipulated audio output of the program is then sent back through the DAC or the computer's sound card, and can be routed into an audio mixer where it can be mixed like any other analog audio signal.
The result is digital audio playback that sounds like music manipulated by an analog vinyl recording. However, there is always a short delay between the needle's reading of the time code and the software's playback of the audio. The delay time is treated as a figure of merit for vinyl emulation products. A shorter delay allows the DJ to have better response and control of the music and is usually not noticeable by the user or listener.
In some countries, for example Finland, a digital DJ license is required to legally play copyrighted music publicly with vinyl emulation software.
Software packages
Final Scratch was the first vinyl emulation software sold publicly. Since its release in 2001, many similar software and hardware packages have been developed and marketed.
Notable applications licensed under the terms of the GNU General Public License:
Mixxx
xwax
Notable proprietary software applications include:
Deckadance
Final Scratch
MixVibes DVS
Serato Scratch Live
Torq
Traktor Scratch Pro
Some vinyl emulation software products are marketed with specific time coded vinyl, while others are software-only products.
The following table lists all existing DVS packages which come with specific time-coded vinyl:
This table presents all software-only DVS packages (Note that software products presented here are these which are "controllable" through a time-coded vinyl):
See also
Audio
|
https://en.wikipedia.org/wiki/Renater
|
RENATER () is the national research and education network in France.
Deployed at the beginning of the 1990s, RENATER (National telecommunications network for Technology, Education and Research) provides a national and international connectivity
via the pan-European GÉANT network, to more than 1,000 education and research sites in Metropolitan France and Overseas Departments and Territories. The RENATER network is an important and added value tool for research and education. It makes easier the collaborative work of the French researchers with their colleagues (data transfers and acquisitions, videoconferencing, spreadsheets etc.).
RENATER is connected to international networks through two nx10 Gbit/s links to GÉANT and directly to the Internet through four nx10 Gbit/s links.
RENATER supports IPv4 and IPv6.
Services
The following services are offered to RENATER's community:
Network services
IPv4 and IPv6 Connectivity
End to end circuits (L2 and L3 MPLS VPN, optical paths,...)
Resource management (prefix allocation, domain names registration,...)
Applicative services
Authentication services (server and personal certificates)
Education-Research identity federation
Anti-spam service
Mobility service (eduroam)
Voice and image services (VoIP and video)
Security service (CERT)
References
External links
Official website (French; english version)
The French NREN presentation PDF
Internet in France
National research and education networks
Science and technology in France
|
https://en.wikipedia.org/wiki/NHL%20on%20ABC
|
The NHL on ABC is an American presentation of National Hockey League (NHL) games produced by ESPN, and televised on ABC in the United States.
The network first broadcast NHL games during the 1993 Stanley Cup playoffs on April 18, 1993, under a two-year time-buy agreement with ESPN. After the two years, the NHL left ABC for newcomer Fox, while remaining with ESPN.
As part of a joint contract with ESPN, which was reached right before the 1998–99 season, the NHL returned to ABC on February 6, 2000, with their coverage of the 2000 NHL All-Star Game in Toronto. Regular season game telecasts returned to ABC on March 18, 2000. ABC also gained the rights to select weekend games from each round of the Stanley Cup playoffs and the last five games of the Stanley Cup Finals. After the 2004 Stanley Cup Finals, the NHL left ABC again, this time for NBC because Disney executives admitted that they overpaid for the 1999–2004 deal. ESPN, who was set to continue with the NHL, later dropped it from their schedules after the 2004–05 lockout.
On March 10, 2021, ESPN announced a new contract to hold half of the NHL's media rights beginning in the 2021–22 season. In this deal, ABC will broadcast up to 10 regular season games per-season, primarily late-season games of the week (branded as ABC Hockey Saturday presented by Expedia for sponsorship purposes), and the All-Star Game. ABC exclusively televises the Stanley Cup Finals in even-numbered years. All games carried by ABC are streamed on ESPN+.
History
Before the 1992–93 NHL season
After being dropped by NBC after the season, the NHL did not maintain a national television contract in the United States. In response to this, the league put together a network of independent stations covering approximately 55% of the country.
Games typically aired on Monday nights (beginning at 8 p.m. Eastern Time) or Saturday afternoons. The package was offered to local stations without a rights fee. Profits would instead be derived from the advertising, which was about evenly split between the network and the local station. The Monday night games were often billed as "The NHL Game of the Week".
Initially, the Monday night package was marketed to ABC affiliates; the idea being that ABC carried NFL football games on Monday nights in the fall and (starting in May ) Major League Baseball games on Monday nights in the spring and summer, stations would want the hockey telecasts to create a year-round Monday night sports block; however, very few ABC stations chose to pick up the package.
In , ABC was contracted to televise Game 7 of the Stanley Cup Finals. Since the Finals ended in five games, the contract was void. Had there been a seventh game, then Al Michaels would have called play-by-play alongside Bobby Clarke (color commentator). Jim McKay would host the seventh game in the studio and Frank Gifford (reporter) would have been in the winning team's dressing room to interview players and coaches as well as hand the phone to the wi
|
https://en.wikipedia.org/wiki/Amp%27d%20Mobile
|
Amp'd Mobile was a cellular phone service launched in the United States in late 2005, and in Canada in early 2007. The company was a Mobile Virtual Network Operator offering 3G voice and data services over the Verizon Wireless EV-DO network, including text and picture messaging, push-to-talk, and over-the-air downloadable applications and content (including Video on Demand) from its Amp'd Live service.
Its primary non-venture capital investors were MTV Networks and Universal Music Group. The service targeted 18- to 35-year-olds, and was the first integrated mobile entertainment company for youth, young professionals and early adopters, similar to Helio.
Services
Amp'd Live
Amp'd mobile's service was built around Amp'd Live, a permanently installed BREW application on all Amp'd CDMA phones, which featured downloadable and streaming video on-demand clips, live events such as Supercross, streaming phonecast radio stations, downloadable content such as games, ringtones, and songs.
Amp'd Live TV channels, far superior and advanced in image quality than its competitors , included Comedy Central Mobile, MTV Mobile, Spike TV, Oxygen Mobile, MTVU, VH1, LOGO, UFC TV, Fox News, Fox Sports, Playboy Mobile, Discovery Mobile, History Channel, A&E, Biography Channel, Style, Break TV, E!, WE Mobile, Speed, NBA TV, Girls Gone Wild TV, and Adult Swim Mobile.SU. The TV show Lil Bush aired on Amp'd Live TV before being picked up by Comedy Central.
Amp'd Mobile Canada
On March 14, 2007, Amp'd Mobile Canada was launched. It was based on a mobile virtual network operator (MVNO) partnership with Telus Mobility. Amp'd managed the marketing and multimedia content, while Telus Mobility handled the billing, customer care, retail aspects, and network.
On August 1, 2007, after noticing Amp'd Mobile's financial problems in the USA, Telus Mobility announced that it would be discontinuing Amp'd service in Canada. Multimedia content was quickly pulled down, but users could still obtain a similar service from Telus Mobility or other providers. A transition period ensured uninterrupted voice and messaging services. During this time, customers were contacted via phone and were instructed to transition to the Telus Mobility network or that of another provider.
Because the Amp'd Mobile phones were CDMA devices, it is very difficult to activate them on a cellular network today. Amp'd Mobile claimed that customers "will need to replace" their phones and service via Telus Mobility at no extra charge with a $300 credit. However, it is still possible to activate an Amp'd Mobile Phone with a CDMA carrier.
On March 17, 2008, nearly a year after Amp'd Mobile Canada's debut, Koodo Mobile was launched by Telus Mobility as their discount MVNO. More importantly, it targeted the youth demographic previously sought by Amp'd. Unlike Amp'd, Koodo does not provide multimedia content. Koodo does, however, offer customizable budget plans for unlimited SMS, MMS, social networking and up to 10 GB
|
https://en.wikipedia.org/wiki/Exception%20handling%20syntax
|
Exception handling syntax is the set of keywords and/or structures provided by a computer programming language to allow exception handling, which separates the handling of errors that arise during a program's operation from its ordinary processes. Syntax for exception handling varies between programming languages, partly to cover semantic differences but largely to fit into each language's overall syntactic structure. Some languages do not call the relevant concept "exception handling"; others may not have direct facilities for it, but can still provide means to implement it.
Most commonly, error handling uses a try...[catch...][finally...] block, and errors are created via a throw statement, but there is significant variation in naming and syntax.
Catalogue of exception handling syntaxes
Ada
Exception declarations
Some_Error : exception;
Raising exceptions
raise Some_Error;
raise Some_Error with "Out of memory"; -- specific diagnostic message
Exception handling and propagation
with Ada.Exceptions, Ada.Text_IO;
procedure Foo is
Some_Error : exception;
begin
Do_Something_Interesting;
exception -- Start of exception handlers
when Constraint_Error =>
... -- Handle constraint error
when Storage_Error =>
-- Propagate Storage_Error as a different exception with a useful message
raise Some_Error with "Out of memory";
when Error : others =>
-- Handle all others
Ada.Text_IO.Put("Exception: ");
Ada.Text_IO.Put_Line(Ada.Exceptions.Exception_Name(Error));
Ada.Text_IO.Put_Line(Ada.Exceptions.Exception_Message(Error));
end Foo;
Assembly language
Most assembly languages will have a macro instruction or an interrupt address available for the particular system to intercept events such as illegal op codes, program check, data errors, overflow, divide by zero, and other such. IBM and Univac mainframes had the STXIT macro. Digital Equipment Corporation RT11 systems had trap vectors for program errors, i/o interrupts, and such. DOS has certain interrupt addresses. Microsoft Windows has specific module calls to trap program errors.
Bash
#!/usr/bin/env bash
#set -e provides another error mechanism
print_error(){
echo "there was an error"
}
trap print_error exit #list signals to trap
tempfile=`mktemp`
trap "rm $tempfile" exit
./other.sh || echo warning: other failed
echo oops)
echo never printed
One can set a trap for multiple errors, responding to any signal with syntax like:
BASIC
An On Error goto/gosub structure is used in BASIC and is quite different from modern exception handling; in BASIC there is only one global handler whereas in modern exception handling, exception handlers are stacked.
ON ERROR GOTO handler
OPEN "Somefile.txt" FOR INPUT AS #1
CLOSE #1
PRINT "File opened successfully"
END
handler:
PRINT "File does not exist"
END ' RESUME may be used instead which returns control to original position.
C
C does not provide direct support to exception handling: it is the programmer's responsibilit
|
https://en.wikipedia.org/wiki/List%20of%20Home%20and%20Away%20characters
|
Home and Away is an Australian soap opera produced by the Seven Network since 1988. This list documents the current cast of actors and characters, recurring cast and characters, as well as new, returning and departing cast members. It is organised in order of the character's first on-screen appearance. If a character has been portrayed by different actors, the most recent portrayer is listed first.
Present characters
Regular characters
Recurring and guest characters
Cast changes
Upcoming and returning characters
Former characters
References
External links
Cast and characters at the official AU website
Lists of Home and Away characters
H
|
https://en.wikipedia.org/wiki/Jack%20Edmonds
|
Jack R. Edmonds (born April 5, 1934) is an American-born and educated computer scientist and mathematician who lived and worked in Canada for much of his life. He has made fundamental contributions to the fields of combinatorial optimization, polyhedral combinatorics, discrete mathematics and the theory of computing. He was the recipient of the 1985 John von Neumann Theory Prize.
Early career
Edmonds attended Duke University before completing his undergraduate degree at George Washington University in 1957. He thereafter received a master's degree in 1960 at the University of Maryland under Bruce L. Reinhart with a thesis on the problem of embedding graphs into surfaces. From 1959 to 1969 he worked at the National Institute of Standards and Technology (then the National Bureau of Standards), and was a founding member of Alan Goldman’s newly created Operations Research Section in 1961. Goldman proved to be a crucial influence by enabling Edmonds to work in a RAND Corporation-sponsored workshop in Santa Monica, California. It is here that Edmonds first presented his findings on defining a class of algorithms that could run more efficiently. Most combinatorics scholars, during this time, were not focused on algorithms. However Edmonds was drawn to them and these initial investigations were key developments for his later work between matroids and optimization. He spent the years from 1961 to 1965 on the subject of NP versus P and in 1966 originated the conjectures NP ≠ P and NP ∩ coNP = P.
Research
Edmonds's 1965 paper “Paths, Trees and Flowers” was a preeminent paper in initially suggesting the possibility of establishing a mathematical theory of efficient combinatorial algorithms.
One of his earliest and notable contributions is the blossom algorithm for constructing maximum matchings on graphs, discovered in 1961 and published in 1965. This was the first polynomial-time algorithm for maximum matching in graphs. Its generalization to weighted graphs was a conceptual breakthrough in the use of linear programming ideas in combinatorial optimization. It sealed in the importance of there being proofs, or "witnesses", that the answer for an instance is yes and there being proofs, or "witnesses", that the answer for an instance is no. In this blossom algorithm paper, Edmonds also characterizes feasible problems as those solvable in polynomial time; this is one of the origins of the Cobham–Edmonds thesis.
A breakthrough of the Cobham–Edmonds thesis, was defining the concept of polynomial time characterising the difference between a practical and an impractical algorithm (in modern terms, a tractable problem or intractable problem). Today, problems solvable in polynomial time are called the complexity class PTIME, or simply P.
Edmonds's paper “Maximum Matching and a Polyhedron with 0-1 Vertices” along with his previous work gave astonishing polynomial-time algorithms for the construction of maximum matchings. Most notably, these papers demonstrated h
|
https://en.wikipedia.org/wiki/Catlins%20River%20Branch
|
The Catlins River Branch was a branch line railway that formed part of New Zealand's national rail network. It ran through the Catlins region in southwestern Otago and was built in sections between 1879 and 1915. It closed in 1971 except for the first four kilometres, which remain open as the Finegand Branch (formerly named the 'Finegand Industrial Siding'). Along the line was the Hunts Road tunnel, the southernmost tunnel in New Zealand.
Construction
The line was built mainly to provide access to timber for logging companies, as access to the thickly wooded Catlins region was very difficult at the time. The first contract for construction was let on 29 April 1879, but it was not until 15 December 1885 that the first 12.79 km to Romahapa from the junction with the Main South Line in Balclutha were opened. The next stage to Glenomaru added approximately ten more kilometres to the line and opened on 7 July 1891. The opening of the following section was delayed by difficulties in boring the Hunts Road tunnel, and it was on 16 December 1895 that the branch was opened to Tahora. The present-day largest town in the district, Owaka, was reached on 22 June 1896, bringing the line to a length of 31.06 kilometres. Three years later, construction of the line recommenced, but the difficult terrain meant that it wasn't until 1 August 1904 that the next 5.5 km to Ratanui opened. Another five kilometres, another five years; Houipapa was reached on 17 December 1909. The line eventually reached its ultimate terminus of Tahakopa on 17 February 1915. There were proposals to extend the line to meet the Tokanui Branch, but these were little more than ploys by ambitious politicians. The rugged landscape proved to be a deterrent to serious extension plans and they were abandoned.
Stations
The following stations were on the Catlins River Branch (distance from the junction in brackets):
Finegand (3.6 km), current end of rails is just beyond the station site at the 4.05 km mark.
Otanomomo (6.46 km)
Romahapa (12.79 km), in the 1890s, a number of bush tramways operated in the immediate vicinity.
Glenomaru, second station (19.41 km)
Glenomaru, original station (22.79 km)
Hunts Road (25.93 km)
Tahora (29.23 km)
Owaka (31.06 km), in the 1890s, a number of bush tramways operated in the immediate vicinity.
Ratanui (36.65 km), also known as Catlins River and junction with bush tramway to sawmill owned by Goss & Co.
Houipapa (40.58 km), junction with Houipapa Sawmilling's bush tramway.
Tawanui (46.21 km), junction with Andrew Sharp Ltd's bush tramway; it was open by 1923 and closed in 1952.
Puketiro (52.14 km)
Caberfeidh (56.14 km)
Maclennan (60.75 km), junction with Maclennan Sawmilling Co.'s bush tramway; it was open by 1923 and closed by 1942.
Stuarts (64.07 km), junction with Latta Bros. bush tramway.
Campbell's Siding (?? km), junction with Leggatt and Campbell's bush tramway.
Tahakopa (68.44 km), junction with numerous bush tramways.
All bush tramways were closed
|
https://en.wikipedia.org/wiki/YAA
|
YAA or yaa may refer to:
Yorkshire Arts Association
Young at Art Museum
Young Artist Award
European Film Academy Young Audience Award
Youth Against AIDS, a disbanded international youth network founded in 1999
Anahim Lake Airport, Anahim Lake, British Columbia, Canada
Yodh, the tenth semitic letter. Named Yāʾ, Yaa or Ya'a in Arabic.
Yaa dialect, a dialect of West Teke, a Bantu language spoken in the Republic of Congo and Gabon
Yaminawa language (ISO 639-3: yaa), a Panoan language in Western Amazonia
Yuya, Egyptian courtier during the eighteenth dynasty ()
San Andrés Yaá, Oaxaca, Mexico
Yaa (name)
|
https://en.wikipedia.org/wiki/YCP
|
YCP may refer to:
YaST Control Programming Language
York College of Pennsylvania, a private college located in York, Pennsylvania, United States
Young China Party, a political party in Taiwan
YSR Congress Party, a political party in India
|
https://en.wikipedia.org/wiki/Claw-free%20permutation
|
In the mathematical and computer science field of cryptography, a group of three numbers (x,y,z) is said to be a claw of two permutations f0 and f1 if
f0(x) = f1(y) = z.
A pair of permutations f0 and f1 are said to be claw-free if there is no efficient algorithm for computing a claw.
The terminology claw free was introduced by Goldwasser, Micali, and Rivest in their 1984 paper, "A Paradoxical Solution to the Signature Problem" (and later in a more complete journal paper), where they showed that the existence of claw-free pairs of trapdoor permutations implies the existence of digital signature schemes secure against adaptive chosen-message attack. This construction was later superseded by the construction of digital signatures from any one-way trapdoor permutation. The existence of trapdoor permutations does not by itself imply claw-free permutations exist; however, it has been shown that claw-free permutations do exist if factoring is hard.
The general notion of claw-free permutation (not necessarily trapdoor) was further studied by Ivan Damgård in his PhD thesis The Application of Claw Free Functions in Cryptography (Aarhus University, 1988), where he showed how to construct
Collision Resistant Hash Functions from claw-free permutations. The notion of claw-freeness is closely related to that of collision resistance in hash functions. The distinction is that claw-free permutations are pairs of functions in which it is hard to create a collision between them, while a collision-resistant hash function is a single function in which it's hard to find a collision, i.e. a function H is collision resistant if it's hard to find a pair of distinct values x,y such that
H(x) = H(y).
In the hash function literature, this is commonly termed a hash collision. A hash function where collisions are difficult to find is said to have collision resistance.
Bit commitment
Given a pair of claw-free permutations f0 and f1 it is straightforward to create a commitment scheme. To commit to a bit b the sender chooses a random x, and calculates fb(x). Since both f0 and f1 share the same domain (and range), the bit b is statistically hidden from the receiver. To open the commitment, the sender simply sends the randomness x to the receiver. The sender is bound to his bit because opening a commitment to 1 − b is exactly equivalent to finding a claw. Notice that like the construction of Collision Resistant Hash functions, this construction does not require that the claw-free functions have a trapdoor.
References
Further reading
Theory of cryptography
Permutations
|
https://en.wikipedia.org/wiki/Knuth%27s%20Algorithm%20X
|
Algorithm X is an algorithm for solving the exact cover problem. It is a straightforward recursive, nondeterministic, depth-first, backtracking algorithm used by Donald Knuth to demonstrate an efficient implementation called DLX, which uses the dancing links technique.
The exact cover problem is represented in Algorithm X by a matrix A consisting of 0s and 1s. The goal is to select a subset of the rows such that the digit 1 appears in each column exactly once.
Algorithm X works as follows:
The nondeterministic choice of r means that the algorithm recurses over independent subalgorithms; each subalgorithm inherits the current matrix A, but reduces it with respect to a different row r.
If column c is entirely zero, there are no subalgorithms and the process terminates unsuccessfully.
The subalgorithms form a search tree in a natural way, with the original problem at the root and with level k containing each subalgorithm that corresponds to k chosen rows.
Backtracking is the process of traversing the tree in preorder, depth first.
Any systematic rule for choosing column c in this procedure will find all solutions, but some rules work much better than others.
To reduce the number of iterations, Knuth suggests that the column-choosing algorithm select a column with the smallest number of 1s in it.
Example
For example, consider the exact cover problem specified by the universe U = {1, 2, 3, 4, 5, 6, 7} and the collection of sets = {A, B, C, D, E, F}, where:
A = {1, 4, 7};
B = {1, 4};
C = {4, 5, 7};
D = {3, 5, 6};
E = {2, 3, 6, 7}; and
F = {2, 7}.
This problem is represented by the matrix:
{| class="wikitable"
! !! 1 !! 2 !! 3 !! 4 !! 5 !! 6 !! 7
|-
! A
| 1 || 0 || 0 || 1 || 0 || 0 || 1
|-
! B
| 1 || 0 || 0 || 1 || 0 || 0 || 0
|-
! C
| 0 || 0 || 0 || 1 || 1 || 0 || 1
|-
! D
| 0 || 0 || 1 || 0 || 1 || 1 || 0
|-
! E
| 0 || 1 || 1 || 0 || 0 || 1 || 1
|-
! F
| 0 || 1 || 0 || 0 || 0 || 0 || 1
|}
Algorithm X with Knuth's suggested heuristic for selecting columns solves this problem as follows:
Level 0
Step 1—The matrix is not empty, so the algorithm proceeds.
Step 2—The lowest number of 1s in any column is two. Column 1 is the first column with two 1s and thus is selected (deterministically):
{| class="wikitable"
! !! 1 !! 2 !! 3 !! 4 !! 5 !! 6 !! 7
|-
! A
| 1 || 0 || 0 || 1 || 0 || 0 || 1
|-
! B
| 1 || 0 || 0 || 1 || 0 || 0 || 0
|-
! C
| 0 || 0 || 0 || 1 || 1 || 0 || 1
|-
! D
| 0 || 0 || 1 || 0 || 1 || 1 || 0
|-
! E
| 0 || 1 || 1 || 0 || 0 || 1 || 1
|-
! F
| 0 || 1 || 0 || 0 || 0 || 0 || 1
|}
Step 3—Rows A and B each have a 1 in column 1 and thus are selected (nondeterministically).
The algorithm moves to the first branch at level 1…
Level 1: Select Row A
Step 4—Row A is included in the partial solution.
Step 5—Row A has a 1 in columns 1, 4, and 7:
{| class="wikitable"
! !! 1 !! 2 !! 3 !! 4 !! 5 !! 6 !! 7
|-
! A
| 1 || 0 || 0 || 1 || 0 || 0 || 1
|-
! B
| 1 || 0 || 0 || 1 || 0 || 0 || 0
|-
! C
| 0 || 0 || 0 || 1 || 1 || 0 || 1
|-
|
https://en.wikipedia.org/wiki/Community%20of%20interest%20%28computer%20security%29
|
Community of interest (COI or CoI) is a means in which network assets and or network users are segregated by some technological means for some established purpose. COIs are a strategy that fall under the realm of computer security which itself is a subset of security engineering. Typically, COIs are set up to protect a network infrastructure from a group or groups of users who are performing some esoteric functions. COIs are also designed to protect their user community from the rest of the enclave user population. Not only does this refer to the simplicity of the network, but it also includes a group of people that come together on different social networks to share data. There are multiple examples such as Wikipedia, Facebook, Blogs, YouTube, and many more where people come together as a community of interest to work together towards a common goal, learn from each other, critique, and share ideas. These users and group of people are separated into categories and segregated into logical groups. There can be professional groups, health groups that include people interested in specific diets, business groups, self-start up groups, and so many other countless categories. A COI is a group of professionals and advisors that share business insights, technical expertise, challenges, and perspectives.
Definition
A COI can be defined as a logical or physical grouping of network devices or users with access to information that should not be made available to the general user population on a LAN or WAN infrastructure. A COI can be used to provide multiple levels of protection for a LAN or WAN infrastructure from the activities within a COI. A COI can consist of a logical perimeter around the community (or enclave). It can allow for separate security management and operational direction. COI's generally do not dictate separate internal security policies (e.g., password policies, etc.) because they fall under the jurisdiction and management of the LAN or WAN owners. However, they can and often do have a laxed subset of the overall Network security policy. The terms "Segregation Mechanism" and "Security Mechanism" for the purposes of this article are interchangeable. The COI segregates in order to achieve security.
A distinction between the CoP's and the CoI's
A CoP may operate with any of the following attributes:
Some sponsorship
A vision and/or mission statement
Goals and/or objectives
A core team and/or general membership
Expected outcomes and/or impacts
Measures of success
Description of operating processes
Assumptions and/or dependencies
Review and/or reflection
Often CoIs span similar organizations (e.g., DoD, particularly when there is a common interest in an outcome).
Individual members may be expected to:
Support the CoP through participation and review/validation of products
Attempt to wear the "one hat" associated with the CoP while maintaining the integrity and autonomy of their individual organizations.
Participate volunt
|
https://en.wikipedia.org/wiki/Clinical%20Data%20Interchange%20Standards%20Consortium
|
The Clinical Data Interchange Standards Consortium (CDISC) is a standards developing organization (SDO) dealing with medical research data linked with healthcare, to "enable information system interoperability to improve medical research and related areas of healthcare". The standards support medical research from protocol through analysis and reporting of results and have been shown to decrease resources needed by 60% overall and 70–90% in the start-up stages when they are implemented at the beginning of the research process.
CDISC standards are harmonized through a model that is also a HL7 standard and is the process to becoming an ISO/CEN standard.
History
Late 1997 – Started as a Volunteer group
Summer 1998 – Invited to form DIA SIAC
1999 – SDS v1.0; ODM v0.8
2000 – SDS v1.1
Feb 2000 – Formed an Independent, non-profit organization
Dec 2001 – Global participation
2001 – SDS v2.0; ODM v1.0
2002 – ODM v1.1; ADAM v1.0
2003 – LAB v1.0; SDTM v1/SDTM-IG v3.0; BRIDG Model Initiated; SEND 1.0
2004 – LAB v1.1; ODM v1.2; SDTM v3.1
2005 – Define.xml Implementation; Release (v1.0); SEND v.2; ODM v1.2.1; SDTM v1.1/SDTMIG v3.1.1; ODM mapped to HL7 RIM
2006 – BRIDG v1.0, v1.1; BRIDG posted as open-source model
2007 – ODM v1.3; LAB & SDTM Aligned; BRIDG posted as open-source model
2008 – BRIDG v2.0, v2.1, v2.2; CDASH v1.0; ESDI document published
2009 – SDTM v1.2/SDTMIG 3.1.2; ADAM v2.1 and ADAMIG v1.0; Imaging CRFs; CDISC-IHE RFD and RPE
2010 – Protocol Representation Model;(PRM) v1.0; BRIDG v3.0; ODM v1.3.1; HHS-ONC/HITSP Interoperability Specification #158; CDISC-IHE RPE
2011 – CDASH v1.1; SEND v3.0; Study Design XML v1.0, ADAM Examples in Commonly Used Statistical Analysis Methods v1.0
2012 – The ADAM Basic Data Structure for Time-to-Event Analyses v1.0, ADAM Data Structure for Adverse Event Analysis v1.0
2013 – Define-XML Version 2.0, SDTM v1.4/SDTMIG v3.2
2014 – SHARE R1
2015 – ARM v1.0 extension for Define-XML Version 2
2016 – Dataset XML, Therapeutic Areas, CTR-XML, ADAMIG v1.1, ADM OCCDS v1.0
Overview of standards
Dataset.XML (DataSet-XML)
Enables communication of study results as well as regulatory submission to FDA (pilot since 2014).
Study Data Tabulation Model (SDTM)
Recommended for FDA regulatory submissions since 2004.
The SDTM Implementation Guide (SDTM-IG) gives a standardized, predefined collection of domains for clinical data submission, each of which is based on the structure and metadata defined by the SDTM.
Standard for Exchange of Non-clinical Data (SEND)
The SEND Implementation Guide (SEND-IG) provides predefined domains and examples of non-clinical (animal) data based on the structure and metadata defined by the SDTM.
Analysis Data Model (ADaM)
Defines dataset and metadata standards that support statistical analyses and traceability. ADaM is one of the required standards for data submission to FDA (U.S.) and PMDA (Japan).
Operational Data Model (ODM)
The highlights of ODM: includes an audit trail,
|
https://en.wikipedia.org/wiki/Stefan%20Meyer-Kahlen
|
Stefan Meyer-Kahlen (born 1968, in Düsseldorf) is a German programmer of the computer chess programs Shredder and the entire Zappa series. , his program had won 18 titles as World Computer Chess Champion. Four of the titles were blitz championships, and one was a Chess960 championship. He also invented the Universal Chess Interface, a chess engine protocol.
External links
Shredder Computer Chess
Computer chess people
1968 births
Living people
|
https://en.wikipedia.org/wiki/Military%20History%20%28TV%20channel%29
|
Military History (stylized as MILITARY HISTORY) is an American pay television channel owned by A&E Networks. The channel features programs about the history of the military and significant combat events. The channel's main competitor is Warner Bros. Discovery's American Heroes Channel, formerly the Military Channel.
History
Military History was launched on January 5, 2005, and as the third spin-off channel of History. Viewers of History wanted more military history programs, but there was not time on the channel, thus the creation of Military History. Beginning on March 27, 2004, a military-history programming block started on History International as a prologue. The launch was an open preview, or soft launch, as no cable operators were signed up. Dan Davids, president of the History Channel USA, planned to push for digital basic level cable carriage. Its initial programming library drew from A&E and History's programs. The channel's initial prime time shows were under an umbrella banner of “Battle History”, which consisted of five documentary miniseries featuring each of the US military services. In the second quarter of 2005, the channel had its hard launch.
Like its parent channel, the channel dropped the word "Channel" from its name on March 20, 2008.
Programming
Military History features programs that focus on historical battles and wars, as well as programs that profile key individuals such as generals, soldiers and spies. It also airs documentaries and series that provide insight into how these wars were fought and the lives of those who served in them.
Its initial programming library drew from A&E and History's program libraries. Much of its programming focuses on World War II; this same type of programming had earned The History Channel the appellation "The Hitler Channel" up until the transfer of these programs to Military History. Additionally, their film library uses a great deal of filler simply because there wasn’t footage to cover the action. (e.g. showing soldiers when subject is Marines.)
Programming banners
“Battle History” (January 5, 2005) which consisted of five documentary miniseries featuring the US military services and was the channel's soft launch prime time programming
“Salute to Armed Forces Week”, included the specials, “Hispanics & the Medal of Honor”, “America’s Black Warriors”, “Women Combat Pilots” and “Clash of Warriors: Saddam vs. Schwarzkopf”
List of programs
Conspiracy?
Dogfights
The Eastern Front: The Gates of Moscow
The Eastern Front: Turning Point at Stalingrad
Free Cabanatuan
Greatest Raids
Greatest Tank Battles
Hitler's Collaborators
Hitler's War: The Lost
Inside the Great Battles
The Kamikaze
The Last Days of WWII
Lock N' Load with R. Lee Ermey
Mail Call
Okinawa!
Pacific: The Lost Evidence
President Lincoln Assassination
Survival Training
Surviving the Cut
Tactical to Practical
Triggers: Weapons That Changed the World
The Unholy Battle for Rome
Warriors
Weaponology
Inter
|
https://en.wikipedia.org/wiki/Outdoor%20Channel
|
Outdoor Channel is an American pay television channel focused on the outdoors, offering programming that includes hunting, fishing, western lifestyle, off-road motorsports and adventure. The network can be viewed on multiple platforms including high definition, video on demand as well as on its own website. In 2013, Outdoor Channel was acquired by Kroenke Sports Enterprises.
As of February 2015, Outdoor Channel is available to approximately 35.8 million pay television households (30.8% of households with television) in the United States. In December 2013, the Outdoor Channel was planned to relocate to Colorado from its current location of Temecula, California, supported by Colorado Economic Development Commission.
In March 2019, the channel became available in Australia via the ad-supported streaming service 7plus.
On January 1, 2019, Outdoor Channel ceased broadcasting in Malaysia due to low popularity, then relaunch in March 2021 on different TV provider, Sirius TV. On August 1, 2021, Outdoor Channel ceased broadcasting in EMEA.
The programming in Asia is fairly different from the U.S. and it has lesser hunting content and more travel and adventure series.
The most popular survival series are Running Wild with Bear Grylls, Beyond Survival with Les Stroud, Could You Survive, and So You Think You Could Survive.
In April 2022, Outdoor Channel had partnered with Water Bear Network on the Earth Day to bring in some exclusive environmental protection content in Asia.
It also aired various ocean documentaries like A Plastic Ocean, Ocean Secrets and Ocean Plastic Cleanup Trainee.
Content
The network's primetime lineup is themed with each evening; fishing is featured on Mondays, with hunting on Tuesdays, Thursdays and Sundays, gun-specific programming on Wednesdays, and Hollywood films on Friday and Saturday nights.
American Archer with Tom Nelson
Benelli's American Birdhunter with Tom Knapp
The Brigade: Race to the Hudson
Carter's W.A.R. Wild Animal Response
Duck Dynasty (reruns)
Flying Wild Alaska
Gold Fever with George and Tom Massie
Gun Stories hosted by Joe Mantegna
GunnyTime with R. Lee Ermey
The Hunt for Monster Bass
Jim Shockey's Hunting Adventures
Jim Shockey's Uncharted Major League Fishing Midway USA's Rapid Fire with Iain Harrison and Mike Seeklander
Mossy Oak's Hunting the Country On Your Own Adventures Hosted by Randy Newberg
Realtree Road Trips with Michael Waddell
Rubber Foot Buffalo Adventures with Mark Holt
Shawn Michaels' MacMillan River Adventures with Shawn Michaels and Keith Mark
Shooting Gallery hosted and produced by Michael Bane
Shooting USA hosted by Jim Scoutten
Steve's Outdoor Adventures with Steve West
Ted Nugent's Spirit of the Wild hosted by Ted Nugent
Trev Gowdy's Monster Fish Western Extreme with Jim Burnworth
Wild Ops hosted by Ole Alcumbrac
Winchester's World of Whitetail'' hosted by Rom Spomer
High-definition channel
An HD feed of the channel was launched in 2004, with the name of
|
https://en.wikipedia.org/wiki/NuvoTV
|
NuvoTV (formerly known as Sí TV) was an American cable television network. It was launched on February 25, 2004, and catered to the Latino community with exclusively English-language programming. It ended operations on September 30, 2015, when its programming merged with Fuse; the channel space was replaced with the new channel concept, FM.
History
Beginnings as a production company (1997–2003)
Founded by American entrepreneurs Jeff Valdez and Bruce Barshop, Sí TV was established in 1997 as a production company to develop, produce and distribute original English-language entertainment aimed primarily at a Latino audience. In 1998, the company produced two half-hour bilingual programs – the talk show Cafe Ole with Giselle Fernandez and the comedy series Funny Is Funny – for the Spanish-language cable channel Galavisión. The two series, which dealt primarily with Latino culture in the United States, helped boost Galavisión's audience share on weekends in the 18–34 Latino demographic by 83%. When Sí TV and Galavisión parted ways in August of that year, Valdez sold the shows into national syndication in 52 markets, drawing solid ratings in New York City, Miami, Houston, and San Antonio.
On March 10, 1999, Sí TV announced plans to launch the first English-language cable network aimed at young Latinos. Valdez expressed interest in debuting the channel during the first quarter of 2000. George A. Greenberg of Newberger Greenberg & Associates, a media advisory firm that helped develop the Sci-Fi Channel prior to its August 1992 launch, said the network was expected to initially be available to approximately 6 million U.S. homes. Greenberg estimated that it would cost about $30 million to get Sí TV "up and running" and another $70 million to operate it for its first three years. According to Los Angeles Times columnist Kevin Baxter, although Latinos make up 11% of the population of the United States, and "their numbers are growing six times faster than the population at large", there have been few attempts to develop programming of "relevance to the acculturated segment of that community". Esther Renteria, chairwoman of the National Hispanic Media Coalition, stated that: "I think there's a need for Sí TV, but whether it's too soon or not, I don't know".
Sí TV's production of the Nickelodeon sitcom The Brothers García (which ran from 2000 to 2004), made television history as the first English-language sitcom with a cast and creative team of writers, directors and producers made entirely of Latinos. In January 2003, it was announced that Sí TV would be launched nationally on satellite provider Dish Network at the beginning of that summer. Valdez stated that: "For years, people have ignored the young demographic that doesn't speak Spanish but needs a voice and wants a place to call home".
Launch as a cable television network (2004–10)
Sí TV was launched as a cable network on February 25, 2004, becoming the first exclusively English-language cable channe
|
https://en.wikipedia.org/wiki/Lithium%20chloride%20%28data%20page%29
|
This page provides supplementary chemical data on Lithium chloride.
Solubility
Thermodynamic properties
Spectral data
Structure and properties data
Temperature Relative Humidity over saturated solution in water
Material Safety Data Sheet
The handling of this chemical may incur notable safety precautions. It is highly recommend that you seek the Material Safety Datasheet (MSDS) for this chemical from a reliable source such as SIRI, and follow its directions.
References
Chemical data pages
Chemical data pages cleanup
|
https://en.wikipedia.org/wiki/ODR
|
ODR, or Odr may refer to:
Octal data rate, a technique used in high-speed computer memory
Oculomotor delayed response, a task used in neuroscience.
Óðr
Office for dispute resolution
On Demand Routing
One Day Remains
One Definition Rule
One-drop rule
Online dispute resolution
Operator Driven Reliability - A field maintenance concept which is implemented in ODR programs
Orthogonal distance regression
Outdoor ice rink
Owner-driven reconstruction, in natural disaster recovery
|
https://en.wikipedia.org/wiki/Computing%20%28magazine%29
|
Computing is an online magazine published by The Channel Company for IT managers and professionals in the United Kingdom. The brand announced plans to launch in North America and Germany in 2023.
, Computing'''s circulation was verified by BPA Worldwide as 115,431.
History
Originally launched in 1973 as the official magazine of the British Computer Society and published by Haymarket Publishing, Computing is the longest continuously published magazine for IT professionals in the UK.
In print it was largely a controlled circulation publication, mailed without charge to members of the British Computer Society and other accredited workers in the field of computing. A small minority of issues were sold on newsstands, with the bulk of funding for production arising from advertising.
It was one of two magazines (the other being Accountancy Age) purchased in the 1970s by Dutch publisher VNU Business Media to launch their business in the UK. VNU Business Publications was acquired by Incisive Media in 2007. In April 2022, The Channel Company acquired CRN UK, Computing, and Channel Partner Insight from Incisive Media.
Along with Computer Weekly (and formerly IT Week), Computing is the mainstay of the UK computer industry trade press. Historically, Computing was aimed at business-focused readers, with Computer Weekly catering for readers seeking more technical coverage. This distinction blurred and dissolved in the late 1980s, with IT Week filling the gap left in technology-focused business coverage from 1998. In recent years Computing has pursued both a technical- and business-oriented agenda.
The Computing web site was relaunched with new video and audio content and a focus on extensive reader interactivity in early 2007. About a dozen regular bloggers were introduced to create dynamic content for the online version of the magazine, some of these blogs also being carried in the print title.
The print edition of Computing changed from a weekly to bi-weekly magazine from 10th June 2010. The print edition of the magazine ended publication in the mid-2010s.
The long-term editor of Computing, Bryan Glick, left the title in November 2009 to pursue a new role as editor-in-chief of Computer Weekly. He was replaced in January 2010 by Abigail Warakar, who resigned in January 2012; Chris Middleton, a former editor of Computer Business Review (and deputy editor of Computing in 2001) returned as interim editor. Stuart Sumner became editor of Computing in July 2012. Tom Allen, former deputy editor of Display Daily and who had been with Computing since 2017, took over as editor in October 2022. Computing'' is available online.
References
External links
computing.co.uk
Audited circulation statement 2005 (PDF)
1973 establishments in the United Kingdom
Biweekly magazines published in the United Kingdom
Computer magazines published in the United Kingdom
Computer science in the United Kingdom
Magazines established in 1973
Magazines published in London
Weekly m
|
https://en.wikipedia.org/wiki/Stormbringer%20%28video%20game%29
|
Stormbringer is a computer game written by David Jones and released in 1987 by Mastertronic on the Mastertronic Added Dimension label. It was originally released on the ZX Spectrum, Commodore 64, Amstrad CPC and MSX. A version for the Atari ST was published in 1988. It is the fourth and final game in the Magic Knight series. The in-game music is by David Whittaker.
Plot
Magic Knight returns home, having obtained a second-hand time machine from the Tyme Guardians at the end of Knight Tyme. However, there has been an accident whilst travelling back and there are now two Magic Knights - the other being "Off-White Knight", the dreaded Stormbringer (so called because of his storm cloud which he plans to use to destroy Magic Knight). Magic Knight cannot kill Off-White Knight without destroying himself in the process. His only option is to find Off-White Knight and merge with him.
Gameplay
Gameplay takes the form of a graphic adventure, with commands being inputted via the "Windimation" menu-driven interface, in the style of the previous two games, Spellbound and Knight Tyme (1986).
Magic Knight again has a limited amount of strength which is consumed by performing actions and moving from screen to screen as well as being sapped by various enemies such as the Stormbringer's storm cloud and spinning axes and balls that bounce around some rooms and should be avoided. The need for the player to monitor Magic Knight's strength and avoid enemies means that Stormbringers gameplay is closer to the arcade adventure feel of Spellbound rather than the much more pure graphic adventure feel of Knight Tyme''.
As with the previous two Magic Knight games, there are characters with whom Magic Knight can interact and have help him. Magic Knight's spellcasting abilities are also important for solving the game's puzzles including the "merge" spell to be used when he finds Off-White Knight.
External links
Information about the Atari ST version
1987 video games
Amstrad CPC games
Atari Jaguar games
Atari ST games
Commodore 64 games
Platformers
ZX Spectrum games
MSX games
Mastertronic games
Video games scored by David Whittaker
Video games developed in the United Kingdom
Single-player video games
Video game sequels
|
https://en.wikipedia.org/wiki/Skating%20with%20Celebrities
|
Skating with Celebrities is an American figure skating talent show that began airing on Fox on January 18, 2006. The show also aired in Australia on Network Ten in early 2006 and in New Zealand in October 2008. The show was the U.S. version of Dancing on Ice, which also aired in the United Kingdom during the same time period.
Skating with Celebrities was met with far less success than the British original and lasted only one season. The show was at the center of a controversy involving allegations that one of the competing couples, Lloyd Eisler and Kristy Swanson, were involved in an extramarital affair. The duo defeated the team of television personality Jillian Barberie and U.S. pairs champion John Zimmerman to win the show's first - and only - championship. On March 2, 2006, production was cancelled and it was announced that the show would not return for a second season.
Synopsis
Following the success of ABC's Dancing with the Stars, Fox started airing its own celebrity competition revolving around skating instead of dancing.
The show produced by Rob Dustin paired six champion figure skaters with six celebrities who have various degrees of skating experience, including Deborah Gibson, a novice; Dave Coulier, who played ice hockey in Canada; Kristy Swanson, who had taken lessons as a child; and Jillian Barberie, who had training as a competitive figure skater into her teens. Each team was composed of one man and one woman together as a pair, and they were to perform a new routine during each episode. As part of their new routines, each celebrity had to demonstrate a specific figure skating skill.
Each pair received scores for technical merit and artistic impression from a trio of judges. The scores were added together to create a cumulative score. No teams were eliminated in the first episode.
Cast
Celebrities and their partners
Hosts & judges
The show was hosted by Olympic champion swimmer Summer Sanders and Olympic gold medal figure skater Scott Hamilton and judged by Olympic figure skating legend Dorothy Hamill, skating coach John Nicks, and journalist Mark Lund. Former pair skater Randy Gardner served as choreographer.
Averages
Technical and Artistic are one skate each
Episodes
Episode 1
The Featured Skill was Spins. In this episode, teams skated to music from the movies. During rehearsal, Dave Coulier, a hockey player, was frustrated at the fact that he kept tripping in his figure skates, so he filed off the toe picks to make them more like hockey skates.
Lloyd Eisler and Kristy Swanson ran into their first complication as a team: Swanson, as a left-hander, spun in the opposite direction from Eisler. Choreographer Renée Roca told Eisler that they would simply have to choreograph the routine to take advantage of the difference rather than have each try to adapt to the other's spinning. The awkwardness of this decision showed as their shaky routine landed them in last place.
Todd Bridges and Jenni Meno skated to music from
|
https://en.wikipedia.org/wiki/Transport%20in%20Hyderabad
|
Hyderabad, the capital and largest city of Telangana, features a growing transportation infrastructure that includes a network of roads, railways, and a developing rapid transit system. These transportation systems play a crucial role in connecting the city's residents and facilitating efficient travel within Hyderabad and its surrounding areas. Furthermore, Hyderabad serves as a significant center for transportation and logistics, playing a crucial role in facilitating the seamless movement of goods and services within the state.
Road
Hyderabad is integrated into the National Highway Network of India through NH 44, NH 65, NH 163, NH 765, NH 765D, while four State Highways SH1, SH4, SH 6, SH 19 originate/terminate in Hyderabad. Hyderabad has a vehicle population of nearly 48 lakhs and is the highest after Delhi, Bengaluru, Chennai and Mumbai.
The first Expressway in Hyderabad connecting Mehdipatnam and Aramgarh opened for public in 2009 to ease connectivity to Rajiv Gandhi International Airport located in Shamshabad, and named after the former Prime Minister P V Narsimha Rao. An extension of this Expressway further to Shamshabad was mulled in 2018.
The Road Network in Hyderabad is characterised by a concentric network of Inner Ring Road and Outer Ring Road. The latter is an expressway stretching 158 km, built to provide orbital linkage between arterial radial roads within the city, as well as to offer connectivity the National Highways.
Bus
Telangana State Road Transport Corporation
Hyderabad has an extensive intracity, intercity/regional and interstate bus service network operated by TSRTC, backed by the Government of Telangana. Within the municipal limits of the city, TSRTC plies intercity and interstate buses from Mahatma Gandhi Bus Station, Uppal Bus Station, Charminar Bus Station, Dilsukhnagar Bus Station, Koti Bus Station, Rathifile Bus Station, Ghatkesar Bus Station, Afzalgunj Bus Station, Medchal Bus Station, Sanathnagar Bus Station, ECIL Bus Station and Secretariat.
City buses are deployed from their respective depots which shall have jurisdiction over the staffing and frequency of services. City and Suburban buses constitute the primary mode of transport in Hyderabad.
TSRTC has several kinds of services which differ in comfort, price and the number of stops:
Metro Luxury (air-conditioned)
City Sheetal (air-conditioned)
Metro Deluxe
Metro Express Low Floor (non air-conditioned)
Metro Express
City Ordinary
Pushpak (for Airport Connectivity, air-conditioned). electric buses are used in this airport bus service.
Setwin
The State Government of Telangana (erstwhile Andhra Pradesh) sanctioned minibuses as a self-employment generation scheme which ply between different parts of the city in addition to the city buses run by TSRTC.
Taxis
Metered Auto Rickshaw usually referred to as an "auto", is another widely available taxi in Hyderabad. Shared 'auto' taxis are also a commonplace in Hyderabad. Mandatory Metering is contentious issu
|
https://en.wikipedia.org/wiki/STart
|
STart was a computer magazine covering the Atari ST published from Summer 1986 through April/May 1991—42 issues total. STart began as sections of Atari 8-bit family magazine Antic, before being spun off into a separate publication. Its primarily competitor ST-Log was similarly spawned by ANALOG Computing. Each issue of STart included a cover disk.
See also
Atari ST User, A British Atari ST magazine
Page 6, Long-running Atari magazine for 8-bit and ST machines
References
External links
STart Magazine archive—At the Classic Computer Magazine Archive
Archived STart magazines on the Internet Archive
Atari ST magazines
Defunct computer magazines published in the United States
Magazines established in 1986
Magazines disestablished in 1991
|
https://en.wikipedia.org/wiki/Spectre%20GCR
|
The Spectre GCR is a hardware and software package for the Atari ST computers. The hardware consists of a cartridge that plugs into the Atari ST's cartridge port and a cable that connects between the cartridge and one of the floppy ports on the ST. Designed by David Small and sold through his company Gadgets by Small, it allows the Atari ST to run most Macintosh software. It is Small's third Macintosh emulator for the ST, replacing his previous Magic Sac and Spectre 128.
The Spectre GCR requires the owner to provide official Apple Macintosh 128K ROMs and Macintosh Operating System 6.0.8 disks. This avoids any legal issues of copying Apple's software. The emulator runs best with a high-resolution monochrome monitor, such as Atari's own SM124, but will run on color displays by either displaying a user-selectable half of the Macintosh screen, or missing out alternate lines to fit the lower resolution color display. The Spectre GCR plugs into the cartridge slot and floppy port, and modifies the frequency of the data to/from the single-speed floppy drive of the Atari ST, allowing it to read Macintosh GCR format discs which require a multi-speed floppy drive.
The manual claims the speed to be 20% faster than an actual Mac Plus with a 30% larger screen area and resolution. Although Spectre GCR runs in 1MB of memory, 2MB or more is recommended.
References
External links
Official Spectre Webpage and On-line Resource
Atari ST software
Macintosh platform emulators
|
https://en.wikipedia.org/wiki/Stay%20Lucky
|
Stay Lucky is a British television comedy-drama series ran from 8 December 1989 to 6 August 1993. Made by Yorkshire Television and screened on the ITV network, it starred Jan Francis and Dennis Waterman.
Plot
Drama about a small-time gangster Thomas Gynn (Dennis Waterman) from London who discovers a new life up north in Yorkshire.
Helping widowed, self-sufficient businesswoman Sally Hardcastle (Jan Francis) when her car breaks down on the motorway, Thomas reluctantly accepts an offer of a lift to Leeds.
Over the coming months, the two become involved in a series of misadventures that soon find them being drawn closer together.
Cast
Dennis Waterman as Thomas Gynn
Jan Francis as Sally Hardcastle
Emma Wray as Pippa
Niall Toibin as John Lively
Susan George as Samantha Mansfield
Ian McNeice as Franklyn Bysouth
Leslie Ash as Jo Blake
Dougray Scott as Alex
Willie Ross as Barney Potter
Chris Jury as Kevin
James Grout as Ken Warren
Lou Hirsch as Monty
Mac McDonald as Vinny
Others include Paul Chapman, Belinda Lang, Rula Lenska, Amanda Noar and Rosemary Martin.
Episodes
Series 1 (1989)
Series 2 (1990)
Series 3 (1991)
Series 4 (1993)
Locations
Clarence Dock, Leeds, West Yorkshire, England, UK (Series 1 – Sally's boatyard)
Canal Basin, Sowerby Bridge, West Yorkshire, England, UK (Series 2 and 3 – Sally's boatyard)
Armley Mills Industrial Museum, Armley, Leeds, West Yorkshire, England, UK (Series 4 – The Yorkshire Industrial Museum)
External links
Dennis Waterman – Museum website.
1989 British television series debuts
1993 British television series endings
1980s British drama television series
1990s British drama television series
English-language television shows
ITV television dramas
Television series by ITV Studios
Television series by Yorkshire Television
Television shows scored by John Powell
Television shows set in West Yorkshire
|
https://en.wikipedia.org/wiki/Neural%20computation
|
Neural computation is the information processing performed by networks of neurons. Neural computation is affiliated with the philosophical tradition known as Computational theory of mind, also referred to as computationalism, which advances the thesis that neural computation explains cognition. The first persons to propose an account of neural activity as being computational was Warren McCullock and Walter Pitts in their seminal 1943 paper, A Logical Calculus of the Ideas Immanent in Nervous Activity. There are three general branches of computationalism, including classicism, connectionism, and computational neuroscience. All three branches agree that cognition is computation, however, they disagree on what sorts of computations constitute cognition. The classicism tradition believes that computation in the brain is digital, analogous to digital computing. Both connectionism and computational neuroscience do not require that the computations that realize cognition are necessarily digital computations. However, the two branches greatly disagree upon which sorts of experimental data should be used to construct explanatory models of cognitive phenomena. Connectionists rely upon behavioral evidence to construct models to explain cognitive phenomena, whereas computational neuroscience leverages neuroanatomical and neurophysiological information to construct mathematical models that explain cognition.
When comparing the three main traditions of the computational theory of mind, as well as the different possible forms of computation in the brain, it is helpful to define what we mean by computation in a general sense. Computation is the processing of information, otherwise known as variables or entities, according to a set of rules. A rule in this sense is simply an instruction for executing a manipulation on the current state of the variable, in order to produce an specified output. In other words, a rule dictates which output to produce given a certain input to the computing system. A computing system is a mechanism whose components must be functionally organized to process the information in accordance with the established set of rules. The types of information processed by a computing system determine which type of computations it performs. Traditionally, in cognitive science there have been two proposed types of computation related to neural activity - digital and analog, with the vast majority of theoretical work incorporating a digital understanding of cognition. Computing systems that perform digital computation are functionally organized to execute operations on strings of digits with respect to the type and location of the digit on the string. It has been argued that neural spike train signaling implements some form of digital computation, since neural spikes may be considered as discrete units or digits, like 0 or 1 - the neuron either fires an action potential or it does not. Accordingly, neural spike trains could be seen as strings of digit
|
https://en.wikipedia.org/wiki/Stropping%20%28syntax%29
|
In computer language design, stropping is a method of explicitly marking letter sequences as having a special property, such as being a keyword, or a certain type of variable or storage location, and thus inhabiting a different namespace from ordinary names ("identifiers"), in order to avoid clashes. Stropping is not used in most modern languages – instead, keywords are reserved words and cannot be used as identifiers. Stropping allows the same letter sequence to be used both as a keyword and as an identifier, and simplifies parsing in that case – for example allowing a variable named if without clashing with the keyword if.
Stropping is primarily associated with ALGOL and related languages in the 1960s. Though it finds some modern use, it is easily confused with other similar techniques that are superficially similar.
History
The method of stropping and the term "stropping" arose in the development of ALGOL in the 1960s, where it was used to represent typographical distinctions (boldface and underline) found in the publication language which could not directly be represented in the hardware language – a typewriter could have bold characters, but in encoding in punch cards, there were no bold characters. The term "stropping" arose in ALGOL 60, from "apostrophe", as some implementations of ALGOL 60 used apostrophes around text to indicate boldface, such as 'if' to represent the keyword if. Stropping is also important in ALGOL 68, where multiple methods of stropping, known as "stropping regimes", are used; the original matched apostrophes from ALGOL 60 was not widely used, with a leading period or uppercase being more common, as in .IF or IF and the term "stropping" was applied to all of these.
Syntaxes
A range of different syntaxes for stropping have been used:
Algol 60 commonly used only the convention of single quotes around the word, generally as apostrophes, whence the name "stropping" (e.g. 'BEGIN').
Algol 68 in some implementations treat letter sequences prefixed by a single quote, ', as being keywords (e.g., 'BEGIN)
In fact it was often the case that several stropping conventions might be in use within one language. For example, in ALGOL 68, the choice of stropping convention can be specified by a compiler directive (in ALGOL terminology, a "pragmat"), namely POINT, UPPER, QUOTE, or RES:
POINT for 6-bit (not enough characters for lowercase), as in .FOR – a similar convention is used in FORTRAN 77, where LOGICAL keywords are stropped as .EQ. etc. (see below)
UPPER for 7-bit, as in FOR – with lowercase used for ordinary identifiers
QUOTE as in ALGOL 60, as in 'for'
RES reserved words, as used in modern languages – for is reserved and not available to ordinary identifiers
The various rules regimes are a lexical specification for stropped characters, though in some cases these have simple interpretations: in the single apostrophe and dot regimes, the first character is functioning as an escape character, while in the matched apostrop
|
https://en.wikipedia.org/wiki/Kim%20Zetter
|
Kim Zetter is an American investigative journalist and author who has covered cybersecurity and national security since 1999. She has broken numerous stories over the years about NSA surveillance, WikiLeaks, and the hacker underground, including an award-winning series about the security problems with electronic voting machines. She has three times been voted one of the top ten security journalists in the U.S. by her journalism peers and security professionals. She is considered one of the world's experts on Stuxnet, a malicious computer worm used to sabotage Iran's nuclear program, and published a book on the topic called Countdown to Zero Day: Stuxnet and the Launch of the World's First Digital Weapon.
Biography
She has written on a wide variety of subjects from the Kabbalah to dining out in San Francisco to Israel to cryptography and electronic voting, and her work has been published in newspapers and magazines all over the world, including the Los Angeles Times, San Francisco Chronicle, Jerusalem Post, San Jose Mercury News, Detroit Free Press, and the Sydney Morning Herald. She has been a staff reporter at Wired, a writer and editor at PC World, and a guest on NPR and CNN.
Zetter has interviewed and written about many notable people including sculptor Jim Sanborn (creator of the CIA's Kryptos sculpture), Ed Scheidt (Chairman of the CIA's Cryptographic Center), Mike Lynn (about the Cisco scandal in 2005), Australian film director Baz Luhrmann,
United States Assistant Attorney General Viet Dinh (creator of the Patriot Act),
and the famous cryptographer Bruce Schneier.
Though born in the United States, she got her start as a journalist in Israel, when she was living there for three years. Some of her first articles were written for the Jerusalem Post. She speaks English and Hebrew, and her book on the Kabbalah has been published in multiple languages.
Selected articles
Three Minutes with Jeff Moss, April 3, 2001, PC World (interview with the founder of the Def Con and Black Hat security conferences)
Baz brings bohemians to the Bay, October 18, 2002, The Age: Melbourne, Australia (on Baz Luhrmann)
BlackBerry Reveals Bank's Secrets, August 25, 2003, Wired News
Time to Recall E-Vote Machines?, October 6, 2003, Wired News
Did E-Vote Firm Patch Election?, October 13, 2003, Wired News
How E-voting Threatens Democracy, April 2, 2004, Wired News
Solving the Enigma of Kryptos, January 26, 2005, Wired News
Why Racial Profiling Doesn't Work, August 22, 2005, Salon.com
The Secret Seven, Jun 13, 2008, Condé Nast Portfolio
PIN Crackers Nab Holy Grail of Bank Card Security , April 14, 2009, Wired News
The Untold Story of the Boldest Supply-Chain Hack Ever, May 2, 2023, Wired
Awards
2005, Maggie Award (Western Publications Association), Best Web Article/Consumer, for "How E-Voting Threatens Democracy"
2004, IRE Awards (Investigative Reporters and Editors), Finalist, Online category, for "Machine Politics" (E-voting series)
2002, Mag
|
https://en.wikipedia.org/wiki/Windows%20Imaging%20Format
|
The Windows Imaging Format (WIM) is a file-based disk image format. It was developed by Microsoft to help deploy Windows Vista and subsequent versions of the Windows operating system family, as well as Windows Fundamentals for Legacy PCs.
Design
Like other disk image formats, a WIM file contains a set of files and associated filesystem metadata. However, unlike sector-based formats (such as ISO or VHD), WIM is file-based: the fundamental unit of information in a WIM is a file.
The primary advantages of being file-based is hardware independence and single-instance storage of a file referenced multiple times in the filesystem tree. Since the files are stored inside a single WIM file, the overhead of opening and closing many individual files is reduced. The cost of reading or writing many thousands of individual files on the local disk is negated by hardware and software-based disk caching as well as sequential reading and writing of the data.
WIM files can contain multiple disk images, which are referenced either by their numerical index or by their unique name. Due to the use of single-instance storage, the more each successive disk image has in common with previous images added to the WIM file, the less new data will be added. A WIM can also be split (spanned) into multiple parts, which have the extension.
WIM images can be made bootable and Windows boot loader supports booting Windows from a WIM file. Windows Setup DVD in Windows Vista and later use such WIM files. In this case, BOOT.WIM contains a bootable version of Windows PE from which the installation is performed. Other setup files are held in the INSTALL.WIM.
Since Windows 8.1, the size of Windows directory can be reduced by moving system files into compressed WIM images stored on a separate hidden partition (WIMBoot). Since Windows 10, system files can be compressed on the system disk (CompactOS).
WIM supports three families of LZ77-based compression algorithms in ascending ratio and descending speed: XPRESS, LZX, and LZMS. The former two use Huffman encoding, while the latter uses adaptive Huffman encoding with range coding. There is also support for solid compression. Both solid compression and LZMS are introduced more recently, in WIMGAPI from Windows 8 and DISM from Windows 8.1.
Tools
ImageX
ImageX is the command-line tool used to create, edit and deploy Windows disk images in the Windows Imaging Format. Along with the underlying Windows Imaging Interface library (WIMGAPI), it is distributed as part of the free Windows Automated Installation Kit (WAIK/OPK). Starting with Windows Vista, Windows Setup uses the WAIK API to install Windows.
The first distributed prototype of ImageX was built 6.0.4007.0 (main.030212-2037). It allowed Microsoft OEM partners to experiment with the imaging technology and was developed in parallel with Longhorn alpha prototypes. It was first introduced in Milestone 4 into the Longhorn project and used in later builds of Longhorn. Build 6.0.5384
|
https://en.wikipedia.org/wiki/S/n
|
S/n, S/N or s/n may refer to:
Signal-to-noise ratio, a measure in science and engineering
Screen name (computing), of a computer user
Serial number, a unique identifier
See also
SN (disambiguation)
Signal-to-noise (disambiguation)
|
https://en.wikipedia.org/wiki/Digi-Comp%20II
|
The Digi-Comp II was a toy computer invented by John "Jack" Thomas Godfrey (1924–2009) in 1965 and manufactured by E.S.R., Inc. in the late 1960s, that used marbles rolling down a ramp to perform basic calculations.
Description
A two-level masonite platform with blue plastic guides served as the medium for a supply of marbles that rolled down an inclined plane, moving plastic cams as they went. The red plastic cams played the part of flip-flops in an electronic computer - as a marble passed one of the cams, it would flip the cam around - in one position, the cam would allow the marble to pass in one direction, in the other position, it would cause the marble to drop through a hole and roll to the collection of marbles at the bottom of the machine. The original Digi-Comp II platform measured .
The Digi-Comp II was not programmable, unlike the Digi-Comp I, an earlier offering in the E.S.R. product line that used an assortment of plastic slides, tubes, and bent metal wires to solve simple logic problems. However, the Digi-Comp II is more suitable for public display, since the only removable elements are the moving balls.
Computational power
Computer scientist Scott Aaronson analyzed the computational power of the Digi-Comp II. There are several ways to mathematically model the device's computational capabilities. A natural abstraction is a directed acyclic graph (DAG) in which each internal vertex has an out-degree of 2, representing a toggle cam that routes balls to one of two other vertices. A fixed number of balls are placed at a designated source vertex, and the decision problem is to determine whether any balls ever reach a designated sink vertex.
Aaronson showed that this decision problem, given as inputs a description of the DAG and the number of balls to run (encoded in unary), is complete under log-space reduction for CC, the class of problems log-space reducible to the stable marriage problem. He also showed that the variant of the problem in which the number of balls is encoded in binary, allowing the machine to run for an exponentially longer time, is still in the P class of complexity.
Reproductions
A slightly downscaled reproduction of the Digi-Comp II, made from plywood, is available from Evil Mad Scientist since 2011. This reproduction uses steel pachinko balls, and measures .
In 2011, Evil Mad Scientist also created a giant variant measuring around in size that uses billiard balls. The Stata Center at the Massachusetts Institute of Technology displays one copy of the giant version for hands-on operation by visitors.
See also
Geniac
Dr. Nim - a Nim-playing game, based on the Digi-Comp II mechanism
Turing Tumble
WDR paper computer
CARDboard Illustrative Aid to Computation
References
External links
MIT CSAIL VIDEO: How the Digi-Comp II works – Brief hands-on demonstration of operation
The Old Computer Museum - Collection of old analog, digital and mechanical computers.
web simulator, from System Source Compute
|
https://en.wikipedia.org/wiki/Digi-Comp
|
Digi-Comp may refer to:
Digi-Comp I, a mechanical toy computer without marbles
Digi-Comp II, a marble-based mechanical toy computer
Dr. NIM, a game of Nim based on the Digi-Comp mechanism
|
https://en.wikipedia.org/wiki/Gregory%20Dudek
|
Gregory L. Dudek is a Canadian computer scientist specializing in robotics, computer vision, and intelligent systems. He is a chaired professor at McGill University where he has led the Mobile Robotics Lab since the 1990s (a role now shared with Prof. Dave Meger). He was formerly the director of McGill's school of computer science and before that director of McGill's center for intelligent machines.
He holds a position as the VP, Research and Lab Head at the Samsung AI Center, Montreal, serves as Director of the NSERC Canadian Robotics Network, and is a co-founder of tech startup Independent Robotics.
During his career, Dudek has co-authored >450 scientific publications on subjects including autonomous navigation, robots that learn, mobile robotics, machine learning, telecommunications, 5G/6G network optimization, robot localization and navigation, information summarization, human-robot interaction, sensor-based robotics, multi-robot systems, computer vision, marine robotics, self-driving vehicles, recognition, RF localization, distributed system design, and biological perception. He has published three books, including a textbook co-authored with Prof. Michael Jenkin on “Computational Principles for Mobile Robotics”.
Research and career
Dudek's early career focused on sensing for robots and the theory of the complexity of robot localization, such as path planning and execution and appearance based visualization of so-called "trash can robots". With his colleagues he produced the first formal proof of the complexity of global robot localization in a metric environment (i.e. how hard it is, in the worst possible case, for a robot to determine its position if it totally lost) and examined the use of WiFi signature mapping for mapping and location estimation long before it was widely known. Other early work addressed issues related to the use of topological maps and the complexity of topological mapping (an abstract idealized form of robotics problem), robot position estimation using photographic data, and the automated detection of interesting images. He also did early work metrically accurate robot positioning, notably using sonar sensors or computer vision, and is the first to use the term "localization" to refer to problem of quantitatively accurate robot position estimation from sensor data.
Dudek later transitioned into field robotics, and in particular marine field robotics. This work was inspired, in part, by a desire to help conservationists monitor coral reef health, a seemingly simple yet logistically challenging task. Towards this end, Dudek and colleagues developed an autonomous, amphibious robot named Aqua that can monitor coral reef health. Challenges of building an autonomous underwater include building a robot out of materials that are appropriate for the aquatic environment and water-proofing the interior, perception in an environment with limited visibility, localization and navigation of an unknown and dynamic environment,
|
https://en.wikipedia.org/wiki/TNT%20HD
|
TNT HD may refer to high-definition television services from:
Turner Network Television, American cable channel
Télévision Numérique Terrestre, French digital terrestrial service
TNT Serie, German television channel
TNT (Sweden), Swedish television channel
|
https://en.wikipedia.org/wiki/GPM
|
GPM may refer to:
GPM (software), software providing support for mouse devices in Linux virtual consoles
Graphical path method, a mathematically based algorithm used in project management
Gallons per minute, a unit of volumetric flow rate
Gallons per mile, a unit of fuel efficiency
Gaurela-Pendra-Marwahi district, Chhattisgarh, India
General Purpose Macrogenerator, an early macro processor
Global Marshall Plan, specific ideas on how to save the global environment
Global Precipitation Measurement, a NASA and Japan Aerospace Exploration Agency project to measure global rainfall
Graduated payment mortgage, a type of loan
Graham Patrick Martin, an American actor
Grand Prairie Municipal Airport, a public-use airfield in Grand Prairie, Texas, United States (Federal Aviation Administration identification code)
Grand Prix Masters, an auto racing series for retired Formula One drivers
Gross profit margin, a calculation of revenue and cost of products
Protestant Church in the Moluccas, a church denomination in the Indonesian provinces of Maluku and North Maluku, which in Indonesian is referred to as "Gereja Protestan Maluku"
Google Play Music, a cloud media player by Google
King of the Mountains competitions in cycle racing, derived from Gran Premio della Montagna (Italian) or Gran Premio de la montaña (Spanish)
|
https://en.wikipedia.org/wiki/Kingston%20Branch
|
The Kingston Branch was a major railway line in Southland, New Zealand. It formed part of New Zealand's national rail network for over a century: construction began in 1864, Kingston was reached in 1878, and it closed in 1979. For much of its life, it was considered a secondary main line rather than a branch line, and in its earlier years, it was sometimes known as the "Great Northern Railway". Today, the southern portion now forms a part of the Wairio Branch and the northernmost 14 kilometres was used by the Kingston Flyer.
Construction
The Kingston Branch was built to be a main line north from Invercargill to improve communications through the Southland region, and to provide a link to the Central Otago gold fields. The provincial government of Southland was not very wealthy, and for this reason, a proposal claiming that the railway would be cheaper if built with wooden rails was accepted. A 12-kilometre line between Invercargill and Makarewa was opened on 18 October 1864, and the unsuitability of the wooden tracks became obvious quickly. Unlike most railway lines in New Zealand, this route was built to the international standard gauge of , and in June 1866 the decision was made to convert to iron rails. This conversion was performed at the same time as the line was extended to Winton and it opened on 22 February 1871. This proved to be the farthest extent of the gauge in Southland, and further lines were built to the nationally accepted narrow gauge of . The first portion of the Kingston Branch built to the new gauge was from Winton to Caroline, which opened on 20 October 1875, two months before the rest of the line to Invercargill was converted to the new gauge, on 20 December. The locomotives and rolling stock were now surplus and sold to the government of New South Wales in Australia, but the ship on which they were carried was wrecked in Westland and thus the trains never made it to Australia.
Beyond Caroline, construction was swift. The railway opened to Lumsden on 7 February 1876 and then Lowther on 15 January 1877, Athol on 20 January 1878, and finally Kingston on 10 July 1878, some 140 kilometres from Invercargill. In February 1879, a steamboat connection on Lake Wakatipu was established, from Kingston to Queenstown.
Stations
The following stations were on the Kingston Branch (in brackets is the distance from Invercargill):
Grasmere (3 km)
Waikiwi (4 km)
Lorneville (7 km)
Linds Bridge (10 km)
Makarewa (12 km)
Ryal Bush (15 km)
Wilson's Crossing (18 km)
Lochiel (23 km)
Thomsons (26 km)
Gap Road (29 km)
Winton (30 km)
Lady Barkly (35 km)
Limehills (37 km)
Ords (39 km)
Centre Bush (41 km)
Pukearuhe (45 km)
Kauana (46 km)
Benmore (51 km)
Dipton (58 km)
Caroline (66 km)
Josephville (72 km)
Lumsden (79 km)
Lowther (89 km)
Five Rivers (93 km)
Eyre Creek (98 km)
Parawa (105 km)
Athol (110 km)
Nokomai (118 km)
Garston (120 km)
Fairlight (126 km)
Kingston (140 km)
Junctions
Three stations on the Kingston Branch were junctio
|
https://en.wikipedia.org/wiki/Little%20Oberon
|
Little Oberon, directed by Kevin Carlin, is an Australian telemovie starring Sigrid Thornton, which was broadcast on 18 September 2005 by Network Nine. The movie was filmed during 2004 in and around the town of Marysville, Victoria. The township was devastated in the February 2009 bush fires of Black Saturday. Also appearing in the telemovie were Brittany Byrnes, Tasma Walton and Peter Rowsthorn.
The film is about Georgie Green (Walton) and her daughter Natasha (Byrnes, nominated for an AFI award) going to visit Georgie's mother, Lola (Thornton) who is dying of cancer. Thornton shaved her head for the role; and said that wearing a bald cap would be disrespectful to cancer patients. Natasha tries to find out the identity of her father and begins to have visions of a young friend of her mother who had disappeared 16 years before. With Georgie – a witch (Wicca) – and family tensions high, there are settling-in problems when Georgie and Natasha decide to stay for a while.
Cast
Sigrid Thornton – Lola Green
Tasma Walton – Georgie Green
Brittany Byrnes – Natasha Green
Alexander Cappelli – Gresham
Brett Climo – Dr. Vivian Cage
Helen Dallimore – Siobhan
Peter Rowsthorn – Miss Kafka
Morgan O'Neill – Dennis
Samatha Reynolds – Cathy Burke
Katrina Milosevic – Fatima
Tony Nikolakopoulos
References
External links
Little Oberon at the National Film and Sound Archive
2005 television films
2005 films
Australian drama television films
2005 drama films
2000s English-language films
Films directed by Kevin Carlin
English-language drama films
|
https://en.wikipedia.org/wiki/Data%20Mining%20Extensions
|
Data Mining Extensions (DMX) is a query language for data mining models supported by Microsoft's SQL Server Analysis Services product.
Like SQL, it supports a data definition language, data manipulation language and a data query language, all three with SQL-like syntax.
Whereas SQL statements operate on relational tables, DMX statements operate on data mining models.
Similarly, SQL Server supports the MDX language for OLAP databases.
DMX is used to create and train data mining models, and to browse, manage, and predict against them.
DMX is composed of data definition language (DDL) statements, data manipulation language (DML) statements, and functions and operators.
Queries
DMX Queries are formulated using the SELECT statement.
They can extract information from existing data mining models in various ways.
Data definition language
The data definition language (DDL) part of DMX can be used to
Create new data mining models and mining structures - CREATE MINING STRUCTURE, CREATE MINING MODEL
Delete existing data mining models and mining structures - DROP MINING STRUCTURE, DROP MINING MODEL
Export and import mining structures - EXPORT, IMPORT
Copy data from one mining model to another - SELECT INTO
Data manipulation language
The data manipulation language (DML) part of DMX can be used to
Train mining models - INSERT INTO
Browse data in mining models - SELECT FROM
Make predictions using mining model - SELECT ... FROM PREDICTION JOIN
Example: a prediction query
This example is a singleton prediction query, which predicts for the given customer whether she will be interested in home loan products.
SELECT
[Loan Seeker],
PredictProbability([Loan Seeker])
FROM
[Decision Tree]
NATURAL PREDICTION JOIN
(SELECT
35 AS [Age],
'Y' AS [House Owner],
'M' AS [Marital Status],
'F' AS [Gender],
2 AS [Number Cars Owned],
2 AS [Total Children],
18 AS [Total Years of Education]
)
See also
XML for Analysis
References
External links
Data Mining Extensions (DMX) Reference, (at MSDN)
Query languages
Data mining and machine learning software
|
https://en.wikipedia.org/wiki/New%20and%20delete%20%28C%2B%2B%29
|
In the C++ programming language, and are a pair of language constructs that perform dynamic memory allocation, object construction and object destruction.
Overview
Except for a form called the "placement new", the operator denotes a request for memory allocation on a process's heap. If sufficient memory is available, initialises the memory, calling object constructors if necessary, and returns the address to the newly allocated and initialised memory. A request, in its simplest form, looks as follows:
p = new T;
where is a previously declared pointer of type (or some other type to which a pointer can be assigned, such as a superclass of ). The default constructor for , if any, is called to construct a instance in the allocated memory buffer.
If not enough memory is available in the free store for an object of type , the request indicates failure by throwing an exception of type . This removes the need to explicitly check the result of an allocation.
The deallocation counterpart of is , which first calls the destructor (if any) on its argument and then returns the memory allocated by back to the free store. Every call to must be matched by a call to ; failure to do so causes a memory leak.
syntax has several variants that allow finer control over memory allocation and object construction. A function call-like syntax is used to call a different constructor than the default one and pass it arguments, e.g.,
p = new T(argument);
calls a single-argument constructor instead of the default constructor when initializing the newly allocated buffer.
A different variant allocates and initialises arrays of objects rather than single objects:
p = new T [N];
This requests a memory buffer from the free store that is large enough to hold a contiguous array of objects of type , and calls the default constructor on each element of the array.
Memory allocated with the must be deallocated with the operator, rather than . Using the inappropriate form results in undefined behavior. C++ compilers are not required to generate a diagnostic message for using the wrong form.
The C++11 standard specifies an additional syntax,
p = new T[N] {initializer1, ..., initializerN};
that initializes each to .
Error handling
If cannot find sufficient memory to service an allocation request, it can report its error in three distinct ways. Firstly, the ISO C++ standard allows programs to register a custom function called a with the C++ runtime; if it does, then this function is called whenever encounters an error. The may attempt to make more memory available, or terminate the program if it can't.
If no is installed, instead throws an exception of type . Thus, the program does not need to check the value of the returned pointer, as is the habit in C; if no exception was thrown, the allocation succeeded.
The third method of error handling is provided by the variant form , which specifies that no exception should be thrown; instead, a null pointe
|
https://en.wikipedia.org/wiki/Leela%27s%20Homeworld
|
"Leela's Homeworld" is the second episode in the fourth season of the American animated television series Futurama, and the 56th episode of the series overall. It originally aired on the Fox network in the United States on February 17, 2002. "Leela's Homeworld" was written by Kristin Gore and directed by Mark Ervin. The episode reveals Leela's true origin as a mutant who was abandoned by her parents so she could have a better life. Her parents fabricated her prior background as an alien, as it is illegal for mutants to live on the surface.
Plot
The Professor announces some good news: Leela's old orphanarium has named her orphan of the year, and that he has invented a machine that makes glow-in-the-dark noses. The machine produces enormous amounts of toxic waste, and Hermes tells him to get rid of it. The Professor hires Bender for the job, and he dumps the waste into the sewer. At the orphanarium's award ceremony, the headmaster presents a story of Leela's arrival and Leela delivers a speech which profoundly inspires the orphans. However, back at Planet Express, Fry finds Leela in tears, and she admits she still longs to have parents, unaware that a pair of individuals each with a single eye like her are watching from underneath a sewer grate.
Bender expands his one-time dumping into a full waste management service. The sewer mutants grow angry with Bender's disposal technique and abduct him, Fry, and Leela. The mutants sentence them to be lowered into a lake of chemicals which will turn them into mutants. Two hooded mutants break from the group and swing the crane the three are tied to, dropping them on the far side of the mutagenic lake. The mutant mob pursue them. Fry, Leela, and Bender take refuge in a mutant home, where they find photos and news clippings of every major event in Leela's life. Leela is frozen in horror at the thought of a mutant having been stalking her her whole life, giving the mob the opportunity to capture them. However, after a whispered word from the hooded mutants, the crew's sentence is commuted to exile. They are flown by hot air balloon to a surface access ladder hanging over the lake. Fry and Bender emerge on the surface, but Leela, determined to find out what the hooded mutants know about her, dives into the chemical lake. To her surprise, she is unaffected by the chemicals. Fry heads to the orphanarium to get some clues to what is going on, and the headmaster gives him the alien-language note that was left with Leela when she was abandoned. Fry takes the note to the Professor for analysis.
Leela pursues the hooded mutants through the sewers back to the home with the shrine to herself. Finding that one of them has a bracelet identical to one she has had since before coming to her orphanarium, Leela hypothesizes that they killed her parents, and the hooded mutants confess. Before Leela can kill the two in her rage, Bender shoots Fry through the ceiling using his waste disposal pump. Fry stops Leela and removes
|
https://en.wikipedia.org/wiki/Religion%20and%20spirituality%20podcast
|
A Religion and spirituality podcast also known as a Godcast, iGod, Cyber Sermon, or Pod Preacher is a genre of podcast that covers topics related to religious and spiritual beliefs and is often done as a sermon, prayer, or reading of a religious text. The genre encompasses all religions and spiritual beliefs, but the most common religion and spirituality podcast topic is Christianity. The genre was influenced by televangelism and early examples of religion and spirituality podcasts included radio shows by televangelists that had been released in a podcast format.
History
The Vatican began radio broadcasts in 1931 and by 2005 was offering many of those programs as podcasts. Pope Benedict XVI hosted his own podcast in 2005.
In the United States of America, "Godcast" is a registered trademark of Craig Patchett, founder of The Godcast Network. Patchett's Godcast Network provides a platform for a number of podcasts including his daughter's show "Rachel's Choice."
Religion and spirituality podcasts are used as an alternative for attending live sermons or church services and are more easily accessible for people with busy schedules. Podcasting makes it easier for a pastor to connect with their congregation than having an individual conversations with each parishioner. They are also used for evangelizing and proselytizing to larger audiences through an alternative medium that can be easily accessed from around the world—leading to pastors having listenership from every continent and numerous countries other than their own. Tania Ralli of The New York Times compared the beginnings of Christian podcasting to the Christian movement that embraced radio and television—now known as Televangelism. Between early July and late August of 2005, religion and spirituality podcasts on Podcast Alley increased from 171 to 474. Reverend Mark Batterson, the host of National Community Church Audio Podcast, compared the impact of podcasting on the church to that of the printing press on the distribution of Bibles. Religion and spirituality podcasting has the same roots in blogs and radio shows that other genres of podcasts have. According to Tania Ralli of The New York Times, Christian podcasts make up the majority of religious and spirituality podcasts available. Reverend Roderick Vonhögen commented on the medium saying that "Podcasting for us has been a resurrection of radio," and "It's the connection to a new generation." Many religion and spirituality podcasts contain daily devotional readings, sermons, daily prayers, and Christian music.
According to Ellen Lee of the Fort Wayne News-Sentinel, "the vast majority [of religion and spirituality podcasts] are Christian-based, but they also include New Age, Jewish and Buddhist podcasts." Charles Arthur of the New Statesman has commented on the trend and it's funding methods to the TV evangelist Billy Graham, who would boldly ask for donations. The Daily Telegraph pointed out that churches typically have difficulty embra
|
https://en.wikipedia.org/wiki/Love%20and%20Rocket
|
"Love and Rocket" is the third episode in the fourth season of the American animated television series Futurama, and the 57th episode of the series overall. It first aired on the Fox network in the United States on February 10, 2002. The episode is a Valentine's Day-themed episode that centers on Bender's relationship with the artificial intelligence of the Planet Express Ship. The subplot involves Fry trying to express his feelings for Leela through the use of Valentine's Day candy. The episode parodies 2001: A Space Odyssey.
Plot
A few days before Valentine's Day, the Planet Express crew tries to land a delivery contract with Romanticorp, a company that produces romantic things. During a tour of the facilities, Fry becomes obsessed with finding the perfect conversation heart to express his feelings for Leela, but she just finds this antic annoying, and says she finds words irrelevant next to the quality of the man saying them. Planet Express gets the contract and with the additional funding, Professor Farnsworth makes some upgrades to the Planet Express Ship. The upgrades include a new personality, complete with a female voice module. Bender and the ship's new personality fall for each other and start dating. Bender quickly grows tired of the ship, and begins cheating on her. The ship, suspicious of Bender, begins acting in an increasingly possessive and erratic manner.
The crew is assigned the task of delivering several tons of conversation hearts to Lrrr as a peace offering. The Omicronians are highly offended by the chalky candies and their saccharine messages. While escaping from the Omicronian death fleet, Bender decides to break up with the Planet Express Ship. This cracks the ship's fragile mind, and it comes to a stop, allowing the Omicronian missiles to strike.
The ship is sent tumbling through space, dented and scorched, but physically intact. Leela attempts to console the ship, but fails. The ship decides to fly into a quasar so that the power of the ten billion black holes in it will merge her and Bender into a perfect quantum singularity. She offers to stop if Bender merges his programming with hers, but he refuses. To eliminate any interference from Fry or Leela, the ship turns off the oxygen and artificial gravity. They don the on-board oxygen tanks to survive and make plans to disable the ship.
Bender distracts the ship by taking her up on her earlier proposal to merge their programming, while Leela begins shutting down the ship's brain by popping the tops of its carbonated logic unit. While searching the conversation hearts, Fry notices that Leela's oxygen supply is critically low. He hooks her mask up to his tank to keep her alive. Completely oblivious to this sacrifice, Leela finishes shutting down the ship's artificial intelligence, returning every system to normal. She then finds Fry unresponsive due to the lack of oxygen. Leela gives him mouth-to-mouth resuscitation. Fry awakens and coughs up a candy heart with the m
|
https://en.wikipedia.org/wiki/Jon%20Bentley%20%28computer%20scientist%29
|
Jon Louis Bentley (born February 20, 1953) is an American computer scientist who is credited with the heuristic-based partitioning algorithm k-d tree.
Education and career
Bentley received a B.S. in mathematical sciences from Stanford University in 1974, and M.S. and PhD in 1976 from the University of North Carolina at Chapel Hill; while a student, he also held internships at the Xerox Palo Alto Research Center and Stanford Linear Accelerator Center. After receiving his Ph.D., he joined the faculty at Carnegie Mellon University as an assistant professor of computer science and mathematics. At CMU, his students included Brian Reid, John Ousterhout, Jeff Eppinger, Joshua Bloch, and James Gosling, and he was one of Charles Leiserson's advisors. Later, Bentley moved to Bell Laboratories, where he co-authored an optimized Quicksort algorithm with Doug McIlroy.
He found an optimal solution for the two dimensional case of Klee's measure problem: given a set of n rectangles, find the area of their union. He and Thomas Ottmann invented the Bentley–Ottmann algorithm, an efficient algorithm for finding all intersecting pairs among a collection of line segments. He wrote the Programming Pearls column for the Communications of the ACM magazine, and later collected the articles into two books of the same name.
Bentley received the Dr. Dobb's Excellence in Programming award in 2004.
Bibliography
Programming Pearls (2nd edition), .
More Programming Pearls: Confessions of a Coder, .
Writing Efficient Programs, .
Divide and Conquer Algorithms for Closest Point Problems in Multidimensional Space, Ph.D. thesis.
References
External links
www.cs.bell-labs.com/cm/cs/pearls/code.html on GitHub
Lucent Technologies press release
bug in Jon Bentley's binary search - google research
The C Programming Language, both editions had shown the solution to the bug discussed in the above. In the second edition, it is in section 6.4 (Pointers to Structures).
1953 births
Living people
American computer scientists
American computer programmers
Researchers in geometric algorithms
Carnegie Mellon University faculty
Stanford University School of Humanities and Sciences alumni
University of North Carolina at Chapel Hill alumni
People from Long Beach, California
|
https://en.wikipedia.org/wiki/NIPR
|
NIPR as an acronym may refer to:
NIPRNet, the Non-Classified Internet Protocol Router Network, a private IP network owned by the United States Department of Defense that is used to exchange unclassified information
National Institute of Polar Research (Japan), the Japanese research institute for Antarctica
Northern Ireland Publication Resource, now renamed NIPR: the National Collection of Northern Ireland Publications, held at the Linen Hall Library
|
https://en.wikipedia.org/wiki/Concepts%2C%20Techniques%2C%20and%20Models%20of%20Computer%20Programming
|
Concepts, Techniques, and Models of Computer Programming is a textbook published in 2004 about general computer programming concepts from MIT Press written by Université catholique de Louvain professor Peter Van Roy and Royal Institute of Technology, Sweden professor Seif Haridi.
Using a carefully selected progression of subsets of the Oz programming language, the book explains the most important programming concepts, techniques, and models (paradigms).
Translations of this book have been published in French (by Dunod Éditeur, 2007), Japanese (by Shoeisha, 2007) and Polish (by Helion, 2005).
External links
Official CTM site, with supplementary material
Yves Deville et al. review
CTM wiki
2004 non-fiction books
Computer_programming_books
Computer science books
MIT Press books
|
https://en.wikipedia.org/wiki/Cdrtools
|
cdrtools (formerly known as cdrecord) is a collection of independent projects of free software/open source computer programs.
The project was maintained for over two decades by Jörg Schilling, who died on October 10, 2021.
Because of some licensing issues, there is also a Debian fork of an older version of cdrtools called cdrkit.
Features
The most important parts of the package are cdrecord, a console-based burning program; cdda2wav, a CD audio ripper that uses libparanoia; and mkisofs, a CD/DVD/BD/UDF/HFS filesystem image creator. As these tools do not include any GUI, many graphical front-ends have been created.
The collection includes many features for CD, DVD and Blu-ray disc writing such as:
creation of audio, data, and mixed (audio and data) CDs
burning CD-R, CD-RW, DVD-R, DVD-RW, DVD+R, DVD+RW, dual layer DVDs, and Blu-ray Discs
support for Track-At-Once and Disc-At-Once recording modes
cue sheet file format support, with Exact Audio Copy enhancements
support for non-standard vendor specific drive features.
Normal user can use cdrtools with Solaris fine grained privileges or similar Linux capabilities.
History
Origins and name change
The first releases of cdrtools were called cdrecord because they only included the cdrecord tool and a few companion tools, but not mkisofs nor cdda2wav. A copy of mkisofs, created in 1993 by Eric Youngdale for Yggdrasil Linux, was incorporated in 1997. In 1998, a copy of an experimental version of cdda2wav, created by Heiko Eißfeldt was included in the cdrecord package.
In 1999 the project started to be called cdrtools to better reflect the fact that it had become a collection of tools.
DVD and Blu-ray disc writing support
DVD writing support (cdrecord-ProDVD) in cdrecord started in early 1998, at the request of the data archivists of the European Southern Observatory. But since the relevant information required a non-disclosure agreement and DVD writers were not publicly available, it was not included in the source code.
In 2002, Jörg Schilling started offering free license keys to the closed-source variant cdrecord-ProDVD for educational, and research use, shortly thereafter also for private use. Unregistered free licenses were initially limited to single-speed writing and would expire every year. On 15 May 2006, support for DVD writing was added to the open-source version 2.01.01a09 after switching the license to CDDL; thereby removing the need to get a license key. Blu-ray disc support was added starting 2007.
The lack of open-source DVD writing support in 2001 led to heated discussions on the mailing lists, and to a number of unofficial patches for supporting the Pioneer DVD-R A03, the first DVD writer to reach mass market, and forks of cdrecord: Mandrake shipped a version called cdrecord-dvdhack, whereas Redhat had dvdrecord.
Hardware access controversy
Unlike cdrkit and libburnia, which use device files to access the hardware, cdrtools uses a different method known as CAM (for Com
|
https://en.wikipedia.org/wiki/XML%20appliance
|
An XML appliance is a special-purpose network device used to secure, manage and mediate XML traffic. They are most popularly implemented in service-oriented architectures (SOA) to control XML-based web services traffic, and increasingly in cloud-oriented computing to help enterprises integrate on premises applications with off-premises cloud-hosted applications. XML appliances are also commonly referred to as SOA appliances, SOA gateways, XML gateways, and cloud brokers. Some have also been deployed for more specific applications like Message-oriented middleware. While the originators of the product category deployed exclusively as hardware, today most XML appliances are also available as software gateways and virtual appliances for environments like VMWare.
History of XML appliances
The first XML appliances were created by DataPower and Vordel in 1999, Sarvega in 2000, Forum Systems in 2001, Managed Methods in 2005 and Layer 7 Technologies in 2002. Early vendors like DataPower focused on the XML acceleration problem which they solved through specialized hardware. While several vendors like DataPower (purchased by IBM in 2005) and Layer 7 Technologies continue to offer hardware accelerated options for high performance situations, advances in computing speed has made software or vmware based "appliances" practical in many common customer situations. Early use cases for XML appliances included banking and cross-agency government information sharing. Today XML appliances are widely used across finance, telecommunications, government, energy, logistics commensurate with the growing usage of XML as a cross-division and cross-company data exchange protocol.
In 2005, XML appliances (or SOA appliances, as they came to be known) became increasingly associated with service-oriented architectures and more specifically the problem of governing SOA. The governance of SOA comes down to the control of how applications delivered as "services" can be shared with or called by other applications. Appliances became a popular way of controlling or governing SOA because addressed message security, availability and translation of data so that an application can call another application irrespective of the data format and security policies. Governance of SOA became so critical that Gartner published a dedicated Integrated SOA Governance Technology Sets Magic Quadrant on the topic that covered both SOA management and SOA appliances in March 2007 and most recently in March 2009.
Use cases of XML appliances
High-speed transformation and processing of XML traffic
Security and governance of service-oriented architectures or SOA
Control of web application APIs that are commonly today exposed as XML-based REST interfaces
Integration of enterprise applications to services hosted in the cloud
Common features of XML appliances
They can parse, validate, transform and route XML messages via XPath and XSLT
They can control access to applications that expose data and funct
|
https://en.wikipedia.org/wiki/Linesman/Mediator
|
Linesman/Mediator was a dual-purpose civil and military radar network in the United Kingdom between the 1960s and 1984. The military side (Linesman) was replaced by the Improved United Kingdom Air Defence Ground Environment (IUKADGE), while the civilian side (Mediator) became the modern public-private National Air Traffic Services (NATS).
In the 1950s, the Royal Air Force was installing a radar network known as ROTOR using war-era radars like Chain Home along with new command centres. A new radar, the AMES Type 80, replaced all of the ROTOR radars and command centres with a series of nine Master Control Radars and a number of associated secondary radars. While these installations were in progress in the early 1950s, CSF introduced the carcinotron, which could output a radio signal at any desired frequency. This made it a very effective jamming system, and it appeared to render ground-based radars like Type 80 useless.
Considering several possible solutions, the RAF selected an experimental radar known as Blue Yeoman, but later known as the AMES Type 85. This radar changed its frequency with every pulse, making it impossible for carcinotron operators to know what frequency to jam. The RAF initially proposed an extensive network similar to the Type 80s, known as the "1958 Plan". This was abandoned in the aftermath of the 1957 Defence White Paper, which saw the threat to be moving from bombers to ballistic missiles, and argued the system should be cancelled. In late 1958, a much smaller system with only three main radars and a single control centre became "Plan Ahead", with its primary purpose being to provide air cover and anti-jamming support for a new anti-missile BMEWS radar.
During this same period, civilian air traffic was increasing dramatically and led to the 1962 formation of the National Air Traffic Control Services organization to handle national-scale air traffic control (ATC). Given enemy aircraft might hide among civilian ones, it was seen that combining data from Plan Ahead and the ATC system would have many advantages. Plan Ahead became Linesman and the ATC system Mediator. The centres would share locations in West Drayton, just north of Heathrow, Glasgow Prestwick Airport, and Mediator planned a third site in Preston, Lancashire. Ultimately all three Mediator sites were built, while only "L1" at West Drayton was ever completed as part of Linesman.
Whilst Mediator proceeded relatively smoothly, construction of Linesman was greatly delayed and it was not fully operational until March 1974. By that time the strategic threat had changed dramatically, and air strikes on the UK once again became a possibility. Linesman's single centralized L1 command centre was vulnerable, and the sea-side radars even more so. Money set aside to improve Linesman was instead directed to building its replacement, UKADGE. UKADGE was further expanded with Marconi Martello and the Type 85s stood down in the 1990s.
History
ROTOR
As the threat of German a
|
https://en.wikipedia.org/wiki/Bouncy%20Castle%20%28cryptography%29
|
Bouncy Castle is a collection of APIs used in cryptography. It includes APIs for both the Java and the C# programming languages. The APIs are supported by a registered Australian charitable organization: Legion of the Bouncy Castle Inc.
Bouncy Castle is Australian in origin and therefore American restrictions on the export of cryptography from the United States do not apply to it.
History
Bouncy Castle started when two colleagues were tired of having to re-invent a set of cryptography libraries each time they changed jobs working in server-side Java SE. One of the developers was active in Java ME (J2ME at that time) development as a hobby and a design consideration was to include the greatest range of Java VMs for the library, including those on J2ME. This design consideration led to the architecture that exists in Bouncy Castle.
The project, founded in May 2000, was originally written in Java only, but added a C# API in 2004. The original Java API consisted of approximately 27,000 lines of code, including test code and provided support for J2ME, a JCE/JCA provider, and basic X.509 certificate generation. In comparison, the 1.53 release consists of 390,640 lines of code, including test code. It supports the same functionality as the original release with a larger number of algorithms, plus PKCS#10, PKCS#12, CMS, S/MIME, OpenPGP, DTLS, TLS, OCSP, TSP, CMP, CRMF, DVCS, DANE, EST and Attribute Certificates. The C# API is around 145,000 lines of code and supports most of what the Java API does.
Some key properties of the project are:
Strong emphasis on standards compliance and adaptability.
Public support facilities include an issue tracker, dev mailing list and a wiki all available at the website.
Commercial support provided under resources for the relevant API listed on the Bouncy Castle website
On 18 October 2013, a not-for-profit association, the Legion of the Bouncy Castle Inc. was established in the state of Victoria, Australia, by the core developers and others to take ownership of the project and support the ongoing development of the APIs. The association was recognised as an Australian charity with a purpose of advancement in education and a purpose that is beneficial to the community by the Australian Charities and Not-For-Profits Commission on 7 November 2013. The association was authorised to fundraise to support its purposes on 29 November 2013 by Consumer Affairs Victoria.
Architecture
The Bouncy Castle architecture consists of two main components that support the base cryptographic capabilities. These are known as the 'light-weight' API, and the Java Cryptography Extension (JCE) provider. Further components built upon the JCE provider support additional functionality, such as PGP support, S/MIME, etc.
The low-level, or 'light-weight', API is a set of APIs that implement all the underlying cryptographic algorithms. The APIs were designed to be simple enough to use if needed, but provided the basic building blocks for the J
|
https://en.wikipedia.org/wiki/Integration%20appliance
|
An integration appliance is a computer system specifically designed to lower the cost of integrating computer systems. Most integration appliances send or receive electronic messages from other computers that are exchanging electronic documents. Most Integration Appliances support XML messaging standards such as SOAP and Web services are frequently referred to as XML appliances and perform functions that can be grouped together as XML-Enabled Networking.
Vendors providing integration appliances
DataPower XI50 and IBM MQ Appliance — IBM
Intel SOA Products Division
Premier, Inc.
References
Networking hardware
Computer systems
|
https://en.wikipedia.org/wiki/Mork%20%28file%20format%29
|
Mork is a computer file format used by several email clients and web browsers produced by Netscape, and later, Mozilla Foundation. It was developed by David McCusker with the aim of creating a minimal database replacement that would be reliable, flexible, and efficient, and use a file format close to plain text.
The format was named after the character Mork from the TV show Mork & Mindy.
Usage
The Mork format was used in most Mozilla-based projects, including the Mozilla browser suite, SeaMonkey, Firefox, and Thunderbird. In Firefox, it was used for browsing history data and form history data. In Thunderbird, it is still used for many things, such as address book data (.mab files) and the mail folder summaries (.msf files).
Criticisms
Mork has many suboptimal properties. For example, despite the aim of efficiency, storing Unicode text takes three or six bytes per character.
The file format has been severely criticized by Jamie Zawinski, a former Netscape engineer. He has lambasted the ostensibly "textual" format on the grounds that it is "not human-readable", bemoaned the impossibility of writing a correct parser for the format, and referred to it as "...the single most braindamaged file format that I have ever seen in my nineteen year career".
In response, McCusker stated that the problems with Mork resulted from "conflicting requirements" and that he merely fixed scalability issues in bad code he "inherited".
The Register lambasted the Mork database with their article "Why has Thunderbird turned into a turkey?"
Obsolescence
The replacement system, used for storing all user configuration data, is called MozStorage. MozStorage is based on the SQLite database. Beginning with Firefox 3.0, Firefox uses it for its history, form history and bookmark data. The storage engine was also included in Firefox 2.0, but only for use with extensions.
Mork was completely removed from Firefox in 2011.
Plans existed for Mork to be replaced with MozStorage in Thunderbird 3.0., but as of 2023 still used the Mork file format. As of 2012, SeaMonkey used Mork for at least its POP and IMAP mail folders indexes.
Software that handles Mork files
The original Mozilla MorkReader (CPP)
Mozilla-Mork (Perl)
mork-converter (Python)
See also
Berkeley DB
References
External links
McCusker's description of the syntax
Grammar as mentioned in the above syntax description
Mork structure
Mozilla Wiki Mork page (including links to tools for reading Mork documents)
Computer file formats
Mozilla
|
https://en.wikipedia.org/wiki/Frontpage%3A%20Ulat%20ni%20Mel%20Tiangco
|
Frontpage: Mel Tiangco () is a Philippine television news broadcasting show broadcast by GMA Network. Anchored by Mel Tiangco, it premiered on August 23, 1999, on the network's evening line up replacing GMA Network News. The show concluded on March 12, 2004. It was replaced by 24 Oras in its timeslot.
Overview
Frontpage: Ulat ni Mel Tiangco premiered on August 23, 1999, replacing the weekday edition of GMA Network News. The newscast delivered local and international news, from politics to entertainment.
Broadcasting in the GMA EDSA TV Complex studio using green screen technology, news delivery in stand-up, and runs in 45 minutes. It received numerous awards from PMPC Star Awards for TV and Catholic Mass Media Award's Best News Program Award. She was also chosen by the PMPC Star Awards for Television as their choice for Best Female Newscaster. She was also notable for philosophy works of GMA Foundation thru Bisig-Bayan. Several substitute anchors are Arnold Clavio, Daniel Razon and Rhea Santos. It introduced its new segments such as GMA Action Force by Candice Giron & Good News. Rhea Santos was chosen as the new segment host for GMA Action Force replacing Giron, Love Añover on Buenas Balita... And Everything which later became Kuwento Dito, Kuwento Doon, and TJ Manotoc on the newscast's new showbiz segment Starwatch; Santos, Añover, and Manotoc were hosts from Unang Hirit.
On October 18, 2003, a special edition of the program was aired in time for the network's coverage of then-U.S. President George W. Bush's state visit in the country. The edition was anchored with Jessica Soho and Mike Enriquez.
On March 12, 2004, Frontpage aired its last broadcast to make way for the network's new early-evening newscast 24 Oras.
Anchors
Mel Tiangco
Rhea Santos
Candice Giron
TJ Manotoc
Love Añover
References
1999 Philippine television series debuts
2004 Philippine television series endings
Filipino-language television shows
Flagship evening news shows
GMA Network news shows
GMA Integrated News and Public Affairs shows
Philippine television news shows
|
https://en.wikipedia.org/wiki/Ilfak%20Guilfanov
|
Ilfak Guilfanov (, born 1966) is a software developer, computer security researcher and blogger. He became well known when he issued a free hotfix for the Windows Metafile vulnerability on 31 December 2005. His unofficial patch was favorably reviewed and widely publicized because no official patch was initially available from Microsoft. Microsoft released an official patch on 5 January 2006.
Guilfanov was born in a small village in the Tatarstan Region of Russia in a Volga Tatar family. He graduated from Moscow State University in 1987 with a Bachelor of Science in Mathematics. He lives in Liège, Belgium and works for Hex-Rays. He is the systems architect and main developer for IDA Pro, which is Hex-Rays' commercial version of the Interactive Disassembler Guilfanov created. A freeware version of this reverse engineering tool is also available.
References
External links
http://www.hex-rays.com
Interview on CNET
1966 births
Living people
Russian computer programmers
Moscow State University alumni
Computer security specialists
|
https://en.wikipedia.org/wiki/Wataru%20Sakata
|
is a Japanese retired mixed martial artist and professional wrestler. A professional MMA competitor from 1994 until 2016, Sakata fought for Fighting Network RINGS, Pride FC, Deep and Rizin Fighting Federation, and holds notable victories over RINGS King of Kings 2000 Tournament runner up Valentijn Overeem, UFC 23 Middleweight Tournament winner Kenichi Yamamoto, ADCC bronze medallist and RINGS Light Heavyweight title contender Chris Haseman, and NCAA All-American and UFC veteran Branden Lee Hinkle.
Career
A former Kyokushin karateka, Sakata trained in professional wrestling at Animal Hamaguchi's gym and joined Akira Maeda's Fighting Network RINGS immediately after, training in shoot wrestling.
Fighting Network RINGS
Sakata debuted in RINGS in 1994 against Nobuhiro Tsurumaki. Making the transition to mixed martial arts before most of his native colleagues, he started to take part in shootfights the same year of his debut.
Over the years, Sakata would develop a rivalry with Willie Peeters in a long series of shootfighting bouts. Peeters defeated Wataru by TKO on their first fight On November 16, 1995, and they went to fight a rematch on June 29, 1996. During the latter, Sakata broke late a toehold and injured Peeters, who retaliated by illegally knocking him out with a close-fisted punch. Although the act gave Peeters a red card, he would win by KO due palm strikes. The two met again on August 24, where Sakata was dominated in a grappling contest and defeated by north/south choke.
Sakata would face Peeters again under different rules in a RINGS Holland event on February 8, 1998, but although he performed dominantly for the first time, he lost a controversial decision, as the Dutch referee invalidated a finishing hold by Sakata while allowing Peeters to throw illegal strikes. Wataru finally got his revenge on June 27, making Peeters tap out in under a minute by ankle lock. Around this time, Sakata would also get important submissions wins over Valentijn Overeem.
In 1999, Sakata participated at the King of Kings MMA tournament, but he was eliminated at the first round by Renzo Gracie, with the Brazilian taking him down and submitting him. Upon returning from the tournament, he faced Branden Lee Hinkle in a more successful match: the two fighters exchanged armbars before Hinkle got the mount, but Sakata countered with his teammate Tsuyoshi Kohsaka's "TK scissors" reversal and locked a leglock that broke Hinkle's knee for the win.
The next year, Sakata would face Pancrase fighter Ryushi Yanagisawa, a natural heavyweight, in a special match. Sakata lost an uneventful decision.
Sakata also had part in a controversial moment in RINGS history when he was legitimately attacked by Akira Maeda in front of the cameras, due to Maeda being unsatisfied with Wataru's performance earlier in the event.
Pro Wrestling Zero-One
When RINGS collapsed in 2002, Sakata participated in PRIDE Fighting Championships fights and joined Pro Wrestling Zero-One as a freelanc
|
https://en.wikipedia.org/wiki/Franz%20Baader
|
Franz Baader (15 June 1959, Spalt) is a German computer scientist at Dresden University of Technology.
He received his PhD in Computer Science in 1989 from the University of Erlangen-Nuremberg, Germany, where he was a teaching and research assistant for 4 years.
In 1989, he went to the German Research Centre for Artificial Intelligence (DFKI) as a senior researcher and project leader.
In 1993 he became associate professor for computer science at RWTH Aachen, and in 2002 full professor for computer science at TU Dresden.
He received the Herbrand Award for the year 2020 "in recognition of his significant contributions to unification theory, combinations of theories and reasoning in description logics".
Works
References
German computer scientists
Living people
1959 births
People from Roth (district)
|
https://en.wikipedia.org/wiki/Wansbeck%20Road%20Metro%20station
|
Wansbeck Road is a Tyne and Wear Metro station, serving the suburbs of Coxlodge and Gosforth, Newcastle upon Tyne in Tyne and Wear, England. It joined the network on 10 May 1981, following the opening of the second phase of the network, between South Gosforth and Bank Foot.
History
On 1 March 1905, the line between South Gosforth and Ponteland was opened by the Gosforth and Ponteland Light Railway, with passenger services commencing three months later. Eight years later, the line was extended to Darras Hall, with passenger services commencing on 1 October 1913.
Wansbeck Road is situated between the former Coxlodge and West Gosforth stations. The line closed to passengers in June 1929, with Coxlodge and West Gosforth stations closing to goods in November 1965 and August 1967 respectively.
Wansbeck Road is built on an embankment above Wansbeck Road, with platforms located on opposite sides of the road. A second concrete span was added to the original single-track bridge in the late 1970s, during the construction of the Tyne and Wear Metro. The restricted working areas and it being built on an embankment made it one of the more challenging stations to construct on the Metro system at the time.
Refurbishment
In 2018, the station, along with others on the branch between South Gosforth and Newcastle Airport, were refurbished. The £300,000 project saw improvements to accessibility, security and energy efficiency, as well as the rebranding of the station to the new black and white corporate colour scheme.
Facilities
The station has two platforms, both of which have ticket machines (which accept cash, card and contactless payment), smartcard validators, sheltered waiting area, seating, next train audio and visual displays, timetable and information posters and an emergency help point. There is step-free access to both platforms by ramp, with platforms also accessed by stairs. There is cycle storage at the station, with three cycle pods.
Services
, the station is served by up to five trains per hour on weekdays and Saturday, and up to four trains per hour during the evening and on Sunday between South Hylton and Newcastle Airport.
Rolling stock used: Class 599 Metrocar
Notes
References
Sources
External links
Timetable and station information for Wansbeck Road
Newcastle upon Tyne
1981 establishments in England
Railway stations in Great Britain opened in 1981
Tyne and Wear Metro Green line stations
Transport in Newcastle upon Tyne
Transport in Tyne and Wear
|
https://en.wikipedia.org/wiki/Callerton%20Parkway%20Metro%20station
|
Callerton Parkway is a Tyne and Wear Metro station, serving the hamlet of Black Callerton and suburb of Woolsington, Newcastle upon Tyne in Tyne and Wear, England. It joined the network on 17 November 1991, following the opening of the extension from Bank Foot to Newcastle Airport.
History
The majority of the route was already in place, with the alignment having been formerly served by the Ponteland Railway. The Airport branch only required the construction of a short distance (around 0.2 miles) of new right-of-way.
Callerton Parkway is situated close to the site of the former Callerton station, which was located to the north west of the level crossing on Callerton Lane. The station opened to passengers in June 1905, consisting of a single platform, simple pitched roof station building, and a signal box. The line closed to passengers in June 1929, with goods services operating until November 1965.
Refurbishment
In 2018, the station, along with others on the branch between South Gosforth and Newcastle Airport, were refurbished. The £300,000 project saw improvements to accessibility, security and energy efficiency, as well as the rebranding of the station to the new black and white corporate colour scheme.
Facilities
The station has two platforms, both of which have ticket machines (which accept cash, card and contactless payment), smartcard validators, sheltered waiting area, seating, next train audio and visual displays, timetable and information posters and an emergency help point. There is step-free access to both platforms. The station serves as a park and ride, with 189 spaces (plus seven accessible spaces). There is also cycle storage at the station, with four cycle lockers and five cycle pods.
Services
, the station is served by up to five trains per hour on weekdays and Saturday, and up to four trains per hour during the evening and on Sunday between South Hylton and Newcastle Airport.
Rolling stock used: Class 599 Metrocar
Accidents and incidents
In 2008, traffic enforcement cameras were installed at the station's level crossing – this having been the location of over half of the road traffic incidents at the five Metro-owned level crossings on the network. Similar cameras were installed at nearby Bank Foot and Kingston Park in October 2012.
Notes
References
External links
Timetable and station information for Callerton Parkway
Newcastle upon Tyne
1991 establishments in England
Railway stations in Great Britain opened in 1991
Tyne and Wear Metro Green line stations
Transport in Newcastle upon Tyne
Transport in Tyne and Wear
|
https://en.wikipedia.org/wiki/Phosphorus%20trichloride%20%28data%20page%29
|
This page provides supplementary chemical data on phosphorus trichloride.
Material Safety Data Sheet
The handling of this chemical may incur notable safety precautions. It is highly recommend that you seek the Material Safety Datasheet (MSDS) for this chemical from a reliable source such as SIRI, and follow its directions.
Aldrich MSDS
Baker MSDS
Fisher MSDS
Structure and properties
Thermodynamic properties
Spectral data
References
Chemical data pages
Chemical data pages cleanup
|
https://en.wikipedia.org/wiki/West%20Monkseaton%20Metro%20station
|
West Monkseaton is a Tyne and Wear Metro station, serving the village of Earsdon and suburb of Monkseaton, North Tyneside in Tyne and Wear, England. It joined the network on 11 August 1980, following the opening of the first phase of the network, between Haymarket and Tynemouth via Four Lane Ends.
History
Monkseaton had been served by a station since 1864. However, the development of new housing in the area adjoining the line led the London and North Eastern Railway to construct an additional station, about west along the line from the station at Monkseaton.
The station opened in March 1933, as part of the London and North Eastern Railway, with the station building constructed in Art Deco style. The station's platforms took just a month to build after plans were approved.
The reinforced concrete Art Deco station building is attributed to the London and North Eastern Railway architect, H. H. Powell. Work on the station building, however, did not begin until 1934. Staircases and ramps led down from this building to two timber platforms, both of which featured waiting rooms. The westbound platform featured a concrete canopy, which was added by the London and North Eastern Railway, following the construction of the waiting rooms.
Prior to the station's closure for conversion in the late 1970s, the station generally received a service every 20 minutes in both directions, on the Coast Circle route. The service from West Monkseaton to Newcastle via South Gosforth was removed in January 1978, in order to facilitate conversion work on the stations to the west. This meant that the station was briefly a terminus for trains from Newcastle via Tynemouth, with trains reversing using a crossover to the west of the station.
The station closed for conversion in September 1979, ahead of opening as part of the Tyne and Wear Metro network, re-opening in August 1980. Conversion work saw the loss of the wooden station buildings at platform level, as well as the replacement of the timber platforms with shorter concrete ones. The canopy on the westbound platform (trains towards St. James) was retained, while a smaller canopy in a similar style was added to the eastbound platform (trains towards South Shields).
The original street-level entrance building remains, and was refurbished in 1999, along with the original London and North Eastern Railway platform canopy. As part of this refurbishment, an art installation by Richard Talbot, Bridge, was commissioned. It features a number of coloured stained glass windows, and is located in the station's ticket hall, overlooking the track and platforms.
West Monkseaton was recently refurbished, along with Cullercoats and Monkseaton, in 2018, as part of the Metro: All Change programme. The refurbishment involved the installation of new seating and lighting, resurfaced platforms, and improved security and accessibility. The station was also painted in to the new black and white corporate colour scheme.
Facilities
Step-free
|
https://en.wikipedia.org/wiki/Phosphorus%20trifluoride%20%28data%20page%29
|
This page provides supplementary chemical data on phosphorus trifluoride.
Material Safety Data Sheet
Structure and properties
Thermodynamic properties
Spectral data
References
Chemical data pages
Chemical data pages cleanup
|
https://en.wikipedia.org/wiki/Bart%20Carny
|
"Bart Carny" is the twelfth episode of the ninth season of the American animated television series, The Simpsons. It originally aired on the Fox network in the United States on January 11, 1998. Homer and Bart start working at a carnival and befriend a father and son duo named Cooder and Spud. It was written by John Swartzwelder, directed by Mark Kirkland and guest stars Jim Varney as Cooder the carny. The episode contains several cultural references and received a generally mixed critical reception.
Plot
When Marge unsuccessfully tries to get the kids to clean up the backyard, Homer runs into the house to exclaim to the family that the carnival is in town. After trying some rides, Bart gets himself into trouble by crashing a display of Hitler's limousine into a tree. To repay the loss, Bart and Homer become carnies.
They meet up with carnies Cooder and his son, Spud. Cooder asks Homer to run his fixed ring toss game, but Homer fails to bribe Chief Wiggum (despite numerous hints), and Cooder's game is shut down. Feeling guilty, Homer invites Cooder and Spud to stay at the Simpson residence, much to Marge's dismay.
To express their gratitude, the Cooders give the Simpsons tickets on a glass-bottom boat ride. When the Simpsons return, they find that the locks have been changed, the windows are all boarded up, and the Simpsons' name is crossed off the mailbox and replaced by "The Cooders". The family is forced to take up residence in Bart's treehouse. After the Simpsons go to the police in order to evict the Cooders from their house, Chief Wiggum refuses to act, still aggrieved over not receiving a bribe.
Homer proposes to Cooder, that if he can throw a hula-hoop onto the chimney, they get their house back. If he misses, he will sign the deed over to Cooder. Cooder agrees and steps onto the lawn to watch Homer's attempt. Homer stretches and warms up, as if about to throw, but instead, he and his family suddenly rush into the house, leaving Cooder and Spud dumbfounded, but also impressed that they were "beaten by the best". After Homer initially gloats at them from inside, he begins to feel sorry for them again, and considers bringing them back in. At the urging of a nervous Bart, Marge then distracts Homer by pointing out a special "ass groove" that he sits on the couch in, and the episode ends with his attempt to try and fix it after they had ruined it by sitting on it themselves.
Production
The carnival in this episode is based on The Eastern States Exposition (currently known as The Big E) fair. As a child, Mike Scully went to the fair, and had hoped one day to be a carny. This is the only episode that Mark Kirkland told his parents not to watch. This is due to Bart's line "Out of my way, I'm Hitler". Kirkland's stepfather was a lieutenant in World War II and was injured while in combat. Cooder was modeled after David Mirkin, the showrunner of seasons five and six and co-writer and the executive producer of two episodes in the ninth season.
|
https://en.wikipedia.org/wiki/Toad%20%28software%29
|
Toad is a database management toolset from Quest Software for managing relational and non-relational databases using SQL aimed at database developers, database administrators, and data analysts. The Toad toolset runs against Oracle, SQL Server, IBM DB2 (LUW & z/OS), SAP and MySQL. A Toad product for data preparation supports many data platforms.
History
A practicing Oracle DBA, Jim McDaniel, designed Toad for his own use in the mid-1990s. He called it Tool for Oracle Application Developers, shortened to "TOAD". McDaniel initially distributed the tool as shareware and later online as freeware.
Quest Software acquired TOAD in October 1998. Quest Software itself was acquired by Dell in 2012 to form Dell Software. In June 2016, Dell announced the sale of their software division, including the Quest business, to Francisco Partners and Elliott Management Corporation. On October 31, 2016, the sale was finalized. On November 1, 2016, the sale of Dell Software to Francisco Partners and Elliott Management was completed, and the company re-launched as Quest Software.
Features
Connection Manager - Allow users to connect natively to the vendor’s database whether on-premise or DBaaS.
Browser - Allow users to browse all the different database/schema objects and their properties effective management.
Editor - A way to create and maintain scripts and database code with debugging and integration with source control.
Unit Testing (Oracle) - Ensures code is functionally tested before it is released into production.
Static code review (Oracle) - Ensures code meets required quality level using a rules-based system.
SQL Optimization - Provides developers with a way to tune and optimize SQL statements and database code without relying on a DBA. Advanced optimization enables DBAs to tune SQL effectively in production.
Scalability testing and database workload replay - Ensures that database code and SQL will scale properly before it gets released into production.
Books
Toad Pocket Reference for Oracle plsql 1st Edition by Jim McDaniel and Patrick McGrath, O'Reilly, 2002 (, )
Toad Pocket Reference for Oracle 2nd Edition by Jeff Smith, Bert Scalzo, and Patrick McGrath, O'Reilly, 2005 (, )
TOAD Handbook by Bert Scalzo and Dan Hotka, Sams, 2003 (, )
TOAD Handbook 2nd Edition by Bert Scalzo and Dan Hotka, Addison-Wesley Professional, 2009 (, ).
See also
Comparison of database tools
References
External links
Official Toad User Community
Quest Software Toad company website
Programming tools
Integrated development environments
Desktop database application development tools
Database administration tools
PL/SQL editors
Oracle database tools
Microsoft database software
Sybase
MySQL
|
https://en.wikipedia.org/wiki/Theoretical%20sampling
|
Theoretical sampling is a process of data collection for generating theory whereby the analyst jointly collects codes and analyses data and decides what data to collect next and where to find them, in order to develop a theory as it emerges. The initial stage of data collection depends largely on a general subject or problem area, which is based on the analyst's general perspective of the subject area. The initial decisions are not based on a preconceived theoretical framework. The researcher begins by identifying some key concepts and features which they will research about. This gives a foundation for the research. A researcher must be theoretically sensitive so that a theory can be conceptualized and formulated as it emerges from the data being collected. Caution must be taken so as to not limit oneself to specific aspects of a theory; this will make a researcher blind towards other concepts and aspects of the theory. The main question in this method of sampling is this: what groups should the researcher turn to next in the data collection process, and why?
History of theoretical sampling
According to Chenitz and Swanson (1986), theoretical sampling emerged with the foundation of grounded theory, which was first developed by Glaser and Strauss in 1967. Grounded theory can be described as a research approach for the collection and analysis of qualitative data for the purpose of generating explanatory theory, in order to understand various social and psychological phenomena. Its focus is to develop a theory from continuous comparative analysis of data collected by theoretical sampling.
Advantages and disadvantages
The main advantage of theoretical sampling is that it strengthens the rigour of the study if the study attempts to generate the theory in the research area. The application of theoretical sampling provides a structure to data collection as well as data analysis. It is based on the need to collect more data to examine categories and their relationships and assures that representativeness exists in the category. Theoretical sampling has inductive as well as deductive characteristics. It is very flexible as the researcher can make shifts in plans and emphasize early in the research process so that the data gathered reflects what is occurring in the field.
Certain disadvantages may be associated with this sampling method. It is a highly systematic method due to which application of theoretical sampling requires more resources like time and money as compared to other sampling methods. It is a very complicated method and not easy to understand. To achieve depth in developing the categories researcher proceeds to another location to increase breadth in the category which sounds very complex and indeed is not helpful for the novice and may be problematic.
Key features
While discussing theoretical sampling, there are three features that must be considered:
1. Choosing cases in terms of the theory
In this feature, the basis is construct
|
https://en.wikipedia.org/wiki/Diseases%20Database
|
The Diseases Database is a free website that provides information about the relationships between medical conditions, symptoms, and medications. The database is run by Medical Object Oriented Software Enterprises Ltd, a company based in London.
The site's stated aim is "education, background reading and general interest" with an intended audience "physicians, other clinical healthcare workers and students of these professions". The editor of the site is stated as Malcolm H Duncan, a UK qualified medical doctor.
Organization
The Diseases Database is based on a collection of about 8,500 concepts, called "items", related to human medicine including diseases, drugs, symptoms, physical signs and abnormal laboratory results.
In order to link items to both each other and external information resources three sets of metadata are modelled within the database.
Items are assigned various relationships e.g. diabetes mellitus type 2 is labelled "a risk factor for" ischaemic heart disease. More formally the database employs an entity-attribute-value model with items populating both entity and value slots. Relationships may be read in either direction e.g. the assertion "myocardial infarction {may cause} chest pain" has the corollary "chest pain {may be caused by} myocardial infarction". Such relationships aggregate within the database and allow lists to be retrieved - e.g. a list of items which may cause chest pain, and a list of items which may be caused by myocardial infarction.
Most items are assigned topic specific hyperlinks to Web resources which include Online Mendelian Inheritance in Man, eMedicine and Wikipedia.
Most items are mapped to concepts within the Unified Medical Language System (UMLS). UMLS links enable the display of short text definitions or Medical Subject Heading (MeSH) scope notes for the majority of items on the database.
The UMLS map also enables links to and from other medical classifications and terminologies e.g. ICD-9 and SNOMED.
References
External links
Medical databases in the United Kingdom
Medical literature
|
https://en.wikipedia.org/wiki/Jam%20Session%20%28software%29
|
Jam Session is the 1988 successor to Studio Session, a 1986 software program for Macintosh computers, for music creation and playback. It was created by Macintosh and Newton pioneer Steve Capps and musician Ed Bogas. Jam Session was published by Broderbund Software. Studio Session was published by Bogas Productions.
Overview
Studio Session differed from other audio creation packages as it used 8-bit audio samples of real instruments rather than sounds generated by the Macintosh sound chip, as did packages such as MusicWorks and Deluxe Music Construction Set. It was capable of playing back 6 tracks simultaneously in the original version, updated later to 8. There were two modes or screens, the authoring screen and the playback-only screen. In the authoring screen, the user entered notes on a staff with treble and bass clef using the mouse, and selecting the duration of the note with on-screen buttons or keyboard shortcuts. In the playback screen, an animated simulation of a VU-meter was displayed for each track.
The package shipped with a selection of several sampled instruments and several add-on packages were later released, such as the Heavy Metal Instrument pack that included more drum and guitar samples. Other packs were Country and Brass. The music samples provided were created by Gary Clayton working with Ed Bogas' band. The user was not provided with any software for creating their own instruments for use in Studio Session, however it was possible to record new instruments or convert existing samples using commercially available audio-editing software such as SoundWave from Impulse Inc with the MacNifty Audio Digitzer.
Reception
Compute! called Jam Session "a strange, entrancing thrill", stating that it was harder to use than Instant Music but provided more control. It won the 1987 Software Publishers Association awards for Best Graphics and Best Entertainment Program. The New York Times said "musicians as well as novices can have fun with the program.”
New version
In 1989 Broderbund released a new version of Jam Session for the Macintosh II and SE. Additionally a version of the Apple IIGS computer was released, differing in its utilization of full color graphics for animated performance scenes and 15 voice stereo music. Musical themes featured in this version were Pop Rock, Heavy Metal, Country, Classical Concert Hip-Hop, Rap and Jazz. Users loaded a song from a specific theme and simply "jammed" along using the keyboard to play accompanying instruments, which had the option of being auto-harmonized and auto-timed to match with the musical score playing.
References
External links
Jam Session home page
Super Studio Session home page
Studio Session at the Macintosh Garden
Jam Session at the Macintosh Garden
Short review of Jam Session for the Apple IIGS
Classic Mac OS software
|
https://en.wikipedia.org/wiki/Dynamization
|
In computer science, dynamization is the process of transforming a static data structure into a dynamic one. Although static data structures may provide very good functionality and fast queries, their utility is limited because of their inability to grow/shrink quickly, thus making them inapplicable for the solution of dynamic problems, where the input data changes. Dynamization techniques provide uniform ways of creating dynamic data structures.
Decomposable search problems
We define problem of searching for the predicate match in the set as . Problem is decomposable if the set can be decomposed into subsets and there exists an operation of result unification such that .
Decomposition
Decomposition is a term used in computer science to break static data structures into smaller units of unequal size. The basic principle is the idea that any decimal number can be translated into a representation in any other base. For more details about the topic see Decomposition (computer science). For simplicity, binary system will be used in this article but any other base (as well as other possibilities such as Fibonacci numbers) can also be utilized.
If using the binary system, a set of elements is broken down into subsets of sizes with
elements where is the -th bit of in binary. This means that if has -th bit equal to 0, the corresponding set does not contain any elements. Each of the subset has the same property as the original static data structure. Operations performed on the new dynamic data structure may involve traversing sets formed by decomposition. As a result, this will add factor as opposed to the static data structure operations but will allow insert/delete operation to be added.
Kurt Mehlhorn proved several equations for time complexity of operations on the data structures dynamized according to this idea. Some of these equalities are listed.
If
is the time to build the static data structure
is the time to query the static data structure
is the time to query the dynamic data structure formed by decomposition
is the amortized insertion time
then
If is at least polynomial, then .
Further reading
Kurt Mehlhorn, Data structures and algorithms 3, . An EATCS Series, vol. 3, Springer, 1984.
Data structures
|
https://en.wikipedia.org/wiki/Joe%20%26%20Mac
|
Joe & Mac, also known as Caveman Ninja and Caveman Ninja: Joe & Mac, is a 1991 platform game released for arcades by Data East. It was later adapted for the Super NES, Mega Drive/Genesis, Nintendo Entertainment System, Game Boy, Amiga, Zeebo, Nintendo Switch, and PC.
Gameplay
The game stars the green-haired Joe and the blue-haired Mac, cavemen who battle through numerous prehistoric levels using weapons such as boomerangs, bones, fire, flints, electricity, stone wheels, and clubs. The objective of the game is to rescue a group of women who were kidnapped by a rival tribe of cavemen. The game features a health system by which the player loses health over a period of time, apart from during boss battles. A two-player mode is available, and in some versions both characters are capable of damaging each other.
The original arcade version and Amiga, Mega Drive/Genesis, MS-DOS and Zeebo ports have the distinction of allowing the player to select between different routes at the end of boss battles. Also, after defeating the final boss, the players can choose between three exits – each one leading to a slightly different ending sequence.
Ports
The game has been ported to various systems, some of which drop the name Caveman Ninja, referring to the game simply as Joe & Mac.
A Super NES version was developed and published in 1991 by Data East. In December 1992, a version for the NES was released. It was developed by Elite Systems and published by Data East. A Game Boy version, released in North America and the United Kingdom in April 1993, was developed by Motivetime and was also published by Data East. Finally, in late 1993, another version was developed by Eden Entertainment Software and published by Takara for the Sega Genesis and TecToy for the Brazilian Mega Drive in early 1994.
The Mega Drive/Genesis version is considered a close match to the arcade version. The Super NES version is a reworked game which features an overworld map used to choose the levels (unlike in other versions where all of them have to be played), which were longer, plus some bonus stages (either in the levels or out in the world map). Some of the weapons are missing and can no longer be charged up. The final boss is also different, and there are only two endings. The NES and Game Boy versions lack the option of choosing levels or endings. Both feature variants of the arcade boss.
The Japanese version of the game includes a beginning scene in which cavemen enter a hut and emerge while dragging cavewomen by their hair. The scene was removed from the US release, with Data East stating: "We didn't want kids to see [the Japanese display] and think it was okay".
Reception
The One reviewed the arcade version of Caveman Ninja in 1991, calling it "a cutesie 'jumpy-jumpy' game which uses some good graphics and neat comic touches to overcome the unoriginal gameplay", recommending it as being "worth a try".
Skyler Miller of AllGame criticized the NES version for its "unresponsive c
|
https://en.wikipedia.org/wiki/R%C3%A9seau%20Ferr%C3%A9%20de%20France
|
Réseau ferré de France (RFF, ) was a French company which owned and maintained the French national railway network from 1997 to 2014. The company was formed with the rail assets of SNCF in 1997. Afterwards, the trains were operated by the SNCF, the national railway company, but due to European Union Directive 91/440, the Government of France was required to separate train operations from the railway infrastructure. On 1 January 2015, RFF became SNCF Réseau, the operational assets of SNCF became SNCF Mobilités, and both groups were placed under the control of SNCF.
Unlike other infrastructure managers, RFF did not provide maintenance services or rail traffic control operations, which were both done by SNCF Infra on RFF's behalf. Furthermore, SNCF retained the ownership of stations. In September 2013, RFF had over €32 billion of debt.
Overview
The RFF was constituted with SNCF's infrastructure assets, and debts were transferred from SNCF's books to RFF's. RFF was mainly a financial structure focusing on debt refinancing, and contracted the majority of its infrastructure management to SNCF. Signalling on RFF infrastructure was implemented and maintained by SNCF.
The creation of RFF was criticised because of the financial options chosen: RFF was subsidised by the French government in order to pay the interest on debt previously borne by the SNCF, which allowed SNCF to have a positive operating income and thus enabled competition to be opened.
Control centres
In July 2013, RFF began a project to build 16 regional control centres, replacing over a thousand local signalling centres. The first regional control centre was built in Pagny-sur-Moselle.
See also
Autorité de Régulation des Activités Ferroviaires
Gestionnaire d’Infrastructure Unifié
Réseau Ferré National
References
External links
RFF official website
European Union SNCF brief
French Senate report on transport infrastructure
RFF network map
France
Railway infrastructure managers
|
https://en.wikipedia.org/wiki/History%20of%20ITV
|
The history of ITV, the United Kingdom and Crown Dependencies "Independent Television" commercial network, goes back to 1955.
Independent Television began as a network of independently-owned regional companies that were both broadcasters and programme makers, beginning with four companies operating six stations in three large regions in 1955–1956, and gradually expanding to 17 stations in 14 regions by 1962. Each regional station was responsible for its own branding, scheduling and advertising, with many peak-time programmes shared simultaneously across the whole network.
By 29 February 2016, 12 regions in England and Wales, the Channel Islands and the Isle of Man shared national ITV branding and scheduling, and, together with a 13th region UTV in Northern Ireland, were owned by a single company, ITV plc. A further two regions in Scotland carry STV branding and are owned by the STV Group.
1955–1964
Formation
The Independent Television network came about as a result of the Television Act 1954, which paved the way for the establishment of a commercial television service in the United Kingdom and created the Independent Television Authority (ITA). The act itself was not without controversy, and much debate ensued both in the British Parliament and the British Press, and it was passed on the basis that the ITA would regulate the new service and ensure that the new service did not follow the same path taken by the American networks (which were perceived as 'vulgar' by some commentators). For example, it was made obligatory that commercials be clearly distinguishable from programmes. At the time, programmes in the USA were normally sponsored by a single company, so it was not uncommon for a game show host to step away from their podium after a round to sell cars or The Flintstones to segue into an ad for cigarettes with no perceived change from show to advertising.
The new "Independent Television" network, named due to its independence from the BBC which until then had a monopoly on broadcasting within the United Kingdom, was made up of numerous companies providing a regional television service and would also generally provide programmes to the network as a whole. Each individual company broadcast on 405-line VHF and was responsible for providing a local service, including daily news bulletins and local documentaries, and for selling advertising space on their channel: this measure ensured that all the independent companies were in competition with each other and that no single broadcaster could gain a monopoly over commercial broadcasting. However, national news was not provided by the individual companies and was instead provided by Independent Television News (ITN). Each regional service had its own on-screen identity to distinguish it from other regions, since there was often a sizeable overlap in reception capability within each region.
Upon the creation of the network, six franchises were awarded for London, the Midlands and the North of E
|
https://en.wikipedia.org/wiki/Mumu%20%28computer%20worm%29
|
Mumu is a computer worm that was isolated in June 2003.
Description
Mumu consists of a mix of malicious files and actual utilities. Because of the easily customised nature of this worm, many variants have been discovered, but most are generically detected under the Mumu.A name. The lone exception is Mumu.B, which is detected separately by most antivirus programs.
The "standard" Mumu package consists of the following:
A range of malicious batch files
A number of "grey area" batch files, which use the utilities included in the Mumu package in a malicious way
pcGhost and/or an nVidia utility, both of which are legitimate utilities
Other various legitimate utilities
A number of text files
As previously mentioned, this varies by version. Mumu spreads by scanning IP addresses for open administrative network shares. It then attempts to guess the password to gain access and copy itself over.
Heavy correlation of Mumu infections with infections of the Valla virus have been observed. It is suspected that Mumu caused a resurgence in Valla infections after Valla infected one of the .exe files included in the Mumu package. Previous to this, Valla was considered obsolete. It now ranks among the most-reported viruses on the WildList.
External links
Mumu removal tool
Symantec
Sophos
McAfee
Muma
Windows malware
Exploit-based worms
|
https://en.wikipedia.org/wiki/Michael%20Sipser
|
Michael Fredric Sipser (born September 17, 1954) is an American theoretical computer scientist who has made early contributions to computational complexity theory. He is a professor of applied mathematics and was the Dean of Science at the Massachusetts Institute of Technology.
Biography
Sipser was born and raised in Brooklyn, New York and moved to Oswego, New York when he was 12 years old. He earned his BA in mathematics from Cornell University in 1974 and his PhD in engineering from the University of California at Berkeley in 1980 under the direction of Manuel Blum.
He joined MIT's Laboratory for Computer Science as a research associate in 1979 and then was a Research Staff Member at IBM Research in San Jose. In 1980, he joined the MIT faculty. He spent the 1985–1986 academic year on the faculty of the University of California at Berkeley and then returned to MIT. From 2004 until 2014, he served as head of the MIT Mathematics department. He was appointed Interim Dean of the MIT School of Science in 2013 and Dean in 2014. He served as Dean until 2020, when he was followed by Nergis Mavalvala. He is a fellow of the American Academy of Arts and Sciences. In 2015 he was elected as a fellow of the American Mathematical Society "for contributions to complexity theory and for leadership and service to the mathematical community."
He was elected as an ACM Fellow in 2017.
Scientific career
Sipser specializes in algorithms and complexity theory, specifically efficient error correcting codes, interactive proof systems, randomness, quantum computation, and establishing the inherent computational difficulty of problems. He introduced the method of probabilistic restriction for proving super-polynomial lower bounds on circuit complexity in a paper joint with Merrick Furst and James B. Saxe. Their result was later improved to be an exponential lower bound by Andrew Yao and Johan Håstad.
In an early derandomization theorem, Sipser showed that BPP is contained in the polynomial hierarchy, subsequently improved by Peter Gács and Clemens Lautemann to form what is now known as the Sipser-Gács-Lautemann theorem. Sipser also established a connection between expander graphs and derandomization. He and his PhD student Daniel Spielman introduced expander codes, an application of expander graphs. With fellow graduate student David Lichtenstein, Sipser proved that Go is PSPACE hard.
In quantum computation theory, he introduced the adiabatic algorithm jointly with Edward Farhi, Jeffrey Goldstone, and Samuel Gutmann.
Sipser has long been interested in the P versus NP problem. In 1975, he wagered an ounce of gold with Leonard Adleman that the problem would be solved with a proof that P≠NP by the end of the 20th century. Sipser sent Adleman an American Gold Eagle coin in 2000 because the problem remained (and remains) unsolved.
Notable books
Sipser is the author of Introduction to the Theory of Computation, a textbook for theoretical computer science.
Personal lif
|
https://en.wikipedia.org/wiki/Function%20value
|
Function value may refer to:
In mathematics, the value of a function when applied to an argument.
In computer science, a closure.
|
https://en.wikipedia.org/wiki/Winner%20takes%20all
|
Winner(s) take(s) (it) all may refer to:
Competition, economics and politics
Winner-takes-all voting
Winner-take-all (computing)
Winner-take-all market
Books
Fiction
Winner Takes All (novel), a BBC Books Doctor Who novel
"Winner Take All" (short story), a Sailor Steve Costigan story by Robert E. Howard
Nonfiction
Winner-Take-All Politics, by Jacob S. Hacker and Paul Pierson
The Winner-Take-All Society, by economist Robert Frank
Winners Take All: The Elite Charade of Changing the World by Anand Giridharadas
Film
Winner Takes All (1918 film), directed by Elmer Clifton
Winner Take All (1924 film), directed by W. S. Van Dyke
Winner Take All (1932 film), starring James Cagney
Winner Take All (1939 film), starring Tony Martin
Joe Palooka in Winner Take All
Winner Take All, a 1975 made-for-TV film starring Shirley Jones and Laurence Luckinbill
Winner Takes All (1982 film), directed by Wong Jing
Winners Take All (film), a 1987 film directed by Fritz Kiersch
Winner Takes All (2000 film), directed by Clifton Ko
Winner Takes All (2004 film), short film directed by Helen M. Grace
Television
Winner Takes All (game show), on the ITV network from 1975 to 1988, and on Challenge TV from 1997
Winner Take All (game show), a 1940s and early '50s American game show
"Winners Take All", the tenth episode of the fifth season of the sitcom Murphy Brown
"Winner Take All", the ninth episode of the second season of Teen Titans
Music
Winner Take All, 1998, by The Turbo A.C.'s
Winner Takes All (album), 1979, by The Isley Brothers
"The Winner Takes It All", 1980, by ABBA
"Winner Takes It All" (Sammy Hagar song), 1987, from the film Over the Top
Winners Take All (album) by Quiet Riot
"Winners Take All", a song from the Quiet Riot album Condition Critical
"Winners Take All", a song from the Aesop Rock EP Fast Cars, Danger, Fire and Knives
See also
Kill the Winner hypothesis alternative to "Winner takes all" for population growth in microbes
|
https://en.wikipedia.org/wiki/List%20of%20Indianapolis%20500%20broadcasters
|
The Indianapolis 500 has been broadcast on network television in the United States since 1965. From 1965 to 2018, the event was broadcast by ABC, making it the second-longest-running relationship between an individual sporting event and television network, surpassed only by CBS Sports' relationship with the Masters Tournament (since 1956). In 2014, ABC celebrated fifty years televising the Indianapolis 500, not including 1961 through 1964 when reports and highlights of time trials were aired on ABC's Wide World of Sports. Since 2019, the race has aired on NBC.
From 1965 to 1970, ABC televised a combination of filmed and/or taped recorded highlights of the race the following weekend on Wide World of Sports. The 1965 and 1966 presentations were in black-and-white, while all subsequent presentations have been in color. From 1971 to 1985, the Indianapolis 500 was shown on a same-day tape delay basis. Races were edited to a two- or three-hour broadcast, and shown in prime time. Starting in 1986, the race has been shown live in "flag-to-flag" coverage. In the Indianapolis market, as well as other parts of Indiana, the live telecast is blacked out and shown tape delayed to encourage live attendance. For 2016, the race was completely sold out, and as such the local blackout was lifted for that year. Since 2007, the race has been aired in high definition.
Currently, the television voice of the Indy 500 is Leigh Diffey, who has been working the race since NBC took over in 2019. The last television voice of the Indy 500 for ABC was Allen Bestwick, who held the position from 2014 to 2018. Past television anchors include Chris Schenkel, Jim McKay, Keith Jackson, Jim Lampley, Paul Page, Bob Jenkins, Todd Harris, and Marty Reid. Other longtime fixtures of the broadcast include Jack Arute, Sam Posey, Jackie Stewart, Bobby Unser, and Jerry Punch.
On August 10, 2011, ABC extended their exclusive contract to carry the Indianapolis 500 through 2018. Starting in 2014, the contract also includes live coverage of the IndyCar Grand Prix on the road course.
In 2019, the Indianapolis 500 moved to NBC, as part of a new three-year contract that unifies the IndyCar Series' television rights with NBC Sports (the parent division of IndyCar's current cable partner NBCSN), and replaces the separate package of five races broadcast by ABC. The Indianapolis 500 is one of eight races televised by NBC as part of the new deal, which ended ABC's 54-year tenure as broadcaster of the event. WTHR is the local broadcaster of the race under this contract; the existing blackout policy is expected to continue should the race not sell out. As no spectators were allowed for the 2020 Indianapolis 500, the race was aired live in the Indianapolis market.
Live coverage
NBC era
Dillon Welch is the first second-generation broadcaster to be involved in the race telecast. His father Vince worked the race in the ABC era until 2014.
ABC era
Starting in 1986, the race was shown live in its entir
|
https://en.wikipedia.org/wiki/DataPlay
|
DataPlay is an optical disc system developed by DataPlay Inc. and released to the consumer market in 2002. Using very small (32mm diameter) disks enclosed in a protective cartridge storing 250MB per side, DataPlay was intended primarily for portable music playback, although it could also store other types of data, using both pre-recorded disks and user-recorded disks (and disks that combined pre-recorded information with a writable area). It would also allow for multisession recording. It won the CES Best of Show award in 2001.
DataPlay also included an elaborate digital rights management system designed to allow consumers to "unlock" extra pre-recorded content on the disk at any time, through the internet, following the initial purchase. It was based on the Secure Digital Music Initiative's DRM system. Dataplay's DRM system was one of the reasons behind its attractiveness to the music industry. It also included a proprietary file system, Dataplay File System (DFS) which natively supported DRM. By default it would allow up to 3 copies to other Dataplay discs, without allowing any copies to CDs.
The recorded music industry was initially generally supportive of DataPlay and a small number of a pre-recorded DataPlay disks were released, including the Britney Spears album Britney. Graphics on press releases show that Sting and Garth Brooks were also set to have DataPlay releases. In 2001 the first DIY DataPlay album was released by the experimental rave producer Backmasker. However, as a pre-recorded format, DataPlay was a failure. The company closed due to a lack of funding. In 2003 a company called DPHI bought Dataplay's intellectual property and reintroduced it at CES 2004. The company swapped Dataplay's DFS file system in favor of the FAT file system. Again, they were marketed as a cheaper alternative to memory cards, with a device being designed that would allow users to transfer data from an SD card to a cheaper and higher capacity Dataplay disc. Each disc would hold 500 megabytes of data and be sold at just US$4.50. DPHI also prototyped 750 megabyte Dataplay discs and announced plans for 2 and 7 gigabyte discs, the latter of which would use a blue-violet semiconductor laser, just like Blu-ray.
There were very few products seen on the market that could write data to these discs. Most notable was the Topy Mini Writer, which retailed for $130 (USD) and housed an optical pickup unit (image No.4) with a USB interface board, allowing the use of DataPlay discs much like other end-user writable optical media (e.g., CD-Rs). Other products were the iriver IDP-100 and the MTV Video Device "MTV FLIP", which both housed the prototype-based model (image No.2).
Dataplay discs were first proposed as a low cost alternative to memory cards, which used to cost US$3 per megabyte. Blank Dataplay discs, by comparison, would hold 500 megabytes of data at US$10 per disc. They are also expected to have a 100-year lifespan. The discs would be made out of pol
|
https://en.wikipedia.org/wiki/Eddie%20Dombrower
|
Eddie Dombrower (born 1957) is an American computer game and video game designer, programmer and producer. He is best known as the co-creator of the baseball games Earl Weaver Baseball and Intellivision World Series Baseball. He is also recognized for designing the first dance notation computer software, DOM.
Dombrower studied both dance and mathematics at Pomona College in Claremont, California. After his graduation he found it frustrating that the new microcomputer technology had not solved an age-old problem: how choreographers could record their work in written form. He created the DOM system on an Apple II computer in 1981, which allowed choreographers to use a system of codes to enter their work. The resulting dance movements were then performed by a figure on screen.
In 1982, Intellivision game design director Don Daglow (also a Pomona College graduate) recruited Dombrower to join Mattel to work on a new type of baseball game that for the first time would feature large on-screen animated figures and multiple camera angles. Prior video games all showed a static or scrolling playfield from a single camera angle, and Daglow believed that Dombrower's experience with DOM would allow him to get the desired results. Dombrower made progress quickly, and Intellivision World Series Baseball's new design originated a campaign during the Christmas television advertising season in 1982. Although the title had limited distribution because of the video game crash of 1983, it proved that video games could mimic television coverage of sports events, and soon other sport games mimicked Dombrower introduced with Intellivision World Series Baseball.
In 1986, Daglow, then working at Electronic Arts, sought out Dombrower once again. EA Founder Trip Hawkins had agreed to back the creation of another baseball game, Earl Weaver Baseball. As they had done at Intellivision, Daglow designed the baseball simulation and overall look, while Dombrower designed the game's visual presentation and its underlying technology. In contrast to some celebrity athletes who merely lent their names to projects, Hall of Fame manager Earl Weaver worked with the team to design the game's artificial intelligence by providing strategic knowledge about the game. When the game appeared in 1987, it was named one of the 25 best games of all time by Computer Gaming World, and its success helped pave the way for the creation of the EA Sports brand and product line. Dombrower also led the development of the sequel, Earl Weaver Baseball II.
Dombrower developed EWB Baseball for the iPhone, the spiritual successor to the Earl Weaver series, which was released March 23, 2009.
References
1957 births
Living people
American video game designers
Video game programmers
Intellivision
Pomona College alumni
|
https://en.wikipedia.org/wiki/Wireless%20Router%20Application%20Platform
|
The Wireless Router Application Platform (WRAP) is a format of single board computer defined by Swiss company PC Engines. This is specially designed for wireless router, firewall, load balancer, VPN or other network appliances.
Basic specs
32-bit x86 compatible CPU, low energy consumption (AMD Geode SC1100 at 266 MHz)
supports MMX instructions
64-bit SDRAM memory controller (max: 89 MHz)
PCI bus controller
IDE interfaces
ACPI 1.0-compatible power management
tinyBIOS : Made specially by PC Engines
64 or 128MB SDRAM
Compact flash memory (includes boot OS)
Monitoring: watchdog timer, LM77 thermal monitor
Power supply: 7V ~ 18V external DC power or Power over Ethernet
LAN: National semiconductor DP83816
I/O: MiniPCI slots, console serial port
Different boards
There are three different models of the WRAP:
The WRAP 1-1 has two Ethernet ports, and two mini-PCI slots, on a 16x16cm board.
The WRAP 1-2 has three Ethernet ports and one mini-PCI slot, on a 16x16cm board.
The WRAP 2 has one Ethernet port, and two mini-PCI slots, on a 10x16cm board.
Operating System
The WRAP is capable of running many different operating systems, including various Linux distributions, FreeBSD, NetBSD, OpenBSD, as well as proprietary OSes. The WRAP lacks a keyboard controller (for obvious reasons), so some OSes that rely on one for the boot process may have to be modified.
End Of Life (EOL)
PC Engines announced the end of life for the WRAP platform in 2007. The board was replaced by the ALIX.
External links
PC Engines information page on the WRAP
BowlFish
Routers (computing)
Router
|
https://en.wikipedia.org/wiki/Kiesselbach%27s%20plexus
|
Kiesselbach's plexus is an anastomotic arterial network (plexus) of four or five arteries in the nose supplying the nasal septum. It lies in the anterior inferior part of the septum known as Little's area, Kiesselbach's area, or Kiesselbach's triangle. It is a common site for nosebleeds.
Structure
Kiesselbach's plexus is an anastomosis of four or five arteries:
the anterior ethmoidal artery, a branch of the ophthalmic artery.
the sphenopalatine artery, a terminal branch of the maxillary artery.
the greater palatine artery, a branch of the maxillary artery.
a septal branch of the superior labial artery, a branch of the facial artery.
a posterior ethmoidal artery, a branch of the ophthalmic artery. There is contention as whether this is truly part of Kiesselbach's plexus. Most sources quote that it is not part of the plexus, but rather one of the blood supplies for the nasal septum itself.
It runs vertically downwards just behind the columella, and crosses the floor of the nose. It joins the venous plexus on the lateral nasal wall.
Function
Kiesselbach's plexus supplies blood to the nasal septum.
Clinical significance
Ninety percent of nosebleeds (epistaxis) occur in Kiesselbach's plexus. It is exposed to the drying effect of inhaled air. It can also be damaged by trauma from a finger nail (nose picking), as it is fragile. It is the usual site for nosebleeds in children and young adults. A physician may use a nasal speculum to see that an anterior nosebleed comes from Kiesselbach's plexus.
History
James Lawrence Little (1836–1885), an American surgeon, first described the area in detail in 1879. Little described the area as being "about half an inch ... from the lower edge of the middle of the column [septum]".
Kiesselbach's plexus is named after Wilhelm Kiesselbach (1839–1902), a German otolaryngologist who published a paper on the area in 1884. The area may be called Little's area, Kiesselbach's area, or Kiesselbach's triangle.
See also
Anatomical terms of location
References
External links
Epistaxis - utmb.edu
Nose Anatomy - emedicine.com
Nasal Anatomy - fpnotebook.com
Human anatomy
Anatomy named for one who described it
|
https://en.wikipedia.org/wiki/Unit%20type
|
In the area of mathematical logic and computer science known as type theory, a unit type is a type that allows only one value (and thus can hold no information). The carrier (underlying set) associated with a unit type can be any singleton set. There is an isomorphism between any two such sets, so it is customary to talk about the unit type and ignore the details of its value. One may also regard the unit type as the type of 0-tuples, i.e. the product of no types.
The unit type is the terminal object in the category of types and typed functions. It should not be confused with the zero or bottom type, which allows no values and is the initial object in this category. Similarly, the Boolean is the type with two values.
The unit type is implemented in most functional programming languages. The void type that is used in some imperative programming languages serves some of its functions, but because its carrier set is empty, it has some limitations (as detailed below).
In programming languages
Several computer programming languages provide a unit type to specify the result type of a function with the sole purpose of causing a side effect, and the argument type of a function that does not require arguments.
In Haskell, Rust, and Elm, the unit type is called () and its only value is also (), reflecting the 0-tuple interpretation.
In ML descendants (including OCaml, Standard ML, and F#), the type is called unit but the value is written as ().
In Scala, the unit type is called Unit and its only value is written as ().
In Common Lisp the type named is a unit type which has one value, namely the symbol . This should not be confused with the type, which is the bottom type.
In Python, there is a type called NoneType which allows the single value of None.
In Swift, the unit type is called Void or () and its only value is also (), reflecting the 0-tuple interpretation.
In Java, the unit type is called Void and its only value is null.
In Go, the unit type is written struct{} and its value is struct{}{}.
In PHP, the unit type is called null, which only value is NULL itself.
In JavaScript, both Null (its only value is null) and Undefined (its only value is undefined) are built-in unit types.
in Kotlin, Unit is a singleton with only one value: the Unit object.
In Ruby, nil is the only instance of the NilClass class.
In C++, the std::monostate unit type was added in C++17. Before that, it is possible to define a custom unit type using an empty struct such as struct empty{}.
Void type as unit type
In C, C++, C#, and D, void is used to designate a function that does not return anything useful, or a function that accepts no arguments. The unit type in C is conceptually similar to an empty struct, but a struct without members is not allowed in the C language specification (this is allowed in C++). Instead, 'void' is used in a manner that simulates some, but not all, of the properties of the unit type, as detailed below. Like most imperative languages, C
|
https://en.wikipedia.org/wiki/Animal%20Liberation%20Leagues
|
Animal Liberation Leagues were a network of animal rights organizations active in the UK in the 1980s. Whereas the Animal Liberation Front specialized in clandestine activity, mainly masked, at night, and involving small numbers of people, the Animal Liberation Leagues consisted of coordinated raids, or 'invasions', by a large number of people, mainly carried out during the day. One journalist described the Animal Liberation Leagues as "a sophisticated...development in the move to direct action". Raids were often carried out at the same time as legal demonstrations.
Central Animal Liberation League
The Central Animal Liberation League (CALL) was an animal rights organisation based in central England that was active during the 1980s. Over a hundred animals were taken by this organisation, mainly from centres of animal experimentation. They also took documentation and video footage. The slogan of the CALL was "Through The Door When They Least Expect It".
A fifteen-year-old rhesus monkey called Beatrice was the only monkey ever to be taken from a UK laboratory, by CALL. She had been used in arthritis research.
Guinea pigs used in burn experiments were taken from a laboratory in Birmingham by CALL activists posing as window cleaners.
A raid on the premises of Animal Supplies London Ltd netted van loads of documentation and found a fridge filled with decapitated monkey heads and bats.
Video footage taken at Oxford University Park Farm showed rhesus monkeys that had been used in eye experiments.
Experiments on rats, pigs, mice, rabbits, ferrets, polecats, primates, pigeons and sheep were filmed at the John Radcliffe Hospital in Oxford.
Roebuck Farm in Hertfordshire was raided in 1986. Documentation taken from here revealed that primates had been supplied by Windsor Safari Park, Chessington Zoo, and Ravenstone Zoo for use in experiments at places like Huntingdon Life Sciences.
Eastern Animal Liberation League
The Eastern Animal Liberation League (EALL) was based in the East of England.
The main action of the EALL took place in August 1984. Unilever research laboratories in Bedford was stormed by over two hundred animal rights activists and the same time as a legal demonstration was taking place at the front. 25 people were later convicted of conspiracy to burgle and sentenced to a total of 41 years.
One of those convicted was Jill Phipps, who was killed in 1995 during a demonstration, when she was run over by a lorry carrying calves for the live export trade. Jill, along with her mother Nancy Phipps, and her sister Lesley Phipps, were all convicted in the Unilever case. Jill's sentence was suspended because she had gotten pregnant, but her mother and sister were sent to HM Prison Holloway.
These heavy losses to the animal rights movement led to the winding up of the EALL and a change in tactics.
Northern Animal Liberation League
The Northern Animal Liberation League was active in the north of England. Their campaigning slogan was, "Over th
|
https://en.wikipedia.org/wiki/Type%20class
|
In computer science, a type class is a type system construct that supports ad hoc polymorphism. This is achieved by adding constraints to type variables in parametrically polymorphic types. Such a constraint typically involves a type class T and a type variable a, and means that a can only be instantiated to a type whose members support the overloaded operations associated with T.
Type classes were first implemented in the Haskell programming language after first being proposed by Philip Wadler and Stephen Blott as an extension to "eqtypes" in Standard ML, and were originally conceived as a way of implementing overloaded arithmetic and equality operators in a principled fashion.
In contrast with the "eqtypes" of Standard ML, overloading the equality operator through the use of type classes in Haskell does not require extensive modification of the compiler frontend or the underlying type system.
Overview
Type classes are defined by specifying a set of function or constant names, together with their respective types, that must exist for every type that belongs to the class. In Haskell, types can be parameterized; a type class Eq intended to contain types that admit equality would be declared in the following way:
class Eq a where
(==) :: a -> a -> Bool
(/=) :: a -> a -> Bool
where a is one instance of the type class Eq, and a defines the function signatures for 2 functions (the equality and inequality functions), which each take 2 arguments of type a and return a boolean.
The type variable a has kind ( is also known as Type in the latest GHC release), meaning that the kind of Eq is
Eq :: Type -> Constraint
The declaration may be read as stating a "type a belongs to type class Eq if there are functions named (==), and (/=), of the appropriate types, defined on it". A programmer could then define a function elem (which determines if an element is in a list) in the following way:
elem :: Eq a => a -> [a] -> Bool
elem y [] = False
elem y (x:xs) = (x == y) || elem y xs
The function elem has the type a -> [a] -> Bool with the context Eq a, which constrains the types which a can range over to those a which belong to the Eq type class. (Note: Haskell => can be called a 'class constraint'.)
A programmer can make any type t a member of a given type class C by using an instance declaration that defines implementations of all of C's methods for the particular type t. For instance, if a programmer defines a new data type t, they may then make this new type an instance of Eq by providing an equality function over values of type t in whatever way they see fit. Once they have done this, they may use the function elem on [t], that is, lists of elements of type t.
Note that type classes are different from classes in object-oriented programming languages. In particular, Eq is not a type: there is no such thing as a value of type Eq.
Type classes are closely related to parametric polymorphism. For example, note that the type of elem as specif
|
https://en.wikipedia.org/wiki/OpenROAD
|
OpenROAD, which stands for "Open Rapid Object Application Development", is a fourth-generation programming language (4GL) and development suite from Actian Corporation.
It includes a suite of development tools, with built-in Integrated development environment (IDE) (Written in OpenROAD), and Code Repository.
History
The history of OpenROAD is closely tied to that of the Ingres relational database.
The Ingres Product set, (marketed by ASK Corporation, Computer Associates, Ingres Corporation and then Actian) was popular in the governments of North West Europe, and can be found in many government departments.
OpenROAD appeared in beta form on the SUN platform in 1991 as Windows4GL 1.0, and was available to British Universities under a special license agreement. The development environment was known as the Sapphire Editor.
The Sapphire Editor allowed the creation of complex GUI interfaces using an IDE, rather than large volumes of Motif code / resource files. This was one of the first environments to enable rapid prototyping of GUI clients.
Windows4GL 2.0 introduced Microsoft Windows compatibility and the debugger.
Version history
The reason for the varying and shorter Lifecycle dates of latest versions is Actian is working to bring OpenROAD releases current to Actian X. The Lifecycle dates will re-align with the 11.2 release in 2021.
Architecture
OpenROAD Server
The OpenROAD Server enables business logic written in the OpenROAD 4GL language to be accessed by client applications. The OpenROAD Server is multi-threaded and allows concurrent access from a number of client interfaces. These client interfaces include the following:
Java clients (JSP, Java Servlets, Java applications)
.NET clients (VB.NET, C#, ASP.NET)
COM clients (VB, C++, ASP)
OpenROAD clients
Open Database Access
OpenRoad Server has built-in support for Ingres/X and Vector/Avalanche databases. On IBM z/OS mainframes, EDBC (a separate product) provides the same level of access to native VSAM, DB2, IMS, and Datacom/DB databases to enable you to access data from anywhere.
Features needed (Q2 2008)
Intellisense for source, SQL statements and user defined objects.
The ability to construct user objects that inherit from the system classes
Better configuration management for large development teams
Native access to .NET classes
In process access to Ingres NET for FAT clients making distribution easier.
Extension of the OpenROAD language into the Ingres database engine replacing the Procedure language.
Access to the sources of the OpenROAD language
References
External links
Product links:
Ingres Corporation
Community links:
North American Ingres Users Association
German Ingres User Association
Ingres UserGroup Nederland
OpenROAD FAQ (1997)
Ingres Community OpenROAD Wiki
Mailing Lists:
Openroad-users Mailing List
Webcasts:
OpenROAD Application Development
Fourth-generation programming languages
|
https://en.wikipedia.org/wiki/Sohaib%20Abbasi
|
Sohaib Abbasi (born August 14, 1956) is a Pakistani–American business executive, computer scientist and philanthropist. He is the former chairman and chief executive of Informatica, having served in the roles from 2004 until 2015. During his tenure as CEO, Abbasi helped to grow the company's revenue from $219 million to over $1 billion, and to increase the value of stock by over 800 percent.
He was also a member of the executive committee of Oracle Corporation and led Oracle Tools and Oracle Education as senior vice president. He retired from these roles in 2003 after 20 years with the company and is credited with helping to grow the company from a startup into an industry leader.
Abbasi joined the board of directors for the software company, Red Hat Inc. in 2011. In May 2016, Abbasi joined the board of directors for the San Francisco-based analytics company, New Relic. And in August 2017, Abbasi joined the board of directors for San Francisco-based StreamSets, Inc., an innovator in smart data pipelines for data engineers.
Early life and education
Abbasi was born in Lahore, Pakistan in 1956 and moved to various cities with his father, an air force official, before reaching the United States in 1974 to attend college at the University of Illinois at Urbana-Champaign. Abbasi graduated with honors and obtained a bachelor's degree in Computer Science in 1978. He later earned his master's degree in the same field in 1980.
Career
Early career
Abbasi began his professional career as a product manager for Professional Computer Resources in 1980. He developed financial modeling software and ERP applications there before launching his own company, Outlook Software, Inc.
Oracle
Abbasi joined Oracle while the company was a startup in 1982, as the manager of Midwestern Sales. Following his success in sales, Abbasi became manager of user interface development in 1984 where he created Oracle's first application programming tool, SQL*Forms. The software was first introduced in 1985 and was used by over 90 percent of all Oracle DBMS shops by 1990.
Abbasi also launched the software tools division at Oracle, which includes application development tools, business intelligence tools, e-business portal tools and pharmaceutical and Internet learning applications. He helped grow the tools division of the company from its initial launch to generating revenues of $3.75 billion during his tenure with the company. By 1989, he was named the vice-president of Tools and Multi-media for the company. Abbasi was promoted further in 1994 to senior vice-president of Tools Product Division. From 2001 until his retirement from the company in 2003, Abbasi held the role of senior vice president in both the Tools and Education divisions.
He retired from Oracle in 2003 after 20 years and is credited with helping the company grow from a 30 employee startup with $4 million in revenue, to a company with more than 40,000 employees and revenue near $10 billion.
Informatica
In 200
|
https://en.wikipedia.org/wiki/Wireless%20Group
|
Wireless Group Limited is a radio and digital broadcasting network with headquarters in Belfast, Northern Ireland and with radio operations in the Republic of Ireland and the United Kingdom. It currently operates five stations in Ireland and 18 in the UK. The company was formerly known as UTV Media, owned by UTV Television. Its television broadcasting services were sold to ITV plc in February 2016 and its radio, sales services and websites were spun off into a new company, Wireless, later purchased by News Corp.
In June 2016, Rupert Murdoch's News Corp reached an agreement to buy the company. The sale was completed in September 2016. Prior to the acquisition, Wireless Group was a constituent of the FTSE SmallCap Index.
History
Background
The current UTV Limited (originally Ulster Television plc), which began in 1959 as an ITV franchise holder in Northern Ireland, purchased ISP Direct Net Access in March 2000 for £4.4m, rebranding it as UTV Internet and later UTV Connect. The service expanded into telephone market under UTV Talk in August 2004 and also provided broadband and fibre optic packages for Northern Ireland, the Republic and the rest of the UK. The service was sold to Rainbow Communications and Vodafone Ireland in 2014.
The company also set up an online car dealership UTV Drive, created in partnership with Abbey Insurance, which was sold in 2014.
Further expansion took place with the move into radio, starting in Cork with 96FM and C103 in 2001. Further acquisitions were undertaken over the next decade, with the largest investment being the purchase of The Wireless Group in 2005 for £97m, boosting its radio portfolio with additional local stations, digital radio multiplexes and national station Talksport. In 2005, the group also launched its first station, U105, which broadcasts to the Belfast area, and purchased Juice FM in Liverpool.
With the expansion, turnover increased, with 2005 being up 46% on 2004, pre-tax profits rising by 12%, and employment up by 500 people to more than double the figure in the previous year. In 2006, total sales were £113.6m of which the radio division accounted for 54%, television 37% and 9% from new media. 48% of operating profits were earned in the radio side of the business, with 47% derived from television and 5% from new media.
Reorganisation of UTV and proposed mergers
Following shareholder approval, Ulster Television plc changed its name to UTV plc in June 2006. Then, on 16 August 2007, a re-organisation of the group was proposed, with the existing UTV plc, holding the ITV franchise only, becoming a wholly owned subsidiary of new holding company, UTV Media plc, and the remaining businesses transferred to the new holding company. The change was approved at an extraordinary general meeting on 19 September and came into effect on 15 October 2007, with shareholders receiving a 1:1 exchange of stock from the old to new company. The company, established on 1 June 2007 as Beechgrove Trading Limited, ch
|
https://en.wikipedia.org/wiki/1st%20%26%20Ten%20%281984%20TV%20series%29
|
1st & Ten is an American sitcom that aired between December 1984 and January 1991 on the cable television network HBO. Featuring series regulars Delta Burke and veteran Reid Shelton, it was one of cable's first attempts to lure the lucrative sitcom audience away from the then-dominant "Big Three" broadcast television networks, by taking advantage of their freedom to include occasional profanity and nudity.
Plot
The sports-themed series follows the on-and off-field antics of the fictional American football team, the California Bulls. The team changed owners throughout the series' history, with the premise that a woman is in charge.
During the first season Diane Barrow (Delta Burke) becomes the owner of her ex-husband's team as part of a divorce settlement, after he has an affair with the team's tight end. She quickly learns the ups and downs of pro football. In one episode, she is forced to coach the team herself after the head coach, Ernie Denardo, is placed in the hospital. She also has constant battles with her General Manager/husband's nephew, who has dealings with the local mob, and fights off advances made by her quarterback (played by Geoffrey Scott).
The second season dealt with two themes: training camp and the playoffs. Barrow was dealing with her players taking recreational drugs during training camp. During this season, O. J. Simpson joined the cast as T.D. Parker, a veteran running back who is forced to make the transition from player to coach. Two real-life football stars made cameo appearances: Marcus Allen portrayed a rookie who was taking over T.D.'s spot on the team, and Vince Ferragamo played "Mainstreet" Manneti, a veteran quarterback. Jason Beghe joined the cast to play Tom Yinessa, a walk-on quarterback who deals with his overnight celebrity.
Delta Burke left the show midway through the third season, after committing herself exclusively to CBS' Designing Women, which she had begun starring on in 1986, and which was renewed. Diane loses control of the Bulls to Teddy Schraeder, her former lover, who manipulates everyone to his own ends. His antics include having T.D. fire Ernie as coach, letting Yinessa practice without a contract, and ignoring steroid use. Legal issues force him to leave the country and turn control over to his daughter, played by Leah Ayres.
Season 4 was briefly renamed 1st and Ten: The Bulls Mean Business. Shanna Reed joins the cast as the team's new female president, representing the new owners, the Dodds Corporation. Her attempts to innovate include bringing a female soccer player in to kick, and signing an Olympic sprinter as wide receiver. Joe Namath has a cameo appearance. Shannon Tweed would replace her in Season 5, and remain with the show to the end. The show was renamed 1st and Ten: Do it Again for the fifth season. The final season was 1st and Ten: In Your Face.
Series themes
The Bulls somehow manage to make it to the championship football game, yet lose in a controversial, heartbreaking man
|
https://en.wikipedia.org/wiki/.onion
|
.onion is a special-use top level domain name designating an anonymous onion service, which was formerly known as a "hidden service", reachable via the Tor network. Such addresses are not actual DNS names, and the .onion TLD is not in the Internet DNS root, but with the appropriate proxy software installed, Internet programs such as web browsers can access sites with .onion addresses by sending the request through the Tor network.
The purpose of using such a system is to make both the information provider and the person accessing the information more difficult to trace, whether by one another, by an intermediate network host, or by an outsider. Sites that offer dedicated .onion addresses may provide an additional layer of identity assurance via EV HTTPS Certificates. Provision of an onion site also helps mitigate SSL stripping attacks by malicious exit nodes on the Tor network upon users who would otherwise access traditional HTTPS clearnet sites over Tor.
Format
Addresses in the onion TLD are generally opaque, non-mnemonic, alpha-numerical strings which are automatically generated based on a public key when an onion service is configured. They used to be 16 characters long for the V2 onion services and they are 56 characters long for V3 onion services. These strings can be made up of any letter of the alphabet, and decimal digits from 2 to 7, representing in base32 either an 80-bit hash ("version 2", or 16-character) or a 256-bit ed25519 public key along with a version number and a checksum of the key and version number ("version 3", "next gen", or 56-character). As a result, in the past all combinations of sixteen base32 characters could potentially be valid version 2 addresses (though as the output of a cryptographic hash, a randomly selected string of this form having a corresponding onion service should be extremely unlikely), while in the current version 3 only combinations of 56 base32 characters that correctly encoded an ed25519 public key, a checksum, and a version number (i.e., 3) are valid addresses.
It is possible to set up a partially human-readable .onion URL (e.g. starting with an organization name) by generating massive numbers of key pairs (a computational process that can be parallelized) until a sufficiently desirable URL is found.
The "onion" name refers to onion routing, the technique used by Tor to achieve a degree of anonymity.
WWW to .onion gateways
Proxies into the Tor network like Tor2web allow access to onion services from non-Tor browsers and for search engines that are not Tor-aware. By using a gateway, users give up their own anonymity and trust the gateway to deliver the correct content. Both the gateway and the onion service can fingerprint the browser, and access user IP address data. Some proxies use caching techniques that claim to provide better page-loading than the official Tor Browser.
.exit (defunct pseudo-top-level domain)
.exit was a pseudo-top-level domain used by Tor users to indicate on the fly
|
https://en.wikipedia.org/wiki/OpenBSD%20security%20features
|
The OpenBSD operating system focuses on security and the development of security features. According to author Michael W. Lucas, OpenBSD "is widely regarded as the most secure operating system available anywhere, under any licensing terms."
API and build changes
Bugs and security flaws are often caused by programmer error. A common source of error is the misuse of the strcpy and strcat string functions in the C programming language. There are two common alternatives, strncpy and strncat, but they can be difficult to understand and easy to misuse, so OpenBSD developers Todd C. Miller and Theo de Raadt designed the strlcpy and strlcat functions. These functions are intended to make it harder for programmers to accidentally leave buffers unterminated or allow them to be overflowed. They have been adopted by the NetBSD and FreeBSD projects but not by the GNU C Library.
On OpenBSD, the linker has been changed to issue a warning when unsafe string manipulation functions, such as strcpy, strcat, or sprintf, are found. All occurrences of these functions in the OpenBSD source tree have been replaced. In addition, a static bounds checker is included in OpenBSD in an attempt to find other common programming mistakes at compile time. Other security-related APIs developed by the OpenBSD project include issetugid and arc4random.
Kernel randomization
In a June 2017 email, Theo de Raadt stated that a problem with stable systems was that they could be running for months at a time. Although there is considerable randomization within the kernel, some key addresses remain the same. The project in progress modifies the linker so that on every boot, the kernel is relinked, as well as all other randomizations. This differs from kernel ASLR; in the email he states that "As a result, every new kernel is unique. The relative offsets between functions and data are unique ... [The current] change is scaffolding to ensure you boot a newly-linked kernel upon every reboot ... so that a new random kernel can be linked together ... On a fast machine it takes less than a second ... A reboot runs the new kernel, and yet another kernel is built for the next boot. The internal deltas between functions inside the kernel are not where an attacker expects them to be, so he'll need better info leaks".
Memory protection
OpenBSD integrates several technologies to help protect the operating system from attacks such as buffer overflows or integer overflows.
Developed by Hiroaki Etoh, ProPolice is a GCC extension designed to protect applications from stack-smashing attacks. It does this through a number of operations: local stack variables are reordered to place buffers after pointers, protecting them from corruption in case of a buffer overflow; pointers from function arguments are also placed before local buffers; and a canary value is placed after local buffers which, when the function exits, can sometimes be used to detect buffer overflows. ProPolice chooses whether or not to pr
|
https://en.wikipedia.org/wiki/National%20Highways%20Authority%20of%20India
|
The National Highways Authority of India or NHAI () is an autonomous agency of the Government of India, set up in 1995 (Act 1988) and is responsible for management of a road network of over 50,000 km of National Highways out of 1,32,499 km in India. It is a nodal agency of the Ministry of Road Transport and Highways (MoRTH). NHAI has signed a memorandum of understanding (MoU) with the Indian Space Research Organisation (ISRO) for satellite mapping of highways.
History
The NHAI was created through the promulgation of the National Highways Authority of India Act, 1988. Section 16(1) of the Act states that the function of NHAI is to develop, maintain and manage the national highways and any other highways vested in, or entrusted to, it by the Government of India. On 10 February 1995, NHAI came into operations and was formally made an autonomous body. It is responsible for the development, maintenance and management of National Highways, totaling over in length. The NHAI is also responsible of the toll collection on several highways. Yogendra Narain was the first Chairman of NHAI in 1988. He is a retired IAS officer of Uttar Pradesh cadre. In June 2022, the NHAI created a Guinness World record by building 75 km of highway between Amravati and Akola in Maharashtra in a span of just 5 days.
Projects
The NHAI has the mandate to implement the National Highways Development Project (NHDP). The NHDP is under implementation in Phases.
Phase I: Approved in December 2000, at an estimated cost of ₹300 billion, it included the Golden Quadrilateral (GQ), portions of the NS-EW Corridors, and connectivity of major ports to National Highways.
Phase II: Approved in December 2003, at an estimated cost of ₹343 billion, it included the completion of the NS-EW corridors and another of highways.
Phase IIIA: This phase was approved in March 2005, at an estimated cost of ₹222 billion, it includes an upgrade to 4-lanes of of National Highways.
Phase IIIB: This was approved in April 2006, at an estimated cost of ₹543 billion, it includes an upgrade to 4-lanes of of National Highways.
Phase V: Approved in October 2006, it includes upgrades to 6-lanes for , of which is on the GQ. This phase is entirely on a DBFO basis.
Phase VI: This phase, approved in November 2006, will develop of expressways at an estimated cost of ₹ 167 billion.
Phase VII: This phase, approved in December 2007 will develop ring-roads, bypasses and flyovers to avoid traffic bottlenecks on selected stretches at a cost of ₹167 billion.
NHAI helps in implementing Special Accelerated Road Development Programme for North Eastern Region (SARDP-NE); a project to upgrade National Highways connecting state capitals to 2 lanes or 4 lanes in the north-eastern region.
Golden Quadrilateral
The Golden Quadrilateral is a highway network connecting many of the major industrial, agricultural and cultural centres of India. A quadrilateral of sorts is formed by connecting Chennai, Kolkata, Delhi and Mumbai,
|
https://en.wikipedia.org/wiki/WZBJ
|
WZBJ (channel 24) is a television station licensed to Danville, Virginia, United States, serving the Roanoke–Lynchburg market as an affiliate of MyNetworkTV. It is owned by Gray Television alongside Roanoke-licensed CBS affiliate WDBJ (channel 7). WZBJ and WDBJ share studios on Hershberger Road in northwest Roanoke; through a channel sharing agreement, the two stations transmit using WDBJ's spectrum from an antenna on Poor Mountain in Roanoke County.
WZBJ-CD (channel 24) in Lynchburg operates as a translator of WZBJ.
History
The channel 24 dial position was once occupied by WBTM-TV, which operated in the mid-to-late 1950s. The station only lasted a few years before attempting to become a hybrid commercial and educational station. This request to the FCC was denied, and the station went off the air not long after.
The station first signed on the air on August 18, 1994, as independent station WDRG (the calls standing for its broad service area of Danville, Roanoke and Greensboro, North Carolina). It was founded by MNE Broadcasting, a locally based company owned by businessman Melvin N. Eleazer. Three months after its sign-on, in November 1994, MNE Broadcasting reached an agreement with Time Warner to become the WB affiliate for the Roanoke DMA; the station joined The WB upon the network's launch on January 11, 1995. On January 1, 1997 (as the FCC was switching from using Arbitron's ADI to Nielsen's DMA system to determine which counties remained part of the Roanoke–Lynchburg market, then ranked as the 67th largest in the United States), WDRG changed its call letters to WDRL-TV, standing for Danville–Roanoke–Lynchburg. On that date, the station concurrently became the UPN affiliate for southwestern Virginia; the WB affiliation moved to primary Fox affiliate WFXR (channel 27) and Lynchburg-based satellite WJPR (channel 21), which carried the network's programming on a secondary basis in late night. (Cable viewers could still see The WB at its regular time on WGN-TV's former superstation feed, and programming would later move to cable-only "WBVA-TV", a charter affiliate of The WeB [later known as The WB 100+ Station Group], when it launched on Cox Communications' Roanoke system on September 21, 1998.)
Shortly after this change, WDRL signed on a low-power translator in Roanoke, W54BT (channel 54), to relay WDRL's syndicated and UPN programming into Roanoke, Lynchburg, and the New River Valley. On March 31, 2005, the FCC ordered the Roanoke translator to cease operations to make way for repurposing the frequency for cellular phone signal relays. The transmitter would soon return to the air on UHF channel 24, broadcasting at the same effective radiated power, but with a more directional antenna to protect WDRL's primary analog transmitter.
On January 24, 2006, the Warner Bros. Entertainment unit of Time Warner and CBS Corporation announced that the two companies would shut down The WB and UPN and combine the networks' respective programming to crea
|
https://en.wikipedia.org/wiki/Conviction%20%28Angel%29
|
"Conviction" is the first episode of season 5 in the television show Angel, originally broadcast on the WB network. In this episode, Wolfram & Hart C.E.O. Angel and the rest of the group cope with their new, morally ambiguous lifestyle. Their client - an unsavory, violent gangster - threatens to unleash a virus if they fail to keep him out of jail. Biological warfare is averted when Gunn uses the knowledge of the law that Wolfram & Hart mystically bestowed upon him to prevent the gangster from being incarcerated.
Plot
Angel saves a woman from a vampire in an alley; however, thanks to a tracking device, Wolfram & Hart lawyers surround the scene. Angel is admonished because the dead vampire worked for the firm's clients.
At Wolfram & Hart, Fred gets lost en route to her office. Wesley finds her and she tells him that her lab is “giganamous” and she's unsure of the function of most of the machines in it. Her assistant Knox catches up to Fred; Wesley tries to make conversation by asking him how long he's been evil. After Knox leads Fred to her office, Gunn meets up with Wesley, who complains that Fred called her lab assistant “Knoxy”. Gunn admits that though he doesn't belong there, they can turn things around and make them better. Lorne passes by, proving that he's extremely comfortable in this new setting. Meanwhile, Angel's liaison to the Senior Partners introduces herself as Eve; she tosses him an apple to drive home the irony of her name. She points out that if he wants to use Wolfram & Hart's power to do good in L.A., he will have to be prepared to do some bad too, saying, "In order to keep this place running, you have to keep it, well, running." Angel responds with a simple bite of the apple.
In his office, Gunn encounters Eve, who says that things were a lot simpler when he was just hunting vamps on the street with his gang. She wonders if he's ready for “the next step” and he confirms that he is; she hands him a business card and says, “You’ll feel like a new man.”
The next day, Angel is unhappy to learn his new secretary is ditzy vampire Harmony Kendall (last seen on Angel in "Disharmony" and on Buffy in "Crush"); she tells him, “I’m strong, I’m quick, I’m incredibly sycophantic - if that means what that guy said - and I type like a superhero…if there was a superhero whose power was typing.” Angel notes that the blood she's brought him tastes good; she tells him that the secret ingredient is otter. Wesley arrives, explaining he picked Harmony from the pool because he thought he would like having someone familiar around. “You turned evil a lot faster than I thought you would,” Angel replies. Harmony's happy to be reunited with the group, especially Cordelia, until Angel breaks the news that Cordelia is in a coma.
Harmony brings in client Corbin Fries, on trial for smuggling in girls for prostitution and cheap labor. He readily admits he's guilty; when Angel says he has no incentive to keep him out of jail, Fries says, “Either you get me
|
https://en.wikipedia.org/wiki/Hell%20Bound%20%28Angel%29
|
"Hell Bound" is episode 4 of season 5 in the television show Angel, originally broadcast on the WB network. It was the only Angel episode to carry a warning of graphic violence before it was first aired. In this episode, the spirit of Pavayne – a brutal surgeon who uses magic to send the loose spirits of Wolfram & Hart to Hell in his place – torments Spike. Fred invents a one-time use machine to make Spike corporeal, but Spike ends up pushing Pavayne into the machine to protect Fred.
Plot
As Fred is working late in the science lab, Spike complains at how he cannot pick things up and scare people as a ghost. Fred argues that he is not a ghost, then notes that the temperature of the heat he radiates has dropped slightly. She promises again that she will not let him stay in the netherworld and will make him corporeal if she can defy some laws of nature. Spike disappears, winding up in the basement, where he hears a chopping sound and goes to investigate. He finds a man with a cut-up face chopping off his own fingers; he does a double take and the man disappears. Elsewhere in the building, Lorne negotiates a deal as he passes Fred. Fred heads to Wesley's office and requests some books. He tells her that he will get them for her if she agrees to have a real dinner, since she has been frequently eating takeout and working late. Eve takes Fred to Angel's office, where they discuss the amount of money Fred's department has been spending. Fred admits that she has to spend a lot to try to make Spike corporeal again; Angel says that he asked her to try to get him out of Wolfram & Hart. She reminds him that they were supposed to take over the firm to do good, but, of course, Angel says that that has nothing to do with Spike. Fred says that Spike is a champion, like Angel, but Angel has tired of the word "champion". She thinks that Spike would fight on their side if he could; Angel disagrees. He adds that the second he can, Spike is going to run off to Buffy. Fred thinks he is jealous and assures him that she is immune to Spike's charms - she just wants to help him. Angel replies that some people cannot be saved.
Spike reappears in the lab and notices a buzzing lamp and a looming shadow. As he heads down a hallway, the lights start going out and he hears a woman crying. He encounters a woman from the 19th century without arms; she disappears like the fingerless man. Upstairs, Spike meets up with Angel, who thinks that Spike is starting to feel how close he is to Hell. Spike says that it cannot be a big deal, since Angel managed to escape, but Angel says that he did not, he just got a reprieve. Spike says that Fred told him about the Shanshu Prophecy, which Angel says is not real because there is no such thing as destiny. He thinks that the evil things they did in the past are the only things that will wind up mattering. Spike asks why they should even bother to try to make good and Angel says they have no other choice. Spike suddenly sees a man hanging from
|
https://en.wikipedia.org/wiki/The%20Cautionary%20Tale%20of%20Numero%20Cinco
|
"The Cautionary Tale of Numero Cinco" is episode 6 of season 5 in the television show Angel. Written and directed by Jeffrey Bell, it was originally broadcast on November 5, 2003 on the WB network.
Plot
On the Mexican Day of the Dead, Angel has a run-in with a masked Wolfram & Hart employee. He is connected to an Aztec warrior demon named Tezcatcatl, who preys on the hearts of heroes. This leads Angel to wrestle with some personal issues when he learns about 'Los Hermanos Numeros', a family of five Mexican luchadores who helped the helpless until one day four were slain by Tezcatcatl. Angel helps the last member 'Number Five', the aforementioned employee, to discover the hero inside, which he lost when his family were killed. Angel, Five and his four brothers, temporarily back from the dead, battle and kill the demon. This leads to the death of Number Five, who is escorted into the afterlife by his brothers.
Meanwhile, Spike researches the Shanshu Prophecy about a vampire becoming human and thinks that he, not Angel, may be the vampire who will become human.
Production
Writer/director Jeffrey Bell explains that he always wanted to work Mexican wrestling into one of his The X-Files scripts, but it wasn't until he pitched the idea to creator Joss Whedon that he was able to realize his "lifelong dream - to tell a story about Mexican wrestlers." The inspiration for the episode came partly from the real life Mexican wrestler Santo whose career included film roles as masked "luchador" fighting vampires and other supernatural foes, one of whose films was used in the Mystery Science Theater 3000 episode "Samson vs. the Vampire Women".
When Number Five is in the bar and Holland Manners holds out a Wolfram & Hart business card, there is a grammatical error on the multi-dimensional law-firm's calling card. It reads 'Attorney's at Law' as opposed to 'Attorneys at Law.'
The Wilhelm scream can be heard approximately one minute into the episode.
Continuity
In the non-canonical comic Spike: Old Wounds, Spike reveals that he actually met Los Hermanos Numeros in 1947, and chose not to tell the others.
While explaining why he no longer believes in the Shanshu prophecy, Angel mentions the fake prophecy made by Sahjhan that caused Wesley to betray Angel Investigations in season 3. Due to having his memory altered in the fourth season finale, Wesley doesn't understand what Angel is talking about.
Number Five can be seen in several previous episodes but this is the first time he has any dialogue. This episode also marks Number Five's last appearance.
When Number Five is approached by a Wolfram & Hart employee at the bar after his brothers' deaths the business card shows that the employee is actually Holland Manners, but Holland Manners would have been only 7 years old at the time of the brothers' deaths.
When Angel visited Number Five at his home, he never invited Angel into his home before grabbing Angel and throwing him against the wall inside his kitchen.
|
https://en.wikipedia.org/wiki/Single-machine%20scheduling
|
Single-machine scheduling or single-resource scheduling is an optimization problem in computer science and operations research. We are given n jobs J1, J2, ..., Jn of varying processing times, which need to be scheduled on a single machine, in a way that optimizes a certain objective, such as the throughput.
Single-machine scheduling is a special case of identical-machines scheduling, which is itself a special case of optimal job scheduling. Many problems, which are NP-hard in general, can be solved in polynomial time in the single-machine case.
In the standard three-field notation for optimal job scheduling problems, the single-machine variant is denoted by 1 in the first field. For example, " 1||" is an single-machine scheduling problem with no constraints, where the goal is to minimize the sum of completion times.
The makespan-minimization problem 1||, which is a common objective with multiple machines, is trivial with a single machine, since the makespan is always identical. Therefore, other objectives have been studied.
Minimizing the sum of completion times
The problem 1|| aims to minimize the sum of completion times. It can be solved optimally by the Shortest Processing Time First rule (SPT): the jobs are scheduled by ascending order of their processing time .
The problem 1|| aims to minimize the weighted sum of completion times. It can be solved optimally by the Weighted Shortest Processing Time First rule (WSPT): the jobs are scheduled by ascending order of the ratio .
The problem 1|chains| is a generalization of the above problem for jobs with dependencies in the form of chains. It can also be solved optimally by a suitable generalization of WSPT.
Minimizing the cost of lateness
The problem 1|| aims to minimize the maximum lateness. For each job j, there is a due date . If it is completed after its due date, it suffers lateness defined as . 1|| can be solved optimally by the Earliest Due Date First rule (EDD): the jobs are scheduled by ascending order of their deadline .
The problem 1|prec| generalizes the 1|| in two ways: first, it allows arbitrary precedence constraints on the jobs; second, it allows each job to have an arbitrary cost function hj, which is a function of its completion time (lateness is a special case of a cost function). The maximum cost can be minimized by a greedy algorithm known as Lawler's algorithm.
The problem 1|| generalizes 1|| by allowing each job to have a different release time by which it becomes available for processing. The presence of release times means that, in some cases, it may be optimal to leave the machine idle, in order to wait for an important job that is not released yet. Minimizing maximum lateness in this setting is NP-hard. But in practice, it can be solved using a branch-and-bound algorithm.
Maximizing the profit of earliness
In settings with deadlines, it is possible that, if the job is completed by the deadline, there is a profit pj. Otherwise, there is no profit. The go
|
https://en.wikipedia.org/wiki/AHX
|
AHX may refer to:
.AHX, a module file format originating on Amiga computers
Amakusa Airlines (ICAO:AHX), a Japanese airline
American History X, a 1998 film
Aminohexanoic acid (Ahx), also known as Aminocaproic acid
Renault AHx, a range of light/medium trucks
, in Middlesex, England
A file format sister to ADX
|
https://en.wikipedia.org/wiki/Fast%20loader
|
A fast loader is a software program for a home computer, such as the Commodore 64 or ZX Spectrum, that accelerates the speed of file loading from floppy disk or compact cassette.
Floppy disks
Fast loaders came about because of a discrepancy between the actual speed at which floppy drives could transfer data and the speed that was provided by the operating system's default routines. This discrepancy was most pronounced on the VIC-20 and Commodore 64. While the earlier Commodore PET series had used an industry-standard IEEE-488 parallel bus, this was replaced with a custom Commodore serial bus on the VIC-20. The serial bus was intended to be nearly as fast as its predecessor, due to the use of the 6522 VIA as a hardware shift register on both the drive and computer. However, hardware bugs were discovered in the 6522 that prevented this function from working consistently. As a result, the KERNAL ROM routines were hastily rewritten to transfer a single bit at a time, using a slow software handshaking protocol.
Although the C64 replaced the 6522 VIA with two 6526 CIA chips, which did not suffer from this bug, the companion 1541 disk drive still had a 6522 VIA. Commodore chose not to redesign the 1541 hardware, also in order to retain backward compatibility with VIC-20 peripherals; this however came at the expense of speed. Because of the transfer protocol, the Commodore 1540 and 1541 disk drives soon gained a reputation for extreme slowness. Only at the introduction of the Commodore 128 computer and the Commodore 1571 disk drive was the original plan put into action and a hardware shift register was used, reducing the need for special fast loaders.
Soon after the C64's release, some astute programmers realized that Commodore's bit-banging serial KERNAL routines were unnecessarily sluggish. Since the CPU in the C64 ran at approximately the same speed as that in the 1541 disk drive, it was sufficient to synchronize only at the beginning of each byte, rather than at each individual bit. Moreover, this transfer method allowed two bits to be sent simultaneously, one over the standard DATA line and one over the CLK line (which was normally used to perform the handshaking). On the C64, this required very careful timing to avoid interference from interrupts and from the VIC-II graphics chip, which could "steal" CPU cycles. Some fast loaders disabled interrupts and blanked the screen for this reason. A fast loader would generally "wedge" itself into the LOAD vector at $0330, thus intercepting any calls to the KERNAL LOAD routine. Next, the fast loader would transfer the necessary code into the drive RAM and order its execution, then receive the file sent by the altered transfer code. Depending on the exact nature of the routines used, the loading speed could be improved by as much as a factor of five.
This technique was used for a few of the many fast-load systems made (such as JiffyDOS). Others were simply more efficient in I/O and file handling, offeri
|
https://en.wikipedia.org/wiki/TV5
|
TV5 may refer to the following television channels, networks and stations:
TV5 (Finnish TV channel), a Finnish television channel owned by SBS Discovery Media
TV5 (India), Telugu-language 24-hour news channel
TV5 (Latvia), former television channel in Latvia
TV5 Mongolia, Mongolia based nationwide broadcasting network
TV5 Network, Filipino media company based in Mandaluyong.
TV5 (Philippine TV network), television network in the Philippines
TV5Monde, French-language global television channel commonly referred to as "TV5" or "Telecinq"
TV5 Québec Canada, Canada-based French-language television channel, which partners with TV5Monde
TV5, a cable subscription channel of Macedonian Boom TV now Vip TV
See also
Channel 5 (disambiguation)
|
https://en.wikipedia.org/wiki/Neighbour-sensing%20model
|
The Neighbour-Sensing mathematical model of hyphal growth is a set of interactive computer models that simulate the way fungi hyphae grow in three-dimensional space. The three-dimensional simulation is an experimental tool which can be used to study the morphogenesis of fungal hyphal networks.
The modelling process starts from the proposition that each hypha in the fungal mycelium generates a certain abstract field that (like known physical fields) decreases with increasing distance. Both scalar and vector fields are included in the models. The field(s) and its (their) gradient(s) are used to inform the algorithm that calculates the likelihood of branching, the angle of branching and the growth direction of each hyphal tip in the simulated mycelium. The growth vector is being informed of its surroundings so, effectively, the virtual hyphal tip is sensing the neighbouring mycelium. This is why we call it the Neighbour-Sensing model.
Cross-walls in living hyphae are formed only at right angles to the long axis of the hypha. A daughter hyphal apex can only arise if a branch is initiated. So, for the fungi, hyphal branch formation is the equivalent of cell division in animals, plants and protists. The position of origin of a branch, and its direction and rate of growth are the main formative events in the development of fungal tissues and organs. Consequently, by simulating the mathematics of the control of hyphal growth and branching the Neighbour-Sensing model provides the user with a way of experimenting with features that may regulate hyphal growth patterns during morphogenesis to arrive at suggestions that could be tested with live fungi.
The model was proposed by Audrius Meškauskas and David Moore in 2004 and developed using the supercomputing facilities of the University of Manchester.
The key idea of this model is that all parts of the fungal mycelium have identical field generation systems, field sensing mechanisms and growth direction altering algorithms. Under properly chosen model parameters it is possible to observe the transformation of the initial unordered mycelium structure into various forms, some of them being very like natural fungal fruit bodies and other complex structures.
In one of the simplest examples, it is assumed that the hyphal tips try to keep a 45 degree orientation with relation to the Earth’s gravity vector field, and also generate some kind of scalar field that the growing tips try to avoid. This combination of parameters leads to development of hollow conical structures, similar to the fruit bodies of some primitive fungi.
In another example, the hypha generates a vector field parallel to the hyphal axis, and the tips tend to turn parallel to that field. After more tips turn in the same direction, their hyphae form a stronger directional field. In this way, it is possible to observe spontaneous orientation of growing hypha in a single direction, which simulates the strands, cords and rhizomorphs produced by m
|
https://en.wikipedia.org/wiki/Memotech%20MTX
|
The Memotech MTX500 and MTX512 were a range of 8-bit Zilog Z80A based home computers released by the British company Memotech in 1983 and sold mainly in the UK, France, Germany and Scandinavia. Originally a manufacturer of memory add-ons for Sinclair machines, Memotech developed their own competing computer when it was perceived the expansion pack business would no longer be viable.
The Memotech machines were technically similar to, although not compatible with, the MSX standard, making use of the same CPU and video chip. The machines were particularly distinguished from other microcomputers available at the time by the generous maximum memory ceiling. The 500 and 512 models could be expanded internally up to 512K, an unusually large amount of RAM in 1983 for a computer aimed at home use.
The MTX range saw the addition of the RS128 in 1984 which was a similar machine but with more memory. The machines achieved only modest sales, not assisted by the unfortunate timing of being released shortly before a period of reducing interest in UK home micro purchases through 1984, when a number of other British micro manufacturers entered financial difficulties. The MTX was selling into a highly competitive space, with the much cheaper Sinclair ZX Spectrum finding favour with home users, the BBC Micro conquering the education market and the IBM PC making inroads into becoming a standard for business.
The prospect of a very large contract with the Soviet Union was on the horizon by 1985 and a Russian version of the machine was designed, complete with a bright red case. This could have been the saviour of the range but ultimately the deal fell through and Memotech entered bankruptcy. The company was subsequently relaunched and the final version of the machine was the MTX512 Series 2 released in 1986, produced mainly as a way of using up stocks of parts before the business moved on to other ventures.
The MTX512 (together with the FDX floppy drive peripheral) is remembered for an appearance in the 1985 comedy movie Weird Science where it had a central role in the plot, being used to conjure the character Lisa played by Kelly LeBrock.
Technical Specifications
The MTX500 was fitted as standard with 32 KB of user RAM, while the MTX512 had 64KB, and the RS128 had 128KB. An additional 16KB of dedicated video RAM was also present. By contrast, many other machines of the era used a non-trivial fraction of the advertised total memory for video display and the RAM available to the user was less than it may have seemed.
All machines had a Zilog Z80A CPU running at 4 MHz which could only address a maximum of 64KB at any one time, larger amounts of RAM were accessed through bank switching.
The machine featured TMS9918 or 9928 graphic chips, providing a 256 x 192 resolution, 16 color display and up to 32 sprites. A SN76489A sound chip generated 3 voices plus a pink noise channel with a 6 octave range.
The system interfaces offered were a Centronics printer port, tw
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.