source
stringlengths 32
199
| text
stringlengths 26
3k
|
|---|---|
https://en.wikipedia.org/wiki/Allan%20Borodin
|
Allan Bertram Borodin (born 1941) is a Canadian-American computer scientist who is a professor at the University of Toronto.
Biography
Borodin did his undergraduate studies at Rutgers University, earning a bachelor's degree in mathematics in 1963. After earning a master's degree at the Stevens Institute of Technology in 1966 (while at the same time working part time as a programmer at Bell Laboratories), he continued his graduate studies at Cornell University, completing a doctorate in 1969 under the supervision of Juris Hartmanis.
He joined the Toronto faculty in 1969 and was promoted to full professor in 1977. He served as department chair from 1980 to 1985, and became University Professor in 2011.
Awards and honors
Borodin was elected as a member of the Royal Society of Canada in 1991. In 2008 he won the CRM-Fields-PIMS prize. He became a fellow of the American Association for the Advancement of Science in 2011, and a fellow of the Association for Computing Machinery in 2014 "For contributions to theoretical computer science in complexity, on-line algorithms, resource tradeoffs, and models of algorithmic paradigms." In 2020 he received the Order of Canada.
Selected publications
Research articles
Books
See also
Gap theorem
Online algorithms
Computational Complexity
References
External links
Home Page at University of Toronto
1941 births
Living people
Academic staff of the University of Toronto
American computer scientists
Rutgers University alumni
Stevens Institute of Technology alumni
Cornell University alumni
Fellows of the Royal Society of Canada
Fellows of the American Association for the Advancement of Science
Fellows of the Association for Computing Machinery
Theoretical computer scientists
Members of the Order of Canada
|
https://en.wikipedia.org/wiki/Street%20hierarchy
|
The street hierarchy is an urban planning technique for laying out road networks that exclude automobile through-traffic from developed areas. It is conceived as a hierarchy of roads that embeds the link importance of each road type in the network topology (the connectivity of the nodes to each other). Street hierarchy restricts or eliminates direct connections between certain types of links, for example residential streets and arterial roads, and allows connections between similar order streets (e.g. arterial to arterial) or between street types that are separated by one level in the hierarchy (e.g. arterial to highway and collector to arterial.) By contrast, in many regular, traditional grid plans, as laid out, higher order roads (e.g. arterials) are connected by through streets of both lower order levels (e.g. local and collector.) An ordering of roads and their classification can include several levels and finer distinctions as, for example, major and minor arterials or collectors.
At the lowest level of the hierarchy, cul-de-sac streets
, by definition non-connecting, link with the next order street, a primary or secondary "collector"—either a ring road that surrounds a neighbourhood, or a curvilinear "front-to-back" path—which in turn links with the arterial. Arterials then link with the intercity highways at strictly specified intervals at intersections that are either signalized or grade separated.
In places where grid networks were laid out in the pre-automotive 19th century, such as in the American Midwest, larger subdivisions have adopted a partial hierarchy, with two to five entrances off one or two main roads (arterials) thus limiting the links between them and, consequently, traffic through the neighbourhood.
Since the 1960s, street hierarchy has been the dominant network configuration of suburbs and exurbs in the United States, Canada, Australia, and the UK. It is less popular in Latin America, Western Europe, and China.
Large subdivisions may have three- or even four-tiered hierarchies, feeding into one or two wide arterials, which can be as wide as the ten lane Champs-Élysées or Wilshire Boulevard. Arterials at this level of traffic volume generally require no fewer than four lanes in width; and in large contemporary suburbs, such as Naperville, Illinois, or Irvine, California, are often eight or ten lanes wide. Adjacent street hierarchies are rarely connected to one another.
History
In the pre-automotive era of cities, traces of the concept of a hierarchy of streets in a network appear in Greek and subsequent Roman town plans. The main feature of their classification is their size. In Roman cities, such as Pompeii, major thoroughfares (e.g. the decumanus) had a width of 12.2 m, secondary streets (e.g. the cardo) 6 m and tertiary streets (e.g. vicinae) measured 4.5 meters. The first allowed for two way cart traffic, the second generally only one, while the third only loaded animals. Narrower streets that could only accommod
|
https://en.wikipedia.org/wiki/Boris%20Trakhtenbrot
|
Boris (Boaz) Abramovich Trakhtenbrot (, ; 19 February 1921 – 19 September 2016) was a Russian-Israeli mathematician in logic, algorithms, theory of computation, and cybernetics.
Biography
Trakhtenbrot was born into a Jewish family in Brichevo, northern Bessarabia (now Tîrnova, Moldova). He studied at the Moldovan State Pedagogical Institute in Kishinev, Chernivtsi University, and the Ukrainian Academy of Science's Mathematical Institute, completing a Ph.D. at the latter institution in 1950.
He worked at Akademgorodok, Novosibirsk during the 1960s and 1970s. In 1964 Trakhtenbrot discovered and proved a fundamental result in theoretical computer science called the gap theorem. He also discovered and proved the theorem in logic, model theory, and computability theory now known as Trakhtenbrot's theorem.
After immigrating to Israel in 1981, he became a professor in the Faculty of Exact Sciences at Tel Aviv University, and continued as professor emeritus until his death. He died on 19 September 2016, at the age of 95.
Notes
External links
1921 births
2016 deaths
Bessarabian Jews
Israeli computer scientists
Israeli Jews
20th-century Israeli mathematicians
Israeli people of Moldovan-Jewish descent
Moldovan computer scientists
Moldovan Jews
20th-century Moldovan mathematicians
People from Dondușeni District
Soviet computer scientists
Soviet emigrants to Israel
Soviet mathematicians
Academic staff of Tel Aviv University
Russian scientists
|
https://en.wikipedia.org/wiki/Image%20tracing
|
In computer graphics, image tracing, raster-to-vector conversion or raster vectorization is the conversion of raster graphics into vector graphics.
Background
An image does not have any structure: it is just a collection of marks on paper, grains in film, or pixels in a bitmap. While such an image is useful, it has some limits. If the image is magnified enough, its artifacts appear. The halftone dots, film grains, and pixels become apparent. Images of sharp edges become fuzzy or jagged. See, for example, pixelation. Ideally, a vector image does not have the same problem. Edges and filled areas are represented as mathematical curves or gradients, and they can be magnified arbitrarily (though of course the final image must also be rasterized in to be rendered, and its quality depends on the quality of the rasterization algorithm for the given inputs).
The task in vectorization is to convert a two-dimensional image into a two-dimensional vector representation of the image. It is not examining the image and attempting to recognize or extract a three-dimensional model which may be depicted; i.e. it is not a vision system. For most applications, vectorization also does not involve optical character recognition; characters are treated as lines, curves, or filled objects without attaching any significance to them. In vectorization, the shape of the character is preserved, so artistic embellishments remain.
Vectorization is the inverse operation corresponding to rasterization, as integration is to differentiation. And, just as with these other two operations, while rasterization is fairly straightforward and algorithmic, vectorization involves the reconstruction of lost information and therefore requires heuristic methods.
Synthetic images such as maps, cartoons, logos, clip art, and technical drawings are suitable for vectorization. Those images could have been originally made as vector images because they are based on geometric shapes or drawn with simple curves.
Continuous tone photographs (such as live portraits) are not good candidates for vectorization.
The input to vectorization is an image, but an image may come in many forms such as a photograph, a drawing on paper, or one of several raster file formats. Programs that do raster-to-vector conversion may accept bitmap formats such as TIFF, BMP and PNG.
The output is a vector file format. Common vector formats are SVG, DXF, EPS, EMF and AI.
Vectorization can be used to update images or recover work. Personal computers often come with a simple paint program that produces a bitmap output file. These programs allow users to make simple illustrations by adding text, drawing outlines, and filling outlines with a specific color. Only the results of these operations (the pixels) are saved in the resulting bitmap; the drawing and filling operations are discarded. Vectorization can be used to recapture some of the information that was lost.
Vectorization is also used to recover information that w
|
https://en.wikipedia.org/wiki/S%C3%A1ndor%20Dominich
|
Sándor Dominich (July 12, 1954 – August 13, 2008) was the George Pólya Professor of Computer Science, and the founding leader of the Centre for Information Retrieval, Faculty of Information Technology, University of Pannonia, Veszprém, Hungary.
Born in Aiud, Romania, Dominich proposed the Interaction Information Retrieval (I2R) model based on the Copenhagen Interpretation of Quantum Mechanics using Artificial Neural Networks. The I2R model was implemented in the I2RMeta Web meta-search engine, in the NeuRadIR medical image intranet search engine, and in the (i2r)Application intranet search engines.
He died at the age of 54 in Sopron in 2008.
Dominich is the author of the books
"Mathematical Foundations of Information Retrieval", Kluwer Academic Publishers, (now Springer Verlag), 2001,
and
"The Modern Algebra of Information Retrieval", Springer Verlag, 2008.
External links
Book Cover
Book Cover
Research group homepage
"Mathematical, logical, and formal methods in information retrieval: an introduction to the special issue". Journal of the American Society for Information Science and Technology. Volume 54, Issue 4 (February 2003). pgs. 281–284.
Hungarian computer scientists
People from Aiud
2008 deaths
1954 births
|
https://en.wikipedia.org/wiki/Component-based%20software%20engineering
|
Component-based software engineering (CBSE), also called component-based development (CBD), is a style of software engineering that aims to build software out of loosely-coupled, modular components. It emphasizes the separation of concerns among different parts of a software system.
Definition and characteristics of components
An individual software component is a software package, a web service, a web resource, or a module that encapsulates a set of related functions or data.
Components communicate with each other via interfaces. Each component provides an interface (called a provided interface) through which other components can use it. When a component uses another component's interface, that interface is called a used interface.
In the UML illustrations in this article, provided interfaces are represented by lollipop-symbols, while used interfaces are represented by open socket symbols.
Components must be substitutable, meaning that a component must be replaceable by another one having the same interfaces without breaking the rest of the system.
Components should be reusable.
Component-based usability testing should be considered when software components directly interact with users.
Components should be:
fully documented
thoroughly tested
robust - with comprehensive input-validity checking
able to pass back appropriate error messages or return codes
History
The idea that software should be componentized - built from prefabricated components - first became prominent with Douglas McIlroy's address at the NATO conference on software engineering in Garmisch, Germany, 1968, titled Mass Produced Software Components. The conference set out to counter the so-called software crisis. McIlroy's subsequent inclusion of pipes and filters into the Unix operating system was the first implementation of an infrastructure for this idea.
Brad Cox of Stepstone largely defined the modern concept of a software component. He called them Software ICs and set out to create an infrastructure and market for these components by inventing the Objective-C programming language. (He summarizes this view in his book Object-Oriented Programming - An Evolutionary Approach 1986.)
The software components are used in two different contexts and two kinds: i) using components as parts to build a single executable, or ii) each executable is treated as a component in a distributed environment, where components collaborate with each other using internet or intranet communication protocols for IPC (Inter Process Communications). The above belongs to former kind, while the below belongs to later kind.
IBM led the path with their System Object Model (SOM) in the early 1990s. As a reaction, Microsoft paved the way for actual deployment of component software with Object linking and embedding (OLE) and Component Object Model (COM). many successful software component models exist.
In 2021 open-source toolchain Bit provided a free infrastructure for the development and com
|
https://en.wikipedia.org/wiki/International%20Centre%20for%20Low%20Dose%20Radiation%20Research
|
The International Centre for Low Dose Radiation Research (ICLDRR) was established at the University of Ottawa, in 1997, with national and international support. The ICLDRR assembles all published data and conducts analyses concerning the effects of low doses of radiation on humans and in the environment. ICLDRR's main focus is to contribute to clarifying whether low and very low doses of ionizing radiation increase the risk of cancer. To that end, the ICLDRR has assembled and analysed virtually all published data on cancer induction in laboratory animals by low doses of ionizing radiation, and published initial findings at specialized international conferences, since 1998.
The foremost contribution of the ICLDRR is the setup of a radiation low-dose mammal-experiment database. Their results have been used in support of the radiation hormesis hypothesis, wherein low-dose radiation may actually be beneficial for health. They were quoted in a famous report by the French Academies as evidence that this effect takes place in 40% of low-dose animal experiments.
The work at ICLDRR is funded by several actors of the nuclear industry such as the United States Department of Energy, Électricité de France, Cogema Resources, Inc. (Canada) or the Central Research Institute of the Electric Power Industry (Japan).
References
External links
The International Centre for Low Dose Radiation Research
Research institutes in Canada
International research institutes
|
https://en.wikipedia.org/wiki/G.%20Mike%20Reed
|
George Michael ("Mike") Reed is an American computer scientist. He has contributed to theoretical computer science in general and CSP in particular.
Mike Reed has a doctorate in pure mathematics from Auburn University, United States, and a doctorate in computation from Oxford University, England. He has an interest in mathematical topology.
Reed was a Senior Research Associate at NASA Goddard Space Flight Center. From 1986 to 2005, he was at the Oxford University Computing Laboratory (now the Oxford University Department of Computer Science) in England where he was also a Fellow in Computation of St Edmund Hall, Oxford (1986–2005). In 2005, he became Director of UNU/IIST, Macau, part of the United Nations University.
References
External links
Year of birth missing (living people)
Living people
Auburn University alumni
Alumni of the University of Oxford
Members of the Department of Computer Science, University of Oxford
Fellows of St Edmund Hall, Oxford
Academic staff of United Nations University
American computer scientists
Formal methods people
Topologists
20th-century American mathematicians
21st-century American mathematicians
|
https://en.wikipedia.org/wiki/John%20Fitzgerald%20%28computer%20scientist%29
|
John S. Fitzgerald FBCS (born 1965) is a British computer scientist. He is a professor at Newcastle University. He was the head of the School of Computing before taking on the role of Dean of Strategic Projects in the university’s Faculty of Science, Agriculture and Engineering. His research interests are in the area of dependable computer systems and formal methods, with a background in the VDM. He is a former Chair of Formal Methods Europe and committee member of BCS-FACS.
Education
Fitzgerald was born in Belfast, Northern Ireland, and was educated at Bangor Grammar School and the Victoria University of Manchester. He holds the BSc in Computing and Information Systems and the PhD degrees from the Department of Computer Science at Manchester.
Selected books
Bicarregui, J.C., Fitzgerald, J.S. and Lindsay, P.A. et al., Proof in VDM: a Practitioner's Guide. Springer-Verlag Formal Approaches to Computing and Information Technology (FACIT), 1994. .
Fitzgerald, J.S. and Larsen, P.G., Modelling Systems: Practical Tools and Techniques in Software Engineering. Cambridge University Press, 1998. . (Japanese Edition pub. Iwanami Shoten, 2003. .)
Fitzgerald, J.S., Larsen, P.G., Mukherjee, P. et al., Validated Designs for Object-oriented Systems. Springer-Verlag, 2005. .
See also
Colleagues at Newcastle University:
Cliff Jones
Brian Randell
References
External links
Home page
1965 births
Living people
Scientists from Belfast
Alumni of the Victoria University of Manchester
British computer scientists
Formal methods people
Academics of Newcastle University
Computer science writers
Fellows of the British Computer Society
People educated at Bangor Grammar School
|
https://en.wikipedia.org/wiki/Marconi%20Prize
|
The Marconi Prize is an annual award recognizing achievements and advancements made in field of communications (radio, mobile, wireless, telecommunications, data communications, networks, and Internet). The prize is awarded by the Marconi Society, and it includes a $100,000 honorarium and a work of sculpture. Recipients of the prize are awarded at the Marconi Society's annual symposium and gala.
Occasionally, the Marconi Society Lifetime Achievement Award is bestowed on legendary late-career individuals, recognizing their transformative contributions and remarkable impacts to the field of communications and to the development of the careers of students, colleagues and peers, throughout their lifetimes. So far, the recipients include Claude E. Shannon (2000, died in 2001), William O. Baker (2003, died in 2005), Gordon E. Moore (2005), Amos E. Joel Jr. (2009, died in 2008), Robert W. Galvin (2011, died in 2011), and Thomas Kailath (2017).
Criteria
The Marconi Prize is awarded based on the candidate’s contributions in the following areas:
The significance of the impact of the nominee’s work on widely-used technology.
The scientific importance of the nominee’s work in setting the stage for, influencing, and advancing the field beyond the nominee’s own achievements.
The nominee’s contributions to innovation and entrepreneurship by introducing completely new ideas, methods, or technologies. These may include forming, leading, or advising organizations, mentoring students on moving ideas from research to implementation, or fostering new industries/enabling scale implementation.
The social and humanitarian impact of the nominee’s contributions to the design, development, and/or deployment of new communication technologies or communications public policies that promote social development and/or inclusiveness.
Marconi Fellow
The Marconi Prize winners are also named as Marconi Fellows. The foundation and the prize are named after the honor of Guglielmo Marconi, a Nobel laureate and one of the pioneers of radio communications. Recipients of the Marconi Prize are also expected to pursue further creative work to advance the understanding and development of communications technology for the benefit of mankind.
List of Marconi Prize winners
Past winners of the Marconi Prize include Lawrence E. Page and Sergey Brin for the development of web search company Google, Tim Berners-Lee for his leadership and innovations in the World Wide Web, Nobel Laureate Charles K. Kao for developing fiber-optic communications, and Martin Hellman and Whitfield Diffie for their work in security - the Diffie–Hellman key exchange. The first award was given in 1975.
1975–1996
1975: James Rhyne Killian
1976: Hiroshi Inose
1977: Arthur Leonard Schawlow
1978: Colin Cherry
1979: John Robinson Pierce
1980: Yash Pal
1981: Seymour Papert
1982: Arthur C. Clarke
1983: Francesco Carassa
1984: Eric Albert Ash
1985: Charles Kuen Kao
1986: Leonard Kleinrock
1987: Robert Wen
|
https://en.wikipedia.org/wiki/Clock%20gating
|
In computer architecture, clock gating is a popular power management technique used in many synchronous circuits for reducing dynamic power dissipation, by removing the clock signal when the circuit is not in use or ignores clock signal. Clock gating saves power by pruning the clock tree, at the cost of adding more logic to a circuit. Pruning the clock disables portions of the circuitry so that the flip-flops in them do not have to switch states. Switching states consumes power. When not being switched, the switching power consumption goes to zero, and only leakage currents are incurred.
Although asynchronous circuits by definition do not have a global "clock", the term perfect clock gating is used to illustrate how various clock gating techniques are simply approximations of the data-dependent behavior exhibited by asynchronous circuitry. As the granularity on which one gates the clock of a synchronous circuit approaches zero, the power consumption of that circuit approaches that of an asynchronous circuit: the circuit only generates logic transitions when it is actively computing.
Details
An alternative solution to clock gating is to use Clock Enable (CE) logic on synchronous data path employing the input multiplexer, e.g., for D type flip-flops: using C / Verilog language notation: Dff= CE? D: Q;
where: Dff is D-input of D-type flip-flop, D is module information input (without CE input), Q is D-type flip-flop output. This type of clock gating is race condition free and is preferred for FPGAs designs and for clock gating of the small circuit. For FPGAs every D-type flip-flop has an additional CE input signal.
Clock gating works by taking the enable conditions attached to registers, and uses them to gate the clocks. A design must contain these enable conditions in order to use and benefit from clock gating. This clock gating process can also save significant die area as well as power, since it removes large numbers of muxes and replaces them with clock gating logic. This clock gating logic is generally in the form of "integrated clock gating" (ICG) cells. However, the clock gating logic will change the clock tree structure, since the clock gating logic will sit in the clock tree.
Clock gating logic can be added into a design in a variety of ways:
Coded into the register transfer level (RTL) code as enable conditions that can be automatically translated into clock gating logic by synthesis tools (fine grain clock gating).
Inserted into the design manually by the RTL designers (typically as module level clock gating) by instantiating library specific integrated clock gating (ICG) cells to gate the clocks of specific modules or registers.
Semi-automatically inserted into the RTL by automated clock gating tools. These tools either insert ICG cells into the RTL, or add enable conditions into the RTL code. These typically also offer sequential clock gating optimisations.
Any RTL modifications to improve clock gating will result in functional
|
https://en.wikipedia.org/wiki/Electronic%20Notes%20in%20Theoretical%20Computer%20Science
|
Electronic Notes in Theoretical Computer Science is an electronic computer science journal published by Elsevier, started in 1995. Its issues include many post-proceedings for workshops, etc. The journal is abstracted and indexed in Scopus and Science Citation Index.
Electronic Notes in Theoretical Computer Science has been discontinued as of 2021.
References
Computer science journals
Elsevier academic journals
Academic journals established in 1995
|
https://en.wikipedia.org/wiki/Theoretical%20Computer%20Science%20%28journal%29
|
Theoretical Computer Science (TCS) is a computer science journal published by Elsevier, started in 1975 and covering theoretical computer science. The journal publishes 52 issues a year. It is abstracted and indexed by Scopus and the Science Citation Index. According to the Journal Citation Reports, its 2020 impact factor is 0.827.
References
Computer science journals
Elsevier academic journals
Academic journals established in 1975
|
https://en.wikipedia.org/wiki/Destination-Sequenced%20Distance%20Vector%20routing
|
Destination-Sequenced Distance-Vector Routing (DSDV) is a table-driven routing scheme for ad hoc mobile networks based on the Bellman–Ford algorithm. It was developed by C. Perkins and P. Bhagwat in 1994. The main contribution of the algorithm was to solve the routing loop problem. Each entry in the routing table contains a sequence number, the sequence numbers are generally even if a link is present; else, an odd number is used. The number is generated by the destination, and the emitter needs to send out the next update with this number. Routing information is distributed between nodes by sending full dumps infrequently and smaller incremental updates more frequently.
For example, the routing table of Node A in this network is
Naturally the table contains description of all possible paths reachable by node A, along with the next hop, number of hops and sequence number.
Selection of Route
If a router receives new information, then it uses the latest sequence number. If the sequence number is the same as the one already in the table, the route with the better metric is used. Stale entries are those entries that have not been updated for a while. Such entries as well as the routes using those nodes as next hops are deleted.
Advantages
The availability of paths to all destinations in network always shows that less delay is required in the path set up process.
The method of incremental update with sequence number labels, marks the existing wired network protocols adaptable to Ad-hoc wireless networks. Therefore, all available wired network protocol can be useful to ad hoc wireless networks with less modification.
Disadvantages
DSDV requires a regular update of its routing tables, which uses up battery power and a small amount of bandwidth even when the network is idle.
Whenever the topology of the network changes, a new sequence number is necessary before the network re-converges; thus, DSDV is not suitable for highly dynamic or large scale networks. (As in all distance-vector protocols, this does not perturb traffic in regions of the network that are not concerned by the topology change.)
Influence
While DSDV itself does not appear to be much used today, other protocols have used similar techniques. The best-known sequenced distance vector protocol is AODV, which, by virtue of being a reactive protocol, can use simpler sequencing heuristics. Babel is an attempt at making DSDV more robust, more efficient and more widely applicable while staying within the framework of proactive protocols.
References
Ad hoc routing protocols
|
https://en.wikipedia.org/wiki/Don%20Sannella
|
Donald T. Sannella FRSE is professor of computer science in the Laboratory for Foundations of Computer Science, at the School of Informatics, University of Edinburgh, Scotland.
Sannella graduated from Yale University, University of California, Berkeley and University of Edinburgh with degrees in computer science. His research interests include: algebraic specification and formal software development, correctness of modular systems, types and functional programming, resource certification for mobile code.
Sannella is founder of the European Joint Conferences on Theory and Practice of Software, a confederation of computer science conferences, held annually in Europe since 1998.
He is editor-in-chief of the journal Theoretical Computer Science,
and is co-founder and CEO of Contemplate Ltd. His father is Ted Sannella.
Honours and awards
In 2014 Sannella was elected a Fellow of the Royal Society of Edinburgh.
Personal Life
Don Sanella loves to ski and is often found out on the slopes.
References
External links
Official home page
Personal home page
Publications
Year of birth missing (living people)
Living people
Scottish computer scientists
Alumni of the University of Edinburgh
Academics of the University of Edinburgh
Formal methods people
Academic journal editors
Place of birth missing (living people)
Yale University alumni
University of California alumni
Fellows of the Royal Society of Edinburgh
|
https://en.wikipedia.org/wiki/List%20of%20The%20Cosby%20Show%20episodes
|
The Cosby Show aired on the NBC television network from September 20, 1984 to April 30, 1992. There were 201 original episodes and one best-moments special, spanning a total of eight seasons.
Series overview
Episodes
Season 1 (1984–1985)
The opening credits show the Huxtable family arriving at Central Park and playing various sports there, in a series of still images. The show's theme song, titled "Kiss Me", was composed by Stu Gardner and Bill Cosby. Two different versions of the theme song were used in this season: a longer version in the pilot and one other episode, and a shorter version with a slightly different arrangement for the rest of the episodes.
The pilot was recorded in May 1984. Regular production began in July 1984, with the episode "Goodbye Mr. Fish" (#0102), which was recorded during the first week of August.
Sabrina LeBeauf appeared as Sondra Huxtable in only four episodes: the 10th, 19th, 21st, and 24th of the season.
Season 2 (1985–1986)
For this season, the opening credits were changed to a series of clips of the cast dancing in a gray, featureless room. Each cast member, in descending age of their characters, dances alongside Cosby as his/her name is shown in the credits. Then as the production credits appear, Cosby is seen alone, stiffly "dancing" to the music. On the last note of the music, he quickly turns his head and looks into the camera before the image fades to black.
A new musical arrangement of the theme song was used, but it did not depart significantly from the general "jazzy" feel of the first season. As before, two different versions of the theme were used, with the longer version featuring more of a synth beat than the shorter. Midway through the season, following her marriage to NBC sportscaster Ahmad Rashad, Phylicia Ayers-Allen's name in the opening credits was changed to Phylicia Rashād. (The diacritic was dropped in season five, when her credit was changed to Phylicia Rashad.) After producer Caryn Sneider got married, her credit was also changed to use her married name, Caryn Sneider Mandabach.
Sabrina Le Beauf (as Sondra) became a regular cast member in this season, appearing in 9 of the 25 episodes.
Season 3 (1986–1987)
This season's opening credits featured the cast dancing to Latin jazz in a bluish gray room. As in the previous season, Cosby dances alone as the production credits appear and quickly turns his head to look into the camera on the final musical note. Again, two versions of the sequence were used, however, unlike in previous seasons, the long and short versions differed only in their editing, not in the sound of the music.
Phylicia Rashad was pregnant throughout much of this season, so the crew hid her stomach for most of the season using such devices as kitchen counters or bed covers. She did not appear in the 13th and 14th episodes of the season.
Despite continuing to be credited as series regulars, Sabrina Le Beauf (Sondra) did not appear in 17 of the season's 25 episodes and
|
https://en.wikipedia.org/wiki/Laboratory%20for%20Foundations%20of%20Computer%20Science
|
The Laboratory for Foundations of Computer Science (LFCS) is a research institute within the School of Informatics at the University of Edinburgh, in Scotland. It was founded in 1987 and is a community of theoretical computer scientists with interests in concurrency, semantics, categories, algebra, types, logic, algorithms, complexity, databases and modelling.
References
External links
LFCS website
People
University of Edinburgh School of Informatics
Science and technology in Edinburgh
1987 establishments in Scotland
Research institutes established in 1987
|
https://en.wikipedia.org/wiki/CyberBunker
|
CyberBunker was an Internet service provider located in the Netherlands and Germany that, according to its website, "hosted services to any website except child pornography and anything related to terrorism". The company first operated in a former NATO bunker in Zeeland, and later in another former NATO bunker in Traben-Trarbach, Germany.
CyberBunker served as a web host for The Pirate Bay and as one of the many WikiLeaks mirrors. CyberBunker has also been accused of being a host for spammers, botnet command-and-control servers, malware and online scams. The company has also been involved in Border Gateway Protocol hijacks of IP addresses used by Spamhaus and the United States Department of Defense. The Spamhaus hijack was part of an exceptionally large distributed denial of service attack launched against them in March 2013. Because of the size of this attack it received considerable mainstream media attention.
The company is named for its initial location in a former Cold War bunker. As of 2013, CyberBunker listed its address as the bunker, but the location of CyberBunker's servers was unclear.
In September 2019, the German police stormed and shut down the company's operations in its bunker in Traben-Trarbach. Seven suspects were arrested.
History
Dutch bunker (CB-1)
In 1995, Herman-Johan Xennt bought a 20,000 square foot bunker just outside the small town of Kloetinge in the south of the Netherlands, which had been formerly used by NATO, and was built in 1955. The bunker, originally used as a wartime Provincial Military Command Center () of the Dutch military, was built to withstand a nuclear attack. The bunker was de-assessed by the Dutch military in 1994.
With collaborators, Xennt formed the CyberBunker company within the bunker, to offer "bulletproof hosting" of web sites. The company's customers during the 1990s consisted largely of pornography web sites. Its policy was to accept any web site except those related to child pornography and terrorism.
In 2002, a fire broke out in the Dutch bunker. After the fire was put out, it was discovered that besides Internet hosting services, an MDMA laboratory was in operation. Three of the four men charged with the operation of the lab were convicted to three-year prison sentences; the fourth was acquitted due to a lack of evidence. Following the fire the local town denied the company a business license, resulting in the CyberBunker servers being moved to above-ground locations, including Amsterdam.
In its publicity, the company continued to claim that it operated from the bunker. On 29 March 2013, the secure data storage company BunkerInfra issued a press release stating they had been the owners of the Kloetinge bunker since 2010, and that any claims made by CyberBunker regarding their continued usage of the complex were false, and that they have not been operating from the bunker since the fire in 2002. Businessweek reported them as stating that the bunker was "full of junk" when they acqu
|
https://en.wikipedia.org/wiki/RHN
|
RHN could mean:
Red Hat Network, a software update service for Red Hat Linux
Northern Rhodesia, an historical territory in south central Africa
Royal Hospital for Neuro-disability
|
https://en.wikipedia.org/wiki/Squirrel%20%28programming%20language%29
|
Squirrel is a high level imperative, object-oriented programming language, designed to be a lightweight scripting language that fits in the size, memory bandwidth, and real-time requirements of applications like video games.
MirthKit, a simple toolkit for making and distributing open source, cross-platform 2D games, uses Squirrel for its platform. It is used extensively by Code::Blocks for scripting and was also used in Final Fantasy Crystal Chronicles: My Life as a King. It is also used in Left 4 Dead 2, Portal 2 and Thimbleweed Park for scripted events and in NewDark, an unofficial Thief 2: The Metal Age engine update, to facilitate additional, simplified means of scripting mission events, aside of the regular C scripting.
Language features
Dynamic typing
Delegation
Classes, inheritance
Higher order functions
Generators
Cooperative threads (coroutines)
Tail recursion
Exception handling
Automatic memory management (mainly reference counting with backup garbage collector)
Weak references
Both compiler and virtual machine fit together in about 7k lines of C++ code
Optional 16-bit character strings
Syntax
Squirrel uses a C-like syntax.
Factorial in Squirrel
function factorial(x)
{
if (x <= 1) {
return 1;
}
else {
return x * factorial(x-1);
}
}
Generators
function not_a_random_number_generator(max) {
local last = 42;
local IM = 139968;
local IA = 3877;
local IC = 29573;
for(;;) { // loops forever
yield (max * (last = (last * IA + IC) % IM) / IM);
}
}
local randtor = not_a_random_number_generator(100);
for(local i = 0; i < 10; i += 1)
print(">"+resume randtor+"\n");
Classes and inheritance
class BaseVector {
constructor(...)
{
if(vargv.len() >= 3) {
x = vargv[0];
y = vargv[1];
z = vargv[2];
}
}
x = 0;
y = 0;
z = 0;
}
class Vector3 extends BaseVector {
function _add(other)
{
if(other instanceof ::Vector3)
return ::Vector3(x+other.x,y+other.y,z+other.z);
else
throw "wrong parameter";
}
function Print()
{
::print(x+","+y+","+z+"\n");
}
}
local v0 = Vector3(1,2,3)
local v1 = Vector3(11,12,13)
local v2 = v0 + v1;
v2.Print();
Applications
Applications using Squirrel
Code::Blocks, integrated development environment
Enduro/X, cluster application server
Electric Imp, an end-to-end IoT platform
Games using Squirrel
Alien Swarm
Antinomy of Common Flowers
Apex Legends
Battle Brothers
Contagion
Counter Strike: Global Offensive
CRSED: F.O.A.D.
Final Fantasy Crystal Chronicles: My Life as a King
GTA IV'''s IV-MP
Left 4 Dead 2 Liberty Unleashed Mafia II's M2-Multiplayer
Nuclear Dawn OpenTTD Portal 2 Shadow Warrior Simutrans Sonic Unleashed (PS2/Wii)
SuperTux Team Fortress 2 Thimbleweed Park Thief II (unofficial NewDark engine update)
Titanfall Vice City Multiplayer, a mod for Grand Theft Auto: Vice City War Thunder Zero no Tsukaima - Maigo no Period to Ikusen no Symphony (PS2)
Zero no Tsukaima - Muma ga Tsumugu Yokaze no Nocturne
|
https://en.wikipedia.org/wiki/National%20Council%20of%20Young%20Israel
|
The National Council of Young Israel (NCYI) or Young Israel (in Hebrew: , Yisrael Hatza'ir), is a synagogue-based Orthodox Judaism organization in the United States with a network of affiliated "Young Israel" synagogues. Young Israel was founded in 1912, in its earliest form, by a group of 15 young Jews on the Lower East Side of Manhattan. Their goal was to make Orthodox Judaism more relevant to young Americanized Jews at a time when a significant Jewish education was rare, and most Orthodox institutions were Yiddish-speaking and oriented to an older, European Jewish demographic.
Today, Young Israel continues to promote Orthodox involvement of modern American Jews, while also advocating for the issues most relevant to its members, including support for Israel and Religious Zionism.
History
Early in the 20th century, American Jews were striving primarily for social and economic advancement, often leaving their religious observances behind. Because most jobs required working on Saturdays, observance of the Jewish Sabbath was rare, as were many
other traditions. At the same time, the Reform movement had been expanding rapidly for about 40 years, and with its relaxed religious codes, secularly-educated leadership, and English orientation, attracted an increasing number of young people away from the folds of Orthodoxy.
A group of young Orthodox Jews decided to do what they could to make Orthodox Judaism more relevant to their peers, and combat the wave of assimilation by Jews into Reform and secular American society. In 1911, Max Grablowsky, Joshua Horowitz and Benjamin Koenigsberg determined to organize a way to present an orthodox alternative to young people. It developed informally with two programs, one for education and one for worship. After consulting with Judah Magnes, the enlarged group, which was calling itself the Hebrew Circle, renamed itself Young Israel. Benjamin Koenigsberg, the first Orthodox Jewish American attorney loaned his law office to the organization. 1911 also saw the first issue of the Young Israel Viewpoint, a bimonthly that continued publication until 1988.
Seminars
The group developed a Friday night (Sabbath) lecture series in 1912, given in English. Judah Magnes delivered the inaugural address, attended by thousands. This was a major innovation in the Orthodox world. They were initially advised by rabbis Israel Friedlander and Mordecai Kaplan on topics and speakers. According to Bunim, Friedlander and Kaplan were affiliates of the Conservative Jewish Theological Seminary and the Conservative Judaism movement, and they sought to use Young Israel to establish a youth platform for the Conservative movement; until the end of World War I, Young Israel had two groups, the firmly Orthodox, and the more liberal group that worked with the Conservatives. According to Kraut (1998), Kaplan "worked for the Young Israel initiative that in conception was nondenominational..."
Synagogues
The first Young Israel synagogue was establ
|
https://en.wikipedia.org/wiki/HDS
|
HDS may refer to:
Businesses
Hitachi Data Systems, an American software company
Hachette Distribution Services, a Canadian distributor
Technology
HTTP Dynamic Streaming
Hardware-dependent software
Hydrodesulfurization
Hydrodynamic separator
Other uses
Croatian Composers' Society (Croatian: )
Croatian Democratic Party (Croatian: )
Eastgate Airport, near Hoedspruit, South Africa
Harvard Divinity School
Heroes del Silencio, a Spanish rock band
Honduran Sign Language
|
https://en.wikipedia.org/wiki/Robert%20Sedgewick
|
Robert Sedgewick or Sedgwick may refer to:
Robert Sedgewick (computer scientist) (born 1946), American computer scientist and author
Robert Sedgewick (judge) (1848–1906), Justice of the Supreme Court of Canada
Robert Minturn Sedgwick, American football player; first-team All-American in 1920
Robert Sedgwick (c. 1590–1656), American colonist
Robert Sedgwick (actor), American actor
|
https://en.wikipedia.org/wiki/Flexibility%20method
|
In structural engineering, the flexibility method, also called the method of consistent deformations, is the traditional method for computing member forces and displacements in structural systems. Its modern version formulated in terms of the members' flexibility matrices also has the name the matrix force method due to its use of member forces as the primary unknowns.
Member flexibility
Flexibility is the inverse of stiffness. For example, consider a spring that has Q and q as, respectively, its force and deformation:
The spring stiffness relation is Q = k q where k is the spring stiffness.
Its flexibility relation is q = f Q, where f is the spring flexibility.
Hence, f = 1/k.
A typical member flexibility relation has the following general form:
where
m = member number m.
= vector of member's characteristic deformations.
= member flexibility matrix which characterises the member's susceptibility to deform under forces.
= vector of member's independent characteristic forces, which are unknown internal forces. These independent forces give rise to all member-end forces by member equilibrium.
= vector of member's characteristic deformations caused by external effects (such as known forces and temperature changes) applied to the isolated, disconnected member (i.e. with ).
For a system composed of many members interconnected at points called nodes, the members' flexibility relations can be put together into a single matrix equation, dropping the superscript m:
where M is the total number of members' characteristic deformations or forces in the system.
Unlike the matrix stiffness method, where the members' stiffness relations can be readily integrated via nodal equilibrium and compatibility conditions, the present flexibility form of equation () poses serious difficulty. With member forces as the primary unknowns, the number of nodal equilibrium equations is insufficient for solution, in general—unless the system is statically determinate.
Nodal equilibrium equations
To resolve this difficulty, first we make use of the nodal equilibrium equations in order to reduce the number of independent unknown member forces. The nodal equilibrium equation for the system has the form:
where
: Vector of nodal forces at all N degrees of freedom of the system.
: The resulting nodal equilibrium matrix
: The vector of forces arising from loading on the members.
In the case of determinate systems, matrix b is square and the solution for Q can be found immediately from () provided that the system is stable.
The primary system
For statically indeterminate systems, M > N, and hence, we can augment () with I = M−N equations of the form:
The vector X is the so-called vector of redundant forces and I is the degree of statical indeterminacy of the system. We usually choose j, k, …, , and such that is a support reaction or an internal member-end force. With suitable choices of redundant forces, the equation system () augmented by () can now be solved to
|
https://en.wikipedia.org/wiki/Summer%27s%20Best
|
Summer's Best is a Food Network Canada show hosted by Julie Zwillich.
Julie Zwillich travels around vacation country in Ontario visiting local artisans and preparing seasonal recipes at high-end vacation homes. Every episode revolves around a local ingredient(s) and the activities in the area. Many of the episodes involve barbecuing and outdoor dining. Since much of "cottage country" exists near lakes, water sports such as water skiing, wakeboarding, sailing, cliff jumping and snorkeling are often featured.
Summer's Best was created and produced by Tony Armstrong for Cottage Life Television.
External links
Summer's Best at foodtv.ca
Food Network (Canadian TV channel) original programming
2000s Canadian cooking television series
2003 Canadian television series debuts
2005 Canadian television series endings
|
https://en.wikipedia.org/wiki/Jim%20Woodcock
|
James Charles Paul Woodcock is a British computer scientist.
Woodcock gained his PhD from the University of Liverpool. Until 2001 he was Professor of Software Engineering at the Oxford University Computing Laboratory, where he was also a Fellow of Kellogg College. He then joined the University of Kent and is now based at the University of York, where, since October 2012, he has been head of the Department of Computer Science.
His research interests include: strong software engineering, Grand Challenge in dependable systems evolution, unifying theories of programming, formal specification, refinement, concurrency, state-rich systems, mobile and reconfigurable processes, nanotechnology, Grand Challenge in the railway domain. He has a background in formal methods, especially the Z notation and CSP.
Woodcock worked on applying the Z notation to the IBM CICS project, helping to gain a Queen's Award for Technological Achievement, and Mondex, helping to gain the highest ITSEC classification level.
Prof. Woodcock is editor-in-chief of the Formal Aspects of Computing journal.
Books
Jim Woodcock and Jim Davies, Using Z: Specification, Refinement, and Proof. Prentice-Hall International Series in Computer Science, 1996. .
Jim Woodcock and Martin Loomes, Software Engineering Mathematics: Formal Methods Demystified. Kindle Edition, Taylor & Francis, 2007.
References
External links
Official homepage
Personal homepage
Research profile
1956 births
Living people
Alumni of the University of Liverpool
British computer scientists
Formal methods people
Members of the Department of Computer Science, University of Oxford
Fellows of Kellogg College, Oxford
Academics of the University of Kent
Academics of the University of York
Fellows of the British Computer Society
Fellows of the Royal Academy of Engineering
Computer science writers
British textbook writers
Academic journal editors
|
https://en.wikipedia.org/wiki/Marching%20tetrahedra
|
Marching tetrahedra is an algorithm in the field of computer graphics to render implicit surfaces. It clarifies a minor ambiguity problem of the marching cubes algorithm with some cube configurations. It was originally introduced in 1991.
While the original marching cubes algorithm was protected by a software patent, marching tetrahedrons offered an alternative algorithm that did not require a patent license. More than 20 years have passed from the patent filing date (June 5, 1985), and the marching cubes algorithm can now be used freely. Optionally, the minor improvements of marching tetrahedrons may be used to correct the aforementioned ambiguity in some configurations.
In marching tetrahedra, each cube is split into six irregular tetrahedra by cutting the cube in half three times, cutting diagonally through each of the three pairs of opposing faces. In this way, the tetrahedra all share one of the main diagonals of the cube. Instead of the twelve edges of the cube, we now have nineteen edges: the original twelve, six face diagonals, and the main diagonal. Just like in marching cubes, the intersections of these edges with the isosurface are approximated by linearly interpolating the values at the grid points.
Adjacent cubes share all edges in the connecting face, including the same diagonal. This is an important property to prevent cracks in the rendered surface, because interpolation of the two distinct diagonals of a face usually gives slightly different intersection points. An added benefit is that up to five computed intersection points can be reused when handling the neighbor cube. This includes the computed surface normals and other graphics attributes at the intersection points.
Each tetrahedron has sixteen possible configurations, falling into three classes: no intersection, intersection in one triangle and intersection in two (adjacent) triangles. It is straightforward to enumerate all sixteen configurations and map them to vertex index lists defining the appropriate triangle strips.
Comparison with marching cubes
Marching tetrahedra computes up to nineteen edge intersections per cube, where marching cubes only requires twelve. Only one of these intersections cannot be shared with an adjacent cube (the one on the main diagonal), but sharing on all faces of the cube complicates the algorithm and increases memory requirements considerably. On the other hand, the additional intersections provide for a slightly better sampling resolution.
The number of configurations, determining the size of the commonly used lookup tables, is much smaller, since only four rather than eight separate vertices are involved per tetrahedron. There are six tetrahedra to process instead of one single cube. The process is unambiguous, so no additional ambiguity handling is necessary.
The downside is that the tessellation of a cube with tetrahedra requires a choice regarding the orientation of the tetrahedra, which may produce artificial "bumps" in the is
|
https://en.wikipedia.org/wiki/Chester%E2%80%93Birkenhead%20line
|
The Chester–Birkenhead line runs from Chester to Birkenhead via Hooton. Today, it forms part of the Wirral Line network, a commuter rail system operated by Merseyrail. The line was built by the Chester and Birkenhead Railway and opened on 23 September 1840. On 22 July 1847 the railway merged with the Birkenhead, Lancashire and Cheshire Junction Railway which was later renamed to Birkenhead Railway.
History
Early Proposals
The directors of the Grand Junction Railway had originally intended to reach Birkenhead, as a means of connecting to the docks on the River Mersey that was cheaper than getting directly to Liverpool, which would have involved an expensive crossing of the Mersey. The schemes to do so were turned down by Parliament, and the Grand Junction settled for connecting to the Liverpool and Manchester Railway via the Warrington and Newton Railway at Earlestown instead. That was achieved in 1837.
Construction
In 1836 two schemes for a railway from Chester to Birkenhead gained support, and they went to the 1837 session of Parliament. The Chester and Birkenhead Railway would run from a junction with the Chester–Crewe line (as yet unbuilt) at Chester and would serve the several ferry terminals in Birkenhead, and it survived the Parliamentary process.
The Chester and Birkenhead Railway was authorised on 12 July 1837, with capital of £250,000. It was to be a single line; no intermediate stations had been planned at this stage. George Stephenson was the engineer.
The line was built as a single line with structures made suitable for later doubling of the line. The track gauge was to be , in common with the Crewe line. By the end of 1843 Stephenson' estimate of £250,000 was obviously going to be inadequate: the new estimate was now £512,973.
A directors' inspection train ran over the line on 10 September 1840 and the official opening took place on 22 September 1840. In the morning a staff and contractors' train made the round trip from Birkenhead to Chester; there were no passing places and no electric telegraph, so the official party of honoured guests had to wait at Birkenhead with no knowledge of whether the other train was returning on time. The ordinary public service started the next day, 23 September, with five passenger trains each way daily, three on Sundays. From 15 December some passing loops had been installed, and the train service frequency could be improved, to two-hourly.
First years until amalgamation
The Chester and Birkenhead Railway had assumed friendly relations with the Chester and Crewe Railway (C&CR), and it depended on the C&CR for access to the railway network. During the construction phase of the C&CR it simply ran out of money, and on 1 July 1840 it was taken over by the Grand Junction Railway. The GJR was in close partnership with the Liverpool and Manchester Railway, and were discouraged from collaborating with the Chester and Birkenhead, which the L&MR regarded as a competitor, so this was a serious setback
|
https://en.wikipedia.org/wiki/Digital%20Chart%20of%20the%20World
|
The Digital Chart of the World (DCW) is a comprehensive digital map of Earth. It is the most comprehensive geographical information system (GIS) global database that is freely available as of 2006, although it has not been updated since 1992.
Origin
The primary source for this database is the United States Defense Mapping Agency's (DMA) operational navigation chart (ONC) 1:1,000,000 scale paper map series produced by the US, Australia, Canada, and the United Kingdom. These charts were designed to meet the needs of pilots and air crews in medium-and low-altitude en route navigation and to support military operational planning, intelligence briefings, and other needs.
Data structure
The data is divided into 2,094 tiles that represent 5 × 5-degree areas of the globe, except data obtained from Penn State which is broken up by pre-1992 national boundaries, and data from the National Imagery and Mapping Agency (NIMA) which is broken into just five tiles. The data currency varies from place to place, ranging from the mid-1960s to the early 1990s.
The thematic layers of the Digital Chart of the World are:
Political/ocean (country boundaries)
Populated places (urbanized areas and points)
Roads
Railroads
Aeronautical structures
Utilities (electrical, telephone, pipelines)
Drainage system
Hypsographic data
Land cover
Ocean features
Physiography
Cultural landmarks
Transportation structure
Vegetation
Data location
See also
Vector map (VMAP0 and VMAP1 data)
Digital elevation model
Digital terrain model
External links
Digital Chart of the World specification (PDF)
Digital Chart of the World Data Quality Project
Digital Chart of the World (Countries) at WorldMap, Harvard University
Geographic information systems
World maps
|
https://en.wikipedia.org/wiki/Sydney%20Ferries
|
Sydney Ferries is the public transport ferry network serving the city of Sydney, New South Wales. Services operate on Sydney Harbour and the connecting Parramatta River. The network is controlled by the New South Wales Government's transport authority, Transport for NSW, and is part of the authority's Opal ticketing system. In 2017–18, 15.3 million passenger journeys were made on the network.
Services are operated under contract by Transdev Sydney Ferries. Sydney Ferries Corporation is the state government agency that owns the ferry fleet.
History
Early services
Sydney's ferry services can trace their general origins as far back as the arrival of the First Fleet at Sydney Cove where in 1789, a small boat provided a link between Sydney Cove and the farming settlement of Parramatta. The first vessel, officially named the Rose Hill Packet (otherwise known as 'The Lump'), was a hoy crafted by convicts and powered by sails and oars. Return trips between Sydney Cove to Parramatta could take a week to complete.
The ex-convict, Billy Blue, thought to be a Jamaican, provided a cross harbour rowboat from Dawes Point to Blues Point. By 1830, he was running what is thought to be Sydney first regular ferry service. The same year, a regular service was set up between Balmoral Beach and Balgowlah that shortened the otherwise long bush journey between Sydney and Manly and Northern Beaches. As time progressed, a series of rowboat ferrymen set up small operations to transport people from either side of Sydney Harbour. However, the first proper, steam-powered ferry services that could operate regardless of wind and tide appeared in the 1830s and 1840s.
Parramatta River services
North Sydney was still not a heavily populated area in the 1830s, however, Parramatta was growing. The first Australian-built steamship, PS Surprise was launched in 1831 and commenced regular, timetabled services to Parramatta on 1 June 1831. The service, however, was not financially successful and the vessel was sold to Hobart in 1832. It was followed by numerous further steam ferries operated by various business partnerships until the Parramatta River Steam Co, was formed in 1865. Due to the considerable costs of building wharfs, boatman would wait for ferries along the river and for a fee would row ferry passengers ashore. One of two punts near the current Gladesville Bridge was for river ferry passengers and was operated by boatmen. The other punt, Bedlam Ferry, carried main road traffic across the river.
Sydney Ferries Limited
Cross-harbour steam ferry services began in 1842 and this business grew to such an extent that a public company was formed, the North Shore Steam Ferry Co. Ltd. in 1878.
In 1900, the North Shore company was reincorporated as Sydney Ferries Limited (SFL), which progressively took over most other harbour ferry services (except notably the Manly service operated by the Port Jackson & Manly Steamship Company), and eventually became the world's largest ferry op
|
https://en.wikipedia.org/wiki/List%20of%20mobile%20network%20operators%20in%20the%20United%20States
|
This is a list of mobile network operators (MNOs) in the United States. The Cellular Telecommunications & Internet Association (CTIA), lists approximately 30 facilities-based wireless service providers in the United States as members. Competitive Carriers Association (CCA) has over 100 members. Aside from the facilities-based providers, there are over 50 virtual operators that use the top three networks to provide service.
Largest American wireless providers
The top 5 wireless telecommunications facilities-based service providers by subscriber count in the United States are:
AT&T Mobility: 229.1 million (Q2 2023)
Verizon Wireless: 143.3 million (Q2 2023)
T-Mobile US: 116.7 million (Q2 2023)
Dish Wireless: 7.73 million (Q2 2023)
US Cellular: 4.66 million (Q2 2023)
Each active SIM card is considered a subscriber. Wholesale customers include users of machine to machine networks and mobile virtual network operators that operate on the host network, but are managed by wholesale partners. The counts above were taken from each provider's quarterly reports.
Technologies used
4 of the top 5 wireless providers have all standardized on 4G LTE and 5G NR as their wireless communication standards, where as Dish Wireless uses only 5G NR. Of which, LTE has been deployed across their entire coverage area; however, the LTE bands used by each provider remain largely incompatible. 4 of the top 5 carriers have enabled VoLTE and VoNR on their networks, while Dish uses strictly VoNR. AT&T, T-Mobile, Verizon, Dish Wireless , and US Cellular also sell SIM cards through their retail channels, both in-store and online.
The top 5 wireless providers operate nationwide wireless networks which cover most of the population in the United States, while smaller carriers provide native network coverage across selected regions of the United States while supplementing nationwide coverage through roaming agreements with other carriers.
Facilities-based service providers
The following tables lists service providers that own and manage their network equipment and facilities. Unless specified otherwise the subscriber count includes subscribers on the virtual networks hosted.
Contiguous US and Hawaii
Alaska
Puerto Rico and U.S. Virgin Islands
Guam and Northern Mariana Islands
American Samoa
Defunct, merged and acquired operators
Some operators listed below may still function as a separate brand but they no longer own any infrastructure (towers, network, etc.).
See also
List of mobile virtual network operators in the United States
List of CDMA2000 networks
List of UMTS networks
List of LTE networks
List of mobile network operators
List of mobile network operators of the Americas
List of mobile network operators of the Asia Pacific region
References
Wireless
United States
United States
United States
Wireless
|
https://en.wikipedia.org/wiki/Hikkake%20pattern
|
The hikkake pattern, or hikkake, is a technical analysis pattern used for determining market turning-points and continuations. It is a simple pattern that can be observed in market price data, using traditional bar charts, point and figure charts, or Japanese candlestick charts. The pattern does not belong to the collection of traditional candlestick chart patterns.
Though some have referred to the hikkake pattern as an "inside day false breakout" or a "fakey pattern", these are deviations from the original name given to the pattern by Daniel L. Chesler, CMT and are not popularly used to describe the pattern. For example, the name "hikkake pattern" has been chosen over "inside day false breakout" or "fakey pattern" by the majority of book authors who have covered the subject, including: "Technical Analysis: The Complete Resource for Financial Market Technicians" by Charles D. Kirkpatrick and Julie R. Dahlquist, and "Long/Short Market Dynamics: Trading Strategies for Today's Markets" by Clive M. Corcoran, and "Diary of a Professional Commodity Trader" by Peter L. Brandt.
Conceptual basis
The pattern consists of a measurable period of rest and volatility contraction in the market, followed by a relatively brief price move that encourages unsuspecting traders and investors to adopt a false assumption regarding the likely future direction of price. The pattern, once formed, yields its own set of trading parameters for the time and price of market entry, the dollar risk amount (i.e., where to place protective stops), and the expected profit target. The pattern is not meant as a stand alone "system" for market speculation, but rather as an ancillary technique to traditional technical and fundamental market analysis methods.
Description
The pattern is recognized in two variants, one bearish and one bullish. In both variants, the first bar of the pattern is an inside bar (i.e., one which has both a higher low and a lower high, compared with the previous bar). This is then followed by either a bar with both higher low and higher high for the bearish variant, or with lower low and lower high for the bullish variant. Before the pattern produces a trading signal it must be confirmed; this happens when the price passes below the low of the first bar of the pattern (in the bearish variant) or above the high of the first bar (in the bullish variant). Confirmation must occur within three periods of the last bar of the signal for the signal to be considered valid.
Origin
The hikkake pattern was first conceived and introduced to the financial community through a series of published articles written by technical analyst Daniel L. Chesler, CMT. The phrase "Hikkake" is a Japanese verb which means to "trick" or "ensnare." Chesler chose the name "hikkake" after consulting with Yohey Arakawa, Associate Professor of Japanese, Tokyo University of Foreign Studies.
Institutional uses and peer recognition
The hikkake pattern has been adopted for use by IntSt
|
https://en.wikipedia.org/wiki/New%20South%20Wales%20C%20set
|
The C sets were a class of electric multiple units that operated on Sydney's suburban rail network from 1986 up until 2021. Built by A Goninan & Co between 1986 and 1987, they were introduced into service by the State Rail Authority, before later being operated under CityRail and Sydney Trains. A total of 56 carriages were built, with the last sets being withdrawn from service in February 2021, having been gradually replaced by A & B set trains.
Design and construction
The C sets were a follow-on from the K sets. They were built as an interim measure due to delays with the Tangara program. They were also used to train and familiarise staff with the new (at the time) chopper technology. The C sets were the first Sydney suburban trains to be fitted with chopper control, which gives the train smoother acceleration. Gate turn-off thyristors (GTO) were used to control power to the traction motors, hence allowing for smoother acceleration. Following the successful implementation of chopper control, these features were installed on the Tangara and later V set carriages.
The C set carriages were also the first on the suburban network to feature fixed seating (originally covered with fabric, since replaced with vinyl). These cars also featured push-button doors requiring passengers to activate, to increase air-conditioning efficiency. These proved unpopular and the push-buttons on the doors were removed.
The C set was distinguished externally by a fibreglass moulding mounted on the front of the power carriage. It was originally in the State Rail Authority white with orange and red candy livery stripes on the lower portion. C3596 was the only power car to have its Candy-liveried front repainted in CityRail blue and yellow prior to its CityDecker refurbishment in 1998. The chopper cars were amongst the heaviest in the suburban fleet, with the power cars weighing 52 tonnes.
The order was for 56 cars:
In service
The first set entered service in July 1986, operating out of Mortdale Maintenance Depot, some were delivered to Hornsby Maintenance Depot, but by December 1988, all were operating out of Punchbowl Maintenance Depot as sets K40-K51.
The chopper cars were originally targeted as K sets and for a while when they entered service, they ran together with the then-force ventilated K sets. This however caused problems in service as force-ventilated cars were fitted with camshaft control and led to jerking while accelerating. By December 1990, they had been retargeted as C42–C54. In January 1991, these were reformed as 6-car sets numbered C1–C8. By June 1991, all had been transferred to Hornsby Maintenance Depot.
One carriage, C3596 of set C6, was painted in a livery having its fiber-glass front being painted in CityRail colours, with the L7 logo.
During the late 1990s, all were refurbished by A Goninan & Co as part of the CityDecker program. This saw the interiors refurbished with white walls and ceilings, grey floors and blue seats. Power cars receive
|
https://en.wikipedia.org/wiki/Strip%20programming
|
Strip programming or stripping is a technique used for scheduling television and radio programming to ensure consistency and coherency. Television or radio programs of a particular style (such as a television series) are given a regular daily time slot during the week, so that it appears as a strip straight across the weekly schedule. For example, radio and television broadcasters may program a news program at rush hours every day, or at least every weekday.
Strip programming is used to deliver consistent content to targeted audiences. Broadcasters know or predict the times at which certain demographics will be listening to or watching their programs and play them at that time. Most television dayparts outside of prime time use strip programming five days a week (with some selected programs also being stripped on one or both days of the weekend), with the same programs being broadcast every day at the same time to target specific demographics. Strip programming is sometimes criticized as making programming too predictable, and reducing diversity and uniqueness.
Overview
Strip scheduling often applies to any program that airs on multiple consecutive days during the calendar week (most commonly Monday through Friday), whether carried through a television network (such as with a talk show, news program or soap opera) or in syndication. It is commonly restricted to describing the airing of television programs that were originally broadcast on a weekly basis during their original run: The West Wing could be stripped but not Jeopardy!, as Jeopardy! was originally intended to be run daily. It can also refer to shows in prime time that run daily, such as with the short-lived The Jay Leno Show in 2009 and 2010.
For much of the 1960s and into the early 1990s, stripping for syndication was one of, if not the primary profit component of the studio production model in American television. A show became far more profitable if it succeeded in getting three full U.S. seasons (about 75 episodes) or more, as then it was possible to strip it for fifteen weeks (15×5=75) before needing to repeat episodes. Once a series attained five seasons (which would push the show over the 100 episodes threshold), it would be a full six months before it would repeat. For Star Trek, in particular, this was relevant. Only due to an unprecedented letter-writing campaign was the show renewed for its third season, and it did not begin to attain wider popularity until appearing in syndication for a number of years. If it had failed to be renewed for a third season, it would not have been syndicated, and its subsequent popularity and influence would likely not have occurred. Many other shows with lukewarm response in their initial runs became widely appreciated cult favorites as a result of syndication, or helped keep cultural memes associated with them far more widely known than if the shows had only been viewable during their initial time frame.
Michael Grade was responsible for in
|
https://en.wikipedia.org/wiki/Alberni%20Valley%20Heritage%20Network
|
The Alberni Valley Heritage Network in Port Alberni, British Columbia consists of the Alberni Valley Museum (First Nations culture, local and industrial history and folk art), the McLean Mill National Historic Site (a historic steam-operated sawmill), the Alberni Pacific Railway (a steam-powered heritage railway), and the Maritime Discovery Centre.
External links
Alberni Valley Museum
Alberni heritage
Culture of British Columbia
Port Alberni
|
https://en.wikipedia.org/wiki/Blue%20Wave%20%28mail%20reader%29
|
Blue Wave is a file-based offline mail reader that was popular among bulletin board system users, especially users of FidoNet and other networks that generated large volumes of mail. It allowed users to download all of their mail and messages, read and edit them offline, and then upload any replies. This reduced the amount of time they spent on line. The name "Blue Wave" originally referred to the client software, but as new clients were written that supported the same file format, the name came to refer primarily to the format itself.
History
Blue Wave developed after Fred Rappuhn and George Hatchew met at a picnic arranged for local area sysops. The two developed the concept at the picnic and started development immediately. Rappuhn concentrated on the offline reader, while Hatchew concentrated on the BBS door program that would convert the BBS message system to a Blue Wave format. The first version was released to the public 20 September 1990, marketed via their company, Blue Wave Software. Doors for most PC BBS systems were made available over time.
Another offline mail packet format called QWK was created in 1987, but only ran on the commercial PCBoard system. It remained less widely used than Blue Wave until new QWK doors appeared covering many of the same BBS systems. The Blue Wave client software was then adapted to allow it to read and write QWK as well as Blue Wave files.
Rappuhn was hired as a programmer by Electronic Data Systems (EDS) in September 1991 and was unable to continue development for Blue Wave Software. Blue Wave Software dissolved and Hatchew started Cutting Edge Computing to continue development. Hatchew was later involved in a serious car accident, and was unable to continue development of the system past 1993.
Description
Like QWK, Blue Wave message files consisted of a selection of seemingly randomly named files. Messages themselves were stored in the main .DAT file, supported by an information file and a file containing the headers for each message, and a pointer to the body in the DAT.
The Blue Wave packet format has also been supported by other offline mail readers such as BlueMail, MultiMail, and Wolverine. A tool called bwave2mbox is also available to convert Blue Wave packets to mbox files.
Y2K
The Y2K date problem hit Blue Wave, like so many other programs. The Blue Wave Reader that the end users use to read their mail exhibited the problem by the addition of a numerical digit leading the TO: name in the header. The Blue Wave Door on the BBS' exhibited the problem by creating three digit years where there should have been a two digit year. Several fixes not directly related to Blue Wave were created but they worked on the actual messages after they had been imported into the local message bases.
In October 1999, Dale Shipp created a fix called BWREPFIX that corrects the problem on the users end. This solution uses a batch file in the archiver section rather than calling the archiver directly. In the b
|
https://en.wikipedia.org/wiki/QWK%20%28file%20format%29
|
QWK is a file-based offline mail reader format that was popular among bulletin board system (BBS) users, especially users of FidoNet and other networks that generated large volumes of mail. QWK was originally developed by Mark "Sparky" Herring in 1987 for systems running the popular PCBoard bulletin board system, but it was later adapted for other platforms. Herring died of a heart attack in 2020 after being swatted. During the height of bulletin board system popularity, several dozen offline mail readers supported the QWK format.
Description
Like other offline readers, QWK gathered up messages for a particular user using BBS-side QWK software, compressed them using an application such as PKZIP, and then transferred them to the user. This is usually accomplished via a "BBS door" program running on the BBS system. In the case of QWK, the messages were placed in a single large file that was then bundled with several control files and then compressed into a single archive with the file extension, and typically the BBS's "id" name as the base filename in the form . The file was normally sent to the user automatically using the self-starting feature of the ZModem protocol, although most QWK doors allowed a choice of other protocols.
Once the resulting file has been received by the user, the steps are reversed to extract the files from the archive and then open them in a client-side reader. Again, these individual steps are typically automated to a degree, meaning that the user simply has to invoke the door software on the BBS, wait for the download to complete, and then run the client. The various intermediary steps are automated. QWK originally did not include any functionality for uploading replies, but this was quickly addressed as QWK became more popular. QWK placed replies in a file (again, typically with the BBS's "id" as the name) that was exchanged automatically the next time the user called in.
QWK clients varied widely in functionality, but all of them offered basic e-mail and public forum support. Prior to the introduction of QWK and similar systems, it was not uncommon for users with large message volumes to set up their own FidoNet node to quickly gather their mail, but QWK dramatically reduced the required setup, and greatly increased the number of users of offline mail.
Architecture
As QWK was originally designed to work with PCBoard, the system bears many marks of PCBoard's layout for message and forum files. For instance, QWK uses one file to contain the messages, and another that is used to index their headers. QWK was essentially a way to collect messages from PCBoard's internal files and re-package them into a single file.
QWK was later modified to include extended fields that broke out of the original PCBoard limitations. The new format, known as Extended QWK but written as QWKE (pronounced quick-ee), added a series of kludge lines outside the header line of the message that allowed free-form text. For instance, if the SUBJ
|
https://en.wikipedia.org/wiki/Homer%27s%20Triple%20Bypass
|
"Homer's Triple Bypass" is the eleventh episode of the fourth season of the American animated television series The Simpsons. It originally aired on the Fox network in the United States on December 17, 1992. In this episode, Homer suffers a heart attack due to his very poor health and diet. Dr. Hibbert tells Homer that he needs a triple bypass, but the Simpson family resorts to discount surgeon Dr. Nick after learning how expensive the operation would be in a regular hospital.
The episode was written by Gary Apple and Michael Carrington and directed by David Silverman.
Plot
One evening while eating dinner in bed, Homer seems to be having heart problems but is not concerned. The next morning, Marge makes him oatmeal for breakfast but he rejects it in favor of bacon and eggs, despite the chest pains he has just been feeling. Driving to work, he hears an irregular thumping noise, and is relieved when a gas station mechanic tells him it is his heart, not his car.
At work, Mr. Burns observes Homer eating and sleeping on the job, so he berates and threatens to fire him for his gross incompetence. The stress is too much for Homer who eventually has a heart attack. Dr. Hibbert informs him and Marge that he needs coronary artery bypass surgery, which will cost $30,000. Hearing this, Homer has another heart attack, and the fee rises to $40,000. This is far beyond the Simpsons' means. Homer manages to obtain an insurance policy, but has another heart attack as he is signing the contract, which causes it to be immediately revoked. He then approaches leaders of various religious communities, hoping for help, without success.
Finally, he decides to be treated by Dr. Nick Riviera, who will perform any operation for $129.95. The doctor rents a tape to learn how to perform this operation, but something else has been recorded over important parts of the tape. In the operating theater he does not know where to start, but Lisa, who has been reading up on the subject, calls down instructions from her place in the viewing gallery. The operation is a complete success.
Production
The idea for "Homer's Triple Bypass" came from James L. Brooks, who pitched the idea of Homer having a heart attack. However, the writers disagreed with such a heavy topic. The episode was not written by a member of the show's regular staff, but was instead scripted by freelance writers Gary Apple and Michael Carrington, who were hired by Brooks due to the show suffering from a depleted writing team after the third season ended, and because the remaining members did not bother to do the episode. Carrington would provide voice work for later episodes, such as "I Love Lisa" (as Sideshow Raheem), "Homer and Apu" (as a comedian), and "Simpson Tide" (as Homer's drill instructor). Apple and Carrington decided to have a scene where Lisa and Bart visit Homer before his surgery and were unsure of how to do it, so they approached Brooks, who made up the entire scene on the spot. Originally, the sur
|
https://en.wikipedia.org/wiki/New%20Zealand%20Natural
|
New Zealand Natural Premium Ice Cream is a global franchise network based in Auckland, New Zealand. It operates as an international franchisor of ice cream, frozen yoghurt, smoothie, juice parlours and mini-parlours, which can be found in shopping centres in Australia, New Zealand, Thailand and other countries. The ice cream is also available at supermarkets throughout New Zealand and Australia.
Company history
New Zealand Natural began as a small ice creamery in Christchurch, New Zealand in 1984 that specialized in ice cream with no artificial colours or flavours. Then by chance, Rael Polivnick, who founded the company, met the owner on a flight crossing the Tasman Sea. Polivnick, seeing the potential, purchased the rights to open a New Zealand Natural store at Bondi Beach in Sydney in 1985.
Recognition
New Zealand Natural has won the Export Award at the Westpac New Zealand Franchise Awards and the SIAL D'Or Award in France.
The company's Gold Pure Vanilla was named best in Category at the 14th New Zealand Ice Cream Awards in 2010.
References
External links
Ice cream parlors
Dairy products companies of New Zealand
Regional restaurant chains
Ice cream brands
1984 establishments in New Zealand
|
https://en.wikipedia.org/wiki/James%20D.%20Sachs
|
James D. Sachs (born 1949) is a retired United States Air Force veteran, video game artist and game programmer.
Sachs was the lead artist on the groundbreaking Amiga computer game Defender of the Crown from Cinemaware (first published in 1986). He is also the author of the Commodore 64 game Saucer Attack, which was heavily pirated. He called it "the Commodore 64 game everyone had, but no one purchased". He is also the author of the CompuTrainer 3D software, Marine Aquarium simulation screensaver SereneScreen Aquarium, and of the user interfaces and start-up animations of the Amiga CDTV and Amiga CD32.
Some time after finishing development of Defender of the Crown, Sachs began working on a video game adaptation of the 20,000 Leagues Under the Sea. Unable to secure from Disney the rights for a game based on their 1954 film, Sachs instead based his design on the original book by Jules Verne, but was ultimately unable to secure funding.
External links
James D. Sachs home page
James D. Sachs Interview - 2020 on AmigaLove.com
James D. Sachs page on MobyGames
Interview with James D. Sachs
The same interview in French on Obligement
The Art of James D. Sachs on Yo Ho Video
Jim Sachs Interview - June 2009 at the Personal Computer Museum
American computer programmers
Living people
1949 births
Video game artists
Video game programmers
|
https://en.wikipedia.org/wiki/The%20War%20of%20the%20Simpsons
|
"The War of the Simpsons" is the twentieth episode of the second season of the American animated television series The Simpsons. It originally aired on the Fox network in the United States on May 2, 1991. In the episode, Homer gets drunk at a dinner party and embarrasses Marge, so she enrolls them in marriage counseling at a lakeside retreat with Reverend Lovejoy.
The episode was written by John Swartzwelder and directed by Mark Kirkland. It was the last episode Kirkland directed during his first year on the show. Although not named until season three's "Black Widower", the character Snake Jailbird appeared for the first time in this episode. "The War of the Simpsons" features songs such as Tom Jones's "It's Not Unusual", Dusty Springfield's "The Look of Love", KC and the Sunshine Band's "That's the Way (I Like It)", and Glen Campbell's "Wichita Lineman".
Since airing, the episode has received mostly positive reviews from television critics. It acquired a Nielsen rating of 11.6 and was the second highest-rated show on Fox the week it aired.
Plot
During a party at the Simpsons' house, Homer humiliates himself by getting drunk, insulting guests, and leering at Maude Flanders' cleavage. At church the next day, Marge signs up for marriage counseling at a weekend retreat hosted by Reverend Lovejoy and his wife Helen. When Homer learns the retreat will be held at Catfish Lake, he packs his fishing equipment, but Marge tells him they are only attending to resolve their marital problems. On the way to the retreat, Homer stops at a bait shop and learns of the legendary catfish General Sherman.
At the lake the next morning, Homer tries to sneak away to fish, but Marge is upset that he would choose fishing over their marriage. Instead of returning to bed, Homer takes a walk and finds an abandoned fishing pole on a dock. As he grabs the pole with General Sherman on the line, the fish yanks him from the pier into a small rowboat and onto the lake. From their cabin window, Marge grows angry watching Homer battle General Sherman. Marge attends the marriage workshops alone while Homer triumphantly docks with General Sherman aboard the boat. When Homer returns, Marge tells him their marriage is in serious trouble if he values fishing more than his wife. To prove his love for her, Homer releases the fish, which swims away.
While Marge and Homer are away, Grampa babysits Bart and Lisa, who trick their grandfather into letting them throw a party. After the party ends, the house is a total mess. When Grampa cries, they fear their mess will land him in trouble with their parents, so they frantically clean the house. Once home, Marge praises Grampa for the house's cleanliness. He reveals his secret is "pretending to cry" to con his grandchildren into cleaning it. Bart and Lisa realize they were tricked as Grampa leaves while laughing at them.
Production
The episode was written by John Swartzwelder, and it was the last episode Mark Kirkland directed during his fi
|
https://en.wikipedia.org/wiki/Interrupt%20vector%20table
|
An interrupt vector table (IVT) is a data structure that associates a list of interrupt handlers with a list of interrupt requests in a table of interrupt vectors. Each entry of the interrupt vector table, called an interrupt vector, is the address of an interrupt handler(also known as ISR). While the concept is common across processor architectures, IVTs may be implemented in architecture-specific fashions. For example, a dispatch table is one method of implementing an interrupt vector table.
Interrupts are assigned a number between 0 to 255. The interrupt vectors for each interrupt number are stored in the lower 1024 bytes of main memory. For example, interrupt 0 is stored from 0000:0000 to 0000:0003, interrupt 1 from 0000:0004 to 0000:0007, and so on.
Background
Most processors have an interrupt vector table, including chips from Intel, AMD, Infineon, Microchip Atmel, NXP, ARM etc.
Interrupt handlers
Handling methods
An interrupt vector table is used in the three most popular methods of finding the starting address of the interrupt service routine:
"Predefined"
The "predefined" method loads the program counter (PC) directly with the address of some entry inside the interrupt vector table. The jump table itself contains executable code. While in principle an extremely short interrupt handler could be stored entirely inside the interrupt vector table, in practice the code at each entry is a single jump instruction that jumps to the full interrupt service routine (ISR) for that interrupt. The Intel 8080, Atmel AVR and all 8051 and Microchip microcontrollers use the predefined approach.
"Fetch"
The "fetch" method loads the PC indirectly, using the address of some entry inside the interrupt vector table to pull an address out of that table, and then loading the PC with that address. Each and every entry of the IVT is the address of an interrupt service routine. All Motorola/Freescale microcontrollers use the fetch method.
"Interrupt acknowledge"
For the "interrupt acknowledge" method, the external device gives the CPU an interrupt handler number. The interrupt acknowledge method is used by the Intel Pentium and many older microprocessors.
When the CPU is affected by an interrupt, it looks up the interrupt handler in the interrupt vector table, and transfers control to it.
See also
Interrupt descriptor table (x86 Architecture implementation)
References
External links
Intel® Architecture Software Developer's Manual, Volume 3: System Programming Guide
Intel 64 and IA-32 Architectures Software Developer’s Manual, Volume 3A:System Programming Guide, Part 1 (see CHAPTER 6, INTERRUPT AND EXCEPTION HANDLING and CHAPTER 10, ADVANCED PROGRAMMABLE INTERRUPT CONTROLLER)]
Interrupts
|
https://en.wikipedia.org/wiki/In-system%20programming
|
In-system programming (ISP), or also called in-circuit serial programming (ICSP), is the ability of some programmable logic devices, microcontrollers, chipsets and other embedded devices to be programmed while installed in a complete system, rather than requiring the chip to be programmed prior to installing it into the system. It also allows firmware updates to be delivered to the on-chip memory of microcontrollers and related processors without requiring specialist programming circuitry on the circuit board, and simplifies design work.
Overview
There is no standard for in-system programming protocols for programming microcontroller devices. Almost all manufacturers of microcontrollers support this feature, but all have implemented their own protocols, which often differ even for different devices from the same manufacturer. In general, modern protocols try to keep the number of pins used low, typically to 2 pins. Some ISP interfaces manage to achieve the same with just a single pin, others use up to 4 for implementing a JTAG interface.
The primary advantage of in-system programming is that it allows manufacturers of electronic devices to integrate programming and testing into a single production phase, and save money, rather than requiring a separate programming stage prior to assembling the system. This may allow manufacturers to program the chips in their own system's production line instead of buying pre-programmed chips from a manufacturer or distributor, making it feasible to apply code or design changes in the middle of a production run. The other advantage is that production can always use the latest firmware, and new features as well as bug fixes can be implemented and put into production without the delay occurring when using pre-programmed microcontrollers.
Microcontrollers are typically soldered directly to a printed circuit board and usually do not have the circuitry or space for a large external programming cable to another computer.
Typically, chips supporting ISP have internal circuitry to generate any necessary programming voltage from the system's normal supply voltage, and communicate with the programmer via a serial protocol. Most programmable logic devices use a variant of the JTAG protocol for ISP, in order to facilitate easier integration with automated testing procedures. Other devices usually use proprietary protocols or protocols defined by older standards. In systems complex enough to require moderately large glue logic, designers may implement a JTAG-controlled programming subsystem for non-JTAG devices such as flash memory and microcontrollers, allowing the entire programming and test procedure to be accomplished under the control of a single protocol.
History
Starting from the early 1990s an important technological evolution in the architecture of the microcontrollers was witnessed. At first, they were realized in two possible solutions: with OTP (one-time programmable) or with EPROM memories. In these techn
|
https://en.wikipedia.org/wiki/Hengoed%20railway%20station
|
Hengoed railway station is the name of an operational National Rail station situated in Hengoed, Wales, on the Rhymney Line of the Valley Lines network.
History
The current station was initially named Hengoed & Maesycwmmer when opened by the Rhymney Railway in 1858. Then on railway grouping into the Great Western Railway in 1923 it became known as Hengoed Low Level to avoid confusion.
Hengoed High Level railway station
Immediately adjacent, and crossing Hengoed Low Level was another station which originally shared the name Hengoed & Maesycwmmer, serving the Taff Vale Extension from Pontypool to Quakers Yard (and ultimately ). This station was renamed in 1923 to Hengoed High Level. The High Level station was immediately at the end of the Hengoed Viaduct, which carried the line across the Rhymney valley to Maesycwmmer. It was closed in June 1964. The line is disused, but the viaduct has been restored and is now part of the National Cycle Network. Some remains of the platforms have also been preserved.
Maesycwmmer railway station
The towns shared a third railway station on the former Rumney Railway, which on amalgamation with the Brecon and Merthyr Tydfil Junction Railway was called Maesycwmmer & Hengoed. In 1923 it was renamed simply Maesycwmmer.
Services
The station has 4 departures per hour in each direction Mon-Sat daytimes- southbound to , and and northbound to . One each hour of the latter runs through to (with extras at peak times). During the evening, the frequency drops to hourly each way and on Sundays to two-hourly (when trains run southbound to ).
References
External links
Photographs of the current station and remains of Hengoed High Level
Railway stations in Caerphilly County Borough
DfT Category F2 stations
Former Rhymney Railway stations
Railway stations in Great Britain opened in 1858
Railway stations served by Transport for Wales Rail
|
https://en.wikipedia.org/wiki/Openfiler
|
Openfiler is an operating system that provides file-based network-attached storage and block-based storage area network. It was created by Xinit Systems, and is based on the CentOS Linux distribution. It is free software licensed under the GNU GPLv2
History
The Openfiler codebase was started at Xinit Systems in 2001. The company created a project and donated the codebase to it in October 2003.
The first public release of Openfiler was made in May 2004. The latest release was published in 2011.
Although there has been no formal announcement, there is no evidence that Openfiler is being actively developed since 2015. DistroWatch has listed Openfiler as discontinued. The official website states that paid support is still available.
Criticism
Though some users have run Openfiler for years with few problems, in a 2013 article on SpiceWorks website, the author recommended against using Openfiler, citing lack of features, lack of support and risk of data loss.
See also
TrueNAS, a FreeBSD based free and open-source NAS solution
Unraid
OpenMediaVault
XigmaNAS
NetApp filer, a commercial proprietary filer
NexentaStor - Advanced enterprise-level NAS software solution (Debian/OpenSolaris-based)
NAS4Free — network-attached storage (NAS) server software.
Gluster
Zentyal
List of NAS manufacturers
Comparison of iSCSI targets
File area network
Disk enclosure
OpenWrt
References
Further reading
External links
Computer storage devices
Free file transfer software
Software appliances
Network-attached storage
|
https://en.wikipedia.org/wiki/WNTP
|
WNTP (990 AM) is a commercial radio station in Philadelphia, Pennsylvania. WNTP is owned by the Salem Media Group and broadcasts a conservative talk radio format. Most of the programming comes from the co-owned Salem Radio Network including nationally syndicated hosts Mike Gallagher, Hugh Hewitt, Dennis Prager, Sebastian Gorka, Charlie Kirk, Brandon Tatum and Eric Metaxas. A local weekday wake-up show is hosted by Chris Stigall.
By day, WNTP is powered at 50,000 watts, the maximum for U.S. commercial AM stations. But to protect other stations at night, WNTP reduces power to 10,000 watts at sunset. It uses a directional antenna with a four-tower array. The station's studios and transmitter facilities are shared with co-owned WFIL 560 AM on Ridge Pike in Lafayette Hill, Pennsylvania.
History
Early years
The station first signed on the air in . Its original call sign was WIBG which stood for "I Believe in God." It was a Christian radio station owned by St. Paul's Episcopal Church. In the 1930s, WIBG was a daytimer, broadcasting at 500 watts on 970 kilocycles, licensed to the suburb of Glenside, and required to go off the air at night.
With the enactment of the North American Regional Broadcasting Agreement (NARBA) in 1941, WIBG moved to its present frequency on 990 AM. It increased its power to 1,000 watts, its city of license was moved to Philadelphia, and it was given permission to broadcast around the clock at 10,000 watts, by installing a directional antenna.
In the 1940s, the Morning Cheer program presented by George A. Palmer was a weekday Christian broadcast between 7:00am – 8:00am. Beginning in 1945, a Wanamaker Organ concert was broadcast live from Wanamaker's Philadelphia department store each Monday through Saturday from 10:05 to 10:30 am.
WIBG Top 40
In the 1960s, WIBG became a Top 40 radio station. "Wibbage" had great success playing contemporary hits with popular hosts including Joe "The Rockin' Bird" Niagara, Hy Lit, Billy Wright Sr., Frank X. Feller, and others.
In September 1966, rival station 560 WFIL flipped to a Top 40 format and before long passed WIBG in the ratings. WFIL's signal in the growing Philadelphia suburbs was stronger and WIBG was hampered by a poor suburban nighttime signal. WIBG soldiered on as a Top 40 station through most of the first half of the 1970s, including radio greats John Records Landecker, and Johnny "Long John" Wade. It also tried album rock for a time early in the decade. At mid-decade, the station tried a more adult contemporary approach, with sports talk at night. For the 1976 season, it was the flagship station for Philadelphia Phillies baseball.
WIBG and overnight talk show host Don Cannon were featured in the famous "egg yolk drinking" scene in the 1976 film Rocky, playing in the background while the Philadelphia fighter (played by Sylvester Stallone) cracks six raw eggs into a glass and chugs them down.
WZZD
In 1977, management decided that the WIBG image and call s
|
https://en.wikipedia.org/wiki/GR%2011%20%28Spain%29
|
The GR 11, also known as the ruta Transpirenaica in Spain, is part of the extensive GR footpath network of paths, tracks and trails. It runs through the Spanish Pyrenees, passing only briefly into France near Candanchu.
From West to East, the trail starts at Cape Higuer (Basque Country), crosses Navarre and Aragon and finishes at Cap de Creus (Catalonia.) Its exact distance is difficult to measure, roughly and a total elevation change of . The route is separated into 45 sections. At the end of each section there is normally a useful stopping point (camping spot, town, hostel or refuge) but in general, supplies have to be carried for 3–4 days. Because most rivers flow perpendicular to the trail, the GR 11 passes over many valleys affording beautiful vistas but also many ascents and descents - some days as much as ascent (with equivalent descent).
The trail can be walked in either direction - the deciding factors being the steepness of the terrain and the Sun. In the eastern (Catalan Pyrenees) and central part of the route (Aragonese Pyrenees), days are hotter and the profile more steep, which can prove physically challenging, especially for individuals who are less physically fit. The heat is much better tackled when the body has acclimated and physical conditioning has improved toward the end of the trip. Although walking East might provide a more comfortable start, it implies facing the Sun during the morning.
Fit walkers normally manage to complete it in about 44 days, although some people have been known to complete it in 24 days or less.
The GR 10 is a similar route but on the French side of the border while the Haute Randonnée Pyrénéenne (HRP) follows a generally higher route through the Pyrenees, frequently crossing the French-Spanish border.
Hiking trails in Spain
Pyrenees
|
https://en.wikipedia.org/wiki/Fred%20Baker%20%28engineer%29
|
Frederick J. Baker (born February 28, 1952), is an American engineer, specializing in developing computer network protocols for the Internet.
Biography
Baker attended the New Mexico Institute of Mining and Technology from 1970 to 1973. He developed computer network technology starting in 1978 at Control Data Corporation (CDC), Vitalink Communications Corporation, and Advanced Computer Communications.
He joined Cisco Systems in 1994.
He became a Cisco Fellow in 1998, working in university relations and as a research ambassador, and in the IETF. He left Cisco Systems in 2016.
Since 1989, Baker has been involved with the Internet Engineering Task Force (IETF), the body that develops standards for the Internet.
He chaired a number of IETF working groups, including several that specified the management information bases (MIB) used to manage network bridges and popular telecommunications links.
Baker served as IETF chair from 1996 to 2001, when he was succeeded by Harald Tveit Alvestrand.
He served on the Internet Architecture Board from 1996 through 2002. He has co-authored or edited over fifty Request for Comments (RFC) documents on Internet protocols and contributed to others. The subjects covered include network management, Open Shortest Path First (OSPF) and Routing Information Protocol (RIPv2) routing, quality of service (using both the Integrated services and Differentiated Services models), Lawful Interception, precedence-based services on the Internet, and others.
In addition, he served as a member of the Board of Trustees of the Internet Society 2002 through 2008, and as its chair from 2002 through 2006. He was a member of the Technical Advisory Council of the US Federal Communications Commission from 2005 through 2009.
He has worked as liaison to other standards organizations such as the ITU-T.
In 2009 he became chair of the RFC Series Oversight Committee.
He co-chaired the IPv6 Operations Working Group in the IETF, represented the IETF on the National Institute of Standards and Technology Smart Grid Smart Grid Interoperability Panel and Architecture Committee (until 2013), and was Cisco's representative to a Broadband Internet Technical Advisory Group.
Baker also has several patents.
References
External links
The Debate Over Internet Governance: A Snapshot in the Year 2000, The Berkman Center for Internet & Society at Harvard Law School. Retrieved on August 6, 2007.
1952 births
Living people
People in information technology
Internet Society people
|
https://en.wikipedia.org/wiki/SGroup%20European%20Universities%27%20Network
|
The SGroup - Universities in Europe network (SGroup), previously called Santander, is a non-profit association of universities incorporated in Spain. It was founded in 1992.
Members
Armenia
Yerevan State Medical University - Associate Member
Australia
La Trobe University
Belgium
Ghent University
University of Liège
Bosnia and Herzegovina
University of Sarajevo
China
Shanghai International Studies University - Associate Member
Colombia
University of Los Andes - Associate Member
Croatia
University of Split
Cyprus
University of Cyprus
Czech Republic
University of Ostrava
Finland
Tampere University
France
Université Grenoble Alpes
University of Le Havre
University of Lille
University of Rouen
Germany
Justus Liebig University in Giessen
University of Bayreuth
Greece
University of Patras
Hungary
University of Szeged
Italy
Sapienza University of Rome
University of Catania
University of Messina
University of Trieste
Malta
University of Malta
Netherlands
Eindhoven University of Technology
Norway
NTNU Trondheim
Poland
Adam Mickiewicz University in Poznań
Silesian University of Technology
University of Szczecin
Portugal
University of Minho
University of Porto
Romania
Babeş-Bolyai University
Spain
Polytechnic University of Valencia
Rovira i Virgili University
University of Cantabria
University of Las Palmas de Gran Canaria
University of León
University of Valladolid
Sweden
Malmö University
University of Gothenburg
United Kingdom
University of Kent
University of Westminster
External links
College and university associations and consortia in Europe
Organizations established in 1992
Organisations based in Porto
|
https://en.wikipedia.org/wiki/VASCAR
|
VASCAR (Visual Average Speed Computer And Recorder) is a type of device for calculating the speed of a moving vehicle. The first VASCAR device was created in 1966 by Arthur Marshall. It is used by police officers to enforce speed limits, and may be preferred where radar or lidar is illegal, such as some jurisdictions in Pennsylvania, or to prevent detection by those with radar detectors.
Operation
A VASCAR unit uses a stopwatch and a simple computer. An operator records the moments that a vehicle passes two fixed objects (such as a white circle or square painted on the road) that are a known distance apart. The vehicle's average speed is then calculated by dividing the distance between the points by the time taken to travel between them. The mean value theorem implies that at some time between the measurements the vehicle's speed must be equal to its average speed.
VASCAR can be used from a moving or stationary vehicle or helicopter or other aerial platform. The target vehicle may be travelling in any direction, in front of or behind or below the observer.
A 1991 study by the National Highway Traffic Safety Administration found that VASCAR-plus units produced errors of less than 2 mph if used correctly.
Users
VASCAR is known to be used where radar or LIDAR is illegal, such as some jurisdictions in Pennsylvania.
Many police vehicles in the United Kingdom are fitted with a device, especially those used for traffic enforcement.
The system is also used by airborne units - in some remote locations of the United States airborne speed enforcement is employed regularly.
History
VASCAR was invented by Arthur Marshall, a real-estate investor living in Richmond, Virginia in 1966. He was inspired to create the device after watching a police car driving dangerously trying to pace a speeder. The original version of the device was entirely mechanical, using a governed motor and a gear system to move a pointer to the correct speed value. Subsequent versions used a microprocessor to perform the speed calculations. By 1968, the device was in use in North Carolina, Indiana, Kentucky, and New York. In 1971, Marshall formed a company, Traffic Safety Systems, Inc., to market the device. After his death, Traffic Safety Systems was purchased by Power Systems & Controls, Inc., which had long manufactured the devices. They continue to produce similar devices under the name VASCAR-plus.
Technical Specifics
VASCAR relies on the accuracy of the patrol vehicle's speedometer drive (generally located within the vehicle transmission) for determining the distance traveled, using an odometer within the VASCAR system itself. Recently-purchased law enforcement vehicles generally have electronic speedometers, and a sensor wire is connected to the speed-sensor feed wire to count the pulses from the drive. Older vehicles, with cable-driven speedometers, are connected to the VASCAR unit with a mechanical-optical adapter which attaches to the cable. Pulses are counted the same
|
https://en.wikipedia.org/wiki/Bit%20banging
|
In computer engineering and electrical engineering, bit banging is a "term of art" for any method of data transmission that employs software as a substitute for dedicated hardware to generate transmitted signals or process received signals. Software directly sets and samples the states of GPIOs (e.g., pins on a microcontroller), and is responsible for meeting all timing requirements and protocol sequencing of the signals. In contrast to bit banging, dedicated hardware (e.g., UART, SPI, I²C) satisfies these requirements and, if necessary, provides a data buffer to relax software timing requirements. Bit banging can be implemented at very low cost, and is commonly used in some embedded systems.
Bit banging allows a device to implement different protocols with minimal or no hardware changes. In some cases, bit banging is made feasible by newer, faster processors because more recent hardware operates much more quickly than hardware did when standard communications protocols were created.
C code example
The following C language code example transmits a byte of data on an SPI bus.
// transmit byte serially, MSB first
void send_8bit_serial_data(unsigned char data)
{
int i;
// select device (active low)
output_low(SD_CS);
// send bits 7..0
for (i = 0; i < 8; i++)
{
// consider leftmost bit
// set line high if bit is 1, low if bit is 0
if (data & 0x80)
output_high(SD_DI);
else
output_low(SD_DI);
// pulse the clock state to indicate that bit value should be read
output_low(SD_CLK);
delay();
output_high(SD_CLK);
// shift byte left so next bit will be leftmost
data <<= 1;
}
// deselect device
output_high(SD_CS);
}
Considerations
The question whether to deploy bit banging or not is a trade-off between load, performance and reliability on one hand, and the availability of a hardware alternative on the other. The software emulation process consumes more processing power than does supporting dedicated hardware. The microcontroller spends much of its time sending or receiving samples to and from the pins, at the expense of other tasks. The signal produced usually has more jitter or glitches, especially if the processor is also executing other tasks while communicating. However, if the bit-banging software is interrupt-driven by the signal, this may be of minor importance, especially if control signals such as RTS, CTS, or DCD are available. The implementation in software can be a solution when specific hardware support is not available or requires a more expensive microcontroller.
See also
Bit manipulation
Bit stream
Bit twiddler (disambiguation)
Bit-serial architecture
1-bit architecture
Fast loader
Integrated Woz Machine (IWM)
FTDI, a series of USB to serial converter chips also supporting a bit bang mode
2MGUI (a DOS driver by Ciriaco García de Celis utilizing bit-banging to support non-standard ultra-high capacity floppy d
|
https://en.wikipedia.org/wiki/The%20Algorithmic%20Beauty%20of%20Plants
|
The Algorithmic Beauty of Plants is a book by Przemyslaw Prusinkiewicz and Aristid Lindenmayer. It's notable as it is the first comprehensive volume on the computer simulation of certain patterns in nature found in plant development (L-systems).
The book is no longer in print but is available free online.
Contents
The book has eight chapters:
Chapter 1 - Graphical modeling using L-systems
Chapter 2 - Modeling of trees
Chapter 3 - Developmental models of herbaceous plants
Chapter 4 - Phyllotaxis
Chapter 5 - Models of plant organs
Chapter 6 - Animation of plant development
Chapter 7 - Modeling of cellular layers
Chapter 8 - Fractal properties of plants
Reception
George Klir, reviewing the book in the International Journal of General Systems, writes that "This book, full of beautiful pictures of plants of great variety, is a testimony of the genius of Aristid Lindenmayer, who invented in 1968 systems that are now named by him -- Lindenmayer systems or L-systems. It is also a testimony of the power of current computer technology. The pictures in the book are not photographs of real plants. They are all generated on the computer by relatively simple algorithms based upon the idea of L-systems." Klir goes on to explain the mathematics of L-systems, involving replacement of strings of symbols with further strings according to production rules, adding that "high computer power is essential since the generation of realistic forms requires tremendous numbers of replacements and the geometric interpretation of the generated strings requires a highly sophisticated computer graphics".
Adrian Bell, reviewing the book in New Phytologist, writes that it demands respect for three reasons, namely that it is the first book to explain the algorithms behind virtual plants, it "unashamedly" connects art and science, and is unusual in being a real book on a computer-based subject. Each chapter, writes Bell, is an introductory manual to the simulation of an aspect of plant form, resulting "eventually" in a 3-D image of a plant architecture.
Peter Antonelli, reviewing the book in SIAM Review, writes that it presents a "beautifully designed 'coffee-table-book'" summary of Lindenmayer's school of thought, explaining how Algorithmic Language Theory, like Noam Chomsky's theory of grammar, can describe how repeated structural units can arrange themselves. Antonelli suggests that Goethe would have disapproved of having the barrier of mathematics between the observer and the observed.
Karl Niklas, reviewing the book in The Quarterly Review of Biology, writes that the book, intended for many different audiences, is "unequally successful" in reaching them. Niklas suggests that those who wonder about how graphic artists create "the magnificent cyber-floras that sway and grow so realistically in the movies", and those who admire plant symmetry will enjoy the book. He is more skeptical about its claim to serious science as the book "fails to educate its readers" ab
|
https://en.wikipedia.org/wiki/GHK
|
GHK may refer to:
Gahcho Kue Aerodrome, in the Northwest Territories, Canada
Geko Karen, a language of Burma
GHK algorithm, a regression model
Ghotki railway station, in Pakistan
Glasgow High Kelvinside, a Scottish rugby union club
Goldman–Hodgkin–Katz flux equation
Goldman–Hodgkin–Katz voltage equation
Gush Katif Airport, in the Gaza Strip
Wood and Plastic Union, a former German trade union
|
https://en.wikipedia.org/wiki/AMIX
|
AMIX may mean:
Amiga Unix, a computer operating system.
The American Information Exchange, an early online information marketplace.
|
https://en.wikipedia.org/wiki/OIS
|
OIS may refer to:
Computing
Object Oriented Input System, a cross-platform input system
Objective Interface Systems, a communications software and hardware company
Optical IP Switching, a computer optical network architecture
Optical image stabilization, a technique to reduce motion-related blurring by an imaging system
Education
Oxford International School (Panama), an international school in Panama City, Panama
Oeiras International School, an international school in Oeiras (suburb of Lisbon), Portugal
Oulu International School, an international school in Oulu, Finland
Organised Independents (OIs), an interest group within the National Union of Students (UK)
Oberoi International School, an international school in Mumbai, India
Other science related
Ops in Surgery, The St George's Surgical Society, an academic society at St George's University
Oncogene-Induced Senescence, a mechanism in cell biology
Ocular ischemic syndrome, a medical condition which blocks arterial blood flow to the eye
Oxygen isotope stages, alternating warm and cool periods in the Earth's paleoclimate
Outbreak Intensity Score, a scale to rank tornado outbreaks
Other
Officer-involved shooting, an incident in which a police officer shoots at another person
Örgryte IS, a Swedish sports club based in Gothenburg
Overnight indexed swap, a type of interest rate swap
|
https://en.wikipedia.org/wiki/Dynamic%20Logical%20Partitioning
|
Dynamic Logical Partitioning (DLPAR), is the capability of a logical partition (LPAR) to be reconfigured dynamically, without having to shut down the operating system that runs in the LPAR. DLPAR enables memory, CPU capacity, and I/O interfaces to be moved nondisruptively between LPARs within the same server.
DLPAR has been supported by the operating systems AIX and IBM i on almost all POWER4 and follow-on POWER systems since then. The Linux kernel for POWER also supported DLPAR, but its dynamic reconfiguration capabilities were limited to CPU capacity and PCI devices, but not memory. In October 2009, seven years after the AIX announcement of DLPAR of memory, CPU and IO slots, Linux finally added the capability to DLPAR memory on POWER systems. The fundamentals of DLPAR are described in the IBM Systems Journal paper titled: "Dynamic reconfiguration: Basic building blocks for autonomic computing on IBM pSeries Servers.
Later on, the POWER5 processor added enhanced DLPAR capabilities, including micro-partitioning: up to 10 LPARs can be configured per processor, with a single multiprocessor server supporting a maximum of 254 LPARs (and thus up to 254 independent operating system instances).
There are many interesting applications of DLPAR capabilities. Primarily, it is used to build agile infrastructures, or to automate hardware system resource allocation, planning, and provisioning. This in turn results in increased system utilization. For example, memory, processor or I/O slots can be added, removed or moved to another LPAR, without rebooting the operating system or the application running in an LPAR. IBM DB2 is such application (http://www.ibm.com/developerworks/eserver/articles/db2_dlpar.html), it is aware of the DLPAR events and automatically tunes itself to changing LPAR resources.
The IBM Z mainframes and their operating systems, including Linux on IBM Z, support even more sophisticated forms of dynamic LPARs. Relevant LPAR-related features on those mainframe platforms include Intelligent Resource Director, Sysplex, Parallel Sysplex, Geographically Dispersed Parallel Sysplex, and HiperSockets. The System z9 supports up to 60 LPARs on a single server, but mainframes also support an additional level of virtualization using z/VM with the ability to support thousands of operating system instances on a single server.
See also
Virtualization
Operating system-level virtualization
Hypervisor
HiperSocket
Logical partition (virtual computing platform)
Micro-Partitioning
AS/400
Hardware partitioning
IBM mainframe operating systems
IBM mainframe technology
IBM storage software
Dynamic Logical Partitioning
|
https://en.wikipedia.org/wiki/Chris%20Crosby%20%28comics%29
|
Chris Crosby (born September 15, 1977) is a co-founder and the chief executive officer of Keenspot, a company providing a platform and network for webcomics. They are also a comics writer and artist, with works including Superosity, Sore Thumbs, and Snap The Punk Turtle.
Early work
In an interview, Crosby said they had been interested in comics since before they were old enough to remember. They first published a webcomic in 1995 through their AOL account. They also self-published some issues of a comic called Snap The Punk Turtle, which they say got them attention at Wizard, leading to coverage and then a gig writing a webcomic for AnotherUniverse.com's Mania magazine. After Mania stopped running webcomics in 1998, Crosby decided to start their own daily webcomic, which would be Superosity.
Around this time, Crosby was one of the writers on a print comic book series called Scorn. Three issues were published by SCC Entertainment: Scorn: Deadly Rebellion #0 (July 1996), Scorn: Heatwave #1 (January 1997), and Scorn: Naked Truth #1 (April 1997). According to Diamond Comic Distributors' sales charts for January 1997, Scorn: Heatwave #1 sold an estimated 3,439 copies in that month.
Superosity
Crosby is the writer and artist of Superosity, a daily comic that they launched on March 1, 1999. In a 2003 interview, Crosby described their comic as "a storyline-focused strip, packed with wacky insane humor... about the friendship between a group of unusual characters." The main character is also named Chris, who Crosby described as "an ever-optimistic, childlike guy who is not very smart and wears a big orange cape." Other characters include Boardy, a talking blue board who has amnesia but is a scientific genius, and Bobby, Chris's teenage brother, who hates everything and wants to be rich and famous. Bobby's best friend is a talking turtle named Snap, one of many characters brought over from earlier Crosby strips. The cast also features Arcadia, a young female lawyer who Chris is in love with.
According to a 2003 Comicon article, Superosity "has been called a cross between The Simpsons and Bloom County." According to Keenspot, Superosity was reviewed in Comics Buyer's Guide in late 2001, which said it "may be one of the most off-the-wall online comics", calling the humor "non-sequitur" and said "the art is cringe-worthy at first, but... improved with age." Superosity was nominated for a 2002 Cartoonist Choice Award in the Best Superhero Comic category.
Seven issues of a Superosity print comic book were published from 2001 to 2002 and distributed by Diamond Comic Distributors to comic book stores. It featured guest artwork by creators such as Jeffrey J. Rowland (Overcompensating) and John Allison (Scary Go Round). Superosity has also been published in newspapers, most notably The Turlock Journal of Turlock, CA. As of October 2020, Superosity is still updating daily.
Adaptation
On July 21, 2006 at Comic-Con International it was announced that an ani
|
https://en.wikipedia.org/wiki/Get%20Ed
|
Get Ed is a computer-animated television series about a genetically engineered teenage delivery boy who fights industrial crime in Progress City.
The show aired as a part of the Jetix programming block on the United States cable television network Toon Disney until the channel closed in 2009. The series also used to run on ABC Family before the channel switched to a non-animated format. Reruns aired on Toon Disney's successor, Disney XD in 2009. It was the second original show produced for the Jetix block and for the Jetix channels worldwide, where the show aired in 2005.
Plot
In the series, Ed is an "electro-genetically" enhanced teen who works for Dojo Deliveries, a courier service, in the futuristic Progress City. Ed uses his cyber sleuthing skills to thwart identity theft and other information-based crimes. He and his courier pals Burn, Deets, Fizz, and Loogie (accompanied by his puppet Dr. Pinch), along with their friend and mentor Ol’ Skool, must battle the ultimate evil – Simon Bedlam, an industrialist who has taken over a significant portion of Progress City, employing stealing from, data mining, or outright destroying his competitors.
Characters
Dojo Deliveries
Ed, the Protector (voiced by Lyon Smith) - A genetically engineered teen made from the instructions of an ancient alien artifact found by Ol' Skool. As he tries to uncover his origins, he also works on the Dojo crew as a delivery boy. On top of delivering packages and figuring out his identity, Ed's side job is fighting evil. He has much equipment that he finds along his journey whose technology is far beyond the technology of Progress City, thought to be gifts from aliens for his use. Due to being created as a teenager, he lacks a lot of life experience and can be a little dense and gullible sometimes, but sometimes he gets flashes of future events that help him and his friends. His vehicle is an AI co-piloted hoverboard. His symbol is "The Protector." Sometimes, his eyes glow red when he becomes angry.
Burn, the Warrior (voiced by L. Dean Ifill) - The unofficial leader of the Dojo who takes pride in being the best of the Dojo group, but with the arrival of Ed, he feels his role in the group has been challenged. Because of this, he is hard on Ed every chance he gets but as the series progresses he starts to warm up to Ed. Although he is still hard on Ed now and again, he cares for him deep down. He also hates a lot of other courier teams. His vehicle is a flaming one-wheeled motorcycle. His symbol is "The Warrior."
Deets, the Dreamer (voiced by Megan Fahlenbock) - A former teen computer programmer-in-training originally named Sarah, who was forced to work for Bedlam because he captured her parents (also computer programmers), but Ol' Skool helped her save them and offered a place in the Dojo. She appears to have a crush on Ed, yet these feelings appear to be mutual. Her vehicle is a hand-held jet glider pack. Her symbol is "The Dreamer."
Fizz, the Builder (voiced by Bail
|
https://en.wikipedia.org/wiki/Slim%20Devices
|
Slim Devices, Inc. was a consumer electronics company based in Mountain View, California, United States. Their main product was the Squeezebox network music player which connects to a home ethernet or Wi-Fi network, and allows the owner to stream digital audio over the network to a stereo. The company, founded in 2000, was originally most notable for their support of open-source software, namely their SlimServer software which their products at that time all depended upon, and is still available as a free download and modification by any interested developer.
On 18 October 2006 Sean Adams, the CEO of Slim Devices, announced that the company was being fully acquired by Logitech.
Slim Devices was featured in the December 2006 issue of Fast Company magazine. The article focused on the company's business model and profiled the three key leaders: Sean Adams (CEO), Dean Blackketter (CTO), and Patrick Cosson (VP of Marketing).
References
Tew, Sarah. "Logitech leaves Squeezebox fans wondering what's next", CNET. September 24, 2012. Retrieved November 14, 2014.
Merritt, Rick. "Digital audio startup finds edge in open-source code", EE Times. August 9, 2004. Retrieved December 14, 2005.
Smith, Tony. "Slim Devices adds 802.11g to wireless MP3 player", The Register. March 11, 2005. Retrieved December 14, 2005.
Pogue, David. "Video review of Squeezebox 3", New York Times. February 9, 2006. Retrieved December 2, 2006.
Atkinson, John. "Slim Devices Squeezebox WiFi D/A processor", Stereophile. September 2006. Retrieved December 2, 2006.
Deutschman, Alan. "Ears Wide Open", Fast Company. December 2006. Retrieved January 6, 2007.
Footnotes
Electronics companies of the United States
Companies based in Mountain View, California
American companies established in 2000
Electronics companies established in 2000
2000 establishments in California
2006 mergers and acquisitions
Logitech
|
https://en.wikipedia.org/wiki/Brunswick%20railway%20station
|
Brunswick railway station serves the Toxteth district of Liverpool, England, on the Northern Line of the Merseyrail network. The station serves the nearby district of Dingle and is situated on a short section of track between two tunnels, between the now in-filled Toxteth and Harrington Docks. The station also serves businesses on the Brunswick Dock estate, whch gives it name to the station. The residential area of Grafton Street is reached by steps or ramp from the southbound platform.
History
The original Brunswick station was opened on 1 June 1864 by the Garston and Liverpool Railway, on Sefton Street, Liverpool's southern section of the Dock Road. It was the Liverpool terminus of a new Garston and Liverpool Railway line to Liverpool. The terminus was inconveniently outside of the city centre and after only ten years it closed on 1 March 1874 when the line was diverted and extended, mainly by tunnel, to Liverpool Central High Level railway station. A large impressive goods terminal building remained on the station site, providing a connection to the Mersey Docks Railway, giving trains direct access to the quayside at the docks. The goods terminal building was closed in the 1970s. The original passenger station building was still standing until demolition. The mouth of the former Liverpool Overhead Railway tunnel which led to Dingle can be seen just south of the station.
The present passenger station opened in 1998, on a site close to the original station but on the through route to Merseyrail's Liverpool Central underground station. The industrial former dock buildings are served on the river side, and a small housing estate at a higher point on the other.
Facilities
The station has a 35-space car park, free of charge. The Liverpool-bound platform has a ticket office and a shelter with seats. A bridge leads over to the Hunts Cross-bound platform which has another shelter. A ramp and stairs lead upwards to the Eastern entrance. There is a cycle rack for 8 cycles and secure cycle storage for 10 cycles.
Services
The typical Monday to Saturday service at the station is 4 trains per hour northbound to via and 4 trains per hour southbound to . On Sundays there are 2 trains per hour in each direction.
References
Bibliography
External links
History of railway stations in Liverpool
Railway stations in Liverpool
DfT Category E stations
Former Cheshire Lines Committee stations
Railway stations in Great Britain opened in 1864
Railway stations in Great Britain closed in 1874
Railway stations opened by Railtrack
Railway stations in Great Britain opened in 1998
Railway stations served by Merseyrail
|
https://en.wikipedia.org/wiki/DataTAC
|
DataTAC is a wireless data network technology originally developed by Mobile Data International which was later acquired by Motorola, who jointly developed it with IBM and deployed in the United States as ARDIS (Advanced Radio Data Information Services). DataTAC was also marketed in the mid-1990s as MobileData by Telecom Australia, and is still used by Bell Mobility as a paging network in Canada. The first public open and mobile data network using MDI DataTAC was found in Hong Kong as Hutchison Mobile Data Limited (a subsidiary of Hutchison Telecom), where public end-to-end data services are provided for enterprises, FedEx, and consumer mobile information services were also offered called MobileQuotes with financial information, news, telebetting and stock data.
DataTAC is an open standard for point to point wireless data communications, similar to Mobitex. Like Mobitex, it is mainly used in vertical market applications. One of the early DataTAC devices was the Newton Messaging Card, a two-way pager connected to a PC card using the DataTAC network. The original BlackBerry devices, the RIM 850 and 857 also used the DataTAC network.
In North America, DataTAC is typically deployed in the 800 MHz band. DataTAC was also deployed in the same band by Telecom Australia (now Telstra).
The DataTAC network runs at speeds up to 19.2 kbit/s, which is not sufficient to handle most of the wireless data applications available today. The network runs 25 kHz channels in the 800 MHz frequency bands. Due to the lower frequency bands that DataTAC uses, in-building coverage is typically better than with newer, higher frequency networks.
In the 1990s a DataTAC network operators group was put together by Motorola called Worldwide Wireless Data Networks Operators Group (WWDNOG) chaired by Shahram Mehraban, Motorola's DataTAC system product manager.
References
Wireless networking
Motorola products
IBM products
|
https://en.wikipedia.org/wiki/GEOnet%20Names%20Server
|
The GEOnet Names Server (GNS), sometimes also referred to in official documentation as Geographic Names Data or geonames in domain and email addresses, is a service that provides access to the United States National Geospatial-Intelligence Agency's (NGA) and the US Board on Geographic Names's (BGN) database of geographic feature names and locations for locations outside the US. The database is the official repository for the US Federal Government on foreign place-name decisions approved by the BGN. Approximately 20,000 of the database's features are updated monthly. Names are not deleted from the database, "except in cases of obvious duplication". The database contains search aids such as spelling variations and non-Roman script spellings in addition to its primary information about location, administrative division, and quality. The accuracy of the database had been criticised.
Accuracy
A 2008 survey of South Korea toponyms on GNS found that roughly 1% of them were actually Japanese names that had never been in common usage, even during the period of Japanese colonial rule in Korea, and had come from a 1946 US military map that had apparently been compiled with Japanese assistance. In addition to the Japanese toponyms, the same study noted that "There are many spelling errors and simple mis-understanding of the place names with similar characters" amongst South Korea toponyms on GNS, as well extraneous names of Chinese and English origin.
See also
Geographic Names Information System (GNIS), a similar database for locations within the United States
References
External links
GEOnet Names Server (Archived at the Internet Archive)
GeoNet Designations: Codes and Definitions
Country files download page (broken link; Archived at the Internet Archive)
Place names
Public domain databases
Geocodes
National Geospatial-Intelligence Agency
Geographical databases
Gazetteers
|
https://en.wikipedia.org/wiki/Arbiter%20%28electronics%29
|
Arbiters are electronic devices that allocate access to shared resources.
Bus arbiter
There are multiple ways to perform a computer bus arbitration, with the most popular varieties being:
dynamic centralized parallel where one central arbiter is used for all masters as discussed in this article;
centralized serial (or "daisy chain") where, upon accessing the bus, the active master passes the opportunity to the next one. In essence, each connected master contains its own arbiter;
distributed arbitration by self-selection (distributed bus arbitration) where the access is self-granted based on the decision made locally by using information from other masters;
distributed arbitration by collision detection where each master tries to access the bus on its own, but detects conflicts and retries the failed operations.
A bus arbiter is a device used in a multi-master bus system to decide which bus master will be allowed to control the bus for each bus cycle.
The most common kind of bus arbiter is the memory arbiter in a system bus system.
A memory arbiter is a device used in a shared memory system to decide, for each memory cycle, which CPU will be allowed to access that shared memory.
Some atomic instructions depend on the arbiter to prevent other CPUs from reading memory "halfway through" atomic read-modify-write instructions.
A memory arbiter is typically integrated into the memory controller/DMA controller.
Some systems, such as conventional PCI, have a single centralized bus arbitration device that one can point to as "the" bus arbiter.
Other systems use decentralized bus arbitration, where all the devices cooperate to decide who goes next.
When every CPU connected to the memory arbiter has synchronized memory access cycles, the memory arbiter can be designed as a synchronous arbiter.
Otherwise the memory arbiter must be designed as an asynchronous arbiter.
Asynchronous arbiters
An important form of arbiter is used in asynchronous circuits to select the order of access to a shared resource among asynchronous requests. Its function is to prevent two operations from occurring at once when they should not. For example, in a computer that has multiple CPUs or other devices accessing computer memory, and has more than one clock, the possibility exists that requests from two unsynchronized sources could come in at nearly the same time. "Nearly" can be very close in time, in the sub-femtosecond range. The memory arbiter must then decide which request to service first. Unfortunately, it is not possible to do this in a fixed time [Anderson 1991].
Asynchronous arbiters and metastability
Arbiters break ties. Like a flip-flop circuit, an arbiter has two stable states corresponding to the two choices. If two requests arrive at an arbiter within a few picoseconds (today, femtoseconds) of each other, the circuit may become meta-stable before reaching one of its stable states to break the tie. Classical arbiters are specially designed not to o
|
https://en.wikipedia.org/wiki/.root
|
root is the name of a database record of the root zone in the Domain Name System of the Internet that was occasionally used as a diagnostic marker. Its presence demonstrated the root zone was not truncated upon loading by a root nameserver.
According to technical observers the single .root entry was replaced in 2006 with just vrsn-end-of-zone-marker-dummy-record, to be reintroduced later in 2006 in its original form. The entry was deleted again during the preparations for the deployment of DNSSEC at the root zone in 2010.
The existence of the record was observed with the domain information groper (dig) utility by querying for a TXT Record for the domain name:
dig vrsn-end-of-zone-marker-dummy-record.root
This entry returned the word "plenus", which is Latin for full or complete.
References
External links
The root zone file
Pseudo-top-level domains
sv:Toppdomän#Generiska toppdomäner
|
https://en.wikipedia.org/wiki/Algorithm%20BSTW
|
The Algorithm BSTW is a data compression algorithm, named after its designers, Bentley, Sleator, Tarjan and Wei in 1986. BSTW is a dictionary-based algorithm that uses a move-to-front transform to keep recently seen dictionary entries at the front of the dictionary. Dictionary references are then encoded using any of a number of encoding methods, usually Elias delta coding or Elias gamma coding.
References
This algorithm was published in the following paper: "A Locally Adaptive Data Compression Scheme", Communications of the ACM, 1986, volume 29 number 4, pp. 320–330.
A related idea was published in Ryabko, B. Ya. "Data compression by means of a book stack", Problems of Information Transmission, 1980, v. 16: (4), pp. 265–269.
The original name of this code is "book stack". The history of discovery of the book stack (or move-to-front) code can be found here: Ryabko, B. Ya.; Horspool, R. Nigel; Cormack, Gordon V. Comments to: "A locally adaptive data compression scheme" by J. L. Bentley, D. D. Sleator, R. E. Tarjan and V. K. Wei. Comm. ACM 30 (1987), no. 9, 792–794.
External links
Algorithm BSTW
Lossless compression algorithms
|
https://en.wikipedia.org/wiki/HSWN
|
HSWN is the four letter abbreviation used for the following:
Heraklion Student Wireless Network, a Greek wireless network
Homeland Security Weatherbug Network, a joint collaboration between the National Weather Service and the creators of the Weatherbug program encompassing about 8,000 weather stations in the United States
|
https://en.wikipedia.org/wiki/Interceptor%20Micros
|
Interceptor Micros, also known as Interceptor Software and later as Interceptor Group, was a British developer/publisher of video games for various 8-bit and 16-bit computer systems popular in Western Europe during the eighties and early nineties.
In addition to publishing games and utilities under the Interceptor label the company ran a tape and later disc duplication business, a print shop and associated graphic design studio, manufactured dual size cassette tape cases under the Compact Case Company brand and published budget software under the Players and Players Premier labels, and a few full-price titles under the premium Pandora label.
The company was owned and operated by father and son team Julian and Richard Jones, out of various locations in and around the small town of Tadley, near Basingstoke in Hampshire, England. At the height of its success the company employed around thirty people, but fell victim to the 90's video game decline, and went out of business in the early nineties.
Early days
Richard and Julian's first foray into the computer games business is documented on the official Llamasoft web site with The Joneses and Jeff Minter forming a partnership in 1982. Although the Llamasoft account of the parties' short relationship and the events surrounding the dissolution of the partnership reflect Jeff Minter and his family's opinions, the key facts and dates do not seem to be in dispute. The Jones' and Minters' short-lived partnership ended in September 1982. History has shown that neither parties' interest in the business suffered from the split, with Jeff retaining the Llamasoft name and the Joneses forming Interceptor. The company released several clones of arcade games but decided to focus on developing more original titles, as stricter copyright laws meant the clones could not be sold in the USA.
The Interceptor Label
The following titles were published under the Interceptor label:
After Shock
Aquanaut
Asiento
Assembler 64
Azimuth 3000
Bandana City
Big Ben
Bigtop Barney
Break Fever (C64)
BurgerTime (C64)
Caverns of Sillahc
China Miner
Crazy Kong 64
Crystals of Carus
Cuddly Cuburt
Defender 64
Forest at the World's End
Frogger 64
Front Line
Get Off My Garden!
Guzzler
The Heroes Of Karn
The Empire of Karn
Jewels of Babylon
LA Police Dept.
Melonmania
Message from Andromeda
Micro Rescue
Missile Command
Panic 64
Quango
Scramble 64
Siren City
Spider and the Fly
Spriteman 64
Star Trek
Sword of Kings
Tales of the Arabian Nights
The Zacaron Mystery
Token of Ghall
Trollie Wallie
Vortex Raider
Wallie Goes To Rhymeland (C64)
Warlord
Where's my Bones?
Wheelin' Wallie (C64)
Wild Ride (C64)
Wunda Walter (Vic 20)
The Players and Players Premier labels
From 1986 to 1991 Players issued budget-priced tape-based games for various 8-bit platforms. The Players Premier label games were priced at . In addition some titles were released for the Atari ST and Amiga platforms on disc at under th
|
https://en.wikipedia.org/wiki/Stalin%20%28Scheme%20implementation%29
|
In computing, Stalin (STAtic Language ImplementatioN) is a programming language, an aggressive optimizing batch whole-program Scheme compiler written by Jeffrey Mark Siskind. It uses advanced data flow analysis and type inference and a variety of other optimization methods to produce code. Stalin is intended for production use in generating an optimized executable.
The compiler runs slowly, with little or no support for debugging or other niceties. Full R4RS Scheme is supported, with a few minor and rarely encountered omissions. Interfacing to external C libraries is straightforward. The compiler does lifetime analysis and hence does not generate as much garbage as might be expected, but global reclamation of storage is done using the Boehm garbage collector.
The name is a joke: "Stalin brutally optimizes."
Stalin is free and open-source software, licensed under a GNU General Public License (GPL), and is available online.
See also
Chicken (Scheme implementation)
Gambit (Scheme implementation)
External links
A Google Code project – includes a Windows version and a GUI
Research Statement by Siskind (compares Stalin with other Scheme compilers, and states that "STALIN often generates code that outperforms handwritten C and Fortran code.")
Flow-Directed Lightweight Closure Conversion by Siskind (presents a lightweight closure-conversion method that is driven by the results of whole-program interprocedural flow, reachability, points-to, and escape analyses, used in the Stalin compiler)
Scheme (programming language) compilers
Scheme (programming language) implementations
Free compilers and interpreters
|
https://en.wikipedia.org/wiki/T%C5%8Dkei-ji
|
, also known as or , is a Buddhist temple and a former nunnery, the only survivor of a network of five nunneries called , in the city of Kamakura in Kanagawa Prefecture, Japan. It is part of the Rinzai school of Zen's Engaku-ji branch, and was opened by Hōjō Sadatoki and founding abbess Kakusan-ni in 1285. It is best known as a historic refuge for women who were abused by their husbands. It is for this reason sometimes referred to as the "Divorce Temple".
History
The temple was founded in the 8th year of Koan (1285) by nun Kakusan-ni, wife of Hōjō Tokimune (1251–1284) and mother of Sadatoki, after her husband's death. Because it was then customary for a wife to become a nun after her husband's death, she decided to open the temple and dedicate it to the memory of her husband. She also made it a refuge for battered wives.
In an age when men could easily divorce their wives but wives had great difficulty divorcing their husbands, Tōkei-ji allowed women to become officially divorced after staying there for two years. Temple records show that, during the Tokugawa period alone, an estimated 2,000 women sought shelter there. The temple lost its right to concede divorce in 1873, when a new law was approved and the Court of Justice started to handle the cases.
The temple remained a nunnery for over 600 years and men could not enter until 1902, when a man took the post of abbot and Tōkei-ji came under the supervision of Engaku-ji. Before then, the chief nun was always an important figure, and once it even was a daughter of Emperor Go-Daigo. Tenshū-ni, the daughter and only survivor of Toyotomi Hideyori's family, son of Hideyoshi, entered Tōkei-ji following the Siege of Osaka. Such was the nunnery's prestige that its couriers did not need to prostrate themselves when they met a daimyōs procession.
The two main buildings of the complex are the Main Hall and the Suigetsu-dō, but the latter is not open to visitors. The temple's old Butsuden, an Important Cultural Property, was bought during the Meiji period by businessman Tomitaro Hara and is now in the garden he built, Yokohama's Sankei-en.
In 1923, the entire temple, with the exception of the bell tower, was destroyed in the 1923 Great Kantō earthquake, and the temple was gradually rebuilt in the subsequent decade.
Cemetery
Behind the temple there is a graveyard where many celebrities are buried, among them in adjacent graves are three men also famous among European Zen and haiku aficionados, Kitarō Nishida, Daisetz Teitaro Suzuki, Beatrice Erskine Lane Suzuki, and Reginald Horace Blyth.
See also
For an explanation of terms concerning Japanese Buddhism, Japanese Buddhist art, and Japanese Buddhist temple architecture, see the Glossary of Japanese Buddhism.
References
External links
Tokeiji, A Guide to Kamakura, retrieved on April 6, 2008
Official website retrieved on April 6, 2008
Tokeiji, sightseeing information and history by Kamakura Today
Kamakura Video Guide – Tokeiji
1280s esta
|
https://en.wikipedia.org/wiki/List%20of%20programs%20broadcast%20by%20TelevisaUnivision%20networks
|
The following is a list of original programming currently, formerly, and soon to be broadcast by TelevisaUnivision owned television networks. TelevisaUnivision owns six broadcast television networks: Las Estrellas, Canal 5, FOROtv and Nu9ve in Mexico, and Univision and UniMás in the United States.
Current programming
Las Estrellas
Dramas
La rosa de Guadalupe (February 5, 2008)
Como dice el dicho (February 1, 2011)
Esta historia me suena (May 13, 2019)
Tierra de esperanza (June 12, 2023)
Vencer la culpa (June 26, 2023)
Teresa (July 3, 2023)
Nadie como tú (August 14, 2023)
Comedies
La familia P. Luche (August 7, 2002)
Vecinos (July 10, 2005)
Nosotros los guapos (November 8, 2016)
40 y 20 (November 9, 2016)
Renta congelada (August 31, 2017)
Relatos macabrones (August 31, 2020)
Me caigo de risa: Gala disfuncional (March 28, 2021)
Perdiendo el juicio (September 27, 2021)
¿Tú crees? (July 31, 2022)
Tal para cual (October 13, 2022)
¿Es neta, Eva? (April 18, 2023)
Bola de locos (May 13, 2023)
El príncipe del barrio (July 2, 2023)
¡Chócalas Compayito! (July 8, 2023)
Reality/non-scripted
Pequeños Gigantes (March 27, 2011)
¿Quién es la máscara? (August 25, 2019)
El retador (August 15, 2021)
La casa de los famosos México (June 4, 2023)
Game shows
100 mexicanos dijieron (2001)
Minuto para ganar VIP (2013)
Veo cómo cantasTalk/Late-night shows
Cuéntamelo ya (April 16, 2016)
+ NOCHE (August 25, 2018)
News and information
Hoy (August 3, 1998)
Las Noticias (August 22, 2016)
Despierta (August 22, 2016)
Al aire con Paola Rojas (August 22, 2016)
En punto con Denise Maerker (August 22, 2016)
Sports
Liga MX Acción (1979)
La jugada (1993)
Más deporte (1997)
Canal 5
Me caigo de risa (March 4, 2014)
Reto 4 elementos (March 19, 2018)
Inseparables: amor al límite (May 27, 2019)
La casa de los famosos México (June 5, 2023)
Nu9ve
Talk/reality shows
Reventón musical ¡Despierta América! (July 9, 2018)
Enámorandonos (September 13, 2021)
News/public affairs programming
Aquí y Ahora Domingo de tercer milenioSports
Hazaña el deporte vive Lucha Libre AAAFOROtv
Agenda Pública A las tres Creadores Universitarios En 1 hora Es la hora de opinar Estrictamente Personal Foro Global Fractal Historias por Contar Las Noticias Major League Baseball Matutino Express Noticias CDMX Paralelo 23 Si me dicen no vengo Sin FiltroUpcoming programming
Former programming
Telenovelas
Comedies
Alma de ángel (2019)
Ay María qué puntería (1998)
Cepillin (1977)
El Chavo del Ocho (1970)
Chespirito (1970; 1980–1995)
El Diablito Foro Loco El Grosero (Bad Language Show)
La Hora Azul (1992)
Incógnito (2005)
Julia vs. Julia (2019)
Lorenza (2019–2020)
La Matraca Mi Barrio (1991–1994)
Mi querida herencia (2019–2021)
Mi lista de exes (2018)
Odisea Burbujas Operacion Ja Ja La parodia (2002–2020)
Los Polivoces ¡Qué madre tan padre! (2006)
Según Bibi (2018)
Simón dice (2018–2019)
S.O.S.S.A Tic Tac Toc: El reencuentro (2021)
Todo de Todo (19
|
https://en.wikipedia.org/wiki/List%20of%20programs%20broadcast%20by%20TV%20Azteca%20networks
|
This is a list of programs formerly and currently, and soon to be broadcast by TV Azteca owned broadcast television networks. TV Azteca owns four broadcast television networks: Azteca Uno, Azteca 7, A Más and adn40 in Mexico.
Current programming
Original programming
Children's programs
Plaza Sésamo (April 27, 2020 – present)
Comedy
La resolana (2015–present)
Contests
Escape perfecto (2015–present)
Entertainment
Extranormal (2007–present)
Al extremo (2008–2014; 2016–present)
Pop central (2021–present)
Magazine and performances
Venga la alegría (January 2, 2006 – present)
Ventaneando (1996–present)
News
Hechos (1994–present)
Hechos Aquí Entre Nos (2020–2023)
Hechos Domingo (2020–present)
Hechos Meridiano (1994–present)
Hechos Noche con Javier Alatorre (1994–present)
Hechos sábado (1998–present)
A quien corresponda, con Jorge Garralda (1993–present)
Opinion
13 en libertad con Sergio Sarmiento (2013–present)
Aquí entre amigos con Carlos Alazraki (2013–present)
La billetera (2013–present)
La de ocho con Lourdes Mendoza, Eduardo Ruiz Healy y Horacio Villalobos (2013–present)
Los despachos del poder con Alberto Tavira (2013–present)
EC Pablo Boullosa (2013–present)
En contexto con Jaime Sánchez Susarrey (2002–present)
En el ring con Andrés Roemer (2013–present)
La Entrevista con Sarmiento (1997–present)
Frente a Frente con Lolita de la Vega (2001–present)
Katia 360 con Katia D'Artigues (2012–present)
México confidencial con Jorge Fernández Menéndez, Pablo Hiriart y Ezra Shabot (2013–present)
La pura verdad con Gabriel Bauducco (2013–present)
Reporte 13 con Ricardo Rocha (2001–present)
Vidas apasionantes con Antonio Rosique (2013–present)
Reality shows
La Academia (2002–present)
MasterChef Junior México (2016–present)
MasterChef México (2015–present)
La Voz (2019–present; Mexican version of The Voice)
La Voz Kids (2021–present; Mexican version of The Voice Kids)
La Voz Senior (2019–present; Mexican version of The Voice Senior)
Special/variety
Boton Ganador (game show)
Campañeando
Corazón grupero
En contexto
MasterChef México la Revancha
Los protagonistas
Tercer Milenio (2019–present)
Sports
Box Azteca (boxing on Saturday nights) but championship fights shared with Televisa's Sabados de Box
DeporTV
Fut Azteca: Liga MX matches on Friday nights normally of Mazatlán FC, and Puebla F.C. Non-Izzi Telecom exclusive saturday/sunday nights matches featuring Santos Laguna shared with Televisa. Selected matches of Juárez, Monterrey or Xolos Expansión MX weekly matches on Azteca Deportes Digital app only. Selected matches of the FIFA World Cup and CONCACAF Gold Cup shared with Sky and Televisa.
Home Run Azteca Mexican League Baseball. Azteca Deportes Digital app only.
Lucha Azteca Lucha Libre AAA Worldwide.
Ritual NFL Super Bowl only.
Selección Azteca Mexico national football team's all matches.
Talk shows
Mimí contigo (2021 – 2022)
Television series
Compañeros y carnales (September 21, 2020 – present)
Unitary
Un día para vivir (September 6, 2021–pres
|
https://en.wikipedia.org/wiki/XEQ-TDT
|
XEQ-TDT (channel 22, virtual channel 9) is a Televisa TV station, based in Mexico City. XEQ is the flagship television station of the Nu9ve network. The Nu9ve network, unlike the other major networks in Mexico, is broadcast by a mix of full-time repeaters as well as local stations, operated by Televisa and its local partners, that also produce and air local programs.
History
XEQ was founded in 1969, as XHTM-TV channel 8 operated by Televisión Independiente de México (TIM). TIM was headquartered at Estudios San Angel from the time it signed on. In January 1973, TIM merged with Telesistema Mexicano, becoming Televisión Vía Satélite, better known as Televisa. TIM's Mexico City headquarters and production center became Televisa San Angel, which along with Televisa's original Chapultepec facility, is one of the network's two primary Mexico City studios.
In 1985, Imevisión desired to add a VHF station in Mexico City, which became XHIMT-TV channel 7. In order to accomplish this, a complex channel swap was conducted involving XHTM and Televisa's relay stations at Altzomoni in the State of Mexico. XEX-TV, then on channel 7, was moved to 8, and XEQ-TV, then on 9, was moved to channel 10. As part of the move, Televisa moved the XEQ-TV callsign to Mexico City, so the two repeaters on Puebla became XEX-TV and XHTM-TV.
For much of the 1980s, Televisa devoted channel 9 to noncommercial cultural and educational programming. This ended in 1992 with XEQ-TV returning to commercial programming.
In 2018, the concessions of all Televisa-owned Nu9ve stations were consolidated in the concessionaire Teleimagen del Noroeste, S.A. de C.V., as part of a corporate reorganization of Televisa's concessionaires.
Digital channels
The station's digital signal is multiplexed:
Analog-to-digital conversion
XEQ-TV and other television stations in Mexico City and Toluca discontinued regular programming on its analog signal, over VHF channel 9 (8 in Toluca), on December 17, 2015 at 12:00 a.m., as part of the IFT federally mandated transition from analog to digital television.
In 2016, in order to facilitate the repacking of TV services out of the 600 MHz band (channels 38-51), XEQ was allowed to move from channel 44 to channel 22. The change occurred in April 2017, including a brief period in which both facilities operated at the same time. The Toluca transmitter repacked in July 2018 at the same time as the other Televisa stations in Toluca.
Repeaters
|-
|}
The Toluca station carries certain local programs and is known as Nu9ve Estado de México. Local programming in Toluca began in 2002.
External links
Official web page
Gala TV Estado de México
References
Spanish-language television stations in Mexico
Nueve (Mexican TV network) affiliates
Television stations in Mexico City
Television stations in the State of Mexico
Television channels and stations established in 1969
|
https://en.wikipedia.org/wiki/XHTV-TDT
|
XHTV-TDT (virtual channel 4), launched in 1950 by Romulo O'Farril, is a flagship TV station of Televisa and carries its FORO news network. FOROtv is available on various cable television companies and SKY México satellite service, along with several providers in the United States as part of Televisa and Univision's partnership (albeit with local programming and sports replaced with American ads and recorded news blocks). It is the oldest TV station in Mexico and Latin America.
History
XHTV was Mexico's first television station and one of the building blocks of Telesistema Mexicano, which became Televisa in 1972.
In 2001, XHTV began using the name 4TV with a program lineup targeted at the Mexico City area and the slogan "El Canal de la Ciudad" (The City Channel).
On August 30, 2010 (sixty years after the channel was founded), the channel's name was changed to FOROtv (literally "Forum TV"), with most of Televisa's news programs moved here, such as Las Noticias por Adela (from XEQ), and with new news and talk programs being created. Prior to this, the channel, under the name of "Canal de la Ciudad" ("The City's Channel"), broadcast programs targeted at Mexico City's metro area, as well as reruns of American series and blocks of Mexican movies.
Under this format, the channel seeks to emulate the success achieved by its predecessor ECO (which operated from 1988 to 2001). It competes in a crowded cable news space with such channels as TV Azteca's adn40 and Azteca Noticias, Telefórmula, Efekto TV, CNN en Español, Excélsior TV, and Milenio Televisión, among others.
Digital television
Digital subchannels
The station's digital channel is multiplexed:
Analog-to-digital conversion
XHTV, along with other Mexico City TV stations, shut off its analog signal on VHF channel 4, on December 17, 2015, at 12:00 a.m., as part of the federally mandated transition from analog to digital television. The station's digital signal remained on its pre-transition UHF channel 49, using PSIP to display XHTV's virtual channel as 4 on digital television receivers.
In October 2016, XHTV added shopping channel CJ Grand Shopping as subchannel 4.2; this channel was deleted in March 2019 and replaced in June with a new CV Shopping channel wholly owned by Televisa.
On November 3, 2018, XHTV relocated from channel 49 to 15 to allow the 600 MHz band to be used for mobile services. It was the last station to repack in Mexico City.
Current programs
Original productions
Some of the programs on XHTV as Foro TV currently include the following:
Las Noticias ("The News")
Estrictamente Personal (Strictly Personal)
Por las Mañanas (In the Mornings)
Paralelo 23 ("The 23rd Parallel", passes through central Mexico)
A las Tres ("At 3:00 p.m.", anchored by Ana Paula Ordorica)
Hora 21 ("21st Hour"; airs at 9:00 p.m., anchored by Julio Patán)
En Una Hora ("In One Hour")
El Centro del Debate ("Debate Center")
Agenda Pública ("The Public Agenda")
Es La Hora De Opinar ("It's Time for Your Op
|
https://en.wikipedia.org/wiki/XHGC-TDT
|
XHGC-TDT (channel 5) is a television station owned by Grupo Televisa, broadcasting from Mexico City, and is the flagship of the Canal 5 network.
History
XHGC signed on May 10, 1952, broadcasting a Mother's Day event organized by the Excélsior newspaper, but regular programming began on August 18, 1952. The station was established by Guillermo González Camarena, a Mexican engineer who was one of the inventors of modern color television; the station's calls reflect his surnames. González Camarena was director and general manager of XHGC until his death in 1965, and XHGC's concessionaire remained Televisión González Camarena, S.A., until November 30, 1994.
In 1954, XHGC was one of the first stations in the world to broadcast an early version of 3D television, in which two of the same picture appear side by side on the screen, combined into a single 3-dimensional image using special glasses. This version of 3D television was developed by an American inventor, James Butterfield, and tested in Mexico on XHGC.
In 1963, XHGC became the first station in Mexico to broadcast in color. By request of Guillermo González Camarena, XHGC became oriented at an audience of children and youth. The first color program broadcast was Paraíso infantil (Children's Paradise). Mexico was also likely the third country in North America and the fourth in the world, behind the United States, Cuba, and Japan, to introduce color television.
During its early years, XHGC also brought educational television to Mexico City viewers, with Telesecundaria, a pioneering educational program operated by the Secretary of Public Education.
At the end of the 1980s, the then-vice president of Televisa, Alejandro Burillo Azcárraga, spearheaded drastic changes in the branding of the company's television networks. While XHGC had branded as Canal 5 for years, using various logos with the number 5. However, as the network's various repeaters were not all on channel 5, the network began branding by the XHGC callsign. The landmark Energía Visual (Visual Energy) campaign, designed by Agustín Corona and Pablo Jato, featured idents with wildly varied logos and designs—a first for Mexican television. The campaign was designed to back the channel's youthful image.
The late 1980s also saw a unique split between XHGC and XEX-TV on Altzomoni, the other Canal 5 station receivable in Mexico City. The network began its broadcast day at 7 am in Mexico City, but at 4 pm in the rest of Mexico. The daytime hours on XEX (and some other Canal 5 repeaters) were filled by "TV Matutina" (later known as "Supercadena 8" or Super Channel 8), which offered repeats of Canal 5 and other Televisa programs.
In the 1990s, Canal 5 began branding with its channel number again. During this time period, Alejandro González Iñárritu, who had also been involved with Televisa's radio station XEW-FM (WFM), was involved in the creation of some of the network's promotional campaigns.
1999 saw the beginning of a shift in content pr
|
https://en.wikipedia.org/wiki/Algorithmic%20information%20theory
|
Algorithmic information theory (AIT) is a branch of theoretical computer science that concerns itself with the relationship between computation and information of computably generated objects (as opposed to stochastically generated), such as strings or any other data structure. In other words, it is shown within algorithmic information theory that computational incompressibility "mimics" (except for a constant that only depends on the chosen universal programming language) the relations or inequalities found in information theory. According to Gregory Chaitin, it is "the result of putting Shannon's information theory and Turing's computability theory into a cocktail shaker and shaking vigorously."
Besides the formalization of a universal measure for irreducible information content of computably generated objects, some main achievements of AIT were to show that: in fact algorithmic complexity follows (in the self-delimited case) the same inequalities (except for a constant) that entropy does, as in classical information theory; randomness is incompressibility; and, within the realm of randomly generated software, the probability of occurrence of any data structure is of the order of the shortest program that generates it when running on a universal machine.
AIT principally studies measures of irreducible information content of strings (or other data structures). Because most mathematical objects can be described in terms of strings, or as the limit of a sequence of strings, it can be used to study a wide variety of mathematical objects, including integers. One of the main motivations behind AIT is the very study of the information carried by mathematical objects as in the field of metamathematics, e.g., as shown by the incompleteness results mentioned below. Other main motivations came from surpassing the limitations of classical information theory for single and fixed objects, formalizing the concept of randomness, and finding a meaningful probabilistic inference without prior knowledge of the probability distribution (e.g., whether it is independent and identically distributed, Markovian, or even stationary). In this way, AIT is known to be basically founded upon three main mathematical concepts and the relations between them: algorithmic complexity, algorithmic randomness, and algorithmic probability.
Overview
Algorithmic information theory principally studies complexity measures on strings (or other data structures). Because most mathematical objects can be described in terms of strings, or as the limit of a sequence of strings, it can be used to study a wide variety of mathematical objects, including integers.
Informally, from the point of view of algorithmic information theory, the information content of a string is equivalent to the length of the most-compressed possible self-contained representation of that string. A self-contained representation is essentially a program—in some fixed but otherwise irrelevant universal programming la
|
https://en.wikipedia.org/wiki/LUSENET
|
LUSENET was a free public bulletin board system active from 1995 to 2005.
Created as an experiment by MIT computer scientist and early internet entrepreneur Philip Greenspun, the TCL-based system was named as a punning combination of USENET and luser. Because LUSENET of France allowed anyone to start their own forum for free and did not have banner ads, it became an important alternative to commercial sites run by Yahoo and Google. It was long favored by non-profits and eventually bloggers in the late 1990s, such as one for the unofficial San Francisco History Index, and the popular I Love Music forums.
The system running LUSENET crashed in March 2005 and it is no longer active. The content is frozen as of that date.
The database on this ancient unmaintained Linux machine suffered some sort of ugly failure in early March 2005. Consequently postings have been disabled and moderators are encouraged to move their forums to groups.yahoo.com or some other similar advertising-supported service. The greenspun.com forums were easy to build ten years ago but became difficult to maintain in a world full of spammers, etc.
External links
LUSENET
Internet forums
http://greenspun.com/bboard/index.tcl
|
https://en.wikipedia.org/wiki/Sydney%20Trains%20K%20set
|
The Sydney Trains K sets are a class of electric multiple units that currently operate on the Sydney Trains network. Built by A Goninan & Co, the K sets first entered service in 1981 operating under the State Rail Authority, and later CityRail. The carriages are of stainless steel, double deck construction and share much of their design with the older S sets. All of the 40 K sets originally built (160 carriages) remain in service and are currently the oldest in the Sydney Trains fleet.
Design and construction
The K sets were the first New South Wales suburban trains to be air conditioned and have headlights.
Two orders were placed for the K sets with all manufactured between 1981 and 1985 by A Goninan & Co in Broadmeadow:
Order 1
Order 2
The first order featured low mounted upper deck windows, off-white and sagebrush grey interiors, and unpainted fronts. The second order featured higher mounted upper deck windows, yellow and mustard interiors and State Rail Authority candy livery fronts.
The first four trailers were built as driving trailers allowing them to operate in two-car formation, although in practice they were formed into four carriage sets and often ran together as one eight-car set until 1988. These also differed in the subsequent deliveries in being fitted with air conditioning from new, rather than pressure ventilation. To provide a spare, C3550 & T4216 were also built with air conditioning. All ten carriages were fitted with different windows, being sheet glass with small opening hoppers. This was replaced with sheet glass in 1993.
To accommodate the air conditioning and associated equipment, the pantograph had to be shifted to the adjacent trailer car to which the power car is semi-permanently coupled with high voltage cables connecting the two cars. Although some power cars and trailers have been broken up and married with others during periods of heavy maintenance, many original combinations remain.
The control carriages have a flat front, with headlights at the top. They were built with four sets of marker lights, standard at the time. Different combinations of white marker lights were used to indicate different destinations. Flip-dot destination displays were installed later on, which covered the upper middle marker light. Since destination displays have been installed, marker light combinations are no longer necessary, so usually only the two upper marker lights are used. However, some trains still retain the switch for the lower marker light. The front of the train also has an emergency door for the guard compartment and windscreen wipers for the driver window only. Hoses and receptacles are provided below the windows to connect another set, since, unlike newer trains, the coupler does not carry electrical or air connections.
Like other trains of the time, the crew compartment contains a smaller compartment for the driver on the left side (in direction of travel). The guard uses the area outside of the driver's compar
|
https://en.wikipedia.org/wiki/Two%20Dozen%20and%20One%20Greyhounds
|
"Two Dozen and One Greyhounds" is the twentieth episode of the sixth season of the American animated television series The Simpsons. It originally aired on the Fox network in the United States on April 9, 1995. The episode was written by Mike Scully and directed by Bob Anderson. Frank Welker guest stars as Santa's Little Helper and various other dogs. In the episode, Santa's Little Helper has puppies with a dog that he met at the greyhound racetrack.
The episode is a parody of Walt Disney Pictures' 1961 animated film One Hundred and One Dalmatians. The producers decided to have Mr. Burns communicate his horrific plan of making a tuxedo from the puppies through a musical number, "See My Vest", after determining that it would be a "fun and light" way to convey his plan of killing the greyhounds. "Two Dozen and One Greyhounds" received a generally positive reception from television critics. During the week of its original broadcast, the episode finished 55th in ratings, with a Nielsen rating of 7.3. Several reviews considered the episode to be among the best in the series, with Mr. Burns' role and the "See My Vest" sequence being singled out for praise.
Plot
The Simpson family's dog, Santa's Little Helper, runs away from home to the dog racing track, where he mates with a female greyhound named She's The Fastest. She gives birth to a litter of 25 puppies after her owner, the Rich Texan, gives her to the Simpsons. They quickly become too difficult to manage, so Homer and Marge try giving them away. They soon find that the puppies do not like being separated, so Mr. Burns offers to take them all. Fearing he will mistreat them, Lisa persuades her parents to refuse Burns' offer, but he and Smithers secretly steal the puppies.
After Chief Wiggum casually remarks that Burns has the puppies, Bart and Lisa sneak into Burns Manor. They are surprised to see him bathing and doting on the dogs. One of them stands up on its hind legs, reminding Burns of actor Rory Calhoun; he names this one "Little Monty." Bart and Lisa learn that he plans to kill the other 24 puppies and make a tuxedo from their pelts when he performs a song, using his wardrobe of macabre clothing fashioned from animal hides to make several costume changes.
Bart and Lisa slip inside the mansion to retrieve the litter. The children and puppies slide down a laundry chute to the basement, where Burns and Smithers are waiting for them. To trick Burns into freeing the puppies, Bart mixes them up so that he cannot tell which one is Little Monty. After Little Monty stands on Burns' command, Bart reels a clothesline so that socks dangle overhead to get all the puppies to stand. Burns briefly considers killing all the puppies and the children, but cannot bring himself to do it since they all remind him of Calhoun. The Simpsons then let Burns keep the puppies, who grow to become world champion racing dogs and earn him millions of dollars in prize money. Marge visits the basement to find a depressed H
|
https://en.wikipedia.org/wiki/Knightmare%20%281986%20video%20game%29
|
Knightmare is a 1986 vertically scrolling shooter video game developed and published by Konami for the MSX home computer. It was included in compilations for the MSX, PlayStation and Sega Saturn, followed by a port for mobile phones, and digital re-releases for the Virtual Console and Microsoft Windows. It is the first entry in the Knightmare trilogy. The game stars Popolon, a warrior who embarks on a quest to rescue the princess Aphrodite from the evil priest Hudnos. The player must fight waves of enemies while avoiding collision with their projectiles and obstacles along the way, and facing against bosses.
Knightmare was created by the MSX division at Konami under management of Shigeru Fukutake. The character of Popolon was conceived by a staffer who later became the project's lead designer and writer, as the process of making original titles for the platform revolved around the person who came up with the characters. Development proceeded with a team of four or five members, lasting somewhere between four and six months. The music was scored by Miki Higashino, best known for her work in the Gradius and Suikoden series, and Yoshinori Sasaki.
Knightmare proved popular among Japanese players, garnering generally positive reception from critics and retrospective commentarists. It was followed by The Maze of Galious and Shalom: Knightmare III (1987), while Popolon and Aphrodite would later make appearances outside of the trilogy in other Konami titles. In the years since, fans have experimented with remaking and porting the title unofficially to other platforms.
Gameplay
Knightmare is a vertical-scrolling shoot 'em up game starring Popolon, a warrior who embarks on a quest to rescue the princess Aphrodite from the evil priest Hudnos. The player controls Popolon through eight increasingly difficult stages across a Greek-esque fantasy setting, populated with an assortment of enemies and obstacles, over a constantly scrolling background that never stops moving until a boss is reached, which must be fought in order to progress further. The player must also avoid or take out enemy formations to gain bonus points, and reveal hidden bridges to cross rivers by shooting at it.
Popolon is equipped with a bow and arrows as the main weapon, which can be upgraded or changed by collecting a flashing weapon crystal. Picking up a new weapon grants its initial state and can be upgraded by picking the same weapon twice in a row. Popolon can also obtain temporary power-ups via power crystals branded with a "P" icon that initially appears colored black. These can be cycled through other weapons and power-ups by firing at them, ranging from boomerangs, three-way shots, swords, speed increasers, temporary invincibility and a shield to withstand enemy projectiles. If grabbed in their initial state, these crystals grant extra bonus points instead.
Scattered on the playfield are question mark blocks containing chess-themed magic jewels that can aid or hinder the pl
|
https://en.wikipedia.org/wiki/Projection%20pursuit
|
Projection pursuit (PP) is a type of statistical technique which involves finding the most "interesting" possible projections in multidimensional data. Often, projections which deviate more from a normal distribution are considered to be more interesting. As each projection is found, the data are reduced by removing the component along that projection, and the process is repeated to find new projections; this is the "pursuit" aspect that motivated the technique known as matching pursuit.
The idea of projection pursuit is to locate the projection or projections from high-dimensional space to low-dimensional space that reveal the most details about the structure of the data set. Once an interesting set of projections has been found, existing structures (clusters, surfaces, etc.) can be extracted and analyzed separately.
Projection pursuit has been widely used for blind source separation, so it is very important in independent component analysis. Projection pursuit seeks one projection at a time such that the extracted signal is as non-Gaussian as possible.
History
Projection pursuit technique were originally proposed and experimented by Kruskal. Related ideas occur in Switzer (1970) "Numerical classification" pp31–43 in "Computer Applications in the Earth Sciences: Geostatistics, and Switzer and Wright (1971) "Numerical classification of eocene nummulitids," Mathematical Geology pp 297–311. The first successful implementation is due to Jerome H. Friedman and John Tukey (1974), who named projection pursuit.
The original purpose of projection pursuit was to machine-pick "interesting" low-dimensional projections of a high-dimensional point cloud by numerically maximizing a certain objective function or projection index.
Several years later, Friedman and Stuetzle extended the idea behind projection pursuit and added projection pursuit regression (PPR), projection pursuit classification (PPC), and projection pursuit density estimation (PPDE).
Feature
The most exciting feature of projection pursuit is that it is one of the very few multivariate methods able to bypass the "curse of dimensionality" caused by the fact that high-dimensional space is mostly empty. In addition, projection pursuit is able to ignore irrelevant (i.e. noisy and information-poor) variables. This is a distinct advantage over methods based on interpoint distances like minimal spanning trees, multidimensional scaling and most clustering techniques.
Many of the methods of classical multivariate analysis turn out to be special cases of projection pursuit. Examples are principal component analysis and discriminant analysis, and the quartimax and oblimax methods in factor analysis.
One serious drawback of projection pursuit methods is their high demand on computer time.
See also
Projection pursuit regression
Targeted projection pursuit
References
Exploratory data analysis
Multivariate statistics
|
https://en.wikipedia.org/wiki/Philip%20Wadler
|
Philip Lee Wadler (born April 8, 1956) is a UK-based American computer scientist known for his contributions to programming language design and type theory. He is the chair of theoretical computer science at the Laboratory for Foundations of Computer Science at the School of Informatics, University of Edinburgh. He has contributed to the theory behind functional programming and the use of monads; and the designs of the purely functional language Haskell and the XQuery declarative query language. In 1984, he created the Orwell language. Wadler was involved in adding generic types to Java 5.0. He is also author of "Theorems for free!", a paper that gave rise to much research on functional language optimization (see also Parametricity).
Education
Wadler received a Bachelor of Science degree in mathematics from Stanford University in 1977, and a Master of Science degree in computer science from Carnegie Mellon University in 1979. He completed his Doctor of Philosophy in computer science at Carnegie Mellon University in 1984. His thesis was entitled "Listlessness is better than laziness" and was supervised by Nico Habermann.
Research and career
Wadler's research interests are in programming languages.
Wadler was a research fellow at the Programming Research Group (part of the Oxford University Computing Laboratory) and St Cross College, Oxford during 1983–87. He was progressively lecturer, reader, and professor at the University of Glasgow from 1987 to 1996. Wadler was a member of technical staff at Bell Labs, Lucent Technologies (1996–99) and then at Avaya Labs (1999–2003). Since 2003, he has been professor of theoretical computer science in the School of Informatics at the University of Edinburgh.
Wadler was editor of the Journal of Functional Programming from 1990 to 2004.
Since 2003, Wadler has been a professor of theoretical computer science at the Laboratory for Foundations of Computer Science at the University of Edinburgh and is the chair of theoretical computer science. In 2006, he was working on a new functional language for writing web applications, called Links. He has supervised many doctoral students to completion. He is also a member of the university's Blockchain Technology Laboratory. Wadler has a h-index of 72 with 26,864 citations at Google Scholar.
Since 2018 Wadler was has also been a senior research fellow and area leader for programming languages at IOHK (now Input Output Global), the blockchain engineering company developing Cardano. He has contributed to work on Plutus, a Turing-complete smart contract language for Cardano written in Haskell; the UTXO ledger system, native tokens, and System F in Agda.
Awards and honours
In 2003, Wadler was given the award for the most influential paper from ten years earlier by the Symposium on Principles of Programming Languages. The award cited "Imperative functional programming", a paper written jointly with Simon Peyton Jones in 1993. In 2005, he was elected Fellow of the Royal So
|
https://en.wikipedia.org/wiki/Networked%20learning
|
Networked learning is a process of developing and maintaining connections with people and information, and communicating in such a way so as to support one another's learning. The central term in this definition is connections. It adopts a relational stance in which learning takes place both in relation to others and in relation to learning resources. In design and practice, networked learning is intended to facilitate evolving sets of connections between learners and their interpersonal communities, knowledge contexts, and digital technologies.
Networked learning can offer educational institutions more functional efficiency, in that the curriculum can be more tightly managed centrally, or in the case of vocational learning, it can reduce costs to employers and tax payers. However, it is also argued that networked learning is too often considered within the presumption of institutionalised or educationalised learning, thereby omitting awareness of the benefits that networked learning has to informal or situated learning.
History
Network and networked learning theories can be traced back into the 19th Century, when commentators were considering the social implications of networked infrastructure such as the railways and the telegraph. More recently, networked learning has its roots in the 1970s, with the likes of Ivan Illich's book, Deschooling Society, through to more recent commentary in the early 2000s, largely inspired by the Internet and social media.
1970s
In 1971, Ivan Illich envisioned 'learning webs' as a model for people to network the learning they needed:
I will use the words "opportunity web" for "network" to designate specific ways to provide access to each of four sets of resources. "Network" is often used, unfortunately, to designate the channels reserved to material selected by others for indoctrination, instruction, and entertainment. But it can also be used for the telephone or the postal service, which are primarily accessible to individuals who want to send messages to one another. I wish we had another word to designate such reticular structures for mutual access, a word less evocative of entrapment, less degraded by current usage and more suggestive of the fact that any such arrangement includes legal, organizational, and technical aspects. Not having found such a term, I will try to redeem the one which is available, using it as a synonym of "educational web." Ivan Illich, 1971
In 1977 Christopher Alexander, Sara Ishikawa, Murray Silverstein, Max Jacobson, Ingrid Fiksdahl-King and Shlomo Angel wrote and published A Pattern Language: Towns, Buildings, Construction. In this seminal text, mostly referred to by architects, lists a "Network of Learning" as the 18th pattern, and cites Illich's earlier book as "the most penetrating analysis and proposal for an alternative framework for education." Alexander et al. go on to advise builders and town planners interested in establishing learning networks with:
"...work in piecem
|
https://en.wikipedia.org/wiki/Filthy%20Rich%3A%20Cattle%20Drive
|
Filthy Rich: Cattle Drive is an American reality television program that aired on the E! network in 2005. On E! Australia it aired as Rich Kids: Cattle Drive.
Synopsis
The show involves a City Slickers/The Simple Life-like premise, with the privileged children of celebrities working on a Colorado cattle ranch. The television series was created by Justin Berfield and produced by his J2TV producing partner, Jason Felts, as well as Joe Simpson. The show premiered August 7, 2005.
Cast
Kourtney Kardashian — daughter of attorney Robert Kardashian and socalite Kris Jenner. She has since appeared on the reality shows The Simple Life, Keeping Up with the Kardashians, Kourtney and Khloé Take Miami, Kourtney and Kim Take New York and Kourtney and Khloé Take The Hamptons.
George Foreman III — son of boxer George Foreman. He is executive vice president of George Foreman Enterprises, Inc.
Shanna Ferrigno — daughter of bodybuilder Lou Ferrigno. She has a recurring role as Nurse Janice in Days of Our Lives, and appeared in the NBC series Windfall, as well as the telemovie Within.
Noah Blake — son of actor Robert Blake. His acting career began in 1987 with guest roles in various US television series including sitcoms like Married... with Children and progressed to supporting roles in shows like Harry and the Hendersons and General Hospital. He starred as Rhet in the cult favorite film Teen Witch (1989). In the 1990s he moved on to guest roles in action-adventure series like JAG and ER. In 2005 he guest starred on LAX.
Brittny Gastineau — daughter of NFL footballer Mark Gastineau and Lisa Gastineau. She had previously starred in another reality show, The Gastineau Girls, and later had a guest appearance on Keeping Up with the Kardashians.
Fabian Basabe — son of an Ecuadorian businessman. In 2005 he married Martina Borgomanero, heir to the La Perla clothing company.
Courtenay Semel — daughter of then Yahoo! CEO Terry Semel.
Alex A. Quinn — son of Mexican-born actor Anthony Quinn. His credits include Lake Dead, The Curse of Alcatraz, Last Goodbye, An Existential Affair, and Starving Hysterical Naked. Quinn was named one of W magazine's "Hollywood's Hottest Kids to Watch" and one of America's Most Eligible Bachelors by Complete Woman magazine in 2007.
Haley Giraldo — daughter of singer Pat Benatar and Neil Giraldo. She was the 2002 "Miss Golden Globe" and once toured with her mother as part of an all-female band called GLO.
The Hon. Alexander Clifford — son of The Right Honourable Thomas Clifford, 14th Baron Clifford of Chudleigh.
References
External links
2000s American reality television series
2005 American television series debuts
2005 American television series endings
English-language television shows
E! original programming
Television shows set in Colorado
|
https://en.wikipedia.org/wiki/King%27s%20Valley%20II
|
King's Valley II: The Seal of El Giza is a game for MSX1 and MSX2 computers by Konami. It is a sequel to King's Valley from 1985.
The MSX2 version only saw a release in Japan. The same goes for a very rare "contest" version. The contest was about making levels with the games' built-in level editor, held by four Japanese MSX magazines, two of them are MSX.FAN and Beep. The winners of this contest received a gold cartridge with the twenty custom stages on it. Custom levels can be saved to either a disk or tape, and the levels are interchangeable between both the MSX1 and MSX2 versions.
Story
Far, far into the future, inter-planetary archaeologist Vick XIII, makes a choking discovery.
The pyramids on earth are malfunctioning devices of alien origin with enough energy to destroy earth.
And it's up to Vick to switch off the core functions of El Giza.
Gameplay
The game consists of six pyramids each with its own wall engravings and color pattern; every pyramid contains 10 levels.
The idea of the game is to collect crystals called soul stones in each level by solving the different puzzles and evading or killing the enemies using the many tools and weapons available to unlock the exit door that will take you to the next level.
Versions
The later Konami game Castlevania: Portrait of Ruin for the Nintendo DS reuses the stage musics "In Search of the Secret Spell" and "Sandfall" for the Egyptian area of the game.
The MSX 2 version was the same game except minor changes like the music was remixed and some of the items and backgrounds recolored.
Castlevania: Harmony of Despair uses a remix of the Stage Clear theme as the Stage Clear theme for Chapter 7: Beauty, Desire, Situation Dire (not found on the OST).
References
1988 video games
Ancient Egypt in fiction
Konami games
MSX games
MSX2 games
Puzzle video games
Video games scored by Kinuyo Yamashita
Video games scored by Michiru Yamane
Video games set in Egypt
Video games developed in Japan
|
https://en.wikipedia.org/wiki/Ning%20%28website%29
|
Ning is an online social media network platform for people and organizations to create custom social networks. Ning was co-founded by Marc Andreessen and Gina Bianchini and launched in October 2005. By June 2011 there were over 90,000 social websites running on the Ning Platform.
History
Ning started development in October 2004 and launched its platform publicly in October 2005.
At its launch, Ning was a free-form platform for the development and hosting of open-source "social applications". The source code for Ning applications was available to users so that anyone could fork a Ning application, modify its PHP code and run it as their own. In late September 2006, Ning narrowed its focus to offering a group website, a photos website, and a videos website for people to copy and use for any purpose. These three templates were later superseded by a single customizable application aimed at enabling anyone to easily create their own social network.
Ning was initially funded internally by Bianchini, Andreessen and angel investors. In July 2007, Ning raised US$44 million in venture capital, led by Legg Mason. In 2008 and 2009, the company announced it had raised an additional US$75 million in capital.
On April 15, 2010, CEO Jason Rosenthal announced that the free service would be suspended, and 41% of the employees would be laid off. Users of the free service had the option to either upgrade to a paid account or transition their content from Ning. In 2011, Ning was purchased by Glam Media and then officially acquired by Mode Media.
Features
Ning allows users to create their own communities and social networks around specific interests with their own visual design, choice of features and member data. Ning provides several core features, including opportunities for monetization, integration with other social networks, chat, email services, forums, polls and analytics. Customers are also able to map a Ning social network to a custom domain.
The social networks running on Ning's service are programmed with PHP and the platform itself is built in Java. Since October 2010, social networks using Ning can be administered through an iOS application.
In February 2018, Ning launched a monetization platform, enabling users to earn an income from their social websites.
See also
BuddyPress
Drupal
Google Groups
Yahoo! Groups
References
External links
PHP software
American social networking websites
Companies based in Palo Alto, California
Companies established in 2005
|
https://en.wikipedia.org/wiki/Transport%20triggered%20architecture
|
In computer architecture, a transport triggered architecture (TTA) is a kind of processor design in which programs directly control the internal transport buses of a processor. Computation happens as a side effect of data transports: writing data into a triggering port of a functional unit triggers the functional unit to start a computation. This is similar to what happens in a systolic array. Due to its modular structure, TTA is an ideal processor template for application-specific instruction set processors (ASIP) with customized datapath but without the inflexibility and design cost of fixed function hardware accelerators.
Typically a transport triggered processor has multiple transport buses and multiple functional units connected to the buses, which provides opportunities for instruction level parallelism. The parallelism is statically defined by the programmer. In this respect (and obviously due to the large instruction word width), the TTA architecture resembles the very long instruction word (VLIW) architecture. A TTA instruction word is composed of multiple slots, one slot per bus, and each slot determines the data transport that takes place on the corresponding bus. The fine-grained control allows some optimizations that are not possible in a conventional processor. For example, software can transfer data directly between functional units without using registers.
Transport triggering exposes some microarchitectural details that are normally hidden from programmers. This greatly simplifies the control logic of a processor, because many decisions normally done at run time are fixed at compile time. However, it also means that a binary compiled for one TTA processor will not run on another one without recompilation if there is even a small difference in the architecture between the two. The binary incompatibility problem, in addition to the complexity of implementing a full context switch, makes TTAs more suitable for embedded systems than for general purpose computing.
Of all the one-instruction set computer architectures, the TTA architecture is one of the few that has had processors based on it built, and the only one that has processors based on it sold commercially.
Benefits in comparison to VLIW architectures
TTAs can be seen as "exposed datapath" VLIW architectures. While VLIW is programmed using operations, TTA splits the operation execution to multiple move operations. The
low level programming model enables several benefits in comparison to the standard VLIW. For example, a TTA architecture can provide more parallelism with simpler register files than with VLIW. As the programmer is in control of the timing of the operand and result data transports, the complexity (the number of input and output ports) of the register file (RF) need not be scaled according to the worst case issue/completion scenario of the multiple parallel instructions.
An important unique software optimization enabled by the transport programming is called
|
https://en.wikipedia.org/wiki/Borland%20Database%20Engine
|
Borland Database Engine (BDE) is the Windows-based core database engine and connectivity software behind Borland Delphi, C++Builder, IntraBuilder, Paradox for Windows, and Visual dBASE for Windows.
History
Borland’s Turbo Pascal had a "database" Toolbox add-on, which was the beginning of the Borland compiler add-ons that facilitated database connectivity. Then came the Paradox Engine for Windows – PXENGWIN – which could be compiled into a program to facilitate connectivity to Paradox tables.
The first DLL-based connectivity engine was ODAPI (Open Database API). It represented Borland’s attempt to centralise connectivity in its suite of applications that included the brand-new Paradox for Windows 4 and Quattro. With version 4.5 / 5.0 of Paradox for Windows, this database engine was crystallised as IDAPI.
In 2000, Borland introduced a new SQL driver architecture called dbExpress, which deprecated BDE SQL links technology.
In 2014, Embarcadero removed the BDE installer from its Rad Studio XE7 install, making it a separate download in order to strengthen the message that the BDE has been deprecated for a number of years. Programmers using the BDE are encouraged to update their software to use newer database connectivity technologies like Embarcadero's FireDAC, or third-party-provided solutions.
Replacements for BDE include:
DBISAM from Elevate Software
Absolute Database from ComponentAce
BDE eXpress by Dr. Erhard Regener: a compatible API that uses dBase or Paradox.
Design
The included set of database drivers enables consistent access to standard data sources: Paradox, dBASE, FoxPro, Access, and text databases. You can add Microsoft ODBC drivers as needed to the built-in ODBC socket. Optionally, Borland's SQL Links product provides access to a range of database management systems (DBMS), including Informix, IBM Db2, InterBase, Oracle, and Sybase.
BDE is object-oriented in design. At runtime, application developers interact with BDE by creating various BDE objects. These runtime objects are then used to manipulate database entities, such as tables and queries. BDE's application program interface (API) provides direct C and C++ optimized access to the database engine, as well as BDE's built-in drivers for dBASE, Paradox, FoxPro, Access, and text databases.
The core database engine files consist of a set of DLLs that are fully re-entrant and thread-safe. Included with BDE are a set of supplemental tools and examples with sample code.
BDE system is configured using the BDE Administrator (BDEADMIN.EXE).
Included with BDE is Borland's Local SQL, a subset of ANSI-92 SQL enhanced to support Paradox and dBASE (standard) naming conventions for tables and fields (called "columns" in SQL). Local SQL lets you use SQL to query "local" standard database tables that do not reside on a database server as well as "remote" DBMS servers. Local SQL is also essential to make multi-table queries across both local standard tables and those on remote SQL servers.
|
https://en.wikipedia.org/wiki/ComNets
|
ComNets (Communication Networks), a chair of RWTH Aachen University, is a former university department in Germany working on Mobile Communications. Head of ComNets was Bernhard Walke. Research projects are mainly funded by third parties like national and European boards and communication industries. The research activities of about 40 fully employed research assistants are focused on design and further development as well as quantitative performance analysis of mobile communication systems like GPRS, TETRA, EDGE, UMTS, Next Generation, Dedicated Short Range Communication Systems, Hybrid Systems, Ad hoc and Multi-hop WLAN, HiperLAN/2, HiperMAN, mobile Satellite and High-Altitude Platforms. Stochastic simulation based on emulated protocol stacks and traffic theory are the main analysis methods. Essential results of ComNets' work have been incorporated into the standards ETSI-GPRS, CEN-DSRC, ETSI/HiperLAN/2, IEEE 802.11 e/h/s.
See also
Communications in Germany
P3 Solutions GmbH (2001–2009) aka P3 communications GmbH (2009–2019) aka (2019–), a company founded by ComNets members
References
External links
ComNets, Chair of Communication Networks at RWTH Aachen University
RWTH Aachen University
|
https://en.wikipedia.org/wiki/Router%20on%20a%20stick
|
A router on a stick, also known as a one-armed router, is a router that has a single physical or logical connection to a network. It is a method of inter-VLAN routing where one router is connected to a switch via a single cable. The router has physical connections to the broadcast domains where one or more VLANs require the need for routing between them.
Devices on separate VLANs or in a typical local area network are unable to communicate with each other. Therefore, it is often used to forward traffic between locally attached hosts on separate logical routing domains or to facilitate routing table administration, distribution and relay.
Details
One-armed routers that perform traffic forwarding are often implemented on VLANs. They use a single Ethernet network interface port that is part of two or more Virtual LANs, enabling them to be joined. A VLAN allows multiple virtual LANs to coexist on the same physical LAN. This means that two machines attached to the same switch cannot send Ethernet frames to each other even though they pass over the same wires. If they need to communicate, then a router must be placed between the two VLANs to forward packets, just as if the two LANs were physically isolated. The only difference is that the router in question may contain only a single Ethernet network interface controller (NIC) that is part of both VLANs. Hence, "one-armed". While uncommon, hosts on the same physical medium may be assigned with addresses and to different networks. A one-armed router could be assigned addresses for each network and be used to forward traffic between locally distinct networks and to remote networks through another gateway.
One-armed routers are also used for administration purposes such as route collection, multi hop relay and looking glass servers.
All traffic goes over the trunk twice, so the theoretical maximum sum of up and download speed is the line rate. For a two-armed configuration, uploading does not need to impact download performance significantly. Furthermore, performance may be worse than these limits, such as in the case of half-duplexing and other system limitations.
Applications
Cases where this setup is used can be found in servers dedicated for prints, files or for segmenting different departments. An example of router on a stick usage is found in Call Manager Express installation, when the Voice over IP network and Cisco IP phone devices have a need to split. Enterprise networks implement this method of separating servers to prevent all users from ‘having equal access privilege to resources’.
Naming
As the network is separated virtually, the router does not need to be placed adjacent to the devices, rather is it placed to the side in the network topology. The router is connected to the switch by a single cable. Therefore, giving the eponymous ‘stick’ formation. In some institutions, the abbreviation RoaS or ROAS is used instead of router on a stick.
Protocol and design
Router on a stick rel
|
https://en.wikipedia.org/wiki/ODF%20%28disambiguation%29
|
ODF is the OpenDocument format, a standard for electronic office documents.
ODF may also refer to:
Computing
OpenDocument Foundation, a defunct organization which had some interest in OpenDocument and alternative formats
Optical distribution frame, a distribution frame device to terminate optical fiber cables
Other uses
Oregon Department of Forestry, a government agency in the U.S.
Ombudsman for the Defence Forces, independent investigative military body in Ireland
Open defecation free, a state of a village or community which has basic sanitation
Operation Deep Freeze, a series of U.S. missions in Antarctica
Orientation distribution function, in material science, a mathematical function for determining texture
Osteoclast differentiation factor, in molecular biology, a signaling protein
Open Dialogue Foundation, a human rights NGO in Poland
|
https://en.wikipedia.org/wiki/Bit%20manipulation
|
Bit manipulation is the act of algorithmically manipulating bits or other pieces of data shorter than a word. Computer programming tasks that require bit manipulation include low-level device control, error detection and correction algorithms, data compression, encryption algorithms, and optimization. For most other tasks, modern programming languages allow the programmer to work directly with abstractions instead of bits that represent those abstractions.
Source code that does bit manipulation makes use of the bitwise operations: AND, OR, XOR, NOT, and possibly other operations analogous to the boolean operators; there are also bit shifts and operations to count ones and zeros, find high and low one or zero, set, reset and test bits, extract and insert fields, mask and zero fields, gather and scatter bits to and from specified bit positions or fields.
Integer arithmetic operators can also effect bit-operations in conjunction with the other operators.
Bit manipulation, in some cases, can obviate or reduce the need to loop over a data structure and can give manyfold speed-ups, as bit manipulations are processed in parallel.
Terminology
Bit twiddling, bit fiddling, bit bashing, and bit gymnastics are often used interchangeably with bit manipulation, but sometimes exclusively refer to clever or non-obvious ways or uses of bit manipulation, or tedious or challenging low-level device control data manipulation tasks.
The term bit twiddling dates from early computing hardware, where computer operators would make adjustments by tweaking or twiddling computer controls. As computer programming languages evolved, programmers adopted the term to mean any handling of data that involved bit-level computation.
Bitwise operation
A bitwise operation operates on one or more bit patterns or binary numerals at the level of their individual bits. It is a fast, primitive action directly supported by the central processing unit (CPU), and is used to manipulate values for comparisons and calculations.
On most processors, the majority of bitwise operations are single cycle - substantially faster than division and multiplication and branches. While modern processors usually perform some arithmetic and logical operations just as fast as bitwise operations due to their longer instruction pipelines and other architectural design choices, bitwise operations do commonly use less power because of the reduced use of resources.
Example of bit manipulation
To determine if a number is a power of two, conceptually we may repeatedly do integer divide by two until the number won't divide by 2 evenly; if the only factor left is 1, the original number was a power of 2. Using bit and logical operators, there is a simple expression which will return true (1) or false (0):
bool isPowerOfTwo = (x != 0) && ((x & (x - 1)) == 0);
The second half uses the fact that powers of two have one and only one bit set in their binary representation:
x == 0...010...0
x-1 ==
|
https://en.wikipedia.org/wiki/Witness%20to%20the%20Execution
|
Witness to the Execution is a 1994 American made-for-television drama film directed by Tommy Lee Wallace and starring Tim Daly and Sean Young. Its plot concerns a fictional television network's desire to carry the live execution of a condemned killer as a pay-per-view event. It also portrays the events surrounding the attempt to create a television show about the execution.
Cast
Sean Young as Jessica Traynor
Tim Daly as Dennis Casterline
Len Cariou as Jake Tyler
George Newbern as Phillip Tyler
Dee Wallace as Emily Dawson
Alan Fudge as Wallace Sternberg
Brian Markinson as Kirby Jacobs
Marina Palmier as Cynthia Moore
Constance Jones as Lucy
Alex Morris as Ramos
Lourdes Regala as Dornbush
Brandon Smith as Toyoshima
Blue Deckert as Lt. Mike Spalding
James Black as the Chaplain
References
External links
1994 drama films
1994 films
1994 television films
American drama television films
1990s English-language films
Films about capital punishment
Films about television
Films directed by Tommy Lee Wallace
Films scored by Mark Snow
Films set in 1999
Films set in the future
NBC network original films
1990s American films
|
https://en.wikipedia.org/wiki/Municipal%20wireless%20network
|
A municipal wireless network is a citywide wireless network. This usually works by providing municipal broadband via Wi-Fi to large parts or all of a municipal area by deploying a wireless mesh network. The typical deployment design uses hundreds of wireless access points deployed outdoors, often on poles. The operator of the network acts as a wireless internet service provider.
Overview
Municipal wireless networks go far beyond the existing piggybacking opportunities available near public libraries and some coffee shops. The basic premise of carpeting an area with wireless service in urban centers is that it is more economical to the community to provide the service as a utility rather than to have individual households and businesses pay private firms for such a service. Such networks are capable of enhancing city management and public safety, especially when used directly by city employees in the field. They can also be a social service to those who cannot afford private high-speed services. When the network service is free and a small number of clients consume a majority of the available capacity, operating and regulating the network might prove difficult.
In 2003, Verge Wireless formed an agreement with Tropos Networks to build a municipal wireless networks in the downtown area of Baton Rouge, Louisiana. Carlo MacDonald, the founder of Verge Wireless, suggested that it could provide cities a way to improve economic development and developers to build mobile applications that can make use of faster bandwidth. Verge Wireless built networks for Baton Rouge, New Orleans, and other areas. Some applications include wireless security cameras, police mug shot software, and location-based advertising.
In 2007, some companies with existing cell sites offered high-speed wireless services where the laptop owner purchased a PC card or adapter based on EV-DO cellular data receivers or WiMAX rather than 802.11b/g. A few high-end laptops at that time featured built-in support for these newer protocols. WiMAX is designed to implement a metropolitan area network (MAN) while 802.11 is designed to implement a wireless local area network (LAN). However, the use of cellular networks is expensive for the consumers, as they are often on limited data plans.
In the 2010s larger cities embraced the smart city concept to tackle problems such as traffic congestion, crime, encouraging economic growth, responding to the effects of climate change and improving the delivery of city services. However, by 2018 it has become clear that the private sector could not be relied upon to build up city-wide wireless networks to meet the smart city objectives of municipal governments and public utility providers.
Finance
The construction of municipal wireless networks is a significant part of their lifetime costs. Usually, a private firm works with local government to construct a network and operate it. Financing is usually shared by both the private firm and the municipal gov
|
https://en.wikipedia.org/wiki/SAFARI
|
SAFARI was an attempt by the French government, under the presidency of Georges Pompidou, to create a centralized database of personal data. SAFARI stands for Système Automatisé pour les Fichiers Administratifs et le Répertoire des Individus, "Automated System for Administrative Files and the Repertory of Individuals".
History
The first mention of the project was made in a three-page article in the INSEE central review in March 1970. The French government began secretly working on the SAFARI project in 1973. The project aimed to identify French citizens with a unique number that would connect the information about them from various databases. In particular, it would use the INSEE code (also used as a Social Security number). The system was to be based on the Iris-80 computer.
On March 21, 1974, an article in the newspaper Le Monde by journalist Philippe Boucher revealed the existence of the project. The public outcry was immense, some critics comparing it to the national identity database created by the Vichy regime during Nazi occupation. The massive popular rejection of SAFARI prompted the minister of justice to create the Commission on Data Processing and Freedom, also known as the Tricot Commission after its leader Bernard Tricot. This led to the creation of the CNIL to ensure data privacy, as well as an accompanying 1978 law, the Data Protection and Liberties Act, restricting the storage and processing of personal data.
References
See also
Government databases
French political scandals
Law enforcement in France
Information privacy
Government databases in France
Privacy in France
|
https://en.wikipedia.org/wiki/St-connectivity
|
In computer science, st-connectivity or STCON is a decision problem asking, for vertices s and t in a directed graph, if t is reachable from s.
Formally, the decision problem is given by
.
Complexity
On a sequential computer, st-connectivity can easily be solved in linear time by either depth-first search or breadth-first search. The interest in this problem in computational complexity concerns its complexity with respect to more limited forms of computation. For instance, the complexity class of problems that can be solved by a non-deterministic Turing machine using only a logarithmic amount of memory is called NL. The st-connectivity problem can be shown to be in NL, as a non-deterministic Turing machine can guess the next node of the path, while the only information which has to be stored is the total length of the path and which node is currently under consideration. The algorithm terminates if either the target node t is reached, or the length of the path so far exceeds n, the number of nodes in the graph.
The complement of st-connectivity, known as st-non-connectivity, is also in the class NL, since NL = coNL by the Immerman–Szelepcsényi theorem.
In particular, the problem of st-connectivity is actually NL-complete, that is, every problem in the class NL is reducible to connectivity under a log-space reduction. This remains true for the stronger case of first-order reductions . The log-space reduction from any language in NL to STCON proceeds as follows: Consider the non-deterministic log-space Turing machine M that accepts a language in NL. Since there is only logarithmic space on the work tape, all possible states of the Turing machine (where a state is the state of the internal finite state machine, the position of the head and the contents of the work tape) are polynomially many. Map all possible states of the deterministic log-space machine to vertices of a graph, and put an edge between u and v if the state v can be reached from u within one step of the non-deterministic machine. Now the problem of whether the machine accepts is the same as the problem of whether there exists a path from the start state to the accepting state.
Savitch's theorem guarantees that the algorithm can be simulated in O(log2 n) deterministic space.
The same problem for undirected graphs is called undirected s-t connectivity and was shown to be L-complete by Omer Reingold. This research won him the 2005 Grace Murray Hopper Award. Undirected st-connectivity was previously known to be complete for the class SL, so Reingold's work showed that SL is the same class as L. On alternating graphs, the problem is P-complete .
References
Graph connectivity
Directed graphs
NL-complete problems
|
https://en.wikipedia.org/wiki/Nata%C5%A1a%20Kandi%C4%87
|
Nataša Kandić (; born 16 December 1946) is a Serbian human rights activist and coordinator of the RECOM Reconciliation Network, founder and ex-executive director of the Humanitarian Law Center (HLC), an organization campaigning for human rights and reconciliation in the former Yugoslavia, focusing on the Serbian role in the conflict. It was formed in 1992. The HLC's research was integral to the war crimes prosecutions of the International Criminal Tribunal for the Former Yugoslavia (ICTY), particularly the "smoking gun" video linking Serbian military forces to the Srebrenica massacres. She has won numerous international awards for her human rights work (Amnesty International's Objective Observer Award, among others). She is a figure of controversy in Serbia where she was the subject of a defamation lawsuit by former President of Serbia Tomislav Nikolić.
Career
Humanitarian Law Center
Kandić is a sociologist by training. In 1992, she founded and became executive director of the Humanitarian Law Center in Belgrade, a human rights organization which has been praised for its systematic and impartial investigations of human rights abuses. Since the start of the Yugoslav wars in the early 1990s, she has documented and protested against war crimes committed between 1991 and 1999, including torture, rape, and murder. According to Businessweek, her work drew "the hatred of fellow Serbs and military leaders throughout the region -- and won the admiration of human-rights defenders worldwide".
Throughout the war in Kosovo, she travelled back and forth across Serbia, providing information to the outside world about human rights violations being committed by police and paramilitary groups. She was one of the few Serbian rights activists to continue investigating the Kosovo crisis after the murder of Slavko Ćuruvija and to collaborate with ethnic Albanian activists. She and her staff were anonymously threatened for their work, and their office was spray-painted with a swastika and the message "NATO's spies". In December 1999, HLC lawyer Teki Bokshi was arrested in Kosovo by Serbian police, drawing protest from the HLC and a United Nations envoy.
The evidence she gathered was later used in the preparation of indictments by the International Criminal Court for the Former Yugoslavia in The Hague. She provided a video of Bosnian Serb paramilitaries executing six Bosniak prisoners near Trnovo, used as proof of Serbia's role in the Srebrenica massacre, in which 7,500 Bosniak men and boys were killed. Kandić had located a copy of the tape, originally made by the paramilitaries themselves, from a man in Šid, who provided it only on the condition that she not air it until he had safely left the country. Excerpts from the tape were later shown on Serbian and Bosnian television. The Guardian described the tape as the "smoking gun"—"the final, incontrovertible proof of Serbia's part in the Srebrenica massacres"—while The New York Times called the airing of the tape on
|
https://en.wikipedia.org/wiki/DHL%20de%20Guatemala
|
DHL de Guatemala S.A. is a cargo airline based in Guatemala City, Guatemala. It is wholly owned by Deutsche Post and provides services for the group's DHL-branded logistics network in Guatemala.
Its main base is La Aurora International Airport.
Destinations
DHL de Guatemala operates freight services to the following international scheduled destinations (at January 2005):
Fleet
Current fleet
The DHL De Guatemala fleet consists of the following aircraft (as of October 2022):
Additionally, DHL de Guatemala operates a few Boeing 757-200PCFs to Central America on behalf from DHL Aero Expreso.
Former fleet
1 Boeing 727-100F
2 Dassault Falcon 20
1 Fairchild Swearingen Metroliner
Accidents and incidents
On April 7, 2022, DHL de Guatemala Flight 7216, a Boeing 757-200PCF (registered HP-2010DAE) operated by DHL Aero Expreso, made an emergency landing after taking off from Juan Santamaría International Airport due to hydraulic issues. After the aircraft landed back, it veered off the runway and broke up into two parts after falling into a ditch. The accident caused No casualties nor injuries. The airport was shut down for several hours after the crash and the aircraft was written off.
See also
List of airlines of Guatemala
References
External links
Airlines of Guatemala
Cargo airlines
Airlines established in 1989
DHL
Companies of Guatemala
|
https://en.wikipedia.org/wiki/XET-TDT
|
XET-TDT is a television station in Monterrey, Nuevo Leon, owned and operated by Televisa. The station carries the Canal 5 network.
History
XET-TV analog channel 6 began broadcasting in 1960, as the first station of Televisión Independiente de México, founded by Bernardo Garza Sada. TIM, backed by Monterrey-area business interests, grew rapidly in the ensuing years, expanding to Mexico City in 1968 and merging with Telesistema Mexicano in 1972 to form Televisa. It remained with the Galavisión/XEQ network, formed from TIM's Mexico City station until the 2000s, when it switched to Canal 5.
Digital television
On September 24, 2015, XET shut off its analog signal; its digital signal on UHF channel 31 remained.
References
External links
Televisa Monterrey
Canal 5 (Mexico) transmitters
Spanish-language television stations in Mexico
Television stations in Monterrey
|
https://en.wikipedia.org/wiki/Visioo-Writer
|
Visioo-writer - The OpenDocument file viewer is a computer program designed to run on multiple operating systems with the explicit ability to view OpenDocument and OpenOffice.org/StarOffice documents. It is currently in a stable state (version 0.6) but updates continue. The goal is to create a small application to open popular and free document formats (e.g., AbiWord, KWord). The software is open-source, and written in Python. Downloads are available for Microsoft Windows and Linux.
External links
Website
OpenDocument
Python (programming language) software
|
https://en.wikipedia.org/wiki/The%20Pig%20and%20Whistle
|
The Pig and Whistle was a Canadian musical television series aired on the CTV television network from 1967 to 1977. Filmed in Toronto, Ontario but set in a fictional English pub, the show featured an assortment of Canadian, British and Irish performers.
One of CTV's most popular programs of its day, The Pig and Whistle drew ratings of over a million viewers in the early 1970s. The programme was hosted by John Hewer and featured the music of the Carlton Showband, a Canadian-Irish musical group. Scottish singer and entertainer Stan Kane was often featured.
The programme's title is derived from one of the names of a traditional English public house, whose meaning in turn remains somewhat speculative.
References
External links
Jam!: Carlton Showband (the programme's regular music group)
TVArchive.ca: The Pig and Whistle
Canadian Communications Foundation: Pig and Whistle
CTV Toronto: CFTO historical reference
Museum of Broadcast Communications: Canadian Television Programming in English
1960s Canadian variety television series
CTV Television Network original programming
1967 Canadian television series debuts
1977 Canadian television series endings
1970s Canadian variety television series
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.