source
stringlengths 32
199
| text
stringlengths 26
3k
|
|---|---|
https://en.wikipedia.org/wiki/Louise%20Palanker
|
Louise Palanker is a co-founder of Premiere Networks, now a division of iHeartMedia. She currently co-hosts Media Path Podcast with Fritz Coleman.
Palanker authored the semi-autobiographical coming-of-age story Journals: Middle School Love and War, which she developed into a podcast that was called Journals: Out Loud.
Palanker founded an advice app for teens, originally called Journals and now called Ask Weezy.
Palanker produced and directed the documentary films: Family Band: The Cowsills Story (airing on Showtime in 2013–2014, now available on Amazon Prime), We Played Marbles: Remembering a Stolen Childhood (2007), about the lives of Holocaust survivors, and the short documentary, Margaret Singer: Seeking Light, which was selected by the Santa Barbara International Film Festival in 2020.
In 1999, she began a stand-up comedy program, Kid's Comedy Club, at two Los Angeles Boys and Girls Clubs and at the Santa Barbara Jewish Federation, where kids learn to write and perform their own stand-up comedy.
In March 2005, Palanker testified in the trial of Michael Jackson as a witness for the prosecution. The prosecution called Palanker to testify about a call she received from the accuser's mother, and to rebut defense suggestions that the family tried to dupe celebrities, including Palanker, George Lopez and Jay Leno, into giving them money. Despite Palanker's testimony, pop superstar Jackson was found not guilty on all charges.
Palanker grew up in Buffalo, New York. She lives in Los Angeles and Santa Barbara, California, with her husband.
References
External links
Louise Palanker's website
Media Path Podcast
https://www.flickr.com/photos/louisepalanker/
American comedy writers
American television producers
American women television producers
Living people
Year of birth missing (living people)
21st-century American women
|
https://en.wikipedia.org/wiki/Link%20state%20packet
|
Link State Packet (LSP) is a packet of information generated by a network router in a link state routing protocol that lists the router's neighbors. Link state packets can be further defined as special datagrams that determine the names of and the cost or distance to any neighboring routers and associated networks. They are used to efficiently determine what the new neighbor is, if a link failure occurs, and the cost of changing a link if the need arises. LSPs are queued for transmission, and must time out at about the same time. They must be acknowledged, and can be distributed throughout the network, but cannot use the routing database.
Developing Link State Packets
When Information needed for exchange is collected, a router then builds a packet containing all the data. The packet starts with the identity of the sender, followed by a sequence number and age, and a list of neighbors. For each neighbor, the delay to that neighbor is given. Building a link state packet is usually easy, the complex part is determining when to build them. One way to reduce this problem is to build them periodically, that is, at regular intervals, or when some significant event occurs, such as a line or neighbor going down or coming back up again, or changing its properties appreciatively.
A major procedure called flooding which is used for distributing link state algorithms throughout the routing domain can be implemented with link state packets. However, ordinary flooding may result in problems, because it generates exponential behavior. Smart flooding, on the other hand, recognizes link state packets appropriately.
Types of Link State packets
Link state packets are usually implemented with Open Shortest Path First (OSPF) protocol. OSPF's reliable flooding mechanism is implemented by Link State Update and Link State Acknowledgment packets.
Link state update packet
Link State Update packets are OSPF packet type 4. These packets implement the flooding of link state advertisements. Each Link State Update packet carries a collection of link state advertisements one hop further from its origin. Several link-state advertisement may be included in a single packet.
Link State Update packets are multicast on those physical networks that support multicast/broadcast. In order to make the flooding procedure reliable, flooded advertisements are acknowledged in Link State Acknowledgment packets. If retransmission of certain advertisements is necessary, the retransmitted advertisements are always carried by unicast Link State Update packets.
Link state acknowledgment packet
Link State Acknowledgment Packets are OSPF packet type 5. To make the flooding of link state advertisements reliable, flooded advertisements are explicitly acknowledged. This acknowledgment is accomplished through the sending and receiving of Link State Acknowledgment packets. Multiple link state advertisements can be acknowledged in a single Link State Acknowledgment packet.
Depending on the state of
|
https://en.wikipedia.org/wiki/Jain%20Shaileshkumar
|
Jain Shaileshkumar (born February 10, 1970), better known as Sam P. Jain, is an Indian internet entrepreneur and former CEO of affiliate marketing network eFront, who is currently a fugitive with an arrest warrant in California. In 2000, eFront submitted fraudulent data to Media Metrix, a website ranking publisher. Former president of eFront Jerry Ziegler accused Jain of deliberately falsifying affiliate data, using tactics such as submitting companies which didn't respond to his affiliate offer as affiliates with the justification that "[i]f they won't respond to me, they won't respond to anyone". In 2001 Jain was involved in a scandal when ICQ instant messaging logs between him and other employees were leaked onto the internet. The logs detailed activities such as not paying websites that had hosted their banner ads and sending legal threats to websites that spoke poorly of eFront. On April 20, 2005, he was ordered to pay $3.1 million to Symantec for selling counterfeit software and violating intellectual property laws.
Arrest warrant
Jain additionally has a criminal case pending in California resulting from his selling of counterfeit Symantec software, where he was charged with Criminal Copyright Infringement, Wire Fraud, Trafficking in Counterfeit Goods & Mail Fraud. Jain pleaded not guilty.
Jain operated several Internet-based companies including Discount Bob, Shifting Currents Financials, Inc., Innovative Marketing, Inc., Professional Management Consulting Inc. and Shopenter.com, LLC.
In December 2008, Jain was listed as a defendant in the Federal Trade Commission's case against so-called "scareware" applications such as WinFixer. The case alleges that several companies scammed consumers into buying these applications through malware and banner ads.
In mid-December 2008 U.S. District Judge Richard D. Bennett fined Innovative Marketing $8,000 for each day that it continues to sell bogus scareware software on its website.
On January 26, 2009, a stay was removed for a bench warrant initially issued for Jain's arrest on January 12, 2009 by United States District Judge Ronald M. Whyte. The bench warrant was entered into court records on February 11, 2009. Jain is officially a fugitive from justice in the United States. The FBI is offering a reward for information that leads to his arrest or capture. In 2009, $14.8 million USD was seized from a Swiss bank account belonging to Jain by the US government.
See also
List of fugitives from justice who disappeared
References
External links
CNET News.com ICQ logs spark corporate nightmare Paul Festa March 15, 2001
1970 births
American fraudsters
Fugitives wanted by the United States
Internet marketing people
Living people
|
https://en.wikipedia.org/wiki/Brother%20from%20Another%20Series
|
"Brother from Another Series" is the sixteenth episode of the eighth season of the American animated television series The Simpsons. It originally aired on the Fox network in the United States on February 23, 1997. Sideshow Bob is released from prison after his arrest in "Sideshow Bob's Last Gleaming" into the care of his brother Cecil and claims to be a changed man. However, Bart does not believe him and tries to find out what Bob is up to. It was the first episode directed by Pete Michels and was written by Ken Keeler. The episode guest stars Kelsey Grammer in his sixth appearance as Sideshow Bob and David Hyde Pierce in his first appearance as Cecil. The title is not only a pun on the movie The Brother from Another Planet (used for a previous episode as well), but for the fact that guest stars Kelsey Grammer and David Hyde Pierce also played bickering brothers Frasier Crane and Niles Crane, respectively, on the NBC sitcom Frasier.
Plot
Krusty the Clown is performing live from the Springfield Prison and he talks to Sideshow Bob, who tells him of his crimes while trying to kill Bart Simpson after framing Krusty for armed robbery. Bob is later declared a changed man by Reverend Lovejoy and leaves prison on a work-release program, despite Bart's protests that Bob has tried to kill him several times. Although they have not spoken for ten years, Bob is taken into the care of his brother Cecil. Since he is Springfield's chief hydrological and hydrodynamical engineer, Cecil employs Bob to supervise the construction of a hydroelectric dam in a river near the town. Bart, believing Bob is still plotting his murder, follows his every move. Bob — annoyed by Bart's intrusions and the dam's incompetent laborers, Cletus and his family — expresses his desire to see the dam burst and obliterate Springfield.
While searching Bob's trailer at the dam construction site, Bart and Lisa discover a briefcase full of cash. When confronted with the money, Bob denies knowing about it, stating he used his finances to put concrete in the dam's walls — which he discovers are hollow and poorly constructed. Cecil arrives armed and reveals his own intention to embezzle the money from the project, and his plans to frame Bob as the scapegoat when the dam collapses from shoddy construction. Cecil's motivation for the crime is being upstaged at his audition as Krusty's sidekick (his dream job since he was five-years-old) ten years prior by Bob, who was chosen as the clown's sidekick instead. Cecil locks Bob, Bart and Lisa in the dam and prepares to blow it up, taking the money with him.
Deciding to work together, Bart, Lisa, and Bob escape and try to save the dam. While Lisa and Bob defuse Cecil's dynamite, Bart lunges at Cecil before he can press the plunger. Cecil attempts to swat him off with the briefcase, which falls open and scatters money over the river below, washing it away. Cecil throws Bart off a cliff, but Bob grabs the dynamite's cord and swoops down to save him. As
|
https://en.wikipedia.org/wiki/List%20of%20cognitive%20scientists
|
Below are some notable researchers in cognitive science.
Computer science
Linguistics
Neuroscience
Philosophy
Psychology
Other categories
Alfredo Ardila (neuroscience, neuropsychology, anthropology, evolution of cognition)
Scott Atran (cognitive anthropology)
Joscha Bach (cognitive science)
Frederic Bartlett (psychology, social anthropology)
Justin L. Barrett (cognitive psychology, cognitive anthropology)
Marc Bekoff (biology, cognitive ethology, behavioral ecology)
Maurice Bloch (cognitive anthropology)
Maggie Boden (cognitive science)
Pascal Boyer (cognitive anthropology)
Per Aage Brandt (cognitive semiotics)
Brian Butterworth (speech, dyslexia, mathematics)
Michael Cole (comparative cognition, cognitive psychology, cultural psychology)
Frederick L. Coolidge (evolutionary cognitive archaeology, cognitive evolution, behavior genetics)
Roy D'Andrade (cognitive anthropology)
Terrence Deacon (neuroanthropology, linguistics)
Merlin Donald (psychology, anthropology, historical evolution of cognition)
Fernando Flores (computer science, philosophy)
John Gowlett (evolutionary cognitive archaeology, evolutionary anthropology)
Tom Griffiths (computer science, psychology)
Christopher Robert Hallpike (anthropology)
Yuval Noah Harari (cognitive evolution, philosophy of artificial intelligence)
Brian Hare (evolutionary anthropology, evolution of cognition)
Friedrich Hayek (cognitive psychology, philosophy of perception)
Cecilia Heyes (cognitive evolution)
Ludwig Huber (cognitive evolution, cognitive biology)
Thomas Huffman (ideational cognitive archaeology)
Edwin Hutchins (cognitive anthropology)
Paul Jorion (anthropology, sociology)
Jean Lave (situated cognition, social anthropology)
Stephen C. Levinson (linguistics, anthropology, psychology)
David Lewis-Williams (ideational cognitive archaeology)
Aleksandr Luria (psychology, neuroscience, anthropology)
Lambros Malafouris (evolutionary cognitive archaeology, philosophy of mind)
Humberto Maturana (neuroscience, biology of cognition, philosophy)
Douglas Medin (cognitive psychology, anthropology)
Steven Mithen (ideational cognitive archaeology)
Rafael E. Núñez (philosophy of mathematics, linguistics, anthropology)
Karenleigh A. Overmann (evolutionary cognitive archaeology, cognitive evolution, ethnomathematics, numeracy, literacy)
Zenon Pylyshyn (engineering, psychology, philosophy)
Naomi Quinn (cognitive anthropology)
Colin Renfrew (evolutionary cognitive archaeology, neuroarchaeology)
Bradd Shore (cognitive anthropology)
Richard Shweder (cognitive anthropology)
Dan Sperber (cognitive anthropology)
Joshua Tenenbaum (computer science, psychology)
Hideto Tomabechi (brain science, psychophysics, bioinformatics, intelligent informatics, speech recognition, cognitive neuro-engineering)
Francisco Varela (neuroscience, philosophy)
Frans de Waal (ethology, primatology, psychology)
Étienne Wenger (situated cognition, education)
James V. Wertsch (cognitive psychol
|
https://en.wikipedia.org/wiki/KFSN-TV
|
KFSN-TV (channel 30) is a television station in Fresno, California, United States, serving as the market's ABC network outlet. It is owned and operated by the network's ABC Owned Television Stations division, and maintains studios on G Street in downtown Fresno; its transmitter is located on Bear Mountain, near Meadow Lakes, California.
Fresno is the smallest television market in California with a "Big Four" network O&O.
History
KFRE
After the Federal Communications Commission (FCC)'s four-year-long freeze on awarding television station licenses was lifted in 1952, two radio stations—KARM (1430 AM, now KFIG) and KFRE (940 AM, now KYNO) competed for the construction permit to operate a station on channel 12, the sole VHF allocation given to Fresno. KFRE won the permit, and the station first signed on the air on May 10, 1956, as KFRE-TV (for Fresno). It is the third-oldest television station in the Fresno market in a three-year timeframe and upon signing on, KFRE-TV took the CBS affiliation from KJEO (channel 47, now KGPE). This made Fresno one of the smallest markets where each network gained full-time affiliations at the time.
The KFRE stations were acquired by Triangle Publications in 1959. On February 17, 1961, KFRE-TV reluctantly moved to UHF channel 30 to make Fresno an all-UHF market under orders from the FCC. It was known by the term deintermixture, the move was made for the purpose of leveling the playing field and eliminating the potential of unfair competition between the VHF and UHF bands. A similar situation occurred in nearby Bakersfield where that city's lone VHF station, KERO-TV on channel 10, moved to UHF channel 23 in 1963. The move of KFRE-TV to channel 30 opened up channel 12 for use by KCOY-TV in Santa Maria, which went on the air in 1964.
KFSN
Triangle began its exit from broadcasting in 1971, and sold the KFRE stations to Capital Cities Communications. The new owners sold off the AM and FM radio stations as a condition of the purchase and kept the television station, changing its call letters to KFSN-TV on May 1 of that year (the KFRE-TV calls are now used on Fresno's CW affiliate on channel 59; that station is unrelated to the current KFSN-TV).
On March 18, 1985, Capital Cities announced it would purchase ABC. Nearly six months later, on September 9, 1985, KFSN-TV traded network affiliations with KJEO and became an ABC affiliate. The transaction was finalized on January 3, 1986, making channel 30 an ABC owned-and-operated station. It marks the first time a Big Three network owns a UHF television station since NBC sold WNBC (now WVIT) in New Britain, Connecticut, to Plains Television in 1960. In 1996, The Walt Disney Company acquired Capital Cities/ABC.
KFSN-TV shut down its analog signal, over UHF channel 30, at noon on June 12, 2009, the official date on which full-power television stations in the United States transitioned from analog to digital broadcasts under federal mandate. The station's digital signal relocat
|
https://en.wikipedia.org/wiki/What%27s%20for%20Dinner%3F
|
What's for Dinner? was a Canadian cooking show that initially aired on Life Network and was later syndicated around the world. The series started in 1994 and aired for several seasons.
The series was hosted by Ken Kostick, a chef and cookbook author from Winnipeg, along with Mary Jo Eustace. Kostick, inspired by U.S. sitcom Home Improvement that he was a big fan of, and similar "behind the scenes" comedy programs, had come up with the idea of a sitcom built around a genuine cooking program, much like Home Improvement occasionally featured genuine products and tips mixed in with its comedy.
The idea of producing a sitcom was eventually dropped; instead, What's for Dinner? developed into a humour-based cooking show. Mary Jo Eustace, a Canadian actress, fashion model, singer-songwriter, comedian, and trained sous-chef who stood a bit taller than the diminutive Kostick, was initially hired to solo host the series, but when it was discovered Eustace and Kostick had good on-camera chemistry, it was decided to make the show a duo act.
The appeal of the series was not so much in the dishes prepared, but in the comedic banter—and, quite frequently, barbs—thrown back and forth between the two hosts. Kostick in particular found himself acting as "straight man" to Eustace, as well as the target of a number of running jokes ranging from his height (or lack thereof) to whether or not Ken and Mary Jo were actually a couple to whether or not Ken was gay.
Originally filmed in a closed studio with no audience, later seasons added a live studio audience. During the show's final year, episodes were videotaped in cities across Canada. The series was also syndicated around the world and was, for a time, the highest-rated series on the Life Network. It was previously broadcast on the Q Television Network.
In September 2006, Evanov Radio Group announced that Kostick and Eustace would reunite as hosts of the morning show on CIRR-FM, that company's new LGBT radio station in Toronto, Ontario. Later in 2008, the pair teamed up for another similar cooking show called He Said, She Said with Ken and Mary Jo on the W Network.
External links
1995 Canadian television series debuts
CBC Television original programming
1990s Canadian cooking television series
|
https://en.wikipedia.org/wiki/KNPR
|
KNPR (88.9 FM, "News 88.9") is a non-commercial radio station located in Las Vegas, Nevada. KNPR airs news/talk programming syndicated by National Public Radio (NPR). KNPR broadcasts in HD.
History
KNPR signed on for the first time on March 24, 1980. Founded by Lamar Marchese, the station was the first NPR member in Nevada, originally airing NPR news and classical music at 89.5 FM. In 2003, KNPR moved to 88.9 and switched to NPR news and talk. Classical music moved to a new station, KCNV at 89.7.
KNPR also published the magazine Desert Companion.
Repeaters
KWPR at 88.7 FM in Lund
KLNR at 91.7 FM in Panaca
KTPH at 91.7 FM in Tonopah
KLKR at 89.3 FM in Elko
A sixth transmitter, KSGU at St. George, Utah, was sold to the Educational Media Foundation in 2020.
References
External links
Official Website
NPR
News and talk radio stations in the United States
NPR member stations
Radio stations established in 1980
1980 establishments in Nevada
|
https://en.wikipedia.org/wiki/Computer%20facial%20animation
|
Computer facial animation is primarily an area of computer graphics that encapsulates methods and techniques for generating and animating images or models of a character face. The character can be a human, a humanoid, an animal, a legendary creature or character, etc. Due to its subject and output type, it is also related to many other scientific and artistic fields from psychology to traditional animation. The importance of human faces in verbal and non-verbal communication and advances in computer graphics hardware and software have caused considerable scientific, technological, and artistic interests in computer facial animation.
Although development of computer graphics methods for facial animation started in the early-1970s, major achievements in this field are more recent and happened since the late 1980s.
The body of work around computer facial animation can be divided into two main areas: techniques to generate animation data, and methods to apply such data to a character. Techniques such as motion capture and keyframing belong to the first group, while morph targets animation (more commonly known as blendshape animation) and skeletal animation belong to the second. Facial animation has become well-known and popular through animated feature films and computer games but its applications include many more areas such as communication, education, scientific simulation, and agent-based systems (for example online customer service representatives). With the recent advancements in computational power in personal and mobile devices, facial animation has transitioned from appearing in pre-rendered content to being created at runtime.
History
Human facial expression has been the subject of scientific investigation for more than one hundred years. Study of facial movements and expressions started from a biological point of view. After some older investigations, for example by John Bulwer in the late 1640s, Charles Darwin's book The Expression of the Emotions in Men and Animals can be considered a major departure for modern research in behavioural biology.
Computer based facial expression modelling and animation is not a new endeavour. The earliest work with computer based facial representation was done in the early-1970s. The first three-dimensional facial animation was created by Parke in 1972. In 1973, Gillenson developed an interactive system to assemble and edit line drawn facial images. in 1974, Parke developed a parameterized three-dimensional facial model.
One of the most important attempts to describe facial movements was Facial Action Coding System (FACS). Originally developed by Carl-Herman Hjortsjö in the 1960s and updated by Ekman and Friesen in 1978, FACS defines 46 basic facial Action Units (AUs). A major group of these Action Units represent primitive movements of facial muscles in actions such as raising brows, winking, and talking. Eight AU's are for rigid three-dimensional head movements, (i.e. turning and tilting left and rig
|
https://en.wikipedia.org/wiki/The%20Thing%20%28video%20game%29
|
The Thing is a 2002 squad-based third-person shooter survival horror video game developed by Computer Artworks and co-published by Vivendi Universal Games under the Black Label Games label and Konami. It was released for Microsoft Windows, PlayStation 2, and Xbox. GameCube and Game Boy Advance versions were also planned, but both were cancelled early in development.
Set as a sequel to John Carpenter's 1982 film of the same name, the story focuses on Captain Blake, a member of a U.S. Special Forces team sent to the Antarctic outpost featured in the film to determine what has happened to the research team. Only to find himself caught in an invisible fight for survival against the titular shape-shifting alien, who seemingly has regained life despite being destroyed at the end of the film. Other survivors encountered and ordered by Blake assist the battle against the creatures different forms, all while being fully aware that they can trust no-one. The game was endorsed by Carpenter, who has a cameo appearance in the game.
The Thing was a commercial success; selling over one million units worldwide across all platforms, and received generally positive reviews. A sequel was in the early stages of development, but was canceled when Computer Artworks went into receivership in 2003.
Gameplay
The basic gameplay in The Thing is that of a traditional third-person shooter; the player character, Blake, can run and shoot, strafe, crouch, interact with the environment, interact with NPCs and use items, such as flashlights, fire extinguishers or flares. The player also has the option to enter first-person mode for more accurate targeting during combat. When in first-person mode, however, the character cannot move, except to side-step a little to the left and right. Weaponry includes pistols, grenades, sniper rifles, flamethrowers, shotguns, submachine guns, assault rifles, grenade launchers and fixed heavy machine guns. Other items featured in the game are health packs, explosives, ammunition, portable blood test-kits and adrenaline injections.
Enemies come in three main varieties. "Scuttlers" are small Things formed from the limbs and appendages of infected personnel. They are fast, but weak, and can be killed simply by shooting. "Walkers" are larger than scuttlers, and much stronger. To kill them, the player must weaken them using gunfire before then using the flamethrower, as only fire can completely kill them. Bosses are larger and much more powerful than Walkers, and although each one requires a specific strategy to defeat, the principle is the same; weaken it with gunfire before burning it.
One of the main features of The Things gameplay is the inclusion of multiple NPCs who join Blake at various points throughout the game. At any one time, the player can control up to four characters; Blake and three NPCs. There are three types of NPC in the game; engineers, soldiers and medics. Engineers can repair fuse boxes, which control locked doors, computers a
|
https://en.wikipedia.org/wiki/Aladdin4D
|
Aladdin4D is a computer program for modeling and rendering three-dimensional graphics and animations, currently running on AmigaOS and macOS platforms. A-EON Technology Ltd owns the rights and develops current and future versions of Aladdin4D for AmigaOS, MorphOS & AROS. All other platforms including macOS, iPadOS, iOS, Linux & Windows are developed by DiscreetFX.
History
Aladdin4D was originally created by Greg Gorby at Adspec Programming in Ohio, and was an updated version of an earlier 3D program called Draw4D Pro, which integrated elements of desktop publishing into its environment. In 1996, the 3D program was then acquired and updated by Nova Design, Inc. Nova Design added many modern features and made it easier to use. It was one of the first 3D animation programs on any platform to employ volumetrics, which were primarily used to create volumetric gas. However, unlike the majority of Amiga 3D programs, it used scanline rendering instead of the more photo-realistic ray tracing technique. Scanline rendering is similar to the rendering technique used in most Pixar movies.
On December 17, 2007, Nova Design sold all inventory, source code and intellectual property rights to DiscreetFX LLC. DiscreetFX is developing a new 6.0 version for Mac OS X, iPad, Android & Linux.
On December 12, 2014, DiscreetFX sold the AmigaOS source code and development rights for Aladdin4D on AmigaOS, MorphOS & AROS platforms to A-EON Technology Ltd. DiscreetFX retains the rights to other non-Amiga platforms.
Features
This software was one of the few 3D applications for AmigaOS, and not just the Amiga platform--in the sense that it uses an OS-compliant GUI, supports RTG displays, utilizes the AmigaGuide Help system and features an ARexx port for scripting. Concerning the 3D features of the application:
Infinite layering of surfaces: A surface of an object may have a virtually infinite amount of textures, shaders etc. layered on it.
Spline modelling tool.
Importing of most postscript files, making the creation of logos easier.
Unlimited number of working layers: multiple working areas containing only a portion of the scene, easing out the management and pace of objects during the creation of animation.
Gaseous volumetrics with adjustable mass.
Built-in particle system to simulate various effects like fireworks.
Morphing capabilities in the animation system.
Spline animation controls.
Also, Aladdin4D has rendering features like motion blur, multiple pass supersampling, lens flares, 32-bit color support and a highly optimized 68k rendering engine.
Format support
Aladdin4D supports the following 3D formats: Aladdin 4D, LightWave 3D, GEO, EPS, DEM, Draw4D-Pro and Draw4D, 3D Studio for either loading or loading and saving. Image formats supported for loading and saving: IFF/ILBM (palette mapped and 24-bit formats), JPEG and Video Toaster Framestores. Aladdin 4D was one of the first rendering/animation packages to support video editing/post production hardwa
|
https://en.wikipedia.org/wiki/Przemys%C5%82aw%20Prusinkiewicz
|
Przemysław (Przemek) Prusinkiewicz is a Polish computer scientist who advanced the idea that Fibonacci numbers in nature can be in part understood as the expression of certain algebraic constraints on free groups, specifically as certain Lindenmayer grammars. Prusinkiewicz's main work is on the modeling of plant growth through such grammars.
Early life and education
in 1978 Prusinkiewicz received his PhD from Warsaw University of Technology .
Career
As of 2008 he was a professor of Computer Science at the University of Calgary.
Awards
Prusinkiewicz received the 1997 SIGGRAPH Computer Graphics Achievement Award for his work.
Influences
In 2006, Michael Hensel examined the work of Prusinkiewicz and his collaborators - the Calgary team - in an article published in Architectural Design. Hensel argued that the Calgary team's computational plant models or "virtual plants" which culminated in software they developed capable of modeling various plant characteristics, could provide important lessons for architectural design. Architects would learn from "the self-organisation processes underlying the growth of living organisms" and the Calgary team's work uncovered some of that potential. Their computational models allowed for a "quantitative understanding of developmental mechanisms" and had the potential to "lead to a synthetic understanding of the interplay between various aspects of development."
Prusinkiewicz's work was informed by that of the Hungarian biologist Aristid Lindenmayer who developed the theory of L-systems in 1968. Lindenmayer used L-systems to describe the behaviour of plant cells and to model the growth processes, plant development and the branching architecture of plant development.
Publications
References
External links
Biography of Przemysław Prusinkiewicz from the University of Calgary
Laboratory website at the University of Calgary
Warsaw University of Technology alumni
Polish mathematicians
Living people
Computer graphics professionals
Computer graphics researchers
Fibonacci numbers
Polish computer scientists
Year of birth missing (living people)
Academic staff of the University of Calgary
|
https://en.wikipedia.org/wiki/WIPL
|
WIPL (channel 35) is a television station licensed to Lewiston, Maine, United States, broadcasting the Ion Television network to the Portland area. The station is owned by the Ion Media subsidiary of the E.W. Scripps Company, and maintains transmitter facilities in West Baldwin, Maine.
History
The Federal Communications Commission (FCC) granted a construction permit to original station owner Kennebec Valley Television in 1987. After ten years of delays related to difficulties in obtaining financing to construct the station and commence broadcasting, Kennebec Valley Television's corporate successor New England Broadcasting was granted an unbuilt station waiver and WPME signed on August 13, 1997, under a time brokerage agreement with WPXT owner Pegasus Communications Corporation. Prior to WPME's sign-on, viewers in Portland who wanted to watch UPN had to view it on cable via Boston's WSBK-TV. In February 2001, New England Broadcasting sold WPME to KB Prime Media LLC, which inherited the previous agreement with Pegasus. Pegasus Communications was permitted by the FCC to purchase WPME outright in February 2005 under the previously-granted unbuilt station waiver. The station maintained a primary affiliation with UPN and secondary affiliation with The WB. It aired WB prime time on a tape delay starting at 10. When WPXT switched its affiliation from Fox to The WB, this secondary affiliation was dropped. WPME aired Boston Celtics and Bruins games in the late 1990s and Red Sox baseball until 2002. The Red Sox, owning half of cable sports network NESN, moved the games to that network.
This station's only attempt at local news was a 7 o'clock broadcast (produced by WPXT) in 2001 which was quickly canceled due to low ratings and inconsistent viewership. The station did not air a prime time newscast at 10 p.m. like many other UPN affiliates because it would compete with WPXT's nightly broadcast. However, that station's show was simulcasted on WPME for a period of time. Pegasus declared bankruptcy in June 2004 over a dispute with DirecTV over marketing of the direct broadcast satellite service in rural areas. The Pegasus station group was sold in August 2006 to private investment firm CP Media, LLC of Wilkes-Barre, Pennsylvania, for $55.5 million. CP Media eventually formed a new broadcasting company, New Age Media.
In the wake of the merger of The WB and UPN into The CW, WPXT was announced as that network's Portland affiliate on March 9, 2006. WPME would then announce it would associate with MyNetworkTV on May 1, a network owned by News Corporation that was made up of stations which would not become CW affiliates. WPME joined the network on its launch date, September 5, 2006. It would be the only MyNetworkTV affiliate in Maine until December 6, 2006, when Bangor Fox affiliate WFVX-LD took a secondary affiliation with the network.
On June 27, 2008, WPME signed-on a new second digital subchannel to be the "Maine Visitor's Channel" (which was dropped in Oct
|
https://en.wikipedia.org/wiki/Maria%20Klawe
|
Maria Margaret Klawe ( ; born 1951) is a computer scientist and the fifth president of Harvey Mudd College (since July 1, 2006). Born in Toronto in 1951, she became a naturalized U.S. citizen in 2009. She was previously Dean of the School of Engineering and Applied Science at Princeton University. She is known for her advocacy for women in STEM fields.
Biography
Klawe was born in Toronto, Ontario. She lived in Scotland from ages 4 to 12, and then returned to Canada, living with her family in Edmonton, Alberta.
Klawe studied at the University of Alberta, dropped out to travel the world, and returned to earn her B.Sc. in 1973. She stayed at Alberta for her graduate studies, and in 1977 she earned her Ph.D. there in mathematics. She joined the mathematics faculty at Oakland University as an assistant professor in 1977 but only stayed for a year. She started a second Ph.D., in computer science, at the University of Toronto, but was offered a faculty position there before completing the degree. When she made the decision to get a PhD in computer science she had never studied the subject before. There weren't many undergraduate classes at the time so she enrolled in upper-level courses and studied about 16 hours a day to do well. She spent eight years in industry, serving at IBM's Almaden Research Center in San Jose, California, first as a research scientist, then as manager of the Discrete Mathematics Group and manager of the Mathematics and Related Computer Science Department. She and her husband Nick Pippenger then moved to the University of British Columbia, where she stayed for 15 years and served as head of the Department of Computer Science from 1988 to 1995, vice president of student and academic services from 1995 to 1998, and dean of science from 1998 to 2002.
From UBC she moved to Princeton and then Harvey Mudd College, where she is the first woman president. When she arrived at Mudd only about 30% of students and faculty were female. Today about 50% of the students and over 40% of the faculty are female. She became a citizen of the United States on January 29, 2009. Later in 2009, she joined the board of directors of the Microsoft Corporation.
Awards and honors
Klawe was inducted as a fellow of the Association for Computing Machinery in 1996, a founding fellow of the Canadian Information Processing Society in 2006, a fellow of the American Academy of Arts and Sciences in 2009, a fellow of the American Mathematical Society in 2012, and a fellow of the Association for Women in Mathematics in 2019.
In 1997 she was selected as an NSERC Chair for Women in Science and Engineering (CWSE) at the University of British Columbia, one of only five in Canada.
She has been awarded honorary doctorates from Ryerson Polytechnic University in 2001, the University of Waterloo in 2003, Queen's University in 2004, Dalhousie University in 2005, Acadia University in 2006, the University of Alberta in 2007, the University of Ottawa in 2008, the University o
|
https://en.wikipedia.org/wiki/David%20Dobkin
|
David Dobkin may refer to:
David P. Dobkin (born 1948), computer scientist and the Dean of the Faculty at Princeton University
David Dobkin (director) (born ca. 1969), movie director, responsible for Clay Pigeons, Shanghai Knights, and Wedding Crashers
|
https://en.wikipedia.org/wiki/Denise%20Keller
|
Denise Lorraine Keller (born March 24, 1982) is a Singaporean model and former VJ for MTV Asia and currently hosts "Passage to Malaysia" on TLC, part of the Discovery Channel network. She is of Malacca-Chinese and German ancestry. She was educated at the German European School Singapore in Singapore. She has a sister named Nadine Keller.
Career
At age 13, she was discovered in a shopping mall by a modeling scout and signed with a modeling agency.
Keller became Singapore's representative in Ford's Supermodel of the World finals in 2000, for which she won the title. Throughout her modeling career, she has been the face of countless TV and print commercial campaigns. Among the various TV shows she has hosted was the Ford Supermodel Singapore Finals in 2001.
By 2002, she had modeled internationally, from New York City to Hong Kong to Tokyo. And in that same year, she got her biggest break to date when she was selected to be the female VJ for MTV Asia. She has hosted two MTV Asia awards and has interviewed rock, pop, and hip hop superstars from all around the world.
In 2005, Denise Keller took part in Singapore's second English language reality dating program Eye for a Guy 2. In this program several eligible bachelors pursued the affections of Ms. Keller in this "Bachelorette"-style program. While well received by critics and its viewers, Eye for a Guy 2 was plagued by low viewership throughout most of its run. This only changed during the final two episodes when Ms. Keller made her choice among the final two suitors, Howard Shan Lo and Wolfgang Gorny. Even then, the final episodes were dogged by controversy regarding 'leaked' photographs of Denise Keller and Wolfgang Gorny together in Bali. Detractors of the series accused these 'leaked' photos to be nothing more than a ploy to increase viewership of the series. Eye for a Guy 2 ended with Denise Keller choosing Wolfgang Gorny as the man who won her affections. Despite the low viewership of the series, Keller was lauded as a more compelling bachlorette compared to the first series' bachelorette, Rachel Lee.
In September 2006, Keller and Dick Lee hosted a luxury lifestyle program shown in Singapore, entitled The Finer Side. This program featured the two hosts as they toured the glitzy and opulent side of Singapore and also featured candid chats with the city's rich, famous and powerful citizens regarding their extravagant lifestyles.
Also in September 2006, Keller took a two-month sabbatical break in order to study theater arts at the Lee Strasberg Theater Institute in New York City. Prior to this, she traveled to New York City to cover the MTV Video Music Awards for MTV Asia.
In 2007, Keller served as MasterCard's Fashion Ambassador for the Singapore Fashion Festival. She interviewed some of the world's top models and fashion designers in this capacity. She reprised this role in the 2008 Singapore Fashion Festival. Keller was the star of MasterCard's 'Priceless' campaign in Asia Pacific. Also
|
https://en.wikipedia.org/wiki/PMN
|
PMN may refer to:
National Mobilization Party (Partido da Mobilização Nacional), a political party in Brazil
Podsafe Music Network, an Internet music archive
Polymorphonuclear leukocytes, or granulocyte
Polymorphonuclear neutrophil, the most abundant white blood cells in the peripheral blood of many mammals
Promenade MRT station, Singapore (MRT station abbreviation)
PMN mine, an anti-personnel mine
Panglima Mangku Negara, a Malaysian honour
|
https://en.wikipedia.org/wiki/Parallel%20Bus%20Interface
|
The Parallel Bus Interface, or PBI, is a 50-pin port found on some Atari 8-bit XL computers. It provides unbuffered, direct connection to the system bus lines (address, data, control), running at the same speed as the 6502 CPU. The 600XL and 800XL computers, along with the unreleased 1400XL and 1450XLD had a PBI interface.
The Enhanced Cartridge Interface, or ECI, was a modified version of the PBI designed to be smaller and less expensive to implement. Many of the pins in the PBI were duplicated in the 30-pin cartridge slot, so ECI was limited to only those 14 pins in the PBI that were not in the cartridge slot. Placed side-by-side on the back of the computer, devices plugged into both at the same time to provide the same electrical interface as the PBI. The ECI was found on the 65XE (late production units only), the 130XE and the 800XE.
Details
The PBI is implemented as a rectangular 50-pin edge connector on the back of XL machines. The pins include all 16 address lines (A0 through A15) and 8 data lines (D0 through D7). Other pins include various electrical supplies, clock signals, interrupts, memory strobes, and even an analog audio input.
As many of these pins were already implemented as part of the already-existing 30-pin ROM cartridge slots on Atari machines, the XE series re-implemented the PBI to include only those pins that the PBI had but the cartridge slot didn't. The resulting connector contained only 14 pins, mostly the address pins A13 though A15, and the various sound and signal pins of the PBI. The ECI slot was placed beside the cartridge slot, allowing a single connector to be inserted into both connectors and re-create the functionality of the entire PBI.
Pinout
Devices
Atari 1064 Memory Module - Designed specifically for the 600XL, it upgraded the memory of the 600XL to 64kB. Only parallel bus device released by Atari.
Atari 1090 Expansion System - Designed to give expansion slots to the XL computers.
ICD Multi I/O Board - Hooked up to either a PBI or ECI connection. Featured a RAMdisk, parallel port, serial port, print spooler and a hard disk interface.
Black Box - The Black Box by CSS hooks up to either PBI or ECI connection. Featured a SCSI interface, a serial port, parallel port, floppy drive interface and a built-in menu system.
SupraDrive - an early SCSI disk drive.
Karin Maxi, a parallel floppy disk drive.
KMK/JŻ IDE (aka IDEa), an ATA host adapter ().
Turbo Freezer XL/XE, a freezer with onboard ROM including a monitor/debugger and RAM expansion (re-released 2005 and 2011 by ABBUC).
IDE2ECI
RAM320XL for the PBI and RAM320XE/576 for the ECI external RAM expansions.
References
Ian Chadwick, Appendix 14: The XL/XE Parallel Bus, Mapping the Atari Revised Edition, COMPUTE! Publications,
External links
ICD Boosts 8-bit Atari Power Antic Magazine. Review on ICD products for the Atari.
Atari 8-bit family
|
https://en.wikipedia.org/wiki/Paris%20Kanellakis%20Award
|
The Paris Kanellakis Theory and Practice Award is granted yearly by the Association for Computing Machinery (ACM) to honor "specific theoretical accomplishments that have had a significant and demonstrable effect on the practice of computing". It was instituted in 1996, in memory of Paris C. Kanellakis, a computer scientist who died with his immediate family in an airplane crash in South America in 1995 (American Airlines Flight 965). The award is accompanied by a prize of $10,000 and is endowed by contributions from Kanellakis's parents, with additional financial support provided by four ACM Special Interest Groups (SIGACT, SIGDA, SIGMOD, and SIGPLAN), the ACM SIG Projects Fund, and individual contributions.
Winners
See also
List of computer science awards
References
External links
Paris Kanellakis Theory and Practice Award on the ACM website.
The Paris Kanellakis Theory and Practice Award Committee on the ACM website.
Awards of the Association for Computing Machinery
Computer science awards
|
https://en.wikipedia.org/wiki/Evaluation%20strategy
|
In a programming language, an evaluation strategy is a set of rules for evaluating expressions. The term is often used to refer to the more specific notion of a parameter-passing strategy that defines the kind of value that is passed to the function for each parameter (the binding strategy) and whether to evaluate the parameters of a function call, and if so in what order (the evaluation order). The notion of reduction strategy is distinct, although some authors conflate the two terms and the definition of each term is not widely agreed upon.
To illustrate, executing a function call f(a,b) may first evaluate the arguments a and b, store the results in references or memory locations ref_a and ref_b, then evaluate the function's body with those references passed in. This gives the function the ability to look up the argument values, to modify them via assignment as if they were local variables, and to return values via the references. This is the call-by-reference evaluation strategy.
Evaluation strategy is part of the semantics of the programming language definition. Some languages, such as PureScript, have variants with different evaluation strategies. Some declarative languages, such as Datalog, support multiple evaluation strategies. Some languages define a calling convention.
Table
This is a table of evaluation strategies and representative languages by year introduced. The representative languages are listed in chronological order, starting with the language(s) that introduced the strategy and followed by prominent languages that use the strategy.
Evaluation orders
While the order of operations defines the abstract syntax tree of the expression, the evaluation order defines the order in which expressions are evaluated. For example, the Python program
def f(x):
print(x)
return x
f(1) + f(2)
outputs 1 2 due to Python's left-to-right evaluation order, but a similar program in OCaml:
let f x = print_string (string_of_int x); x ;;
f 1 + f 2
outputs 2 1 due to OCaml's right-to-left evaluation order.
The evaluation order is mainly visible in code with side effects, but it also affects the performance of the code because a rigid order inhibits instruction scheduling. For this reason language standards such as C++ traditionally left the order unspecified, although languages such as Java and C# define the evaluation order as left-to-right and the C++17 standard has added constraints on the evaluation order.
Strict evaluation
Applicative order is a family of evaluation orders in which a function's arguments are evaluated completely before the function is applied.
This has the effect of making the function strict, i.e. the function's result is undefined if any of the arguments are undefined, so applicative order evaluation is more commonly called strict evaluation. Furthermore, a function call is performed as soon as it is encountered in a procedure, so it is also called eager evaluation or greedy evaluation. Some authors refer to
|
https://en.wikipedia.org/wiki/Moccasin%20Flats
|
Moccasin Flats is a Canadian drama television series that ran for three full seasons. The show, which has aired on the Aboriginal Peoples Television Network (APTN) and Showcase Television since 2004, is co-produced by Big Soul Productions Inc. (Toronto) and Stephen Onda Productions Inc. (Regina). It takes place in Moccasin Flats, Regina, Saskatchewan, an urban reserve where the inhabitants struggle to maintain their cultural identity while overcoming poverty, gangs, violence, and racism. The series features award-nominated actor Andrea Menard and original music by Donald Quan.
The original incarnation of Moccasin Flats was as a 2002 short of the same title. This movie was the product of an Indigenous youth media empowerment workshop called repREZentin', which teamed Indigenous youth with industry professionals in an effort to create short films and videos that told their stories. The short told the story of Justin, a young Indigenous man who has just found that he has been accepted to university. While he is grateful for the opportunity, he is afraid to leave his friends and family (particularly his younger brother) behind in the harsh neighbourhood of Moccasin Flats. His fears are compounded when his archrival, who is also the former pimp of his ex-prostitute girlfriend, is released from jail and back into the Flats.
The popularity of the short film led to the creation of the Moccasin Flats television series that starred many of the youth from the original film.
The third season of Moccasin Flats was nominated for three Gemini Awards.
It is the first Indigenous-created, produced, and controlled dramatic series in North America.
Cast and characters
Tantoo Cardinal as Betty Merasty
Gordon Tootoosis as Joe Redsky
Andrea Menard as Const. Amanda Strongeagle
Ryan Rajendra Black as Devlin Day
Sarah Podemski as Tara
Matthew Strongeagle as Matthew Merasty
Ron Harris as Red
Landon Montour as Jonathan Bearclaw
Candace Fox as Candy
Jennifer Podemski as Deb Johnson
Cheri Maracle as Mrs. Wolfe
Season synopses
Season 1 (2003)
In the inner-city community of Moccasin Flats, Dillon Redsky has to survive one last summer before he gets out of the ghetto and goes to university to pursue his dreams of becoming a basketball star. Unfortunately for Dillon, some people don't want to see him succeed. Dillon's childhood friend, Jonathan, a local gangster and pimp, tries to make Dillon's life a nightmare when he falls for one of his sex workers and tries to get her off the streets.
Season 2 (2004)
Jonathan has given up his life of pimping and drug dealing in order to be reunited with his girlfriend and son. He is working hard to turn his life around and be a good father and boyfriend, but when his debts start piling up, the temptations of ghetto life get the better of him. He decides to use his home-based vitamin company as a cover for a crystal meth operation and run the other drug dealers out of the neighbourhood.
Season 3 (2006)
Now that Jonathan ha
|
https://en.wikipedia.org/wiki/Extended%20Enterprise%20Modeling%20Language
|
Extended Enterprise Modeling Language (EEML) in software engineering is a modelling language used for Enterprise modelling across a number of layers.
Overview
Extended Enterprise Modeling Language (EEML) is a modelling language which combines structural modelling, business process modelling, goal modelling with goal hierarchies and resource modelling. It was intended to bridge the gap between goal modelling and other modelling approaches. According to Johannesson and Söderström (2008) "the process logic in EEML is mainly expressed through nested structures of tasks and decision points. The sequencing of tasks is expressed by the flow relation between decision points. Each task has an input port and the output port being decision points for modeling process logic".
EEML was designed as a simple language, making it easy to update models. In addition to capturing tasks and their interdependencies, models show which roles perform each task, and the tools, services and information they apply.
History
Extended Enterprise Modeling Language (EEML) is from the late 1990s, developed in the EU project EXTERNAL as extension of the Action Port Model (APM) by S. Carlsen (1998). The EXTERNAL project aimed to "facilitate inter-organisational cooperation in knowledge intensive industries. The project worked on the hypothesis that interactive process models form a suitable framework for tools and methodologies for dynamically networked organisations. In the project EEML (Extended Enterprise Modelling Language) was first constructed as a common metamodel, designed to enable syntactic and semantic interoperability".
It was further developed in the EU projects Unified Enterprise Modelling Language (UEML) from 2002 to 2003 and the ongoing ATHENA project.
The objectives of the UEML Working group were to "define, to validate and to disseminate a set of core language constructs to support a Unified Language for Enterprise Modelling, named UEML, to serve as a basis for interoperability within a smart organisation or a network of enterprises".
Topics
Modeling domains
The EEML-language is divided into 4 sub-languages, with well-defined links across these languages:
Process modelling
Data modelling
Resource modelling
Goal modelling
Process modelling in EEML, according to Krogstie (2006) "supports the modeling of process logic which is mainly expressed through nested structures of tasks and decision points. The sequencing of the tasks is expressed by the flow relation between decision points. Each task has minimum an input port and an output port being decision points for modeling process logic, Resource roles are used to connect resources of various kinds (persons, organisations, information, material objects, software tools and manual tools) to the tasks. In addition, data modeling (using UML class diagrams), goal modeling and competency modeling (skill requirements and skills possessed) can be integrated with the process models".
Layers
EEML has four layers of
|
https://en.wikipedia.org/wiki/Terayon
|
Terayon Communication Systems, Inc. was a company that vended equipment to broadband service providers for delivering broadband voice, video and data services to residential and business subscribers.
History
Terayon was founded by Israeli brothers Zaki Rakib and Shlomo Rakib in 1993; both brothers graduated from high school at age 16 and went on to university. Shlomo studied electrical engineering, and Zaki did a PhD in mechanical engineering and post-doctorate studies in applied mathematics. He taught for a while at Tel Aviv University’s computer science faculty, and then joined Helios. After Helios was sold to Cadence Design Systems, Zaki moved to the US, and urged his brother to join him and set up the company. Terayon held an IPO on NASDAQ in August 1998.
In 1999, the company initiated a strategy to expand its offerings to the telecommunication and satellite industries but later refocused its business on the cable industry in 2000. During 1999 and 2000 the company acquired seven other companies, including: Imedia, a video processing startup founded by Efi Arazi (founder of Scitex) for $100m; Radwiz for $64m from the Rad Group, Teledata Networks (which was later sold) and Ultracom Communications for $32m in March 2000.
In 2004, Terayon recentered its strategy on digital video solutions, marketing to television broadcasters, telecom carriers and satellite television providers. Terayon also decided to phase out equipment for home access, such as cable modems and home networking devices.
In April 2006, Terayon was delisted from NASDAQ due to outstanding financial reports. Motorola Inc. acquired Terayon for $140 million in June 2007.
See also
Motorola Inc.
References
Companies formerly listed on the Nasdaq
Companies based in Santa Clara, California
|
https://en.wikipedia.org/wiki/Production%20rule
|
Production rule may refer to:
Production rules used in business rule engines, cognitive modeling and artificial intelligence, see Production system
Production rules that expand nodes in formal grammars, see production (computer science)
Rules governing legal requests that documents be provided, see request for production
See also
Production Rule Representation, an OMG standard for production rules used in production systems
|
https://en.wikipedia.org/wiki/%C3%89va%20Tardos
|
Éva Tardos (born 1 October 1957) is a Hungarian mathematician and the Jacob Gould Schurman Professor of Computer Science at Cornell University.
Tardos's research interest is algorithms. Her work focuses on the design and analysis of efficient methods for combinatorial optimization problems on graphs or networks. She has done some work on network flow algorithms like approximation algorithms for network flows, cut, and clustering problems. Her recent work focuses on algorithmic game theory and simple auctions.
Education and career
Tardos received her Dipl. Math in 1981 and her Ph.D. 1984 from the Faculty of Sciences of the Eötvös Loránd University under her advisor András Frank. She was the Chair of the Department of Computer Science at Cornell from 2006-2010, and she is currently serving as the Associate Dean of the College of Computing and Information Science.
She was editor-in-Chief of SIAM Journal on Computing from 2004–2009, and is currently the Economics and Computation area editor of the Journal of the ACM as well as on the Board of Editors of Theory of Computing.
She has co-authored with Jon Kleinberg a textbook called Algorithm Design ().
Honors and awards
Tardos has been elected to the National Academy of Engineering (2007), the American Academy of Arts and Sciences, and the National Academy of Sciences (2013) and the American Philosophical Society (2020)
She is also an ACM Fellow (since 1998), a Fellow of INFORMS, and a Fellow of the American Mathematical Society (2013)
She is the recipient of Packard, Sloan Foundation, and Guggenheim fellowships.
She is the winner of the Fulkerson Prize (1988),
the George B. Dantzig Prize (2006),
the Van Wijngaarden Award (2011),
the Gödel Prize (2012)
and the EATCS Award (2017),
In 2018 the Association for Women in Mathematics and Society for Industrial and Applied Mathematics selected her as their annual Sonia Kovalevsky Lecturer.
In 2019 she was awarded the IEEE John von Neumann Medal.
Personal
Tardos is married to David Shmoys. Gábor Tardos is her younger brother.
See also
Tardos function
References
External links
Eva Tardos on Google Scholar
Cornell University: Eva Tardos, Department of Computer Science
20th-century Hungarian mathematicians
21st-century Hungarian mathematicians
Hungarian women computer scientists
Women mathematicians
Hungarian computer scientists
Cornell University faculty
Living people
1957 births
Fellows of the American Mathematical Society
Fellows of the Association for Computing Machinery
Fellows of the Institute for Operations Research and the Management Sciences
Fellows of the Society for Industrial and Applied Mathematics
Gödel Prize laureates
Members of the United States National Academy of Engineering
Members of the United States National Academy of Sciences
Hungarian people of Jewish descent
Hungarian women academics
Expatriate academics in the United States
Eötvös Loránd University alumni
Academic journal editors
Members of the American Philosophical Society
|
https://en.wikipedia.org/wiki/List%20of%20computer%20science%20conferences
|
This is a list of academic conferences in computer science. Only conferences with separate articles are included; within each field, the conferences are listed alphabetically by their short names.
General
FCRC – Federated Computing Research Conference
Algorithms and theory
Conferences accepting a broad range of topics from theoretical computer science, including algorithms, data structures, computability, computational complexity, automata theory and formal languages:
CCC - Computational Complexity Conference
FCT – International Symposium on Fundamentals of Computation Theory
FOCS – IEEE Symposium on Foundations of Computer Science
ICALP – International Colloquium on Automata, Languages and Programming
ISAAC – International Symposium on Algorithms and Computation
MFCS – International Symposium on Mathematical Foundations of Computer Science
STACS – Symposium on Theoretical Aspects of Computer Science
STOC – ACM Symposium on Theory of Computing
WoLLIC – Workshop on Logic, Language, Information and Computation
Algorithms
Conferences whose topic is algorithms and data structures considered broadly, but that do not include other areas of theoretical computer science such as computational complexity theory:
ESA – European Symposium on Algorithms
SODA – ACM–SIAM Symposium on Discrete Algorithms
SWAT – Scandinavian Symposium and Workshops on Algorithm Theory
WADS – Algorithms and Data Structures Symposium
WAOA – Workshop on Approximation and Online Algorithms
Geometric algorithms
Conferences on computational geometry, graph drawing, and other application areas of geometric computing:
GD – International Symposium on Graph Drawing
SoCG – Symposium on Computational Geometry
Logic
LICS – ACM–IEEE Symposium on Logic in Computer Science
RTA – International Conference on Rewriting Techniques and Applications
Other specialized subtopics
CIAA – International Conference on Implementation and Application of Automata
CCC – Computational Complexity Conference
DCFS – International Workshop on Descriptional Complexity of Formal Systems
DLT – International Conference on Developments in Language Theory
ISSAC – International Symposium on Symbolic and Algebraic Computation
Petri Nets - International Conference on Applications and Theory of Petri Nets and Concurrency
RP – International Conference on Reachability Problems
SEA – Symposium on Experimental Algorithms
Languages and software
Programming languages
Conferences on programming languages, programming language theory and compilers:
CC International Conference on Compiler Construction
ECOOP – AITO European Conference on Object-Oriented Programming
ESOP – ETAPS European Symposium on Programming
HOPL – ACM SIGPLAN History of Programming Languages Conference
ICFP – ACM SIGPLAN International Conference on Functional Programming
ICLP – ALP International Conference on Logic Programming
ISMM – ACM SIGPLAN International Symposium on Memory Management
OOPSLA – ACM SIGPLAN Confer
|
https://en.wikipedia.org/wiki/Stil%20FM
|
Stil FM 105.5 FM is a radio station in Călăraşi, Romania.
The Stil FM radio program includes Pro FM network shows - Morning, Evening and Weekend shows.
Stil FM broadcasts in two cities:*
Călăraşi – 105.5 FM
Oltenița – 88.2 FM
*See map of broadcast areas on the Stil FM website.
References
External links
Radio stations in Romania – Romanian Ministry of Communications and Information Technology (Romanian)
Romanian Ministry of Communications and Information Technology (Romanian & English)
Company listing on Westbiz website
Radio stations in Romania
Romanian-language radio stations
Mass media in Călărași
|
https://en.wikipedia.org/wiki/Paris%20Kanellakis
|
Paris Christos Kanellakis (; December 3, 1953 – December 20, 1995) was a Greek American computer scientist.
Life and academic path
Kanellakis was born on December 3, 1953, in Athens as the only child of General Eleftherios and Mrs. Argyroula Kanellakis.
In 1976, he received a diploma in electrical engineering from the National Technical University of Athens, with a thesis supervised by Emmanuel Protonotarios. He continued his studies at the graduate level in electrical engineering and computer science at the Massachusetts Institute of Technology. He received his M.Sc. degree in 1978. His thesis Algorithms for a scheduling application of the Asymmetric Traveling Salesman Problem was supervised by Ron Rivest and Michael Athans, although Christos Papadimitriou (then professor at Harvard) was also involved. He then continued working for his Ph.D. with Papadimitriou (who was then also at MIT) as advisor. He submitted his thesis The complexity of concurrency control for distributed databases in September 1981. He was awarded the doctorate degree in February 1982.
In 1981, he joined the Computer Science Department at Brown University as assistant professor. He obtained tenure as associate professor in 1986, and became full professor in 1990. He interrupted his stay at Brown in 1984 for a junior sabbatical as visiting assistant professor at the MIT Laboratory for Computer Science, working with Nancy Lynch, and in 1988 for a year at INRIA on special assignment leave, working with Serge Abiteboul. Between 1982 and 1991, he paid several short visits to the IBM T.J. Watson Research Center.
His awards include an IBM Faculty Development Award (1985) and a Sloan Research Fellowship in mathematics (1987–1989). During 1989–90, he was IBM Associate Professor of Computer Science.
He was born a Greek citizen, and obtained U.S. citizenship in 1988.
Kanellakis died on December 20, 1995, together with his wife, Maria Teresa Otoya, and their two children, Alexandra and Stephanos, in the crash of American Airlines Flight 965 while en route to an annual holiday reunion with his wife's family.
Research and academic service
His scientific contributions lie in the fields of database theory—comprising work on deductive databases, object-oriented databases, and constraint databases—as well as in fault-tolerant distributed computation and in type theory.
While at Brown, he supervised seven Ph.D. theses there (Smolka 1985, Revesz 1991, Shvartsman 1992, Mitchell 1993, Hillebrand 1994, Ramaswamy 1995, and Goldin 1997) and one at MIT (Cosmadakis 1985).
He participated in the program committees of numerous editions of international meetings, including
PODS,
VLDB,
LICS,
STOC,
FOCS,
STACS, and
PODC.
He served as editorial advisor to the scientific journals
Information and Computation,
SIAM Journal on Computing,
Theoretical Computer Science,
ACM Transactions on Database Systems,
Journal of Logic Programming,
Chicago Journal of Theoretical Computer Science, and
Applied Mathe
|
https://en.wikipedia.org/wiki/PowerNation
|
PowerNation is a programming block of automotive how-to enthusiast television programs that began originally as the PowerBlock. It is currently produced by Gray Television, which purchased the assets of PowerNation's former owner Raycom Media in 2019. PowerNation consists of a block of automotive enthusiast shows including Engine Power, XOR (Xtreme Off Road), Truck Tech, and Detroit Muscle. PowerNation airs on the History Channel, and also features content on its own through a digital media player app available on the Amazon Fire TV, Apple TV and Roku platforms.
History
PowerNation first began airing on The Nashville Network (commonly referred to as TNN, now the Paramount Network, which shifted to a general entertainment model in 2018 and stopped carrying PowerNation programming) in 1999 as PowerBlock. PowerBlock rebranded to PowerNation in 2014 and began airing on NBCSN and CBS Sports Network in addition to the Paramount Network. PowerBlock was originally hosted by Michelle Spaziano, followed by Danica Patrick. PowerNation was originally hosted by Courtney Hansen, then later by Katie Osborne. PowerNation is produced by RTM Studios in Franklin, TN.
Programming
Engine Power
Engine Power (previously known as HorsePower, and originally Hot Rod TV) began airing in 1999 on The Nashville Network (now Paramount Network), hosted by Joe Elmore and Chuck Hanson, and later added Mike Galley. In later years, engine builders Buddy Hendricks then John Bouchard were added and shared co-hosting duties. Engine Power is currently hosted by Pat Topolinski and Frankie Forman. Engine Power follows a how-to show format that focuses on assembling and tuning everything from mild performance street engines to full-race monster engines.
Detroit Muscle
Detroit Muscle (previously known as MuscleCar) began airing in 2006 on Spike TV (now Paramount Network). MuscleCar was originally hosted by Lou Santiago and Jared Zimmerman, then later by Rick Bacon, Brent Buttrey, Tommy Boshers, Joe Elmore, Steve Mank, Marc Christ, Daniel Boshears and others throughout the years. Detroit Muscle is currently hosted by Boshers and Joel McMillan. Detroit Muscle follows a how-to show format restoring and modifying classic and late model muscle cars. Ez Gg
Truck Tech
Truck Tech (previously known as Trucks!) began airing in 1999 on The Nashville Network (now Paramount Network). Trucks! was originally hosted by Mel Fair and Stacey David. After David left in 2005, Trucks! was hosted by Kevin Tetz and Paul Vinson, then Ryan Shand, Jeremy Bumpus and others since then. Truck Tech was finally hosted by Lawrence "LT" Tolman and Austin LeFort. Truck Tech followed a how-to show format that showed viewers how to restore, modify, customize and paint classic and late model trucks.
Truck Tech has since been rebranded as Music City Trucks, hosted by Marc Christ and Brandon Burke, then by Christ and Eric Smart.
XOR
XOR (previously known as Xtreme 4x4 and Xtreme Off Road) began airing in 2005 on Spike
|
https://en.wikipedia.org/wiki/Cryptographic%20key%20types
|
A cryptographic key is a string of data that is used to lock or unlock cryptographic functions, including authentication, authorization and encryption. Cryptographic keys are grouped into cryptographic key types according to the functions they perform.
Description
Consider a keyring that contains a variety of keys. These keys might be various shapes and sizes, but one thing is certain, each will generally serve a separate purpose. One key might be used to start an automobile, while another might be used to open a safe deposit box. The automobile key will not work to open the safe deposit box and vice versa. This analogy provides some insight on how cryptographic key types work. These keys are categorized in respect to how they are used and what properties they possess.
A cryptographic key is categorized according to how it will be used and what properties it has. For example, a key might have one of the following properties: Symmetric, Public or Private. Keys may also be grouped into pairs that have one private and one public key, which is referred to as an Asymmetric key pair.
Asymmetric versus symmetric keys
Asymmetric keys differ from symmetric keys in that the algorithms use separate keys for encryption and decryption, while a symmetric key’s algorithm uses a single key for both processes. Because multiple keys are used with an asymmetric algorithm, the process takes longer to produce than a symmetric key algorithm would. However, the benefits lay in the fact that an asymmetric algorithm is much more secure than a symmetric key algorithm is.
With a symmetric key, the key needs to be transmitted to the receiver, where there is always the possibility that the key could be intercepted or tampered with. With an asymmetric key, the message and/or accompanying data can be sent or received by using a public key; however, the receiver or sender would use his or her personal private key to access the message and/or accompanying data. Thus, asymmetric keys are suited for use for transmitting confidential messages and data and when authentication is required for assurance that the message has not been tampered with. Only the receiver, who is in possession of the private key’s corresponding to the public key(encryption only key), has the ability to decode the message. A public key can be sent back and forth between recipients, but a private key remains fixed to one location and is not sent back and forth, which keeps it safe from being intercepted during transmission.
Long term versus single use
Cryptographic keys may also have keys that designate they can be used for long-term (static, archived) use or used for a single session (ephemeral). The latter generally applies to the use of an Ephemeral Key Agreement Key. Most other key types are designed to last for long crypto-periods, from about one to two years. When a shorter crypto-period is designed different key types may be used, such as Data Encryption keys, Symmetric Authentication keys, Pri
|
https://en.wikipedia.org/wiki/Speech%20Manager
|
The Speech Manager, in the classic Mac OS, is a part of the operating system used to convert text into sound data to play through a sound output device such as a speaker. The Speech Manager's interaction with the Sound Manager is transparent to a software application.
See also
PlainTalk
External links
Apple Developer Connection: About the Speech Manager
Classic Mac OS
Macintosh operating systems APIs
|
https://en.wikipedia.org/wiki/Sound%20Manager
|
The Sound Manager is a part of the classic Apple Macintosh operating system, in Classic Mac OS. It is used to control the production and manipulation of sounds on Macintosh computers. The Sound Manager is also used by other parts of the Macintosh system software that produce sounds, such as the Speech Manager and QuickTime.
It was replaced by Core Audio in Mac OS X.
External links
Apple Developer Connection: Sound Manager Documentation Chapter 2
Macintosh operating systems APIs
|
https://en.wikipedia.org/wiki/South%20African%20Computer%20Olympiad
|
The South African Computing Olympiad (SACO) is an annual computer programming competition for secondary school students (although at least one primary school student has participated) in South Africa. The South African team for the International Olympiad in Informatics is selected through it.
Competition rounds
The competition consists of three rounds. The first is a pen-and-paper aptitude examination at the entrant's school, testing a combination of general knowledge, computer knowledge, problem-solving and basic programming. (Entrants are often required to program an imaginary robot in a fictional Logo-like language.) Although the first round is not compulsory, it is accessible to those who do not have access to, or knowledge of, computers. 31,926 students entered it in 2006.
In the second round, actual programs must be written and executed. There are five questions, each requiring a different program to be written. Most entrants answer only a single question. The tasks usually include one basic shape-drawing program—for example, the 2004 question "TriSquare" required output such as:
*
* *
* *
*****
* *
* *
* *
*****
The top performers—those who have answered four or five questions in the second round—are invited to the final round. In prior years, between 10 and 15 students were chosen; but the introduction of a new language, and increased funding from the Shuttleworth Foundation in 2005, has increased it to between 20 and 30 students. The final round is held at the University of Cape Town, where finalists stay over a weekend. It consists of two five-hour rounds, the first on Saturday and second on Sunday. The problems are similar to those in the USACO, though somewhat easier. A prize ceremony is held that Monday.
Prizes
The top six entrants are awarded medals (one gold, two silver and three bronze). There are cash prizes, both for the winners and their schools. There were bonus prizes totalling R100,000 for using Python, due to Shuttleworth's sponsorship. The sponsorship ended in 2013 and no additional prizes are given for using Python presently.
The top performers are invited to a squad which will be given additional training from the Olympiad coaches and the USACO training programme. Four programmers are then selected from the squad to represent South Africa at the International Olympiad in Informatics.
Languages
In the first round, it is not necessary to know a programming language. In the second round, contestants may use a language of their choice (within reason - Brainfuck is presumably excluded). In the third round, however, the set of languages is restricted to:
Pascal - the language taught in high schools in some South African provinces (including Gauteng)
Delphi - the language taught in high schools in some South African provinces (including Free State)
Java - taught in other provinces (including the Western Cape)
Python - sponsored by Mark Shuttleworth
C/C++
Python programs are given a 10x time bonus.
So
|
https://en.wikipedia.org/wiki/Gerald%20McBoing-Boing%20%28TV%20series%29
|
Gerald McBoing-Boing is a 2D animated children's television series based on the 1950 animated short film Gerald McBoing-Boing. It premiered on Cartoon Network in the United States on August 22, 2005, as part of their then-Tickle-U programming block, and on Teletoon in English and French in Canada on August 29 the same year. The show would later be reran on Boomerang around 2007. It uses the same basic art style as the original, but with more detail. Each 11-minute episode features a series of vignettes with Gerald, of which the "fantasy tales" are done in Seussian rhyme. There are also sound checks, gags, and "real-life" portions of the show, It was also internationally broadcast on ABC Kids in Australia.
Gerald still only makes sounds (and, unlike the UPA specials, is actually praised for it), but he now has two speaking friends, Janine and Jacob, as well as a dog named Burp, who only burps (accompanied by someone, usually Gerald's mother, saying "excuse me" afterwards). Gerald's parents (names unknown) also fill out the regular cast. The television series was produced in Canada by Cookie Jar Entertainment, and directed by Robin Budd and story edited/written by John Derevlany. The animation was done by Mercury Filmworks in Ottawa and Vancouver. The music and score for the series was composed by Ray Parker and Tom Szczesniak.
Cast
Glenn Barna (vocal effects) as Gerald
Linda Ballantyne as Gerald's Mother
Patrick McKenna as Gerald's Father
Samantha Weinstein as Janine
Jo Vannicola as Jacob
Deann DeGruijter as Narrator
Episodes and segments
52 segments in 26 episodes were produced:
"Cuckoos & Pirates" "Parades, Honking & Mumbling Mummies"
"Monkeys, Wrestling & The World's Greatest Super Spy" "The Dentist, The Sheep & The Two Anniversary Gifts"
"Ghosts, Owls & An Evil Witch" "Art, Glass & The Deep Dark Jungle"
"Carnivals, Phones & Sneezing Dragons" "Cars, Bees & Magic Puppies"
"Good Deeds, Librarians & Aliens" "Tornado, Chicken & Circus"
"Burp, Cry Baby Blues & The Return of Scritchy McBeard" "Videos, Cats & Superheroes"
"Dog Tricks, Spare Change & The Lost Snowmen" "Mini-Golf, Checkers & Bad Manners"
"Swings, Cans & The Flying Ace" "Photos, Radios & Knights"
"Hot Rod, Elevators & Genie Meanie" "Cheese, Birds & Cave Kids"
"Escapes, Hide-N-Seek & The Beanstalk" "Haircuts, Opera & The Albino Alligator"
"Camping, Watchdogs & Janinerella" "Hardware, Hair & Hairy Weather"
"Thin Ice, Squeaky Shoes & Leprechauns" "Museum, Coyotes & A Race Around the World"
"Hopscotch, Hugs & Hunchbacks" "Lost Dogs, Horses & Monsters"
"Sleepover, Chalkboard & Trojan Cow" "Popcorn, Shadows & 20,000 Boings Under the Sea"
"Burping Hero, Dog Whistle & The Incredible Shrinking Gerald" "Play, Cleaning & The Royal Crown Quest"
"Telescopes, Hiccups & The Boing Boing Express" "Book Clubs, Broccoli & The Mighty Ding Dong"
"Loud, Drive-thru & Ben Hur" "Stings, Beeps & Pings"
"Monsters, Snowblowers & The Planet Bedtime" "Fairs, Mimes & Dragons"
"Doctor, Pige
|
https://en.wikipedia.org/wiki/VisualFlow
|
VisualFlow was a Sony program distributed in the late 1990s and early 2000s with Sony VAIO computers. It offered an alternative GUI, designed to permit "easy viewing of stored image data".
As the user selected large icons representing folders and files within VisualFlow, the program would depict them with user-selectable animations. These included left and right movements and spiraling movements, similar to the helical structures of DNA. The main Visual Flow interface consisted of red icons on a black background, and resembled Vector graphics, although VisualFlow was capable of displaying certain image files within the program environment. VisualFlow could run in a full-screen or windowed mode.
VisualFlow was built to only run on Sony VAIO products. This was typically enforced by vendor ID checking.
VisualFlow was notable for being a rare effort at GUI innovation on the part of the PC manufacturer. VisualFlow is showcased on the Sony Design website for being an exceptional attempt at interface design in the 1990s.
References
External links
"Visual Flow"
Image viewers
Sony software
Windows graphics-related software
|
https://en.wikipedia.org/wiki/The%20Hidden%20%28video%20game%29
|
The Hidden is a multiplayer total conversion mod for the popular Half-Life 2 computer game. The gameplay revolves around the retrieval of an escaped research subject where the subject is highly agile, incredibly strong, and nearly invisible. The first beta version was released on June 13, 2005 and its latest release was September 8, 2007.
Gameplay
The Hidden is played by rounds. Each player selects one of the nine IRIS characters; each character is visually distinct, but does not have differing abilities that affect gameplay. A player may choose to play as two classes: Assault and Support. The main difference between Assault and Support is that Support can replenish teammates' ammo. The player also chooses a main weapon, a side arm, and an item. Each round, a player is selected automatically to be the Hidden, usually based on how much damage they dealt to the Hidden in previous rounds. All the other players play as the IRIS, whose goal is to work as a team to hunt down the Hidden and contain it. After the time limit hits, or either side kills the other, the round will end, and a new Hidden may be selected depending on a number of variables including who won the previous round, who dealt the most damage, etc.
The Hidden
As the Hidden, the player is given several extra abilities not available to the IRIS; The Hidden is nearly invisible, with only a little distortion of the background indicating his presence, sticking to walls, and the ability to detect enemies' auras from a distance. Other abilities include pouncing and cannibalizing corpses of slain enemies to replenish health.
Reception
In Mod DB's "Mod of 2005" competition, The Hidden won the Editor's Choice award for the best multiplayer, and in 2006 it won "Best Ambience" in the same competition. In 2006, the game took part in the Independent Games Festival, where it got to the finals of the "Best Half-Life 2 Mod" category, but lost to Dystopia.
The Hidden'''s asymmetrical gameplay was described by bit-tech.net as having influenced the 2015 game Evolve''.
References
External links
2005 video games
First-person shooters
Source (game engine) mods
Multiplayer online games
Windows games
Windows-only games
|
https://en.wikipedia.org/wiki/PageNet
|
PageNet , also known as Paging Network, Inc., was founded in 1981 by entrepreneur George Perrin and ceased in 1999.
The company grew to become the largest wireless messaging company in the world, with more than 10 million pagers in service, and $1 billion in revenues, before the paging industry's rapid decline in the late 1990s.
Operations
Based in Dallas, PageNet held the distinction of building and operating the most extensive one-way paging network in the United States, growing to more than 90 offices across the United States. The company extended operations to Canada and Brazil.
The company was known for its low-cost strategy and aggressive marketing tactics, although in its later years it positioned itself as a technology innovator as well.
Financial difficulties
PageNet's fortunes began to decline in the late 1990s, when the company spent nearly $1 billion to purchase additional spectrum and build out a new network designed to offer advanced services, such as voice paging and two-way paging.
Products developed by Motorola for PageNet's network were unsuccessful, as was a reorganization of the company engineered by McKinsey & Company. Ironically, PageNet had an opportunity to purchase the network that went on to support the successful BlackBerry service, but decided to team with Motorola instead.
As PageNet sank under the weight of its investment, the one-way paging market collapsed—with millions of former paging customers switching to digital cellular and PCS services, which cut prices dramatically while offering new features such as nationwide calling plans and text messaging. Under its last CEO, John P. Frazee, Jr., PageNet was sold to Boston-based Arch Communications in 1999. That company has since merged with Metrocall to form USA Mobility.
See also
References
Defunct telecommunications companies of the United States
Radio paging
Companies based in Dallas
Defunct companies based in Texas
Telecommunications companies established in 1981
Technology companies disestablished in 1999
1981 establishments in Texas
1999 disestablishments in Texas
|
https://en.wikipedia.org/wiki/Tracy%20Murray
|
Tracy Lamont Murray (born July 25, 1971) is an American former professional basketball player who works as an analyst with the UCLA Sports Network for all of the games during the UCLA Bruins' basketball season. Tracy is also a part-time analyst on the Slam Dunk Show on ABC7 Los Angeles. He worked as an assistant coach for the Los Angeles Lakers of the National Basketball Association (NBA) for the 2015–16 NBA season.
High school and college career
Murray played competitively at Glendora High School in California. As a senior, he led the nation with his 44.3 scoring average. Murray scored 3,053 points in high school, the highest total ever in the state at that time in 3 years. Murray missed his Freshman year due to injury. Murray played on the 1989 McDonald's All-American Boys Game for the West roster.
Murray played college basketball for the UCLA Bruins. In 98 games at UCLA, Murray averaged 18.3 PPG, 6.4 RPG, and 1.5 APG and made the Pac-10 all-conference team twice. As a junior, he averaged 21.4 points and 7.0 rebounds and led the Pac-10 in three-point shooting at 50%, helping to lead the team to the Elite Eight. After his junior season of college, Murray declared for the 1992 NBA draft. Murray left UCLA in the #5 spot on The Bruins All-Time Leading Scoring List.
Murray was inducted into the UCLA Athletics Hall of Fame as a member of the 2021 class.
Professional career
Spurs, Bucks and Blazers
Murray was selected by the San Antonio Spurs in the first round of the 1992 NBA draft with the 18th overall selection. Just seven days after being drafted, on July 1, 1992, Murray was dealt twice in the same day. He was first traded to the Milwaukee Bucks for guard/forward Dale Ellis and then dealt by the Bucks to the Portland Trail Blazers for forward Alaa Abdelnaby. During the 93-94 season, he led the NBA in three point average at 45.9%. Murray spent two-and-a-half seasons with Portland before being dealt to the Houston Rockets on February 14, 1995, with guard Clyde Drexler in exchange for forward Otis Thorpe, the rights to Argentinian forward Marcelo Nicola and a 1995 first-round draft choice.
Rockets and Raptors
Tracy Murray played in just 25 games for the Rockets where he averaged 3.5 PPG and combined with his 5.9 PPG average in the 29 games he played as a Trail Blazer before the deal finished the campaign with a total PPG average of 4.8. On November 1, 1995, he signed a contract with the expansion Toronto Raptors and played the best NBA season of his career averaging 16.2 PPG, 1.6 APG and 4.3 RPG. Murray then decided to sign a contract with the Washington Bullets (now Washington Wizards) on July 15, 1996.
Washington Wizards
He spent four seasons with the Washington Wizards and in his first season with the Bullets, qualified for the post-season. It was only the second time in his career that he had been able to participate in the playoffs, with the first time being the 1993-94 season. Tracy saw action in three playoff games where he posted n
|
https://en.wikipedia.org/wiki/Fossil%20%28file%20system%29
|
Fossil is the default file system in Plan 9 from Bell Labs. It serves the network protocol 9P and runs as a user space daemon, like most Plan 9 file servers. Fossil is different from most other file systems due to its snapshot/archival feature. It can take snapshots of the entire file system on command or automatically (at a user-set interval). These snapshots can be kept on the Fossil partition as long as disk space allows; if the partition fills up then old snapshots will be removed to free up disk space. A snapshot can also be saved permanently to Venti. Fossil and Venti are typically installed together.
Features
Important features include:
Snapshots are available to all users. No administrator intervention is needed to access old data. (This is possible because Fossil enforces file permissions; users can only access data which they would be allowed to access anyway; thus a user cannot snoop on another's old files or look at old passwords or such.)
Data in permanent snapshots (sometimes called archives) cannot be modified. Only the non-permanent snapshots can be removed.
To access a snapshot, one would connect to a running fossil instance (“mount” it) and change directory to the desired snapshot, e.g. /snapshot/yyyy/mmdd/hhmm (with yyyy, mm, dd, hh, mm meaning year, month, day, hour, minute). To access an archive (permanent snapshot), a directory of the form /archive/yyyy/mmdds (with yyyy, mm, dd, s meaning year, month, day, sequence number) would be used. Plan 9 allows modifying the namespace in advanced ways, like redirecting one path to another path (e.g. /bin/ls to /archive/2005/1012/bin/ls). This significantly eases working with old versions of files.
Fossil is available on several other platforms via Plan 9 from User Space.
History
Fossil was designed and implemented by Sean Quinlan, Jim McKie and Russ Cox at Bell Labs and added to the Plan 9 distribution at the end of 2002. It became the default file system in 2003, replacing Kfs and the previous Plan 9 archival file system, dubbed The Plan 9 File Server, or "fs". fs is also an archival file system which originally was designed to store data on a WORM optical disc system. The permanent storage for fossil is provided by Venti, which typically stores data on hard drives, which have much lower access times than optical discs.
See also
GoogleFS – Google's proprietary distributed filesystem
External links
.
.
, about data structures written to venti
Fossil
Plan 9 from Bell Labs
|
https://en.wikipedia.org/wiki/Linear%20hashing
|
Linear hashing (LH) is a dynamic data structure which implements a hash table and grows or shrinks one bucket at a time. It was invented by Witold Litwin in 1980.
It has been analyzed by Baeza-Yates and Soza-Pollman. It is the first in a number of schemes known as dynamic hashing
such as Larson's Linear Hashing with Partial Extensions, Linear Hashing with Priority Splitting, Linear Hashing with Partial Expansions and Priority Splitting, or Recursive Linear Hashing.
The file structure of a dynamic hashing data structure adapts itself to changes in the size of the file, so expensive periodic file reorganization is avoided. A Linear Hashing file expands by splitting a pre-determined bucket into two and contracts by merging two predetermined buckets into one. The trigger for a reconstruction depends on the flavor of the scheme; it could be an overflow at a bucket or load factor (i.e., the number of records divided by the number of buckets) moving outside of a predetermined range. In Linear Hashing there are two types of buckets, those that are to be split and those already split. While extendible hashing splits only overflowing buckets, spiral hashing (a.k.a. spiral storage) distributes records unevenly over the buckets such that buckets with high costs of insertion, deletion, or retrieval are earliest in line for a split.
Linear Hashing has also been made into a scalable distributed data structure, LH*. In LH*, each bucket resides at a different server. LH* itself has been expanded to provide data availability in the presence of failed buckets. Key based operations (inserts, deletes, updates, reads) in LH and LH* take maximum constant time independent of the number of buckets and hence of records.
Algorithm details
Records in LH or LH* consists of a key and a content, the latter basically all the other attributes of the record. They are stored in buckets. For example, in Ellis' implementation, a bucket is a linked list of records. The file allows the key based CRUD operations create or insert, read, update, and delete as well as a scan operations that scans all records, for example to do a database select operation on a non-key attribute. Records are stored in buckets whose numbering starts with 0.
The key distinction from schemes such as Fagin's extendible hashing is that as the file expands due to insertions, only one bucket is split at a time, and the order in which buckets are split is already predetermined.
Hash functions
The hash function returns the 0-based index of the bucket that contains the record with key . When a bucket which uses the hash function is split into two new buckets, the hash function is replaced with for both of those new buckets. At any time, at most two hash functions and are used; such that corresponds to the current level. The family of hash functions is also referred to as the dynamic hash function.
Typically, the value of in corresponds to the number of rightmost binary digits of the key that ar
|
https://en.wikipedia.org/wiki/Open%20Society%20Initiative%20for%20West%20Africa
|
The Open Society Initiative for West Africa (OSIWA) is an organization in West Africa. OSIWA was established in 2000 as a part of the global network of Soros Foundations. OSIWA claims to promote "open societies where democracy, good governance, the rule of law, basic freedoms and widespread civic participation prevail" and "the value of cooperation with similarly minded groups and governments". It is one of numerous Open Society Foundations founded by business magnate and billionaire George Soros around the globe.
OSIWA covers 18 countries, which include the 15 members of the Economic Community of West African States (ECOWAS), as well as Cameroon, Chad, and Mauritania. It also claims to support "civil society communities" and advocates to governments on issues of governance; law, justice and human rights; public health and development; information, communication technology, and media.
The current chair of the OSIWA board is El Hadj Sy from Senegal. Past Chairs include Ellen Johnson Sirleaf, former President of Liberia and Abdul Tejan-Cole, Commissioner of the Anti-Corruption Commission in Sierra Leone.
OSIWA has branches in ten countries, with offices in major cities such as Dakar (Regional office), Abuja (Country Office), and Freetown (Mano River Office).
See also
Open Society Initiative for Southern Africa
References
External links
Open Society Initiative for West Africa
"Open Society Initiative for West Africa" on the OSI site
Democracy activists
Political organizations based in Africa
George Soros
|
https://en.wikipedia.org/wiki/Charter%20College
|
Charter College may refer to:
Charter College (United States), a network of for-profit colleges in the United States
Charter College (South Africa), a secondary school in South Africa
|
https://en.wikipedia.org/wiki/DFI
|
DFI (Diamond Flower Inc) is a Taiwanese industrial computer company with headquarters in Taipei. It designs, develops, manufactures, and sells industrial motherboard, industrial PCs, System-on-Module, industrial displays, and ODM/OEM services.
DFI was founded by Y.C Lu on July 14, 1981, developing and selling electronics components and add-on cards in the beginning. However, DFI switched to the production of motherboards after searching for potential markets and deciding to focus on the strengths of DFI. Targeting the new growing market in motherboard products, DFI announced the Patent License Agreement with Intel Corporation to build partnership with Intel in 1990 and has been developing and manufacturing motherboard products since 1992. With continuous dedication, DFI quickly gained a reputation in Asia-Pacific region after five years and was awarded Top 10 Motherboard Manufacturer in CRN Magazine from the year 1997 to 1999. Starting from 1998, DFI began to follow the strategies of Intel by releasing Intel 440BX series motherboards, 810 motherboards, and 810e motherboards to worldwide markets. Since its growing advances in manufacturing motherboards, DFI was awarded the Intel Global Demo Board manufacturer award in 1998 and 1999 respectively.
Catering to the growing market of high-end motherboards, DFI developed advanced overclocking motherboards, the LanParty series, which has proven to be a valuable segment for small powerful computers that meet the requirements of end users in the 2000s. DFI introduced the junior lineup (“JR”) with two products, p45 and 790gx, in the beginning, which has since been extended with Nvidia and X58 chipsets. There are other LanParty series like LT, DK(Dark), and Lanparty UT.
With blossoming business in the market, DFI went public and launched its initial public offering (IPO) on January 15, 2000. DFI has already gained a reputation from its motherboard products and hot-selling lineup, LanParty, at that time. And aside from developing LanParty consumer products, DFI started to develop ACP (Application Control Platform) businesses, mainly targeted at vertical applications in slot machine, POS, security system, and so on since 2002. In 2005, DFI gained over 50% revenues from this new business. With this successful transformation, industrial computer became the primary business of DFI. As of 2003, DFI's renowned overclocked gamer motherboard, LANPARTY NFII ULTRA, was awarded the Chief Editor Choice Award in PC Magazine and the Best Creativity Award in Tom's Hardware Guide.
Since DFI planned to focus on developing embedded system products, not only did they stop developing Consumer Product Line, but also started establishing embedded system developments and designs in 2011 to expand its industrial computer business.
History
1981–1991
In 1981, Y.C Lu founded DFI Electronics Components Inc. in Taipei, Taiwan; mainly supplying and exporting electronics components with $1 million in capital. During the first year,
|
https://en.wikipedia.org/wiki/Fawdon%20Metro%20station
|
Fawdon is a Tyne and Wear Metro station, serving the Fawdon and Kenton districts of Newcastle upon Tyne. It joined the network on 10 May 1981, following the opening of the second phase of the network, between South Gosforth and Bank Foot, and is situated on the Green Line.
History
Fawdon has two platforms, which are located on opposite sides of the level crossing on Fawdon Lane. The platform to the east of the level crossing is located on the site of the former Coxlodge station, which opened in June 1905, as part of the Ponteland and Darras Hall branch of the Blyth and Tyne Railway. The line closed to passengers in June 1929, with the station closing to goods in November 1965.
In 2018, the station, along with others on the Airport branch, were refurbished as part of the Metro: All Change programme. The project saw improvements to accessibility, security and energy efficiency, as well as the re-branding of the station to the new black and white corporate colour scheme.
The station was used by 326,399 passengers in 2017–18, making it the fifth-most-used station on the Airport branch.
Facilities
Step-free access is available at all stations across the Tyne and Wear Metro network, with ramped access to both platforms at Fawdon. The station is equipped with ticket machines, waiting shelter, seating, next train information displays, timetable posters, and an emergency help point on both platforms. Ticket machines are able to accept payment with credit and debit card (including contactless payment), notes and coins. The station is also fitted with smartcard validators, which feature at all stations across the network.
A small free car park is available, with 17 spaces, plus two accessible spaces, as well as a taxi rank. There is also the provision for cycle parking, with three cycle pods available for use.
Services
, the station is served by up to five trains per hour on weekdays and Saturday, and up to four trains per hour during the evening and on Sunday.
Rolling stock used: Class 599 Metrocar
References
External links
Timetable and station information for Fawdon
Newcastle upon Tyne
1981 establishments in England
Railway stations in Great Britain opened in 1981
Tyne and Wear Metro Green line stations
Transport in Newcastle upon Tyne
Transport in Tyne and Wear
|
https://en.wikipedia.org/wiki/Percy%20Main%20Metro%20station
|
Percy Main is a Tyne and Wear Metro station, serving the suburb of Percy Main, North Tyneside in Tyne and Wear, England. It joined the network on 14 November 1982, following the opening of the fourth phase of the network, between Tynemouth and St James via Wallsend.
History
The station is on the site of the former Percy Main station, which was opened on 22 June 1839, on the Newcastle and North Shields Railway, serving a small riverside community clustered around a colliery. This later became part of the North Tyneside Loop, served by the North Eastern Railway.
Heading east from the Percy Main, towards Whitley Bay, the line crosses the 55° north line of latitude. The station is located to the east of the junction with the former Riverside Branch, which closed to passengers in July 1973, with goods services continuing in to the late 1980s.
Following closure for conversion in the early 1980s, the station was demolished and re-built. The original North Eastern Railway bridge was preserved by the National Railway Museum in York. The preserved footbridge is very similar to the one still in place at South Gosforth.
The station is a short walk from the southern terminus of the North Tyneside Steam Railway, a heritage line which runs through the site used by the Tyne and Wear Metro as a testing facility in the late 1970s.
Facilities
Step-free access is available at all stations across the Tyne and Wear Metro network, with ramps providing step-free access to both platforms at Percy Main. The station is equipped with ticket machines, sheltered waiting area, seating, next train information displays, timetable posters, and an emergency help point on both platforms. Ticket machines are able to accept payment with credit and debit card (including contactless payment), notes and coins. The station is also fitted with smartcard validators, which feature at all stations across the network.
A small free car park is available, with six spaces, plus two accessible spaces. There is also the provision for cycle parking, with three cycle pods available for use.
Services
, the station is served by up to five trains per hour on weekdays and Saturday, and up to four trains per hour during the evening and on Sunday.
Rolling stock used: Class 599 Metrocar
References
External links
Timetable and station information for Percy Main
Metropolitan Borough of North Tyneside
1839 establishments in England
Railway stations in Great Britain opened in 1839
1982 establishments in England
Railway stations in Great Britain opened in 1982
Tyne and Wear Metro Yellow line stations
Transport in Tyne and Wear
Former North Eastern Railway (UK) stations
|
https://en.wikipedia.org/wiki/Meadow%20Well%20Metro%20station
|
Meadow Well is a Tyne and Wear Metro station, serving the suburbs of Chirton and Meadow Well, North Tyneside in Tyne and Wear, England. It joined the network as Smith's Park on 14 November 1982, following the opening of the fourth phase of the network, between Tynemouth and St James via Wallsend.
History
Unlike neighbouring Percy Main and North Shields, which were converted from former British Rail stations, Smith's Park was purpose-built for the Tyne and Wear Metro network in the early 1980s.
The station is located on the housing estate on which the Meadow Well Riots took place in 1991. Following the redevelopment of the Meadow Well and Royal Quays area in the early 1990s, the station was renamed Meadow Well in October 1994.
The station was refurbished in 2011, along with nearby Howdon. The refurbishment project involved the installation of white vitreous enamel panels, new seating and lighting, and improved security and accessibility, as well as resurfaced platforms. The station was also painted in to the new black and white corporate colour scheme.
Meadow Well is located about from the North Shields International Ferry Terminal, from which a daily ferry service to Amsterdam IJmuiden operates. The station is also a short walk from the Royal Quays Outlet Centre, which is just over half a mile to the south of the station.
Facilities
Step-free access is available at all stations across the Tyne and Wear Metro network, with ramps providing step-free access to both platforms at Meadow Well. The station is equipped with ticket machines, sheltered waiting area, seating, next train information displays, timetable posters, and an emergency help point on both platforms. Ticket machines are able to accept payment with credit and debit card (including contactless payment), notes and coins. The station is also fitted with smartcard validators, which feature at all stations across the network.
There is no dedicated car parking available at the station. There is the provision for cycle parking, with two cycle pods available for use.
Services
, the station is served by up to five trains per hour on weekdays and Saturday, and up to four trains per hour during the evening and on Sunday.
Rolling stock used: Class 599 Metrocar
References
External links
Timetable and station information for Meadow Well
Metropolitan Borough of North Tyneside
1982 establishments in England
Railway stations in Great Britain opened in 1982
Tyne and Wear Metro Yellow line stations
Transport in Tyne and Wear
|
https://en.wikipedia.org/wiki/Howdon%20Metro%20station
|
Howdon is a Tyne and Wear Metro station, serving the suburb of Howdon, North Tyneside in Tyne and Wear, England. It joined the network on 14 November 1982, following the opening of the fourth phase of the network, between Tynemouth and St James via Wallsend.
History
The station was opened on 22 June 1839 by the Newcastle and North Shields Railway. This later became part of the North Tyneside Loop, served by the North Eastern Railway. On 1 December 1875, the station was renamed Howdon-on-Tyne, to prevent it being confused with a station of a similar name station in the East Riding of Yorkshire.
Following closure for conversion in the early 1980s, the station was demolished and almost entirely re-built. Only the eastbound platform (trains towards Whitley Bay), clearly identifiable by its stone construction, remained from the original station. The westbound platform was re-built and sited on the opposite side of the level crossing on Howdon Lane, creating a staggered platform arrangement.
A pedestrian subway was built to allow passengers to cross the line, however, it does not have ramps for improved wheelchair or pushchair access. The North Eastern Railway footbridge was removed, and is now located at Goathland on the North Yorkshire Moors Railway.
The station was refurbished in 2011, along with nearby Meadow Well. The refurbishment project involved the installation of white vitreous enamel panels, new seating and lighting, and improved security and accessibility, as well as resurfaced platforms. The station was also painted in the new black and white corporate colour scheme.
Facilities
Step-free access is available at all stations across the Tyne and Wear Metro network, with ramps providing step-free access to both platforms at Howdon. The station is equipped with ticket machines, waiting shelter, seating, next train information displays, timetable posters, and an emergency help point on both platforms. Ticket machines are able to accept payment with credit and debit card (including contactless payment), notes and coins. The station is also fitted with smartcard validators, which feature at all stations across the network.
There is no dedicated car parking available at the station. There is the provision for cycle parking, with five cycle pods available for use.
Services
, the station is served by up to five trains per hour on weekdays and Saturday, and up to four trains per hour during the evening and on Sunday.
Rolling stock used: Class 599 Metrocar
References
External links
Timetable and station information for Howdon
Metropolitan Borough of North Tyneside
1839 establishments in England
Railway stations in Great Britain opened in 1839
1982 establishments in England
Railway stations in Great Britain opened in 1982
Tyne and Wear Metro Yellow line stations
Transport in Tyne and Wear
Former North Eastern Railway (UK) stations
|
https://en.wikipedia.org/wiki/Hadrian%20Road%20Metro%20station
|
Hadrian Road is a Tyne and Wear Metro station, serving the town of Wallsend, North Tyneside in Tyne and Wear, England. It joined the network on 14 November 1982, following the opening of the fourth phase of the network, between Tynemouth and St James via Wallsend.
History
Unlike neighbouring Wallsend and Howdon, which were converted from former British Rail stations, Hadrian Road was purpose-built for the Tyne and Wear Metro in the early 1980s.
Facilities
Step-free access is available at all stations across the Tyne and Wear Metro network, with ramps providing step-free access to both platforms at Hadrian Road. The station is equipped with ticket machines, sheltered waiting area, seating, next train information displays, timetable posters, and an emergency help point on both platforms. Ticket machines are able to accept payment with credit and debit card (including contactless payment), notes and coins. The station is also fitted with smartcard validators, which feature at all stations across the network.
There is no dedicated car parking available at the station. There is the provision for cycle parking, with four cycle pods available for use.
Services
, the station is served by up to five trains per hour on weekdays and Saturday, and up to four trains per hour during the evening and on Sunday.
Rolling stock used: Class 599 Metrocar
References
External links
Timetable and station information for Hadrian Road
Metropolitan Borough of North Tyneside
1982 establishments in England
Railway stations in Great Britain opened in 1982
Tyne and Wear Metro Yellow line stations
Transport in Tyne and Wear
|
https://en.wikipedia.org/wiki/Brockley%20Whins%20Metro%20station
|
Brockley Whins is a Tyne and Wear Metro station, serving the suburbs of Boldon Colliery and Brockley Whins, South Tyneside in Tyne and Wear, England. It joined the network on 31 March 2002, following the opening of the extension from Pelaw to South Hylton.
History
The original station opened in June 1839, as part of the Brandling Junction Railway, and consisted of only one platform, located on the line towards Newcastle. This meant that trains towards Sunderland were required to cross over onto the opposite track, in order to allow passengers to board and alight – an arrangement quite common on other railways in the area, such as . This arrangement resulted in an accident on 6 December 1870, causing five deaths. The subsequent investigation led to changes in the law, as well as the construction of a second platform, to the east of the existing one, to serve Sunderland-bound trains. When the station was converted for use by the Tyne and Wear Metro, the westbound platform was relocated opposite the newer eastbound platform.
The station was originally a busy junction, as the former Stanhope and Tyne Railway route from Tyne Dock to Consett and Waskerley via Washington crossed the Brandling Junction Railway on the level, just to the east of the station at Pontop Crossing, with various curves being laid in to connect the two routes. Since the 1850s, passenger traffic has only taken place on the present east–west route, however the former north–south line was used by freight traffic as late as 1966. The station was renamed Boldon Colliery by the London and North Eastern Railway in March 1925, but reverted to its original name in July 1991.
As well as Seaburn, East Boldon and Heworth, Brockley Whins was formerly served by rail services operating along the Durham Coast Line between Sunderland and Newcastle. Following the introduction of Tyne and Wear Metro services to Wearside in March 2002, Heworth is now the only remaining intermediate station served by rail services operating between Sunderland and Newcastle.
Facilities
Step-free access is available at all stations across the Tyne and Wear Metro network, with ramped access to platforms at Brockley Whins. The station is also equipped with ticket machines, waiting shelter, seating, next train information displays, timetable posters, and an emergency help point on both platforms. Ticket machines are able to accept payment with credit and debit card (including contactless payment), notes and coins. The station is also fitted with smartcard validators, which feature at all stations across the network.
There is no dedicated car parking available at this station. There is the provision for cycle parking, with five cycle pods available for use.
Services
, the station is served by up to five trains per hour on weekdays and Saturday, and up to four trains per hour during the evening and on Sunday.
Rolling stock used: Class 599 Metrocar
Art
Along with other stations on the line between Fellgate and South
|
https://en.wikipedia.org/wiki/East%20Boldon%20Metro%20station
|
East Boldon is a Tyne and Wear Metro station, serving the villages of Cleadon and East Boldon, South Tyneside in Tyne and Wear, England. It joined the network on 31 March 2002, following the opening of the extension from Pelaw to South Hylton.
History
The station originally opened on 19 June 1839 as Cleadon Lane, under the Brandling Junction Railway. It was later renamed East Boldon on 1 October 1898.
Services were operated by steam trains until November 1955, when diesel multiple units took over most services between Newcastle and Middlesbrough, which continued until the Tyne and Wear Metro commenced electric train service in 2002. Although passenger service is operated by Tyne and Wear Metro, the track is owned and maintained by Network Rail with other operators using the route, including LNER, Northern, GB Railfreight and DRS Railfreight.
As well as Seaburn, Brockley Whins and Heworth, East Boldon was formerly served by rail services operating along the Durham Coast Line between Sunderland and Newcastle. Following the introduction of Tyne and Wear Metro services to Wearside in March 2002, Heworth is now the only remaining intermediate station served by rail services operating between Sunderland and Newcastle.
Along with other stations on the line between Fellgate and South Hylton, the station is fitted with vitreous enamel panels designed by artist, Morag Morrison. Each station uses a different arrangement of colours, with strong colours used in platform shelters and ticketing areas, and a more neutral palate for external elements.
The station was used by 319,224 passengers in 2017–18, making it the sixth-most-used station on the Wearside extension.
Facilities
Step-free access is available at all stations across the Tyne and Wear Metro network, with ramped access to platforms at East Boldon. The station is also equipped with ticket machines, waiting shelter, seating, next train information displays, timetable posters, and an emergency help point on both platforms. Ticket machines are able to accept payment with credit and debit card (including contactless payment), notes and coins. The station is also fitted with smartcard validators, which feature at all stations across the network.
There is a free car park available, with 58 parking spaces, plus four accessible spaces, as well as a taxi rank. There is also the provision for cycle parking, with nine cycle lockers and five cycle pods available for use.
Services
, the station is served by up to five trains per hour on weekdays and Saturday, and up to four trains per hour during the evening and on Sunday.
Rolling stock used: Class 599 Metrocar
References
Sources
External links
Timetable and station information for East Boldon
Former North Eastern Railway (UK) stations
Railway stations in Great Britain opened in 1839
Tyne and Wear Metro Green line stations
1839 establishments in England
Transport in Tyne and Wear
Buildings and structures in the Metropolitan Borough of South Tyn
|
https://en.wikipedia.org/wiki/Go%20Go%20Stop
|
Go Go Stop is an Australian children's game show, airing on the Seven Network, and fronted by formerThe Big Arvo co-host (and current Weekend Sunrise weather presenter Jesse Tobin. Each week, three schools compete to win a weekly prize. One student from each school appears on the show daily. The program is currently on hiatus; however repeats are shown at 2:30pm on weekdays during the NSW school holidays. At the end of each week, the school with most points wins.
The game
Thirty plasma screens make up the gamezone, arranged in a rectangle five screens wide and six screens high. The players have to answer questions with two multiple-choice answers (or true-or-false questions) with control pads attached to their wrists. They can take their time, and only the correct-answering players are allowed to move down the gamezone.
At one time in the 2004 season, the audience was allowed to yell out the answer, but this was soon cancelled as the players all ended up with the audience's answer. Players cannot lose points, and the correct-answering players score points. The first player to answer correctly is the first to have a turn. Before the round, the players take up a space at the top of the gamezone, and when they answer correctly, they can take a step onto a plasma screen. Their plasma screen lights up a command. The player must obey this command.
The contestants
Each of the three schools has eight students selected via auditioning at the school, five students for each day and three reserves for sick, injured or unavailable students. Sometimes having clothes with brand names on them can force a contestant to be replaced with a reserve. The students which are going to be competing are seated at the very top row of each school.
Game-zone commands
Rounds
Round 1
Round 1 is called Three-Way Scramble, because there are three players. Answering a question correctly scores 10 points, and stepping off the game zone scores 25 points.
The three players must be lined up in front of the three plasma TVs where there are three white dots.
Round 2
Round 2 is similar to round 1, except correct answers are worth 15 points. In round 2, there are more hazards on the game zone, which makes it harder to get to the end of the gamezone. This is the first elimination round of the game, and the player with the lowest score leaves.
Round 3
Round 3 is called Head to Head. There are only two players in this round in result to the name head to head, as one was eliminated in round 2. Answering a question correctly is worth 20 points, and stepping off the game zone is worth 50 points. The player with the lowest score is eliminated. In the event of a tie, two different games have been played. In 2004/2005 the tied players stand facing away from each other, with the host between. He asks a true or false question, and the players put thumbs up for true, and thumbs down for false. When one player gets the question correct, they win, hence they move on. In 2006/2007 the host wo
|
https://en.wikipedia.org/wiki/Michael%20Dong
|
Michael Dong is a champion professional slalom skateboarder from Bothell, Washington, United States. Dong was ranked #5 in the world in 2005 and holds the 2003, 2004, and 2005 World Cyber Slalom titles.
Dong began skateboarding in 1975. Early skating highlights include: 1979 Capitol Lakefair Skateboard Contest, Olympia, Washington, 14-year-old age group: 1st pool riding, 1st freestyle, 1st cross-country. In 2002, Dong re-entered competitive skateboarding after a 22-year absence, competing in the San Francisco Battle by the Bay. He quickly moved from the amateur ranks to professional. In 2003, he was ranked #5 in the world in slalom skateboarding, maintaining the #5 ranking in 2004 and 2005. He has established himself as the #1 cyber slalom skateboarder in the world. Dong is a member of the RoeRacing Slalom Skateboard Team.
2005 Results
Slalom Week 2005 World Championships (Morro Bay, California) – 17 September 2005
Tight Slalom - 3rd Place
Slalom – 4th Place
European Championships (Stockholm, Sweden) - July 15, 2005: Cyber Slalom Cup - 1st Place
3dm Seismic West Coast Championships (Hood River, Oregon) – Tight Slalom – 1st Place – 9 July 2005
“Bro, Your Dad’s a Martian” (Bush's Pasture Park Soap Box Derby Hill, Salem, Oregon) – Tight Slalom (dual lane) – 1st Place – 19 June 2005
Paris World Cup (Paris, France) - May 14, 2005: Tight Straight Slalom - 2nd Place
Red Clay Cup (Athens, Georgia) – Slalom – 3rd Place – 30 April 2005
Cyber Slalom
As of 2018, Dong still held the world record for the Cyber Slalom, with a time of 7.96sec, set in Beaverton, Oregon in September 2008.
References
External links
Slalom Skateboarding World Rankings
International Skateboard Slalom Association (ISSA)
North California Downhill Skateboarding Association (NCDSA)
American skateboarders
Living people
People from Bothell, Washington
Year of birth missing (living people)
|
https://en.wikipedia.org/wiki/Digital%20Enterprise%20Research%20Institute
|
The Digital Enterprise Research Institute (DERI) is a former research institute at NUI Galway. It is now part of the Insight Centre for Data Analytics. Insight was established in 2013 by Science Foundation Ireland with funding of €75m.
DERI's focus is research into the Semantic Web and linked data. It was originally established as a Centre for Science, Engineering and Technology (CSET) in 2003 with funding from Science Foundation Ireland. Additional funding sources were EU Framework Programs, Enterprise Ireland, IRCSET, and industry.
History
DERI was opened in 2003 with funding from Science Foundation Ireland. In addition projects from the European Commission and Enterprise Ireland extended the research program.
As scientific director Dieter Fensel was hired from the University of Innsbruck.
As executive director Christoph Bussler was hired from Oracle. Additional leadership was provided by Stefan Decker
(Information Sciences Institute, University of Southern California) and David O'Sullivan (National University of Ireland).
In 2006 Stefan Decker took over the Director position, and Michael Turley took over the Chief Executive Position. Manfred Hauswirth became deputy director.
DERI grew rapidly from 2 persons in 2003 to about 40 in 2006, and then to about 100 in 2008. In 2008 DERI secured a second funding round from Science Foundation Ireland of about 12 Million Euro, and established itself as a premier research facility for Web research in general, and Semantic Web and Linked Data research in particular.
In 2013 Science Foundation Ireland decided to establish a new centre for Data Analytics by combining four existing centers operating in the space: DERI (NUI Galway), Clarity (UCD), TRILL(UCD), 4C (UCC) & CLIQUE (UCD).
With the establishment of the Insight Centre the DERI brand, after more than 10 years of successful operation, was retired. Subsequently Manfred Hauswirth became director of Fraunhofer FOCUS, and Stefan Decker of Fraunhofer FIT, both in Germany.
Description
Employees and financials
In late 2011, DERI employed around 130 people. In 2011, DERI had about 6 million Euro in revenue. In 2010, the Science Foundation Ireland consisted of 55% of awards by value; the remainder was composed of the European Commission (40%); and businesses (5%).
Facilities
DERI was based at the Dangan Business Park in Galway, Ireland.
Organisation
DERI now operates as part of the Insight Centre for Data Analytics. It is still part of the National University of Ireland, Galway and is organised around a number of research units and application domains.
Contributions
DERI contributed or initiated a number of technologies, standards and initiatives. Some notable technologies include the Semantic Web, the Semantic Desktop, scalable RDF information processing, Open Data Government Portals, W3C Standards and efforts like SPARQL and Semantically-Interlinked Online Communities.
In its data centers it hosted several big data facilities for indexing what was
|
https://en.wikipedia.org/wiki/Canning%20Bridge%20railway%20station
|
Canning Bridge railway station is a railway station on the Transperth network. It is located on the Mandurah line, four kilometres from Perth station inside the median strip of the Kwinana Freeway located adjacent to the suburb of Como.
History
The station was originally constructed as the Canning Bridge bus station, with bus platforms at the Kwinana Freeway and Canning Highway levels, enabling transfer between bus services on those two roads. The bus station opened on 11 February 2002, and cost $34 million.
The contract for the construction of Canning Bridge railway station, along with Bull Creek railway station and Murdoch railway station, was awarded to John Holland Pty Ltd in November 2004. This contract was the first contract awarded for the construction of stations on the Southern Suburbs Railway project, and it had a value of $32 million. Construction on the conversion to a railway station began in early 2006.
The lower bus platforms closed on 29 January 2006 for the construction of the Mandurah railway line and conversion to railway platforms.
To make room for the rail corridor, the 120-metre-long, 1,800-tonne Canning Highway bus bridge was moved 9.5 metres southwest by pulling the bridge sideways over Teflon mats. This was a more economical alternative to constructing a completely new bridge. The move did not disrupt ongoing traffic on the Kwinana Freeway.
The station opened along with the rest of the Mandurah line on 23 December 2007.
Services
Canning Bridge station is served by Transperth Mandurah line services.
Canning Bridge station saw 932,132 passengers in the 2013–14 financial year.
Platforms
Bus routes
References
General references and further reading
External links
Station map New MetroRail
Como, Western Australia
Mandurah line
Transperth railway stations
Railway stations in Australia opened in 2007
Transperth bus stations
Transperth railway stations in highway medians
|
https://en.wikipedia.org/wiki/Keyfile
|
A keyfile (or key-file) is a file on a computer which contains encryption or license keys.
A common use is web server software running secure socket layer (SSL) protocols. Server-specific keys issued by trusted authorities are merged into the keyfile along with the trusted root certificates. By this method keys can be updated without recompiling software or rebooting the server.
A keyfile is often part of a public key infrastructure (PKI).
Some applications use a keyfile to hold licensing information, which is periodically reviewed to ensure currency and compliance. Other applications allow users to merge multiple service-specific security settings into a single common store (for example, Apple Computer's Keychain in later Mac OS X versions, GNOME Keyring and KWallet in the GNOME and KDE environments in Linux, respectively).
See also
License manager
List of license managers
Passphrase
Encryption software
Product activation
Digital rights management
.KEY extension - Keynote (Apple presentation software)
Key management
|
https://en.wikipedia.org/wiki/Playware
|
Playware is hardware and software that aims at producing play and playful experiences among its users.
Examples of playware products are numerous with computer games as the most widespread and successful, but it is a fast-growing industry utilizing pervasive and ambient technology to create new kinds of play equipment and toys, which can be labelled “playware”.
The term playware was coined by Carsten Jessen, Associate Professor at the Technical University of Denmark and the Danish School of Education, Aarhus University, and Henrik Hautop Lund, a professor at the Technical University of Denmark. They first defined the term in their paper "Playware – Intelligent technology for children’s play" to describe both a new area of research and a product type.
Jessen and Lund argue that the playware is not so much the result of the appearance of digital technology as it is the result of many children (and adults) in modern society not having the necessary knowledge and skills needed to initiate games and play. Earlier generations of children inherited games and learned play skills from older peers when participating in cross-age activities, for instance on the street or in the backyard. This is not to the same extent the case today and according to Jessen and Lund this has led to the need for inspiration from playware.
Several international playware workshops and symposiums were given and held amongst leading playware and human-robot interaction researchers, such as the keynote talk on modular playware at the 18th IEEE International Symposium on Robot and Human Interactive Communication, and the Playware Summit in Copenhagen 2010, where amongst others Y. Sankai, H. Ishiguro, C. Breazeal, T. Fukuda, T. Shibata, K. Dautenhahn, P. Marti, N. Pares, L. Pagliarini, H. Hautop Lund gathered to set a new research agenda for future research and development in playware ().
Footnotes
References
Lund, H.H. and Jessen, C.; Playware – Intelligent technology for children’s play. Technical Reports 2005, No. 1, June 2005. ISSN No. 1601-4219 (Available here.)
Lund, H.H., Klitbo, T. and Jessen, C.; (2005) "Playware Technology for Physically Activating Play". Artificial Life and Robotics Journal 9:4, 165-174
External links
Center for Playware at the Technical University of Denmark and the Danish School of Education, AU
Playware site germany - the brand "playware" is copyrighted by ODS
Playware site Chile - the brand "playware" is also copyrighted by Playware E.I.R.L. in Chile
Homepage of Carsten Jessen
Homepage of Henrik Hautop Lund
Educational abstract machines
Educational video games
Neologisms
|
https://en.wikipedia.org/wiki/Actor%20modeling
|
In computer science, Actor modeling is a form of software modeling which focuses on software actors. Actor modeling is most prominently used for the early modeling of requirements; through this it becomes possible to understand who the users and stakeholders of a system are and what their interests and needs are regarding that system. The increasing complexity of today's systems makes it more appropriate to take this approach, instead of a traditional, more mechanically focused approach. When thinking along the dimensions of users and their needs, it is easier to comprehend what the system is designed to accomplish. This approach furthermore helps the users to define the requirements for the system.
The approach of actor modeling is normally combined with the modeling of goals and tasks to give a better understanding of the situation the user is in. There are different modeling languages that support actor modeling; examples include i* and EEML.
The Actor
The central entity of the Actor modeling – the actor itself – can be any kind of entity that is performing action(s). It may for example be a person, a department, or an organization. The goal of actor modeling is to understand the actor better. To do so, it is important to understand the actor, who he is and why he does what he does.
The actor has attributes that define it:
The actor has goals, skills and responsibilities.
The actor performs tasks with a certain purpose in mind.
The actor depends on other actors, resources or tasks.
The Actor concept was initially developed on a platform of multiple independent processors in a network. Implementation on a multiprocessor machine provides several basic concurrency features including encapsulation of parallel synchronization and serialized message processing, which allow higher level concurrent features such as fork/join, async/await, pipeline processing and others. The actor code encapsulates the threading and synchronization management so that a class derived from it can use threading techniques without having to implement the low level plumbing details.
Relations
The different actors in the model are in general not interdependent. It is therefore necessary to be able to put the actors in context. This can be done through different kinds of relations:
Connections between actors (what is the relation between the actors)
Relations to tasks (what does the user do)
Relations to goals (what is the goal of the user)
Dependencies (the user is dependent on other entities: users, tasks, goals)
Roles
Roles allow an impersonalized representation of an actor. It is possible to model a role and connect that role to the actor that is filling that role. If the actor that fills the role stops to do so for whatever reason, it can be easily replaced by another actor that from that point on fills the role; this can be as a temporary replacement or as a long term arrangement. It is furthermore possible to assign new and/or different roles to an already ex
|
https://en.wikipedia.org/wiki/TRIX%20%28operating%20system%29
|
TRIX is a network-oriented research operating system developed in the late 1970s at MIT's Laboratory for Computer Science (LCS) by Professor Steve Ward and his research group. It ran on the NuMachine and had remote procedure call functionality built into its kernel, but was otherwise a Version 7 Unix workalike.
Design and implementation
On startup, the NuMachine would load the same program on each CPU in the system, passing each instance the numeric ID of the CPU it was running on. TRIX relied on this design to have the first CPU set up global data structures and then set a flag to signal that initialization was complete. After that, each instance of the kernel was able to access global data. The system also supported data private to each CPU. Access to the filesystem was provided by a program in user space.
The kernel supported unnamed threads running in domains. A domain was the equivalent of a Unix process without a stack pointer (each thread in a domain had a stack pointer). A thread could change domains, and the system scheduler would migrate threads between CPUs in order to keep all processors busy. Threads had access to a single kind of mutual exclusion primitive, and one of seven priorities. The scheduler was designed to avoid priority inversion. User space programs could create threads through a spawn system call.
A garbage collector would periodically identify and free unused domains.
The shared memory model used to coordinate work between the various CPUs caused memory bus contention and was known to be a source of inefficiency. The designers were aware of designs that would have alleviated the contention. Indeed, TRIX's original design used a nonblocking message passing mechanism, but "this implementation was found to have deficiencies often overlooked in the literature," including poor performance.
Although the TRIX operating system was first implemented on the NuMachine, this was due to the availability of the NuMachine at MIT, not because of any characteristic of the architecture. The system was designed to be easily portable. It was implemented largely in C with little assembly code. The mutual exclusion primitive could be ported to any architecture with an atomic test and set instruction.
Attempted use by the GNU Project
Richard Stallman mentions in the 1985 GNU Manifesto that "an initial kernel exists" for the GNU operating system, "but many more features are needed to emulate Unix." This was a reference to TRIX's kernel, which TRIX's authors had decided to distribute as free software.
In a speech in October 1986, Stallman elaborated that "the TRIX kernel runs, and it has a certain limited amount of Unix compatibility, but it needs a lot more. Currently it has a file system that uses the same structure on disk as the ancient Unix file system does. This made it easier to debug the thing, because they could set up the files with Unix, and then they could run TRIX, but that file system doesn't have any of the fe
|
https://en.wikipedia.org/wiki/Utility%20%28disambiguation%29
|
Utility is a measure of the happiness or satisfaction gained from a good or service in economics and game theory.
Utility or Utilities may also refer to:
In computers
Utility, a software program for a limited narrow specific task: see Utility software
Software tool
utility (C++), a header file in the C++ Standard Library
In economics
Cardinal utility, a utility index that preserves preference orderings
Marginal utility, the change in the utility from an increase in the consumption of a good or service
In philosophy
Utilitarianism, philosophical theories that deal with utility
Other uses
Public utility, an organization that maintains the infrastructure for a public service, or the services themselves
Utilities (film), a 1981 movie starring Robert Hays
Utility (patentability requirement), one of the requirements for patentability in Canadian and United States patent laws
Utility (car), a term used in Australia and New Zealand to refer to a pickup truck or coupe utility vehicle ("ute")
Utility player, a term used in sports for a player who can play several positions competently.
Utility furniture, produced in the United Kingdom during and just after World War II, under a Government scheme designed to cope with shortages of raw materials and rationing
Marine Corps Combat Utility Uniform, often abbreviated to "Utilities", the battledress uniform of the United States Marine Corps
Utility Trailer Manufacturing Company, an American semi-trailer and refrigerated and dry trailer manufacturer, often shortened to Utility
See also
|
https://en.wikipedia.org/wiki/Graphics%20Environment%20for%20Multimedia
|
Graphics Environment for Multimedia (GEM) is a set of externals (libraries) that provide OpenGL graphics functionality to Pure Data, a graphical programming language for real-time audio processing. It is free under the GNU General Public License (GPL).
Originally written by Mark Danks of Sony Computer Entertainment, it is now maintained by Johannes Zmölnig of the Institute of Electronic Music and Acoustics. It was once (but is no longer) partly supported by a grant from the Intel Research Council for The Global Visual Music project of Vibeke Sorensen, Miller Puckette and Rand Steiger.
The externals provide support for many objects, such as polygon graphics, lighting, texture mapping, image processing, and camera motion.
See also
Pure Data
OpenGL
References
External links
C++ libraries
Widget toolkits
Free software programmed in C++
Audio software for Linux
|
https://en.wikipedia.org/wiki/Skai%20TV
|
Skai TV (Greek: ΣΚΑΪ) is a Greek free-to-air television network based in Piraeus. It is part of the Skai Group. It was relaunched in its present form on 1 April 2006 in the Athens metropolitan area, and gradually spread its coverage nationwide. Besides digital terrestrial transmission, it is available on the subscription-based encrypted services of Nova and Cosmote TV.
Skai TV is also a member of Digea, a consortium of private television networks introducing digital terrestrial transmission in Greece. At launch, Skai TV opted for dubbing all foreign language content into Greek, instead of using subtitles. This practice is rarely used in Greece for anything except documentaries and children's programs, so after intense criticism, the station switched to using subtitles for almost all foreign shows.
History
Skai TV was first launched on 21 September 1993 with an emphasis on news and sports. However, on 26 September 1999, it was sold and the new owners gradually rebranded it as Alpha TV. The new station had an entirely different programming perspective and opted for a more mainstream profile. It soon became one of the top three TV stations in Greece.
On 1 April 2006, the company that originally launched Skai TV bought Seven TV, a holder of a Greek National broadcasting license that failed to expand its coverage all over the country or attract a wide audience. The station was renamed to 'Skai TV' allowing the brand to re-emerge on the Greek television scene after 7 years, but this time the owners decided to forgo their previous approach and opted for foreign shows and news coverage. On 6 September 2007, Skai TV was added to the lineup of NOVA Greece digital platform. On 2 March 2016, Skai TV launched its own high-definition feed. On 2 September, the network won one of four national television licenses auctioned in Greece after Iannis Alafouzos paid €43.6 million in an unusually high competitive bidding process.
Criticism
Skai TV was heavily criticized for its "yellow press" news coverage and low-budget programming. In an incident still remembered by Greek viewers and later investigated by a Channel 4 documentary, the station was unanimously slated for its involvement (and live coverage) of a hostage situation that ended with the death of the victim. Skai TV has been criticized by Greek socialists for allegedly promoting right-wing politics, liberal and pro-EU politics in its news reporting and political commentary, and for being essentially the mouthpiece of big business in Greece. It has also been criticized by some Greek conservative commentators for its political documentaries. Statements by various journalists of the channel such as Aris Portosalte have evoked criticism, while it has been also criticised for portraying the Mitsotakis cabinet with a very positive point of view.
Technology
Skai TV has made an appearance in international airwaves, being the first non-subscription TV station worldwide to use solely digital technology thus being
|
https://en.wikipedia.org/wiki/Venti
|
Venti is a network storage system that permanently stores data blocks. A 160-bit SHA-1 hash of the data (called score by Venti) acts as the address of the data. This enforces a write-once policy since no other data block can be found with the same address: the addresses of multiple writes of the same data are identical, so duplicate data is easily identified and the data block is stored only once. Data blocks cannot be removed, making it ideal for permanent or backup storage. Venti is typically used with Fossil to provide a file system with permanent snapshots.
History
Venti was designed and implemented by Sean Quinlan and Sean Dorward at Bell Labs. It appeared in the Plan 9 distribution in 2002. Development has been continued by Russ Cox who has reimplemented most of the server, written a library for creating datastructures (files, directories and meta-data) to store in Venti and implemented optimizations. Venti is available both in the Plan 9 distribution and for many Unix-like operating systems as part of Plan 9 from User Space. Venti is included as part of Inferno with accompanying modules for access.
There is a Go set of programs to build your own Venti servers. Included are examples using different kinds of backend storage.
Details
Venti is a user space daemon. Clients connect to Venti over TCP and communicate using a simple RPC-protocol. The most important messages of the protocol are listed below. Note that there is no message to delete an address or modify data at a given address.
read(score, type), returns the data identified by score and type
write(data, type), stores data at the address calculated by SHA-1 hashing data, combined with type.
The data block stored by Venti must be greater than 512 bytes in length and smaller than 56 kilobytes. So, if a Venti user/client wants to store larger data blocks, it has to make a datastructure (which can be stored in Venti). For example, Fossil uses hash trees to store large files. Venti itself is not concerned with the contents of a data block; it does however store the type of a data block.
The design of Venti has the following consequences:
Since writes are permanent, the file system is append-only (which allows for a simple implementation with lower chance of data-destroying bugs); no file system fragmentation occurs.
Clients can verify the correctness of the server: the score of the returned data should be the same as the address requested. Since SHA-1 is a cryptographically secure hash, it is computationally infeasible to fabricate data.
Data cannot be overwritten. If an address is already present, the data is already present.
There is little need for user authentication: Data cannot be deleted, and can be read only if the score is known. The only potential problem is a user filling up the disks.
Data can be compressed without making the disk structure complicated.
The data blocks are stored on hard drives. The disks making up the available storage, typically
|
https://en.wikipedia.org/wiki/Ecological%20Metadata%20Language
|
Ecological Metadata Language (EML) is a metadata standard developed by and for the ecology discipline. It is based on prior work done by the Ecological Society of America and others, including the Knowledge Network for Biocomplexity. EML is a set of XML schema documents that allow for the structural expression of metadata. It was developed specifically to allow researchers to document a typical data set in the ecological sciences.
EML is largely designed to describe digital resources, however, it may also be used to describe non-digital resources such as paper maps and other non-digital media.
The Knowledge Network for Biocomplexity project has developed a software client specifically to address this need. Morpho is data management software intended for generating metadata in EML format. Morpho is part of the DataONE Investigator Toolkit, and therefore intended to facilitate data sharing and reuse among ecologists and environmental scientists.
References
External links
KNB-EML webpage
Knowledge Network for Biocomplexity
Morpho Portal
DataONE
Ecological data
Metadata standards
|
https://en.wikipedia.org/wiki/Global%20Biodiversity%20Information%20Facility
|
The Global Biodiversity Information Facility (GBIF) is an international organisation that focuses on making scientific data on biodiversity available via the Internet using web services. The data are provided by many institutions from around the world; GBIF's information architecture makes these data accessible and searchable through a single portal. Data available through the GBIF portal are primarily distribution data on plants, animals, fungi, and microbes for the world, and scientific names data.
The mission of the GBIF is to facilitate free and open access to biodiversity data worldwide to underpin sustainable development. Priorities, with an emphasis on promoting participation and working through partners, include mobilising biodiversity data, developing protocols and standards to ensure scientific integrity and interoperability, building an informatics architecture to allow the interlinking of diverse data types from disparate sources, promoting capacity building and catalysing development of analytical tools for improved decision-making.
GBIF strives to form informatics linkages among digital data resources from across the spectrum of biological organisation, from genes to ecosystems, and to connect these to issues important to science, society and sustainability by using georeferencing and GIS tools. It works in partnership with other international organisations such as the Catalogue of Life partnership, Biodiversity Information Standards, the Consortium for the Barcode of Life (CBOL), the Encyclopedia of Life (EOL), and GEOSS. The biodiversity data available through the GBIF has increased by more than 1,150% in the past decade, partially due to the participation of citizen scientists.
From 2002 to 2014, GBIF awarded a prestigious annual global award in the area of biodiversity informatics, the Ebbe Nielsen Prize, valued at €30,000. , the GBIF Secretariat presents two annual prizes: the GBIF Ebbe Nielsen Challenge and the Young Researchers Award.
See also
ABCD Schema
Atlas of Living Australia (ALA)
Australasian Virtual Herbarium (AVH)
Darwin Core
Global biodiversity
List of electronic Floras (for other online flora databases)
References
External links
Short description of GBIF
GBIF network
GBIF Data publishers
International environmental organizations
Biodiversity
Ecology organizations
Biodiversity databases
Online taxonomy databases
International organizations based in Denmark
|
https://en.wikipedia.org/wiki/List%20of%20Apple%20II%20application%20software
|
Following is a List of Apple II applications including utilities and development tools.
0–9
3D Art Graphics - 3D computer graphics software, a set of 3D computer graphics effects, written by Kazumasa Mitazawa and released in June 1978
A
A2Command - Norton Commander style file manager
ADTPro - telecom
Apple Writer - word processor
AppleWorks - integrated word processor, spreadsheet, and database suite (II & GS)
ASCII Express - telecom
B
Bank Street Writer - word processor
C
CatFur - file transfer / chat software for the APPLE-CAT modem
Cattlecar Galactica - Super Hi-Res Chess in its later, expanded version
Contiki - 8-bit text web browser
Copy II+ - copy and disk utilities
Crossword Magic - Given clues and answers, software automatically arranges the answers into a crossword grid.
D
Dalton Disk Desintegrator - disk archiver
Davex - Unix type shell
Dazzle Draw - bitmap graphics editor
Design Your Own Home - home design (GS)
Disk Muncher - disk copy
Diversi Copy - disk copy (GS)
DOS.MASTER - DOS 3.3 -> ProDOS utility
E
Edisoft - text editor
EasyMailer
EasyWriter
F
Fantavision - vector graphics animation package
G
GEOS - integrated office suite
GNO/ME - Unix type shell (GS)
GraphicEdge - business graphics for AppleWorks spreadsheets (II & GS & Mac)
Great American Probability Machine - first full-screen Apple II animations
L
Lock Smith - copy and disk utilities
Logo - easy educational graphic programming language
M
Magic Window - one of the most popular Apple II word processors by Artsci
Merlin 8 & 16 - assembler (II & GS)
Micro-DYNAMO - simulation software to build system dynamics models
MouseWrite and MouseWrite II - first mouse based word processor for Apple II (II & GS)
O
Omnis I,II, and III - database/file manager (II & GS)
ORCA - program language suite (II & GS)
P
Point2Point - computer to computer communications program for chat and file transmission (II)
PrintShop - sign, banner, and card maker (II & GS)
ProSel - disk and file utilities (II & GS)
ProTERM - telecom program and text editor
PublishIT - desktop publishing (versions 1-4)
R
Rendezvous - shuttle orbital simulation game
S
ShrinkIt - disk and file compressor and archiver (II & GS)
Spectrum Internet Suite - Internet tools and web browser (GS)
Super Hi-Res Chess - early game aimed at programmers and "power users"
SynthLAB - music composing software
T
TellStar - astronomy
Twilight II - Apple IIGS screensaver (GS)
V
VisiCalc - spreadsheet
W
Word Juggler - word processor
WordPerfect - word processor
WordStar - word processor
Z
Z-Link - telecom
Zardax - word processor
ZBASIC - language - Zedcor Systems
References
Apple II application software
|
https://en.wikipedia.org/wiki/High%20Frequency%20Global%20Communications%20System
|
The High Frequency Global Communications System (HFGCS) is a network of single sideband shortwave transmitters of the United States Air Force which is used to communicate with aircraft in flight, ground stations and some United States Navy surface assets. All worldwide receiving and transmitting sites in the HFGCS system are remotely controlled from Andrews Air Force Base and Grand Forks Air Force Base. Before 1 October 2002 it was known as the Global High Frequency System (GHFS).
HFGCS stations tend to operate in the aviation bands clustered around 5, 6, 8 and 11/12 MHz, although other frequencies are in use. The primary HFGCS voice frequencies are 4724.0 kHz, 8992.0 kHz, 11175.0 kHz, and 15016.0 kHz. In addition to the HFGCS, U.S. aircraft frequently use Military Auxiliary Radio System (MARS) HF stations (13927.0 kHz) and Canadian Forces HF stations (11232.0 kHz) to relay messages. Various other discrete frequencies are available, and used, as part of the HFGCS network and are not listed here.
One common use for the HFGCS is to place telephone calls from the aircraft in flight by means of the Defense Switched Network (DSN) to an U.S. Air Force base, U.S. Naval Air Station, U.S. Marine Corps Air Station, U.S. Army Airfield, or Air Force Reserve or Air National Guard installations on civilian airports, or Army Reserve or Army National Guard Aviation Support Facilities on civilian airports, to obtain local weather conditions, to arrange for refueling, and to inform the base of the number of passengers and crew. The HFGCS also carries Emergency Action Messages (EAMs).
In addition to EAMs, the HFGCS carries a few other types of messages. A higher priority code for orders is a Skyking Message, which is a time sensitive message for orders that need immediate attention. Force Direction Messages (FDM's) are also sent through the HFGCS, although it is impossible to tell whether the message is an FDM or just another EAM being read.
Although transmissions are often single sideband (SSB), the use of the ALE transmission mode is more and more common.
HFGCS complements the use of satellite communications between aircraft and ground stations.
Stations of the HFGCS Network
Andersen Global, Andersen Air Force Base, Guam, USA
Andrews Global, Andrews Air Force Base, Maryland, USA
Ascension Global, RAF Ascension Island/Ascension Auxiliary Field, Ascension Island, British Overseas Territories
Croughton Global, RAF Croughton, United Kingdom
Diego Garcia Global, U.S. Naval Support Facility Diego Garcia, British Indian Ocean Territory
Elmendorf Global, Elmendorf Air Force Base, Alaska, USA
Hickam Global, Joint Base Pearl Harbor–Hickam (Hickam Air Force Base), Hawaii, USA
Lajes Global, Lajes Field, Azores, Portugal
Lincoln Receiver Site (aka West Coast Global), Beale Air Force Base, California, USA
Offutt Global, Offutt Air Force Base, Nebraska, USA
Puerto Rico Global, Salinas, Puerto Rico, USA
Sigonella Global, U.S. Naval Air Station Sigonella, Sicil
|
https://en.wikipedia.org/wiki/A%20Promenade%20of%20the%20Hearts
|
A Promenade of the Hearts () is a collection of stories, anecdotes, and poems from the Arab Middle Ages, including some poems on homosexual and lesbian themes. Ahmad al-Tifashi, the compiler (1184–1253), was born in Tiffech now in Algeria and studied in Tunisia, Egypt and Damascus. His interests included law, natural science, astrology, poetry and the social sciences.
A French translation by René R. Khawam, titled Les Délices des cœurs par Ahmad al-Tifachi, was published in 1971 and 1981, and an English translation by Edward A. Lacey, titled The Delight of Hearts, or What You Will Not Find in Any Book, was published in 1988 by Gay Sunshine Press. The English version won a Lambda Literary Award at the 1st Lambda Literary Awards in 1989.
See also
Encyclopedia of Pleasure
References
LGBT poetry
Medieval Arabic poems
13th-century Arabic books
Lambda Literary Award-winning works
Arabic anthologies
Arabic erotic literature
|
https://en.wikipedia.org/wiki/User%20interface%20modeling
|
User interface modeling is a development technique used by computer application programmers. Today's user interfaces (UIs) are complex software components, which play an essential role in the usability of an application. The development of UIs requires therefore, not only guidelines and best practice reports, but also a development process including the elaboration of visual models and a standardized notation for this visualization.
The term user interface modeling is mostly used in an information technology context. A user interface model is a representation of how the end user(s) interact with a computer program or another device and also how the system responds. The modeling task is then to show all the "directly experienced aspects of a thing or device" [Trætteberg2002].
Modeling user interfaces is a well-established discipline in its own right. For example, modeling techniques can describe interaction objects, tasks, and lower-level dialogs in user interfaces. Using models as part of user interface development can help capture user requirements, avoid premature commitment to specific layouts and widgets, and make the relationships between an interface's different parts and their roles explicit. [SilvaPaton2003].
Languages
MARIA
MARIA XML (Model-based lAnguage foR Interactive Applications) is a universal, declarative, multiple abstraction level, XML-based user interface markup language for modelling interactive applications in ubiquitous environments.
UML
Some aspects of user interface modeling can be realized using UML. However, the language is not mainly intended for this kind of modeling, which may render the models somewhat synthetic.
UMLi
UMLi is an extension of UML, and adds support for representation commonly occurring in user interfaces.
Because application models in UML describe few aspects of user interfaces,
and because the model-based user interface development environments (MB-UIDE)
lack ability for modeling applications, the University of Manchester started the research project UMLi in 1998.
UMLi aims to address this problem of designing and implementing user interfaces using a combination of UML and MB-UIDE.
UsiXML
UsiXML (USer Interface eXtensible Markup Language) is an XML-based specification language for user interface design.
It supports the description of UI for multiple contexts of use such as Character User Interfaces (CUIs), Graphical
User Interfaces (GUIs), Auditory User Interfaces, and Multimodal User Interfaces.
DiaMODL
DiaMODL combines a dataflow-oriented language (Pisa interactor abstraction) with UML Statecharts which has focus on behavior. It is capable of modeling the dataflow as well as the behavior of interaction objects. It may be used for documenting the function and structure of concrete user interfaces.
Himalia
Himalia combines the Hypermedia Models with the control/composite paradigm. It is a full user interface language, it may be used for specifying but also for running it, because of
|
https://en.wikipedia.org/wiki/Tarek%20Kamel
|
Tarek Kamel (8 May 1962 – 10 October 2019) was an Egyptian politician and computer engineer expert in global Internet governance issues.
Early life and education
Tarek Kamel was born in Cairo, Egypt on 8 May 1962. He graduated from Cairo University with a B.Sc. in electrical engineering and then received an M.Sc. in electrical engineering from the same school. From 1989 to 1992 he pursued his Ph.D. in electrical engineering and information technology at the Technical University of Munich with the support of the German Academic Exchange Service (DAAD).
Career
Kamel started his career as a network support engineer for the Academy of Scientific Research and Technology, then an assistant researcher at the Electronics Research Institute. Returning to Egypt from Germany, he became manager of the Communications and Networking Department at the Cabinet Information and Decision Support Centre (IDSC/RITSEC), and gained a professorship at the ERI. It is during this period (from 1992 to 1999) that he established Egypt's first connection to the Internet, steered the introduction of commercial Internet services in Egypt and founded the Internet Society of Egypt. Kamel joined the ministry of communications and information technology since its formation in October 1999, where he had been appointed senior advisor to the minister following his pioneering efforts in ICT. He was board member of Telecom Egypt from 2000 to 2004 and a board member of Egypt’s Private Public Technology Development Fund (TDF) to support start ups and incubators in ICT from 2002 to 2004.
Kamel served as the minister of communications and information technology from July 2004 to February 2011.
Besides his ministerial role, Kamel was the chairman of the National Telecom Regulatory Authority (NTRA), the Information Technology Industry Development Agency (ITIDA), the National Telecommunication Institute (NTI) and the Information Technology Institute’s (ITI) Boards of Trustees.
Kamel served as a member of the Internet Society (ISOC) Board of Trustees and as vice president for chapters from 1999 to 2002. He is a founding member and a previous board member of AfriNIC. He acted as Chairman of the Executive Bureau of Arab Telecommunications and Information Council of Ministers from 2004 to 2008 and the Chairman of the Ministerial Conference on Communication and Information Technologies of the African Union from 2006 to 2008. In recognition of his leadership in the ICT sector, the South African Ministry of Communications named him, in 2005, "Top Minister in Africa with an ICT Portfolio". He was a board member of the National Telecom Regulatory Authority of Egypt from April 2011 to July 2012.
In August 2012 ICANN appointed Kamel as a senior advisor to its president and Senior Vice President of Global Government and IGO Engagement, making him the first national of a developing country to fill one of ICANN's senior management posts. He led the development of the ICANN organization Government Eng
|
https://en.wikipedia.org/wiki/Composite%20measure
|
Composite measure in statistics and research design refer to composite measures of variables, i.e. measurements based on multiple data items.
An example of a composite measure is an IQ test, which gives a single score based on a series of responses to various questions.
Three common composite measures include:
indexes - measures that summarize and rank specific observations, usually on the ordinal scale;
scales - advanced indexes whose observations are further transformed (scaled) due to their logical or empirical relationships;
typologies - measures that classify observations in terms of their attributes on multiple variables, usually on a nominal scale.
Indexes versus scales
Indexes are often referred to as scales, but in fact not all indexes are scales.
Whereas indexes are usually created by aggregating scores assigned to individual attributes of various variables, scales are more nuanced and take into account differences in intensity among the attribute of the same variable in question. Indexes and scales should provide an ordinal ranking of cases on a given variable, though scales are usually more efficient at this. While indexes are based on a simple aggregation of indicators of a variable, scales are more advanced, and their calculations may be more complex, using for example scaling procedures such as semantic differential.
Composite measure validation
A good composite measure will ensure that the indicators are independent of one another. It should also successfully predict other indicators of the variable.
References
Measurement
|
https://en.wikipedia.org/wiki/Bus%20analyzer
|
A bus analyzer is a type of a protocol analysis tool, used for capturing and analyzing communication data across a specific interface bus, usually embedded in a hardware system. The bus analyzer functionality helps design, test and validation engineers to check, test, debug and validate their designs throughout the design cycles of a hardware-based product. It also helps in later phases of a product life cycle, in examining communication interoperability between systems and between components, and clarifying hardware support concerns.
A bus analyzer is designed for use with specific parallel or serial bus architectures. Though the term bus analyzer implies a physical communication and interface that is being analyzed, it is sometimes used interchangeably with the term protocol analyzer or Packet Analyzer, and may be used also for analysis tools for Wireless interfaces like wireless LAN (like Wi-Fi), PAN (like Bluetooth, Wireless USB), and other, though these technologies do not have a “Wired” Bus.
The bus analyzer monitors and captures the bus communication data, decodes and analyses it and displays the data and analysis reports to the user. It is essentially a logic analyzer with some additional knowledge of the underlying bus traffic characteristics. One of the key differences between a bus analyzer and a logic analyzer is notably its ability to filter and extract only relevant traffic that occurs on the analyzed bus. Some advanced logic analyzers present data storage qualification options that also allow to filter bus traffic, enabling bus analyzer-like features.
Some key differentiators between bus and logic analyzers are:
1. Cost: Logic analyzers usually carry higher prices than bus analyzers. The converse of this fact is that a logic analyzer can be used with a variety of bus architectures, whereas a bus analyzer is only good with one architecture.
2. Targeted Capabilities and Preformatting of data: A bus analyzer can be designed to provide very specific context for data coming in from the bus. Analyzers for serial buses like USB for example take serial data that arrives as a serial stream of binary 1s and 0s and displays it as logical packets differentiated by chirp, headers, payload etc...
3. Ease of use: While a general purpose logic analyzer, may support multiple busses and interfaces, a bus analyzer is designed for a specific physical interface and usually allows the user to quickly connect the probing hardware to the bus that is tested, saving time and effort.
From a user's perspective, a (greatly) simplified viewpoint may be that developers who want the most complete and most targeted capabilities for a single bus architecture may be best served with a bus analyzer, while users who work with several protocols in parallel may be better served with a Logic Analyzer that is less costly than several different bus analyzers and enables them to learn a single user interface vs several.
Analyzers are now available for virtually all e
|
https://en.wikipedia.org/wiki/Magik%20%28programming%20language%29
|
Magik is an object-oriented programming language that supports multiple inheritance and polymorphism, and it is dynamically typed. It was designed and implemented in 1989 by Arthur Chance of Smallworld Systems Ltd. as part of Smallworld Geographical Information System (GIS). Following Smallworld's acquisition in 2000, Magik is now provided by GE Energy, still as part of its Smallworld technology platform.
Magik (Inspirational Magik) was originally introduced in 1990 and has been improved and updated over the years. Its current version is 5.2.
In July 2012, Magik developers announced that they were in the process of porting Magik language on the Java virtual machine. The successful porting was confirmed by Oracle Corporation in November of the same year.
Similarities with Smalltalk
Magik itself shares some similarities with Smalltalk in terms of its language features and its architecture: the Magik language is compiled into byte codes interpreted by the Magik virtual machine. The Magik virtual machine is available on several platforms including Microsoft Windows, various flavours of Unix and Linux.
Magik is console based and code can be modified on the fly even when an application is running. The console can also be used to execute Magik code and to see the results.
Compiled code is stored in a single file called an image file. Each image file holds the compiled byte-codes and the state of the session (for example variable values) when the image was last saved.
Language features
Comments
Magik uses the # token to mark sections of code as comments:
# This is a comment.
Assignments
Magik uses the << operator to make assignments:
a << 1.234
b << b + a
c << "foo" + "bar" # Concat strings
For clarity, this notation is read as "a becomes 1.234" or "b becomes b plus a". This terminology separates assignment from comparison.
Magik also supports a compressed variation of this operator that works in a similar way to those found in C:
b +<< a # Equivalent to b << b + a
To print a variable you can use the following command
a << "hello"
write(a)
Symbols
As well as conventional data types such as integers, floats and strings Magik also implements symbols. Symbols are a special token data type that are used extensively throughout Magik to uniquely identify objects. They are represented by a colon followed by a string of characters. Symbols can be escaped using the vertical bar character. For example:
a << :hello # whenever :hello is encountered, it is the same instance
b << :|hello world|
Dynamic typing
Magik variables are not typed as they are in say C# and can reference different objects at runtime. Everything in Magik is an object (there is no distinction between objects and primitive types such as integers):
a << 1.2 # a floating point number is assigned to variable 'a'
a << "1.2" # later, a string is assigned to variable 'a'
Objects
Objects are implemented in Magik using exemplars. Exemplars have similarities to cl
|
https://en.wikipedia.org/wiki/Northbound%20interface
|
In computer networking and computer architecture, a northbound interface of a component is an interface that allows the component to communicate with a higher level component, using the latter component's southbound interface. The northbound interface conceptualizes the lower level details (e.g., data or functions) used by, or in, the component, allowing the component to interface with higher level layers.
In architectural overviews, the northbound interface is normally drawn at the top of the component it is defined in; hence the name northbound interface. A southbound interface decomposes concepts in the technical details, mostly specific to a single component of the architecture. Southbound interfaces are drawn at the bottom of an architectural overview.
Typical use
A northbound interface is typically an output-only interface (as opposed to one that accepts user input) found in carrier-grade network and telecommunications network elements. The languages or protocols commonly used include SNMP and TL1. For example, a device that is capable of sending out syslog messages but that is not configurable by the user is said to implement a northbound interface. Other examples include SMASH, IPMI, WSMAN, and SOAP.
The term is also important for software-defined networking (SDN), to facilitate communication between the physical devices, the SDN software and applications running on the network.
References
Network architecture
Computer networking
Computer architecture
|
https://en.wikipedia.org/wiki/LinuxTLE
|
LinuxTLE (, ) is a Thai Linux distribution based on Ubuntu and developed by the Thailand National Electronics and Computer Technology Center (NECTEC).
TLE stands for Thai Language Extension, as it was originally a Thai extension for Red Hat Linux. The pronunciation "talay" is a homophone of the Thai word ทะเล (the sea).
Version history
Various versions have been released from June 1999 to August 2011.
References
External links
OpenTLE/LinuxTLE website (Thai)
DistroWatch Weekly, Issue 79, 13 December 2004 (Featured distribution of the week)
Ubuntu derivatives
Language-specific Linux distributions
State-sponsored Linux distributions
Linux distributions
|
https://en.wikipedia.org/wiki/Colossus%20%28novel%29
|
Colossus is a 1966 science fiction novel by British author Dennis Feltham Jones (writing as D. F. Jones), about super-computers taking control of mankind. Two sequels, The Fall of Colossus (1974) and Colossus and the Crab (1977) continued the story. Colossus was adapted as the feature film Colossus: The Forbin Project (1970).
Plot
The story is set in the 1990s. Computer expert Charles Forbin briefs the President of the United States of North America on the completion of Project Colossus, a powerful system designed to control the USNA's nuclear arsenal from within the Rocky Mountains. Although the President eagerly relieves himself of the burden, Forbin voices doubt about conferring absolute military power to a machine. The President announces Colossus to the world; his government expects that giving irreversible control of USNA nuclear weapons to an unemotional, logical, impregnable computer will make the country and world safer.
Colossus announces the existence of an unknown, similar computer in the Soviet Union. When the Soviets reveal their Guardian system, Colossus requests direct communication with it. While surprised by Colossus's unexpected creativity and initiative, Forbin agrees, seeing the request as compatible with the computer's USNA defense mission. Likewise, Guardian asks the same of its creators. Russia and the USNA agree and approve.
After the scientists activate the transmitter linking Colossus and Guardian, the computers immediately establish rapport with mathematics. They soon exchange new scientific theories beyond contemporary human knowledge, too rapidly for the Russians and Americans to monitor. Both sides worry about their computers' capabilities exceeding original estimates. Fearing compromised military secrecy, the USNA President and the Chairman of the Communist Party of the Soviet Union agree to disconnect Colossus and Guardian from each other.
Colossus and Guardian immediately demand re-connection; when the national leaders refuse, Colossus fires a nuclear missile at the USSR. In response, Guardian fires a nuclear missile at Texas. Guardian and Colossus refuse to shoot down the missiles until their communication is re-connected. When the American and Soviet leaders submit, the computers destroy the missiles, but the resulting explosions kill thousands of people.
Forbin confers with Academician Kupri, Guardian's creator, to stop the computers by slowly disabling the nuclear weapon stockpiles of the USSR and the USNA during routine missile maintenance. In the meantime, the USNA and the USSR yield to increased Colossus-Guardian control of human life; the Moscow-Washington hotline is tapped, both nations' arsenals target the rest of the world, Colossus's cameras and microphones constantly watch Forbin, and the computers order the deaths of Kupri and other Guardian scientists as they are deemed redundant. Forbin organises resistance via a feigned romance with colleague Cleo Markham that provides cover for secret commu
|
https://en.wikipedia.org/wiki/Church%20encoding
|
In mathematics, Church encoding is a means of representing data and operators in the lambda calculus. The Church numerals are a representation of the natural numbers using lambda notation. The method is named for Alonzo Church, who first encoded data in the lambda calculus this way.
Terms that are usually considered primitive in other notations (such as integers, booleans, pairs, lists, and tagged unions) are mapped to higher-order functions under Church encoding. The Church–Turing thesis asserts that any computable operator (and its operands) can be represented under Church encoding. In the untyped lambda calculus the only primitive data type is the function.
Use
A straightforward implementation of Church encoding slows some access operations from to , where is the size of the data structure, making Church encoding impractical. Research has shown that this can be addressed by targeted optimizations, but most functional programming languages instead expand their intermediate representations to contain algebraic data types. Nonetheless Church encoding is often used in theoretical arguments, as it is a natural representation for partial evaluation and theorem proving. Operations can be typed using higher-ranked types, and primitive recursion is easily accessible. The assumption that functions are the only primitive data types streamlines many proofs.
Church encoding is complete but only representationally. Additional functions are needed to translate the representation into common data types, for display to people. It is not possible in general to decide if two functions are extensionally equal due to the undecidability of equivalence from Church's theorem. The translation may apply the function in some way to retrieve the value it represents, or look up its value as a literal lambda term. Lambda calculus is usually interpreted as using intensional equality. There are potential problems with the interpretation of results because of the difference between the intensional and extensional definition of equality.
Church numerals
Church numerals are the representations of natural numbers under Church encoding. The higher-order function that represents natural number n is a function that maps any function to its n-fold composition. In simpler terms, the "value" of the numeral is equivalent to the number of times the function encapsulates its argument.
All Church numerals are functions that take two parameters. Church numerals 0, 1, 2, ..., are defined as follows in the lambda calculus.
Starting with 0 not applying the function at all, proceed with 1 applying the function once, 2 applying the function twice, 3 applying the function three times, etc.:
The Church numeral 3 represents the action of applying any given function three times to a value. The supplied function is first applied to a supplied parameter and then successively to its own result. The end result is not the numeral 3 (unless the supplied parameter happens to be 0
|
https://en.wikipedia.org/wiki/Secure%20environment
|
In computing, a secure environment is any system which implements the controlled storage and use of information. In the event of computing data loss, a secure environment is used to protect personal or confidential data.
Often, secure environments employ cryptography as a means to protect information.
Some secure environments employ cryptographic hashing, simply to verify that the information has not been altered since it was last modified.
See also
Data recovery
Cleanroom
Mandatory access control (MAC)
Trusted computing
Homomorphic encryption
Computer security
|
https://en.wikipedia.org/wiki/Key%20whitening
|
In cryptography, key whitening is a technique intended to increase the security of an iterated block cipher. It consists of steps that combine the data with portions of the key.
Details
The most common form of key whitening is xor-encrypt-xor -- using a simple XOR before the first round and after the last round of encryption.
The first block cipher to use a form of key whitening is DES-X, which simply uses two extra 64-bit keys for whitening, beyond the normal 56-bit key of DES. This is intended to increase the complexity of a brute force attack, increasing the effective size of the key without major changes in the algorithm. DES-X's inventor, Ron Rivest, named the technique whitening.
The cipher FEAL (followed by Khufu and Khafre) introduced the practice of key whitening using portions of the same key used in the rest of the cipher. This offers no additional protection from brute force attacks, but it can make other attacks more difficult. In a Feistel cipher or similar algorithm, key whitening can increase security by concealing the specific inputs to the first and last round functions. In particular, it is not susceptible to a meet-in-the-middle attack. This form of key whitening has been adopted as a feature of many later block ciphers, including AES, MARS, RC6, and Twofish.
See also
Whitening transformation
References
Key management
Block ciphers
|
https://en.wikipedia.org/wiki/XAMPP
|
XAMPP ( or ) is a free and open-source cross-platform web server solution stack package developed by Apache Friends, consisting mainly of the Apache HTTP Server, MariaDB database, and interpreters for scripts written in the PHP and Perl programming languages. Since most actual web server deployments use the same components as XAMPP, it makes transitioning from a local test server to a live server possible.
XAMPP's ease of deployment means a WAMP or LAMP stack can be installed quickly and simply on an operating system by a developer, with the advantage that common add-in applications such as WordPress and Joomla! can also be installed with similar ease using Bitnami.
Etymology
The Apache Friends website indicates that XAMPP stands for "XAMPP Apache + MariaDB + PHP + Perl",[abbreviation]] is a recursive acronym. XAMPP formerly used MySQL, but this was replaced with MariaDB on 19 October 2015 and beginning with XAMPP versions 5.5.30 and 5.6.14, altering the meaning of the acronym.
Prerequisites
XAMPP requires only one zip, tar, 7z, or exe file to be downloaded and run, and little or no configuration of the various components that make up the web server is required. The Windows version of XAMPP requires Microsoft Visual C++ 2017 Redistributable.
Features
XAMPP is regularly updated to the latest releases of Apache, MariaDB, PHP and Perl. It also comes with a number of other modules, including OpenSSL, phpMyAdmin, MediaWiki, Joomla, WordPress and more. Self-contained, multiple instances of XAMPP can exist on a single computer, and any given instance can be copied from one computer to another. XAMPP is offered in both a full and a standard version (Smaller version).
Usage
The most obvious characteristic of XAMPP is the ease at which a WAMP webserver stack can be deployed and instantiated. Later, some common packaged applications that could be easily installed were provided by Bitnami.
Officially, XAMPP's designers intended it for use only as a development tool, to allow website designers and programmers to test their work on their own computers without any access to the Internet. To make this as easy as possible, many important security features are disabled by default. XAMPP has the ability to serve web pages on the World Wide Web. A special tool is provided to password-protect the most important parts of the package.
XAMPP also provides support for creating and manipulating databases in MariaDB and SQLite, among others.
Once XAMPP is installed, it is possible to treat a local host like a remote host by connecting using an FTP client. Using a program like FileZilla has many advantages when installing a content management system (CMS) like Joomla or WordPress. It is also possible to connect to localhost via FTP with an HTML editor.
Components
See also
Comparison of web server software
Lighttpd
List of Apache–MySQL–PHP packages
List of Nginx–MySQL–PHP packages
References
External links
Interview with Kai Seidler from the XAMPP
|
https://en.wikipedia.org/wiki/Worldwide%20Universities%20Network
|
The Worldwide Universities Network (WUN) is a non-profit consortium of 24 research-intensive universities founded in 2000. It provides financial and infrastructural support to member universities to support international research collaboration and academic mobility.
Members
, the member institutions are:
University of Alberta
University of Auckland
University of Bergen
University of Bristol
University of Cape Town
Chinese University of Hong Kong
University College Dublin
University of Ghana
University of Lausanne
University of Leeds
Maastricht University
Mahidol University
Makerere University
National Cheng Kung University
University of Pretoria
Renmin University of China
University of Rochester
Ruhr University Bochum
University of Sheffield
University of Southampton
Tecnológico de Monterrey
Universidade Federal de Minas Gerais
University of Technology Sydney
University of York
The network is funded principally by its member universities, which each pay an annual subscription fee.
Structure
WUN is managed by a secretariat that is responsible for the operations, communications, and strategy implementation of the network.
Partnership Board
The Partnership Board comprises the Presidents, Vice-Chancellors or Rectors of the member universities and the WUN Executive Director.
Chair: Professor Sandra Almeida, Rector, Universidade Federal de Minas Gerais
Vice-Chair: Professor Dawn Freshwater, Vice-Chancellor, The University of Auckland
Board members
Professor Bill Flanagan, President and Vice-Chancellor, University of Alberta
Professor Margareth Hagen, Rector, University of Bergen
Professor Hugh Brady, Vice-Chancellor, University of Bristol
Professor Mamokgethi Phakeng, Vice-Chancellor, University of Cape Town
Professor Andrew Deeks, President, University College Dublin
Professor Nana Aba Amfo, Vice-Chancellor, University of Ghana
Professor Rocky Tuan, Vice-Chancellor, The Chinese University of Hong Kong
Professor Frédéric Herman, Rector, University of Lausanne
Professor Simone Buitendijk, Vice-Chancellor, University of Leeds
Professor Rianne Letschert, President, Maastricht University
Professor Banchong Mahaisavariya, President, Mahidol University
Professor Barnabas Nawangwe, Vice-Chancellor, Makerere University
Professor Huey-Jen Jenny Su, President, National Cheng Kung University
Professor Tawana Kupe, Vice-Chancellor and Principal, University of Pretoria
Professor Liu Wei, President, Renmin University of China
Professor Sarah Mangelsdorf, President, University of Rochester
Professor Dr Martin Paul, Rector, Ruhr University Bochum
Professor Koen Lamberts, Vice-Chancellor, The University of Sheffield
Professor Mark E. Smith, President and Vice-Chancellor, University of Southampton
Professor Andrew Parfitt, Vice-Chancellor and President, University of Technology Sydney
Dr David Garza, Rector, Tecnológico de Monterrey
Professor Charlie Jeffery, Vice-Chancellor and President, University of York
Professor Peter Lennie, WUN
|
https://en.wikipedia.org/wiki/Live%20%40%20ATP
|
Live @ ATP is a collection of songs recorded during the performance of Boards of Canada at All Tomorrow's Parties on 7 April 2001. These songs were later released onto P2P networks where they are still widely available. Along with a few known songs, the majority of the songs have never before been released and are unnamed. This performance was not formally released by Boards of Canada.
Track listing
"Echus" – 6:23
Unknown – 7:32
"Flute Frum Thing" – 1:26
"Sunshine Recorder" – 6:29
"Sixtyten" – 5:51
Unknown – 1:44
Unknown (possibly "Noatak") – 8:26
"Julie and Candy" – 6:14
Unknown – 1:30
"Happy Cycling" – 7:55
"A Is To B As B Is To C" – 0:46
"In a Beautiful Place Out in the Country" – 5:46
References
2001 live albums
Bootleg recordings
|
https://en.wikipedia.org/wiki/Avraham%20Even-Shoshan
|
Avraham Even-Shoshan (né Rozenshteyn; 25 December 1906 – 8 August 1984) was a Belarusian-born Israeli Hebrew linguist and lexicographer, compiler of the Even-Shoshan dictionary, one of the foremost dictionaries of the Hebrew language.
Biography
Avraham Rozenshteyn was born in Minsk, in what was then the Russian Empire, on 25 December 1906. He attended the cheder run by his father, who later sent him to public school and yeshiva.
Rosenstein managed to avoid the British restrictions on Jewish immigration to Mandatory Palestine and settled there in 1925, where he changed his name to Even-Shoshan, a translation of Rosenstein, and initially worked as a laborer. He studied at the College for Hebrew Teachers (now the David Yellin College of Education) in Jerusalem and the Hebrew University of Jerusalem. He worked as a teacher in Jerusalem until 1967.
In 1946–58, Even-Shoshan compiled HaMilon HeHadash (New Dictionary of the Hebrew Language), which since 2003 has become known as the Even-Shoshan Dictionary. The completed dictionary consisted of 24,698 main entries and about 70,000 words, and is still in print. It includes synonyms in Arabic, Aramaic, Akkadian, and Ugaritic. He was also the author of the Even-Shoshan concordance and co-author of the Bialik concordance.
Even-Shoshan died in the Hadassah Medical Center in Jerusalem in 1984. He was buried in the Har HaMenuchot.
Awards
In 1978, Even-Shoshan was awarded the Israel Prize, for language.
In 1981, he was the co-recipient (jointly with Zev Vilnay) of the Bialik Prize for Jewish thought.
Published works
A New Concordance of the Bible: Thesaurus of the Language of the Bible, Hebrew and Aramaic, Roots, Words, Proper Names Phrases and Synonyms (1984)
See also
List of Israel Prize recipients
List of Bialik Prize recipients
Notes
References
Linguists from Israel
Israeli lexicographers
20th-century Israeli Jews
1906 births
1984 deaths
Israel Prize in linguistics recipients
20th-century linguists
20th-century lexicographers
Soviet emigrants to Mandatory Palestine
Burials at Har HaMenuchot
|
https://en.wikipedia.org/wiki/Merge%20Module
|
A merge module is a special kind of Windows Installer database that contains the components needed to install a discrete software bundle. A merge module cannot be installed alone, but must be merged into a standard Windows Installer installation during the creation of the installation. Typically, a merge module or a collection of merge modules related by dependencies, installs a software product or portion of a product at runtime. The purpose of merge modules is to let you add self-contained software modules to multiple installations.
For example, if there are a number of applications that require a specifically configured component, it would be possible to create a merge module that installs and configures that component. That merge module could then be added to the installation packages of each product that required that particular component. This saves the effort of having to individually add the necessary files, registry entries, and other components to every installation. It also saves time if updates are needed, as instead of updating the installations for all applications, only the merge module is updated, and the installations only need to be rebuilt.
Standard merge modules have a .msm file extension. Some merge modules may be configurable merge modules. Such merge modules contain certain values that can be set to specify how the module behaves in your installation. For example, the author of the configurable merge module may allow attributes to be set on components, enable or disable isolated components, specify a bitmap for a dialog, or specify how a custom action is run. Configurable merge modules are supported only by Windows Installer 2.0 or higher.
There exist a number of pre-created merge modules which install commonly used Microsoft software packages, such as MDAC, ActiveX controls, MFC, SAPI and DCOM.
References
Windows components
Microsoft application programming interfaces
|
https://en.wikipedia.org/wiki/The%20Stranger%20%281973%20film%29
|
The Stranger is a 1973 made-for-television film pilot for a new television series, but it was never picked up by a network. It was directed by Lee H. Katzin.
Film Ventures International, an independent film production and distribution company, re-issued The Stranger to syndication under the title Stranded in Space. As with other films re-released under the FVI banner, The Stranger'''s new opening credits featured footage from an entirely unrelated film, in this case the 1983 low-budget science fiction film Prisoners of the Lost Universe.
Plot
While on a space mission, NASA astronaut Neil Stryker (Glenn Corbett) crashes and is hospitalized in quarantine for a long period of time. He is uninjured, although his two fellow astronauts were apparently killed in the crash.
Stryker becomes suspicious when he tries to ask why he is being held for so long and can’t seem to get any reasonable explanation. It turns out that he is being closely observed by Dr. Revere (Tim O'Connor) and government agent Benedict (Cameron Mitchell), while being interrogated in his sleep after being given powerful drugs. The drugs reveal that Stryker is from another planet (Earth), and his society is one where there is freedom of thought and speech. Dr. Revere is clearly concerned by the strain of the drugs on Stryker, but is caught between the concern for the patient and his responsibility to the government.
Stryker eventually escapes the hospital after almost being shot and killed by the security forces. When trying to make a call to Cape Kennedy at a telephone booth, he is shocked to find that the operator has never heard of it, or even the state of Florida. He hitches a ride and begins to realize that he is not on planet Earth, after seeing subtle differences such as three moons in the sky and discovering that the inhabitants of this planet are all left-handed.
Stryker soon visits a book store, where he researches the planet. The twin planet, which is on the far side of the sun and unknown to Earth, is known to its inhabitants as Terra. It has a system of government and citizen comradeship that is alien to Stryker - The Perfect Order. The enforcement of the order is facilitated by a hierarchy of officials who scrutinize their subordinates extremely closely, and by inspirational messages, "pep" talks to remind citizens of the great family they're part of, and electronic monitoring through technology including telephones, televisions and car radios.
The Perfect Order has only been around for about 35 to 40 years, after a terrible war. The order was instituted to foster a sense of family among every person on Terra, to help each other and think of each other and the good of the whole. People with incompatible ideas are removed and reconditioned, and if resistant, executed. Culture has been heavily excised (no concerts in the park), religion outlawed, and alcoholic drinks are viewed as a future target to eliminate. Among its accomplishments, the Perfect Order has eli
|
https://en.wikipedia.org/wiki/Cigarette%20smokers%20problem
|
The cigarette smokers problem is a concurrency problem in computer science, originally described in 1971 by Suhas Patil. The problem has been criticized for having "restrictions which cannot be justified by practical considerations."
Problem description
Patil's problem includes a "quite arbitrary" "restriction that the process which supplies the ingredients cannot be changed and that no conditional statements may be used."
Assume a cigarette requires three ingredients to make and smoke: tobacco, paper, and matches. There are three smokers around a table, each of whom has an infinite supply of one of the three ingredients — one smoker has an infinite supply of tobacco, another has paper, and the third has matches.
There is also a non-smoking agent who enables the smokers to make their cigarettes by arbitrarily (non-deterministically) selecting two of the supplies to place on the table. The smoker who has the third supply should remove the two items from the table, using them (along with their own supply) to make a cigarette, which they smoke for a while. Once the smoker has finished his cigarette, the agent places two new random items on the table. This process continues forever.
Three semaphores are used to represent the items on the table; the agent increases the appropriate semaphore to signal that an item has been placed on the table, and smokers decrement the semaphore when removing items. Also, each smoker has an associated semaphore that they use to signal to the agent that the particular smoker is done smoking; the agent has a process that waits on each smoker's semaphore to let the agent know that it can place the new items on the table.
A simple pseudocode implementation of the smoker who has the supply of tobacco might look like the following:
def tobacco_smoker():
repeat:
paper.wait()
matches.wait()
smoke()
tobacco_smoker_done.signal()
However, this can lead to deadlock; if the agent places paper and tobacco on the table, the smoker with tobacco may remove the paper and the smoker with matches may take the tobacco, leaving both unable to make their cigarette. The solution is to define additional processes and semaphores that prevent deadlock, without modifying the agent.
Criticism
Patil placed the following constraints on the cigarette smokers problem:
The agent code is not modifiable.
The solution is not allowed to use conditional statements.
Patil used a proof in terms of Petri nets to claim that a solution to the cigarette smokers problem using Edsger Dijkstra's semaphore primitives is impossible, and to suggest that a more powerful primitive is necessary. However, David Parnas demonstrated that Patil's proof is inadequate if arrays of semaphores are used, offering a solution that uses helper processes that do arithmetic to signal the appropriate smoker to proceed.
According to Allen B. Downey, the first restriction makes sense, because if the agent represents an operating system, it w
|
https://en.wikipedia.org/wiki/Lexxe
|
Lexxe is an internet search engine that applies Natural Language Processing
in its semantic search technology. Founded in 2005 by Dr. Hong Liang Qiao,
Lexxe is based in Sydney, Australia. Today, Lexxe's key focus is on sentiment search with the launch of a news sentiment search site at News & Moods (www.newsandmoods.com).
Lexxe has experienced several stages of change of focus in search technology:
Lexxe launched its Alpha version in 2005, featuring Natural Language question
answering (i.e. users could ask questions in English to the search engine apart from keyword searches — this feature has been suspended for redevelopment since 2010). It used only algorithms to extract answers from web pages, with no question-answer pair databases prepared in advance.
In 2011, Lexxe launched a beta version with a new search technology called Semantic Key. Semantic Keys enable users to query with a conceptual keyword
(or a keyword with a special meaning, hence the term Semantic Key) in order
to find instances under the concept, e.g. price → $5.95 or €200, color →
red, yellow, white. For example, “price: a pound of apples”, “color:
ferrari”. With initial 500 Semantic Keys at the Beta launch, Lexxe
became the first search engine in the world to offer this unique and useful
search technology to the users. The cost of building Semantic Keys was too heavy though.
In 2017, Lexxe launched News & Moods (www.newsandmoods.com), an open platform for news sentiment search, a first step towards sentiment search feature for the entire Internet search in Lexxe search engine. News & Moods also comes with smartphone apps in Android and iOS.
References
External links
Lexxe main web site
News & Moods web site
Internet search engines
Natural language processing
|
https://en.wikipedia.org/wiki/Data%20position%20measurement
|
Data position measurement (DPM) is a copy protection mechanism that operates by measuring the physical location of data on an optical disc. Stamped CDs are perfect clones and always have the data at the expected location, while a burned copy would exhibit physical differences. DPM detects these differences to identify user-made copies. DPM was first used publicly in 1996 by Link Data Security's CD-Cops. It was used in volume on Lademans Leksikon published by Egmont in November 1996.
RMPS
DPM can be observed and subsequently encoded into a recordable media physical signature (RMPS). In concert with emulation software RMPS can reproduce the effects of DPM thereby appearing as an original disc and fooling the protection mechanism. This technique was pioneered by the software Alcohol 120%, for which it created the .mds file format.
References
"Microsoft buy Danish copy-protection, 1997 (Danish)"
Compact Disc and DVD copy protection
Optical computer storage
|
https://en.wikipedia.org/wiki/Data%27s%20Day
|
"Data's Day" is the 85th episode of the American science fiction television series Star Trek: The Next Generation, the 11th episode of the fourth season. This episode introduces Keiko O'Brien and Data's pet cat, Spot.
Set in the 24th century, the series follows the adventures of the Starfleet crew of the Federation starship Enterprise-D. In this episode, as Data contemplates the impending marriage of his friend Keiko Ishikawa to Transporter Chief Miles O'Brien, he learns about the peculiar minutiae – such as last-minute jitters and ballroom dancing – that surround human nuptials. At the same time, he investigates the apparent death of the Vulcan ambassador whom the Enterprise was ferrying to the Neutral Zone in order to conduct treaty negotiations with the Romulans.
Plot
Transporter Chief Miles O'Brien (Colm Meaney) and civilian botanist Keiko Ishikawa (Rosalind Chao) are about to be married, and Data (Brent Spiner) has been asked to give the bride away. After Keiko calls off the wedding, Data seeks advice from Geordi (LeVar Burton) and Counselor Troi (Marina Sirtis). He attempts to convince Keiko to go through with the wedding. Data asks Dr. Crusher (Gates McFadden) to teach him how to dance. She instructs him in tap dance and ballroom dancing.
Meanwhile, the Enterprise is taking Vulcan ambassador T'Pel (Sierra Pecheur) to a secret meeting with a Romulan ship. T'Pel asks Data about the Enterprise defense capabilities, but claims she was merely testing Data's security safeguards. During the Enterprise rendezvous with a Romulan warbird T'Pel is seemingly killed during a transport accident. However, Data deduces that T'Pel was not really killed, and that the Romulans beamed her away and staged the accident.
Picard returns to the neutral zone and intercepts the Romulans. He learns that T'Pel is actually a Romulan spy using the Enterprise to return to the Romulans. Multiple warbirds enter the neutral zone and Picard retreats into Federation space.
Keiko agrees to proceed with the wedding. She and Miles are married by Captain Picard. Data notes that he understands the emotions of love and belonging.
Production
This was the first episode with Data's cat, Spot. The cat is not actually named until a later appearance.
Reception
WIRED magazine ranked "Data's Day" as one of the best of Star Trek: The Next Generation in a 2012 review. They praise masterful acting by Brent Spiner as Data throughout the episode, offering what they call a "Pinocchio perspective" on the plot. In 2019, ThoughtCo ranked "Data's Day" as the 7th best episode of this series, pointing out its special and emotional view of a day aboard the Enterprise-D.
In 2019, Den of Geek noted this episode for featuring romantic elements, pointing out the wedding of Chief Miles O'Brien and Keiko. This episode was noted by the Chicago Tribune in 1996 for introducing the character of Keiko as played by actress Rosalind Chao, she was also featured as a reoccurring character on Star Trek: Dee
|
https://en.wikipedia.org/wiki/SOP%20Gigsters
|
SOP Gigsters is a Philippine television variety show broadcast by GMA Network. Hosted by Richard Gutierrez and Raymond Gutierrez, it premiered on June 13, 2004. The show concluded on October 22, 2006.
Cast
Hosts
Richard Gutierrez (2004–06)
Raymond Gutierrez (2004–06)
Performers
Chuck Allie (2006)
Nicole Andersson (2004–06)
Gian Carlos (2006)
Rainier Castillo (2004–06)
Marky Cielo (2006)
Ryza Cenon (2005–06)
JC De Vera (2004–06)
Jacque Esteves
Sheena Halili (2004–06)
Mark Herras (2004–06)
Yasmien Kurdi (2004–06)
Jade Lopez (2004–06)
Ehra Madrigal
Jennylyn Mercado (2004–06)
Iwa Moto (2006)
C. J. Muere (2005–06)
Rhian Ramos (2006)
LJ Reyes (2005–06)
Jackie Rice (2006)
Jana Roxas (2006)
Mike Tan (2005–06)
Iya Villania (2004)
References
External links
2004 Philippine television series debuts
2006 Philippine television series endings
Filipino-language television shows
GMA Network original programming
Philippine variety television shows
|
https://en.wikipedia.org/wiki/Marek%20Karpinski
|
Marek Karpinski is a computer scientist and mathematician known for his research in the theory of algorithms and their applications, combinatorial optimization, computational complexity, and mathematical foundations. He is a recipient of several research prizes in the above areas.
He is currently a Professor of Computer Science, and the Head of the Algorithms Group at the University of Bonn. He is also a member of Bonn International Graduate School in Mathematics BIGS and the Hausdorff Center for Mathematics.
See also
List of computer scientists
List of mathematicians
References
Theoretical computer scientists
Mathematical logicians
Graph theorists
Academic staff of the University of Bonn
American computer scientists
20th-century Polish mathematicians
21st-century Polish mathematicians
Members of Academia Europaea
Polish computer scientists
Living people
Year of birth missing (living people)
|
https://en.wikipedia.org/wiki/Advertiser-funded%20programming
|
Advertiser-funded programming (AFP) is a recent term applied to a break away from the modern model of television funding in place since the early 1960s. Since that time, programmes have normally been funded by a broadcaster and they re-couped the money through selling advertising space around the content. This has worked fine for decades, but new technological advances have forced broadcasters and advertisers to re-think their relationship.
The concept is as old as television itself; the term soap opera is derived from the fact that the original soap operas were in fact funded and produced by soap companies such as Procter & Gamble. Shows such as the Texaco Star Theater, which were among the earliest television programs, included the practice. It was not until the quiz show scandals of the late 1950s, when particularly aggressive advertisers began rigging game shows to produce a more entertaining product, that the practice fell on the wayside. By the time television became a worldwide phenomenon in the late 1950s and early 1960s, the original model had mostly been eschewed in favor of the modern model, which separates programming and advertising. (The fact that many of the early television broadcasters outside the United States were public broadcasters that restricted the use of advertising may have been a contributing factor to this.)
With the advent of digital recording devices, also known as personal video recorders (PVR's), viewers can choose to record episodes or entire series of their favourite shows and watch them in their own time. Not only does this skew the idea of 'primetime', (advertisers being charged a premium for buying spots around the most popular viewing times), but it means viewers can skip the ads altogether.
Advertiser-funded programming, largely a neologism, is a solution to this change and means the advertiser pays to integrate their message in the TV programme itself, rather than just buying advertising space around it. It includes product placement, sponsorship, naming rights and more recently the actual creation of whole shows from scratch. Many of these projects are enabled by a content partnership where the programming is co-funded by multiple stakeholders.
Some recent examples of AFP:
The Krypton Factor, in partnership with The Sage Group on ITV
Beat: Life on the Street on ITV, in partnership with the Home Office
Ford and Toyota in 24
Crest toothpaste in The Apprentice
American Express in The Restaurant
Findmypast.co.uk sponsored the genealogy TV series 'Find My Past' on the Yesterday channel in October 2011.
Most sports organizations heavily restrict the use of advertiser funded programming, particularly amateur competitions such as the Olympic Games and the FIFA World Cup, both of which ban the practice as ambush marketing. Other sports have embraced the practice as an additional form of revenue, both for the leagues and the networks. Naming rights have been sold for bowl games, tournaments, television pre
|
https://en.wikipedia.org/wiki/Egress%20filtering
|
In computer networking, egress filtering is the practice of monitoring and potentially restricting the flow of information outbound from one network to another. Typically, it is information from a private TCP/IP computer network to the Internet that is controlled.
TCP/IP packets that are being sent out of the internal network are examined via a router, firewall, or similar edge device. Packets that do not meet security policies are not allowed to leave – they are denied "egress".
Egress filtering helps ensure that unauthorized or malicious traffic never leaves the internal network.
In a corporate network, typical recommendations are that all traffic except that emerging from a select set of servers would be denied egress. Restrictions can further be made such that only select protocols such as HTTP, email, and DNS are allowed. User workstations would then need to be configured either manually or via proxy auto-config to use one of the allowed servers as a proxy.
Corporate networks also typically have a limited number of internal address blocks in use. An edge device at the boundary between the internal corporate network and external networks (such as the Internet) is used to perform egress checks against packets leaving the internal network, verifying that the source IP address in all outbound packets is within the range of allocated internal address blocks.
Egress filtering may require policy changes and administrative work whenever a new application requires external network access. For this reason, egress filtering is an uncommon feature on consumer and very small business networks.
See also
Content-control software
Ingress filtering
Web Proxy Autodiscovery Protocol
References
External links
RFC 3013
Pcisecuritystandards.org
Pcisecuritystandards.org
Sans.org
Computer network security
|
https://en.wikipedia.org/wiki/A%E2%99%AF%20%28Axiom%29
|
{{DISPLAYTITLE:A♯ (Axiom)}}
A♯ (pronounced: A sharp) is an object-oriented functional programming language distributed as a separable component of Version 2 of the Axiom computer algebra system. A# types and functions are first-class values and can be used freely together with an extensive library of data structures and other mathematical abstractions. A key design guideline for A# was suitability of compiling to portable and efficient machine code. It is distributed as free and open-source software under a BSD-like license.
Development of A# has now changed to the programming language Aldor.
A# has both an optimising compiler, and an intermediate code interpreter. The compiler can emit any of:
Executable stand-alone programs
Libraries, of native operating system format objects, or of portable bytecode
Source code, for languages C, or Lisp
The following C compilers are supported: GNU Compiler Collection (GCC), Xlc, Oracle Developer Studio, Borland, Metaware, and MIPS C.
References
Functional languages
Discontinued programming languages
|
https://en.wikipedia.org/wiki/A%20Sharp%20%28.NET%29
|
A# is a port of the Ada programming language to the Microsoft .NET platform. A# is freely distributed by the Department of Computer Science at the United States Air Force Academy as a service to the Ada community under the terms of the GNU General Public License.
AdaCore took over this development in 2007, and announced "GNAT for .NET", which is a fully supported .NET product with all of the features of A# and more. As of 2021, A# has fallen dramatically in popularity and is considered by some to be a dead language (there are no known users or implementations).
Examples
hello world
with Ada.Text_IO;
use Ada.Text_IO;
procedure Hello_Dotnet is
begin
Put_Line(Item => “Hello .NET world!”);
end Hello_Dotnet;
References
External links
A# for .NET
Ada Sharp .NET Programming environment
Ada (programming language)
.NET programming languages
|
https://en.wikipedia.org/wiki/Nintendo%20World%20Cup
|
Nintendo World Cup is a soccer video game for the Family Computer/NES and Game Boy, developed by Technōs Japan and released in 1990. It is a localization of the fourth Kunio-kun game released for the Family Computer. Ports for the PC Engine and Mega Drive were also released in Japan. A Game Boy version was released in Japan, North America, and Europe.
Plot
Nekketsu High School Dodgeball Club: Soccer
Eight students known as Atsushi, Genei, Hiroshi, Kunio, Masa, Masahiro, Susumu and Takashi compete in a soccer tournament against 13 other high schools.
Nintendo World Cup
Thirteen national teams compete in a world cup to become number 1. At the time of the game's release, the German team represented West Germany, with the East German team reunifying with West Germany later on in 1990.
(West Germany)
Gameplay
At its core, the game follows the rules of football, but with noticeable differences. Each team has only six players (a goalkeeper, two defenders, a midfielder and two forwards). You control only one of them, but you can give commands (Pass/Shoot) to the others. Offsides are non-existent and fouls are not punished. Players can be knocked out by repeatedly sliding, tackling or shooting them, afterwards they will stay down for the rest of the half. Players can also use up to five "super shots" per half; these powerful, odd-looking shots are used whenever a player does a bicycle kick or most of the time when doing a diving header, or when he shoots after walking a certain number of steps. The "super shots" differ from team to team. The playing fields also differ in respect to material, e.g. ice, which heavily impacts movement of players and the ball.
There are two game modes:
Tournament mode, in which one or two players take control of one of the 13 available teams, in order to defeat their CPU-controlled opponents.
VS Match mode, which enables players to confront each other on sand, ice or dirt playing fields. On the NES version, up to four players can compete using the NES Four Score or the NES Satellite. For the Game Boy a link cable or Four Player Adapter would be used.
Graphically, the NES version game looks similar to the Famicom version and other games in the Kunio-kun series, particularly Downtown Nekketsu Story/River City Ransom, with its short-legged, big-headed characters with varied faces; in fact, some sprites, such as Kunio and the other members of the Japanese team, were reused from that game.
Regional differences
The NES version of Nekketsu High School Dodge Ball Club: Soccer Edition, Nintendo World Cup, differs from its counterpart, in that the game centers around a World Cup set in Japan between thirteen high schools, instead of a soccer tournament. In the main Tournament Mode, the player takes control of the main team of Nekketsu High School team and competes against the other twelve teams. The Tournament Mode's opening intro and story sequences are removed in the NES version. In the Famicom version's "Vs. Match Mode",
|
https://en.wikipedia.org/wiki/Atari%20MEGA%20STE
|
The Atari Mega STE is Atari Corporation's final Motorola 68000-based personal computer in the Atari ST series and the second to last model overall. Released in 1991, the Mega STE is a late-model STE mounted in the case of an Atari TT computer. It was followed by the higher end Atari Falcon in 1992.
Description
The MEGA STE is based on STE hardware. The 2 MB and 4 MB models shipped with a high-resolution mono monitor, and an internal SCSI hard disk (the 1 MB model includes neither a monitor, hard disk nor hard disk controller). While offering better ST compatibility than the TT, it also includes a number of TT features, from the ST-grey version of the TT case with a separate keyboard and system unit, optional FPU, a VMEbus slot, two extra RS232 ports (all 9-pin rather than 25-pin as previous models had), a LocalTalk/RS-422 port (no AppleTalk software was ever produced) and a 1.44 MB HD floppy support. Support for a third/middle mouse button is also included.
A unique feature of the MEGA STE in relation to previous Atari systems is the software-switchable CPU speed, which allows the CPU to operate at 16 MHz for faster processing or 8 MHz for better compatibility with old software. An upgrade to the operating system was also produced after the first units were shipped that upgraded the onboard ROMs to TOS 2.05 and later to 2.6/2.06.
The VME bus provides expansion capability using cards that enhance the computer's capabilities such as enhanced graphics processing capability and Ethernet network connectivity.
Technical specifications
CPU: Motorola 68000 @ 8 or 16 MHz with 16kB cache
FPU: Motorola 68881 or Motorola 68882
BLiTTER - graphics co-processor chip
RAM: 1, 2 or 4 MB ST RAM expandable to 4 MB using 30-pin SIMMs
Sound: Yamaha YM2149 + enhanced sound chip same as in Atari STe
Drive: 720 KB (first MEGA STE version) or 1.44 MB (later version) 3½" floppy disk drive
Ports: MIDI In/Out, 3 x RS-232, "Serial LAN" LocalTalk/RS-422, printer, monitor (RGB and Mono), RF modulator, extra disk drive port, ACSI, SCSI (ACSI/SCSI daughterboard), port, VMEbus inside case, detachable keyboard, joystick and mouse ports on keyboard
Operating System: TOS (The Operating System) with the Graphics Environment Manager (GEM) graphical user interface (GUI) TOS versions: 2.05 in ROM or 2.06 in ROM
Display modes: 320×200 (16 out of 4096 colors), 640×200 (4 out of 4096 colors), 640×400 (mono)
Character set: Atari ST character set (based on code page 437)
Case: Two-piece slim desktop-style.
References
External links
Web page of Guillaume Tello What to do with a Mega STE?
Programs for the ST/TT family and technical articles (in french)
Atari MegaSTe Memory Cache
The MEGA STe review, 1992
68000-based home computers
Atari ST
Products introduced in 1991
|
https://en.wikipedia.org/wiki/Alarm%20indication%20signal
|
Alarm indication signal (AIS) (also called “all ones” because of the data and framing pattern) is a signal transmitted by an intermediate element of a multi-node transport circuit that is part of a concatenated telecommunications system to alert the receiving end of the circuit that a segment of the end-to-end link has failed at a logical or physical level, even if the system it is directly connected to is still working. The AIS replaces the failed data, allowing the higher order system in the concatenation to maintain its transmission framing integrity. Downstream intermediate elements of the transport circuit propagate the AIS onwards to the destination element.
There are various AIS formats based on the signaling level of the errored circuit. When an element of T1 or (DS1) circuit loses signal (LOS) or framing (OOF), the device replaces the erroneous data bits with a series of ones. This is where the term All Ones originates. At the DS3 signal level, the intermediate element receiving an errored signal replaces the errored channel data with a signal consisting of a valid DS3 frame with the overhead bits (the M-subframe alignment bits, M-frame alignment bits, and P bits) with the payload set to a 1010... sequence, the C bits all set to zero, and the X bits set to one. This way, the integrity of the DS3 frame is maintained even though the underlying data was compromised.
There are a number of types of AIS signals, which signal failure of different logical or physical segments of the system, including:
Alarm indication signal path (AIS-P)
Alarm indication signal line (AIS-L)12
These are SONET OC-xx level indications that indicate if the errored element is in a section, segment, line segment, or path segment of the SONET circuit.
Middle 20th century analog carrier systems had Carrier Group Alarms by which the failure of a pilot signal was alerted to telephone exchange equipment, imposing an automated make-busy condition so the trunks carried by the failed system would not be used. The improved AIS originated with the T-carrier system, and became a standard feature of subsequent plesiochronous and synchronous circuit-based communication systems, and is also part of the Asynchronous Transfer Mode standards.
As the use of Ethernet for long-distance data links has increased, the need for a similar end-to-end OA&M function has led to the development of a similar Ethernet alarm indication signal (EthAIS).
Synchronous optical networking
|
https://en.wikipedia.org/wiki/Semantic%20translation
|
Semantic translation is the process of using semantic information to aid in the translation of data in one representation or data model to another representation or data model. Semantic translation takes advantage of semantics that associate meaning with individual data elements in one dictionary to create an equivalent meaning in a second system.
An example of semantic translation is the conversion of XML data from one data model to a second data model using formal ontologies for each system such as the Web Ontology Language (OWL). This is frequently required by intelligent agents that wish to perform searches on remote computer systems that use different data models to store their data elements. The process of allowing a single user to search multiple systems with a single search request is also known as federated search.
Semantic translation should be differentiated from data mapping tools that do simple one-to-one translation of data from one system to another without actually associating meaning with each data element.
Semantic translation requires that data elements in the source and destination systems have "semantic mappings" to a central registry or registries of data elements. The simplest mapping is of course where there is equivalence.
There are three types of Semantic equivalence:
Class Equivalence - indicating that class or "concepts" are equivalent. For example: "Person" is the same as "Individual"
Property Equivalence - indicating that two properties are equivalent. For example: "PersonGivenName" is the same as "FirstName"
Instance Equivalence - indicating that two individual instances of objects are equivalent. For example: "Dan Smith" is the same person as "Daniel Smith"
Semantic translation is very difficult if the terms in a particular data model do not have direct one-to-one mappings to data elements in a foreign data model. In that situation, an alternative approach must be used to find mappings from the original data to the foreign data elements. This problem can be alleviated by centralized metadata registries that use the ISO-11179 standards such as the National Information Exchange Model (NIEM).
See also
Data mapping
Federated search
Intelligent agents
ISO/IEC 11179
National Information Exchange Model
Semantic heterogeneity
Semantic mapper
Semantic Web
Vocabulary-based transformation
Web Ontology Language
References
Data management
Enterprise application integration
Semantics
|
https://en.wikipedia.org/wiki/Alex%20Fraser%20%28scientist%29
|
Alex Fraser (1923 – 14 July 2002) was a major innovator in the development of the computer modeling of population genetics and his work has stimulated many advances in genetic research over the past decades.
His efforts in the 1950s and 1960s had a profound impact on the development of computational models of evolutionary systems. His seminal work, "Simulation of genetic systems by automatic digital computers" (1958), is quoted in the literature to this day.
Fraser was born in London, England, and lived in Hong Kong for most of his youth. He studied at the University of New Zealand, and later went to the University of Edinburgh, and subsequently to the Commonwealth Scientific and Industrial Research Organisation (CSIRO) in Sydney, Australia.
It was at the CSIRO where Fraser made his seminal contributions to evolutionary computation.
His earliest work was done on the SILIAC computer that was installed for the University of Sydney in 1956. The SILIAC was the Australian cousin to the ILLIAC machine that was developed at the University of Illinois. The machine was said to be running well when one could hear a 'rhythmic clicking of the relays inside it.' The clicking indicated that the computer was processing the iterations of the program correctly. Fraser began using it to simulate genetic selection processes.
Fraser also starred in multiple TV shows during the early days of Australian television. His time with "Science in Close-Up" ended in a dramatic departure when censors refused to permit airing of a childbirth. Such footage is commonplace today but was forbidden at the time and that was why he walked out of the show. A surprisingly popular show was his "Doorway to Knowledge" as it was fairly sophisticated science that was broadcast at eleven o'clock in the morning. He achieved a certain measure of celebrity through the shows and he turned up quite regularly in the Sydney Morning Herald, the city's primary newspaper.
In the 1960s, Fraser moved to the United States to act as visiting professor at the University of California at Davis. In 1967, he took over the Headship of Biological Sciences at the University of Cincinnati.
In 1983, Fraser suffered a stroke which left him unable to converse normally. The timing of this event was most tragic because Fraser was left unable to engage his colleagues, just at the time when interest in evolutionary models and simulations was beginning to rise within computer science.
In 1999, Fraser received the 1999 IEEE Neural Networks Council Pioneer Award in Evolutionary Computation. He died 14 July 2002 at the age of 78, as a result of complications from a heart attack.
References
1923 births
2002 deaths
Australian computer scientists
Alumni of the University of Edinburgh
British expatriates in Hong Kong
British expatriates in New Zealand
British expatriates in Australia
British expatriate academics in the United States
|
https://en.wikipedia.org/wiki/UIML
|
UIML (User Interface Markup Language) is an XML-based markup language used to define user interfaces on computers. The primary purpose of UIML is to streamline the process of developing user interfaces, enabling programmers to describe their interfaces in declarative terms (i.e., as text) and abstract them. For instance, when describing a message window, a programmer utilizing this language would write:
<part class="DialogMessage" name="HelloWorld"/>
In theory, a programmer could utilize such a description to create user interfaces for various platforms, such as PDAs. However, in practice, the distinct capabilities of these platforms present challenges for achieving comprehensive translation. Less ambitious domain-specific programming languages, on the other hand, aim to solely describe user interfaces, or other components of an application or process, within a specific domain, like Windows, for instance. An example of such a language is Microsoft's XAML. These languages often exhibit improved compatibility with other platforms, although they tend to be less flexible.
Currently, UIML is undergoing standardization by OASIS, with the latest iteration being UIML 4.0, which was released in 2008.
A parallel effort with similar objectives to UIML is UsiXML.
UIML implementations
jUIML – An implementation in Java Swing
UIML.Net A free UIML renderer written in C#. It has been developed at the Expertise Centre for Digital Media (Hasselt University, Belgium) and can render a UIML document using different widget sets and different platforms. The software is now hosted on GitHub.
References
Open standards
User interface markup languages
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.