source
stringlengths 32
199
| text
stringlengths 26
3k
|
|---|---|
https://en.wikipedia.org/wiki/Author%20Domain%20Signing%20Practices
|
In computing, Author Domain Signing Practices (ADSP)
is an optional extension to the DKIM E-mail authentication
scheme, whereby a domain can publish the signing practices it adopts when relaying mail on behalf of associated authors.
ADSP was adopted as a standards track RFC 5617 in August 2009, but declared "Historic" in November 2013 after "...almost no deployment and use in the 4 years since..."
Concepts
Author address
The author address is the one specified in the header field defined in RFC 5322. In the unusual cases where more than one address is defined in that field, RFC 5322 provides for a field to be used instead.
The domains in 5322-From addresses are not necessarily the same as in the more elaborated Purported Responsible Address covered by Sender ID specified in RFC 4407. The domain in a 5322-From address is also not necessarily the same as in the envelope sender address defined in RFC 5321, also known as SMTP MAIL FROM, envelope-From, 5321-From, or , optionally protected by SPF specified in RFC 7208.
Author Domain Signature
An Author Domain Signature is a valid DKIM signature in which the domain name of the DKIM signing entity, i.e., the d tag in the DKIM-Signature header field, is the same as the domain name in the author address.
This binding recognizes a higher value for author domain signatures than other valid signatures that may happen to be found in a message. In fact, it proves that the entity that controls the DNS zone for the author — and hence also the destination of replies to the message's author — has relayed the author's message. Most likely, the author has submitted the message through the proper message submission agent. Such message qualification can be verified independently of any published domain signing practice.
Author Domain Signing Practices
The practices are published in a DNS record by the author domain. For an author address , it may be set as
_adsp._domainkey.example.com. in txt "dkim=unknown"
Three possible signing practices are provided for:
unknown, which is the same as not defining any record, says the domain might sign some, most, or all email,
all says all mail from the domain is signed with an Author Domain Signature,
discardable says all mail from the domain is signed with an Author Domain Signature; furthermore, if such signature is missing or invalid, the domain owners want the receiving server to drop the message; that is, silently throw it away.
Caveat
The ADSP specification explicitly discourages publishing a record different from "unknown" for domains who have independent users and a usage policy that does not explicitly restrict them to sending mail only from designated mail servers, since mail sent independently of the organization will not be signed.
However explicitly that caveat is worded, it is not straightforward to understand the purpose and the limitations of ADSP. One of ADSP's authors holds that it is better to publish private lists of discardable domains, main
|
https://en.wikipedia.org/wiki/Micro%20Cornucopia
|
Micro Cornucopia, sometimes shortened to Micro C, was a 1980s magazine for microcomputer hobbyists and enthusiasts. It was published in Bend, Oregon by former Tektronix engineer David J. Thompson.
The magazine, conceived as a newsletter for users of the Ferguson Big Board (a single-board CP/M computer), was published bi-monthly beginning in July 1981. It soon expanded its coverage to other board-level computers, the Kaypro computer, and general hobbyist/experimental computing, with special interest areas being robotics, interfacing, embedded systems and programming languages. The magazine routinely published circuit diagrams and source code.
Micro C carried articles on a wide range of subjects, some system-specific and newsletter-like, but also covering (then) off-mainstream topics, e.g. 3D graphics, artificial intelligence, or the special needs of disabled users. They published a 32-page catalog of CP/M and MS-DOS software, cover date Fall/Winter 1986, describing it as the second, the first having been the Spring issue.
The publishers of Micro C organized free annual user conference dubbed "SOG" (Semi-Official Get-together) in Oregon.
Final issue
In issue 53, May 1990, Thompson wrote, "I'm closing down Micro C and I don't know what I'll be doing next." He explained his loss of interest in the magazine, and subscribers were offered the choice to switch to one of several other magazines, including Computer Language.
Personnel
Publisher: David J. Thompson
Technical Editor: Larry Fogg
Regular contributors & staff:
Scott Robert Ladd
Bruce Eckel
Tony & Becky Ozrelic
References
External links
Issue 12, June 1983 page images
1980s establishments in Oregon
1990 disestablishments in Oregon
Defunct computer magazines published in the United States
Magazines established in 1981
Magazines disestablished in 1990
Magazines published in Oregon
Robotics magazines
|
https://en.wikipedia.org/wiki/Cellular%20architecture
|
Cellular architecture is a type of computer architecture prominent in parallel computing. Cellular architectures are relatively new, with IBM's Cell microprocessor being the first one to reach the market. Cellular architecture takes multi-core architecture design to its logical conclusion, by giving the programmer the ability to run large numbers of concurrent threads within a single processor. Each 'cell' is a compute node containing thread units, memory, and communication. Speed-up is achieved by exploiting thread-level parallelism inherent in many applications.
Cell, a cellular architecture containing 9 cores, is the processor used in the PlayStation 3. Another prominent cellular architecture is Cyclops64, a massively parallel architecture currently under development by IBM.
Cellular architectures follow the low-level programming paradigm, which exposes the programmer to much of the underlying hardware. This allows the programmer to greatly optimize their code for the platform, but at the same time makes it more difficult to develop software.
See also
Cellular automaton
External links
Cellular architecture builds next generation supercomputers
ORNL, IBM, and the Blue Gene Project
Energy, IBM are partners in biological supercomputing project
Cell-based Architecture
Parallel computing
Computer architecture
Classes of computers
|
https://en.wikipedia.org/wiki/Gustafson%27s%20law
|
In computer architecture, Gustafson's law (or Gustafson–Barsis's law) gives the speedup in the execution time of a task that theoretically gains from parallel computing, using a hypothetical run of the task on a single-core machine as the baseline. To put it another way, it is the theoretical "slowdown" of an already parallelized task if running on a serial machine. It is named after computer scientist John L. Gustafson and his colleague Edwin H. Barsis, and was presented in the article Reevaluating Amdahl's Law in 1988.
Definition
Gustafson estimated the speedup of a program gained by using parallel computing as follows:
where
is the theoretical speedup of the program with parallelism (scaled speedup);
is the number of processors;
and are the fractions of time spent executing the serial parts and the parallel parts of the program on the parallel system, where .
Alternatively, can be expressed using :
Gustafson's law addresses the shortcomings of Amdahl's law, which is based on the assumption of a fixed problem size, that is of an execution workload that does not change with respect to the improvement of the resources. Gustafson's law instead proposes that programmers tend to increase the size of problems to fully exploit the computing power that becomes available as the resources improve.
Gustafson and his colleagues further observed from their workloads that time for the serial part typically does not grow as the problem and the system scale, that is, is fixed. This gives a linear model between the processor count and the speedup with slope , as shown in the figure above (which uses different notations: for and for ). Also, scales linearly with rather than exponentially in the Amdahl's Law. With these observations, Gustafson "expect[ed] to extend [their] success [on parallel computing] to a broader range of applications and even larger values for ".
The impact of Gustafson's law was to shift research goals to select or reformulate problems so that solving a larger problem in the same amount of time would be possible. In a way the law redefines efficiency, due to the possibility that limitations imposed by the sequential part of a program may be countered by increasing the total amount of computation.
Derivation
The execution time of a program running on a parallel system can be split into two parts:
a part that does not benefit from the increasing number of processors (serial part);
a part that benefits from the increasing number of processors (parallel part).
Example. — A computer program that processes files from disk. A part of that program may scan the directory of the disk and create a list of files internally in memory. After that, another part of the program passes each file to a separate thread for processing. The part that scans the directory and creates the file list cannot be sped up on a parallel computer, but the part that processes the files can.
Without loss of generality, let the total execution time
|
https://en.wikipedia.org/wiki/Portable%20Standard%20Lisp
|
Portable Standard Lisp (PSL) is a programming language, a dialect of the language Lisp. PSL was inspired by its predecessor, Standard Lisp and the Portable Lisp Compiler. It is tail-recursive, late binding (or dynamically bound), and was developed by researchers at the University of Utah in 1980, which released PSL 3.1; development was handed over to developers at Hewlett-Packard in 1982 who released PSL 3.3 and up. Portable Standard Lisp was available as a kit containing a screen editor, a compiler, and an interpreter for several hardware and operating system computing platforms, including Motorola 68000 series, DECSYSTEM-20s, Cray-1s, VAX, and many others. Today, PSL is mainly developed by and available from Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB). Its main modern use is as the underlying language for implementations of Reduce.
Like most older Lisps, in the first step, PSL compiles Lisp code to LAP code, which is another cross-platform language. However, where older lisps mostly compiled LAP directly to assembly language or some architecture dependent intermediate, PSL compiles the LAP to C code, which would run in a virtual machine language; so programs written in it are as portable as C in principle, which is very portable. The compiler was written in PSL or a more primitive dialect named System Lisp or SYSLISP as "... an experiment in writing a production-quality Lisp in Lisp itself as much as possible, with only minor amounts of code written by hand in assembly language or other systems languages." so the whole ensemble could bootstrap itself, and improvements to the compiler improved the compiler. Some later releases had a compatibility package for Common Lisp, but this is not sustained in the modern versions.
Criticism
Portable Standard Lisp has fewer features than other Lisps, such as Common Lisp, and some people found it unpleasant to use. Richard P. Gabriel wrote in his popular essay Lisp: Good News, Bad News, How to Win Big, "the third most standard Lisp was Portable Standard Lisp, which ran on many machines, but very few people wanted to use it;".
Timeline
References
External links
, Portable Utah Standard Lisp
Concurrent programming languages
Dynamically typed programming languages
Functional languages
Lisp programming language family
Multi-paradigm programming languages
|
https://en.wikipedia.org/wiki/Handel-C
|
Handel-C is a high-level programming language which targets low-level hardware, most commonly used in the programming of FPGAs. It is a rich subset of C, with non-standard extensions to control hardware instantiation with an emphasis on parallelism. Handel-C is to hardware design what the first high-level programming languages were to programming CPUs. Unlike many other design languages that target a specific architecture Handel-C can be compiled to a number of design languages and then synthesised to the corresponding hardware. This frees developers to concentrate on the programming task at hand rather than the idiosyncrasies of a specific design language and architecture.
Additional features
The subset of C includes all common C language features necessary to describe complex algorithms. Like many embedded C compilers, floating point data types were omitted. Floating point arithmetic is supported through external libraries that are very efficient.
Parallel programs
In order to facilitate a way to describe parallel behavior some of the CSP keywords are used, along with the general file structure of Occam.
For example:
par {
++c;
a = d + e;
b = d + e;
}
Channels
Channels provide a mechanism for message passing between parallel threads. Channels can be defined as asynchronous or synchronous (with or without an inferred storage element respectively). A thread writing to a synchronous channel will be immediately blocked until the corresponding listening thread is ready to receive the message. Likewise the receiving thread will block on a read statement until the sending thread executes the next send. Thus they may be used as a means of synchronizing threads.
par {
chan int a; // declare a synchronous channel
int x;
// begin sending thread
seq (i = 0; i < 10; i++) {
a ! i; // send the values 0 to 9 sequentially into the channel
}
// begin receiving thread
seq (j = 0; j < 10; j++) {
a ? x; // perform a sequence of 10 reads from the channel into variable x
delay; // introduce a delay of 1 clock cycle between successive reads
// this has the effect of blocking the sending thread between writes
}
}
Asynchronous channels provide a specified amount of storage for data passing through them in the form of a FIFO. Whilst this FIFO neither full nor empty, both sending and receiving threads may proceed without being blocked. However, when the FIFO is empty, the receiving thread will block at the next read. When it is full, the sending thread will block at the next send. A channel with actors in differing clock domains is automatically asynchronous due to the need for at least one element of storage to mitigate metastability.
A thread may simultaneously wait on multiple channels, synchronous or asynchronous, acting upon the first one available given a specified order of priority or optionally executing an alternate path if none is ready.
Scope and variable
|
https://en.wikipedia.org/wiki/ODMRP
|
In wireless networking, On-Demand Multicast Routing Protocol is a protocol for routing multicast and unicast traffic throughout Ad hoc wireless mesh networks.
ODMRP creates routes on demand, rather than proactively creating routes as OLSR does. This suffers from a route acquisition delay, although it helps reduce network traffic in general. To help reduce the problem of this delay, some implementations send the first data packet along with the route discovery packet.
Because some links may be asymmetric, the path from one node to another is not necessarily the same as the reverse path of these nodes.
See also
AODV
List of ad hoc routing protocols
Mesh Networks
External links
IETF Draft The latest draft specification published by the IETF
Original publication The first paper presenting ODMRP.
Wireless networking
Routing
Routing algorithms
Ad hoc routing protocols
|
https://en.wikipedia.org/wiki/WMHK
|
WMHK (89.7 FM) is a non-commercial Christian radio station in Columbia, South Carolina. It is owned and operated by the Educational Media Foundation. Its programming is Contemporary Christian music programmed from K-LOVE studios in Rocklin, California.
WMHK is one of South Carolina's most powerful stations. It provides at least grade B coverage to much of the South Carolina portions of the Charlotte and Augusta areas, and can be heard clearly as far east as Florence and as far west as Union.
History
Columbia International University signed WMHK on the air August 30, 1976 with a vision to share the Gospel through the airwaves. Until its sale to the Educational Media Foundation, it was unique in the sense that it was locally owned and operated, while most radio stations in Columbia are corporate owned. During its time as a locally owned station, WMHK enjoyed much higher ratings than most other CCM stations.
Jim Marshall, former general manager of WMHK, was responsible for the revitalization of the station, changing the format from the older-style Christian music and adding a contemporary feel to the broadcasts. Under his direction, WMHK became one of the most popular CCM stations in the country, and was the first South Carolina station to win a Marconi Award. The morning show and the afternoon drive program became more sophisticated, featuring local weather personalities like WOLO Meteorologist Reg Taylor and live local traffic reports from WIS' Traffic Command center, as well as news updates from its own award-winning news department with Bob Holmes and Dwight Moffitt. Since then, staffing changes saw the departure of long-time morning host Rusty Rabon, who left for the ministry, along with the eventually closing of the news department. Marshall left in 2005 to become general manager of WAY-FM in West Palm Beach, FL. For many years, its "Family Friendly Morning Show" with Steve Sunshine and Amy Byrd was among the top rated in the Columbia market among women ages 25–54.
Jerry Grimes, former Marketing Director at WIS, succeeded Marshall as General Manager in July 2005. Under his direction, there were a few staffing changes, including the promotion of Steve Sunshine to Program Director in August 2006 after long-time Program Director Tom Greene left the station to go to WMIT. Under Grimes, WMHK was also named "Station of the Year" by the Christian Music Broadcasters (CMB) in 2006 and 2007. After Jerry Grimes departed to join WAY-FM in Florida, John Owens replaced him, leading the station to another Station of the Year award in 2009.
In 2010, after Steve Sunshine left to start a new station in Austin, Texas (Spirit 105.9), Jeff Cruz was hired as the new Program Director.
During its time under CIU ownership, WMHK was a sister station to WRCM in Charlotte, North Carolina. It was largely programmed separately from WMHK, but WMHK did share WRCM's "It's A New Day" Morning Show with Eric & Heather, which was also syndicated to the WORD-FM radio
|
https://en.wikipedia.org/wiki/Mind%20uploading%20in%20fiction
|
Mind uploading, whole brain emulation, or substrate-independent minds, is a use of a computer or another substrate as an emulated human brain. The term "mind transfer" also refers to a hypothetical transfer of a mind from one biological brain to another. Uploaded minds and societies of minds, often in simulated realities, are recurring themes in science-fiction novels and films since the 1950s.
Early and particularly important examples
A story featuring an artificial brain that replicates the personality of a specific person is "The Infinite Brain" by John Scott Campbell, written under the name John C. Campbell, and published in the May 1930 issue of Science Wonder Stories. The artificial brain is created by an inventor named Anton Des Roubles, who tells the narrator that "I am attempting to construct a mechanism exactly duplicating the mechanical and electrical processes occurring in the human brain and constituting the phenomena known as thought." The narrator later learns that Des Roubles has died, and on visiting his laboratory, finds a machine that can communicate with him via typed messages, and which tells him "I, Anton Des Roubles, am dead—my body is dead—but I still live. I am this machine. These racks of apparatus are my brains, which is thinking even as yours is. Anton Des Roubles is dead but he has built me, his exact mental duplicate, to carry on his life and work." The machine also tells him "He made my brain precisely like his, built three hundred thousand cells for my memory, and filled two hundred thousand of them with his own knowledge. I have his personality; it is my own through a process I will tell you of later. ... I think just as you do. I have a consciousness as have other men." He then explains his discovery that the electrical impulses in the brain create magnetic fields that can be detected by a device he built called a "Telepather", and that "[t]hrough this instrument any one's mental condition can be exactly duplicated." Later, he enlists the narrator's help in constructing a new type of artificial brain that will retain his memories but possess an expanded intellect, though the experiment does not go as planned, as the new intelligence has a radically different personality and soon sets out to conquer the world.
An early story featuring technological transfer of memories and personality from one brain to another is "Intelligence Undying" by Edmond Hamilton, first published in the April 1936 issue of Amazing Stories. In this story, an elderly scientist named John Hanley explains that when humans are first born, "our minds are a blank sheet except for certain reflexes which we all inherit. But from our birth onward, our minds are affected by all about us, our reflexes are conditioned, as the behaviorists say. All we experience is printed on the sheet of our minds. ... Everything a human being learns, therefore, simply establishes new connections between the nerve cells of the brain. ... As I said, a newborn child ha
|
https://en.wikipedia.org/wiki/Charles%20Rosen%20%28scientist%29
|
Charles Rosen (December 7, 1917 – December 8, 2002) was a pioneer in artificial intelligence and founder of SRI International's Artificial Intelligence Center. He led the project that led to the development of Shakey the Robot, "who" now resides in a glass case at the Computer History Museum, in Mountain View, California.
Early life and education
Raised in Montreal, Rosen became a student at Cooper Union and received his bachelor's degree in electrical engineering in 1940; he returned to Montreal to study at McGill University, where he received his M. Eng. (in communications) in 1950.
Career
While working at the General Electric Research Laboratory, in 1953 Rosen co-authored one of the first textbooks on transistor circuits. In 1956, Rosen received a Ph.D. in electrical engineering from Syracuse University (with a minor in solid state physics).
In 1957, Rosen joined the Stanford Research Institute, where he did much of his artificial intelligence work.
In 1959, Rosen co-founded Ridge Vineyards with SRI colleagues Hewitt Crane and David Bennion. Under their ownership, Ridge would go on to place fifth in the Judgment of Paris wine tasting.
In 1978, Rosen co-founded Machine Intelligence Corporation (MIC) with colleagues from SRI and elsewhere. He served as its first CEO. MIC developed the first commercially available industrial machine vision system, the VS-100, in his garage. MIC later spun out Symantec Corporation in 1982.
References
1917 births
2002 deaths
Scientists from Montreal
Cooper Union alumni
McGill University Faculty of Engineering alumni
Syracuse University alumni
Canadian computer scientists
Artificial intelligence researchers
Viticulturists
SRI International people
|
https://en.wikipedia.org/wiki/GNU%20Prolog
|
GNU Prolog (also called gprolog) is a compiler developed by Daniel Diaz with an interactive debugging environment for Prolog available for Unix, Windows, Mac OS X and Linux. It also supports some extensions to Prolog including constraint programming over a finite domain, parsing using definite clause grammars, and an operating system interface.
The compiler converts the source code into byte code that can be interpreted by a Warren abstract machine (WAM) and converts that to standalone executables.
See also
SWI-Prolog
References
External links
Prolog programming language family
Constraint programming
Prolog
Free compilers and interpreters
Programming tools for Windows
Unix programming tools
|
https://en.wikipedia.org/wiki/West%20Virginia%20Broadband
|
West Virginia Broadband is a Wireless community network located in Braxton County, West Virginia operated by local volunteers and coordinated by the Gilmer-Braxton Research Zone. The effort gained recent attention by a National Public Radio story and MuniWireless and SmartMobs bloggers detailing how modified off-the-shelf Wi-Fi adapters were used to connect 7 communities with wireless internet for a total cost of little more than 4000 US dollars. The research group now coordinates wireless technology training throughout the United States.
References
Wireless network organizations
Community networks
Braxton County, West Virginia
|
https://en.wikipedia.org/wiki/Motherboy%20XXX
|
"Motherboy XXX" is the 13th episode of the second season of the American television sitcom Arrested Development. It originally aired on the Fox network in the United States on March 13, 2005. The episode, directed by Joe Russo, was written by producer Jim Vallely and series creator and executive producer Mitchell Hurwitz.
The episode received mostly positive reviews from critics.
Plot
Lucille approaches Michael, asking him to be her partner to “Motherboy”, an annual mother-son dinner dance. In every year prior, she went with Buster, but is embarrassed that he now has only one hand. Michael refuses to go with her. Meanwhile, George Michael is getting ready to go on a Christian camping trip with his girlfriend. Upon hearing this, Michael tells him not to go, and to instead visit Buster. Gob speaks with Michael about planning his divorce to his wife, who he married on a dare and barely remembers. He learns that the seal who bit off Buster’s hand (owned by Gob’s wife) had a tracking device on it. He and Michael decide to go after it, to try and recover Buster’s hand for a transplant.
Tobias meets with Carl Weathers at a Burger King, speaking about a project Carl is working on, which is about George Sr.’s escape from jail. He tells Tobias that in order to be in the episode, he needs to sign a release for the family. Later, George Michael meets Buster, per his father’s request. While there, Lucille offers to take him out of town to the camping trip, which he complies with. He soon learns that she is instead taking him to the Motherboy event. Having signed away his family’s life rights for the role of George Sr., Tobias begins research for the part. He sees George Sr. in the Bluth’s attic, who threatens him not to tell anyone of his whereabouts. When he hears of the show, he asks Tobias to act manly in the role.
Gob, Michael, and Buster arrive at the port where the seal’s tracking device had gone, only to find that the seal had been eaten by a shark, which carried the tracking device to the port. Buster mentions to Michael that George Michael had gone to Motherboy, and they both agree that they have to ‘save’ him from the event. Gob meets with his lawyer Barry, who tells him to say in court that he never consummated his marriage. Barry then says: "I missed breakfast, so I'm on my way to Burger King," and then jumps over the shark on the pier.
Gob later meets with his wife and tells her that he plans to tell the court this, but they end up having sex. Michael and Buster stake out the Motherboy dance, looking for a chance to create a diversion and take George Michael home. They confront Lucille, and she takes on Buster as a dance partner when Michael leaves with his son. When Motherboy ends, Michael takes George Michael to the camping trip to see his girlfriend.
On the next Arrested Development...
Gob argues his case in court that his marriage was never consummated, but his wife shows a recently taken picture of him next to her with his shirt pull
|
https://en.wikipedia.org/wiki/XST
|
XST may refer to:
Cross-site tracing, a network security vulnerability exploiting the HTTP TRACE method.
Experimental Survivable Testbed, early versions of F-117 Nighthawk stealth aircraft.
|
https://en.wikipedia.org/wiki/Oren%20Patashnik
|
Oren Patashnik (born 1954) is an American computer scientist. He is notable for co-creating BibTeX, and co-writing Concrete Mathematics: A Foundation for Computer Science. He is a researcher at the Center for Communications Research, La Jolla, and lives nearby in San Diego. Oren and his wife Amy have three children, Josh, Ariel, and Jeremy.
History
Oren Patashnik graduated from Yale University in 1976, and later became a doctoral student in computer science at Stanford University, where his research was supervised by Donald Knuth.
While working at Bell Labs in 1980, Patashnik proved that Qubic can always be won by the first player. Using 1500 hours of computer time, Patashnik's proof is a notable example of a computer-assisted proof.
In 1985, Patashnik created the bibliography-system, BibTeX, in collaboration with Leslie Lamport, the creator of LaTeX. LaTeX is a system and programming language for formatting documents, which is especially designed for mathematical documents. BibTeX is a widely used bibliography-formatting tool for LaTeX.
In 1988, Patashnik assisted Ronald Graham and Donald Knuth in writing Concrete Mathematics: A Foundation for Computer Science, an important mathematical publication and college textbook.
In 1990, he got his doctorate in computer science. His thesis paper was about "Optimal Circuit Segmentation for Pseudo-Exhaustive Testing" .
After the 2003 Cedar Fire destroyed 60% of the houses in his immediate neighborhood, his statistical study showed that houses with a wood-shake shingle roof did very badly, but surprisingly, so did houses with a Spanish-style, curved-red-tile roof.
Notes
References
(PDF) "How to Win at Tic-Tac-Toe" (Mathellaneous, July 2005, University of Melbourne) - 11-page article with a section relating Patashnik's effort on Qubic
Credits of Concrete Mathematics
1954 births
Living people
American computer scientists
Jewish American scientists
Jewish scientists
Yale University alumni
Timothy Dwight College alumni
Stanford University alumni
BibTeX
|
https://en.wikipedia.org/wiki/KMXT%20%28FM%29
|
KMXT (100.1 FM) is an NPR–member non-commercial radio station in Kodiak, Alaska, United States. In addition to its NPR membership, KMXT is also affiliated with the Alaska Public Radio Network and the BBC World Service. It also airs many hours of locally originated news, talk and music programming, and relies heavily on non-paid citizen volunteers to host numerous shows.
HD programming
Currently KMXT broadcasts one analog and three digital signals:
KMXT-HD1 rebroadcasts the programming from the analog signal.
KMXT-HD2 classical and jazz.
KMXT-HD3 KMX3 is a mono news and talk channel.
An HD Radio receiver is required to pick up the digital channels. KMXT also streams its analog signal over the web.
Translators
In addition to five low-powered, separate-frequency translators, one low-powered booster also extends coverage. Boosters are licensed on the same frequency as the parent station but at a different location. They are given the same callsign as the parent station with a number added to differentiate the transmitter site.
References
External links
MXT
NPR member stations
MXT
Radio stations established in 1990
1990 establishments in Alaska
|
https://en.wikipedia.org/wiki/3D%20Fax
|
3D Fax is a computer program, developed for Microsoft Windows by InfoImaging Technologies in the mid-1990s, for file transfer via fax. The program encodes a file into an image, which the user would then print and send via a fax machine or transmit directly from the computer using a fax modem. The recipient would then scan the transmitted image or receive it via a fax modem, and use 3D Fax to decode it back to its original binary form.
InfoImaging claimed a capacity of 40kB per sheet of paper using its image encoding of files, extended to 110kB (between two fax modems) in the 2.0 version. InfoWorld's reviewer found that the 1.0 version could compress both a 90kB Word document and a 302kB image file to less than 40kB, so the files could each be faxed as a single page.
References
Fax software
|
https://en.wikipedia.org/wiki/KDGE
|
KDGE () is an iHeartMedia adult contemporary commercial radio station dually licensed to both Fort Worth and Dallas, Texas. Star 102.1 switches programming to Christmas music during the months of November and December.
The station's studios are located along Dallas Parkway in Farmers Branch, Texas (although it has a Dallas address). The transmitter site is off West Belt Line Road in Cedar Hill. KDGE broadcasts using HD Radio technology. Its HD2 digital subchannel carries an alternative rock format, known as The Edge.
History
Easy Listening format
102.1 FM was authorized by the Federal Communications Commission in 1960 to broadcast as KFMF, but the station was not immediately built. KJIM AM 870 (now KFJZ) purchased the KFMF construction permit and it signed on the air on April 10, 1962, as KJIM-FM. At first, KJIM-FM simulcast the daytime-only AM sister station, to allow programming to be heard after sunset. Later, KJIM-FM switched to an automated easy listening instrumental format. KJIM-AM-FM acquired a UHF-TV permit in the mid-1960s to construct Channel 21 (today KTXA). The company sold off AM 870 to raise capital.
Move to Album Rock
In 1966, KJIM-FM changed their call letters to KFWT-FM and improved its signal, going from 2,900 watts at 165 feet to 100,000 watts at 1,000 feet HAAT from the antenna tower that would also transmit Channel 21. (Channel 21 went on the air in 1967 and signed off in 1970, returning under new ownership in 1980.) KFWT-FM was sold to Marsh Media of Amarillo, Texas and subsequently changed its call letters to KFWD. In 1973, the station flipped to album rock, and was bought by the Southern Media Company in 1975.
Switch to Q102
In October 1978, new general manager Bud Stiker led the change of the call sign to KTXQ and the branding to "Q102" (to launder the station of a Fort Worth image, and to lessen confusion with then-CBS network affiliate KDFW-TV Channel 4). In 1983, CBS Radio bought the station. Through the 1980s and 1990s, the station aired variations on the rock format, including classic rock and mainstream rock. The "Q102" branding has nothing to be confused with Top 40/CHR station KDSQ in Sherman-Denison. Morning hosts Bo and Jim were popular Q102 DJs for most of Q102's existence. Though KTXQ maintained high ratings for years, by the mid-1990s, the station fell into a steep decline, particularly after the debut of KRRW's similar-sounding classic rock format. In its final book in the summer of 1998, KTXQ was ranked 19th with a 2.4 share of the market.
In early 1997, CBS sold the station to New York-based SFX Broadcasting. By August of that year, however, Austin-based Capstar merged with SFX. Six months later, locally based Chancellor Media acquired KTXQ through a series of trades with Capstar.
Magic 102
At Noon on August 27, 1998, on the same day that Chancellor announced that they would merge with Capstar to form AMFM, Inc., KTXQ discontinued its long-running rock format and began stunting with simul
|
https://en.wikipedia.org/wiki/Insyde%20Software
|
Insyde Software () is a company that specializes in UEFI system firmware and engineering support services, primarily for OEM and ODM computer and component device manufacturers. They are listed on the Gre Tai Market of Taiwan and headquartered in Taipei, with offices in Westborough, Massachusetts, and Portland, Oregon. The company's market capitalization of the company's common shares is currently around $115M.
Overview
The company's product portfolio includes InsydeH2O BIOS (Insyde Software's implementation of the Intel Platform Innovation Framework for UEFI/EFI), BlinkBoot, a UEFI-based boot loader for enabling Internet of Things devices, and Supervyse, which is a full-featured systems management/BMC firmware for providing out-of-band remote management for server computers.
Insyde Software was formed when it purchased the BIOS assets of SystemSoft Corporation (NASDAQ:SYSF) in October, 1998. Initially
Insyde Software was a privately held company that included investments from Intel Pacific Inc., China Development Industrial Bank, Professional Computer Technology Limited (PCT), company management and selected employees. At that time, Insyde Software's management team consisted of Jeremy Wang, Chairman (also the Chairman of PCT); Jonathan Joseph, President (a former founder of SystemSoft); Hansen Liou, the General Manager of Taiwan Operations and Asia-Pacific Sales, and Stephen Gentile, the Vice President of Marketing.
Shortly after the initial investment, the company was introduced by Intel to a new BIOS coding architecture called EFI (now UEFI) and the two companies began working together on it. In 2001, the two companies entered into a joint development agreement and Insyde’s first shipment of the technology occurred in October 2003 as InsydeH2O UEFI BIOS. Since that time, UEFI has become the mainstay of Insyde’s business.
On 23 January 2003, Insyde Software announced its initial public offering on the GreTai Securities Market (GTSM) based in Taipei, Taiwan.
Products
InsydeH2O UEFI BIOS
The product is a proprietary licensed UEFI BIOS firmware that supports Intel and AMD. PC manufacturers buy the BIOS source code and modify the source code to meet their specific BIOS needs. For the firmware's security vulnerabilities, the company publishes the security advisory, and provides the updates on the CVE fixes and patches to their customers.
See also
List of companies of Taiwan
BIOS features comparison
References
Software companies established in 1998
BIOS
Software companies of Taiwan
Companies based in Taipei
Electronics companies of Taiwan
Taiwanese brands
Taiwanese companies established in 1998
2003 initial public offerings
Companies listed on the Taipei Exchange
|
https://en.wikipedia.org/wiki/Maximum%20intensity%20projection
|
In scientific visualization, a maximum intensity projection (MIP) is a method for 3D data that projects in the visualization plane the voxels with maximum intensity that fall in the way of parallel rays traced from the viewpoint to the plane of projection. This implies that two MIP renderings from opposite viewpoints are symmetrical images if they are rendered using orthographic projection.
MIP is used for the detection of lung nodules in lung cancer screening programs which use computed tomography scans. MIP enhances the 3D nature of these nodules, making them stand out from pulmonary bronchi and vasculature. MIP imaging is also used routinely by physicians in interpreting Positron Emission Tomography (PET) or Magnetic Resonance Angiography studies.
Additional techniques
This technique is computationally fast, but the 2D results do not provide a good sense of depth of the original data. To improve the sense of 3D, animations are usually rendered of several MIP frames in which the viewpoint is slightly changed from one to the other, thus creating the illusion of rotation. This helps the viewer's perception to find the relative 3D positions of the object components. However, since the projection is orthographic the viewer cannot distinguish between left or right, front or back and even if the object is rotating clockwise or anti-clockwise. Use of depth weighting during production of rotating cines of MIP images can avoid the problem of difficulty of distinguishing right from left, and clockwise vs anti-clockwise rotation.
An easy improvement to MIP is Local maximum intensity projection. In this technique we don't take the global maximum value, but the first maximum value that is above a certain threshold. Because - in general - we can terminate the ray earlier this technique is faster and also gives somehow better results as it approximates occlusion.
History
MIP imaging was invented for use in Nuclear Medicine by Jerold Wallis, MD, in 1988 at Washington University in St. Louis, and subsequently published in IEEE Transactions on Medical Imaging. In the setting of Nuclear Medicine, it was originally called MAP (Maximum Activity Projection).
See also
Minimum intensity projection
References
Object visualization
|
https://en.wikipedia.org/wiki/Humanist%20Internet%20Discussion%20Group
|
The Humanist discussion group may refer to:
Humanist (electronic seminar), a long-running (since 1987) e-mail discussion group on humanities computing
a discussion list (since 2003) run by the Council of Australian Humanist Societies
|
https://en.wikipedia.org/wiki/Whiteinch%20Railway
|
The Whiteinch Railway was a railway line opened in 1874 in Scotland to connect industrial premises that had developed in the area with the Stobcross Railway, giving access to the main line network. It was opened for goods and mineral traffic, and was extended by the Whiteinch Tramway which fed directly into the factories and works.
The Whiteinch Railway was taken over by the North British Railway in 1891 and they started a passenger service on the line in 1897; the terminus was called Whiteinch (Victoria Park).
After 1945 passenger and freight usage of the lines declined, and the passenger service was discontinued in 1951. The Whiteinch goods yard was later used as a construction depot for the electrification of the North Clyde passenger services, but the lines were closed completely in 1967 and nothing remains of them.
History
Before the Whiteinch Railway
The first railways in Glasgow were located on the east side of the city, and were concerned with transporting minerals. In 1832 the Garnkirk and Glasgow Railway opened to a terminus at Townhead, bringing coal from the Monklands coalfield to the city. The Polloc and Govan Railway was an 1840 development of an earlier waggonway, improved to get access to shipping on the south bank of the Clyde at Broomielaw (a name then applied to the area both sides of the river). In 1842 the Edinburgh and Glasgow Railway opened its intercity line to Edinburgh.
The north bank of the Clyde was not developed for some time, and railway access was difficult. The main lines built at the end of the decade ran east and south, and although construction through, and under, the central area was proposed, opposition was so strong that it was not carried out. The Glasgow, Dumbarton and Helensburgh Railway (GD&HR) was opened in 1858, but it ran in a broad northern sweep round the city, through Maryhill (then a remote small town) and did not approach the Clyde until it reached Bowling.
The Queen's Dock
Heavy industry expanded in subsequent years and there was pressure to move west of the city where land was available and access to the Clyde was easier. At the same time, berthing of ships in Broomielaw was becoming difficult as shipping volumes, and vessel sizes, increased, and the Clyde Commissioners determined to build a new dock on the north bank west of the city. Work was started in 1872 at Stobcross, and the new dock, to be known as "The Queen's Dock" was formally opened on 18 September 1877.
The Stobcross Railway
By this time the GD&HR had been taken over by the North British Railway. The creation of the new dock was obviously of fundamental concern to the company, and it secured Parliamentary authority for a line to Stobcross to serve the dock. The line, known as the Stobcross Railway, branched from the GD&HR at Maryhill (Stobcross Junction), and it opened on 20 October 1874.
Whiteinch
Some industrial development had taken place in about 1870 at Whiteinch, a mile or so west of Stobcross, on the north bank of the
|
https://en.wikipedia.org/wiki/Postcards%20%28TV%20series%29
|
Postcards is an Australian holiday and travel television series on the Nine Network.
History
There were originally three different versions of Postcards, each produced and broadcast within its specific city or market. In 1995, Adelaide's Nine Network produced their first series. It promoted holiday spots within South Australia, encouraging viewers to travel within their state. Soon after, the Nine Network in Melbourne launched their own state-based version and Nine Network in Perth followed in 1999 with Postcards WA.
In 2007, WIN Television purchased Nine Network in Adelaide and Perth. The Perth-based Postcards WA was then renamed Postcards Australia and expanded to cover more parts of the country, using reporters positioned across the WIN network, and in 2011 they axed the original Adelaide-based Postcards SA.
In March 2016, Postcards moved to a new Friday night timeslot and one hour format for Perth, Adelaide, Melbourne markets. Rebecca Judd hosted the show alongside presenters Livinia Nixon, Lauren Phillips, Brodie Harper, Shane Crawford, Glen Moriarty, Scherri-Lee Biggs, Warren Tredrea and celebrity chef Shane Delia.
Postcards Victoria
Postcards Victoria airs on Sundays at 5.30pm on the Nine Network across Victoria,
Presenters
Brodie Harper
Shane Delia
Lauren Phillips
Livinia Nixon
Madeline Spark
Kris Smith
Todd Woodbridge
The show has previously been hosted by Shane Crawford, Rebecca Judd, Giaan Rooney, Bridget McIntyre, Suzie Wilks and Geoff "Coxy" Cox.
Previous series
Postcards
Postcards was produced by the Nine Network in Melbourne and was hosted by Rebecca Judd along with presenters Livinia Nixon, Lauren Phillips, Brodie Harper, Shane Crawford, Glen Moriarty, Scherri-Lee Biggs, Warren Tredrea and celebrity chef Shane Delia. The show aired in Perth, Adelaide and Melbourne market on Friday nights at 7.30pm.
Postcards Australia
Postcards Australia was produced by WIN Television and WIN Digital Media and showcase exciting, engaging and beautiful destinations around Australia and recently New Zealand, highlighting the stunning locations, unique characters and interesting things to do, along with travel tips, local advice and much fun. Hosted by Scott McRae, series two will be seen across Australia and is also seen on Discovery Travel Channel in South East Asia, Korea, China and New Zealand.
Postcards South Australia
Postcards South Australia was produced by Nine Network in Adelaide and was shown every Sunday at 5:30 pm from 1995 to 2011 hosted by Keith Conlon. Other reporters included Lisa McAskill, Ali Carle, Michael Keelan, Chad Cornes, Mark Bickley and Kym Dillon. The series aired its final episode on 20 November 2011.
Postcards Western Australia
Postcards WA was produced by the Nine Network in Perth. It was first launched in April 1998 and was hosted by Philippa O'Connell who was joined by co-host Paul Entwistle in 2003. Reporters for the show included Ryan Campbell, Teresa Spiniello, Craig James and Fiona Argyl
|
https://en.wikipedia.org/wiki/Constraint%20logic%20programming
|
Constraint logic programming is a form of constraint programming, in which logic programming is extended to include concepts from constraint satisfaction. A constraint logic program is a logic program that contains constraints in the body of clauses. An example of a clause including a constraint is . In this clause, is a constraint; A(X,Y), B(X), and C(Y) are literals as in regular logic programming. This clause states one condition under which the statement A(X,Y) holds: X+Y is greater than zero and both B(X) and C(Y) are true.
As in regular logic programming, programs are queried about the provability of a goal, which itself may contain constraints in addition to literals. A proof for a goal is composed of clauses whose bodies are satisfiable constraints and literals that can in turn be proved using other clauses. Execution is performed by an interpreter, which starts from the goal and recursively scans the clauses trying to prove the goal. Constraints encountered during this scan are placed in a set called the constraint store. If this set is found out to be unsatisfiable, the interpreter backtracks, trying to use other clauses for proving the goal. In practice, satisfiability of the constraint store may be checked using an incomplete algorithm, which does not always detect inconsistency.
Overview
Formally, constraint logic programs are like regular logic programs, but the body of clauses can contain constraints, in addition to the regular logic programming literals. As an example, X>0 is a constraint, and is included in the last clause of the following constraint logic program.
B(X,1):- X<0.
B(X,Y):- X=1, Y>0.
A(X,Y):- X>0, B(X,Y).
Like in regular logic programming, evaluating a goal such as A(X,1) requires evaluating the body of the last clause with Y=1. Like in regular logic programming, this in turn requires proving the goal B(X,1). Contrary to regular logic programming, this also requires a constraint to be satisfied: X>0, the constraint in the body of the last clause. (In regular logic programming, X>0 cannot be proved unless X is bound to a fully ground term and execution of the program will fail if that is not the case.)
Whether a constraint is satisfied cannot always be determined when the constraint is encountered. In this case, for example, the value of X is not determined when the last clause is evaluated. As a result, the constraint X>0 is neither satisfied nor violated at this point. Rather than proceeding in the evaluation of B(X,1) and then checking whether the resulting value of X is positive afterwards, the interpreter stores the constraint X>0 and then proceeds in the evaluation of B(X,1); this way, the interpreter can detect violation of the constraint X>0 during the evaluation of B(X,1), and backtrack immediately if this is the case, rather than waiting for the evaluation of B(X,1) to conclude.
In general, the evaluation of a constraint logic program proceeds as does a regular logic program. However, constraints enco
|
https://en.wikipedia.org/wiki/Oxygene%20%28programming%20language%29
|
Oxygene (formerly known as Chrome) is a programming language developed by RemObjects Software for Microsoft's Common Language Infrastructure, the Java Platform and Cocoa. Oxygene is based on Delphi's Object Pascal, but also has influences from C#, Eiffel, Java, F# and other languages.
Compared to the now deprecated Delphi.NET, Oxygene does not emphasize total backward compatibility, but is designed to be a "reinvention" of the language, be a good citizen on the managed development platforms, and leverage all the features and technologies provided by the .NET and Java runtimes.
Oxygene is a commercial product and offers full integration into Microsoft's Visual Studio IDE on Windows, as well as its own IDE called Fire for use on macOS. Oxygene is one of six languages supported by the underlying Elements Compiler toolchain, next to C#, Swift, Java, Go and Mercury (based on Visual Basic.NET).
From 2008 to 2012, RemObjects Software licensed its compiler and IDE technology to Embarcadero to be used in their Embarcadero Prism product. Starting in the Fall of 2011, Oxygene became available in two separate editions, with the second edition adding support for the Java and Android runtimes. Starting with the release of XE4, Embarcadero Prism is no longer part of the RAD Studio SKU. Numerous support and upgrade paths for Prism customers exist to migrate to Oxygene. As of 2016, there is only one edition of Oxygene, which allows development on Windows or macOS, and which can create executables for Windows, Linux, WebAssembly .NET, iOS, Android, Java and macOS.
The language
The Oxygene language has its origins in Object Pascal in general and Delphi in particular, but was designed to reflect the guidelines of .NET programming and to create fully CLR-compliant assemblies. Therefore, some minor language features known from Object Pascal / Delphi have been dropped or revised, while a slew of new and more modern features, such as Generics or Sequences and Queries have been added to the language.
Oxygene is an object-oriented language, which means it uses classes, which can hold data and execute code, to design programs. Classes are "prototypes" for objects, like the idea of an apple is the prototype for the apple one can actually buy in a shop. It is known that an apple has a colour, and that it can be peeled: those are the data and executable "code" for the apple class.
Oxygene provides language-level support for some features of parallel programming. The goal is to use all cores or processors of a computer to improve performance. To reach this goal, tasks have to be distributed among several threads. The .NET Framework's ThreadPool class offered a way to efficiently work with several threads. The Task Parallel Library (TPL) was introduced in .NET 4.0 to provide more features for parallel programming.
Operators can be overloaded in Oxygene using the class operator syntax:
class operator implicit(i : Integer) : MyClass;
Note, that for operator overloadin
|
https://en.wikipedia.org/wiki/KTN
|
KTN may refer to:
Television
KTN (television channel), Pakistan
Kenya Television Network
Korean Television Network, a subchannel of WKTB-CD
Television Nagasaki, Japan
Transport
Kentish Town station, London, National Rail station code KTN
Ketchikan International Airport, Alaska, US, IATA and FAA code KTN
Other uses
Known Traveler Number for US Trusted Traveler Programs such as Global Entry
See also
|
https://en.wikipedia.org/wiki/Oh%20No%20It%27s%20Selwyn%20Froggitt
|
Oh No It's Selwyn Froggitt is a British television sitcom produced by Yorkshire Television which originally aired on the ITV network from 1974 to 1978. Initially created by Roy Clarke from a concept by Bill Maynard, most of the series was written by Alan Plater. It starred Maynard as Selwyn Froggitt, a hapless but good-natured council labourer, handyman and working men's club secretary in the fictional Yorkshire town of Scarsdale. The programme was a major ratings success, with Froggitt's catchphrase "magic!" becoming widely known in the United Kingdom. It ran for four series, the last of which carried the title Selwyn and featured only Maynard reprising his role in the new location of a holiday camp.
Plot
The first three series of Oh No It's Selwyn Froggitt are set in the fictional Yorkshire town of Scarsdale and centre on the bungling exploits of Selwyn Froggitt, a handyman and a council labourer. Bill Maynard described Froggitt, a burly, balding and good-natured man often clad in a donkey jacket, as "this naïve boy who never grew up". Froggitt has an urge to improve his life and that of everyone around him; he carries The Times and often tells people "there was an article about it in The Times" regarding subjects he has brought up. He lives with his put-upon mother (Megs Jenkins) and his brother Maurice (Robert Keegan), whose romance and eventual marriage to Vera Parkinson (initially played by Rosemary Martin, replaced by Lynda Baron for the second and third series) is sometimes subject to Selwyn's interference. A running gag is Froggitt's mother warning him "don't open that cupboard our Selwyn, things fall out!", to no avail.
Froggitt is on the committee of Scarsdale Working Men's Club and Institute, serving as concert secretary in charge of booking "turns". Froggitt's colleagues are the dour Scouser Jack (Bill Dean), Harry (Harold Goodwin) and excitable, stereotypical Welshman Clive (Richard Davies), often called Taff by Froggitt. All decisions taken by the club committee are taken on a "show of hands..." and "carried unanimously". Though clumsy and somewhat incompetent, Froggitt is honest and hard-working, unlike the other committee members, who usually sit back in comfort while Froggitt does the manual labour. They generally tolerate him because he is prepared to volunteer for unwanted tasks, and they sometimes mislead him for their own amusement. The club steward is Raymond (Ray Mort), often seen answering the telephone with a number of fictitious and fanciful addresses.
In the fourth and final series, the format of the show changed radically. This version of the programme, retitled Selwyn, featured only Maynard from the earlier series and had Froggitt become entertainments officer under the supervision of manager Mervyn Price (Bernard Gallagher) at the seedy Paradise Valley Holiday Camp.
Cast
Bill Maynard as Selwyn Froggitt
Megs Jenkins as Mrs Froggitt (series 1–3)
David Lodge (pilot) and Robert Keegan (series 1–3) as Maurice Frog
|
https://en.wikipedia.org/wiki/High%20Chaparall
|
High Chaparall is a Swedish television program which first aired in 2003 on the Kanal 5 network. The show is an interview/adventure series featuring the Swedish comedy duo of Filip Hammar and Fredrik Wikingsson. Although the pair continued to be provocative, this program proved to be less controversial than their previous television work and ultimately became much more successful. The team is known popularly in Sweden as simply "Filip and Fredrik."
Concept
Taking a camera team to America, Hammar and Wikingsson filmed a series of multi-day interviews with minor celebrities and has-beens such as Fabio Lanzoni, Pamela Anderson, Ron Jeremy, Tonya Harding, Uri Geller and Gary Busey. Rather than just sitting down and talking, they follow the stars around for several days and engage themselves in various everyday activities of the celebrities' lives. Aside from instances when the hosts are speaking privately with each other or to the camera or camera operators, the series is almost entirely in English.
With varying levels of success and hilarity, Hammar and Wikingsson are welcomed into the lives of infamous personalities who often introduce them to their families, sing songs with them and take the Swedes to their favorite restaurants or recreation spots. Many speak candidly about their lives before, during and after their greatest successes. Some of their interview subjects seem to become genuinely entertained by and endeared to the duo (Vince Neil of Mötley Crüe and his parents, Charlene Tilton of the soap opera Dallas and her daughter Chastity). However, the subjects of other episodes are either bewildered by Filip and Fredrik or become increasingly more uncomfortable (or even mildly irritated) during the relentless onslaught of questions, games and songs (Lorenzo Lamas, Gary Busey).
The pair have a style of questioning which peppers their friendly, casual conversations with intensely personal or embarrassing questions. Hours of this push-pull gradually opens their subjects up to either annoyance or hugging and bonding. They are unafraid of asking celebrities how much money they have or what it feels like to not be so famous anymore. The home audience in Sweden is generally familiar with their incessant, boyish troublemaking which makes their antics all the more hilarious when the necessity arises for them to quickly, cleverly hide behind the guise of innocent curiosity of foreign journalists.
Regular segments
A short biography segment introduces the program's guest at the beginning, during which seemingly unrelated images quickly appear on the screen. Each picture is in fact a humorous reference to something similar - or related - to the subject matter. A viewer may need to see this one-minute introduction many times - and be well-versed in Swedish pop culture - in order to catch all the rapid, subversive jokes.
A typical 45-minute episode is taped over two full days and features Filip and Fredrik visiting a celebrity at home in Los Angeles, ask
|
https://en.wikipedia.org/wiki/Outrigger%20Macintosh
|
The Outrigger is a style of Apple Macintosh desktop computer case designed for easy access. Outrigger cases were used on the Power Macintosh 7200, 7300, 7500, 7600 and Power Macintosh G3 Desktop computers from August 1995 to December 1998.
The logic board is mounted at the bottom of the case, with drive bays and a power supply in a separate fold-out section that swings aside as one piece and props open. This allows unfettered access to logic board connections such as the memory, Central processing unit, VRAM and drive/power connections without a screwdriver. The PCI slots were located on the left edge of the case and covered only by a plastic shield, making them accessible without lifting the drive bay assembly.
Apple's next Power Macintosh case design as used in the Power Macintosh G3 (Blue & White) would also provide easy user access (although the motherboard and power-supply were significantly more difficult to replace by the layman).
References
Macintosh case designs
|
https://en.wikipedia.org/wiki/The%20Gaffer%20%28TV%20series%29
|
The Gaffer is an ITV situation comedy series of the early 1980s, that starred Bill Maynard and was written by businessman Graham White. It was made for the ITV network by Yorkshire Television.
Cast
Bill Maynard – Fred Moffatt
Russell Hunter – Harry
Pat Ashton – Betty
David Gillies – Ginger
Don Crann – Charlie
Keith Marsh – Henry
Chris Langham – Spencer Moffatt (series 2)
Plot
Following the end of the situation comedy (Oh No It's Selwyn Froggitt), Maynard's next character couldn't have been more different from the bumbling Selwyn Froggitt. Fred Moffatt is a survivor – just. Bearded, wearing a battered hat and a crumpled suit, his Rover P6 a rusting wreck, he runs a struggling engineering firm and is constantly trying to avoid his creditors, the tax man, the bank manager, and indeed anyone who might want him to pay for something.
The series' background accurately reflected the precarious condition of many small businesses of the era and added a dark undercurrent to the situation comedy. Unlike the physical comedy of Selwyn Froggitt, the scripts for The Gaffer were wordy and sardonic and the plots relatively complex, with Fred Moffatt usually managing to outwit at least some of the people who were chasing him for money.
The cast included Russell Hunter as the radical union shop steward whose interest was in parting Moffatt from as much money as possible to better pay his members, and Pat Ashton as his ineffectual secretary Betty.
Abrupt End
The third and final series (broadcast 1983) saw Moffatt elected to the local council, extending his struggles to local politics. But, disgruntled with the losing battle he was fighting, in the final episode ("Goodbye"), Moffatt upped sticks, sold off the business to his employees and emigrated to Australia to make a new start, only to return and take back the business after having attended his son Spencer's wedding. However the series thus ended abruptly, despite its success, after a two-year run.
In later years, it was suggested that during the production of series 3, White (the creator of the show) protested that Maynard kept changing his scripts too much, thus embittering the relationship between the two and so a planned fourth series was cancelled. White revealed details of the dispute which ended the series in a 2014 newspaper interview . Graham White published a sequel novel entitled "The Gaffer's Guerillas" which takes the story into the present day .
Home media
All three series of The Gaffer have been released on DVD by Network, A 3-disc set of the complete series has also been released.
See also
Cowboys
External links
1980s British sitcoms
1981 British television series debuts
1983 British television series endings
English-language television shows
ITV sitcoms
Television series by Yorkshire Television
Television shows set in Leeds
Television shows set in Yorkshire
|
https://en.wikipedia.org/wiki/Young%20Lions%20%28TV%20series%29
|
Young Lions is an Australian TV police drama shown on the Nine Network in 2002 and in Ireland on RTÉ Two. The storyline of the series revolved around the professional and private lives of four rookie detectives, the Young Lions, of South West 101, an inner city Sydney police station.
The program rated poorly and was not renewed after its first season. Competition from other new drama series and several timeslot changes also contributed to the show's demise.
Cast
Main
Alex Dimitriades as Det Snr Constable Eddie Mercia
Alexandra Davies as Det Snr Constable Donna Parry
Tom Long as Det Snr Constable Guy 'Guido' Martin
Anna Lise Phillips as Det Snr Constable Cameron Smart
Penny Cook as Chief Inspector Sharon Kostas
Katherine Slattery as Madeleine Delaney
Alan Cinis as Phil Emerson
Recurring/guests
Socratis Otto as Justin Carmody (15 episodes)
Anna Torv as Irena Nedov (13 episodes)
John Waters as Snr Det Bill Martin (7 episodes)
Maya Stange as Sophie Rinaldi (6 episodes)
John Noble as Adam Gallagher (4 episodes)
John Gregg as George Quinlan QC / Magistrate (4 episodes)
Rhys Muldoon as Justice Paul Bergan (3 episodes)
Jeremy Sims as Rob Carne (3 episodes)
Simon Burke as Rob Watson (3 episodes)
Terry Serio as Det Shane Wesson (3 episodes)
Leeanna Walsman aa Freda Larsen (2 episodes)
Daniel Frederiksen as Chris Doone (2 episodes)
Brendan Cowell as Jason Doone (2 episodes)
Essie Davis as Julie Morgan (2 episodes)
Nadine Garner as Rebecca Ann Sharps (2 episodes)
Kate Beahan as Emma Greer (2 episodes)
Damien Garvey as William Solomons (2 episodes)
Justin Rosniak as Noel Jarvine (2 episodes)
Hayley MacElhinney as Mel Gilham (2 episodes)
Kieran Darcy-Smith as Marty Charlton (2 episodes)
Marta Dusseldorp as Catherine McGregor (1 episode)
Chris Lilley as Mick Dwyer (1 episode)
Peter O'Brien as Daryll Flynn (1 episode)
Kick Gurry as Danny (1 episode)
Ryan Johnson as Alex Brooks (1 episode)
Steve Le Marquand as SPG Officer Stevens (1 episode)
Steven Vidler as Sgt Brian Graham (1 episode)
David Campbell as Grant Fisher (1 episode)
Loene Carmen as Sarah (1 episode)
Jack Finsterer as Tony Kennedy (1 episode)
Zac Drayson as Jay Stubbings (1 episode)
Peter Kowitz as Alan Destin (1 episode)
Leon Ford as Josef Pozinak (1 episode)
Daniel Roberts
Release
Broadcast
The series ran from 17 July through 18 December 2002, and consisted of 23 episodes.
Critical reception
The program rated poorly and was not renewed after its first season. Competition from other new drama series and several time slot changes also contributed to the show's demise. The series has a rating of 6.5 on IMDb out of 152 reviews.
Episode List
List of Australian television series
List of Nine Network programs
References
External links
Young Lions at the National Film and Sound Archive
2002 Australian television series debuts
2002 Australian television series endings
2000s Australian drama television series
2000s Australian crime television series
English-la
|
https://en.wikipedia.org/wiki/PocketMail
|
PocketMail was a very small and inexpensive mobile computer, with a built-in acoustic coupler, developed by PocketScience.
History
PocketMail was developed by the company PocketScience and used technology developed by NASA. This was the first ever mass-market mobile email. The hardware cost around US$100 and the service was initially US$9.95 per month for unlimited use. Later the monthly fee increased. After the company made a reference hardware design, leading consumer electronics manufacturers Audioxo, Sharp, JVC, and others made their own PocketMail devices. Later a PocketMail dongle was created for the PalmPilot. PocketMail users were given a custom email address or able to synch up PocketMail with their existing email account (including AOL accounts). Although actually a computer, its main function was email. Its main advantages were that it was simple, and that it worked with any phone, even outside the United States. It was a low-cost personal digital assistant (PDA) with an inbuilt acoustic coupler which allowed users to send and receive email while connected to a normal telephone, thus allowing use outside of mobile phone range, or without the need to be signed up with a mobile telephone provider. Popularity of the PocketMail peaked around 2000, when the company stopped investing in new technology development.
In Australia, the company known as PocketMail in 2007 stopped marketing the PocketMail service, changed its name to Adavale Resources Limited and now owns uranium mining prospects in Queensland and South Australia.
References
Websites
Dan's Data Review: http://www.dansdata.com/pocketmail.htm
TechCrunch: Nostalgiamatic: The Sharp TM-20 with PocketMail
Government Computer News: With PocketMail, e-mail access is phone call away
JVC's PocketMail offers e-mail without computer or modem
InfoWorld Review of Sharp PocketMail device
Cracked.com's list of "The 5 Most Ridiculously Awful Computers Ever Made
Mobile computers
Modems
Email devices
|
https://en.wikipedia.org/wiki/The%20Internet%20Adapter
|
The Internet Adapter (TIA) was software created by Cyberspace Development in 1993 to allow Serial Line Internet Protocol (SLIP) connections over a shell account. Point-to-Point Protocol (PPP) was added in 1995, by which time the software was marketed and sold by Intermind of Seattle. Shell accounts normally only allow the use of command line or text-based software, but by logging into a shell account and starting the TIA daemon, a user could then run any TCP/IP-based application, including standard GUI software such as the then-popular Netscape Navigator on their computer. This was especially useful at the time because simple shell accounts were much less expensive than full SLIP/PPP accounts. TIA was ported to a large number of unix or unix-like systems.
Usage of TIA declined rapidly with the advent of inexpensive PPP-enabled consumer-level dial-up access. Also, competition from alternatives such as the free software Slirp cut its market share. Cyberspace Development later sold its domain name and its owners went on to other projects while Intermind moved on to Push technology and automated data delivery.
References
Internet Protocol based network software
1993 software
|
https://en.wikipedia.org/wiki/Pennsylvania%20Spatial%20Data%20Access
|
Pennsylvania Spatial Data Access (PASDA) is Pennsylvania's official public access geospatial information clearinghouse. PASDA serves as Pennsylvania's node on the National Spatial Data Infrastructure (NSDI). PASDA is a cooperative effort of the Pennsylvania Geospatial Technologies Office of the Office of Information Technology and the Pennsylvania State University Institute of Energy and the Environment.
Early history
Pennsylvania Spatial Data Access (PASDA), the official public geospatial data clearinghouse for the Commonwealth of Pennsylvania marked its 18th year in 2014. PASDA, which has grown from a small website offering 35 data sets in 1996 to the expansive user-centered data clearinghouse that it is today, has become a staple of the GIS community in Pennsylvania. PASDA provides access to thousands of data files, terabytes of data, and hundreds of Internet Map Services, Google Earth KML files, metadata, mapping applications, and other information like guides and tutorials.
PASDA was developed by the Pennsylvania State University as a service to the citizens, governments, and businesses of the Commonwealth. PASDA is a cooperative project of the Governor's Office of Administration, Office for Information Technology, Geospatial Technologies Office and Penn State Institutes for Energy and the Environment of the Pennsylvania State University. Funding is provided by the Pennsylvania Office for Information Technology, Geospatial Technologies Office. The Pennsylvania State University provides additional substantial support to PASDA for system administration, database technologies administration, and infrastructure. The High Performance Computing Center at Penn State is also providing significant resources and support for PASDA.
PASDA is housed at Penn State Institute of Energy and the Environment.
The purpose of Pennsylvania Spatial Data Access (PASDA) is to serve as a comprehensive geospatial data digital library by providing free, universal access to geospatial data and information by, for, and about the Commonwealth of Pennsylvania. PASDA has served for almost 20 years as the Commonwealth's node on the National Spatial Data Infrastructure (NSDI), Geospatial One Stop, and the National Biological Information Infrastructure.
Data & Metadata creation
The data made available through PASDA is provided by our data partners to encourage the widespread sharing of geospatial data, eliminate the creation of redundant data sets, and to further build an inventory (through the development and hosting of metadata) of available data relevant to the Commonwealth. PASDA serves as a resource for locating data throughout the Commonwealth through its data storage, interactive mapping/webgis applications, and metadata/documentation efforts. PASDA services are provided free of charge to all users and data providers. The data on PASDA is provided by federal, state, local and regional government agencies, non-profit organizations, and academic institutions througho
|
https://en.wikipedia.org/wiki/Macintosh%20Quadra%20605
|
The Macintosh Quadra 605 (also sold as the Macintosh LC 475 and Macintosh Performa 475) is a personal computer designed, manufactured, and sold by Apple Computer from October 1993 to July 1996. The model names reflect a decision made at Apple in 1993 to follow an emerging industry trend of naming product families for their target customers Quadra for business, LC for education, and Performa for home. Accordingly, the Performa 475 and 476 was sold in department stores and electronics stores such as Circuit City, whereas the Quadra was purchased through an authorized Apple reseller.
When introduced, the Quadra 605 was the least expensive new computer in Apple's lineup. (The Performa 410, introduced at the same time, at the same price of about $1,000 USD, which included a monitor, was based on the much older Macintosh LC II with a 16 MHz 68030 processor.) The Quadra 605 reuses the Macintosh LC III's pizza box form factor with minor modifications.
The Quadra 605 was discontinued in October 1994, and the LC 475 variant continued to be sold to schools until July 1996. Apple offered no direct replacement for these machines, making it the final Macintosh to use the LC's lightweight slim-line form factor. Apple would not release another desktop computer under until the Mac Mini, nearly ten years later.
Models
All models come standard with a Motorola 68LC040 CPU running at 25 MHz, 4 MB RAM on board, 512 KB of VRAM (expandable to 1 MB), 1 LC III-style Processor Direct Slot, 1 ADB and 2 serial ports, external SCSI port, and a manual-inject floppy drive.
Introduced October 18, 1993:
Macintosh Performa 475: 4 MB RAM, 160 MB HDD. Bundled with a keyboard and Apple Color Plus 14" Display.
Macintosh Performa 476: 4 MB RAM, 230 MB HDD. Bundled with a keyboard and Apple Color Plus 14" Display.
Introduced October 21, 1993:
Macintosh Quadra 605: 4 MB RAM, 80 MB HDD. Slightly different case design, the only variant that does not have a case screw. Not available in Europe.
Macintosh LC 475: 4 MB RAM, 80 MB HDD. Bundled with a keyboard and optionally with an Apple Macintosh Color Display; Education market only.
Hardware
Central processing unit: 25 MHz MC68LC040, 32-bit bus. 8 KB of on-chip L1 cache is divided into 4 KB of data and 4 KB of instruction cache. There are no other caches, although an L2 cache is possible via an LC PDS card. The 68LC040 can be replaced with a 68040 which includes onboard Floating Point Unit. This will approximately triple the speed of floating point operations.
Random-access memory: 4 MB on the motherboard, one 72-pin SIMM socket for 80 ns or faster SIMMs. The official supported maximum RAM is 36 MB in one 32 MB 72-pin SIMM plus 4 MB on the motherboard, but larger SIMMs do work—up to 128 MB may be used, with some limits on RAM type. Physical limits might apply if the side of the SIMM facing the CPU has thicker chips, as the clips on the SIMM socket will not close around it automatically. It should be possible to manually push the c
|
https://en.wikipedia.org/wiki/Inttranet
|
The Inttranet is a multilingual portal for and global network of professional interpreters and translators, fully compatible with ISO 9001 quality assurance requirements, and was officially inaugurated in October 2002.
Its purpose is to provide all the functions required by professional interpreters and translators and the users of their services, and to enable access to those services in any language, in accordance with UNESCO's "Access to All" program.
Launched after two years of development, with input from the heads of the translation departments of UNESCO, the European Commission, the Council of Europe, the European Parliament (freelance section), and professional interpreters and translators from 26 countries, the portal is currently (2006) available in 33 languages, but has been designed to be translated and interoperable in any other.
One of the unique features of the Inttranet is the capacity to automatically display member CVs in the language of the visitor to the portal.
The portal also includes a multilingual terminology database (Terminal), compatible with ISO 12616, designed to store and share specific translation terms used by Inttranet members and their customers. It is capable of displaying the search interface as well as the source and target terms in any three different languages.
The Inttranet also comprises an external search system linked to Inttranet CVs that can be hosted as a piece of HTML code on any third-party website (Exttranet), thereby constituting a genuinely global (multilingual) search and display system for users of the services of professional interpreters and translators.
The portal was approved for inclusion in the UNESCO Observatory for the Information Society in January 2006.
External links
Inttranet Home Page
Translation
|
https://en.wikipedia.org/wiki/Cieplewo%20railway%20station
|
Cieplewo is a railway station in Cieplewo, Poland.
Lines crossing the station
References
Cieplewo article at Polish Stations Database, URL accessed at 2 March 2006
Railway stations in Pomeranian Voivodeship
Gdańsk County
|
https://en.wikipedia.org/wiki/National%20Street%20Gazetteer
|
The National Street Gazetteer (NSG) is a database of all streets in England and Wales compiled from the responsible highway authorities which is restricted to local authorities and statutory undertakers (e.g. for maintenance or installing services).
Database
In the United Kingdom local authorities have responsibility for the creation and maintenance of streets as well as the management of street works. The NSG brings together the knowledge spread across local authorities and is a repository for combining the local street gazetteers they are required to keep. Maintenance of the NSG is covered by the National Streetworks Register legislation and is a statutory requirement of local authorities.
In effect, the NSG has become the definitive list of all streets in England and Wales and provides a definitive identification of all streets with the use of a Unique Street Reference Number (USRN).
On a monthly basis, highway authorities are required to upload their street gazetteers, along with Associated Street Data (ASD), to the NSG; a master index built to the national standard BS 7666, for access by a number of other organisations via the NSG online hub and managed by GeoPlace. This enables third-party organisations such as public utilities to meet their statutory requirements to provide the appropriate streetworks notifications.
The NSG has exceeded its initial aims to provide a consistent and unambiguous identification of streets and their associated streetworks. The street gazetteer has become a foundation for the National Land and Property Gazetteer (NLPG). It has also become the basis for Transport for London's (TfL) road network through the Pan London Street Gazetteer.
Originally the NSG was managed by the national mapping agency for the UK, Ordnance Survey (OS). However, it became clear that OS was unwilling or unable to provide a rigorous management of the service. Part of this may have been because OS was operating outside of their acknowledged expertise in mapping rather than data management, although it has been suggested that OS simply saw no commercial advantage in developing the NSG.
In May 2005 the Mapping Services Agreement (MSA) was signed with local authorities. This was part of a long drawn out process of procurement for mapping data and included management of the NSG and the NLPG. The outcome of agreement involved the loss of the custodianship by OS of the NSG which was awarded to the data management company Intelligent Addressing Ltd who were already managers of the NLPG.
See also
National Address Gazetteer
National Streetworks Gazetteer
External links
National Street Gazetteer
Databases in England
Geography of England
Gazetteers
Databases in Wales
Geography of Wales
Geographical databases in the United Kingdom
|
https://en.wikipedia.org/wiki/Scale%20factor%20%28computer%20science%29
|
In computer science, a scale factor is a number used as a multiplier to represent a number on a different scale, functioning similarly to an exponent in mathematics. A scale factor is used when a real-world set of numbers needs to be represented on a different scale in order to fit a specific number format. Although using a scale factor extends the range of representable values, it also decreases the precision, resulting in rounding error for certain calculations.
Uses
Certain number formats may be chosen for an application for convenience in programming, or because of certain advantages offered by the hardware for that number format. For instance, early processors did not natively support the IEEE floating-point standard for representing fractional values, so integers were used to store representations of the real world values by applying a scale factor to the real value. Similarly, because hardware arithmetic has a fixed width (commonly 16, 32, or 64 bits, depending on the data type), scale factors allow representation of larger numbers (by manually multiplying or dividing by the specified scale factor), though at the expense of precision. By necessity, this was done in software, since the hardware did not support fractional value. Scale factors are also used in floating-point numbers, and most commonly are powers of two. For example, the double-precision format sets aside 11 bits for the scaling factor (a binary exponent) and 53 bits for the significand, allowing various degrees of precision for representing different ranges of numbers, and expanding the range of representable numbers beyond what could be represented using 64 explicit bits (though at the cost of precision).
As an example of where precision is lost, a 16-bit unsigned integer (uint16) can only hold a value as large as 65,53510. If unsigned 16-bit integers are used to represent values from 0 to 131,07010, then a scale factor of would be introduced, such that the scaled values correspond exactly to the real-world even integers. As a consequence, for example, the number 3 cannot be represented, because a stored 1 represents a real-world 2, and a stored 2 represents a real-world 4; there are not enough bits available to avoid this error in this representation.
Operations on scaled values
Once the scaled representation of a real value is stored, the scaling can often be ignored until the value needs to come back into the "real world". For instance, adding two scaled values is just as valid as unscaling the values, adding the real values, and then scaling the result, and the former is much easier and faster. In either approach, though, the two added numbers must be scaled the same. For other operations, the scaling is very important.
Multiplication, for instance, needs to take into account that both numbers are scaled. As an example, consider two real world values A and B. The real world multiplication of these real world values is:
A * B = P
If they are instead represented with
|
https://en.wikipedia.org/wiki/Overflow%20flag
|
In computer processors, the overflow flag (sometimes called the V flag) is usually a single bit in a system status register used to indicate when an arithmetic overflow has occurred in an operation, indicating that the signed two's-complement result would not fit in the number of bits used for the result. Some architectures may be configured to automatically generate an exception on an operation resulting in overflow.
An example, suppose we add 127 and 127 using 8-bit registers. 127+127 is 254, but using 8-bit arithmetic the result would be 1111 1110 binary, which is the two's complement encoding of −2, a negative number. A negative sum of positive operands (or vice versa) is an overflow. The overflow flag would then be set so the program can be aware of the problem and mitigate this or signal an error. The overflow flag is thus set when the most significant bit (here considered the sign bit) is changed by adding two numbers with the same sign (or subtracting two numbers with opposite signs). Overflow cannot occur when the sign of two addition operands are different (or the sign of two subtraction operands are the same).
When binary values are interpreted as unsigned numbers, the overflow flag is meaningless and normally ignored. One of the advantages of two's complement arithmetic is that the addition and subtraction operations do not need to distinguish between signed and unsigned operands. For this reason, most computer instruction sets do not distinguish between signed and unsigned operands, generating both (signed) overflow and (unsigned) carry flags on every operation, and leaving it to following instructions to pay attention to whichever one is of interest.
Internally, the overflow flag is usually generated by an exclusive or of the internal carry into and out of the sign bit.
Bitwise operations (and, or, xor, not, rotate) do not have a notion of signed overflow, so the defined value varies on different processor architectures. Some processors clear the bit unconditionally (which is useful because bitwise operations set the sign flag, and the clear overflow flag then indicates that the sign flag is valid), others leave it unchanged, and some set it to an undefined value. Shifts and multiplies do permit a well-defined value, but it is not consistently implemented. For example, the x86 instruction set only defines the overflow flag for multiplies and 1-bit shifts; multi-bit shifts leave it undefined.
References
Computer arithmetic
|
https://en.wikipedia.org/wiki/Todd%20Stauffer
|
Todd Stauffer is co-founder and publisher of the Jackson Free Press in Jackson, Mississippi, and author of 40 nonfiction books on a variety of computer-related topics. He lives with his partner, journalist and editor Donna Ladd.
Stauffer and Ladd started the Jackson Free Press in 2002. They took the name from The Mississippi Free Press, a now-defunct investigative civil rights newspaper from the 1960s. The Jackson Free Press, which is free of charge and is supported entirely by advertising revenue, has a weekly circulation of 17,000. The most recent Media Audit figures indicate an actual readership of approximately 50,000, and its active Web site, which launched on a blogging platform in 2002, receives more than 500,000 page views per month.
In 2006, Stauffer received national attention for leading an effort to fight the efforts of the Gannett Company to control the distribution of locally owned publications in Mississippi. Stauffer became president of a new alliance to counter Gannett's efforts, called the Mississippi Independent Publisher's Association. Editor & Publisher magazine interviewed Stauffer about his efforts and wrote an editorial calling for Gannett to "halt" the TDN distribution scheme, which E&P called a violation of "the First Amendment right to distribute papers without unreasonable interference.
Stauffer, a critic of corporate media, received an Association of Alternative Newsweeklies award for his media criticism.
Stauffer wrote one of the earliest books on blogging and is now a national consultant for publications seeking to transition to the Internet, speaking at national and state newspaper gatherings, from the Association of Alternative Newsweeklies to the New York Press Association.
Stauffer is also a long-time media personality. He was co-host of the Emmy-winning "Disk Doctors" show on Knowledge TV in the 1990s. He was the host of Peak Computing Radio Hour in Denver, Colorado, and is currently the host of Radio JFP on WLEZ-FM in Jackson.
References
American technology writers
American publishers (people)
Year of birth missing (living people)
Living people
|
https://en.wikipedia.org/wiki/Mobile%20web
|
The mobile web comprises mobile browser-based World Wide Web services accessed from handheld mobile devices, such as smartphones or feature phones, through a mobile or other wireless network.
History and development
Traditionally, the World Wide Web has been accessed via fixed-line services on laptops and desktop computers. However, the web is now more accessible by portable and wireless devices. Early 2010 ITU (International Telecommunication Union) report said that with current growth rates, web access by people on the go via laptops and smart mobile devices was likely to exceed web access from desktop computers within the following five years. In January 2014, mobile internet use exceeded desktop use in the United States. The shift to mobile Web access has accelerated since 2007 with the rise of larger multitouch smartphones, and since 2010 with the rise of multitouch tablet computers. Both platforms provide better Internet access, screens, and mobile browsers, or application-based user Web experiences than previous generations of mobile devices. Web designers may work separately on such pages, or pages may be automatically converted, as in Mobile Wikipedia. Faster speeds, smaller, feature-rich devices, and a multitude of applications continue to drive explosive growth for mobile internet traffic. The 2017 Virtual Network Index (VNI) report produced by Cisco Systems forecasts that by 2021, there will be 5.5 billion global mobile users (up from 4.9 billion in 2016). Additionally, the same 2017 VNI report forecasts that average access speeds will increase by roughly three times from 6.8 Mbit/s to 20 Mbit/s in that same period with video comprising the bulk of the traffic (78%).
The distinction between mobile web applications and native applications is anticipated to become increasingly blurred, as mobile browsers gain direct access to the hardware of mobile devices (including accelerometers and GPS chips), and the speed and abilities of browser-based applications improve. Persistent storage and access to sophisticated user interface graphics functions may further reduce the need for the development of platform-specific native applications.
The mobile web has also been called Web 3.0, drawing parallels to the changes users were experiencing as Web 2.0 websites proliferated.
The mobile web was first popularized by the silicon valley company, Unwired Planet. In 1997, Unwired Planet, Nokia, Ericsson, and Motorola started the WAP Forum to create and harmonize the standards to ease the transition to bandwidth networks and small display devices. The WAP standard was built on a three-layer, middleware architecture that fueled the early growth of the mobile web but was made virtually irrelevant with faster networks, larger displays, and advanced smartphones based on Apple's iOS and Google's Android software.
Mobile points of access
Mobile Internet refers to Internet access and mainly usage of Internet using a cellular telephone service provider o
|
https://en.wikipedia.org/wiki/Human-based%20computation
|
Human-based computation (HBC), human-assisted computation, ubiquitous human computing or distributed thinking (by analogy to distributed computing) is a computer science technique in which a machine performs its function by outsourcing certain steps to humans, usually as microwork. This approach uses differences in abilities and alternative costs between humans and computer agents to achieve symbiotic human–computer interaction. For computationally difficult tasks such as image recognition, human-based computation plays a central role in training Deep Learning-based Artificial Intelligence systems. In this case, human-based computation has been referred to as human-aided artificial intelligence.
In traditional computation, a human employs a computer to solve a problem; a human provides a formalized problem description and an algorithm to a computer, and receives a solution to interpret. Human-based computation frequently reverses the roles; the computer asks a person or a large group of people to solve a problem, then collects, interprets, and integrates their solutions. This turns hybrid networks of humans and computers into "large scale distributed computing networks". where code is partially executed in human brains and on silicon based processors.
Early work
Human-based computation (apart from the historical meaning of "computer") research has its origins in the early work on interactive evolutionary computation (EC). The idea behind interactive evolutionary algorithms is due to Richard Dawkins. In the Biomorphs software accompanying his book The Blind Watchmaker (Dawkins, 1986) the preference of a human experimenter is used to guide the evolution of two-dimensional sets of line segments. In essence, this program asks a human to be the fitness function of an evolutionary algorithm, so that the algorithm can use human visual perception and aesthetic judgment to do something that a normal evolutionary algorithm cannot do. However, it is difficult to get enough evaluations from a single human if we want to evolve more complex shapes. Victor Johnston and Karl Sims extended this concept by harnessing the power of many people for fitness evaluation (Caldwell and Johnston, 1991; Sims, 1991). As a result, their programs could evolve beautiful faces and pieces of art appealing to public. These programs effectively reversed the common interaction between computers and humans. In these programs, the computer is no longer an agent of its user, but instead, a coordinator aggregating efforts of many human evaluators. These and other similar research efforts became the topic of research in aesthetic selection or interactive evolutionary computation (Takagi, 2001), however the scope of this research was limited to outsourcing evaluation and, as a result, it was not fully exploring the full potential of the outsourcing.
A concept of the automatic Turing test pioneered by Moni Naor (1996) is another precursor of human-based computation. In Naor's test, th
|
https://en.wikipedia.org/wiki/405%20%28film%29
|
405 is a three-minute film released in June 2000. It was produced by Bruce Branit and Jeremy Hunt on a budget, using significantly self-taught skills with personal computers. 405 is also one of the earliest viral videos. It immediately became notable as an early example of the revolution in digital filmmaking and the use of broadband Internet as a channel to distribute media, and the results rival that of many major film and television production studios at the time.
Plot
On an otherwise ordinary day in Los Angeles, air traffic controllers in contact with American Airlines Flight 117 have the flight appear on a radar screen. The air traffic controllers instruct the McDonnell Douglas DC-10 airliner to make an emergency landing at Los Angeles International Airport.
The flight crew responds by saying that it is unable to maintain altitude, and begin an emergency descent. Meanwhile, during a traffic report, a man is driving a Jeep Grand Cherokee down a mysteriously empty stretch of I-405 as a two-mile stretch was shut down to be used as the airliner's emergency landing strip. Soon, American Airlines Flight 117 appears on its final landing approach while the driver of the Jeep attempts to outrun the incoming DC-10.
During touchdown, the airliner's nose gear collides with the back of the Jeep with the nose gear collapsing, and the fuselage slamming onto the Jeep's roof. The two vehicles are locked together, pushing the Jeep to a much higher speed. The driver tries to slow the careening aircraft but in the process of slowing down, the DC-10 and the man's car narrowly miss an elderly woman driving slowly in her Lincoln Continental. While sliding to a stop, the massive airliner's wheels miss the Lincoln Continental, with the wing of the aircraft passing overhead.
The incident ends with police cars arriving; at that point, the elderly woman drives slowly past, extending her middle finger at the Jeep's driver.
Production
The producers shot the film using a digital camcorder and created the special effects using personal computers, all on a budget of $300. Furthermore, $140 of the budget paid the fines of two traffic tickets for walking on the highway shoulder while filming, issued by California Highway Patrol Officer Dana Anderson, who is listed in the "Special Thanks" section of the credits.
405 includes both live action video and computer-generated imagery that took three and a half months to make. Before making 405, Branit and Hunt had already taught themselves the use of visual effects software, then worked for a few years as professional visual effects artists. Though Hunt had a degree in filmmaking, the use of digital effects software was not commonly taught in school at that time. They used a Canon Optura digital video camera. The effects were done on Pentium II and Pentium III computers with LightWave 3D, Digital Fusion, and Adobe Premiere.
The live action footage, consisting of the actors in stationary vehicles, was shot in one weekend with
|
https://en.wikipedia.org/wiki/PfSense
|
pfSense is a firewall/router computer software distribution based on FreeBSD. The open source pfSense Community Edition (CE) and pfSense Plus is installed on a physical computer or a virtual machine to make a dedicated firewall/router for a network. It can be configured and upgraded through a web-based interface, and requires no knowledge of the underlying FreeBSD system to manage.
Overview
The pfSense project began in 2004 as a fork of the m0n0wall project by Chris Buechler and Scott Ullrich. Its first release was in October 2006. The name derives from the fact that the software uses the packet-filtering tool, PF.
Notable functions of pfSense include traffic shaping, VPNs using IPsec or PPTP, captive portal, stateful firewall, network address translation, 802.1q support for VLANs, and dynamic DNS. pfSense can be installed on hardware with an x86-64 processor architecture. It can also be installed on embedded hardware using Compact Flash or SD cards, or as a virtual machine.
WireGuard protocol support
In February 2021, pfSense CE 2.5.0 and pfSense Plus 21.02 added support for a kernel WireGuard implementation. Support for WireGuard was temporarily removed in March 2021 after implementation issues were discovered by WireGuard founder Jason Donenfeld. The July 2021 release of pfSense CE 2.5.2 version re-included WireGuard.
See also
Comparison of firewalls
List of router and firewall distributions
References
Further reading
Mastering pfSense, Second Edition Birmingham, UK: Packt Publishing, 2018. . By David Zientra.
Security: Manage Network Security With pfSense Firewall [Video] Birmingham, UK: Packt, 2018. . By Manuj Aggarwal.
External links
2004 software
BSD software
Firewall software
Free routing software
FreeBSD
Gateway/routing/firewall distribution
Operating system distributions bootable from read-only media
Products introduced in 2004
Routers (computing)
Wireless access points
|
https://en.wikipedia.org/wiki/Superposition%20theorem
|
The superposition theorem is a derived result of the superposition principle suited to the network analysis of electrical circuits. The superposition theorem states that for a linear system (notably including the subcategory of time-invariant linear systems) the response (voltage or current) in any branch of a bilateral linear circuit having more than one independent source equals the algebraic sum of the responses caused by each independent source acting alone, where all the other independent sources are replaced by their internal impedances.
To ascertain the contribution of each individual source, all of the other sources first must be "turned off" (set to zero) by:
Replacing all other independent voltage sources with a short circuit (thereby eliminating difference of potential i.e. V=0; internal impedance of ideal voltage source is zero (short circuit)).
Replacing all other independent current sources with an open circuit (thereby eliminating current i.e. I=0; internal impedance of ideal current source is infinite (open circuit)).
This procedure is followed for each source in turn, then the resultant responses are added to determine the true operation of the circuit. The resultant circuit operation is the superposition of the various voltage and current sources.
The superposition theorem is very important in circuit analysis. It is used in converting any circuit into its Norton equivalent or Thevenin equivalent.
The theorem is applicable to linear networks (time varying or time invariant) consisting of independent sources, linear dependent sources, linear passive elements (resistors, inductors, capacitors) and linear transformers.
Superposition works for voltage and current but not power. In other words, the sum of the powers of each source with the other sources turned off is not the real consumed power. To calculate power we first use superposition to find both current and voltage of each linear element and then calculate the sum of the multiplied voltages and currents.
However, if the linear network is operating in steady-state and each external independent source has a different frequency, then superposition can be applied to compute the average power or active power. If at least two independent sources have the same frequency (for example in power systems, where many generators operate at 50 Hz or 60 Hz), then superposition can't be used to determine average power.
Gas pressure analogy
The electric circuit superposition theorem is analogous to Dalton's law of partial pressure which can be stated as the total pressure exerted by an ideal gas mixture in a given volume is the algebraic sum of all the pressures exerted by each gas if it were alone in that volume.
References
Electronic Devices and Circuit Theory (9th ed.) by Boylestad and Nashelsky
Basic Circuit Theory by C. A. Desoer and E. H. Kuh
''Edward Hughes revised by John.K, Keith.B etal (2008) Electrical and Electronic Technology (10th ed.) Pearson page 75-77
External l
|
https://en.wikipedia.org/wiki/Query%20throughput
|
In computer science, query throughput (QthD) is a measurement used to determine the performance of a database system. The throughput metric is a classical throughput measure characterizing the ability of the system to support a multi-user workload in a balanced way.
Background
In the background there is an update stream that runs a series of insert/delete operations (one pair for each query user). The choice of the number of users is at the discretion of the test sponsor.
The throughput metric is computed as the total amount of work (S×17), converted to hours from seconds (3600 seconds per hour), scaled by the database volume (SF) and divided by the total elapsed time (Ts) required between the first query starting and the last query or update function completing.
Therefore, the complete formulation is:
References
Computer performance
Temporal rates
|
https://en.wikipedia.org/wiki/Scratches%20%28video%20game%29
|
Scratches is a mystery adventure computer game by game developer Nucleosys. Scratches is the first commercial adventure game ever to be made in Argentina.
Plot
The game tells the story of the Blackwood estate on the outskirts of Rothbury, a small rural town in Northumberland, England in 1976.
Originally owned by James T. Blackwood in 1963, the house is passed to Christopher Milton after Mr. Blackwood is accused of murdering his wife. A couple of days later, Mr. Blackwood dies of a sudden heart attack though some in the town start rumors that he might have committed suicide. The police decide to close the case seeing there is no further evidence left. Shortly after acquiring the house, Milton inexplicably disappears in 1970 leaving no visible trace.
The player assumes the role of the house's next inhabitant, Michael Arthate, an author seeking seclusion to work on his next book. He moves in only to find that the house still echoes its horrible past quite literally as scratches are heard all around, particularly in the basement and fireplaces, and soon becomes more interested in researching the house's history than his writing.
In the end, it is revealed the scratches were being caused by Robin, the deformed son of James and Catherine, who was locked in the basement. Michael flees the house after this discovery, finishes his novel, and becomes a prolific novelist as a result from his encounter.
Original Ending
Originally, the player was supposed to use an amulet to kill Robin, turning him back into a human. They would themselves die if they were not able to figure the puzzle out. Lead developer Agustin Cordes said the ending was "completely unfair in terms of design," and it was subsequently abandoned.
Last Visit
In the Director's Cut edition of the game, a sidequest called "The Last Visit" continues the narration from where Michael had fled. A reporter is sent to uncover the mysteries of Blackwood Manor before it will be destroyed. The place has become a scene of ruin; full of looting, vandalism, and graffiti. The reporter ultimately discovers Robin, who chases him until Milton appears at the manor to speak with Robin. Robin leaps onto Milton and presumably kills him as the reporter escapes. Blackwood Manor is then demolished and the reporter notes that the mystery of a mask found inside the home remains unsolved.
Cast
James Thomas Blackwood: An eccentric gentleman, Mr. Blackwood had always been a prominent figure in Rothbury, his hometown since his childhood, being one of the most successful construction engineers in the region.
Catherine Lydia Blackwood: James Blackwood's enigmatic wife, an English teacher at a local school in Rothbury.
Christopher Edward Milton: An intimate friend and longtime doctor to the Blackwood family.
Eva Mariani: Miss Mariani, an Italian immigrant and aspiring professional photographer, was the Blackwood family's maid for several years.
William Bailey: Mr Bailey, a now-retired police chief, was in charge of t
|
https://en.wikipedia.org/wiki/C%20Channel
|
C Channel was a short-lived Canadian premium television channel specialising in arts programming. It was one of Canada's first licensed "pay TV" channels when it began in 1983 but it ended in failure within five months.
History
Toronto-based company Lively Arts Market Builders Inc. was one of several companies that received a license from the Canadian Radio-television and Telecommunications Commission (CRTC) to provide a subscription television service for Canadian cable companies. The company's offering, C Channel, would feature artistic content such as theatrical, opera, and ballet performances. This format was distinct from the other new pay-movie services, First Choice and Superchannel.
C Channel, First Choice, and Superchannel began their broadcasts on February 1, 1983. C Channel's President Edgar Cowan predicted 200,000 subscribers and financial equilibrium within a year.
Programming
C Channel was required, as a condition of license from the CRTC, to spend no less than 20% of its revenues and 50% of its expenditures on Canadian-produced programming. The channel had planned to spend C$4 million in production during its initial seven months of broadcasting.
C Channel held a two-night preview of its programming on January 20–21, cablecast on most cable systems, such as Greater Winnipeg Cablevision, which was actually not able to carry the real service due to the dispute with the Manitoba Telephone System (MTS).
On the first night, there were only two programs, beginning at 8 p.m. (Eastern Standard Time): Swan Lake, performed by the Royal Ballet at the Royal Opera House in London, England. The other was a film originally released in 1980, The Last Metro.
One of the programs featured was a Bach-themed concert performed by flautist James Galway and violinist Kyung-wha Chung, while jazz enthusiasts could watch performances from the Montreal International Jazz Festival.
Stereo audio broadcasts using available cable FM channels were permitted by the CRTC on February 11, 1983. C Channel immediately activated its stereo audio feed when it received this approval.
One of its marquee presentations was the Royal Shakespeare Company's 8½ hour production of The Life and Adventures of Nicholas Nickleby acquired from Britain's Channel 4. The program ran on March 13, 1983, from 1 p.m. to midnight with breaks for lunch, tea, and dinner.
Hours
C Channel initially broadcast approximately 8 hours per day, beginning at 7 p.m. (Eastern) with the children's programming block and ended approximately 11 p.m. or midnight. The station planned to expand the schedule by May 1983 with an earlier daily on-air time with the broadcast day ending at approximately 3:30 a.m. C Channel president Ed Cowan had hoped to implement a 24-hour schedule later that year.
Demise
The three Canadian premium channels, at a steep and expensive $16 per channel per subscriber () at a time when a basic cable subscription was $10–12, appealed to only to a small percentage of the ma
|
https://en.wikipedia.org/wiki/Ultimate%20Hustler
|
Ultimate Hustler was an American reality show broadcast on Black Entertainment Television created by Datari Turner. The show featured Damon Dash training 16 aspiring entrepreneurs, both men and women, who compete for an executive position to work for Damon Dash. Based on its premise, the show has been described as a hip-hop version of The Apprentice.
Lifetime
The program was first broadcast on October 4, 2005, with the final episode on December 13, 2005, with Brian Rikuda winning the top prize.
Hustlers
Jennifer Bayer
Christopher C.
Matthew McGreevy
Laurence Chandler
Tichanda Daniels
Shola Adisa-Farrar
Ray Freeman
Kwame Gates
Jermel H., "Sharp"
Will L.
Brian Rikuda (Winner)
Dashawn Taylor
Kira Vince
Dominic Sauer
Alphonzo Terrell
Ashley Williams
Tarisha Brown, a.k.a. "Seven"
References
BET original programming
2005 American television series debuts
2005 American television series endings
2000s American reality television series
|
https://en.wikipedia.org/wiki/Algorithmically%20random%20sequence
|
Intuitively, an algorithmically random sequence (or random sequence) is a sequence of binary digits that appears random to any algorithm running on a (prefix-free or not) universal Turing machine. The notion can be applied analogously to sequences on any finite alphabet (e.g. decimal digits). Random sequences are key objects of study in algorithmic information theory.
As different types of algorithms are sometimes considered, ranging from algorithms with specific bounds on their running time to algorithms which may ask questions of an oracle machine, there are different notions of randomness. The most common of these is known as Martin-Löf randomness (K-randomness or 1-randomness), but stronger and weaker forms of randomness also exist. When the term "algorithmically random" is used to refer to a particular single (finite or infinite) sequence without clarification, it is usually taken to mean "incompressible" or, in the case the sequence is infinite and prefix algorithmically random (i.e., K-incompressible), "Martin-Löf–Chaitin random".
It is important to disambiguate between algorithmic randomness and stochastic randomness. Unlike algorithmic randomness, which is defined for computable (and thus deterministic) processes, stochastic randomness is usually said to be a property of a sequence that is a priori known to be generated by (or is the outcome of) an independent identically distributed equiprobable stochastic process.
Because infinite sequences of binary digits can be identified with real numbers in the unit interval, random binary sequences are often called (algorithmically) random real numbers. Additionally, infinite binary sequences correspond to characteristic functions of sets of natural numbers; therefore those sequences might be seen as sets of natural numbers.
The class of all Martin-Löf random (binary) sequences is denoted by RAND or MLR.
History
The first suitable definition of a random sequence was given by Per Martin-Löf in 1966. Earlier researchers such as Richard von Mises had attempted to formalize the notion of a test for randomness in order to define a random sequence as one that passed all tests for randomness; however, the precise notion of a randomness test was left vague. Martin-Löf's key insight was to use the theory of computation to formally define the notion of a test for randomness. This contrasts with the idea of randomness in probability; in that theory, no particular element of a sample space can be said to be random.
Since its inception, Martin-Löf randomness has been shown to admit many equivalent characterizations—in terms of compression, randomness tests, and gambling—that bear little outward resemblance to the original definition, but each of which satisfy our intuitive notion of properties that random sequences ought to have: random sequences should be incompressible, they should pass statistical tests for randomness, and it should be difficult to make money betting on them. The existence of the
|
https://en.wikipedia.org/wiki/PS4%20%28disambiguation%29
|
The PlayStation 4 is a video game console by Sony Computer Entertainment.
PS4, Ps-4 or Ps 4 may also refer to:
Psalm 4
Phantasy Star IV: The End of the Millennium, sometimes abbreviated to PS4, a role-playing game for the Mega Drive
Squirt PS4, a product by Leatherman
1986 PS4, the main-belt asteroid 5950 Leukippos
Southern Railway Ps-4 class, a 4-6-2 steam locomotive
|
https://en.wikipedia.org/wiki/KRFC
|
KRFC (88.9 MHz) is a community-based FM radio station in Fort Collins, Colorado. The station is owned and operated by Public Radio for the Front Range. The station's programming includes music of numerous genres, played by volunteer DJs. Some news, information and syndicated shows are on the schedule as well. Although similar in funding strategies to a traditional public radio station, KRFC is not a member of any of the major networks such as NPR or Pacifica.
KRFC has an effective radiated power (ERP) of 50,000 watts, with a signal extending from the Wyoming border to the suburbs of Denver. The transmitter is on Weld County Route 80 near Route 17 in Severance, Colorado.
History
Public Radio for the Front Range (PRFR) was started by a group of former DJs from KCSU-FM. DJs who were not current students were forced to leave after KCSU-FM's underwriter, Colorado State University, decided to make KCSU-FM solely student-run. In September 1995, PRFR was given IRS 501(C)(3) non-profit status.
By the summer of 1996, PRFR had applied for a construction permit from the Federal Communications Commission (FCC). The group wanted to build a station on 88.9 MHz, but were challenged by other broadcasting groups. PRFR then went into negotiations during 1997 with Colorado Christian University to share 88.9 MHz; these negotiations failed.
By 2000, the group applied for the 89.7 MHz frequency in a low-power jurisdiction; another Christian group applied for the same frequency. After successful negotiations, PRFR came into agreement with the other applicants that the PRFR would receive 88.9 MHz. The agreement was submitted to the FCC on July 7, 2002, who then granted PRFR a construction permit for a 3,000–watt non-commercial radio station. KRFC 88.9 FM Radio Fort Collins began broadcasting on March 1, 2003.
In 2004, KFRC completed the construction and expansion of its studios. Its facilities include three separate studios, all of which have the ability to broadcast live. Volunteers continue to make up the majority of KRFC 88.9 FM Radio Fort Collins' workforce. In 2022, the station increased its power to 50,000 watts and constructed its own antenna tower. This gives it a larger area of Colorado able to receive its signal.
See also
List of community radio stations in the United States
References
External links
KRFC 88.9 FM Radio Fort Collins Homepage
RFC
Community radio stations in the United States
Radio stations established in 2003
|
https://en.wikipedia.org/wiki/Grand%20Concourse
|
Grand Concourse can refer to:
Grand Concourse (Bronx), a boulevard in New York City
Grand Concourse (St. John's), an integrated walkway network in Newfoundland and Labrador
Grand Concourse (restaurant), an eatery owned by Landry's, Inc. in Pittsburgh
See also
Grand Concourse Apartments, in Miami
Grand Concourse buses
|
https://en.wikipedia.org/wiki/XPG
|
The acronym XPG can refer to the following:
XPG ("Xtreme Performance Gear"), the gaming hardware and accessories product line of the Taiwanese memory and storage manufacturer ADATA
Paris Gare du Nord, railway station, IATA airport code.
X/Open Portability Guide, which specifies the requirements for any system which is intended to be a Unix system, and a predecessor to the POSIX standard
Xeroderma pigmentosum, complementation group G, a genetic disorder and a possible source of skin tumors
an endonuclease involved in nucleotide excision repair
|
https://en.wikipedia.org/wiki/X.32
|
X.32 is an old ITU-T standard published in 1984 for connecting to an X.25 network by dial-up. It defines how the network identifies the terminal for billing and security purposes.
Further reading
External links
ITU-T Recommendation X.32
ITU-T recommendations
ITU-T X Series Recommendations
X.25
|
https://en.wikipedia.org/wiki/EAX%20mode
|
EAX mode (encrypt-then-authenticate-then-translate) is a mode of operation for cryptographic block ciphers. It is an Authenticated Encryption with Associated Data (AEAD) algorithm designed to simultaneously provide both authentication and privacy of the message (authenticated encryption) with a two-pass scheme, one pass for achieving privacy and one for authenticity for each block.
EAX mode was submitted on October 3, 2003 to the attention of NIST in order to replace CCM as standard AEAD mode of operation, since CCM mode lacks some desirable attributes of EAX and is more complex.
Encryption and authentication
EAX is a flexible nonce-using two-pass AEAD scheme with no restrictions on block cipher primitive to be used, nor on block size, and supports arbitrary-length messages. Authentication tag length is arbitrarily sizeable up to the used cipher's block size.
The block cipher primitive is used in CTR mode for encryption and as OMAC for authentication over each block through the EAX composition method, that may be seen as a particular case of a more general algorithm called EAX2 and described in The EAX Mode of Operation
The reference implementation in the aforementioned paper uses AES in CTR mode for encryption combined with AES OMAC for authentication.
Performance
Being a two-pass scheme, EAX mode is slower than a well designed one-pass scheme based on the same primitives.
EAX mode has several desirable attributes, notably:
provable security (dependent on the security of the underlying primitive cipher);
message expansion is minimal, being limited to the overhead of the tag length;
using CTR mode means the cipher need be implemented only for encryption, in simplifying implementation of some ciphers (especially desirable attribute for hardware implementation);
the algorithm is "on-line", that means that can process a stream of data, using constant memory, without knowing total data length in advance;
the algorithm can pre-process static Associated Data (AD), useful for encryption/decryption of communication session parameters (where session parameters may represent the Associated Data).
Notably, CCM mode lacks the last 2 attributes (CCM can process Associated Data, it can't pre-process it).
Patent status
The authors of EAX mode, Mihir Bellare, Phillip Rogaway, and David Wagner placed the work under public domain and have stated that they were unaware of any patents covering this technology. Thus, EAX mode of operation is believed to be free and unencumbered for any use.
Use
A modification of the EAX mode, so called EAX′ or EAXprime, is used in the ANSI C12.22 standard for transport of meter-based data over a network. In 2012 Kazuhiko Minematsu, Stefan Lucks, Hiraku Morita and Tetsu Iwata published a paper that proves the security of the mode with messages longer than the key, but demonstrates a trivial attack against short messages using this mode. The authors stated that they did not know whether the ANSI C12.22 protocols were v
|
https://en.wikipedia.org/wiki/X.PC
|
X.PC is a deprecated communications protocol developed by McDonnell-Douglas for connecting a personal computer to its Tymnet packet-switched public data telecommunications network. It is a subset of X.25, a CCITT standard for packet-switched networks. It is a full-duplex, asynchronous and error-correcting network protocol that supports up to 15 simultaneous channels. It maintains automatic error correction during any communications session between two or more computers.
X.PC was originally developed to enable connections up to 9600 baud. Unlike MNP, a competing standard proposed by Microcom, X.PC was placed in the public domain for royalty-free usage. MNP, on the other hand, initially required a $2,500 licensing fee. Microcom battled X.PC for acceptance in the marketplace, and eventually released MNP 1 through 3 into the public domain to compete.
At the time, several modem manufacturers supported MNP in their products, Microcom and Racal-Vadic being major examples. Several companies announced support for X.PC, including Hayes, but none of the companies announcing support offered it in their modems. X.PC quickly disappeared, and Microcom would go on to release MNP 4 and 5 into the public domain as well.
References
External links
http://www.mactech.com/articles/mactech/Vol.02/02.01/ProtocolStandards/
Network protocols
X.25
|
https://en.wikipedia.org/wiki/Labtec
|
Labtec Enterprises Inc. was an American manufacturer of computer accessories active as an independent company from 1980 to 2001. They were best known for their budget range of peripherals such as keyboards, mice, microphones, speakers and webcams. In the United States, the company had cornered the market for computer speakers and headphones for much of the 1990s before being acquired by Logitech in 2001.
History
Labtec Enterprises Inc. was founded in 1980 by Charles Dunn and based in Vancouver, Washington, for most of its independent existence. The company was initially focused on providing audio gear (primarily headsets) for the airline industry before branching out to providing peripherals for personal computers in 1990. By the mid-1990s Labtec catered to three segments: the personal computer buyer, providing speakers and microphones; the airline industry, providing headphones and headsets; and the professional audiovisual and telephonics industry, providing audio cables, switches, and junction boxes. The company employed 20 people domestically at the company's combined headquarters and warehouse in Vancouver, Washington, in 1993. The bulk of the company's products meanwhile were manufactured overseas in Hong Kong and Taiwan. In 1993, the company was selling about 150,000 speakers to consumers a month.
In 1998, Labtec merged with Spacetec IMC Corporation, becoming a new publicly traded corporation in the process. The combined company changed its name to Labtec Inc. in February 1999. Spacetec IMC had manufactured 6DOF controllers for use with CAD software. A Spaceball 2003 controller was used to control the Mars Pathfinder spacecraft in 2000.
In 2001, Logitech bought Labtec for approximately USD$125 million in cash, stock and debt in order to expand its line of audio products for personal computers and other devices.
References
External links
Telecommunications companies of the United States
Telecommunications equipment vendors
Videotelephony
Companies based in Vancouver, Washington
Telecommunications companies established in 1981
Technology companies disestablished in 2001
Logitech
Defunct computer companies of the United States
|
https://en.wikipedia.org/wiki/XDB%20Enterprise%20Server
|
XDB Enterprise Server is a relational database management system (DBMS), which was available for DOS, Windows NT and OS/2, and was compatible with IBM's DB2 database. DOS version was released in 1988 as one of the earliest DOS-based SQL database servers. The system was developed by XDB Systems, Inc., which was acquired by Micro Focus International group in 1998. It is still shipped with Micro Focus' COBOL software.
See also
Comparison of relational database management systems
References
Proprietary database management systems
Micro Focus International
|
https://en.wikipedia.org/wiki/P2000
|
P2000 may stand for:
P-2000 (album), a 2000 EP by black metal band Enthroned
P2000 (network), a nationwide pager-network used by emergency services in the Netherlands
Heckler & Koch P2000, a semi-automatic pistol manufactured by Heckler & Koch
Philips P2000, a home computer that used to be made by Philips
Archer-class patrol vessel, a class of Royal Navy patrol boat also known as the P2000 class
Partnership 2000, a program connecting some 550 Jewish communities in the Diaspora with 45 Israel Partnership areas
2000 United States presidential election
Preservation 2000, a land conservation program in Florida that preceded Florida Forever
Siemens P2000, a light rail vehicle for the Los Angeles Metro Rail
|
https://en.wikipedia.org/wiki/XPC
|
XPC may refer to the following:
Pecheneg language, ISO 639-3 code 'xpc'
Shuttle XPC, popular line of barebones computers and cases.
SPEC XPC, the X Performance Characterization group working under the SPEC GPC group.
Xeroderma pigmentosum, complementation group C, a human gene
xPC Target, a product from MathWorks
XPC Golf Clubs, a proprietary brand from Golfsmith
|
https://en.wikipedia.org/wiki/Green%20Monday
|
Green Monday is an online retail industry term similar to Cyber Monday. The term was coined by Shopping.com, an eBay company, in 2007 to describe the best eCommerce sales day in December, usually the second Monday of December. After doing some internal research, they realized that the second Monday in December was the last day that shoppers were able to place an online order that would arrive in time for the holidays. Green Monday is defined more specifically by business research organization comScore as the last Monday with at least 10 days prior to Christmas.
In 2009, $854 million was spent online in the US on Green Monday, with sales in 2011 reaching $1.133 billion. In 2012, Green Monday topped out at $1.27 billion, up 13% from 2011 and the third heaviest online sales day for the season behind Cyber Monday and Dec. 4, 2012 (which had no marketing tie-in), according to comScore.
See also
Green Friday
Black Friday (shopping)
Buy Nothing Day
Small Business Saturday
Super Saturday (Panic Saturday)
Cyber Monday
Giving Tuesday
References
Business terms
E-commerce in the United States
Monday observances
December observances
Holidays and observances by scheduling (nth weekday of the month)
|
https://en.wikipedia.org/wiki/Xmark93
|
Xmark93 is a standardized benchmarking tool for measuring the performance of computer systems running the X Window System. It was developed by the SPEC XPC group in 1993.
Xmark93 allows systems evaluators and vendors to compare the performance of X server/hardware systems for a broad set of X basic functions, covering a wide range of applications. The benchmark provides a standardized method for summarizing X11perf results, providing a single-number measure of overall X11 server/hardware performance.
Specifications
Xmark93 is derived by calculating the ratio between the geometrically weighted mean of the 447 individual X11perf tests for the server/hardware being evaluated and the corresponding results from a Sun Microsystems SPARCstation 1. Weightings for each of the X11perf tests were obtained by a survey of X11 technical experts. The weightings reflect the experts' ratings of the relative importance of individual X11perf operations within a wide mix of applications.
Benchmarks (computing)
X Window System
|
https://en.wikipedia.org/wiki/National%20Heads-Up%20Poker%20Championship
|
The National Heads-Up Poker Championship was an annual poker tournament held in the United States and produced by the NBC television network. It is a $25,000 "buy-in" invitation-only tournament organized as a series of one-on-one games of no limit Texas hold 'em matches. The participants include many of the world's most successful poker players, as well as celebrities.
The championship was the first poker event to be televised on and produced by a major U.S. television network.
In October 2011, NBC announced that the National Heads-Up Poker Championship would not return in 2012, ending the championship's seven-year run. After a one-year hiatus, the tournament returned for a final time in 2013.
The $25,000 buy-in event ran from Jan. 24 through 26 at Caesars Palace, the same venue where the event was held from 2006 through 2011.
In February 2014, NBC announced the National Heads-Up Poker Championship would not return in 2014.
The Heads-Up Championship had been sponsored by online poker companies before Black Friday. The World Series of Poker (WSOP.com) is the new presenting sponsor.
Structure
The single-elimination tournament is modeled after college basketball tournaments. Players who win a match advance to the next round; the player who wins six matches is crowned champion.
The first round is seeded randomly the night before the tournament begins. Players are divided into four brackets – Clubs, Diamonds, Hearts, and Spades. A participant advances by winning a heads-up match against his or her randomly drawn opponent. The structure of the brackets then determines every match thereafter. The semifinals consist of one player from each bracket, with the winner of the Spades bracket playing the winner of the Clubs bracket, and the winner of the Hearts bracket matched up against the winner of the Diamonds bracket. A best-of-three final match then determines which of the two finalists is crowned champion.
Brief history
The National Heads-Up Poker Championship is an invitation-only event. In contrast, the World Heads-Up Poker Championship is an open event with a maximum participation of 128 players.
The 2005 event took place at the Golden Nugget Las Vegas between March 4 and March 6. It aired weekly on NBC from May 1 to May 22 with commentary from Gabe Kaplan and Matt Vasgersian.
The 2006 edition took place from March 4 to 6 at Caesars Palace in Las Vegas. NBC began its coverage by broadcasting one part of the opening round on April 16. The semi-final and championship matches aired May 21. Kaplan and Vasgersian returned as commentators.
The 2007 edition was broadcast from April 8 to May 20. Ali Nejad took Gabe Kaplan's spot as commentator due to Kaplan competing in the tournament.
Results
See also
Poker After Dark
High Stakes Poker
World Series of Poker
References
Poker tournaments
NBC original programming
Television shows about poker
Poker in North America
|
https://en.wikipedia.org/wiki/Adaptive%20heap%20sort
|
In computer science, adaptive heap sort is a comparison-based sorting algorithm of the adaptive sort family. It is a variant of heap sort that performs better when the data contains existing order. Published by Christos Levcopoulos and Ola Petersson in 1992, the algorithm utilizes a new measure of presortedness, Osc, as the number of oscillations. Instead of putting all the data into the heap as the traditional heap sort did, adaptive heap sort only take part of the data into the heap so that the run time will reduce significantly when the presortedness of the data is high.
Heapsort
Heap sort is a sorting algorithm that utilizes binary heap data structure. The method treats an array as a complete binary tree and builds up a Max-Heap/Min-Heap to achieve sorting. It usually involves the following four steps.
Build a Max-Heap(Min-Heap): put all the data into the heap so that all nodes are either greater than or equal (less than or equal to for Min-Heap) to each of its child nodes.
Swap the first element of the heap with the last element of the heap.
Remove the last element from the heap and put it at the end of the list. Adjust the heap so that the first element ends up at the right place in the heap.
Repeat Step 2 and 3 until the heap has only one element. Put this last element at the end of the list and output the list. The data in the list will be sorted.
Below is a C/C++ implementation that builds up a Max-Heap and sorts the array after the heap is built.
/*
A C/C++ sample heap sort code that sort an array to an increasing order
*/
// A function that build up a max-heap binary tree
void heapify(int array[], int start, int end)
{
int parent = start;
int child = parent * 2 + 1;
while (child <= end)
{ if (child + 1 <= end) // when there are two child nodes
{
if (array[child + 1] > array[child])
{
child ++; //take the bigger child node
}
}
if (array[parent] > array[child])
{
return; //if the parent node is greater, then it's already heapified
}
if (array[parent] < array[child]) // when child node is greater than parent node
{
swap (array[parent], array[child]); // switch parent and child node
parent = child;
child = child * 2 + 1; //continue the loop, compare the child node and its child nodes
}
}
}
// heap_sort function
void heap_sort (int array[], int len)
{
for (int i = len/2 - 1; i >= 0; i--) //Step 1: build up the max-heap
{
heapify(array, i, len);
}
for (int i = len - 1; i >= 0; i--) //Step 4: repeat step 2 and 3 till finished
{
swap(array[0], array[i]); // Step 2: put the max at the end of the array
heapify (array, 0, i-1); // Step 3: remove the max from the tree and heapify again
}
}
int main()
{
//the array that will be sorted
int array[] = {42, 1283, 123, 654, 239847, 45, 97, 85, 763, 90, 770, 616, 328, 1444, 911, 315, 38, 5040, 1};
int array_len = sizeof(array)/sizeof(*array); //length of the array
heap_sort (array, array_len);
return 0;
}
Measures o
|
https://en.wikipedia.org/wiki/Adaptive%20sort
|
A sorting algorithm falls into the adaptive sort family if it takes advantage of existing order in its input. It benefits from the presortedness in the input sequence – or a limited amount of disorder for various definitions of measures of disorder – and sorts faster. Adaptive sorting is usually performed by modifying existing sorting algorithms.
Motivation
Comparison-based sorting algorithms have traditionally dealt with achieving an optimal bound of O(n log n) when dealing with time complexity. Adaptive sort takes advantage of the existing order of the input to try to achieve better times, so that the time taken by the algorithm to sort is a smoothly growing function of the size of the sequence and the disorder in the sequence. In other words, the more presorted the input is, the faster it should be sorted.
This is an attractive feature for a sorting algorithm because nearly sorted sequences are common in practice. Thus, the performance of existing sort algorithms can be improved by taking into account the existing order in the input.
Note that most worst-case sorting algorithms that do optimally well in the worst-case, notably heap sort and merge sort, do not take existing order within their input into account, although this deficiency is easily rectified in the case of merge sort by checking if the last element of the lefthand group is less than (or equal) to the first element of the righthand group, in which case a merge operation may be replaced by simple concatenation – a modification that is well within the scope of making an algorithm adaptive.
Examples
A classic example of an adaptive sorting algorithm is Straight Insertion Sort. In this sorting algorithm, we scan the input from left to right, repeatedly finding the position of the current item, and insert it into an array of previously sorted items.
In pseudo-code form, the Straight Insertion Sort algorithm could look something like this (array X is zero-based):
procedure Straight Insertion Sort (X):
for j := 1 to length(X) - 1 do
t := X[j]
i := j
while i > 0 and X[i - 1] > t do
X[i] := X[i - 1]
i := i - 1
end
X[i] := t
end
The performance of this algorithm can be described in terms of the number of inversions in the input, and then will be roughly equal to , where is the number of Inversions. Using this measure of presortedness – being relative to the number of inversions – Straight Insertion Sort takes less time to sort the closer it is to being sorted.
Other examples of adaptive sorting algorithms are adaptive heap sort, adaptive merge sort, patience sort, Shellsort, smoothsort, splaysort, Timsort, and Cartesian tree sorting.
See also
Sorting algorithms
Smoothsort
References
Sorting algorithms
|
https://en.wikipedia.org/wiki/West%2057th
|
West 57th can refer to:
West 57th Street (Manhattan) a street in New York City
West 57th (TV series), a news magazine program which aired on the CBS Television Network from 1985 to 1989
|
https://en.wikipedia.org/wiki/Rafferty%27s%20Rules
|
Rafferty's Rules is an Australian television drama series which ran from 1987 to 1991 on the Seven Network.
The producers of the series were Posie Graeme-Evans (1987–1988), and Denis Phelen. The directors were Graham Thorburn, Mike Smith and Russell Webb. The writers were David Allen, John Upton, Tim Gooding and David Marsh.
Rafferty's Rules was one of the first programs undertaken by the Seven Network's then new in-house drama unit, going into production in May 1985 as "a 15-part courtroom drama". The program had started out as a pilot episode, recorded in early 1984 with the actor Chris Haywood in the lead role. When the pilot episode was remounted later in 1984, Chris Haywood wasn't available and the lead role was re-cast to John Wood. This second recording was eventually broadcast as the program's first episode. Initially it was hoped that the program would make its debut during the 1985 ratings season and there was an option to extend the series to 26 episodes if the initial response was positive.
By mid-1986, the media was asking questions as to why the series, "which had more pilots than TAA", had yet to appear. On Sunday 15 June 1986, The Sun-Herald TV Guide said, "The series was made last year and scripting of a new series has almost been completed".
Rafferty's Rules eventually debuted on the Seven Network in February 1987.
The series was also shown in New Zealand on TV3 in 1989, and in the UK on Satellite channel Lifestyle in 1991. In New Zealand, it was shown Fridays at 9:30pm. In the UK, it was shown daily at 14:00.
In Australia, the series was last replayed nationally at 3pm weekdays in 2006 on the Seven Network, although not entirely. Prior to that, Seven broadcast the series at the 10-11am weekday timeslot in the late 1990s. More recently, the series was available on the 7plus "on-demand" service.
Awards
John Wood received the Logie Award for Most Outstanding Actor in both 1988 and 1989, and Catherine Wilkin received the Logie Award for Most Outstanding Actress in 1988.
Rafferty's Rules was named Best Drama Series at the 1988 Penguin Awards, while Peter Carroll won Best Actor in a Series and Michael Cove won Best Scriptwriter for Drama Series.
Plot
Michael Aloysius Rafferty, who is a stipendiary magistrate, drives to work in an old blue VW Kombi van. He owns a cat named Rhubarb.
Rafferty is separated from his wife, with whom he had two children (a son and a daughter).
Rafferty also has an older daughter, Rebecca Browning, who is in her early twenties — and of whose existence he was unaware until she contacted him after she had grown up. (Rebecca's mother is a woman who Michael Rafferty had known before he met his wife, and who he had not seen since his marriage.)
Rafferty also has a brother, Patrick Rafferty, who is a state Member of Parliament.
Cast
Main/regular
John Wood as Michael Rafferty, S.M.
Simon Chilvers as Sgt. Julian Flicker, Police Prosecutor
Arky Michael as Fulvio Frangellomini, Court Clerk
Terry Seri
|
https://en.wikipedia.org/wiki/Eagle%20Rock%20Entertainment
|
Eagle Rock Entertainment is an international producer and distributor of music films and programming. It operates two record labels (Eagle Records and Armoury Records), a full-service production company (Eagle Rock Productions) and a music publishing subsidiary (Eagle-i Music).
History
Eagle Rock Entertainment was founded in April 1997 by Terry Shand, Geoff Kempin and Julian Paul, three former colleagues at Castle Communications, with capital coming from BMG. It was later acquired by Edel Records and in 2001 entirely sold to the British investment company HgCapital for £34 million. In 2007 a minority stake was re-acquired by Edel AG. The Eagle Vision division was established in 2000. Eagle Rock Entertainment's headquarters are in London with offices in New York and affiliate offices around the world. In April 2014, Eagle Rock Entertainment was acquired by Universal Music Group. Universal Music's purchase of Eagle followed that of much of EMI. Terry Shand continues to lead the company as chairman and CEO from its headquarters in London. In 2020, Universal Music established Mercury Studios which absorbed Eagle Rock Entertainment.
Awards
The company won a Grammy Award for The Doors documentary When You're Strange in 2010.
See also
List of record labels
References
External links
Record labels established in 1997
IFPI members
British record labels
Music publishing companies of the United Kingdom
Labels distributed by Universal Music Group
|
https://en.wikipedia.org/wiki/Threaded%20binary%20tree
|
In computing, a threaded binary tree is a binary tree variant that facilitates traversal in a particular order (often the same order already defined for the tree).
An entire binary search tree can be easily traversed in order of the main key, but given only a pointer to a node, finding the node which comes next may be slow or impossible. For example, leaf nodes by definition have no descendants, so given only a pointer to a leaf node no other node can be reached. A threaded tree adds extra information in some or all nodes, so that for any given single node the "next" node can be found quickly, allowing tree traversal without recursion and the extra storage (proportional to the tree's depth) that recursion requires.
Threading
"A binary tree is threaded by making all right child pointers that would normally be null point to the in-order successor of the node (if it exists), and all left child pointers that would normally be null point to the in-order predecessor of the node."
This assumes the traversal order is the same as in-order traversal of the tree. However, pointers can instead (or in addition) be added to tree nodes, rather than replacing. Linked lists thus defined are also commonly called "threads", and can be used to enable traversal in any order(s) desired. For example, a tree whose nodes represent information about people might be sorted by name, but have extra threads allowing quick traversal in order of birth date, weight, or any other known characteristic.
Motivation
Trees, including (but not limited to) binary search trees, can be used to store items in a particular order, such as the value of some property stored in each node, often called a key. One useful operation on such a tree is traversal: visiting all the items in order of the key.
A simple recursive traversal algorithm that visits each node of a binary search tree is the following. Assume is a pointer to a node, or . "Visiting" can mean performing any action on the node or its contents.
Algorithm traverse():
Input: a pointer to a node (or )
If , return.
Else:
traverse(left-child())
Visit
traverse(right-child())
One problem with this algorithm is that, because of its recursion, it uses stack space proportional to the height of a tree. If the tree is fairly balanced, this amounts to space for a tree containing elements. In the worst case, when the tree takes the form of a chain, the height of the tree is so the algorithm takes space. A second problem is that all traversals must begin at the root when nodes have pointers only to their children. It is common to have a pointer to a particular node, but that is not sufficient to get back to the rest of the tree unless extra information is added, such as thread pointers.
In this approach, it may not be possible to tell whether the left and/or right pointers in a given node actually point to children, or are a consequence of threading. If the distinction is necessary, adding a single bit to each node is enough
|
https://en.wikipedia.org/wiki/The%20C%2B%2B%20Programming%20Language
|
The C++ Programming Language is a computer programming book first published in October 1985. It was the first book to describe the C++ programming language, written by the language's creator, Bjarne Stroustrup. In the absence of an official standard, the book served for several years as the de facto documentation for the evolving C++ language, until the release of the ISO/IEC 14882:1998: Programming Language C++ standard on 1 September 1998. As the standard further evolved with the standardization of language and library extensions and with the publication of technical corrigenda, later editions of the book were updated to incorporate the new changes.
History
The first edition of The C++ Programming Language was published in 1985. As C++ evolved, a second edition was published in July 1991, reflecting the changes made.
The third edition of the book was first published on 30 June 1997; a hardcover version of the third edition, with two new appendices, was later published as The C++ Programming Language: Special Edition on 11 February 2000. Both the softcover third edition and the hardcover “special edition” have since undergone several reprintings, with corrections.
C++ Solutions () is a companion book to the third edition of The C++ Programming Language. It contains solutions to selected exercises of The C++ Programming Language.
The fourth edition of the book, which incorporates C++11, was released on May 19, 2013.
See also
The C Programming Language
References
1985 non-fiction books
Addison-Wesley books
Books about C++
|
https://en.wikipedia.org/wiki/Picon
|
Picon may refer to:
Avatar (computing), used in the Apple Computer instant messaging program iChat
Picón, Spain
Picon (apéritif), an apéritif
Picon Punch, a drink popularized by Basque-Americans
One of the Twelve Colonies of Kobol in the television show Battlestar Galactica
Personal icon, referenced in Vismon
People
Gaëtan Picon (1915-1976), French essayist and art critic
José Antonio Picón Sedano (born 1988), Spanish footballer known as Picón
Mariano Picón Salas (1901–1965), Venezuelan diplomat
Molly Picon (1898–1992), American actress
|
https://en.wikipedia.org/wiki/Mental%20Images
|
Mental Images GmbH (stylized as mental images) was a German computer generated imagery (CGI) software firm based in Berlin, Germany, and was acquired by Nvidia in 2007, then rebranded as Nvidia Advanced Rendering Center (ARC), and is still providing similar products and technology. The company provides rendering and 3D modeling technology for entertainment, computer-aided design, scientific visualization and architecture.
The company was founded by the physicists and computer scientists Rolf Herken, Hans-Christian Hege, Robert Hödicke and Wolfgang Krüger and the economists Günter Ansorge, Frank Schnöckel and Hans Peter Plettner as a company with limited liability & private limited partnership (GmbH & Co. KG) in April 1986 in Berlin, Germany. The Mental Ray software project started in 1986. The first versions of the rendering software were influenced, tested and used for production by Mental Images' then operating large commercial computer animation division, led by the visual effects supervisors John Andrew Berton (1986–1989), 2000 Academy Award winner John Nelson (1987–1989), and 1996, and 2000, Academy Award nominee Stefen Fangmeier (1988–1990).
In 2003, Mental Images completed an investment round led by ViewPoint Ventures and another large international private equity investor. Since Dec 2007, Mental Images GmbH is a wholly owned subsidiary of the Nvidia corporation with headquarters in Berlin, subsidiaries in San Francisco (Mental Images Inc.) and Melbourne (Mental Images Pty. Ltd.) as well as an office in Stockholm. After acquisition by Nvidia the company has been renamed Nvidia Advanced Rendering Center (Nvidia ARC GmbH).
Products
Mental Images was the developer of the rendering software Mental Ray, iray, mental mill, RealityServer, and DiCE.
Filmography
Mental Images (1987) (a short film of the same name)
Asterix in America (1994) (3D computer animation "Storm Sequence" and digital effects, software development)
Heaven (2002) (images computed with Mental Ray)
References
External links
Technical Oscars: The 75th Scientific & Technical Awards 2002 / 2003
mental images office at the Kant Dreieck tower
1986 establishments in Germany
2007 mergers and acquisitions
3D graphics software
3D imaging
Computer-aided design software
Nvidia
Software companies established in 1986
Software companies of Germany
|
https://en.wikipedia.org/wiki/Philip%20Gale
|
Philip Chandler Gale (November 15, 1978 – March 13, 1998) was an American pioneering Internet software developer, computer prodigy, and sophomore student at the Massachusetts Institute of Technology (MIT). He was notable for having written Total Access while at MIT, and was hired by EarthLink at the age of 16 to work on its development. In 2008, the company had more than one million users. By the age of 17, Gale had earned roughly a million dollars' worth of stock options at EarthLink for his innovative ISP programs.
In 1995, Gale's father died from a heart attack, and friends said Gale struggled to come to terms with the loss. He returned to MIT in 1996 and became a music major.
Early life and education
Philip Chandler Gale was the eldest child of Marie and David Gale. He had a younger sister Elizabeth. His parents and many of his immediate family were deeply committed to the Church of Scientology. His mother Marie had been in the church from the age of 12, and her parents and grandparents were also believers. Philip's father was a software engineer, and in 1981 had founded RealWorld, a supplier of accounting software. His parents met through the church in Los Angeles, where Marie was on staff and David was a fanatic.
The family moved from Los Angeles to New Hampshire when Philip was young, and he showed "an early aptitude for numbers and machines". Seeing his abilities, Marie taught him at home with another mother, and said that before the age of five, he was reading and doing math at the second and third-grade level. Later they lived in Clearwater, Florida; Charlotte, North Carolina; Utah; and Oregon.
From the age of 8, Gale lived and studied at The Delphian School in Sheridan, Oregon, a private boarding school based on L. Ron Hubbard's study technology. Philip's parents personally knew the founders of the school. He graduated from there at age 14. At that time, his family had moved to Utah. Gale got a job in programming at the marketing firm where his father worked, but he had contentious relations with fellow workers, as he could outperform many older programmers and had a tendency to treat people who were not as intelligent as he with contempt.
College and EarthLink
Gale was admitted to MIT at the age of 15 in 1993. He initially pursued studies in physics and engineering. In addition to his ability in programming, he was an accomplished musician. At MIT, he joined the Phi Sigma Kappa fraternity as a freshman in late 1994.
At 16, Gale wrote an important software program called "Total Access", to increase usage of Internet service providers (ISP). He was hired by EarthLink over Christmas break his first year as a student, and took a 3-semester sabbatical from MIT to work at the company, which had been founded by Sky Dayton, a Scientology member and fellow Delphian School alumnus. As director of research and development, Gale developed his program to increase the ability of the company's internet servers to connect customers to the Inte
|
https://en.wikipedia.org/wiki/Communist%20League%20%28UK%2C%201919%29
|
The Communist League was a small far-left organisation in the United Kingdom which existed during the year of 1919. Its stated goal was to establish a network of workers' councils that would "resist all legislation and industrial action directed against the working class, and ultimately assuming all power, establish a working class dictatorship".
History
Following the Allied victory in World War I and the success of the Bolsheviks in the October Revolution, a growing number of British anarchists became increasingly attracted to Marxist theory and began to synthesize a form of "anarcho-Marxism". This coincided with the re-emergence of anti-parliamentarism within the ranks of many left-wing political parties, including the Independent Labour Party (ILP), Socialist Labour Party (SLP) and British Socialist Party (BSP). This process culminated in an attempt to unite the anarcho-communists with the anti-parliamentary socialists under a single formation, an initiative that was taken up by dissident London branch of the SLP, which in February 1919 proposed the convocation of a unity conference to bring together the nascent British communist movement. The London SLP preemptively drew up a provisional constitution for the new organization, including:
The Communist League was founded in March 1919 by the London District Council of the Socialist Labour Party and various anarchist groups in London and Scotland, including Guy Aldred's Glasgow Anarchist Group. The anarchist newspaper Freedom published a report on the founding conference in which it noted that, despite the League not being itself a specifically anarchist organization, its anti-parliamentary program provided a big step in the direction of anarchism for many of its members, while also reporting on early disputes between the League's members over theoretical issues such as "economic determinism" and the "dictatorship of the proletariat".
The establishment of the Communist League was welcomed further in April 1919 at a London anarchist conference, which claimed that the new-found anti-parliamentarism among socialists and communists was due to anarchists' past propaganda work and called for closer cooperation between anarchists and the Communist League, which eventually resulted in a joint conference being held between the two. Anarchist criticisms of the League even led to the decentralisation of the organization's governing body into a "Local Delegate's Committee", which followed the anarchist model of elected delegates subject to instant recall, with the aim of preventing the rise of "boss domination and cliqueism".
The League set about "agitating, educating and organizing" the working class, entering into workers' committees in order to develop their class consciousness, which the League argued would eventually lead to the overthrow of capitalism and the committees then taking over the administration of the newly-established communist society. As its official organ, the League began publish
|
https://en.wikipedia.org/wiki/Arris%20International
|
Arris International Limited (styled as ARRIS) is an American telecommunications equipment company engaged in data, video and telephony systems for homes and businesses. On April 4, 2019, Arris was acquired by network infrastructure provider CommScope.
History
Originally named Arris Interactive, the company was founded in 1995 in England and Wales as a joint venture between Nortel Networks and Antec Corp. Bob Stanzione was the founding president and CEO. Bruce McClelland took over as CEO on September 1, 2016, with Stanzione becoming executive chairman. In 2001, after Antec bought out Nortel's share, the company was renamed Arris Inc, with its executive offices in Suwanee, Georgia, United States.
On November 8, 2018, CommScope announced an agreement to acquire Arris for $7.4billion. The transaction was completed on April 4, 2019. In the transaction, CommScope also acquired Ruckus Networks and ICX Switch, two companies Arris had recently acquired from Broadcom, with Arris and Ruckus becoming brands of CommScope. Former Arris CEO Bruce McClelland assumed the role of CommScope chief operating officer.
Products
Two of the company's home telephony modems are the TM402P and the TM502G. The firm also produces the SBG6580 wireless cable modem-and-router (residential gateway) unit, among other telecommunications and data-transfer products.
Acquisitions
In November 2001, Arris announced that it would acquire the assets of Cadant Inc., a Naperville, Illinois-based privately held designer and manufacturer of cable modem termination systems. The acquisition was completed on January 31, 2002.
On September 23, 2007, Arris purchased C-COR.
On September 1, 2009, Arris acquired certain assets of EG Technology, Inc., (EGT), an Atlanta-based company. That same month, Arris purchased the assets of Digeo, Inc. (including Moxi), for approximately $20million.
On October 11, 2011, Arris acquired BigBand Networks, for $172million, or $53million net of the estimated cash on hand at BigBand.
On December 19, 2012, Arris announced that it would acquire Motorola Mobility's home unit (the former General Instrument company) from Google for $2.35billion in cash and stock. The acquisition was completed on April 17, 2013. With that acquisition, Arris grew its presence in the set-top box market.
On April 22, 2015, Arris Group agreed to acquire set-top box manufacturer Pace plc of the United Kingdom, and completed the acquisition on January 4, 2016, in a stock-and-cash deal that valued Pace at £1.4 billion ($2.1 billion). The resultant combined group was incorporated in the United Kingdom, but operationally managed from Arris's location in Suwanee, Georgia, United States. Pace shareholders owned 24% of the combined company, and Arris shareholders 76%. Also noteworthy, since Pace had previously acquired Aurora Networks, Arris ended up with those assets as well.
On February 22, 2017, Arris Group announced an agreement to acquire the Ruckus Wireless unit from Broadcom Inc. fo
|
https://en.wikipedia.org/wiki/Processor%20Technology
|
Processor Technology Corporation was a personal computer company founded in April 1975, by Gary Ingram and Bob Marsh in Berkeley, California. Their first product was a 4K byte RAM board that was compatible with the MITS Altair 8800 computer but more reliable than the MITS board. This was followed by a series of memory and I/O boards including a video display module.
Popular Electronics magazine wanted a feature article on an intelligent computer terminal and Technical Editor Les Solomon asked Marsh and Lee Felsenstein to design one. It was featured on the July 1976, cover and became the Sol-20 Personal Computer. The first units were shipped in December 1976 and the Sol-20 was a very successful product. The company failed to develop next generation products and ceased operations in May 1979.
History
Bob Marsh, Lee Felsenstein and Gordon French started designing the Sol-20 between April and July 1975. The Sol-20 utilized the Intel 8080 8-bit microprocessor chip, running at 2 MHz. A major difference between the Sol-20 and most other machines of the era was its built-in video driver, which allowed it to be attached to a composite monitor for display. The Sol-20 consisted of a main motherboard (PCB) mounted at the bottom of the case, and a five slot S-100 bus card cage. The main PCB consisted of the CPU, memory, video display, I/O circuits. Inside the case included power supply, fan, and keyboard. The case was painted 'IBM blue' and the sides of the case were made of solid oiled walnut originally salvaged from a gun stock manufacturer.
Processor Technology manufactured approximately 10,000 Sol-20 personal computers between 1977 and 1979. All Processor Technology products were available either fully assembled, or as electronic kits. Processor Technology also sold software on Compact Cassette. One side of the tape was recorded in CUTS format, and the other side was Kansas City standard format. Gary Ingram and Steven Dompier wrote the original software utilities. Lee Felsenstein wrote the original user manuals as a contractor.
Standards
Processor Technology also designed several S-100 bus boards. The boards were meant to be compatible with the circuits of Sol-20.
The Video Display Module 1 (VDM-1) was the original video display interface for S-100 bus systems. The board generates sixteen 64-character lines of upper and lower case typeface on any standard composite video monitor or a modified TV set. Utilizing a 1,024 byte (1K) segment of system memory, the VDM-1 provided memory-mapped I/O for high performance, and also included hardware support for scrolling. The VDM-1 Video Board was a great improvement over using a teletype machine or a serial attached terminals, and was popular for owners of other S-100 bus systems such as the IMSAI 8080.
Another popular product was the CUTS Tape I/O Interface S-100 board. The CUTS board offered standard interface for saving and reading data from cassette tape, supporting both the Kansas City standard forma
|
https://en.wikipedia.org/wiki/List%20of%20places%20in%20Florida%3A%20D
|
See also
Florida
List of municipalities in Florida
List of former municipalities in Florida
List of counties in Florida
List of census-designated places in Florida
References
USGS Fips55 database
|
https://en.wikipedia.org/wiki/Encapsulation%20%28networking%29
|
Encapsulation is the computer-networking process of concatenating layer-specific headers or trailers with a service data unit (i.e. a payload) for transmitting information over computer networks. Deencapsulation (or de-encapsulation) is the reverse computer-networking process for receiving information; it removes from the protocol data unit (PDU) a previously concatenated header or tailer that an underlying communications layer transmitted.
Encapsulation and deencapsulation allow the design of modular communication protocols so to logically separate the function of each communications layer, and abstract the structure of the communicated information over the other communications layers. These two processes are common features of the computer-networking models and protocol suites, like in the OSI model and internet protocol suite. However, encapsulation/deencapsulation processes can also serve as malicious features like in the tunneling protocols.
The physical layer is responsible for physical transmission of the data, link encapsulation allows local area networking, IP provides global addressing of individual computers, and TCP selects the process or application (i.e., the TCP or UDP port) that specifies the service such as a Web or TFTP server.
For example, in the IP suite, the contents of a web page are encapsulated with an HTTP header, then by a TCP header, an IP header, and, finally, by a frame header and trailer. The frame is forwarded to the destination node as a stream of bits, where it is decapsulated into the respective PDUs and interpreted at each layer by the receiving node.
The result of encapsulation is that each lower-layer provides a service to the layer or layers above it, while at the same time each layer communicates with its corresponding layer on the receiving node. These are known as adjacent-layer interaction and same-layer interaction, respectively.
In discussions of encapsulation, the more abstract layer is often called the upper-layer protocol while the more specific layer is called the lower-layer protocol. Sometimes, however, the terms upper-layer protocols and lower-layer protocols are used to describe the layers above and below IP.
See also
Application-layer framing
Cross-layer optimization
Protocol data unit
Tunneling protocol
References
External links
RFC 1983: Internet Users' Glossary (contains an entry for encapsulation)
Network protocols
Data transmission
Packets (information technology)
|
https://en.wikipedia.org/wiki/Ubercode
|
Ubercode is a high level programming language designed by Ubercode Software and released in 2005 for Microsoft Windows. Ubercode is influenced by Eiffel and BASIC. It is proprietary software and can be tried out for free for 30 days. Ubercode has the following design goals:
Compilable language—compiled into Windows EXE files.
Automatic memory management—memory is allocated / freed automatically, and the language has no memory management primitives.
Pre and post conditions—these are run-time assertions which are attached to function declarations, as in Eiffel.
High-level data types—resizable arrays, lists and tables may contain arbitrary components.
Integrated file handling—primitives for transparent handling of text, binary, CSV, XML and dBase files.
Ease of use—language structure is relatively simple, making the language accessible to beginners.
Hello, World!
Here is the basic "Hello, World!" program:
Ubercode 1 class Hello
public function main()
code
call Msgbox("Hello", "Hello World!")
end function
end class
Preconditions and Postconditions
Here is an example using pre- and postconditions. In the example, the IntToStr function validates its input as a string before converting it to an integer:
Ubercode 1 class PrePost
function IntToStr(in mystr:string[*] out value:integer)
precond IsDigitStr(mystr)
code
call Val(mystr, value)
end function
public function main()
code
call Msgbox("OOP example", "IntToStr(10) = " + IntToStr("10"))
end function
end class
External links
http://isbndb.com/d/book/design_of_very_high_level_computer_languages.html (VHLL principles)
Object-oriented programming languages
|
https://en.wikipedia.org/wiki/List%20of%20places%20in%20Florida%3A%20B
|
See also
Florida
List of municipalities in Florida
List of former municipalities in Florida
List of counties in Florida
List of census-designated places in Florida
References
USGS Fips55 database
|
https://en.wikipedia.org/wiki/List%20of%20places%20in%20Florida%3A%20C
|
See also
Florida
List of municipalities in Florida
List of former municipalities in Florida
List of counties in Florida
List of census-designated places in Florida
References
USGS Fips55 database
|
https://en.wikipedia.org/wiki/ESPN%20Radio%20SportsCenter
|
ESPN Radio SportsCenter is a news recap segment on ESPN Radio that airs during talk programming and sometimes live games coverage, usually by separate anchors. There are two updates an hour, at the top of the hour and 30 minutes past.
Background
ESPN Radio's marquee segment lasts between one minute and two and a half minutes (depending on time of day) and includes scores, stats, news and sound bites. During the updates, the SportsCenter theme music plays throughout. ESPN Radio SportsCenter is heard during marquee programs such as Mike and Mike in the Morning. It is also heard every twenty minutes during MLB and NBA broadcasts on ESPN Radio. It can also be heard on certain EA Sports games that include ESPN integration. The updates can be accessed on demand using the ESPN mobile app.
The morning ESPN Radio SportsCenter anchors were Bob Picozzi and Christine Lisi. As of August 30, 2010, Mike Greenberg anchored the updates during Mike and Mike leaving to do Get Up! on ESPN in 2018. Dan Davis, who is an ESPN Radio original broadcaster, controlled the midday updates, while Marc Kestecher and formerly Jon Stashower were there in the evening. The late night crew usually switched between Neil Jackson and Jay Reynolds. Most of the ESPN Radio SportsCenter anchors also have other assignments from ESPN; for instance, Bob Picozzi also did play-by-play for Big East basketball on ESPN and Fox.
Schedule
Monday-Friday
See also
List of ESPN Radio personalities
References
ESPN Radio
External links
ESPN Radio
SportsCenter
SportsCenter
|
https://en.wikipedia.org/wiki/Creative%20Arts%20Emmy%20Awards
|
The Creative Arts Emmys are a class of Emmy Awards presented in recognition of technical and other similar achievements in American television programming. They are commonly awarded to behind-the-scenes personnel such as production designers, set decorators, video editors, costume designers, cinematographers, casting directors, and sound editors.
The Creative Arts category also includes awards for outstanding animated programs, commercials, and guest actors.
Both the Primetime and Daytime awards each present their Creative Arts Emmys at separate Creative Arts ceremonies on the weekend before their respective main ceremonies. Both the primary and the creative arts for sports are all given away at one ceremony.
Award categories
See also
List of American television awards
References
External links
Primetime Emmy Awards
Daytime Emmy Awards
Sports Emmy Awards
Emmy Awards
|
https://en.wikipedia.org/wiki/Popular%20Power
|
Popular Power was a company founded in January 2000 that sold
distributed computing software for CPU scavenging. The company was led by Marc Hedlund, CEO, and Nelson Minar, CTO.
The "Popular Power Worker" software was a downloadable Java-based application that Internet users could install onto their computers. It allowed users' computers to participate in a non-profit project to develop an influenza vaccine.
Although Popular Power was able to raise $1.6 million in
angel round funding, it was unable to close the venture capital it needed to continue. As a result, it had to permanently shut down operations in March 2001.
See also
Distributed computing
External links
You Got the Power (Aug 2000)
OpenP2P: Popular Power Turns Off the Lights (03/19/2001).
Defunct software companies of the United States
Grid computing products
Software companies established in 2000
Software companies disestablished in 2001
|
https://en.wikipedia.org/wiki/Matthew%20White%20%28journalist%29
|
Matthew White (born 16 April 1970) is an Australian sports broadcaster, television executive, television presenter and journalist at Network 10, where he returned to in 2014. He has previously been Network 10's Head of Sport and host of the motorsports panel show RPM.
He previously worked at the Seven Network for a decade, where he was a host and commentator for various Seven Sport events, presented sport on Seven News Sydney, and presented current affairs program Today Tonight between 2008 and 2012.
Prior to joining Seven in mid-2004, he was originally at Network Network 10, where he was a host on the original Sports Tonight and was involved in the Australian Grand Prix, V8 Supercars, and Melbourne Cup coverage for the network.
Career
White began his journalism career at a local newspaper in Manly before moving to radio and joining Newcastle's NEWFM to present breakfast news. He moved to television in 1992 when he became weekend sports presenter for NBN News.
After another radio stint at Triple M, White joined Network Ten as a sport reporter. He became weekend host of the network’s flagship sports program Sports Tonight in 1993. During his time at Ten, White covered sports including Supercars, Big Bash League, Formula One, the Spring Racing Carnival and the AFL. He was a commentator for the Supercars in 2002 and 2003. He left Sports Tonight and Network Ten in mid-2004.
Move to Seven Sport
White joined the Seven Network in mid-2004 and became a major presenter in the Seven Sport stable. White was involved in the network’s Athens 2004 Olympics coverage, their Australian Open coverage, and was host of Seven’s (now-defunct) flagship sports program, Sportsworld. He also hosted evening events from Seven's main studio during the Beijing 2008 Olympics.
Following Seven attaining the Supercars rights in 2007, he hosted and commentated their coverage alongside Neil Crompton, Mark Skaife, Mark Larkham and Mark Beretta until mid-2014.
News and current affairs
Since arriving at Seven, White presented sport on Sydney's weeknight edition of Seven News, from mid-2004 until mid-2008.
On 13 August 2007, White joined Melissa Doyle as host of Sunrise filling in for David Koch. He filled in as co-host of Sunrise over the summer period, while David Koch was on holidays. White co-hosted alongside Melissa Doyle and Kylie Gillies. Additionally he presented weekend editions of Seven News in Sydney over the 2007/08 Christmas/New Year period.
On 30 September 2008, the Seven Network announced that White would replace Anna Coren as the presenter of the East Coast edition of Today Tonight. This meant he had to leave his regular position as sport presenter on Seven News, although he continued with his Supercars commitments. In November 2012, White resigned as presenter of Today Tonight after four years to pursue other roles at the Seven Network. In August 2013, White was appointed presenter of Seven Afternoon News with Melissa Doyle.
In 2009, White was a competitor
|
https://en.wikipedia.org/wiki/Source-to-source%20compiler
|
A source-to-source translator, source-to-source compiler (S2S compiler), transcompiler, or transpiler is a type of translator that takes the source code of a program written in a programming language as its input and produces an equivalent source code in the same or a different programming language. A source-to-source translator converts between programming languages that operate at approximately the same level of abstraction, while a traditional compiler translates from a higher level programming language to a lower level programming language. For example, a source-to-source translator may perform a translation of a program from Python to JavaScript, while a traditional compiler translates from a language like C to assembler or Java to bytecode. An automatic parallelizing compiler will frequently take in a high level language program as an input and then transform the code and annotate it with parallel code annotations (e.g., OpenMP) or language constructs (e.g. Fortran's forall statements).
Another purpose of source-to-source-compiling is translating legacy code to use the next version of the underlying programming language or an API that breaks backward compatibility. It will perform automatic code refactoring which is useful when the programs to refactor are outside the control of the original implementer (for example, converting programs from Python 2 to Python 3, or converting programs from an old API to the new API) or when the size of the program makes it impractical or time-consuming to refactor it by hand.
Transcompilers may either keep translated code structure as close to the source code as possible to ease development and debugging of the original source code or may change the structure of the original code so much that the translated code does not look like the source code. There are also debugging utilities that map the transcompiled source code back to the original code; for example, the JavaScript Source Map standard allows mapping of the JavaScript code executed by a web browser back to the original source when the JavaScript code was, for example, minified or produced by a transcompiled-to-JavaScript language.
Examples include Closure Compiler, CoffeeScript, Dart, Haxe, Opal, TypeScript and Emscripten.
Assembly language translators
So called Assembly language translators are a class of source-to-source translators converting code from one assembly language into another, including (but not limited to) across different processor families and system platforms.
Intel CONV86
Intel marketed their 16-bit processor 8086 to be source compatible to the 8080, an 8-bit processor. To support this, Intel had an ISIS-II-based translator from 8080 to 8086 source code named CONV86 (also referred to as CONV-86 and CONVERT 86) available to OEM customers since 1978, possibly the earliest program of this kind. It supported multiple levels of translation and ran at 2 MHz on an Intel Microprocessor Development System MDS-800 with 8-inch flopp
|
https://en.wikipedia.org/wiki/Interaction%20design%20pattern
|
Interaction design patterns are design patterns applied in the context human-computer interaction, describing common designs for graphical user interfaces.
A design pattern is a formal way of documenting a solution to a common design problem. The idea was introduced by the architect Christopher Alexander for use in urban planning and building architecture and has been adapted for various other disciplines, including teaching and pedagogy, development organization and process, and software architecture and design.
Thus, interaction design patterns are a way to describe solutions to common usability or accessibility problems in a specific context. They document interaction models that make it easier for users to understand an interface and accomplish their tasks.
History
Patterns originated as an architectural concept by Christopher Alexander. Patterns are ways to describe best practices, explain good designs, and capture experience so that other people can reuse these solutions.
Design patterns in computer science are used by software engineers during the actual design process and when communicating designs to others. Design patterns gained popularity in computer science after the book Design Patterns: Elements of Reusable Object-Oriented Software was published. Since then a pattern community has emerged that specifies patterns for problem domains including architectural styles and object-oriented frameworks. The Pattern Languages of Programming Conference (annual, 1994—) proceedings includes many examples of domain-specific patterns.
Applying a pattern language approach to interaction design was first suggested in Norman and Draper's book User Centered System Design (1986). The Apple Computer's Macintosh Human Interface Guidelines also quotes Christopher Alexander's works in its recommended reading.
Libraries
Alexander envisioned a pattern language as a structured system in which the semantic relationships between the patterns create a whole that is greater than the sum of its parts, much like the way that grammatical relationships between words make language meaningful. While some collections of patterns attempt to create the structural relationships needed to form a language, many others are simply an assemblage of patterns (and thus are more appropriately termed pattern libraries.)
Mobile interaction pattern libraries
The popularity of mobile devices such as smartphones and tablets usher in a need for a library of mobile interaction design patterns.
This need is driven by:
Differences in user behavior and interaction on mobile devices such as swipe and tap gestures, vis-a-vis interaction on a Desktop GUI, which is mouse-driven
Differences in physical attributes between a mobile and a desktop device e.g. screen size, touch screen, etc.
Design guidelines recommended by mobile OS e.g. iOS, Android
Elements
For patterns to be helpful to the designers and developers who will make use of them, they need to be findable and readable.
Co
|
https://en.wikipedia.org/wiki/Everyday%20Italian
|
Everyday Italian is a Food Network show hosted by Giada De Laurentiis. In the show, De Laurentiis focuses for her viewers on traditional Italian cuisine with an American flair.
Popularity
The show is recorded (shot at 24 frames for a cinematic feel) on location in Malibu, Pasadena and the Pacific Palisades, shunning the traditional Food Network sets and instead using a series of rented homes. All of the cooking on the show is shot live on set during an initial run and later the close up shots are recorded during a second run. De Laurentiis often features family members in episodes, most notably fashion designer husband Todd Thompson. Her mother, aunt, brother, and sister have also appeared in several episodes, occasionally working side-by-side with De Laurentiis in the kitchen. Giada's Aunt Raffy is the family member featured most often on the show; bringing recipes for such specialties as Chestnut Stuffing and Turkey Tonnato. Just before the birth of her first child in February 2008, Giada made an announcement on the Food Network website that the show was no longer being produced.
The success of Everyday Italian has led to the publication of three related cookbooks, Everyday Italian: 125 Simple and Delicious Recipes, Giada's Family Dinners, and Everyday Pasta.
Awards and honors
The show was nominated for two Daytime Emmy Awards in 2006, as well as in 2007. Giada de Laurentis won a Daytime Emmy Award for Outstanding Lifestyle Host, and the series won the Daytime Emmy Award for Outstanding Lifestyle Program in 2008.
The show has also given rise to other shows starring De Laurentiis, including Giada's Weekend Getaways, Behind the Bash, and a number of specials, including Giada's Italian Holiday, featuring chef Mario Batali.
References
External links
Everyday Italian on The Food Network
2000s American cooking television series
Food Network original programming
|
https://en.wikipedia.org/wiki/List%20of%20atmospheric%20dispersion%20models
|
Atmospheric dispersion models are computer programs that use mathematical algorithms to simulate how pollutants in the ambient atmosphere disperse and, in some cases, how they react in the atmosphere.
US Environmental Protection Agency models
Many of the dispersion models developed by or accepted for use by the U.S. Environmental Protection Agency (U.S. EPA) are accepted for use in many other countries as well. Those EPA models are grouped below into four categories.
Preferred and recommended models
AERMOD – An atmospheric dispersion model based on atmospheric boundary layer turbulence structure and scaling concepts, including treatment of multiple ground-level and elevated point, area and volume sources. It handles flat or complex, rural or urban terrain and includes algorithms for building effects and plume penetration of inversions aloft. It uses Gaussian dispersion for stable atmospheric conditions (i.e., low turbulence) and non-Gaussian dispersion for unstable conditions (high turbulence). Algorithms for plume depletion by wet and dry deposition are also included in the model. This model was in development for approximately 14 years before being officially accepted by the U.S. EPA.
CALPUFF – A non-steady-state puff dispersion model that simulates the effects of time- and space-varying meteorological conditions on pollution transport, transformation, and removal. CALPUFF can be applied for long-range transport and for complex terrain.
BLP – A Gaussian plume dispersion model designed to handle unique modelling problems associated with industrial sources where plume rise and downwash effects from stationary line sources are important.
CALINE3 – A steady-state Gaussian dispersion model designed to determine pollution concentrations at receptor locations downwind of highways located in relatively uncomplicated terrain.
CAL3QHC and CAL3QHCR – CAL3QHC is a CALINE3 based model with queuing calculations and a traffic model to calculate delays and queues that occur at signalized intersections. CAL3QHCR is a more refined version based on CAL3QHC that requires local meteorological data.
CTDMPLUS – A complex terrain dispersion model (CTDM) plus algorithms for unstable situations (i.e., highly turbulent atmospheric conditions). It is a refined point source Gaussian air quality model for use in all stability conditions (i.e., all conditions of atmospheric turbulence) for complex terrain.
OCD – Offshore and coastal dispersion model (OCD) is a Gaussian model developed to determine the impact of offshore emissions from point, area or line sources on the air quality of coastal regions. It incorporates overwater plume transport and dispersion as well as changes that occur as the plume crosses the shoreline.
Alternative models
ADAM – Air force dispersion assessment model (ADAM) is a modified box and Gaussian dispersion model which incorporates thermodynamics, chemistry, heat transfer, aerosol loading, and dense gas effects.
ADMS 5 – Atmospheric Disp
|
https://en.wikipedia.org/wiki/Cybermutt
|
Cybermutt is a 2002 comic science fiction film that was made for Animal Planet as part of a trio of movies for the cable channel called "Animal Tales". Cybermutt is a fictional golden retriever.
Plot
The story centers on a young boy, Nino (Ryan Cooley), and his family dog, Rex, who takes on a significant role in Nino's life after the boy loses his father to cancer. During a stroll in the park with Nino and his mother, Rex manages to save the life of the eccentric inventor and dotcom wiz, Alex (Judd Nelson). Rex is badly injured during his act of heroism and Alex, as a gesture of gratitude, takes the dog back to his bionics lab to rebuild him. Through cutting edge gadgetry, Rex is imbued with super powers and becomes the target of villains determined to possess the new technology at any cost. After the procedure, Rex is capable of feats of great strength, can see in infrared vision and run at 70 mph.
Cast
Judd Nelson – Alex
Ryan Cooley – Nino
Michelle Nolden – Juliet
Paulina Mielech – Erica
Tonio Arango – Temple
Joe Pingue – Max
Pedro Salvin – Rubio
Khafre Armatrading – Kyle
Bryon Bully – Bully #1
Ian Bradley-Perrin – Bully #2
External links
2002 television films
2002 films
2000s science fiction comedy films
British comedy television films
Canadian comedy television films
English-language Canadian films
German comedy television films
English-language German films
Films about dogs
Films directed by George T. Miller
2002 comedy films
2000s English-language films
2000s Canadian films
|
https://en.wikipedia.org/wiki/Merlin%20%28protein%29
|
Merlin (also called Neurofibromin 2 or schwannomin) is a cytoskeletal protein. In humans, it is a tumor suppressor protein involved in neurofibromatosis type II. Sequence data reveal its similarity to the ERM protein family.
The name "merlin" is an acronym for "Moesin-Ezrin-Radixin-Like Protein".
Gene
Human merlin is coded by the gene NF2 in Chromosome 22. Mouse merlin gene is located on chromosome 11 and rat merlin gene on chromosome 17. Fruit fly merlin gene (symbol Mer) is located on chromosome 1 and shares 58% similarity to its human homologue.
Other merlin-like genes are known from a wide range of animals, and the derivation of merlin is thought to be in early metazoa. Merlin is a member of the ERM family of proteins including ezrin, moesin, and radixin, which are in the protein 4.1 superfamily of proteins. Merlin is also known as schwannomin, a name derived from the most common type of tumor in the NF2 patient phenotype, the schwannoma.
Structure
Vertebrate merlin is a 70 kDa protein. There are 10 known isoforms of human merlin molecule (the full molecule being 595 amino acids in length). The two most common of these are also found in the mouse and are called type 1 and type 2, differing by the absence or presence of exon 16 or 17, respectively). All the known varieties have a conserved N-terminal part, which contains a FERM domain (a domain found in most cytoskeletal-membrane organizing proteins). The FERM domain is followed by an alpha-helical domain and a hydrophilic tail. Merlin can dimerize with itself and heterodimerize with other ERM family proteins.
Function
Merlin is a membrane-cytoskeleton scaffolding protein, i.e. linking actin filaments to cell membrane or membrane glycoproteins. Human merlin is predominantly found in nervous tissue, but also in several other fetal tissues, and is mainly located in adherens junctions. Its tumor suppressor properties are probably associated with contact-mediated growth inhibition. Drosophila merlin is expressed in embryonic hindgut, salivary glands, and imaginal discs, and has apparently a slightly different role than in vertebrates.
The phosphorylation of serine 518 is known to alter the functional state of merlin. The signaling pathway of merlin is proposed to include several salient cell growth controlling molecules, including eIF3c, CD44, protein kinase A, and p21 activated kinases.
Work in Drosophila identified Merlin as an upstream regulator of the Hippo tumor suppressor pathway, a function that is conserved in mammals. The Hippo pathway is a well conserved signalling pathway that coordinately regulates cell proliferation and apoptosis.
Mutations of the NF2 gene cause a human autosomal dominant disease called neurofibromatosis type 2. It is characterized by the development of tumors of the nervous system, most commonly of bilateral vestibular schwannomas (also called acoustic neuromas). NF2 belongs to the tumor suppressor group of genes.
Interactions
Merlin (protein) has been s
|
https://en.wikipedia.org/wiki/Vertical%20handover
|
Vertical handover or vertical handoff refers to a network node changing the type of connectivity it uses to access a supporting infrastructure, usually to support node mobility. For example, a suitably equipped laptop might be able to use both high-speed wireless LAN and cellular technology for Internet access. Wireless LAN connections generally provide higher speeds, while cellular technologies generally provide more ubiquitous coverage. Thus the laptop user might want to use a wireless LAN connection whenever one is available and to revert to a cellular connection when the wireless LAN is unavailable. Vertical handovers refer to the automatic transition from one technology to another in order to maintain communication. This is different from a horizontal handover between different wireless access points that use the same technology.
Vertical handoffs between WLAN and UMTS (WCDMA) have attracted a great deal of attention in all the research areas of the 4G wireless network, due to the benefit of utilizing the higher bandwidth and lower cost of WLAN as well as better mobility support and larger coverage of UMTS. Vertical handovers among a range of wired and wireless access technologies including WiMAX can be achieved using Media independent handover which is standardized as IEEE 802.21.
Related issues
Dual mode card
To support vertical handover, a mobile terminal needs to have a dual mode card, for example one that can work under both WLAN and UMTS frequency bands and modulation schemes.
Interworking architecture
For the vertical handover between UMTS and WLAN, there are two main interworking architecture: tight coupling and loose coupling.
The tight coupling scheme, which 3GPP adopted, introduces two more elements: WAG (Wireless Access Gateway) and PDG (Packet Data Gateway). So the data transfers from WLAN AP to a Corresponding Node on the internet must go through the Core Network of UMTS.
Loose coupling is more used when the WLAN is not operated by cellular operator but any private user. So the data transmitted through WLAN will not go through Cellular Networks.
Handover metrics
In traditional handovers, such as a handover between cellular networks, the handover decision is based mainly on RSS (Received Signal Strength) in the border region of two cells, and may also be based on call drop rate, etc. for resource management reasons.
In vertical handover, the situation is more complex. Two different kinds of wireless networks normally have incomparable signal strength metrics, for example, WLAN compared to UMTS. In, WLAN and UMTS networks both cover an area at the same time.
The handover metrics in this situation should include RSS, user preference, network conditions, application types, cost etc.
Handover decision algorithm
Based on the handover metrics mentioned above, the decision about how and when to switch the interface to which network will be made.
Many papers have given reasonable flow charts based on the better service and lower
|
https://en.wikipedia.org/wiki/Network%20TwentyOne
|
Network Twentyone, is a training and support organization for distributors working with the Amway business. It was founded in 1990 by Jim and Nancy Dornan, distributors with Amway, originally to support their Amway network in the United States and Australia. Network Twentyone provides complete "turnkey business support solutions" for Amway Independent Business Owners from meetings and function production including education, recognition and motivation to web applications and multi-media products designed to aid you in building a profitable Amway business. These materials are often referred to as Business Support Material (or "BSM"). BSM are promoted to a captive market represented by fellow IBOs ("Independent Business Owners") as well as potential IBOs, creating an opportunity for an additional and independent source of income to that derived from bonus payments arising from the sales generated within the network. The income of those who have reached significant levels can be substantially more through the sales efforts of BSM, to several or perhaps many IBOs Network TwentyOne operates in more than 40 countries and is considered one of the largest adult education organizations in the world.
History
Jim & Nancy Dornan began an Amway business in 1971. After their son Eric was born with severe birth defects they rapidly built one of the largest Amway businesses in North America. In the late 1980s and early 90s Amway began to expand and the Dornans decided there was an opportunity to develop a support system to work with Amway internationally.,. In 1990 they founded Network 21 with a goal to build a business system "that ignores borders and languages". Initially based in the US and Australia, Network 21 expanded rapidly in Eastern Europe, China, Indonesia, Turkey, Philippines and later India.
In 1997, Network 21's "training material" was depicted in the Polish film Welcome to Life. The director and producer were later acquitted on the charge of disseminating false information.". The film, banned for 12 years, was one of the highly anticipated movies of 2009's Warsaw Film Festival and was described in the press by one of the promoters as a "scary movie about brainwashing" that depicts hard-sell "pep rallies" and distributors stating meetings were operated similar to the Communist Party and methods of recruitment that confusingly resembled those of a sect. A best-seller on the local video black market., the film was later banned and its producers fined for using Network 21's copyrighted material. As of 2009 the film was still banned due to an ongoing case brought by "private individuals" ridiculed in the film.
In May 2007, the UK Government's Department of Trade and Industry (DTI) petitioned to ban Network Twentyone and Amway after a year-long investigation alleging practices revolving around distributors being more focused on selling their motivational books, tapes and seminars to salespeople than peddling Amway merchandise. The complaint also focu
|
https://en.wikipedia.org/wiki/Go%20Text%20Protocol
|
The Go Text Protocol (GTP) is a protocol used by several Go engines and Go servers for playing the board game Go on the computer. GTP version 1 has been implemented in GNU Go 3.0.0 but the protocol lacks a proper specification. The currently used version is GTP 2 which exists as a draft specification and has not been finalized.
See also
Computer Go
Go software
Internet Go servers
External links
GTP implementation in Ruby
Go (game) software
|
https://en.wikipedia.org/wiki/Separation%20logic
|
In computer science, separation logic is an extension of Hoare logic, a way of reasoning about programs.
It was developed by John C. Reynolds, Peter O'Hearn, Samin Ishtiaq and Hongseok Yang, drawing upon early work by Rod Burstall. The assertion language of separation logic is a special case of the logic of bunched implications (BI). A CACM review article by O'Hearn charts developments in the subject to early 2019.
Overview
Separation logic facilitates reasoning about:
programs that manipulate pointer data structures—including information hiding in the presence of pointers;
"transfer of ownership" (avoidance of semantic frame axioms); and
virtual separation (modular reasoning) between concurrent modules.
Separation logic supports the developing field of research described by Peter O'Hearn and others as local reasoning, whereby specifications and proofs of a program component mention only the portion of memory used by the component, and not the entire global state of the system. Applications include automated program verification (where an algorithm checks the validity of another algorithm) and automated parallelization of software.
Assertions: operators and semantics
Separation logic assertions describe "states" consisting of a store and a heap, roughly corresponding to the state of local (or stack-allocated) variables and dynamically-allocated objects in common programming languages such as C and Java. A store is a function mapping variables to values. A heap is a partial function mapping memory addresses to values. Two heaps and are disjoint (denoted ) if their domains do not overlap (i.e., for every memory address , at least one of and is undefined).
The logic allows to prove judgements of the form , where is a store, is a heap, and is an assertion over the given store and heap. Separation logic assertions (denoted as , , ) contain the standard boolean connectives and, in addition, , , , and , where and are expressions.
The constant asserts that the heap is empty, i.e., when is undefined for all addresses.
The binary operator takes an address and a value and asserts that the heap is defined at exactly one location, mapping the given address to the given value. I.e., when (where denotes the value of expression evaluated in store ) and is otherwise undefined.
The binary operator (pronounced star or separating conjunction) asserts that the heap can be split into two disjoint parts where its two arguments hold, respectively. I.e., when there exist such that and and and .
The binary operator (pronounced magic wand or separating implication) asserts that extending the heap with a disjoint part that satisfies its first argument results in a heap that satisfies its second argument. I.e,. when for every heap such that , also holds.
The operators and share some properties with the classical conjunction and implication operators. They can be combined using an inference rule similar to modus ponens
and they fo
|
https://en.wikipedia.org/wiki/List%20of%20places%20in%20Florida%3A%20E
|
See also
Florida
List of municipalities in Florida
List of former municipalities in Florida
List of counties in Florida
List of census-designated places in Florida
References
USGS Fips55 database
|
https://en.wikipedia.org/wiki/List%20of%20places%20in%20Florida%3A%20F
|
f
See also
Florida
List of municipalities in Florida
List of former municipalities in Florida
List of counties in Florida
List of census-designated places in Florida
References
USGS Fips55 database
|
https://en.wikipedia.org/wiki/List%20of%20places%20in%20Florida%3A%20G
|
See also
Florida
List of municipalities in Florida
List of former municipalities in Florida
List of counties in Florida
List of census-designated places in Florida
References
USGS Fips55 database
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.