source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/Overbrook%20Junction%20station | Overbrook Junction is a station on the Beechview branch of the Port Authority of Allegheny County's light rail network which serves Castle Shannon, Pennsylvania.
History
Overbrook Junction was built as part of the 2004 reopening of the Overbrook line. It is the transfer point between the Beechview (serving Castle Shannon, Mt. Lebanon, Dormont, and Beechview) and Overbrook (serving Overbrook, Carrick, Bon Air, and Belzhoover) lines. No parking is available at the site. Since park and ride commuters can more conveniently reach the nearby Castle Shannon station, Overbook Junction almost exclusively serves nearby apartments and individuals switching trains. During peak hours, Red Line trains used to terminate at this station, requiring commuters who need to travel farther south to use the short footpath to Willow.
References
Port Authority of Allegheny County stations
Railway stations in the United States opened in 2004
Red Line (Pittsburgh) |
https://en.wikipedia.org/wiki/Arlington%20station%20%28Pittsburgh%20Regional%20Transit%29 | Arlington is a station on the Port Authority of Allegheny County's light rail network, located in Castle Shannon, Pennsylvania. The street level stop is designed to serve a nearby commercial strip, providing access for local residents to businesses along Mt. Lebanon Boulevard. Nearby Cooke Drive is also lined with apartments, allowing local light rail access for residents of these dwellings.
References
External links
Port Authority T Stations Listings
Station from Cooke Lane from Google Maps Street View
Port Authority of Allegheny County stations
Railway stations in the United States opened in 1987
Red Line (Pittsburgh) |
https://en.wikipedia.org/wiki/Poplar%20station%20%28Pittsburgh%20Regional%20Transit%29 | Poplar is a station on the Port Authority of Allegheny County's light rail network, located in Mount Lebanon, Pennsylvania. The street level stop is located in a densely populated residential area. Its primary purpose is to serve commuters within walking distance, providing access toward Downtown Pittsburgh, South Hills Village, or Library
References
External links
Port Authority T Stations Listings
Station from Google Maps Street View
Port Authority of Allegheny County stations
Railway stations in the United States opened in 1987
Red Line (Pittsburgh) |
https://en.wikipedia.org/wiki/Kelton%20station | Kelton was a station on the Port Authority of Allegheny County's light rail network, located in Dormont, Pennsylvania. The street level stop was located in a densely populated residential area. It served commuters within walking distance, providing access toward Downtown Pittsburgh, South Hills Village, or Library. The busy commercial corridor along West Liberty Avenue was also accessible, located two blocks from the station.
Kelton was one of eleven stops closed on June 25, 2012 as part of a system-wide consolidation effort.
References
External links
Port Authority T Stations Listings
Former Port Authority of Allegheny County stations
Railway stations in the United States opened in 1987
Railway stations closed in 2012
Railway stations in the United States closed in the 2010s |
https://en.wikipedia.org/wiki/Stevenson%20station | Stevenson is a station on the Port Authority of Allegheny County's light rail network, located in Dormont, Pennsylvania. The street level stop is located in a highly populated residential area that features many medium density multi-unit facilities. It serves commuters within walking distance, providing access toward Downtown Pittsburgh or South Hills Village.
References
External links
Port Authority T Stations Listings
Port Authority of Allegheny County stations
Railway stations in the United States opened in 1987
Red Line (Pittsburgh) |
https://en.wikipedia.org/wiki/CoreSite | CoreSite, a subsidiary of American Tower, owns carrier-neutral data centers and provides colocation and peering services.
As of June 24, 2022 the company owned 27 operating data center facilities in 10 markets comprising over 4.6 million net rentable square feet. The properties are in Boston, Chicago, Denver, Los Angeles, Miami, New York City, Northern Virginia, San Francisco/San Jose, California, Santa Clara, California, Atlanta, Georgia, Orlando, Florida and the Washington, D.C. areas. The company has over 1,350 customers including enterprises, network operators, cloud providers, and supporting service providers.
History
The company was founded in 2001 as CRG West at two of the West coast's original carrier hotels: Market Post Tower and One Wilshire.
In August 2005, the company opened a facility in Washington, D.C.
In May 2007, the company acquired properties in Boston and Chicago. It also purchased a tract of land in Santa Clara, with the intent of developing a 50-megawatt data center Coronado campus there.
In June 2009, the company changed its name to CoreSite.
In September 2010, the company became a public company via an initial public offering.
In April 2012, the company acquired Comfluent and entered the Denver market.
In August 2012, Coresite became the first AMS-IX enabled data center operator in North America.
In July 2016, Tom Ray, the chief executive officer of the company, retired and was replaced by Paul Szurek, lead independent director.
In August 2016, the company announced the $60 million acquisition of the 22-acre Sunrise Technology Park from Brookfield Office Properties.
In December 2021, the company was acquired by American Tower.
See also
List of Internet exchange points
References
2001 establishments in Colorado
2010 initial public offerings
2021 mergers and acquisitions
American corporate subsidiaries
Companies based in Denver
Companies formerly listed on the New York Stock Exchange
Data centers
Financial services companies established in 2001
Real estate companies established in 2001 |
https://en.wikipedia.org/wiki/Neeld%20station | Neeld was a station on the Port Authority of Allegheny County's light rail network, located in the Beechview neighborhood of Pittsburgh, Pennsylvania. The street level stop was located on a small island platform in the middle of Broadway Avenue, through which the T travels along former streetcar tracks. The station served a densely populated residential area through which bus service is limited because of the hilly terrain.
Neeld was one of eleven stops closed on June 25, 2012 as part of a system-wide consolidation effort.
History
The stop was the location of the turning loop of the Pittsburgh Railways 43 Neeld Avenue streetcar service.
References
External links
Port Authority T Stations Listings
Former Port Authority of Allegheny County stations
Railway stations in the United States opened in 1987
Railway stations closed in 2012
Railway stations in the United States closed in the 2010s |
https://en.wikipedia.org/wiki/Shiras%20station | Shiras is a station on the Port Authority of Allegheny County's light rail network, located in the Beechview neighborhood of Pittsburgh, Pennsylvania. The street level stop is located on a small island platform in the middle of Broadway Avenue, through which The T travels along former streetcar tracks.
References
External links
Port Authority T Stations Listings
Port Authority of Allegheny County stations
Railway stations in the United States opened in 1987
Red Line (Pittsburgh) |
https://en.wikipedia.org/wiki/Boustead%20station | Boustead was a station on the Port Authority of Allegheny County's light rail network, located in the Beechview neighborhood of Pittsburgh, Pennsylvania. The street level stop was located on a small island platform in the middle of Broadway Avenue, through which the T travels along former streetcar tracks. The station served a densely populated residential area through which bus service is limited because of the hilly terrain.
Boustead was one of eleven stops closed on June 25, 2012 as part of a system-wide consolidation effort.
References
External links
Port Authority T Stations Listings
Former Port Authority of Allegheny County stations
Railway stations in the United States opened in 1987
Railway stations closed in 2012
1987 establishments in Pennsylvania
2012 disestablishments in Pennsylvania
Railway stations in the United States closed in the 2010s |
https://en.wikipedia.org/wiki/Belasco%20station | Belasco is a station on Pittsburgh Regional Transit's light rail network, located in the Beechview neighborhood of Pittsburgh, Pennsylvania. The street level stop is located on a small island platform in the middle of Broadway Avenue, through which The T travels along former streetcar tracks. The station serves a densely populated residential area through which bus service is limited because of the hilly terrain.
References
External links
Port Authority T Stations Listings
Port Authority of Allegheny County stations
Railway stations in the United States opened in 1987
Red Line (Pittsburgh) |
https://en.wikipedia.org/wiki/Coast%20station%20%28PAAC%29 | Coast was a station on the Port Authority of Allegheny County's light rail network, located in the Beechview neighborhood of Pittsburgh, Pennsylvania. The street level stop was located on a small island platform in the middle of Broadway Avenue, through which The T traveled along former streetcar tracks. The station served a densely populated residential area through which bus service was limited because of the hilly terrain.
Coast was one of eleven stops closed on June 25, 2012 as part of a system-wide consolidation effort.
References
External links
Port Authority T Stations Listings
Former Port Authority of Allegheny County stations
Railway stations in the United States opened in 1987
Railway stations closed in 2012
Railway stations in the United States closed in the 2010s |
https://en.wikipedia.org/wiki/Hampshire%20station | Hampshire is a station on the Port Authority of Allegheny County's light rail network, located in the Beechview neighborhood of Pittsburgh, Pennsylvania. The T travels along former streetcar tracks on Broadway Avenue through the area. The inbound stop is located on a small island platform in the middle of the road, while the outbound stop is just a sign, with no platform. The station serves a densely populated residential area and also the neighborhood's small but crowded business district. It is located in an area where bus service is limited because of the hilly terrain.
References
External links
Port Authority T Stations Listings
Port Authority of Allegheny County stations
Railway stations in the United States opened in 1987
Red Line (Pittsburgh) |
https://en.wikipedia.org/wiki/Fallowfield%20station%20%28Pittsburgh%20Regional%20Transit%29 | Fallowfield is a station on Pittsburgh Regional Transit's light rail network, located in the Beechview neighborhood of Pittsburgh, Pennsylvania. The high level stop is located at the end of Broadway Avenue, built where the tracks transition from a street to a private right-of-way. The station serves a densely populated residential area through which bus service is limited because of the hilly terrain. Although a high level stop, there is no fare booth, so passengers must board or alight from the first car of a two car train.
References
External links
Port Authority T Stations Listings
Port Authority of Allegheny County stations
Railway stations in the United States opened in 1987
Red Line (Pittsburgh) |
https://en.wikipedia.org/wiki/Westfield%20station%20%28Pittsburgh%20Regional%20Transit%29 | Westfield is a station on the Port Authority of Allegheny County's light rail network, located in the Beechview neighborhood of Pittsburgh, Pennsylvania. The street level stop serves a densely populated residential area through which bus service is limited because of the hilly terrain.
References
External links
Port Authority T Stations Listings
Port Authority of Allegheny County stations
Railway stations in the United States opened in 1987
Red Line (Pittsburgh) |
https://en.wikipedia.org/wiki/Pennant%20station | Pennant was a station on the Port Authority of Allegheny County's light rail network, located in the Beechview neighborhood of Pittsburgh, Pennsylvania. The street level stop was located in an especially hilly portion of a neighborhood known for its rolling terrain, and providing access to commuters within walking distance.
On February 2, 2021, Port Authority announced in a news release that Pennant station would close permanently, due to deteriorating pedestrian infrastructure and low ridership. According to the release, the stairs connecting Pennant station to Platt Avenue were found to be in poor condition in a routine inspection in fall 2020, and in another recent inspection, Port Authority engineers found further deterioration. The permanent closure went into effect on Monday, February 15, 2021.
References
External links
Port Authority T Stations Listings
Port Authority to Shutter Pennant Station
Port Authority of Allegheny County stations
Railway stations in the United States opened in 1987
Railway stations closed in 2021
Former Port Authority of Allegheny County stations
Railway stations in the United States closed in the 2020s |
https://en.wikipedia.org/wiki/Traymore%20station%20%28PAAC%29 | Traymore was a station on the Port Authority of Allegheny County's light rail network, located in the Beechview neighborhood of Pittsburgh, Pennsylvania. The street level stop was located in an especially hilly portion of the area known for its rolling terrain, providing access to commuters within walking distance via concrete stairs at the dead end of Traymore Avenue.
Traymore was one of eleven stops closed on June 25, 2012 as part of a system-wide consolidation effort.
References
External links
Port Authority T Stations Listings
Former Port Authority of Allegheny County stations
Railway stations in the United States opened in 1987
Railway stations closed in 2012
Railway stations in the United States closed in the 2010s |
https://en.wikipedia.org/wiki/Dawn%20station | Dawn is a station on the Port Authority of Allegheny County's light rail network, located in the Beechview neighborhood of Pittsburgh, Pennsylvania. The street level stop located in an especially hilly portion of a neighborhood known for its rolling terrain, providing access to commuters within walking distance. The station is located along the South Busway at the south end of the Palm Garden trestle and also serves as a transfer opportunity to the one city bus that stops at the same location.
History
The original Dawn stop was established at the south end of the Palm Garden trestle where Dawn Avenue crossed the Pittsburgh Railways trolley right of way. In the 1950s the stop was served by the 38 Mt. Lebanon, 39 Brookline, 42 Dormont, and 43 Neeld services. Just south of the stop was a junction where the line continued on to West Liberty Avenue (service 38 and 39) with the branch to the west proceeding to Broadway (service 42 and 43). When the 38 Mt Lebanon line along West Liberty Avenue was abandoned on May 25, 1963, it was combined with the 42 Dormont and renumbered as 42/38 Mt. Lebanon/Beechview. However, the 42 Dormont continued as a separate service but for rush hour use only. All lines, except the 39 Brookline, eventually became the 42 South Hills Village, the current Red Line. The 39 Brookline was abandoned on Sep 3, 1966.
Bus connections
41 Bower Hill
References
External links
Port Authority T Stations Listings
Port Authority of Allegheny County stations
Railway stations in the United States opened in 1987
Red Line (Pittsburgh)
South Busway |
https://en.wikipedia.org/wiki/1988%20in%20Canadian%20television | This is a list of Canadian television related events from 1988.
Events
Debuts
Ending this year
Changes of network affiliation
Television shows
1950s
Country Canada (1954–2007)
Hockey Night in Canada (1952–present)
The National (1954–present)
Front Page Challenge (1957–1995)
Wayne and Shuster Show (1958–1989)
1960s
CTV National News (1961–present)
Land and Sea (1964–present)
Man Alive (1967–2000)
Mr. Dressup (1967–1996)
The Nature of Things (1960–present, scientific documentary series)
Question Period (1967–present, news program)
The Tommy Hunter Show (1965–1992)
W-FIVE (1966–present, newsmagazine program)
1970s
The Beachcombers (1972–1990)
Canada AM (1972–2016, news program)
Definition (1974–1989)
the fifth estate (1975–present, newsmagazine program)
Live It Up! (1978–1990)
Marketplace (1972–present, newsmagazine program)
You Can't Do That on Television (1979–1990)
100 Huntley Street (1977–present, religious program)
1980s
Bumper Stumpers (1987–1990)
The Campbells (1986–1990)
CityLine (1987–present, news program)
CODCO (1987–1993)
The Comedy Mill (1986–1991)
Danger Bay (1984–1990)
Degrassi Junior High (1987–1989)
The Journal (1982–1992)
Midday (1985–2000)
Night Heat (1985–1989)
On the Road Again (1987–2007)
The Raccoons (1985–1992)
Street Legal (1987–1994)
Super Dave (1987–1991)
Switchback (1981–1990)
Talkabout (1988-1990)
T. and T. (1987–1990)
Under the Umbrella Tree (1986–1993)
Venture (1985–2007)
Video Hits (1984–1993)
TV movies
Care Bears Nutcracker Suite
The King Chronicle
The Squamish Five
Two Men
Television stations
Debuts
See also
1988 in Canada
List of Canadian films of 1988
References
External links
List of 1988 Canadian television series at IMDb |
https://en.wikipedia.org/wiki/List%20of%20Soviet%20films%20of%201929 | A list of films produced in the Soviet Union in 1929 (see 1929 in film).
1929
See also
1929 in the Soviet Union
External links
Soviet films of 1929 at the Internet Movie Database
1929
Soviet
Films |
https://en.wikipedia.org/wiki/List%20of%20Soviet%20films%20of%201928 | A list of films produced in the Soviet Union in 1928 (see 1928 in film).
1928
See also
1928 in the Soviet Union
References
External links
Soviet films of 1928 at the Internet Movie Database
1928
Soviet
Films |
https://en.wikipedia.org/wiki/List%20of%20Soviet%20films%20of%201927 | A list of films produced in the Soviet Union in 1927 (see 1927 in film).
1927
See also
1927 in the Soviet Union
External links
Soviet films of 1927 at the Internet Movie Database
1927
Soviet
Films |
https://en.wikipedia.org/wiki/List%20of%20Soviet%20films%20of%201926 | A list of films produced in the Soviet Union in 1926 (see 1926 in film).
1926
See also
1926 in the Soviet Union
External links
Soviet films of 1926 at the Internet Movie Database
1926
Soviet
Films |
https://en.wikipedia.org/wiki/List%20of%20Soviet%20films%20of%201925 | A list of films produced in the Soviet Union in 1925 (see 1925 in film).
1925
See also
1925 in the Soviet Union
External links
Soviet films of 1925 at the Internet Movie Database
1925
Soviet
Films |
https://en.wikipedia.org/wiki/List%20of%20Soviet%20films%20of%201924 | A list of films produced in the Soviet Union in 1924 (see 1924 in film).
1924
See also
1924 in the Soviet Union
External links
Soviet films of 1924 at the Internet Movie Database
1924
Soviet
Films |
https://en.wikipedia.org/wiki/List%20of%20Soviet%20films%20of%201923 | A list of films produced in the Soviet Union in 1923 (see 1923 in film).
1923
See also
1923 in the Soviet Union
External links
Soviet films of 1923 at the Internet Movie Database
1923
Soviet
Films |
https://en.wikipedia.org/wiki/List%20of%20Soviet%20films%20of%201922 | A list of films produced in the Soviet Union in 1922 (see 1922 in film).
1922
See also
1922 in the Soviet Union
External links
Soviet films of 1922 at the Internet Movie Database
1922
Soviet
Films |
https://en.wikipedia.org/wiki/Real-time%20Control%20System | Real-time Control System (RCS) is a reference model architecture, suitable for many software-intensive, real-time computing control problem domains. It defines the types of functions needed in a real-time intelligent control system, and how these functions relate to each other.
RCS is not a system design, nor is it a specification of how to implement specific systems. RCS prescribes a hierarchical control model based on a set of well-founded engineering principles to organize system complexity. All the control nodes at all levels share a generic node model.
Also RCS provides a comprehensive methodology for designing, engineering, integrating, and testing control systems. Architects iteratively partition system tasks and information into finer, finite subsets that are controllable and efficient. RCS focuses on intelligent control that adapts to uncertain and unstructured operating environments. The key concerns are sensing, perception, knowledge, costs, learning, planning, and execution.
Overview
A reference model architecture is a canonical form, not a system design specification. The RCS reference model architecture combines real-time motion planning and control with high level task planning, problem solving, world modeling, recursive state estimation, tactile and visual image processing, and acoustic signature analysis. In fact, the evolution of the RCS concept has been driven by an effort to include the best properties and capabilities of most, if not all, the intelligent control systems currently known in the literature, from subsumption to SOAR, from blackboards to object-oriented programming.
RCS (real-time control system) is developed into an intelligent agent architecture designed to enable any level of intelligent behavior, up to and including human levels of performance. RCS was inspired by a theoretical model of the cerebellum, the portion of the brain responsible for fine motor coordination and control of conscious motions. It was originally designed for sensory-interactive goal-directed control of laboratory manipulators. Over three decades, it has evolved into a real-time control architecture for intelligent machine tools, factory automation systems, and intelligent autonomous vehicles.
RCS applies to many problem domains including manufacturing examples and vehicle systems examples. Systems based on the RCS architecture have been designed and implemented to varying degrees for a wide variety of applications that include loading and unloading of parts and tools in machine tools, controlling machining workstations, performing robotic deburring and chamfering, and controlling space station telerobots, multiple autonomous undersea vehicles, unmanned land vehicles, coal mining automation systems, postal service mail handling systems, and submarine operational automation systems.
History
RCS has evolved through a variety of versions over a number of years as understanding of the complexity and sophistication of intelligent beh |
https://en.wikipedia.org/wiki/Spectral%20triple | In noncommutative geometry and related branches of mathematics and mathematical physics, a spectral triple is a set of data which encodes a geometric phenomenon in an analytic way. The definition typically involves a Hilbert space, an algebra of operators on it and an unbounded self-adjoint operator, endowed with supplemental structures. It was conceived by Alain Connes who was motivated by the Atiyah-Singer index theorem and sought its extension to 'noncommutative' spaces. Some authors refer to this notion as unbounded K-cycles or as unbounded Fredholm modules.
Motivation
A motivating example of spectral triple is given by the algebra of smooth functions on a compact spin manifold, acting on the Hilbert space of L2-spinors, accompanied by the Dirac operator associated to the spin structure. From the knowledge of these objects one is able to recover the original manifold as a metric space: the manifold as a topological space is recovered as the spectrum of the algebra, while the (absolute value of) Dirac operator retains the metric. On the other hand, the phase part of the Dirac operator, in conjunction with the algebra of functions, gives a K-cycle which encodes index-theoretic information. The local index formula expresses the pairing of the K-group of the manifold with this K-cycle in two ways: the 'analytic/global' side involves the usual trace on the Hilbert space and commutators of functions with the phase operator (which corresponds to the 'index' part of the index theorem), while the 'geometric/local' side involves the Dixmier trace and commutators with the Dirac operator (which corresponds to the 'characteristic class integration' part of the index theorem).
Extensions of the index theorem can be considered in cases, typically when one has an action of a group on the manifold, or when the manifold is endowed with a foliation structure, among others. In those cases the algebraic system of the 'functions' which expresses the underlying geometric object is no longer commutative, but one may able to find the space of square integrable spinors (or, sections of a Clifford module) on which the algebra acts, and the corresponding 'Dirac' operator on it satisfying certain boundedness of commutators implied by the pseudo-differential calculus.
Definition
An odd spectral triple is a triple (A, H, D) consisting of a Hilbert space H, an algebra A of operators on H (usually closed under taking adjoints) and a densely defined self adjoint operator D satisfying ‖[a, D]‖ < ∞ for any a ∈ A. An even spectral triple is an odd spectral triple with a Z/2Z-grading on H, such that the elements in A are even while D is odd with respect to this grading. One could also say that an even spectral triple is given by a quartet (A, H, D, γ) such that γ is a self adjoint unitary on H satisfying a γ = γ a for any a in A and D γ = - γ D.
A finitely summable spectral triple is a spectral triple (A, H, D) such that a.D for any a in A has a compact resolvent |
https://en.wikipedia.org/wiki/List%20of%20The%20Secret%20Saturdays%20characters | This is a list of characters in the Cartoon Network animated television series The Secret Saturdays.
Saturday family
Zak Saturday
Voice Actor: Sam Lerner (in The Secret Saturdays), Ogie Banks (in Ben 10: Omniverse)
Zak Saturday is the 11-year-old (he turns 12 in "Kur" and turns 13 in "Life in the Underground") major character of the show. The son of Doc and Drew Saturday, Zak seeks adventure at every turn, which is easily satisfied by his cryptid-researching family. Zak has an unorthodox upbringing that has taken him around the planet and placed him in the face of danger since the day he was born. Zak was born the same year the Kur Stone was found and has a special psychic ability to connect with cryptids, allowing him to control their actions to an extent. Tamer cryptids seem to trust him instinctively and even fiercer ones can tell that Zak is different from other humans.
Zak's primary weapon is the Claw, a combination staff/grappling hook which acts as a focusing device for his powers. Zak also seems stronger and more durable than a normal child his age, as he was able to climb a radio tower carrying a full grown man in "The Vengeance of Hibagon" and gets back up immediately after being thrown against a vent in "Black Monday".
For a while, it was believed that if the cryptid Kur was ever unleashed, Zak would be the only one with the power to stop it. However, it was eventually learned that the Kur Stone Doc and Drew discovered before Zak's birth contained Kur's essence. When it was uncovered, the energy was released from the stone and found a new host, namely, the unborn Zak. Despite the Saturdays trying to keep the truth about Zak's nature secret, the other Secret Scientists found out through unexplained means and began pursuing Zak, forcing the Saturdays to go on the run. The Nagas have also sought him, intending to have him embrace his inner nature and become their new master. Following Rani Nagi's attack on Manhattan, Zak and Fiskerton are approached by V.V. Argost, who offers Zak a deal that will "help [him] master his Kur abilities." Zak agreed to the plan, though Argost has informed him that he has his own hidden agenda. Zak later told Doyle to find out as much as he can about Argost's past. During a fight with an Ahuizotl in "The Thousand Eyes of Ahuizotl", Zak discovered that his powers enabled him to sense cryptids without seeing them.
Solomon "Doc" Saturday
Voice Actor: Phil Morris (in The Secret Saturdays), Bumper Robinson (in Ben 10: Omniverse)
Solomon "Doc" Saturday is the patriarch and the "Indiana Jones"-like character who has spent his whole life studying cryptids. Doc Saturday naturally had black hair but after a fight with a guardian known as Tsul 'Kalu, Doc was shocked by the claw that originally belonged to Kalu, giving him a streak of white hair and blinding him in his right eye. A man who takes science very seriously, Doc is one of the Earth's leading experts in the field of cryptozoology.
Doc started his care |
https://en.wikipedia.org/wiki/Ernesto%20Morgado | Ernesto M. Morgado is a Portuguese computer scientist and software entrepreneur. He has served as Associate Professor of computer science and engineering in Instituto Superior Técnico (Technical University of Lisbon) since 1992. He was one of the people behind the creation of the Computer Science and Engineering degree of Instituto Superior Técnico (Technical University of Lisbon), in 1988, and one of the founders of the Department of Computer Science and Engineering there in 1998.
Early life
Morgado earned a licentiate degree in mechanical engineering (1976) from Instituto Superior Técnico (Technical University of Lisbon) and a Master of Science in computer science (1981) and a Ph.D. in artificial intelligence (1986) from State University of New York at Buffalo.
Career
He was lecturer of computer Science in Millard Fillmore College (State University of New York at Buffalo) in 1980 and Canisius College (1981–1984).
In 1986, together with João Pavão Martins, he founded SISCOG - Sistemas Cognitivos, SA, a startup devoted to Artificial Intelligence. Together they led the company to develop and deploy software systems in railway and metro companies throughout Europe. These systems plan and manage more than 20,000 people, affect the life of millions of passengers, and have been recognized by organisations in Europe and the United States.
Morgado is also involved in the food industry.
He is president of Ernesto Morgado S.A., a rice huller company founded by his grandfather in 1920. Since 2003, he transformed the company's focus from staple foods to value-added products, namely high-quality ready meals based on rice.
He became president of FERM (Federation of European Rice Millers) at its inception in 2002, president of ANIA (Portuguese Rice Millers Association) in 1990, and vice-president of COTArroz (Portuguese Rice Chain Association) in 2004. At FIPA (Portuguese Food Industry Federation), he is currently, and for the second time, president of the board (1997–2003 and 2009) and served as vice-president of its executive committee (1990–1997) and president of the Control Council (2003–2009).
He was a member of CIP (Portuguese Industry Confederation) Council of Presidents (1990–2007).
Author
Morgado is author/co-author of:
References
Artificial intelligence researchers
Year of birth missing (living people)
Living people
Academic staff of the University of Lisbon
Place of birth missing (living people)
University of Lisbon alumni
University at Buffalo alumni |
https://en.wikipedia.org/wiki/Hellenic%20Civil%20Aviation%20Authority | The Hellenic Civil Aviation Authority (), abbreviated HCAA (), is a department of the Greek government under the Ministry of Infrastructure, Transport and Networks. It is involved in air traffic control, aeronautical communications, airport operations, aircraft registration and inspection, licensing of civil air operators, and personnel certification.
The headquarters of the HCAA are located at Glyfada, near the old Ellinikon Airport.
HCAA communications facilities
The Hellenic CAA uses a number of remotely operated VHF radio stations for civil aviation communications at the following locations:
Ymittos (near Athens)
Akarnanika Mountains
Thassos Island
Spergioli
Moustakos
Monastiri
Sitia
Geraneia Mountains
Air Traffic Control radar
The HCAA uses a number of radar stations:
Ymittos (near Athens), primary
Mount Pilion (SSR)
Levkas Island (SSR)
Kythira (SSR)
Crete (SSR)
Athens International Airport, Kamara and Merenta hills (approach)
Hellenikon (approach)
Thessaloniki/Peraia (approach)
Heraklion (approach)
Rhodes (approach)
Corfu (approach)
The radar stations are integrated using the PALLAS system (Phased Automation of the heLLenic ATC radar System).
HCAA Flying Unit
The agency operates a small fleet of aircraft for navigational aid calibration activities. The current fleet is the following:
References
External links
HCAA website
Civil Aviation in Greece, by George Hatzipanagos
Civil aviation in Greece
Greece
Air navigation service providers
Elliniko-Argyroupoli
Aviation organizations based in Greece |
https://en.wikipedia.org/wiki/CompactPCI%20PlusIO | CompactPCI PlusIO is an extension to the PICMG 2.0 CompactPCI industrial standard for modular computer systems.
CompactPCI PlusIO was officially adopted by the PCI Industrial Computer Manufacturers Group PICMG as PICMG 2.30 CompactPCI PlusIO in November 2009. Being 100% compatible with CompactPCI, PICMG 2.30 defines a migration path to the future CompactPCI Serial standard. It defines a fixed rear I/O pin assignment that focuses on modern, fast serial point-to-point connections.
The new technology succeeding parallel CompactPCI comprises both CompactPCI Serial and CompactPCI PlusIO.
History
The CompactPCI standard uses one main bus connector, J1, and defines user I/O pins and a 64-bit extension for the legacy PCI bus on connector J2. J1 and J2 are the only connectors on 3U single Eurocards. The CompactPCI definition for 6U double Eurocards includes additional connectors (J3, J4, J5) for rear I/O. A true rear I/O standard, however, exists only for J3 – through the PICMG 2.16 CompactPCI Packet Switching Backplane specification that defines Ethernet interfaces at the backplane of 6U cards.
Fast serial point-to-point connections have become the state-of-the-art technology and are gradually replacing the classic bus architecture in computers. Also, 3U-based systems are very popular because of their small footprint. This is especially true for modular embedded applications, for example in the field of communications. As a result, several manufacturers tried to implement their own rear I/O concepts using the J2 connector, but had no standard to make their J2 pin assignments compatible with other cards. Another approach to realize serial high-speed interfaces were so-called switched fabrics, which used additional switches and bridges to connect to each other. This involved higher costs and still provided solutions that were too specialized to be compatible with each other.
The CompactPCI standard as it is does not offer a standardized solution for the kind of modular connectivity requested for the future. The additional PICMG 2.30 CompactPCI PlusIO specification provides this connectivity on the well-known platform of CompactPCI. It stays compatible with but extends the existing standard by a new definition of the rear J2 connector, adding a number of serial interfaces to provide fast and standardized rear I/O also on 3U format. Through these serial point-to-point connections, CompactPCI PlusIO also bridges the gap between parallel CompactPCI and the serial CompactPCI Serial standard.
Interfaces
PICMG 2.30 CompactPCI PlusIO standardizes the following interfaces at the rear J2 connector:
4 x PCI Express (one lane each)
2 x Ethernet 1000BASE-T
4 x USB 2.0
4 x SATA/SAS
Backplane Connectors
The PICMG 2.30 extension introduces a new J2 connector type on the plug-in board, an Ultra Hard Metric (UHM) connector with virtual coaxial box shielding technology, which reduces crosstalk at high speeds. This connector supports high frequencies of 5 Gbit/s, even |
https://en.wikipedia.org/wiki/CompactPCI%20Serial | CompactPCI Serial is an industrial standard for modular computer systems. It is based on the established PICMG 2.0 CompactPCI standard, which uses the parallel PCI bus for communication among a system's card components. In contrast to this, CompactPCI Serial uses only serial point-to-point connections.
CompactPCI Serial was officially adopted by the PCI Industrial Computer Manufacturers Group PICMG as PICMG CPCI-S.0 CompactPCI Serial in March 2011. Its mechanical concept is based on the proven standards of IEEE 1101-1-1998 and IEEE 1101-10-1996 (19" technology). CompactPCI Serial includes different connectors that permit very high data rates.
The new technology standard succeeding parallel CompactPCI comprises another specification called PICMG 2.30 CompactPCI PlusIO. This is why CompactPCI Serial and CompactPCI PlusIO as a whole were also called CompactPCI Plus. PICMG's first working title of CompactPCI Serial was CPLUS.0. (See also #Compatibility and Migration.)
CompactPCI Serial backplanes and chassis are developed by Schroff, Elmа, and Pixus Technologies companies, as for the CompactPCI Serial board level electronics – they are developed by MEN Mikro Elektronik, Fastwel, EKF, Emerson Embedded Computing, ADLINK, Data Patterns and Kontron.
History
Fast serial point-to-point connections have become the state-of-the-art technology and are gradually replacing the classic bus architecture in computers. The CompactPCI standard as it is now does not offer a standardized solution for the kind of modular, serial connectivity requested for the future. This is why CompactPCI Serial was defined as the new future standard. It introduces a serial topology while keeping the proven basic concepts of CompactPCI.
Star Topology
Thanks to modern chipset architecture, the structure of computers is slowly changing from bus-based interconnections between interface controllers to a star topology built up of serial point-to-point connections. CompactPCI Serial incorporates this star architecture: one system slot can control up to eight peripheral slots. Two of these connections can be PCI Express x8 fat pipes. At the same time, CompactPCI Serial does not need bridges, switched fabrics, or special backplanes.
The star connection by standard includes PCI Express, SATA/SAS, and USB.
Ethernet Full Mesh Architecture
CompactPCI Serial can connect a total of nine cards in a system (one system slot, eight peripheral) through a full Ethernet mesh that supports the IEEE 802.3 Ethernet standard. In this way the new specification is optimized for symmetrical multiprocessing and redundant system topologies.
Interfaces
The PICMG CPCI-S.0 system slot supports the following interfaces at the backplane connectors:
8 x PCI Express
6 x4 links
2 x8 links (fat pipes)
2 dedicated I²C high-speed buses for the fat pipes
Optional serial RapidIO
8 x SATA/SAS
Supported by SGPIO bus (SFF-8485 specification) for hot swapping
8 x USB 2.0
8 x USB 3.0
8 x Ethernet 10GBASE-T
Optional |
https://en.wikipedia.org/wiki/List%20of%20programmes%20broadcast%20by%20Pogo | This is a list of television programs currently and formerly broadcast by Pogo. The channel was launched on 1 January 2004 and airs mainly animated programmings.
Current programming
Baby Little Singham
Chhota Bheem
Little Krishna
Little Singham
Mighty Little Bheem
Super Bheem
Former programming
Animated series
64 Zoo Lane
A Pup Named Scooby-Doo
The Addams Family (1973 TV series)
The Addams Family (1992 TV series)
The Adventures of Bottle Top Bill and His Best Friend Corky
The Adventures of Rocky and Bullwinkle and Friends
Amar Chitra Katha Tales
Andy Pirki
Anpanman
Appu – The Yogic Elephant
Archie's Weird Mysteries
Astro Boy
Babar
Baby Little Singham
Baby Looney Tunes
The Backyardigans
Bandbudh Aur Budbak
Barbie Dreamtopia
The Batman
Batman: The Animated Series
Be Cool, Scooby-Doo!
Bo on the Go
Bob the Builder
Bola Kampung
Bunnicula
The Bugs Bunny Show
Caillou
Chamki Ki Duniya
Chaplin & Co
Corneil and Bernie
Dabangg: The Animated Series
Dorothy and the Wizard of Oz
Dragon Tales
Duck Dodgers
Ekans - Snakes Awake
Ethelbert the Tiger
The Flintstones
Foster's Home for Imaginary Friends
Franny's Feet
Garfield and Friends
The Genie Family
Gon
Gordon the Garden Gnome
Grizzy and the Lemmings
The Gutsy Frog
Hagemaru
The Happos Family
Harry and His Bucket Full of Dinosaurs
He-Man and the Masters of the Universe
Inspector Gadget
Jackie Chan Adventures
The Jetsons
The Jungle Book
Justice League
Justice League Unlimited
Kalari Kids
Kimba the White Lion
King Arthur's Disasters
Kipper
Kirby: Right Back at Ya!
Kiteretsu
The Koala Brothers
Kong: The Animated Series
Kumbh Karan
Kyorochan
The Life and Times of Juniper Lee
LambuG TinguG
Little Krishna
Little Red Tractor
Little Robots
Little Singham
Loonatics Unleashed
Looney Tunes
Make Way for Noddy
Miffy and Friends
Mighty Little Bheem
Mighty Raju
Mirmo!
The Monster Kid
Mojacko
Mr. Bean: The Animated Series
Mr. Magoo
The Mr. Men Show
My Little Pony: Friendship Is Magic
My Three Daughters
The New Adventures of Hanuman
The New Adventures of Peter Pan
The New Batman Adventures
New Looney Tunes
The New Woody Woodpecker Show
Ninja Boy
Obocchama Kun
Oddbods
Oswald
The Pandavas
Panshel World
Pingu in the City
Pet Alien
Pingu
Pink Panther
The Pink Panther Show
Pink Panther and Pals
Planet Grabo
Pokémon
The Popeye Show
Postman Pat
The Powerpuff Girls
Richie Rich
The Road Runner Show
Robotboy
Roll No 21
Rupert Bear, Follow the Magic...
Sabrina: The Animated Series
Sabrina: Secrets of a Teenage Witch
Scan2Go
The Scooby-Doo Show
Shadow of the Elves
Shaktimaan: The Animated Series
Sheep in the Big City
Shopkins
Singhasan Battisi
Sitting Ducks
Skyland
The Smurfs
Smaashhing Simmba
The Spectacular Spider-Man
Spider-Man: The New Animated Series
Stickin' Around
Strawberry Shortcake
Strawberry Shortcake's Berry Bitty Adventures
Stuart Little: The Animated Series
Superman: The Animated Series
|
https://en.wikipedia.org/wiki/Data%20monitoring%20switch | A data monitoring switch is a networking hardware appliance that provides a pool of monitoring tools with access to traffic from a large number of network links. It provides a combination of functionality that may include aggregating monitoring traffic from multiple links, regenerating traffic to multiple tools, pre-filtering traffic to offload tools, and directing traffic according to one-to-one and many-to-many port mappings.
Data monitoring switches enable organizations to use their monitoring tools more efficiently, centralize traffic monitoring functions, and share tools and traffic access between groups. Some of these devices also provide functionality that helps justify tool purchases and simplify deployment and management of the device itself.
Several other terms have been used to describe this class of devices, including data access switch, tool aggregator, network packet broker, net tool optimizer, and distributed filter tap.
Function
A data monitoring switch typically provides 24 to 38 ports in a 1U 19-inch chassis, with higher port density devices expected in the future (ask about dimensions from the vendor - devices with higher port density or many card slots may be 2U or larger). Ports may be dedicated as network inputs or tool output, or maybe configurable as either, with most products trending toward the latter. Network input ports may be paired to provide in-line connectivity (integrated Tap function), or out of band (mirrored) to take input from external network Taps or network switch SPAN ports. Some devices can interconnect chassis to configure logical systems with hundreds of ports, although user interface complexity can serve as a limiting factor in many products.
When several monitoring tools are connected to the data monitoring switch's tool ports, copies of traffic from any of the network ports can be switched to any of the tools using the data monitoring switch's management interface. A unique characteristic of the data monitoring switch, as opposed to matrix switches and aggregating Taps, is that it can support a flexible set of port mappings including:
One network link to one monitoring tool
One network link to many monitoring tools (regeneration)
Many network links to one monitoring tool (aggregation)
Many network links to many monitoring tools (dynamic many-to-many connectivity)
In addition to directing monitoring traffic, data monitoring switches are capable of filtering traffic by Layer 2 to Layer 4 protocol criteria such as VLAN or IP address, enabling only traffic of interest to be sent to specific tools. This capability can prevent tool oversubscription and facilitate drilling down on issues.
As this is still a relatively new set of technologies, there are several different approaches to the hardware and software configurations. As such, each product sports benefits that none of the competitors includes. Some data monitoring switches offer different management interfaces (fully integrated GUI, autom |
https://en.wikipedia.org/wiki/Parity%20learning | Parity learning is a problem in machine learning. An algorithm that solves this problem must find a function ƒ, given some samples (x, ƒ(x)) and the assurance that ƒ computes the parity of bits at some fixed locations. The samples are generated using some distribution over the input. The problem is easy to solve using Gaussian elimination provided that a sufficient number of samples (from a distribution which is not too skewed) are provided to the algorithm.
Noisy version ("Learning Parity with Noise")
In Learning Parity with Noise (LPN), the samples may contain some error. Instead of samples (x, ƒ(x)), the algorithm is provided with (x, y), where for random boolean
The noisy version of the parity learning problem is conjectured to be hard.
See also
Learning with errors
References
Avrim Blum, Adam Kalai, and Hal Wasserman, “Noise-tolerant learning, the parity problem, and the statistical query model,” J. ACM 50, no. 4 (2003): 506–519.
Adam Tauman Kalai, Yishay Mansour, and Elad Verbin, “On agnostic boosting and parity learning,” in Proceedings of the 40th annual ACM symposium on Theory of computing (Victoria, British Columbia, Canada: ACM, 2008), 629–638, http://portal.acm.org/citation.cfm?id=1374466.
Oded Regev, “On lattices, learning with errors, random linear codes, and cryptography,” in Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (Baltimore, MD, USA: ACM, 2005), 84–93, http://portal.acm.org/citation.cfm?id=1060590.1060603.
Machine learning |
https://en.wikipedia.org/wiki/Learning%20with%20errors | In cryptography, Learning with errors (LWE) is a mathematical problem that is widely used in cryptography to create secure encryption algorithms. It is based on the idea of representing secret information as a set of equations with errors. In other words, LWE is a way to hide the value of a secret by introducing noise to it. In more technical terms, it refers to the computational problem of inferring a linear -ary function over a finite ring from given samples some of which may be erroneous. The LWE problem is conjectured to be hard to solve, and thus to be useful in cryptography.
More precisely, the LWE problem is defined as follows. Let denote the ring of integers modulo and let
denote the set of -vectors over . There exists a certain unknown linear function , and the input to the LWE problem is a sample of pairs , where and , so that with high probability . Furthermore, the deviation from the equality is according to some known noise model. The problem calls for finding the function , or some close approximation thereof, with high probability.
The LWE problem was introduced by Oded Regev in 2005 (who won the 2018 Gödel Prize for this work), it is a generalization of the parity learning problem. Regev showed that the LWE problem is as hard to solve as several worst-case lattice problems. Subsequently, the LWE problem has been used as a hardness assumption to create public-key cryptosystems, such as the ring learning with errors key exchange by Peikert.
Definition
Denote by the additive group on reals modulo one.
Let be a fixed vector.
Let be a fixed probability distribution over .
Denote by the distribution on obtained as follows.
Pick a vector from the uniform distribution over ,
Pick a number from the distribution ,
Evaluate , where is the standard inner product in , the division is done in the field of reals (or more formally, this "division by " is notation for the group homomorphism mapping to ), and the final addition is in .
Output the pair .
The learning with errors problem is to find , given access to polynomially many samples of choice from .
For every , denote by the one-dimensional Gaussian with zero mean and variance
, that is, the density function is where , and let be the distribution on obtained by considering modulo one. The version of LWE considered in most of the results would be
Decision version
The LWE problem described above is the search version of the problem. In the decision version (DLWE), the goal is to distinguish between noisy inner products and uniformly random samples from (practically, some discretized version of it). Regev showed that the decision and search versions are equivalent when is a prime bounded by some polynomial in .
Solving decision assuming search
Intuitively, if we have a procedure for the search problem, the decision version can be solved easily: just feed the input samples for the decision problem to the solver for the search problem. Denote the given sa |
https://en.wikipedia.org/wiki/IOUG | The Independent Oracle Users Group (IOUG) represents the voice of Oracle technology and database professionals and empowers them to be more productive in their business and careers by:
Delivering education
Sharing best practices
Providing technology direction and networking opportunities
Incorporating the elements of the G.R.E.A.T. strategy, the IOUG empowers Oracle database and development professionals by delivering the highest quality:
Information
Education
Networking
Advocacy
The IOUG helps each member:
Enhance their skill set with technical content created for users by users
Increase the technical advantage of their organization
Boost their individual marketability
Gain access to a network of peers for collaboration and information exchange
Voice opinions to Oracle about their products, services and policies
This is one of many Oracle User Groups formed as a self-supporting forum for discussion, education and networking outside of the formal Oracle Corporation-sponsored community forums on the Oracle TechNet Discussion Forums.
History
The IOUG was founded in 1993.
Effective 17 September 2005, IOUG changed their name from International Oracle Users Group to the Independent Oracle Users Group.
The last IOUG LIVE conference was hosted in 2005. Starting from 2006, IOUG has jointly participated in the Collaborate unified conference with OAUG and Quest Oracle Community.
In March 2019, it was announced that the IOUG will be joining the Quest Oracle Community. The deal was finalized in May 2019.
Conferences
2001 - IOUG Live, April 29-May 3 in Orlando, FL
2002 - IOUG Live, April 14–18 in San Diego, CA
2003 - IOUG Live, April 28–30, Orlando, FL
2004 - IOUG Live, April 18–22 in Toronto, Canada
2005 - IOUG Live, May 1–5 in Orlando, FL
2006 - Collaborate, April 23–27 in Nashville, TN
2007 - Collaborate, April 15–19 in Las Vegas, NV
2008 - Collaborate, April 13–17 in Denver, CO
2009 - Collaborate, May 3–7 in Orlando, FL
2010 - Collaborate, April 18–22 in Las Vegas, NV
2011 - Collaborate, April 10–14 in Orlando, FL
2012 - Collaborate 12, April 22–26 in Las Vegas, NV
2013 - Collaborate 13, April 7–11 in Denver, CO
2014 - Collaborate 14, April 7–11 in Las Vegas, NV
2015 - Collaborate 15, April 12-16 in Las Vegas, NV
2016 - Collaborate 16, April 10-14 in Las Vegas, NV
2017 - Collaborate 17, April 2-6 in Las Vegas, NV
2018 - Collaborate 18, April 22-26 in Las Vegas, NV
2019 - Collaborate 19, April 7-11 in San Antonio, TX
Related Affiliates
Quest Oracle Community - a 55,000+ international community for Oracle's JD Edwards, PeopleSoft, Cloud Applications, Database & Technology users
Oracle Applications & Technology Users Group (OATUG) - the user community that provides support for Oracle applications & technology users (formerly OAUG)
Oracle Developer Tools Users Group (ODTUG) - the user community of developers supporting creation of applications and toolsets for use with Oracle application and database technology
United Kingd |
https://en.wikipedia.org/wiki/Moxie%20Marlinspike | Moxie Marlinspike is an American entrepreneur, cryptographer, and computer security researcher. Marlinspike is the creator of Signal, co-founder of the Signal Technology Foundation, and served as the first CEO of Signal Messenger LLC. He is also a co-author of the Signal Protocol encryption used by Signal, WhatsApp, Google Messages, Facebook Messenger, and Skype.
Marlinspike is a former head of the security team at Twitter and the author of a proposed SSL authentication system replacement called Convergence. He previously maintained a cloud-based WPA cracking service and a targeted anonymity service called GoogleSharing.
Career
Marlinspike began his career working for several technology companies, including enterprise infrastructure software maker BEA Systems Inc.
In 2010, Marlinspike was the chief technology officer and co-founder of Whisper Systems, an enterprise mobile security startup company. In May 2010, Whisper Systems launched TextSecure and RedPhone. These were applications that provided end-to-end encrypted SMS messaging and voice calling, respectively. Twitter acquired the company for an undisclosed amount in late 2011. The acquisition was done "primarily so that Mr. Marlinspike could help the then-startup improve its security". During his time as Twitter's head of cybersecurity, the firm made Whisper Systems' apps open source.
Marlinspike left Twitter in early 2013 and founded Open Whisper Systems as a collaborative open source project for the continued development of TextSecure and RedPhone. At the time, Marlinspike and Trevor Perrin started developing the Signal Protocol, an early version of which was first introduced in the TextSecure app in February 2014. In November 2015, Open Whisper Systems unified the TextSecure and RedPhone applications as Signal. Between 2014 and 2016, Marlinspike worked with WhatsApp, Facebook, and Google to integrate the Signal Protocol into their messaging services.
On February 21, 2018, Marlinspike and WhatsApp co-founder Brian Acton announced the formation of the Signal Technology Foundation and its subsidiary, Signal Messenger LLC. Marlinspike served as Signal Messenger's first CEO until stepping down on January 10, 2022.
Research
SSL stripping
In a 2009 paper, Marlinspike introduced the concept of SSL stripping, a man-in-the-middle attack in which a network attacker could prevent a web browser from upgrading to an SSL connection in a way that would likely go unnoticed by a user. He also announced the release of a tool, sslstrip, that would automatically perform these types of man-in-the-middle attacks. The HTTP Strict Transport Security (HSTS) specification was subsequently developed to combat these attacks.
SSL implementation attacks
Marlinspike has discovered a number of different vulnerabilities in popular SSL implementations. Notably, he published a 2002 paper on exploiting SSL/TLS implementations that did not correctly verify the X.509 v3 "BasicConstraints" extension in public key certifi |
https://en.wikipedia.org/wiki/Sequential%20algorithm | In computer science, a sequential algorithm or serial algorithm is an algorithm that is executed sequentially – once through, from start to finish, without other processing executing – as opposed to concurrently or in parallel. The term is primarily used to contrast with concurrent algorithm or parallel algorithm; most standard computer algorithms are sequential algorithms, and not specifically identified as such, as sequentialness is a background assumption. Concurrency and parallelism are in general distinct concepts, but they often overlap – many distributed algorithms are both concurrent and parallel – and thus "sequential" is used to contrast with both, without distinguishing which one. If these need to be distinguished, the opposing pairs sequential/concurrent and serial/parallel may be used.
"Sequential algorithm" may also refer specifically to an algorithm for decoding a convolutional code.
See also
Online algorithm
Streaming algorithm
References
Algorithms |
https://en.wikipedia.org/wiki/Naval%20Computer%20and%20Telecommunications%20Station%2C%20Far%20East | The Naval Computer and Telecommunications Station (NCTS) Far East is a Navy military unit headquartered in Yokosuka, Japan. The unit consists of nine geographically-dispersed sites in Japan, South Korea, Singapore, and Diego Garcia. NCTS Far East's mission is to "operate and defend mission critical, Navy warfighting networks and communications systems necessary for U.S. Naval, Joint, and Coalition Commanders to conduct secure command and control in the U.S. Indo-Pacific Command (USINDOPACOM) theater of operations."
History
1951–1960
NAVCOMTELSTA Far East was originally designated as Naval Communications Facility, Yokosuka Japan; it was commissioned on 8 January 1951, after the outbreak of the Korean War. In December 1952 U.S. Naval Radio Receiving Facility Kami Seya, Japan was completed, and the Security Group Department and general-service receivers were moved to Kami Seya. During the war, the rest of NAVCOMMFAC Yokosuka moved to Kami Seya. In 1960, the command was re-designated U.S. Naval Communications Facility Japan and relocated to Yokosuka. The following year, the command was again re-designated as U.S. Naval Communications Station, Japan.
1990s–present
This name lasted until 1991, when it was changed to U.S. Naval Computer and Telecommunications Station, Japan to acknowledge the increasing reliance on computers and telephones in telecommunications. Also in 1991, NTCCs Atsugi and Sasebo and NAVCOMM Dets Okinawa and Misawa were functionally transferred to NAVCOMTELSTA Japan. 1993 saw the transfer of Base Communications Offices (BCOs) at Atsugi, Sasebo and Yokosuka to NAVCOMTELSTA Japan. In 1995 another name change to U.S. Naval Computer and Telecommunications Station, Far East occurred, with the transfer of the Communications Department from Commander Fleet Activities Chinhae, Korea to this command and the establishment of NAVCOMM Det Chinhae.
External links
Official site
Computer and Telecommunications Area Master Station Pacific
Military installations established in 1951 |
https://en.wikipedia.org/wiki/Network%20Description%20Language | Network Description Language (NDL) is a tool to reduce the complexity as networks evolve into the future. NDL enables both humans and machines to have a better grasp on today’s highly evolved networks to ease time consuming and tedious tasks being performed by humans. Through the use of Resource Description Framework (RDF), researchers have been able to create an ontology for complex networks, thus creating a clear view of any network.
NDL has proven itself useful in solving many issues as it pertains to the operation of hybrid networks, allowing the creation of network maps and facilitating path finding algorithms. SURFnet6, a Dutch national research and education network was one such network that has utilized NDL for lightpath and IP service planning.
External links
SNE NDL
IEEE Xplore - Using the Network Description Language in Optical Networks
Network theory
Hardware description languages |
https://en.wikipedia.org/wiki/List%20of%20Mobile%20Suit%20Zeta%20Gundam%20characters | Mobile Suit Zeta Gundam is a Japanese science fiction anime television series that originally aired on Nagoya Broadcasting Network between March 2, 1985, and February 22, 1986. Mobile Suit Zeta Gundam featured many new characters and several returning characters from the earlier Mobile Suit Gundam anime television series.
Protagonists
A.E.U.G
The protagonist of Mobile Suit Zeta Gundam, Kamille Bidan is a troubled teen who has become estranged from his parents, both mobile suit developers. A scuffle with Titans officer Jerid Messa over his female-sounding name begins a series of events that eventually results in Kamille helping Quattro Bajeena to steal the RX-178 Gundam Mk-II prototypes and the deaths of both of his parents. Under the tutelage of Quattro and former Titans officer Emma Sheen, Kamille later became one of AEUG's top pilots during the Gryps Conflict—first using the stolen Gundam Mk-II and later in his personally designed Zeta Gundam. Over the course of the series, Kamille's rivalry with Jerid intensifies as both end up killing friends and loved ones of the other. One such example is the cyber-Newtype Four Murasame, whom Kamille met while in Hong Kong and fell in love with. When the two reunite at the Battle of Kilimanjaro, Four is killed by Jerid while attempting to save Kamille's life. Although Kamille survives the Gryps Conflict, the battle with Paptimus Scirocco leaves him in a near comatose state. According to Tomino, Kamille has the strongest Newtype powers in the series.
Kamille, along with five other notable mecha and pilots from the various Gundam series, were recognized in the second set of "Anime Heroes and Heroines" stamps, released in Japan in 2005. In an interview for the laserdisc release of Zeta Gundam, Tomino states that Kamille was named and modeled after Camille Claudel, a sculptor and lover of Auguste Rodin who became deranged and ended her life in commitment. In the Animage Anime Grand Prix poll from 1986 Kamille was voted the first most popular male anime character. He has also been voted as the eighth most popular male character from the 1980s by Newtype readers.
Fa Yuiry is the next-door neighbor of Kamille Bidan before the Gryps Conflict begins. After Kamille helps the AEUG officer Quattro Bajeena steal two Gundam Mk-II prototypes, the Titans arrest Fa's parents because of her close association with Kamille. Fa escapes with the help of Bright Noah and reunites with Kamille when Bright's shuttle is rescued by the AEUG ship Argama. Having sided with the AEUG, Fa stays on the Argama and becomes the pilot of the Methuss, rotating with Reccoa Londe. She also becomes a surrogate mother to two war orphans, Shinta and Qum, after they are sent to the Argama by Lt. Quattro. Fa and Kamille constantly quarrel with each other, so much so that the crew of the Argama refers to the quarreling as their hobby. However, Fa becomes jealous whenever Kamille shows an interest in another female. Fa is one of the few ch |
https://en.wikipedia.org/wiki/Teisei%20Gakuen%20Junior%20College | is a junior college in Tokyo, Japan, and is part of the Teisei Gakuen network.
The institute was founded in 1930 by Maki Takahashi, developed as a Junior College in 2009.
External links
Teisei Gakuen Junior College
Educational institutions established in 1930
Japanese junior colleges
1930 establishments in Japan
Universities and colleges in Tokyo |
https://en.wikipedia.org/wiki/My%20Kitchen%20Rules | My Kitchen Rules (often abbreviated as MKR) is an Australian competitive cooking game show broadcast on the Seven Network since 2010. The show is currently hosted and judged by chefs Manu Feildel and Colin Fasnidge, with Feildel being the only judge who has appeared in every season of the show. Fellow chef Pete Evans co-hosted until his departure after season 11, following controversy about his personal views and social media posts. Other celebrity chefs and food critics frequently appear as guest judges or mentors in the kitchen. The series was originally produced by the team who created the Seven reality show My Restaurant Rules, and was put into production based on the success of Network 10's MasterChef Australia.
For many years, the program performed strongly in the ratings and was regularly one of the highest rated programs on Australian television, with the finales of each season consistently ranking amongst the top 10 highest rated programs of the year. However ratings declined notably during season 10 in 2019, and with further significant declines for season 11 in 2020, commentators speculated that 2020 would be its final season.
Seven did not renew the series at their annual upfronts in October 2020, but suggested the show may return in future. During Seven’s annual upfronts, the series was confirmed to return for a twelfth season in 2022. In December 2021, Feildel was announced to be returning as a judge. In April 2022, it was announced Nigella Lawson and Matt Preston will be joining the series as judges alongside Feildel with fellow returning judge Colin Fassnidge appearing as a judge in Kitchen HQ alongside Curtis Stone with a quest appearance from new judge Gary Mehigan. In October 2022, the series was renewed for a 13th season which will air on 4 September 2023. In April 2023, it was announced Fassnidge will become a main judge and co-host alongside Feildel, with Lawson returning as judge for the finals. There was no word on whether Preston will return to the show.
Format
Contestants
The Australian show initially had teams of two contestants with pre-existing relationships—from New South Wales, Queensland, South Australia, Victoria and Western Australia—competing against each other to "transform an ordinary home into an instant restaurant complete with theme and table decorations for one pressure-cooker night." From 2011, the number of competitors grew as teams from Tasmania joined the show. A team from New Zealand took part only in the third season. In the fourth season, there were fifteen teams made up of two teams from each state, plus three additional teams—the gatecrashers—from New South Wales, Victoria and Western Australia. Season 5 introduced a team from the Australian Capital Territory, whilst season 11 marks the first time that there was not a team from South Australia.
Judging panel
Series Judges – Celebrity chef Manu Feildel has appeared in every season in the show. Pete Evans appeared alongside Feidel until seaso |
https://en.wikipedia.org/wiki/Distributed%20firewall | A distributed firewall is a security application on a host machine of a network that protects the servers and user machines of its enterprise's networks against unwanted intrusion. A firewall is a system or group of systems (router, proxy, or gateway) that implements a set of security rules to enforce access control between two networks to protect the "inside" network from the "outside" network. They filter all traffic regardless of its origin—the Internet or the internal network. Usually deployed behind the traditional firewall, they provide a second layer of defense. The advantages of the distributed firewall allow security rules (policies) to be defined and pushed out on an enterprise-wide basis, which is necessary for larger enterprises.
Basic Working
Distributed firewalls are often kernel-mode applications that sit at the bottom of the OSI stack in the operating system. They filter all traffic regardless of its origin—the Internet or the internal network. They treat both the Internet and the internal network as "unfriendly". They guard the individual machine in the same way that the perimeter firewall guards the overall network. Distributed firewall function rests on three notions:
A policy language that states what sort of connections are permitted or prohibited,
Any of a number of system management tools, such as Microsoft's SMS or ASD, and
IPSEC, the network-level encryption mechanism for Internet Protocol (TCP, UDP, etc.)
The basic idea is simple. A compiler translates the policy language into some internal format. The system management software distributes this policy file to all hosts that are protected by the firewall. And incoming packets are accepted or rejected by each "inside" host, according to both the policy and the cryptographically verified identity of each sender.
Features
A central management system for designing the policies,
A transmission system to transmit these policies, and
Implementation of the designed policies at the client end.
Central Management System
The security policy of distributed firewalls are defined centrally, and the enforcement of the policy takes place at each endpoint (hosts, routers, etc.) Centralized management is the ability to populate servers and end-users machines, to configure and "push out" consistent security policies, which helps to maximize limited resources. The ability to gather reports and maintain updates centrally makes distributed security practical. This feature of distributed firewalls helps in two ways. Firstly, remote end-user machines can be secured. Secondly, they secure critical servers on the network preventing intrusion by malicious code and "jailing" other such code by not letting the protected server be used as a launchpad for expanded attacks.
Policy Transmission System
The distribution of the policy, or security rules, can be different and varies with the implementation. It can be either directly pushed to end systems, or pulled when necessary.
Pull |
https://en.wikipedia.org/wiki/Junior%20College%20of%20Commerce%20Nagasaki%20University | is a junior college in Nagasaki, Japan, and is part of the Nagasaki University network. The institute was founded in 1951 and abolished in 2000.
Universities and colleges established in 1951
Japanese junior colleges
Educational institutions disestablished in 2000
Universities and colleges in Nagasaki Prefecture
1951 establishments in Japan |
https://en.wikipedia.org/wiki/Mahjong%20solitaire | Mahjong solitaire (also known as Shanghai solitaire, electronic or computerized mahjong, solitaire mahjong or simply mahjong) is a single-player matching game that uses a set of mahjong tiles rather than cards. It is more commonly played on a computer than as a physical tabletop game.
Its name comes from the four-player game mahjong, but it is played entirely differently.
Play
The 144 tiles are arranged in a four-layer pattern with their faces upwards. A tile is said to be open or exposed if it can be moved either left or right without disturbing other tiles. The goal is to match open pairs of identical tiles and remove them from the board, exposing the tiles under them for play. The game is won when all pairs of tiles have been removed from the board, and lost if the remaining tiles contain no exposed pairs.
Mathematical analysis
Playing Mahjong solitaire optimally in the sense to maximize the probability of removing all tiles is PSPACE-complete, and the game is NP-complete if looking below tiles is allowed. It has been proven that it is PSPACE-hard to approximate the maximum probability of removing all tiles within a factor of , assuming that there are arbitrarily many quadruples of matching tiles and that the hidden tiles are uniformly distributed. The perfect-information version of this puzzle is where the player knows, before the game starts, the position of every tile. In this case, however, it is NP-complete to decide whether all tiles can be removed.
An analysis of ten million games with the default layout, "the turtle", found that about 3 percent of the turtles cannot be solved even when looking below tiles is allowed.
Variations
Mahjong solitaire can be played using genuine tiles and a special wooden frame for set-up. Usually though, it is played in an electronic form as a computer game. This removes the tedium of set-up and the temptation to cheat. Some electronic Mahjong solitaire games offer extra options, such as:
Shuffling the tiles;
Changing the tile set and patterns from the traditional tiles to flowers, jewels or other items that may be easier to match up at a glance;
Playing a series of different layouts with varying levels of difficulty (usually given Chinese-looking names such as 'the ox' or 'the snake');
Adding "wildcard tiles" and other tiles that have special functions.
Mahjong solitaire can be played either solo or with a partner, in which case the aim is to accumulate the most pairs, to be the last one to match a pair, or to score the most points. Points are gained for each pair removed, with bonus points for removing matched pairs in sequence or removing pairs in sequence that are parts of sets. Using traditional mahjong tiles, the sets include the dragons, the flowers, the seasons, and the winds.
Some implementations offer to shuffle the tiles when there are no exposed pairs remaining, making it almost always possible for the player to complete the game.
Computer game history
The computer game was origin |
https://en.wikipedia.org/wiki/SEQ%20Water%20Grid | The SEQ Water Grid is a region-wide, long term, water supply scheme that provides a sustainable water infrastructure network for the South East region of Queensland, Australia. The project was the largest urban response to the drought in Australia, which severely affected water supplies in Brisbane and surrounds, particularly between 2004 and 2007. The basic component of the project was a network of potable bulk water pipelines that connect areas that have an oversupply of water to those areas lacking water. The project went online in October 2008 and by November 2008 parts of the region were receiving a diversified supply of water for the first time.
Features and structure
The SEQ Water Grid was initially managed by a partnership between Seqwater, LinkWater and the SEQ Water Grid Manager. The total cost of the project was 6.9 billion. On 1 January 2013, the SEQ Water Grid Manager, LinkWater, Seqwater and parts of Queensland Water Commission were amalgamated into the Queensland Bulkwater Authority trading as Seqwater. The authority is a state-owned corporation that owns and operates the SEQ Bulk Water Supply System or the Bulk Water Supply Chain.
The plan for the Water Grid was originally laid out in the Queensland Water Commission's South East Queensland Water Strategy, a 50-year strategy to maintain adequate water supply. The main objectives are to respond to the drought and provide long term water security for the region, particularly to avoid the need to place severe water restrictions on residents. Other aims of the Water Grid are to move risk away from individual water storage facilities to the regional level and to efficiently coordinate the utility of water sources in South East Queensland.
Components
Existing facilities that have become part of the Water Grid include Wivenhoe Dam, Somerset Dam, North Pine Dam and Baroon Pocket Dam, along with eight other dams that make up the 12 connected dams. Part of the project involved the construction of the Gold Coast Desalination Plant to convert sea water to drinking water and the Western Corridor Recycled Water Scheme to purify treated wastewater for supply to power stations and industrial and agricultural customers. Purified recycled water will also be added to the water supply once combined dam levels fall below 40 per cent.
Two major pipelines, called the Northern and Southern Pipeline Interconnectors, link water storage facilities near Gympie in the north of the region and the Gold Coast area, south of Brisbane. Wyaralong Dam and the completed Cedar Grove Weir are part of the plans. These water reservoirs provide significant new supply and are needed to meet the region's growing demand up until 2050. In 2008 Lake Manchester Dam and Enoggera Dam were reactivated to supplement supply. The project also encompasses a raising of the Hinze Dam dam wall and the connection of the Leslie Harrison Dam and Ewen Maddock Dam to the regional network.
Current SEQ Water Grid bulk water assets
12 conn |
https://en.wikipedia.org/wiki/OKKO | OKKO () is the network of filling complexes (gas stations) in Ukraine. The owner of OKKO network is open joint-stock company Galnaftogaz.
First OKKO filling station was opened in 1999 in Stryi, Lviv Oblast, and the first large OKKO filling station with a large shop, cafe and portal autowashing began to operate in Lviv since 2000.
As of 2019 OKKO network consists of 400 modern filling stations throughout unoccupied Ukraine. The company also has 2 OKKO river filling stations – in Kyiv and Dnipro, and one OKKO Compressed natural gas station within the network. The OKKO group has number of own food chains like "A la minute" (fast serving of European cuisine), "Pasta Mia" (Italian cuisine), "Meiwei" (Pan-Asian cuisine).
In August 2018 the Security Service of Ukraine searched several offices of the company in Kyiv and Lviv under suspicion in financing pseudo-governments in Eastern Ukraine, the main shareholder of the company Vitalii Antonov denied any of the accusations stating that the company is not involved in any kind of operations that it is being investigated for and lost 8% of it assets ($80 million) when Donbas and Crimea were occupied by Russia. In May 2019 the company was fined by the Anti-Monopoly Committee of Ukraine for price collusion along with WOG and SOCAR.
History
The first OKKO filling station was opened in 1999 in Stryi, Lviv Oblast, and the first large OKKO filling station with a large shop, cafe and portal autowashing began to operate in Lviv in 2000. While OKKO brand appeared in 1999, it was created based on several smaller oil and gas enterprises in Zakarpattia and Prykarpattia with the first company "Ivano-Frankivsknaftoproduct" established on 31 August 1993. By late 1990s the control packages of stock in those organizations was obtained by the Financial and Investment Energy Holding (FIEH) uniting them under one brand.
Since 2002, 55 filling station are operating within the OKKO network and the first OKKO branded filling station was opened in the capital city.
In 2006 first two large OKKO route complexes – in Kalynivka village near Kyiv and in Chop in Zakarpattya region – were opened. OKKO filling complex in Chop entered the Ukrainian book of records as the biggest filling complex in Ukraine by area and by the amount of services. That same year, the first mobile laboratory for fuel quality control began operating in the network.
In 2007, the first OKKO gas compressor station started operating in Burshtyn, Ivano-Frankivska region. The first A la minute branded fast food restaurant was opened at OKKO filling station in Skole, Lviv region. The new premium fuel Pulls 95 was launched into the market. The company’s market share increased to 7.1 per cent – the third result in Ukraine.
2008 : Concern Galnaftogaz joined Go Green Declaration of UN Global Compact. The principles of ‘green office’ were being introduced in the Company. This same year it was decided to implement the principles of Accessibility Program (wheelchair |
https://en.wikipedia.org/wiki/Okinawa%20University%20Junior%20College | was a junior college in Naha, Okinawa, Japan, and was part of the Kakazugakuen network.
The institute was founded in 1958 and closed in 2000.
Japanese junior colleges
Universities and colleges in Okinawa Prefecture |
https://en.wikipedia.org/wiki/Robin%20Walker%20%28disambiguation%29 | Robin Walker is a British politician.
Robin Walker may also refer to:
Robin Walker (game designer), creator of the Team Fortress series of computer games
Robin Walker, Irish architect, best known for his work with firm Scott Tallon Walker
See also
Rob Walker (disambiguation) |
https://en.wikipedia.org/wiki/Tobii | Tobii AB (formerly known as Tobii Technology AB) is a Swedish technology company that develops and sells products for eye tracking and attention computing.
History
Founded in 2001, Tobii is a developer of eye tracking solutions for use in scientific research, extended reality headsets, commercial devices, and custom-built machines. Tobii is based in Stockholm, Sweden, with offices in the US, Japan, China, Germany, Norway, and Ukraine. Tobii became publicly traded on April 22, 2015, on the Nasdaq Stockholm. The company was founded by John Elvesjo, Mårten Skogö, and Henrik Eskilsson who handed over the CEO role to Anand Srivatsa toward the end of 2021. In April of 2022, Tobii officially merged the Tobii Group, and two of its former three business units Tobii Pro and Tobii Tech into a single entity Tobii AB. The third business unit, Tobii Dynavox, a previous acquisition of US based DynaVox, was spun off in October 2021.
In 2008, Tobii won the Swedish Grand Award of Design together with the design company Myra Industrial Design, for the technology and design in their eye controlled screens. In 2010, Tobii won the SIME Grand Prize for having the most innovative technology concept. In 2011, Tobii Glasses won the red dot design award, an international product design competition and later the same year, Tobii won the Bully Award. In 2012, Tobii took home the award for best prototype at the consumer technology trade show 2012 CES, and Laptop Magazine named Tobii the winner in its best new technology category.
Products
Tobii's produces eye trackers, integration platforms, and related data-analysis software and development kits for use in scientific research, gaming, and marketing and consumer insights. Tobii sells its products directly and through a global reseller network.
Owing to the connection between eye movements and cognitive function, Tobii's products are widely used by scientific researchers in a range of fields including psychology, neuroscience, and visual perception. Eye tracking is used by consumer retail businesses to assess the efficiency of store layouts, for example, product placement, and advertising. Tobii's integration platforms are suitable for embedding in commercial devices like PCs and XR headsets, as well as industrial applications and fields such as advanced driver monitoring, consumer computing and gaming.
References
External links
Companies based in Stockholm
Companies established in 2001
Technology companies of Sweden
Companies listed on Nasdaq Stockholm
Vision |
https://en.wikipedia.org/wiki/Torsten%20Suel | Torsten Suel is a professor in the Department of Computer Science and Engineering at the New York University Tandon School of Engineering. He received his Ph.D. in 1994 from the University of Texas at Austin under the supervision of Greg Plaxton. He works on the subjects of implementation of bulk synchronous parallel computation, streaming algorithms for histograms, join operations in databases, distributed algorithms for dominating sets, and web crawler algorithms.
A conference paper he co-authored in 2011 introduces fast retrieval techniques that were integrated into the Apache Lucene search engine library.
Selected bibliography
According to Google Scholar's citation list, Suel has 34 journal articles or conference proceedings cited 34 or more times. His five highest cited peer-reviewed papers and IEEE conference proceedings are:
Jonathan Hill, Bill McColl, Dan C Stefanescu, Mark W Goudreau, Kevin Lang, Satish B Rao, Torsten Suel, Thanasis Tsantilas, Rob H Bisseling, "BSPlib: The BSP programming library" Parallel Computing 24(13), pp. 1947–1980. (1999) Cited 352 times according to Google Scholar; Cited 99 times in Scopus,
HV Jagadish, Nick Koudas, S Muthukrishnan, Viswanath Poosala, Ken Sevcik, Torsten Suel "Optimal histograms with quality guarantees" Proceedings of the International Conference on Very Large Data Bases (2002) pp. 275–286, IEEE, cited 325 times, according to Google Scholar
Vladislav Shkapenyuk, Torsten Suel "Design and implementation of a high-performance distributed web crawler" pp. 357–368 Data Engineering 2002: Proceedings. 18th International Conference on Data Engineering, IEEE,(2002) Cited 240 times, according to Google Scholar
Lujun Jia, Rajmohan Rajaraman, Torsten Suel, "An efficient distributed algorithm for constructing small dominating sets" Distributed Computing 15(3) pp. 193–205 (2002) Cited 188 times, according to Google Scholar.
Lars Arge, Octavian Procopiuc, Sridhar Ramaswamy, Torsten Suel, Jeffrey Scott Vitter, "Scalable sweeping-based spatial join" Proceedings Of The International Conference On Very Large Data Bases pp. 570–581 IEEE, 1998. Cited 173 times, according to Google Scholar.
References
German computer scientists
1966 births
Living people
German emigrants to the United States
University of Texas at Austin alumni
New York University faculty
Polytechnic Institute of New York University faculty
Scientists from New York (state) |
https://en.wikipedia.org/wiki/Turbo51 | Turbo51 is a compiler for the programming language Pascal, for the Intel MCS-51 (8051) family of microcontrollers. It features Borland Turbo Pascal 7 syntax, support for inline assembly code, source-level debugging, and optimizations, among others. The compiler is written in Object Pascal and produced with Delphi.
In the 1980s, Intel introduced the 8051 as the first member of the MCS-51 processor family. Today, hundreds of cheap derivatives are available from tens of manufacturers. This makes the architecture very interesting for professionals and hobbyists. It is surprising that this 8-bit architecture is still in use today, and is still so popular. Of all 8051 compilers, several widely used C compilers exist, but only a few Pascal compilers. Turbo51 is available as freeware and was created with the goal to make a Pascal compiler for MCS-51 processors that will be as fast as Turbo Pascal, will use the same syntax and will generate high quality optimized code.
Language dialect
Turbo51 uses Borland Turbo Pascal 7 dialect. The syntax was extended with some constructs to support specific features of MCS-51 processors.
Var RS485_TX: Boolean absolute P3.2;
I2C.SDA: Boolean absolute P3.7;
I2C.SCL: Boolean absolute P3.4;
EEPROM_Data: TEEPROM_Data XDATA absolute 0;
ModuleAddress: Byte;
RX_LedTimer: Byte;
TX_LedTimer: Byte;
SavedOutput: TOutputData IDATA;
OutputsAuxData: Array [1..8] of Byte IDATA;
Features
Win32 console application
Fast single pass optimizing compiler
Borland Turbo Pascal 7 syntax
Full floating point support
Mixed Pascal and assembly programming
Full use of register banks
Advanced multi-pass optimizer
Smart linker
Generates compact high quality code
Output formats: Binary, Intel HEX, OMF51 Object Module Format
Assembly source code generation
"Hello World" example
Program HelloWorld;
Const
Osc = 22118400;
BaudRate = 19200;
BaudRateTimerValue = Byte (- Osc div 12 div 32 div BaudRate);
Var SerialPort: Text;
Procedure WriteToSerialPort; Assembler;
Asm
CLR TI
MOV SBUF, A
@WaitLoop:
JNB TI, @WaitLoop
end;
Procedure Init;
begin
TL1 := BaudRateTimerValue;
TH1 := BaudRateTimerValue;
TMOD := %00100001; { Timer1: no GATE, 8 bit timer, autoreload }
SCON := %01010000; { Serial Mode 1, Enable Reception }
TI := True; { Indicate TX ready }
TR1 := True; { Enable timer 1 }
Assign (SerialPort, WriteToSerialPort)
end;
begin
Init;
Writeln (SerialPort, 'Hello world!')
end.
See also
Intel 8051
Pascal (programming language)
Comparison of Pascal and C
Borland
Turbo Pascal
External links
Pascal (programming language) compilers
Pascal programming language family
Object-oriented programming languages
compilers and interpreters
Pascal (programming language) software |
https://en.wikipedia.org/wiki/The%20Redstone%20Acceleration%20%26%20Innovation%20Network | The Redstone Acceleration & Innovation Network (TRAIN) is an organization launched by FasterCures in 2004 established to create opportunities for medical research organizations to discuss and overcome research challenges that cut across all diseases. TRAIN brings together nonprofit disease research organizations to share information, as well as promote collaboration and innovation in disease research. Headed by FasterCures, TRAIN asserts that collaboration is crucial for efficient biomedical advancement. Participating researchers discuss successes, failures, and best practices that provide lessons learned and valuable ideas that could be scaled up to amplify productivity.
Originally named “The Research Acceleration & Innovation Network,” TRAIN was renamed to “The Redstone Acceleration & Innovation Network” in order to honor a generous grant contribution from Sumner Redstone and the Sumner M. Redstone Charitable Foundation.
Participating research organizations
Accelerate Brain Cancer Cure
Accelerated Cure Project for Multiple Sclerosis
Alliance for Aging Research
Alpha-1 Foundation
ALS Therapy Development Institute
Autism Speaks
Ben & Catherine Ivy Foundation
Bonnie J. Addario Lung Cancer Foundation
Cure Alzheimer's Fund
CureDuchenne
Cystic Fibrosis Foundation
The Epilepsy Therapy Development Project
FastForward, LLC (National MS Society)
Focused Ultrasound Surgery Foundation
Foundation Fighting Blindness
Foundation for Accelerated Vascular Research
Hydrocephalus Association
Institute for OneWorld Health
International AIDS Vaccine Initiative
Juvenile Diabetes Research Foundation
Lance Armstrong Foundation
Leukemia & Lymphoma Society
Life Raft Group
Lymphoma Research Foundation
Melanoma Research Alliance
Michael J. Fox Foundation for Parkinson's Research
MPD Foundation
Multiple Myeloma Research Foundation
Myelin Repair Foundation
Pancreatic Cancer Action Network
Parkinson's Action Network
Prostate Cancer Foundation
Susan G. Komen for the Cure
TGen
References
Altevogt, Bruce, Sarah Hanson and Lori Nadig. Venture Philanthropy Strategies to Support Translational Research. Institute of Medicine of the National Academies. 2009 February 25.
Rimer, Skip. “Sumner M. Redstone Charitable Foundation Awards $35 Million Grant to FasterCures/The Center for Accelerating Medical Solutions.” Milken Institute. 2007 April 19. Retrieved 2009 July 1.
"Sumner M. Redstone Commits $105 Million to Fund Cancer and Burn Recovery Research and Patient Care." RedOrbit News. 18 April 2007. Retrieved 2009 July 1. http://www.redorbit.com/news/health/906598/sumner_m_redstone_commits_105_million_to_fund_cancer_and/index.html
"A 'Younger' Redstone Makes a Commitment." OnPhilanthropy News. April 25, 2007. Retrieved 2009 July 1. http://flip.onphilanthropy.com/news_onphilanthropy/2007/04/a_younger_redst.html
External links
FasterCures website
The Milken Institute website
Medical and health organizations based in Washington, D.C.
Health care quality
Organizations established in 200 |
https://en.wikipedia.org/wiki/Adjoint%20state%20method | The adjoint state method is a numerical method for efficiently computing the gradient of a function or operator in a numerical optimization problem. It has applications in geophysics, seismic imaging, photonics and more recently in neural networks.
The adjoint state space is chosen to simplify the physical interpretation of equation constraints.
Adjoint state techniques allow the use of integration by parts, resulting in a form which explicitly contains the physically interesting quantity. An adjoint state equation is introduced, including a new unknown variable.
The adjoint method formulates the gradient of a function towards its parameters in a constraint optimization form. By using the dual form of this constraint optimization problem, it can be used to calculate the gradient very fast. A nice property is that the number of computations is independent of the number of parameters for which you want the gradient.
The adjoint method is derived from the dual problem and is used e.g. in the Landweber iteration method.
The name adjoint state method refers to the dual form of the problem, where the adjoint matrix is used.
When the initial problem consists of calculating the product and must satisfy , the dual problem can be realized as calculating the product , where must satisfy .
And
is called the adjoint state vector.
General case
The original adjoint calculation method goes back to Jean Cea, with the use of the lagrangian of the optimization problem to compute the derivative of a functional with respect to a shape parameter.
For a state variable , an optimization variable , an objective functional is defined. The state variable is often implicitly dependant on through the (direct) state equation (usually the weak form of a partial differential equation), thus the considered objective is . Usually, one would be interested in calculating using the chain rule:
Unfortunately, the term is often very hard to differentiate analytically since the dependance is defined through an implicit equation. The lagrangian functional can be used as a workaround for this issue. Since the state equation can be considered as a constraint in the minimization of , the problem
has an associate lagrangian functional defined by
where is a Lagrange multiplier or adjoint state variable and is an inner product on . The method of Lagrange multipliers states that a solution to the problem has to be a stationary point of the lagrangian, namely
where is the Gateaux derivative of with respect to in the direction . The last equation is equivalent to , the state equation, to which the solution is . The first equation is the so-called adjoint state equation,
because the operator involved is the adjoint operator of , . Resolving this equation yields the adjoint state .
The gradient of the quantity of interest with respect to is (the second equation with and ), thus it can be easily identified by subsequently resolving the direct and adjoint stat |
https://en.wikipedia.org/wiki/Chernivtsi%20Philharmonic%20Hall | Chernivtsi Philharmonic Hall (from Ukrainian, literally: Chernivtsi Regional Philharmonic - Чернівецька обласна філармонія) is part of the network of state philharmonic halls in Ukraine located in the central part of Chernivtsi, Ukraine.
Original hall
The current hall was completed in 1876-1877 as a concert hall of the Ukrainian Music Society.
Recent history
The entity "Chernivtsi Philharmonic Hall" was founded in 1940. Organ and chamber music music hall was opened on 18 August 1992, on the anniversary of the Ukrainian independence.
Concert programmes
The hall is the home, rehearsal and concert venue of musicians and musical bands playing classical but also folk music.
The hall is the venue of music competitions and hosted such musicians as Enrico Caruso, Solomiya Krushelnytska, Feodor Chaliapin, Mykola Lysenko, Sidi Tal.
Today, the hall still hosts a number of music classes.
In 1944, the Bukovina Song and Dance Ensemble of Ukraine was founded. The Chamber Orchestra performs since 1975, and in 1978, it won the Republican competition of chamber music ensembles in Kiev. In 1992 was founded the Chernivtsi Philharmonic Symphony Orchestra, in 1993 - the Chamber Choir. The philharmonic hall became the starting point of such performers as Jan Tabachnik, Sofia Rotaru and Sophia Agranovich.
External links
Official site
Yan Tabachnik's interview (Russian)
Official site of Sophia Agranovich
Чернівецька обласна філармонія — Official Site of Chernivtsi City Hall
References
Culture in Chernivtsi
Concert halls in Ukraine
Classical music in Ukraine
Buildings and structures in Chernivtsi
Tourist attractions in Chernivtsi |
https://en.wikipedia.org/wiki/Comparison%20of%20data-serialization%20formats | This is a comparison of data serialization formats, various ways to convert complex objects to sequences of bits. It does not include markup languages used exclusively as document file formats.
Overview
Syntax comparison of human-readable formats
Comparison of binary formats
See also
Comparison of document-markup languages
References
External links
XML-QL Proposal discussing XML benefits
Daring to Do Less with XML
Data serialization formats
Persistence
Data-serialization formats |
https://en.wikipedia.org/wiki/.gg | .gg is the country code top-level domain for the Bailiwick of Guernsey. The domain is administered by Island Networks, who also administer the .je domain for neighbouring territory Jersey. The domain was chosen as other possible codes—.gu, .gs, and .gy—were already allocated.
Usage in video games
Multiple video game, streamers and esports websites use this domain because "gg" is a common initialism used in multiplayer video games as an abbreviation for the phrase "good game", usually said at the end of a match. For example, the VoIP application Discord, commonly used with multiplayer games, uses the domain discord.gg as a redirect to their main website, discord.com, as well as for Discord server invite links. Other websites also use the .gg domain, such as emoji.gg, which provides emojis for Discord, start.gg, an eSports platform, wiki.gg, a wiki hosting service and cloudbase.gg, which keeps tracks of games availability in cloud gaming services.
Second-level domains
Names have been registered principally directly at second level, but the following legacy sub-domains are still open for registration:
.co.gg: commercial/personal domains
.net.gg: Internet service providers and commercial
.org.gg: organizations (free to local good causes)
See also
.gb
.me
.tv
.uk
References
External links
Island Networks website
IANA .gg whois information
Communications in Guernsey
Computer-related introductions in 1996
Council of European National Top Level Domain Registries members
Country code top-level domains |
https://en.wikipedia.org/wiki/Taxonomic%20database | A taxonomic database is a database created to hold information on biological taxa – for example groups of organisms organized by species name or other taxonomic identifier – for efficient data management and information retrieval. Taxonomic databases are routinely used for the automated construction of biological checklists such as floras and faunas, both for print publication and online; to underpin the operation of web-based species information systems; as a part of biological collection management (for example in museums and herbaria); as well as providing, in some cases, the taxon management component of broader science or biology information systems. They are also a fundamental contribution to the discipline of biodiversity informatics.
Goals
Taxonomic databases digitize scientific biodiversity data and provide access to taxonomic data for research. Taxonomic databases vary in breadth of the groups of taxa and geographical space they seek to include, for example: beetles in a defined region, mammals globally, or all described taxa in the tree of life. A taxonomic database may incorporate organism identifiers (scientific name, author, and – for zoological taxa – year of original publication), synonyms, taxonomic opinions, literature sources or citations, illustrations or photographs, and biological attributes for each taxon (such as geographic distribution, ecology, descriptive information, threatened or vulnerable status, etc.). Some databases, such as the Global Biodiversity Information Facility(GBIF) database and the Barcode of Life Data System, store the DNA barcode of a taxon if one exists (also called the Barcode Index Number (BIN) which may be assigned, for example, by the International Barcode of Life project (iBOL) or UNITE, a database for fungal DNA barcoding).
A taxonomic database aims to accurately model the characteristics of interest that are relevant to the organisms which are in scope for the intended coverage and usage of the system. For example, databases of fungi, algae, bryophytes and vascular plants ("higher plants") encode conventions from the International Code of Botanical Nomenclature while their counterparts for animals and most protists encode equivalent rules from the International Code of Zoological Nomenclature. Modelling the relevant taxonomic hierarchy for any taxon is a natural fit with the relational model employed in almost all database systems. Scientific consensus is not reached for all taxon groups, and new species continue to be described; therefore, another goal of taxonomic databases is to aid in resolving conflicts of scientific opinion and unify taxonomy.
History
Possibly the earliest documented management of taxonomic information in computerised form comprised the taxonomic coding system developed by Richard Swartz et al. at the Virginia Institute of Marine Science for the Biota of Chesapeake Bay and described in a published report in 1972. This work led directly or indirectly to other projects |
https://en.wikipedia.org/wiki/African%20Book%20Publishing%20Record | The African Book Publishing Record is an academic journal covering new and forthcoming African publications, providing full bibliographic and acquisitions data. It covers works of all levels in the African languages, as well as English, French, and Portuguese, in three indices by subject, country, and author. In addition to its bibliographic coverage, it also includes a book review section, reviews of new journals, and a variety of news, reports, and articles about African book trade activities and developments. The journal was established in 1975 by Hans M. Zell and is now published by Walter de Gruyter. The current editor-in-chief is Cécile Lomer.
External links
African studies
Academic journals established in 1975
English-language journals
De Gruyter academic journals
Quarterly journals |
https://en.wikipedia.org/wiki/List%20of%20Australian%20films%20of%201999 |
1999
See also
1999 in Australia
1999 in Australian television
List of 1999 box office number-one films in Australia
External links
Australian film at the Internet Movie Database
1999
Lists of 1999 films by country or language
Films |
https://en.wikipedia.org/wiki/List%20of%20Australian%20films%20of%201998 |
1998
See also
1998 in Australia
1998 in Australian television
List of 1998 box office number-one films in Australia
External links
Australian film at the Internet Movie Database
1998
Lists of 1998 films by country or language
Films |
https://en.wikipedia.org/wiki/List%20of%20Australian%20films%20of%201997 |
1997
See also
1997 in Australia
1997 in Australian television
List of 1997 box office number-one films in Australia
References
External links
Australian film at the Internet Movie Database
1997
Australia
Films |
https://en.wikipedia.org/wiki/List%20of%20Australian%20films%20of%201989 |
1989
See also
1989 in Australia
1989 in Australian television
References
External links
Australian film at the Internet Movie Database
1989
Australian
Films |
https://en.wikipedia.org/wiki/List%20of%20Australian%20films%20of%201988 |
1988
See also
1988 in Australia
1988 in Australian television
External links
Australian film at the Internet Movie Database
References
1988
Australia
Films |
https://en.wikipedia.org/wiki/List%20of%20Australian%20films%20of%201987 |
1987
See also
1987 in Australia
1987 in Australian television
References
External links
Australian film at the Internet Movie Database
1987
Lists of 1987 films by country or language
Films |
https://en.wikipedia.org/wiki/List%20of%20Australian%20films%20of%201986 |
1986
See also
1986 in Australia
1986 in Australian television
References
External links
Australian film at the Internet Movie Database
1986
Lists of 1986 films by country or language
Films |
https://en.wikipedia.org/wiki/List%20of%20Australian%20films%20of%201985 |
1985
See also
1985 in Australia
1985 in Australian television
References
External links
Australian film at the Internet Movie Database
1985
Australian
Films |
https://en.wikipedia.org/wiki/List%20of%20Australian%20films%20of%201984 |
1984
See also
1984 in Australia
1984 in Australian television
References
External links
Australian film at the Internet Movie Database
1984
Lists of 1984 films by country or language
Films |
https://en.wikipedia.org/wiki/List%20of%20Australian%20films%20of%201983 |
1983
See also
1983 in Australia
1983 in Australian television
References
External links
Australian film at the Internet Movie Database
1983
Lists of 1983 films by country or language
Films |
https://en.wikipedia.org/wiki/List%20of%20Australian%20films%20of%201982 |
1982
See also
1982 in Australia
1982 in Australian television
References
External links
Australian film at the Internet Movie Database
1982
Lists of 1982 films by country or language
Films |
https://en.wikipedia.org/wiki/List%20of%20Australian%20films%20of%201981 |
1981
See also
1981 in Australia
1981 in Australian television
References
External links
Australian film at the Internet Movie Database
Australian
Films
1981
Australka
Films |
https://en.wikipedia.org/wiki/List%20of%20Australian%20films%20of%201980 |
1980
See also
1980 in Australia
1980 in Australian television
References
External links
Australian film at the Internet Movie Database
1980
Australia
Films |
https://en.wikipedia.org/wiki/List%20of%20Australian%20films%20of%201979 |
1979
See also
1979 in Australia
1979 in Australian television
References
External links
Australian film at the Internet Movie Database
1979
Lists of 1979 films by country or language
Films |
https://en.wikipedia.org/wiki/List%20of%20Australian%20films%20of%201978 |
1978
See also
1978 in Australia
1978 in Australian television
References
External links
Australian film at the Internet Movie Database
1978
Australia
Films |
https://en.wikipedia.org/wiki/List%20of%20Australian%20films%20of%201977 |
1977
See also
1978 in Australia
1978 in Australian television
References
External links
Australian film at the Internet Movie Database
1977
Australia
Films |
https://en.wikipedia.org/wiki/List%20of%20Australian%20films%20of%201976 |
1976
See also
1976 in Australia
1976 in Australian television
References
External links
Australian film at the Internet Movie Database
1976
Lists of 1976 films by country or language
Films |
https://en.wikipedia.org/wiki/List%20of%20Australian%20films%20of%201975 |
1975
See also
1975 in Australia
1975 in Australian television
References
External links
Australian film at the Internet Movie Database
1975
Lists of 1975 films by country or language
Films |
https://en.wikipedia.org/wiki/List%20of%20Australian%20films%20of%201974 |
1974
See also
1974 in Australia
1974 in Australian television
References
External links
Australian film at the Internet Movie Database
1974
Australia
Films |
https://en.wikipedia.org/wiki/List%20of%20Australian%20films%20of%201973 |
1973
See also
1973 in Australia
References
External links
Australian film at the Internet Movie Database
1973
Australia
Films |
https://en.wikipedia.org/wiki/List%20of%20Australian%20films%20of%201972 |
1972
See also
1972 in Australia
References
External links
Australian film at the Internet Movie Database
1972
Australia
Films |
https://en.wikipedia.org/wiki/List%20of%20Australian%20films%20of%201971 |
1971
See also
1971 in Australia
References
External links
Australian film at the Internet Movie Database
1971
Australian
Films |
https://en.wikipedia.org/wiki/List%20of%20Australian%20films%20of%201970 |
1970
See also
1970 in Australia
References
External links
Australian film at the Internet Movie Database
1970
Australia
Films |
https://en.wikipedia.org/wiki/Algebraic%20Petri%20net | An algebraic Petri net (APN) is an evolution of the well known Petri net in which elements of user defined data types (called algebraic abstract data types (AADT)) replace black tokens. This formalism can be compared to coloured Petri nets (CPN) in many aspects. However, in the APN case, the semantics of the data types is given by an axiomatization enabling proofs and computations on it.
Algebraic Petri nets were invented by Jacques Vautherin in 1985 in his PhD thesis and later improved by Wolfang Reisig.
The formalism has two aspects :
The control part which is handled by a Petri net.
The data part which is handled by one or many AADTs.
AADT can be themselves split in two parts:
The signature (Sort and Ops in the example below) which gives the valid constants and operations of the term algebra.
The axiomatization (Axioms in the example below) which gives the semantics of the operations described in the signature part.
The following picture describes an algebraic Petri net model of the "dining philosophers problem". There are two AADT in this model, one for the forks algebra, one for the philosophers algebra. Please note that the philosophers AADT uses the fork AADT. Since all philosophers can take their left fork without taking their right fork, executing this model can result in a deadlock.
The control part is composed of :
Places contain multiset (bags) of tokens. Those tokens are elements of a term algebra built upon the signature of the AADT (in the example, terms that represent either a philosopher or a fork). Each place contains one and only one multiset of terms, the place is typed by its multiset.
Arcs can be labeled with multisets of either closed or free terms. Again terms are built from the AADT signature.
Transitions are events that can be fired whenever there are enough resources (namely enough tokens in the input places to satisfy all the input arcs) and the guard (firing conditions) of the transition holds. Then the produced tokens are put in the target places of the output arcs. Usually term rewriting is used for the operational semantics in order to check if conditions hold and to compute output terms.
In the example below only transition goEat is firable at the beginning. One goEat has been fired, takeL and takeR are also enabled and thus can also be fired.
Algebraic Petri nets are the basic formalism of more advanced ones such as CO-OPN.
References
Further reading
External links
An Introduction to the Algebraic Specification of Abstract Data Types
Specification languages
Petri nets |
https://en.wikipedia.org/wiki/List%20of%20programming%20languages%20for%20artificial%20intelligence | Artificial intelligence researchers have developed several specialized programming languages for artificial intelligence:
Languages
Artificial Intelligence Markup Language (AIML) is an XML dialect for use with Artificial Linguistic Internet Computer Entity (A.L.I.C.E.)-type chatterbots.
C# can be used to develop high level machine learning models using Microsoft’s .NET suite. ML.NET was developed to aid integration with existing .NET projects, simplifying the process for existing software using the .NET platform.
Lisp was the first language developed for artificial intelligence. It includes features intended to support programs that could perform general problem solving, such as lists, associations, schemas (frames), dynamic memory allocation, data types, recursion, associative retrieval, functions as arguments, generators (streams), and cooperative multitasking.
Smalltalk has been used extensively for simulations, neural networks, machine learning, and genetic algorithms. It implements a pure and elegant form of object-oriented programming using message passing.
Prolog is a declarative language where programs are expressed in terms of relations, and execution occurs by running queries over these relations. Prolog is particularly useful for symbolic reasoning, database and language parsing applications. Prolog is widely used in AI today.
Stanford Research Institute Problem Solver (STRIPS) is a language to express automated planning problem instances. It expresses an initial state, the goal states, and a set of actions. For each action preconditions (what must be established before the action is performed) and postconditions (what is established after the action is performed) are specified.
Planner is a hybrid between procedural and logical languages. It gives a procedural interpretation to logical sentences where implications are interpreted with pattern-directed inference.
POP-11 is a reflective, incrementally compiled programming language with many of the features of an interpreted language. It is the core language of the Poplog programming environment developed originally by the University of Sussex, and recently in the School of Computer Science at the University of Birmingham which hosts the Poplog website, It is often used to introduce symbolic programming techniques to programmers of more conventional languages like Pascal, who find POP syntax more familiar than that of Lisp. One of POP-11's features is that it supports first-class functions.
R is widely used in new-style artificial intelligence, involving statistical computations, numerical analysis, the use of Bayesian inference, neural networks and in general machine learning. In domains like finance, biology, sociology or medicine it is considered one of the main standard languages. It offers several paradigms of programming like vectorial computation, functional programming and object-oriented programming.
Python is widely used for artificial intelligence, with packages fo |
https://en.wikipedia.org/wiki/Osaka%20Junior%20College%20of%20Social%20Health%20and%20Welfare | is a junior college in Sakai-ku, Sakai Sakai, Osaka, Osaka Prefecture, Japan. It is part of the Midori Gakuen network.
The origin of the institute was the Osaka Childcare Laboratory, established in 1979. In 1985, a professional school for childcare was founded. Later, a professional school for carework was founded. In 2002, the professional school became a junior college.
External links
Osaka Junior College of Social Health and Welfare
Educational institutions established in 2002
Japanese junior colleges
Private universities and colleges in Japan
Universities and colleges in Osaka Prefecture
2002 establishments in Japan
Sakai, Osaka |
https://en.wikipedia.org/wiki/Dimitri%20Bertsekas | Dimitri Panteli Bertsekas (born 1942, Athens, ) is an applied mathematician, electrical engineer, and computer scientist, a McAfee Professor at the Department of Electrical Engineering and Computer Science in School of Engineering at the Massachusetts Institute of Technology (MIT), Cambridge, Massachusetts, and also a Fulton Professor of Computational Decision Making at Arizona State University, Tempe.
Biography
Bertsekas was born in Greece and lived his childhood there. He studied for five years at the National Technical University of Athens, Greece and studied for about a year and a half at The George Washington University, Washington, D.C., where he obtained his M.S. in electrical engineering in 1969, and for about two years at MIT, where he obtained his doctorate in system science in 1971. Prior to joining the MIT faculty in 1979, he taught for three years at the Engineering-Economic Systems Dept. of Stanford University, and for five years at the Electrical and Computer Engineering Dept. of the University of Illinois at Urbana-Champaign. In 2019, he was appointed a full-time professor at the School of Computing and Augmented Intelligence at Arizona State University, Tempe, while maintaining a research position at MIT.
He is known for his research work, and for his twenty textbooks and monographs in theoretical and algorithmic optimization and control, in reinforcement learning, and in applied probability. His work ranges from theoretical/foundational work, to algorithmic analysis and design for optimization problems, and to applications such as data communication and transportation networks, and electric power generation. He is featured among the top 100 most cited computer science authors in the CiteSeer search engine academic database and digital library. He is also ranked within the top 40 scientists in the world (top 20 in the USA) in the field of Engineering and Technology, and also ranked within the top 50 scientists in the world (top 30 in the USA) in the field of Mathematics. In 1995, he co-founded a publishing company, Athena Scientific, that among others, publishes most of his books.
In the late 1990s Bertsekas developed a strong interest in digital photography. His photographs have been exhibited on several occasions at MIT.
Awards and honors
Bertsekas was elevated to the grade of IEEE fellow in 1984 for contributions to optimization, data communications networks, and distributed control.
Bertsekas was awarded the INFORMS 1997 Prize for Research Excellence in the Interface Between Operations Research and Computer Science for his book "Neuro-Dynamic Programming" (co-authored with John N. Tsitsiklis); the 2000 Greek National Award for Operations Research; and the 2001 ACC John R. Ragazzini Education Award for outstanding contributions to education. In 2001, he was elected to the US National Academy of Engineering for "pioneering contributions to fundamental research, practice and education of optimization/control theory, and |
https://en.wikipedia.org/wiki/Encompass | Encompass, the Enterprise Computing Association, was the original computer user group for business customers of Hewlett-Packard. Encompass's history began with DECUS, founded in 1961, for customers of the Digital Equipment Corporation, which was acquired in 1998 by Compaq.
The U.S. Chapter incorporated as the user group Encompass U.S.
Hewlett-Packard acquired Compaq in 2002. Encompass continued as an HP user group, aimed at business customers of all of HP's hardware, software, and services.
The Encompass mission was to promote technical information exchange among its members and between the members and Hewlett-Packard.
The Connect User Group Community, formed from the consolidation in May 2008 of Encompass, Interex EMEA, and ITUG is Hewlett-Packard's largest user community representing more than 50,000 participants. See Connect (users group) for more information.
The Encompass Board at the time of the consolidation consisted of Nina Buik, Kristi Browder, Glen Kuykendall, Anthony Ioele, Steve Davidek, Dena Wright, John Maynen, Clyde Poole, and Bill Johnson. Two former directors were credited with being instrumental in facilitating the consolidation, Chris Koppe and Jim Becker.
Mission
Encompass partnered with first Compaq and then Hewlett-Packard on national technical conferences (in the U.S.):
CETS 2001 (Compaq Enterprise Technical Symposium): September 10–14, 2001, Anaheim, California
HP-ETS 2002 (HP Enterprise Technical Symposium): October 7–11, St. Louis, Missouri
HP World 2003: August 11–15, 2003, Atlanta, Georgia, in partnership with Interex as well as HP
HP World 2004: August 16–20, 2004, Chicago, Illinois, in partnership with Interex and HP
HP Technology Forum 2005: October 17–20, 2005, Orlando, Florida, in partnership with the user group OpenView Forum International as well as HP
HP Technology Forum 2006: September 17–21, 2006, Houston, Texas, in partnership with HP, ITUG, and OpenView Forum International
HP Technology Forum & Expo 2007: June 17–21, 2007, Las Vegas, Nevada, in partnership with HP and ITUG
Encompass also had a number of Local User Groups (LUGs) throughout the U.S., and Special Interest Groups (SIGs) on various topics.
Encompass also ran webcasts, local seminars, and other programs.
Encompass manages the pre-conference seminar program and trade show at the HP Technology Forum & Expo.
Non-U.S. Encompass organizations include:
Encompass Canada
Encompass New Zealand
Encompass Australia
See also
Connect (users group)
References
External links
Encompass U.S.
HP Technology Forum & Expo
OpenVMS.org
Tru64.org
Hewlett-Packard
Computer clubs
Organizations disestablished in 2008 |
https://en.wikipedia.org/wiki/St.%20Luke%27s%20University%20Health%20Network | St. Luke's University Health Network (SLUHN) is a non-profit network of 12 hospitals and over 300 outpatient sites. The health network is headquartered in Bethlehem, Pennsylvania in the Lehigh Valley region of eastern Pennsylvania and has over 16,000 employees.
History
The network started in 1872 with St. Luke's Hospital, now known as St. Luke's University Hospital, which became a primary teaching hospital for Temple University School of Medicine in 1901. St. Luke's University Hospital is a non-profit, tertiary-care, teaching hospital with campuses in Allentown and Bethlehem in Lehigh County, Pennsylvania.
Specialties
St. Luke's University Health Network is a member of the Council of Teaching Hospitals and Health Systems and offers 90 medical specialties, including:
Level I Trauma (Bethlehem), Level II Trauma (Easton), and Level IV (Quakertown) Adult Trauma Center
Bariatric surgery
Cardiology and cardiovascular surgery.
Gastroenterology: Colonoscopy, upper and lower endoscopic surgery, hernia repairs, bowel diseases
Neuroscience
Oncology: Radiation oncology, chemotherapy, laser therapy
Orthopaedics
Otorhinolaryngology
Pediatrics
Perinatal
Robotic and Minimally-invasive surgery
Radiology
Podiatry
Women's Health: breast cancer surgery
Locations
St. Luke's University Health Network comprises twelve hospitals:
St. Luke's University Hospital and Temple University School of Medicine–Bethlehem (Fountain Hill)
St. Luke's Allentown Campus (Allentown)
St. Luke's Anderson Campus (Bethlehem Township)
St Luke's Easton (Easton) starting July 1, 2020, formerly Easton Hospital
St. Luke's Miners Campus (Coaldale)
St. Luke's Monroe Campus (Stroudsburg)
St. Luke's Upper Bucks Campus (Quakertown)
St. Luke's Warren Campus (Phillipsburg, NJ)
St. Luke's Lehighton Campus (Lehighton)
St. Luke's Sacred Heart Campus (Allentown)
St. Luke's Quakertown Campus (Quakertown)
Geisinger St. Luke's Hospital (Orwigsburg)
In addition, the network's 300 outpatient sites provide various healthcare services, including:
Outpatient testing and service facilities
A regional medical school campus
Home health
Physical therapy, occupational therapy, and audiology
Hospice services (inpatient and outpatient)
Level III NICU
References
External links
St. Luke's University Health Network at Twitter
1872 establishments in Pennsylvania
Bethlehem, Pennsylvania
Healthcare in Pennsylvania
Hospital networks in the United States
Hospitals in the Lehigh Valley
Medical and health organizations based in Pennsylvania
Trauma centers |
https://en.wikipedia.org/wiki/Hottrix | Hottrix is a software development company that produces applications for mobile operating systems such as iOS (iPhone, iPod Touch, iPad), Android, Palm OS, and Windows. Their iPhone and iPod Touch software has been praised by CNN, Newsweek, Time, and David Pogue for The New York Times. Their software has also been involved in intellectual property disputes.
The company also sells physical "gimmix" to complement their magic applications.
Background
Hottrix is based in Las Vegas, Nevada. Many of their "tricks" are invented by Steve Sheraton, whose first trick was "e-spresso", a virtual cup of espresso for the Palm Pilot.
Notable Hottrix personnel include:
Steven L. Priedel, managing member, magician
Maria H. Gara, managing member, magician
Steve Sheraton, contractor, Swiss-born producer and inventor, previously a certified magician and physical comedian
Steve Charney, video host, radio personality, author, magician
Recognition
In December 2008, Apple Inc. released a series of lists that showed the top downloads of the year from the App Store. The lists showed the 10 most-downloaded applications from different categories, in no particular order. The iBeer application from Hottrix appeared in both the "Top Paid Apps (Overall)" and "Top Paid Entertainment" lists.
iBeer was also called a "must-have" application by CNN Money. Hottrix was praised by Condé Nast Portfolio for their trick software, with iBeer singled out as "the perfect gift".
Intellectual property
In October 2008, Hottrix filed a US$12.5 million lawsuit against Coors Brewing Company for developing an application called iPint for iOS. The suit alleged that Coors violated copyright law by making a program similar to iBeer. Apple removed iPint from the App Store in the United States after receiving a complaint from Hottrix.
List of iOS applications
App Store apps
These tricks are available at the App Store.
HottrixPhone
This trick gives the appearance of a phone call with a celebrity, including real pre-recorded voices of same. Multiple celebrities are available in the application, including Elvis Presley and Barack Obama, and the ability for users to add others.
iBeer
iBeer is a trick that gives the illusion that the device screen "fills" with many varieties of beer (including sound). If the device is tilted, the virtual beer swishes around to give the illusion of truly being filled with beer. The beer can be "drained" if the device is tilted enough, and a belch sounds when the beer has been completely drained. iBeer appeared in both the "Top Paid Apps (Overall)" and "Top Paid Entertainment" lists published by Apple in December 2008.
iBug
iBug is a trick that gives the appearance of a virtual insect appearing on the screen of the device. It responds to touch and can get fat. The bug laughs when the device is shaken.
iMilk
iMilk is a trick similar to iBeer, but appears as different varieties of milk, such as chocolate milk, strawberry milk, and "martian milk." iMilk has a pay tri |
https://en.wikipedia.org/wiki/Double-sided%20disk | In computer science, a double-sided disk is a disk of which both sides are used to store data.
Early floppy disks only used one surface for recording. The term single-sided disk was not common until the introduction of the double-sided disk, which offered double the capacity in the same physical size. Initially, double-sided disks had to be removed and flipped over to access data on the other side, but eventually, devices were made that could read both sides without the need to eject the disk.
Manufacturers sold both single-sided and double-sided disks with the double-sided disks being typically 50% more expensive than single-sided disks. While the magnetic-coated medium was coated on both sides, the single-sided floppies had a read-write notch on only one side, thus allowing only one side of the disk to be used. When users discovered this, they began buying the less-expensive single-sided disks and "notching" them using scissors, a hole punch, or a specially-designed "notcher" to allow them to write to the reverse side of the disk.
Optical discs can also be made in single-sided and double-sided formats, often as an alternative to two-disc packages. Both sides can be either single layered or dual layered or a mixture of both. The practice mainly applies to DVDs, but some companies have experimented with pressing discs with differing formats on either side, to varying degrees of success: Universal's first HD-DVD and Blu-Ray releases were double-sided, backed with a DVD version of the movie. DualDisc and DVDplus are two variants of the double-sided DVD format where one side is a compact disc. However, these formats failed due to physical design flaws that impeded their compatibility with many commercial CD players. Specifically, the CD side was either thinner or thicker than a standard CD (whereas the DVD side was thick enough to meet standardized specifications), offsetting it from the focal length of CD players' infrared lasers, and/or causing the discs to have difficulties fitting into slot-loading players and disc changers.
It is more convenient (and cheaper) for videos or music to be released on two single-sided discs. Indeed, many titles that were initially issued as single double-sided discs were later repressed as two single-sided disc sets.
See also
Floppy disk format - explanation of single-sided double-density
References
Rotating disc computer storage media |
https://en.wikipedia.org/wiki/Cyxymu | Cyxymu is a screen name of a Georgian blogger who was targeted in a co-ordinated series of attacks on social networking sites Facebook, Google Blogger, LiveJournal and Twitter, taking the latter offline for two hours on August 7, 2009. The name mimics a Cyrillic spelling of Sukhumi (Сухуми), capital town in the Georgian breakaway region of Abkhazia. The blogger, who extensively covers the suffering of Georgian civilians during and after the War in Abkhazia, accuses Russia of trying to silence him using cyberattacks. Facebook came out in defense of Cyxymu, with chief security officer Max Kelly stating that "It was a simultaneous attack across a number of properties targeting him to keep his voice from being heard."
Before the 2009 attack
Cyxymu's Russian-language LiveJournal blog was a source of information from Georgia for the news media during the 2007 state of emergency and 2008 Russo-Georgian War.
Cyxymu's LJ blog had previously been targeted by denial-of-service attacks in October 2008, rendering the LiveJournal servers unavailable three times during October 26–27. The attack on Cyxymu is internationally seen as part of an ongoing cyberwar between Russia and Georgia.
See also
Cyberattacks during the Russo-Georgian War
References
External links
Living people
Bloggers from Georgia (country)
Denial-of-service attacks
2009 crimes
Cyberattacks
Georgia (country)–Russia relations
Anonymous bloggers
Year of birth missing (living people) |
https://en.wikipedia.org/wiki/Media%20ownership%20in%20Canada | Media ownership in Canada is governed by the Canadian Radio-television and Telecommunications Commission (CRTC), with respect to audiovisual media and telecom networks, and other agencies with more specific jurisdiction, in the case of non-broadcast media—like the Competition Bureau, with respect to competition matters, and Department of Canadian Heritage regarding foreign investment in the cultural sector. The CRTC implements the policies of the Broadcasting Act and the Telecommunications Act within Canada but, because its jurisdiction is limited to these, does not regulate the ownership of newspapers or of non-audiovisual Internet activity. However, it has taken press and non-audiovisual Internet activity taken into consideration in deciding on broadcasting matters. Thus far, the CRTC has undertaken very little regulation of Internet-based audiovisual programming.
Media Concentration in Canada
The Canadian media industry is not governed exclusively by free-market economics but rather through a combination of public and private enterprise. Apart from a limited number of community broadcasters, media in Canada are primarily owned by a small number of companies: Bell, Corus, Rogers, Quebecor and the government-owned Canadian Broadcasting Corporation. Each of these companies holds a diverse mix of over-the-air television, cable television, radio, newspaper, magazine, and/or internet operations. A few smaller media companies exist within the Canadian media landscape as well. In 2007, CTVglobemedia, Astral Media, Quebecor, Canwest Global, and Rogers all expanded significantly, through the acquisitions of CHUM Limited, Standard Broadcasting, Osprey Media, Alliance Atlantis, and Citytv, respectively. In 2010, Canwest was sold off and split between Shaw (now Corus) and Postmedia Network due to financial troubles.
Between 1990 and 2005 there were a number of media corporate mergers and takeovers in Canada. While 17.3% of daily newspapers were independently owned in 1990, by 2017 only 6% of daily newspapers were independently owned. These changes, among others, caused the Senate Standing Committee on Transport and Communications to launch a study of Canadian news media in March 2003. (This topic had been examined twice in the past, by the Davey Commission (1970) and the Kent Commission (1981), both of which produced recommendations that were never implemented in any meaningful way.)
The Senate Committee’s final report, released in June 2006, expressed concern about the effects of the current levels of news media ownership in Canada. Specifically, the Committee discussed their concerns regarding the following trends: the potential of media ownership concentration to limit news diversity and reduce news quality; the Canadian Radio-television and Telecommunications Commission (CRTC) and Competition Bureau’s ineffectiveness at stopping media ownership concentration; the lack of federal funding for the CBC and the broadcaster’s uncertain mandate and role; |
https://en.wikipedia.org/wiki/Collinearity%20equation | The collinearity equations are a set of two equations, used in photogrammetry and computer stereo vision, to relate coordinates in a sensor plane (in two dimensions) to object coordinates (in three dimensions). The equations originate from the central projection of a point of the object through the optical centre of the camera to the image on the sensor plane.
Definition
Let x,y, and z refer to a coordinate system with the x- and y-axis in the sensor plane. Denote the coordinates of the point P on the object by , the coordinates of the image point of P on the sensor plane by x and y and the coordinates of the projection (optical) centre by . As a consequence of the projection method there is the same fixed ratio between and , and , and the distance of the projection centre to the sensor plane and . Hence:
Solving for in the last equation and entering it in the others yields:
The point P is normally given in some coordinate system "outside" the camera by the coordinates X, Y and Z, and the projection centre by . These coordinates may be transformed through a rotation and a translation to the system on the camera. The translation doesn't influence the differences of the coordinates, and the rotation, often called camera transform, is given by a 3×3-matrix R, transforming into:
and
Substitution of these expressions, leads to a set of two equations, known as the collinearity equations:
The most obvious use of these equations is for images recorded by a camera. In this case the equation describes transformations from object space (X, Y, Z) to image coordinates (x, y). It forms the basis for the equations used in bundle adjustment.
They indicate that the image point (on the sensor plate of the camera), the observed point (on the object) and the projection center of the camera were aligned when the picture was taken.
See also
3D projection
Epipolar geometry
Pinhole camera model
References
Photogrammetry
Geometry in computer vision |
https://en.wikipedia.org/wiki/KeepVault | KeepVault is an online backup service to perform online and local backups of Windows-based personal computers and servers. KeepVault uses a storage-based pricing model which allows it to offer unlimited users and devices under one account. The KeepVault technology uses end-to-end encryption and files can be accessed from other computers or via the web.
History
KeepVault was first created by Proxure in 2006. In January 2012 Proxure was acquired by AuthenTec, Inc. Following AuthenTec, Inc.’s acquisition by Apple, Inc., KeepVault was acquired by a group of the original developers and became an independent company.
Products
Keepvault offers a Windows desktop application and a Windows Server Add-in, and has two plan types (Home and Professional) as well as free local backup.
OEM Distribution
In 2007 KeepVault was an early OEM vendor for backup when Microsoft launched Windows Home Server. KeepVault was shipped on the HP Data Vault and HP Mediasmart servers.
Starting in 2013, the KeepVault Dashboard Add-in is preinstalled on the Western Digital Sentinel server series.
Backup Awareness Week
As a joint business and community effort KeepVault launched Backup Awareness Week in May of 2014. “Backup Week” is designed to educate the public about the risks of data loss, and ways to protect their data.
Criticism
In 2008 bloggers complained about the end of unlimited data plans. Since then KeepVault has taken the position that unlimited plans are unsustainable.
See also
List of online backup services
References
External links
Backup software
Backup
File hosting
Cloud storage
Windows software
File hosting for Windows |
https://en.wikipedia.org/wiki/Pterulaceae | The Pterulaceae are a family of fungi in the order Agaricales. According to a 2008 estimate, the family contained 99 species previously distributed among 12 genera. More recent data from molecular phylogenetic reconstruction showed that members of the genus Parapterulicium are unrelated to Pterulaceae and also polyphyletic. A new genus Baltazaria was created and both genera were moved to Russulales, to families Lachnocladiaceae and Peniophoraceae respectively.
A major reappraisal of Pterulaceae was recently published by Leal-Dutra et al., creating the new genus Myrmecopterula, to encompass those species cultivated by Apterostigma ants in the neotropics, and resurrecting the genus Phaeopterula to accommodate species with darker basidiomes. The genus Deflexula was merged into Pterulicium. Additionally, the genera Aphanobasidium, Radulomyces and Radulotubus were removed to a new family, Radulomycetaceae.
See also
List of Agaricales families
References
External links
Pterulaceae |
https://en.wikipedia.org/wiki/Titan%20traffic%20database | The Titan traffic database is a database allegedly in use by the Swedish signals intelligence agency, the National Defence Radio Establishment (FRA), according to a news report by Rapport on SVT in June 2008, based on an account from an anonymous source. The source alleged the agency had been storing "massive amounts of information" about "who have been talking to whom, but no content"; leading to a private citizen lodging a complaint with the police. Ultimately, a prosecutor did not launch a full-scale investigation, as it was deemed not illegal at the time.
See also
Echelon
MAINWAY
References
Military intelligence
Signals intelligence
Privacy of telecommunications
Surveillance scandals
Mass surveillance
Surveillance databases
Databases in Sweden |
https://en.wikipedia.org/wiki/Larry%20L.%20Peterson | Larry L. Peterson is an American computer scientist, known primarily as the Director of the PlanetLab Consortium, co-author (with Bruce Davie) of the networking textbook "Computer Networks: A Systems Approach," and for his research on the TCP Vegas congestion control algorithm and the x-kernel operating system.
Peterson received his B.S. in computer science from Kearney State College, Nebraska, in 1979, and M.S. and Ph.D. degrees in computer science from Purdue University in 1982 and 1985 under Douglas Comer, respectively. He then served as a professor at the University of Arizona, and later as the Robert E. Kahn Professor of Computer Science at Princeton University, where he also served as a department chair from 2003 to 2009. While at Princeton, he co-founded a startup to commercialize CDN technology developed on PlanetLab that was subsequently acquired by Akamai Technologies. He is now emeritus at Princeton University, and serves as CTO of the Open Networking Foundation.
Peterson was elected a member of the National Academy of Engineering in 2010 for contributions to the design, implementation, and deployment of networked software systems. He is also an ACM Fellow and a IEEE Fellow. He is also the recipient of the IEEE Kobayashi Award and the ACM SIGCOMM Award.
References
External links
Home page of Larry Peterson at Princeton University.
Open Networking Foundation.
Computer Networks: A Systems Approach.
American computer scientists
Living people
Purdue University alumni
University of Arizona faculty
Princeton University faculty
Members of the United States National Academy of Engineering
Fellows of the Association for Computing Machinery
Fellow Members of the IEEE
Year of birth missing (living people) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.