source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/Probability%20integral%20transform | In probability theory, the probability integral transform (also known as universality of the uniform) relates to the result that data values that are modeled as being random variables from any given continuous distribution can be converted to random variables having a standard uniform distribution. This holds exactly provided that the distribution being used is the true distribution of the random variables; if the distribution is one fitted to the data, the result will hold approximately in large samples.
The result is sometimes modified or extended so that the result of the transformation is a standard distribution other than the uniform distribution, such as the exponential distribution.
The transform was introduced by Ronald Fisher in his 1932 edition of the book Statistical Methods for Research Workers.
Applications
One use for the probability integral transform in statistical data analysis is to provide the basis for testing whether a set of observations can reasonably be modelled as arising from a specified distribution. Specifically, the probability integral transform is applied to construct an equivalent set of values, and a test is then made of whether a uniform distribution is appropriate for the constructed dataset. Examples of this are P–P plots and Kolmogorov–Smirnov tests.
A second use for the transformation is in the theory related to copulas which are a means of both defining and working with distributions for statistically dependent multivariate data. Here the problem of defining or manipulating a joint probability distribution for a set of random variables is simplified or reduced in apparent complexity by applying the probability integral transform to each of the components and then working with a joint distribution for which the marginal variables have uniform distributions.
A third use is based on applying the inverse of the probability integral transform to convert random variables from a uniform distribution to have a selected distribution: this is known as inverse transform sampling.
Statement
Suppose that a random variable has a continuous distribution for which the cumulative distribution function (CDF) is Then the random variable defined as
has a standard uniform distribution.
Equivalently, if is the uniform measure on , the distribution of on is the pushforward measure .
Proof
Given any random continuous variable , define . Given , if exists (i.e., if there exists a unique such that ), then:
If does not exist, then it can be replaced in this proof by the function , where we define , , and for , with the same result that . Thus, is just the CDF of a random variable, so that has a uniform distribution on the interval .
Examples
For a first, illustrative example, let be a random variable with a standard normal distribution . Then its CDF is
where is the error function. Then the new random variable defined by is uniformly distributed.
As second example, if has an exponential distribution |
https://en.wikipedia.org/wiki/GEO%20Foundation | Founded in 1998 by Kevin Teasley, the Greater Education Opportunities (GEO) Foundation is a small but growing network of seven charter schools in Gary and Indianapolis, Indiana and Baton Rouge, Louisiana, serving 3,500 predominantly African-American and low-income students.
Mission
A sign that hangs above the entrance to all GEO Academies reads, “Through these doors walk college graduates.” GEO Foundation believes that all children should have access to a quality education that includes college and that education can “Beat Poverty.”
To actualize these beliefs, GEO has systematically built a student-centered, content-rich K-12 educational model that provides a personalized and competency-based approach to learning necessary to close achievement gaps beginning in elementary schools, ensuring middle school students are on at least high school grade level by the summer before 9th grade, and ultimately preparing low-income students to begin college coursework on college campuses as early as 9th grade. By providing an accelerated pathway to college, beginning in kindergarten, GEO schools hope to break the cycle of poverty that is prevalent in the families and communities of the students we serve.
History
Founded in 1998 by Kevin Teasley, GEO (Greater Education Opportunities) Foundation has radically altered the trajectory of impoverished students to succeed in college and career while still in high school through its innovative College Immersion Program.
Little more than 10% of the students that GEO serves in Gary through its flagship school 21st Century Charter School come from homes with any college experience. By contrast, 21C graduates earn an average of 19 college credits each, putting them in the top 5% of Indiana for college readiness. Nearly 30% of 21C 2020 graduates earned a full associate degree in high school.
In 2014, GEO’s success in Gary caught the attention of former Louisiana Superintendent of Education John White and an invitation by the Louisiana Department of Education to bring GEO’s college immersion model to Louisiana. Six years, four campuses, and 1,600 students later, GEO has earned the support of New Schools Baton Rouge and consistent “top gains” by the Louisiana Department of Education.
GEO Foundation supports a network of seven GEO Academies in Gary and Indianapolis, Indiana and Baton Rouge, Louisiana that serve 3,500 predominantly African-American and low-income students.
Publicity
GEO Foundation has been nationally recognized for its impact. In May 2017, People magazine featured an article on a student who graduated from college before she received her high school diploma. In the year of 2007, the GEO foundation had a full page in Forbes magazine. News coverage and working with fellow foundations has been a factor for GEO. GEO has been the subject of two front-page stories in the New York Times, and there have been numerous news accounts in the Indianapolis Star, Denver Post, and Colorado Springs Gazette. Stanford Un |
https://en.wikipedia.org/wiki/Mixing%20patterns | Mixing patterns refer to systematic tendencies of one type of nodes in a network to connect to another type. For instance, nodes might tend to link to others that are very similar or very different. This feature is common in many social networks, although it also appears sometimes in non-social networks. Mixing patterns are closely related to assortativity; however, for the purposes of this article, the term is used to refer to assortative or disassortative mixing based on real-world factors, either topological or sociological.
Types of Mixing Patterns
Mixing patterns are a characteristic of an entire network, referring to the extent for nodes to connect to other similar or different nodes. Mixing, therefore, can be classified broadly as assortative or disassortative. Assortative mixing is the tendency for nodes to connect to like nodes, while disassortative mixing captures the opposite case in which very different nodes are connected.
Obviously, the particular node characteristics involved in the process of creating a link between a pair will shape a network's mixing patterns. For instance, in a sexual relationship network, one is likely to find a preponderance of male-female links, while in a friendship network male-male and female-female networks might prevail. Examining different sets of node characteristics thus may reveal interesting communities or other structural properties of the network. In principle there are two kinds of methods used to exploit these properties. One is based on analytical calculations by using generating function techniques. The other is numerical, and is based on Monte Carlo simulations for the graph generation.
In a study on mixing patterns in networks, M.E.J. Newman starts by classifying the node characteristics into two categories. While the number of real-world node characteristics is virtually unlimited, they tend to fall under two headings: discrete and scalar/topological. The following sections define the differences between the categories and provide examples of each. For each category, the models of assortatively mixed networks introduced by Newman are discussed in brief.
Mixing Based on Discrete Characteristics
Discrete characteristics of a node are categorical, nominal, or enumerative, and often qualitative. For instance, race, gender, and sexual orientation are commonly examined discrete characteristics.
To measure the mixing of a network on discrete characteristics, Newman defines a quantity to be the fraction of edges in a network that connect nodes of type i to type j (see Fig. 1). On an undirected network this quantity is symmetric in its indices , while on directed ones it may be asymmetric. It satisfies the sum rules
,
where and are the fractions of each type of an edge's end that is attached to nodes of type . On undirected graphs, where there is no physical distinction between the ends of a link, i.e. the ends of edges are all of the same type, .
Then, an assortativity coefficient, a |
https://en.wikipedia.org/wiki/Jeremy%20Hammond | Jeremy Hammond (born January 8, 1985) is an American activist and former computer hacker from Chicago. He founded the computer security training website HackThisSite in 2003. He was first imprisoned over the Protest Warrior hack in 2005 and was later convicted of computer fraud in 2013 for hacking the private intelligence firm Stratfor and releasing data to WikiLeaks, and sentenced to 10 years in prison.
In 2019, he was summoned before a Virginia federal grand jury which was investigating WikiLeaks and its founder Julian Assange. He was held in civil contempt of court after refusing to testify on the principle of grand jury resistance.
He was released from prison in November 2020.
Early life
Hammond was raised in the Chicago suburb of Glendale Heights, Illinois, with his twin brother Jason. Hammond became interested in computers at an early age, programming video games in QBasic by age eight, and building databases by age thirteen. As a student at Glenbard East High School in the nearby suburb of Lombard, Hammond won first place in a district-wide science competition for a computer program he designed. While in high school, he became a peace activist, organizing a student walkout on the day of the Iraq invasion and starting a student newspaper to oppose the Iraq War. His high school principal described Hammond as "old beyond his years".
Hammond attended the University of Illinois at Chicago. In the spring of 2004, during his freshman year, he exploited a security flaw on the computer science department's website and went to department administrators, offering to help fix the security flaws on the site and looking to get a job. For inserting the backdoor, Hammond was called before the department chair and ultimately banned from returning for his sophomore year.
Jeremy, along with his brother Jason, has had a lifelong interest in music, performing in numerous bands through the years. Before Jeremy's arrests, they were both actively performing in the Chicago ska band Dirty Surgeon Insurgency.
Hammond worked as a Mac technician in Villa Park, Illinois. He also worked as a web developer for Chicago-based Rome & Company. His boss at Rome & Company wrote in 2010 that Hammond is "friendly, courteous and polite and while we suspect he has a low tolerance for corporate posturing, he has never demonstrated any contempt for business in the workplace".
Computer hacking and activism
Hammond founded the computer security training website HackThisSite at age 18, during the summer after his high school graduation. The website describes itself as "a non-profit organization that strives to protect a good security culture and learning atmosphere". In its first two years the site received 2.5 million hits and acquired 110,000 members and a volunteer staff of 34.
During the 2004 DEF CON event in Las Vegas, Hammond delivered a talk that encouraged "electronic civil disobedience" as a means of protest against the 2004 Republican National Convention and its sup |
https://en.wikipedia.org/wiki/Benjamin%20Cohen%20%28journalist%29 | Benjamin Cohen (born 14 August 1982) is a British web developer, entrepreneur and online publisher. He became known for his dot.com enterprises as a teenager and his dispute with Apple Computer over the domain "itunes.co.uk", and as the founder of LGBT news site PinkNews. From 2006 until 2012 he was technology correspondent for Channel 4 News in the UK. Cohen has a diagnosis of MS. He campaigns on LGBT and disabled rights. He is the chief executive of PinkNews, and regularly writes for the London Evening Standard.
Early life
In 1998, at the age of 16, Cohen founded the website JewishNet.co.uk, an early social networking community which later became SoJewish.com, with £150 and floated it on the Alternative Investment Market (AIM) ten months later. The company controlling the website, which Cohen had a 10–15% stake in, along with investors, was valued at £5 million in September 1998. The Daily Telegraph reported that he exchanged his stake in this company to AIM-quoted Totally plc for £310,000 in an all-share deal; yet when Cohen later sold half of his stake, these shares were worth just £40,000.
Business life
Cohen received media attention because of a legal dispute with Apple over the domain name iTunes.co.uk. In November 2000, two weeks after Apple lodged its UK trademark application for the term 'iTunes', Cohen's company CyberBritain Group registered the iTunes.co.uk domain name and redirected it to a music search engine. Cohen's company's actions were considered to be "abusive" by the independent expert appointed by the arbiter Nominet and his company was required to transfer the domain name to Apple. In 2001, Cohen was involved with a search engine for internet pornography (hunt4porn.com) which formed part of his CyberBritain.com internet portal. Cohen was reported as stating that CyberBritain company revenue was £12,000 per month at this time. The company filed a Companies House return showing a total yearly profit of £165 up to 31 March 2001.
In his 2001 book Dot.Bomb, Rory Cellan-Jones wrote: "Whatever you may think of Benjamin Cohen, you have to admire his ability to manipulate the media. The increasingly outlandish values put on his flimsy company merely reflected the mood of the time. But then some of the bigger dot.coms, which managed to sell shares based on even more outlandish valuations, were to prove equally flimsy".
His Channel 4 News profile describes him as having been the youngest-ever director of a public company. In 2006 he joined Channel 4 News as a technology correspondent at the age of 23, the youngest correspondent to have been appointed in the programme's history. He produced investigations during his time at Channel 4 News, including an award-winning exposé of security flaws in contactless credit card use.
Cohen writes for PinkNews regularly, which he created in 2005. Between 2004 and 2006, Cohen wrote a column on e-business for The Times under the heading "dot.com millionaire".
Charitable work
Cohen was diagnos |
https://en.wikipedia.org/wiki/Nules | Nules is a town in eastern Spain, in the province of Castellón (Valencian Community). Located 18 km to the south of the province's capital, at 13 m over sea level, it has 13,750 inhabitants (2010 data), living in Nules Town, Nules Beach and Mascarell.
Nules gives its name to the Nules variety of Clementine, which was first bred here in 1953. It is the most popular variety of Clementine grown in Spain.
The municipality includes Mascarell, a historical village.
Notable people
Sergi Canós, footballer
Rosita Amores
Asensio Nebot, guerilla leader
Imran Khan,A Pakistani politician
References
Municipalities in the Province of Castellón |
https://en.wikipedia.org/wiki/OmniPeek | Omnipeek is a packet analyzer software tool from Savvius, a LiveAction company, for network troubleshooting and protocol analysis. It supports an application programming interface (API) for plugins.
History
Savvius (formerly WildPackets) was founded in 1990 as The AG Group by Mahboud Zabetian and Tim McCreery. In 2000 the company changed its name to WildPackets to address the popular market it had developed for its products. The first product by the company was written for the Macintosh and was called EtherPeek. It was the first affordable software-only protocol analyzer for Ethernet networks. It was later ported to Microsoft Windows, which was released in 1997. Earlier, LocalPeek and TokenPeek were developed for LocalTalk and Token Ring networks respectively. In 2001, AiroPeek was released, which added support for wireless IEEE 802.11 (marketed with the Wi-Fi brand) networks. In 2003, the OmniEngine Distributed Capture Engine was released as software, and as a hardware network recorder appliance.
In the early morning of July 15, 2002, WildPackets' building in Walnut Creek, California burnt to the ground including everything in it. However, no one was hurt and the employees regrouped at a new location and the company survived the fire.
Mid-April 2015, the company changed its name from WildPackets to Savvius and broadened its focus to include network security.
In June 2018, Savvius was acquired by LiveAction, a company that provides network performance management, visualization and analytics software.
Acquisitions
Savvius acquired Net3 Group in November 2000. Their product, NetSense, an expert system for network troubleshooting, was converted initially converted into a plug-in and then later fully integrated into a new version of the product called EtherPeekNX.
Savvius acquired Optimized Engineering Corporation in 2001. Optimized network analysis instructors, training courses and certifications were added to Savvius' services.
Extensibility
Omnipeek has APIs on the front-end for automation, on the back-end for analysis, as well as other mechanisms to extend and enhance the program. BODY.SAYED
There are 40 plug-ins available for the Omnipeek Platform. These plug-ins range from logging extensions to full-blown applications that are hosted by OmniPeek.
Remote Adapters: provide a means to capture packets and stats. There are remote adapters to capture from RMON, NetFlow, SFlow, Cisco AP's, Aruba AP's, and Linux boxes. Adapters are available to aggregate packets from multiple network segments and wireless channels at the same time.
The most notable decoders are the protospecs and decoder files, which are interpreted text files that can be extended by the user to enhance the display and analysis of existing protocols, and add knowledge of completely new protocols, without releasing new versions of the application.
The plugin Wizards for the Omnipeek Console and the OmniEngine are Microsoft Visual Studio Project Templates that generate w |
https://en.wikipedia.org/wiki/Quantum%20dot%20cellular%20automaton | Quantum dot cellular automata (QDCA, sometimes referred to simply as quantum cellular automata, or QCA) are a proposed improvement on conventional computer design (CMOS), which have been devised in analogy to conventional models of cellular automata introduced by John von Neumann.
Background
Any device designed to represent data and perform computation, regardless of the physics principles it exploits and materials used to build it, must have two fundamental properties: distinguishability and conditional change of state, the latter implying the former. This means that such a device must have barriers that make it possible to distinguish between states, and that it must have the ability to control these barriers to perform conditional change of state. For example, in a digital electronic system, transistors play the role of such controllable energy barriers, making it extremely practical to perform computing with them.
Cellular automata
A cellular automaton (CA) is a discrete dynamical system consisting of a uniform (finite or infinite) grid of cells. Each cell can be in only one of a finite number of states at a discrete time. As time moves forward, the state of each cell in the grid is determined by a transformation rule that factors in its previous state and the states of the immediately adjacent cells (the cell's "neighborhood"). The most well-known example of a cellular automaton is John Horton Conway's "Game of Life", which he described in 1970.
Quantum-dot cells
Origin
Cellular automata are commonly implemented as software programs. However, in 1993, Lent et al. proposed a physical implementation of an automaton using quantum-dot cells. The automaton quickly gained popularity and it was first fabricated in 1997. Lent combined the discrete nature of both cellular automata and quantum mechanics, to create nano-scale devices capable of performing computation at very high switching speeds (order of Terahertz) and consuming extremely small amounts of electrical power.
Modern cells
Today, standard solid state QCA cell design considers the distance between quantum dots to be about 20 nm, and a distance between cells of about 60 nm. Just like any CA, Quantum (-dot) Cellular Automata are based on the simple interaction rules between cells placed on a grid. A QCA cell is constructed from four quantum dots arranged in a square pattern. These quantum dots are sites electrons can occupy by tunneling to them.
Cell design
Figure 2 shows a simplified diagram of a quantum-dot cell. If the cell is charged with two electrons, each free to tunnel to any site in the cell, these electrons will try to occupy the furthest possible site with respect to each other due to mutual electrostatic repulsion. Therefore, two distinguishable cell states exist. Figure 3 shows the two possible minimum energy states of a quantum-dot cell. The state of a cell is called its polarization, denoted as P. Although arbitrarily chosen, using cell polarization P = -1 to represent |
https://en.wikipedia.org/wiki/Connect%20Tasmania%20Core | The Connect Tasmania Core is the name used by the Government of Tasmania to refer to a fibre optic communications network linking all major cities of Tasmania to Victoria (and hence the rest of Australia). The government intends to offer access to the network in order to facilitate a more competitive telecommunications industry.
Components
TasGovNet
TasGovNet is the name of the on-island backbone. It is 420 km long and links the major cities of Burnie, Devonport, Launceston, and Hobart. It also links George Town, where it is intended to connect to the fibre optic cables that were laid with the Basslink submarine electricity cable.
The fibre was built by private company Tas21 before being purchased by the state government in 2003 for A$ 23 million.
Basslink fibre connector
The trans-Bass Strait segment of the network is the submarine fibre optic cable which was laid alongside the Basslink HVDC electrical cable. It will connect to the TasGovNet cable at George Town.
Partners
The Tasmanian Research and Education Network (TREN) intends to use the TasGovNet and Basslink fibre as part of a network to link major educational and research organisations in Tasmania, including the University of Tasmania, TAFE Tasmania, Australian Maritime College and Australian Antarctic Division.
On 21 December 2007, the Tasmanian Government announced Aurora Energy as being the preferred Strategic Alliance Partner to commercialise the government's on-island fibre network.
References
Communications in Australia
Buildings and structures in Tasmania
Bass Strait |
https://en.wikipedia.org/wiki/Miss%20Teenage%20America | The Miss Teenage America Pageant was a United States beauty pageant started in 1961 as a pageant for high school girls. In the 1960s and 1970s, it was usually broadcast on the CBS network around November each year. The pageant was sponsored by Dr. Pepper. The original pageant ended after 1979, and the name rights were sold to Teen Magazine, which transformed the event into a mail-in contest which evaluated grades and volunteer work. The event ended after the 1998 Miss Teenage America was crowned, and Teen Magazine itself ceased operations in 2009.
History
From 1961–1967 Dallas, Texas hosted the national pageant, and it moved to Fort Worth, Texas from 1968–1973. Afterwards, different cities throughout the United States hosted the national pageant.
Unlike today's Miss Teen USA and Miss America's Outstanding Teen, the pageant featured girls representing cities and not states. The contestants aged between 13 and 17. There was also a talent segment. The organizers experimented with the finalist formats until 1967, when it was fixed at eight finalists and then the top four. Finalists were always announced the night before the finals. Winners received a four-year college scholarship, a car from Chrysler or Dodge, cash, a personal appearance contract, as well as Dr. Pepper and American Airline stock.
A 1976 book attributed to Bob Hope, Erma Bombeck and Judith Houghton was titled "Miss Teenage America Tells How to Make Good Things Happen." The proceeds went into a scholarship fund for contestants. The organization also printed and sold punch out paper doll sets featuring the reigning queen.
Hosts over the years included Sally Field, Johnny Carson, Betty White, Allen Ludden, Bob Barker, and Dick Clark. In 1975, NBC broadcast it. Bob Hope hosted in 1976. Other notable hosts include Bud Collyer and John Davidson, and Richard Thomas. On February 15, 1979 the event was held at the Grand Ole Opry House in Nashville, Tennessee with Anson Williams hosting.
The pageant organization began to disintegrate in 1979. Instead of being televised nationally on a single network, the 1979 show was sold through syndication, playing on 64 different stations on 13 different nights, leaving little suspense as to who was going to win. Dr. Pepper suspended local contests in the hopes of getting a new national network deal, which did not occur.
Dr. Pepper sold the pageant rights to Teen Magazine in 1981, who completely transformed the event into a mail-in contest which evaluated grades and volunteer work. The event ended after the 1998 Miss Teenage America was crowned, and Teen Magazine itself ceased operations in 2009.
The unassociated Miss Teen USA pageant was essentially a TV replacement for Miss Teenage America, and first held in 1983.
Original pageant
Miss Teenage America 1962 - Diane Lynne Cox (Richmond, VA)
Miss Teenage America 1963 - Darla Banks (Fresno, CA)
Miss Teenage America 1964 - Judy Doll (Akron, OH)*
Miss Teenage America 1965 - Carolyn M |
https://en.wikipedia.org/wiki/Client%20Puzzle%20Protocol | Client Puzzle Protocol (CPP) is a computer algorithm for use in Internet communication, whose goal is to make abuse of server resources infeasible. It is an implementation of a proof-of-work system (PoW).
The idea of the CPP is to require all clients connecting to a server to correctly solve a mathematical puzzle before establishing a connection, if the server is under attack. After solving the puzzle, the client would return the solution to the server, which the server would quickly verify, or reject and drop the connection. The puzzle is made simple and easily solvable but requires at least a minimal amount of computation on the client side. Legitimate users would experience just a negligible computational cost, but abuse would be deterred: those clients that try to simultaneously establish a large number of connections would be unable to do so because of the computational cost (time delay). This method holds promise in fighting some types of spam as well as other attacks like denial-of-service.
See also
Computer security
Intrusion-prevention system
Proof-of-work system
Guided tour puzzle protocol
References
External links
RSA press release about client puzzles
Client Puzzles: A Cryptographic Countermeasure Against Connection Depletion Attacks
New Client Puzzle Outsourcing Techniques for DoS Resistance
Computer network security |
https://en.wikipedia.org/wiki/Black%20Radical%20Congress | The Black Radical Congress (BRC) is an organization founded in 1998 in Chicago. It is a grassroots network of individuals and organizations of African descent focused on advocating for broad progressive social justice, racial equality and economic justice goals within the United States.
History
At the organizing congress in Chicago in June 1998, 2,000 people participated in creating the organization. However, their first mission predates the organizing congress, having been publicly endorsed and published by a number of high-profile black scholars and activists on 16 March 1998.
On 17 April 1999, the BRC ratified a "freedom agenda" listing 15 objectives dealing with racial and economic justice in the United States. The National Council of the BRC adopted a mission statement on 26 September 1999 in East St. Louis, Illinois. The opening paragraph states:
The purpose of the Black Radical Congress (BRC) is to promote dialogue among African American activists and scholars on the left; to discuss critical issues on the national and international scene that pertain to the Black community; to explore new strategies and directions for progressive political, social and cultural movements; and to renew the Black radical movement through increased unified action.
The complete mission statement discusses approaches to radical democratic methods involving conferences, forums and publications. "Principles of unity" were also adopted, stating that the BRC was established as a "center without walls" focusing on "transformative politics that focuses on the conditions of Black working and poor people."
A national organizing conference was convened in Detroit in 2000, and other conferences have taken place in subsequent years.
Organization
The BRC has both individual and organizational memberships. It is headed by a National Congress.
Each year, the BRC chooses a different "theme" to focus its work on; past themes have included anti-militarism and the prison-industrial complex.
The BRC has at least two caucuses, subgroups within the organization, the labor and working-class caucus and the Pat Parker Queer Caucus.
The BRC has local chapters in Washington, D.C.; the San Francisco Bay Area; Sacramento, California; Minneapolis; St. Louis; New York City; Raleigh, North Carolina; Philadelphia and Pittsburgh.
Principles
Race and racial justice
The BRC states: "Black is not necessarily a color or hue, but encompasses all peoples of African descent." Their work is focused on racial justice as well as broader social and economic justice as it intersects with the politics of race and racial oppression.
Radical politics
"Radical means getting to the root causes of society's injustices and working for root-level, fundamental change. Radicalism is an honored tradition in Black political history."
The BRC has many ties to the Communist Party, USA, although the Congress does not explicitly identify itself as communist, socialist or Marxist.
Endorsers
A number of |
https://en.wikipedia.org/wiki/List%20of%20The%20Dead%20Zone%20episodes | The following is a list of episodes from the USA Network original series The Dead Zone. The series premiered on June 16, 2002, and ended on September 16, 2007, with a total of 80 episodes over the course of 6 seasons.
Series overview
Episodes
Season 1 (2002)
Season 2 (2003)
Season 3 (2004)
Season 4 (2005)
Season 5 (2006)
Season 6 (2007)
References
Episodes
Lists of American science fiction television series episodes |
https://en.wikipedia.org/wiki/Night%20Slashers | is a 1993 beat'em up arcade game developed and published by Data East. A remake is planned for major platforms licensed to Forever Entertainment.
Gameplay
Night Slashers is similar to Capcom's Final Fight and Sega's Streets of Rage series, which is an archetypal side scrolling beat 'em up game. One, two or three players/characters move from left to right through each level (most of which are split into three or more scenes), fighting with the enemy characters who appear, until they reach a confrontation with a stronger boss character at the end of the level. Once that boss is beaten, the players automatically move on to the next stage. Enemies appear from both sides of the screen and from out of doorways or entrances set into the background, and the player(s) must defeat all of them to progress. If the players try to simply travel through the levels without fighting, the screen will stop scrolling until all current enemies have been defeated, before allowing the players to continue progress. Enemies may move outside the confines of the screen, but players may not. There is a time limit to each stage.
Unlike Final Fight, Night Slashers features three characters with larger move sets (including "smart bomb" or "screen zapper" type moves) and a horror theme. During the course of the game, players fight through hordes of attacking zombies and mutants, as well as other monsters such as vampires, werewolves and elementals. Bosses also include monsters such as a mummy, a golem, a mad scientist, and lookalikes of Count Dracula, Death the Grim Reaper and Frankenstein's monster. Players fight these enemies and bosses to stop the evil plans of King Zarutz from turning our planet into a worldwide kingdom for the dead. What separates this game from other beat'em ups is that the enemies' names are never listed on their health bars when fighting them.
In the Japanese version, the blood and gore is uncensored (red blood instead of green, but in the overseas version, there is an option to adjust the blood color and the violence level). At the end of a melee attack, Christopher holds out a cross instead of a blue crystal ball. The "Go" arrow flips over to read "To Hell!" in blood. There are extra pictures and dialogue in the cutscenes.
Characters
The player(s) play the role of one of three heroes. Each have different strengths and weaknesses, as well as different elemental powers. The game also has three different endings, one for each character.
- an American monster hunter with cybernetic arms. Nicknamed the "Psychic Cyborg", he is the most powerful character. His element is lightning. Jake sometimes dons a red jacket when traveling. He appears in two of the game's endings.
- an English vampire hunter and martial artist. He is the most balanced character with an average in speed and power. His elements are water and ice. Christopher sometimes dons a brown coat and hat when traveling. Like Jake, he appears in two endings in the game.
- a Chinese martial a |
https://en.wikipedia.org/wiki/Evolvability%20%28computer%20science%29 | The term evolvability is used for a recent framework of computational learning introduced by Leslie Valiant in his paper of the same name and described below. The aim of this theory is to model biological evolution and categorize which types of mechanisms are evolvable. Evolution is an extension of PAC learning and learning from statistical queries.
General framework
Let and be collections of functions on variables. Given an ideal function , the goal is to find by local search a representation that closely approximates . This closeness is measured by the performance of with respect to .
As is the case in the biological world, there is a difference between genotype and phenotype. In general, there can be multiple representations (genotypes) that correspond to the same function (phenotype). That is, for some , with , still for all . However, this need not be the case. The goal then, is to find a representation that closely matches the phenotype of the ideal function, and the spirit of the local search is to allow only small changes in the genotype. Let the neighborhood of a representation be the set of possible mutations of .
For simplicity, consider Boolean functions on , and let be a probability distribution on . Define the performance in terms of this. Specifically,
Note that In general, for non-Boolean functions, the performance will not correspond directly to the probability that the functions agree, although it will have some relationship.
Throughout an organism's life, it will only experience a limited number of environments, so its performance cannot be determined exactly. The empirical performance is defined by
where is a multiset of independent selections from according to . If is large enough, evidently will be close to the actual performance .
Given an ideal function , initial representation , sample size , and tolerance , the mutator is a random variable defined as follows. Each is classified as beneficial, neutral, or deleterious, depending on its empirical performance. Specifically,
is a beneficial mutation if ;
is a neutral mutation if ;
is a deleterious mutation if .
If there are any beneficial mutations, then is equal to one of these at random. If there are no beneficial mutations, then is equal to a random neutral mutation. In light of the similarity to biology, itself is required to be available as a mutation, so there will always be at least one neutral mutation.
The intention of this definition is that at each stage of evolution, all possible mutations of the current genome are tested in the environment. Out of the ones who thrive, or at least survive, one is chosen to be the candidate for the next stage. Given , we define the sequence by . Thus is a random variable representing what has evolved to after generations.
Let be a class of functions, be a class of representations, and a class of distributions on . We say that is evolvable by over if there exists polynomials , , , and |
https://en.wikipedia.org/wiki/ClearSpeed | ClearSpeed Technology Ltd was a semiconductor company, formed in 2002 to develop enhanced SIMD processors for use in high-performance computing and embedded systems. Based in Bristol, UK, the company has been selling its processors since 2005. Its current 192-core CSX700 processor was released in 2008, but a lack of sales has forced the company to downsize and it has since delisted from the London stock exchange.
Products
The CSX700 processor consists of two processing arrays, each with 96 processing elements. The processing elements each contain a 32/64-bit floating point multiplier, a 32/64-bit floating point adder, 6 KB of SRAM, an integer arithmetic logic unit, and a 16-bit integer multiply–accumulate unit. It currently sells its CSX700 processor on a PCI Express expansion card with 2 GB of memory, called the Advance e710. The card is supplied with the ClearSpeed Software Development Kit and application libraries.
Related multi-core architectures include Ambric, PicoChip, Cell BE, Texas Memory Systems, and GPGPU stream processors such as AMD FireStream and Nvidia Tesla. ClearSpeed competes with AMD and Nvidia in the hardware acceleration market, where computationally intensive applications offload tasks to the accelerator. As of 2009, only the ClearSpeed e710 performs 64-bit arithmetic at its peak computational rate.
History
In November 2003 ClearSpeed demonstrated the CS301, with 64 processing elements running at 200 MHz, and peak 25.6 FP32 GFLOPS.
In June 2005 ClearSpeed demonstrated the CSX600, with 96 processing elements running at 210 MHz, capable of 40 GFLOPS.
In September 2005 John Gustafson joined ClearSpeed as CTO of high performance computing.
In November 2005 ClearSpeed made its first significant sale of CSX600 processors to the Tokyo Institute of Technology using X620 Advance cards.
In November 2006 ClearSpeed X620 Advance cards helped place the Tsubame cluster 7th in the TOP500 list of supercomputers. The cards continue to be used in 2009.
In September 2007 ClearSpeed licensed its next generation processor to BAE Systems for inclusion in satellite systems.
In February 2007 ClearSpeed raised £20 million in share placing on the AIM market.
In June 2008 ClearSpeed released the CSX700, combining two CSX600 devices with a PCI Express x16 interface and ECC on all memories, using a lower power 90 nm process. The device delivers 96 GFLOPS for 9 watts with 192 processing elements running at 250 MHz. The device was also released on the Advance e710 card at the same time.
In February 2009 ClearSpeed announced a cost-cutting programme following poor financial results for 2008.
In July 2009 ClearSpeed delisted from the London Stock Exchange and returned £6.9 million to its shareholders.
In August 2009 ClearSpeed made its most significant sale through high performance and heterogeneous compute specialists PetaPath.
References
External links
ClearSpeed Official site (seem defunct / not working URL.)
https://books.google.com/book |
https://en.wikipedia.org/wiki/Ulmus%20americana%20%27Pyramidata%27 | The supposed American Elm cultivar Ulmus americana 'Pyramidata' was a Belgian clone listed by Wesmael in Bulletin de la Fédération des sociétés d'horticulture de Belgique, 1862, as Ulmus Americana pyramidalis Hort. (with a capital "A"). It was marketed by the Baudriller nursery, Angers, France, and appeared in their catalogue of 1880 as U. Americana pyramidata. Wesmael's Ulmus americana and Ulmus americana var. variegata, however, do not appear from herbarium specimens to have been American white elm (see Ulmus americana 'Variegata'). It is known that nurseries in Europe and America marketed the golden wych elm Ulmus glabra 'Lutescens' as Ulmus americana aurea, so it is possible that Wesmael's Ulmus americana pyramidalis was similarly misnamed.
Description
The clone was pyramid-shaped.
Cultivation
No specimens are known to survive.
Synonymy
Ulmus americana var. pyramidalis: Wesmael, Bulletin de la Fédération des sociétés d'horticulture de Belgique 1862: 387, 1863.
References
External links
"Muséum national d'histoire naturelle, spécimen P06883092" Two clones, labelled (left) U. exoniensis (misnamed "U. oxoniensis" in France in 19th C), (right) U. pyramidata (1863)
American elm cultivar
Ulmus articles missing images
Ulmus
Missing elm cultivars |
https://en.wikipedia.org/wiki/ABC%20Audio | ABC Audio is a radio syndicator, radio network and digital audio network in the United States. It is under the ownership of The Walt Disney Company, parent company of American Broadcasting Company (ABC), with satellite distribution being handled by Linkup Communications. It launched on January 1, 2015, as ABC Radio; it was renamed ABC Audio in 2019.
Background
ABC Radio originally began after the split of NBC Red and NBC Blue (later Blue Network) networks with ABC taking over operations of the latter from RCA in 1943 before adopting its name 2 years later. ABC Radio was known to broadcast the first nationwide report of the assassination of President John F. Kennedy. Kennedy was shot in a motorcade in Dallas, Texas, at 18:30 UTC on November 22, 1963, and ABC Radio's Don Gardiner anchored the network's initial bulletin at 18:36:50 UTC, minutes before any other radio or television network followed suit.
The networks associated with ABC included Watermark Inc. (which ABC bought in 1982), Satellite Music Network (a 1989 purchase), ESPN Radio (launched in 1992) and Radio Disney (debuted in 1996).
Despite a number of different owners (Capital Cities Communications and later Disney), the radio division remained under ABC's wing until June 12, 2007, when it was sold to Citadel Broadcasting as well as most of its O&O stations in a restructuring effort. Under the terms of the reverse Morris trust, ABC shareholders held a controlling stake in Citadel, who licensed the ABC name for two more years until it rebranded as Citadel Media Networks in 2009.
On September 16, 2011, Cumulus Media purchased Citadel Broadcasting and rebranded the network division as Cumulus Media Networks. In 2013, Cumulus Media Networks merged with Dial Global Radio Networks to form the current Westwood One.
ABC maintained ownership of its Radio Disney network and its ESPN Radio owned-and-operated stations. In 2015, it announced plans to sell off all but one of its Radio Disney station licenses and stop distributing that network through terrestrial radio. The network succeeded in selling off most of its stations, leaving only KRDC; KRDC flipped to a country music format separate from the Radio Disney network but still carrying the Radio Disney brand. Its license, along with ESPN Radio's KSPN, have remained held by "ABC Radio Los Angeles Assets."
History
ABC Radio
On August 7, 2014, ABC announced that it would relaunch its radio network division on January 1, 2015. The change occurred following the announcement that Cumulus would replace its ABC News radio service with Westwood One News (via CNN). ABC will continue to make its radio news programming (via ABC News Radio and its FM counterpart ABC News Now) available through the network, and will also expand to create new radio programming based on other ABC owned properties such as Good Morning America, Dancing With The Stars and Jimmy Kimmel Live. Skyview Networks would handle advertising sales and satellite distribution.
By Dec |
https://en.wikipedia.org/wiki/Sodium/phosphate%20cotransporter | The sodium/phosphate cotransporter is a member of the phosphate:Na+ symporter (PNaS) family within the TOG Superfamily of transport proteins as specified in the Transporter Classification Database (TCDB).
Nomenclature
Sodium/phosphate cotransporters are also known as:
Na+-Pi cotransport proteins (NaPi-2a)
Sodium-dependent phosphate transporters
Sodium-dependent phosphate symporters
Phosphate:Na+ symporters
PNaS family
The Phosphate:Na+ Symporter (PNaS) family (TC# ) includes several closely related, functionally characterized, sodium-dependent, inorganic phosphate (Pi) transporter (NPT) proteins from mammals. Other organisms that possess PNaS family members include many in eukaryotic, bacterial and archaeal phyla. Bacterial sodium:phosphate symporters, NptA of Vibrio cholerae (TC#2.A.58.1.2) and YjbB of E. coli (TC# 2.A.58.2.1) have been functionally characterized.
The well-characterized mammalian proteins are found in renal (IIa isoform) and intestinal (IIb isoform) brush border membranes and are about 640 amino acyl residues long with 8-12 putative TMSs. The N- and C-termini both reside in the cytoplasm, and a large hydrophilic loop is localized between trans-membrane segments (TMSs) 3 and 4. While IIa isoforms are pH-dependent, IIb isoforms are pH-independent. The IIa sodium phosphate symporter isoform is a functional monomer, but it interacts with PDZ proteins which probably mediate apical sorting, parathyroid hormone-controlled endocytosis and/or lysosomal sorting of internalized transporters.
Transport reaction
The transport reaction catalyzed by the mammalian proteins is:
Pi (out) + 3 Na+ (out) ⇌ Pi (in) + 3 Na+ (in).
Human PNaS proteins
There are several known sodium-dependent phosphate transporters found in humans. For example, the protein 2A is encoded by the solute carrier family 34, member 1 (SLC34A1) gene and facilitates uptake of phosphate for normal cellular functions including cellular metabolism, signal transduction, and nucleic acid and lipid synthesis. The PNaS family is also called the SLC34 family.
Other known sodium-dependent phosphate transporters found in humans include (but are not limited to):
Sodium-Phosphate Cotransporter Proteins, Type I (TC# 2.A.1.14):
SLC17A1 (NPT1)
SLC17A2 (NPT3)
SLC17A3 (NPT4)
SLC17A4
Sodium-Phosphate Cotransporter Proteins, Type II (TC# 2.A.58):
SLC34A1 (NPTIIa)
SLC34A2 (NPTIIb), codes for sodium-dependent phosphate transport protein 2b (NaPi2b), a tumor-associated antigen.
SLC34A3 (NPTIIc)
Sodium-Phosphate Cotransporter Proteins, Type III (TC# 2.A.20):
SLC20A1 (PIT1)
SLC20A2 (PIT2)
Antibody
Lifastuzumab vedotin is a monoclonal antibody for the sodium/phosphate cotransporter that is under development for the treatment of cancer.
See also
Cotransporter
Co-transport
P-loop
Renal physiology
Symport
Symporter
Solute carrier family
Transporter Classification Database
References
Further reading
External links
Transporter Classification Database
Solute |
https://en.wikipedia.org/wiki/KFAR | KFAR (660 AM) is a commercial radio station programming news/talk in Fairbanks, Alaska, United States, broadcasting on 660 AM. Founded in 1939 by industrialist Austin E. Lathrop, KFAR is the oldest radio station in Fairbanks and one of the oldest in Alaska. KFAR airs Fox News Radio throughout the day and carries national radio programs through Compass Media Networks, Genesis Communications Network, Premiere Networks, and Westwood One, among others. The station previously held longtime affiliations with the ABC Radio Network, Mutual Broadcasting System and the previous incarnation of Westwood One.
Since adopting the news/talk format during the 1980s, KFAR has had a long-standing commitment to airing locally produced talk radio programming; the station turned down The Rush Limbaugh Show when it was originally offered in favor of local programming. KFAR is currently the only news/talk station in Fairbanks to produce local call-in talk shows. Their primary competitor, KFBX, airs locally produced news and public affairs programming (on weekday morning drive and midday, and on Sunday morning, respectively), but no local talk shows. To drive home this distinction, KFAR makes heavy use of the slogan Local Talk Radio. Problem Corner (which has aired on the station since 1961), patriots lament show and The Michael Dukes Show comprise a total of 4 hours of airtime each weekday. KFAR has also aired a succession of local talk shows on Saturday mornings.
History
KFAR was founded in 1939 by Austin E. Lathrop. The station marked his entry into broadcasting, as Lathrop continued to diversify and expand his business empire throughout the Alaska Territory. Lathrop hired engineer Stanton Bennett to build the station. Bennett, in turn, recommended that Lathrop hire a young engineer he worked with in Oregon named Augie Hiebert, who would later become influential in starting Lathrop's second radio station, KENI.
For most of the station's early existence, its studio was in the Lathrop Building in downtown Fairbanks. The station shared space in the building with other Lathrop enterprises, such as the Fairbanks Daily News-Miner. Its transmitter was on Farmers Loop Road, northeast of the University of Alaska, on a tract of land owned by Lathrop (around which the Fairbanks Golf and Country Club was later built). On the radio dial, it was originally on 610 kHz and moved to 660 kHz in 1956.
Following Lathrop's death in 1950, his numerous businesses continued to be run by his business associates under the corporate umbrella of The Lathrop Company, with the radio stations under subsidiary Midnight Sun Broadcasting Company. One of those associates, Alvin O. "Al" Bramstedt, purchased the Lathrop broadcasting holdings in 1960. Changing the name slightly to Midnight Sun Broadcasters, Bramstedt and his company operated the station throughout the 1960s and 1970s. Midnight Sun also operated sister station KFAR television on channel 2, with much cooperation and intermingling of |
https://en.wikipedia.org/wiki/Confirm%20Project | CONFIRM was an ambitious IT project supposed to create a single computer reservations system/global distribution system used by airline, rental car, and hotel companies. It is often used as a case study as an example of a major failure in project management.
History
The system was pursued to develop in order to create synergies between AMR, Marriott, Hilton Hotels Corporation and Budget Rent-A-Car and fully integrate and unify the reservation systems of the companies involved.
In 1988 the four large corporations made contracts to complete the system by June 1992 project at a cost of $55 million. Unfortunately, the project turned out to be much more complex to finish than the partners had anticipated. They all had high hopes based that AMR would expand on the extremely successful SABRE computer reservation system that had helped American Airlines create a sustainable competitive advantage after the deregulation of the airline industry. In April 1992, just three months before the system was intended to go live, Confirm failed tests at Los Angeles-based Hilton. AMR also told its partners that it needed another 15 to 18 months to complete the system. The project was never completed. In the process more than 500 technical personnel worked on the project; when the partners disbanded the project in July 1992 they had spent three and a half years and $125 million on the project.
The technical complexity of this project was extreme. CONFIRM runs on two IBM 3090 mainframes. One houses the central reservations system, which runs under Transaction Processing Facility. The other mainframe houses a DB2 relational database in an MVS (an IBM mainframe operating system) environment. The database contains decision-support information such as customer histories and pricing data. The system required application-to-application bridging between the two mainframes (CPUs/IBM 3090) for some 60 applications. The main problem was to tie CONFIRM's transaction-processing facility-based central reservation system with its decision support system. Hilton users found that the system's user interface, mainframe transaction processing and mainframe database did not adequately communicate with one another. Other problems included different programming languages and difficulties with recovering databases in event of crashes. These problems were not insurmountable, but they would delay the project for about two extra years.
In September 1992 AMR (American Airlines) sued Marriott, Hilton and Budget, alleging they caused CONFIRM's failure by withholding funds, making poor staffing assignment and withdrawing prematurely. The three partners countersued.
In January 1994 American Airlines reached out-of court settlements with all of its partners for undisclosed amounts.
See also
Real-time operating system - SABRE was one of the first such systems
Further reading
References
Travel technology
Computer reservation systems |
https://en.wikipedia.org/wiki/PC%20Power%20and%20Cooling | PC Power and Cooling (stylized as PC Power & Cooling), a subsidiary of FirePower Technology, is an American manufacturer of computer power supplies based in Carlsbad, California. The company was established by Doug Dodson in 1985. In 2007, the company was acquired by OCZ Technology. In 2014, FirePower Technology acquired OCZ Technology Group's power supply division, which included PC Power and Cooling.
The company was involved in many technologies related to computer temperature management. It sells products to both consumer and enterprise channels. The company can customize power supplies for American OEM customers in their Carlsbad facility.
History
PC Power and Cooling, Inc., was founded by Doug Dodson in April 1985. An electronic hobbyist since childhood, Dodson worked in the business of futures as an adult in the late 1970s and early 1980s. In 1983, his workplace issued him a IBM PC XT—the power supply of which he deemed intolerably noisy due to its small cooling fan. He outfitted the power supply with a special large-diameter fan to quell the noise. This attracted the attention of his coworkers, who asked him to perform the same modification to their PCs. In 1985, Dodson set up shop in his garage to perform the modification to interested customers as a side business. Shortly into this venture, Dodson saw the need to reinvent the PC's power supply from scratch, as he deemed it "poorly designed by IBM in the early days. The fan would cavitate. There was no real airflow coming out, so you had a ton of noise and no cooling." Dodson then incorporated PC Power and Cooling in Bonsall, California, within San Diego County, where hired a team of engineers to develop supplies running at a lower temperature than IBM's stock supply for the XT while generating less noise.
In 1986, the company launched their Silencer line of power supplies, featuring a 120-mm-diameter fan. Shortly after, they developed the Turbo-Cool line of supplies, the first XT-compatible power supply with multiple fans. Between 1986 and 1987, the company sold 1,000 Silencers and 5,000 Turbo-Cools. The lowest-end entries in the line then were rated for between 150 and 200 watts. In September 2005, the company introduced the first PC power supply rated for 1000 watts.
In around 1992, PC Power and Cooling relocated to Carlsbad, California, occupying a 13,000-square-foot facility. By 2005, they employed 40 workers. In May 2007, OCZ Technology of San Jose, California, announced their pending acquisition of PC Power and Cooling. The acquisition was completed by September 2007, with OCZ paying PC Power and Cooling an estimated $13 million for the deal. During their tenure under OCZ, PC Power and Cooling's branded products shifted more towards the enthusiast and businesses, while OCZ Technology branded power supplies cater more towards the gaming and entry level enthusiast segments. The company as a subsidiary of OCZ had a mutual relationship with OCZ's power supply group, with the latter |
https://en.wikipedia.org/wiki/Tomato%20%28firmware%29 | Tomato is a family of community-developed, custom firmware for consumer-grade computer networking routers and gateways powered by Broadcom chipsets. The firmware has been continually forked and modded by multiple individuals and organizations, with the most up-to-date fork provided by the FreshTomato project.
History
Tomato was originally released by Jonathan Zarate in 2006, using the Linux kernel and drawing extensively on the code of HyperWRT. It was targeted at many popular routers of the time, most notably the older Linksys WRT54G series, Buffalo AirStation, Asus routers and Netgear WNR3500L. His final release of the original Tomato firmware came in June 2010, by which point its popularity had grown large enough that development and support continued through the user community, resulting in a series of releases (dubbed "mods") by individual users or teams of them that continues to the present day.
Fedor Kozhevnikov created a notable early mod he called TomatoUSB, which ceased development in November 2010. It was then forked by other developers and remains the nearest common ancestor to all of the forks with any recent activity. The project saw a boost in recognition when Tomato was chosen by Asus as the base used to build the firmware currently preinstalled on their entire line of home routers, ASUSWRT.
Currently, FreshTomato appears to be the only project that has seen active development and new releases.
Features
Several notable features have been part of Tomato long enough to be common to all forks, among them are:
The graphical user interface (accessed via web browser), including:
Access to almost the entirety of the features provided by the hardware (manufacturers typically omit many of these from their firmware to prevent misuse and reduce support costs)
Extensive use of Ajax to display only the settings that are germane to the device's current setup, reducing confusion and keeping related options near each other using fewer pages/tabs
A CSS-based custom interface theming
SVG-based graphical bandwidth monitoring, showing total network inbound/outbound activity and that of each connected device through pie charts and line graphs that update in real-time
A personal web server (Nginx) that uses the device's "always on, always connected" design to allow users to host their own websites from home for free
Access and bandwidth restriction configurable for each device or the network as a whole, providing control over the speed and amount of traffic available at any time to any device
Unrestricted access to the internal system logs and the ability to store them for easier troubleshooting and security audits
CLI access (BusyBox) via the web-based interface, as well as via Telnet or SSH (using Dropbear)
Wake-on-LAN
Advanced QoS: 10 unique QoS classes defined, real-time graphs display prioritized traffic with traffic class details
Client bandwidth control via QoS classes
The Dnsmasq software built-in, which provides:
DHCP server |
https://en.wikipedia.org/wiki/UML-based%20web%20engineering | UWE (UML-based Web Engineering) is a software engineering approach for the development of Web applications. UWE provides a UML profile (UML extension), a metamodel, model-driven development process and tool support (ArgoUWE) for the systematic design of Web applications. UWE follows the separation of concerns building separate models for requirements, content, hypertext, presentation, process, adaptivity and architecture.
The key aspects that distinguish UWE are reliance on OMG standards and an open source environment.
See also
Web engineering
Web modeling
References
External links
UWE site
Unified Modeling Language |
https://en.wikipedia.org/wiki/FXall | FXall (FX Alliance Inc) is a foreign exchange aggregator providing electronic trading to banks and brokers using an electronic communication network with headquarters in New York. The company provides electronic trading in the foreign exchange market to institutional clients using straight through processing. Clients include active traders, asset managers, corporate treasurers, market makers, broker-dealers and prime brokers. The company has been a subsidiary of Refinitiv since 2018.
History
FXall began operations in 2000 as a dealing platform for a consortium of 16 banking institutions, each owning between three and five percent of the company. By 2003 it had grown to having trading volume of $9bn overtaking its main rivals.
In 2012 the company was acquired by Thomson Reuters for $625 million.
After Thomson Reuters sold a majority stake in its Financial & Risk (F&R) unit to private equity firm Blackstone Group LP in 2018, the new business, now called Refinitiv, became the owner of FXall.
References
Foreign exchange companies
Thomson Reuters |
https://en.wikipedia.org/wiki/UML-based%20Web%20Engineering | UWE (UML-based Web Engineering) is a software engineering approach for the development of Web applications. UWE provides a UML profile (UML extension), a metamodel, model-driven development process and tool support for the systematic design of Web applications (MagicUWE). UWE follows the separation of concerns building separate models for requirements, content, navigation, presentation, process, adaptation and architecture.
The key aspects that distinguish UWE are reliance on OMG standards.
Other possibilities
WebML (Web Modeling Language)
HDM
RMM
EORM
OOHDM
WSDM
Araneus
OO-H
UML WAE
Hera
See also
Web engineering
Web modeling
External links
UWE site
Web development software |
https://en.wikipedia.org/wiki/Permanand%20Mohan | Permanand Mohan is a senior Computer Science lecturer at the University of the West Indies, St. Augustine Campus, Trinidad and Tobago. He holds a Ph.D. in computer science from the University of the West Indies, an M.Sc. in Computer Science from the University of Saskatchewan and a B.Sc. in Computer Science from the University of the West Indies. He is the Chief Examiner for the Caribbean Examinations Council’s CAPE Examinations in Computer Science.
Biography
Permanand Mohan was born on March 20, 1965, in Gran Couva, Trinidad and Tobago. In 1989 he received a Commonwealth Scholarship to study at the University of Saskatchewan. In 2003 he was a Fulbright Visiting Scholar to the School of Information Sciences at the University of Pittsburgh as well as Visiting Professor at the Laboratory for Advanced Research in Intelligent Educational Systems (ARIES) at the University of Saskatchewan in Canada.
Research
His research interests lie in the field of artificial intelligence and education, and the use of learning objects in e-learning. 2006 marked his entry into the field of m-learning with a publication at The Fourth Pan-Commonwealth Forum
References
Academic staff of the University of the West Indies
University of the West Indies alumni
Living people
University of Saskatchewan alumni
Trinidad and Tobago academics
Year of birth missing (living people) |
https://en.wikipedia.org/wiki/Camillo%20Olivetti | Samuel David Camillo Olivetti (August 13, 1868 – December 1943) was an Italian electrical engineer and founder of Olivetti & Co., SpA., the Italian manufacturer of computers, printers and other business machines. The company was later run by his son Adriano.
Biography
Samuel David Camillo Olivetti was born in 1868 in a bourgeois Jewish family in Ivrea, Piedmont. His father, Salvador Benedetto, was a textile trader and his mother, Elvira Sacerdoti, that was from Modena, was bankers' daughter. From his father, Camillo Olivetti received the entrepreneurial style and the love for the progress, while from his mother the love for languages (Elvira spoke four languages). His cousin was the painter Raffaele Pontremoli. when Camillo was one years old, his father died. His mother looked after him, who was sent to the boarding school of «Calchi Taeggi» in Milan.
At the end of high school, he enrolled at the Royal Italian Industrial Museum (later Politecnico di Torino from 1906) and at the Technical Application School, where he attended electrotechnics courses held by Galileo Ferraris. He graduated on the 31st December 1891 in industrial engineering, Camillo needed to improve his English and, on the other, to gain useful work experience. He stayed over a year in London where he worked in an industry that produced measuring instruments for electrical quantities, also doing the mechanic.
Upon his return to Turin, he became Ferraris's assistant. In 1893 he accompanied his teacher to United States of America, who had been invited to lecture at the International Congress of Electrotechnics in Chicago. Olivetti acted as his interpreter. Together they visited the Thomas A. Edison laboratories at Llewellyn Park, New Jersey, where they met the brilliant American inventor in person. After this meeting, in 1893, Camillo wrote to his brother-in-law Carlo from Chicago:
Camillo continued the journey from Chicago to San Francisco alone, carefully writing down the things he was discovering about the United States of America. His correspondence from the United States was published in 1968 with the title of American Letters : if the English industrial situation had already struck him, he found the American reality far superior, not only from an industrial point of view but also from a social point of view. A few months in Palo Alto began to know better US universities. As assistant electrotechnical at Stanford University (November 1893 - April 1894), Olivetti was able to experiment in the laboratory the potential and the different applications of the use of electricity. The United States will always represent for Olivetti the frontier of economic modernity, the model to refer to in the path of affirmation of its industrial project in Italy: the vivid memory of the collection of American letters, published after his death in Biella in December 1943.
See also
Adriano Olivetti
References and notes
External links
1868 births
1943 deaths
People from Ivrea
20th-century It |
https://en.wikipedia.org/wiki/The%20Oddball%20Couple | The Oddball Couple is an animated half-hour Saturday morning show that ran on the ABC TV network from September 6 to December 20, 1975. The show was a production of DePatie-Freleng Enterprises in association with Paramount Television, and was distributed by CBS Television Distribution. It is an adaptation of the TV series The Odd Couple, which had ended its run that year, after five seasons on ABC.
Overview of series
The Oddball Couple features the misadventures of a dog named Fleabag and cat named Spiffy, who live together under the same roof. Spiffy is an orderly and polite cat who is a stickler for cleanliness and organization, and Fleabag is rude, obnoxious, lazy, untidy and very disorganized. Their disparate personalities are reflected in their housewhich is one-half mansion and one-half dilapidated shackand even in their car, which is half-pristine and half-junker. They have a secretary named Goldie Hound (a play on the name Goldie Hawn) who works in the office they share. The show consists of two segments lasting 10 minutes each.
In the original Odd Couple series, Felix the neat freak was a photographer and slovenly Oscar was a sportswriter. In this series, Spiffy the neatnik is a writer and Fleabag the slob is a photographer.
Cast
Joe Besser
Joan Gerber as Goldie
Bob Holt
Sarah Kennedy
Don Messick
Frank Nelson as Spiffy
Ginny Tyler
Frank Welker
Paul Winchell as Fleabag
Episodes
Production credits
Story Editor: Bob Ogle
Writers: Bob Ogle, Joel Kane, David Detiege, Earl Kress, John W. Dunn
Supervising Director: Lew Marshall
Animation Directors: Gerry Chiniquy, Robert McKimson
Storyboard Directors: Bill Perez, Art Leonardi, Jan Green, Gary Hoffman
Graphic Design: Ric Gonzales, Gary Hoffman, Dick Ung, Al Wilson, Ken Landau, Coral Kerr, Adam Szwejkowski, Susan Scholefield
Animation: Norm McCabe, Bob Matz, Virgil Ross, Bob Bemiller, Bob Richardson, Jim Davis, Nelson Shin, Bill Numes, Don Williams, Joel Seibel, Bob Bransford, John Freeman, Bill Carney, Warren Batchelder, George Jorgensen, John Gibbs, Bob Goe
Background Supervised by: Richard H. Thomas
Backgrounds: Mary O'Loughlin, Don Watson
Ink and Paint Supervisor: Gertrude Timmins
Xerography: Greg Marshall
Film Editors Supervised by: Bob Gillis
Film Editors: Joe Siracusa, Rick Steward, Allan Potter
Voices: Paul Winchell, Frank Nelson, Joan Gerber, Frank Welker, Sarah Kennedy, Don Messick, Joe Besser, Ginny Tyler, Bob Holt
Music by: Doug Goodwin
Main Title Music Arranged by: Joe Siracusa
Conducted by: Eric Rodgers
In Charge of Production: Lee Gunther
Camera: Ray Lee, Larry Hogan, John Burton Jr.
Production Mixer: Steve Orr
Sound by: Producer's Sound Service, Inc.
This picture has made the jurdisction of I.A.T.S.E., affiliated with A.F.L.-C.L.O.
© MCMLXXV DePatie-Freleng Productions, Inc. All rights reserved.
Based Upon the Play "The Odd Couple" by Neil Simon
Produced by: David H. DePatie & Friz Freleng
DFE Films · A DePatie-Freleng Production
Home medi |
https://en.wikipedia.org/wiki/Robert%20Irvine | Robert Paul Irvine (; born 24 September 1965) is an English celebrity chef and talk show host who has appeared on and hosted a variety of Food Network programs including Dinner: Impossible, Worst Cooks in America, Restaurant: Impossible, A Hero's Welcome, Operation Restaurant, All-Star Academy, Guy's Grocery Games, Chopped: Impossible, and Restaurant Express. Irvine currently operates two restaurants, Robert Irvine's Public House at the Tropicana resort in Las Vegas, Nevada, and a Fresh Kitchen by Robert Irvine located within The Pentagon. Irvine launched The Robert Irvine Show, a daytime talk show which aired weekdays on The CW between 12 September 2016 and 25 May 2018.
Early life and education
Irvine was born in England and raised in Wiltshire, United Kingdom. He began his cooking career upon enlisting in the UK's Royal Navy at the age of fifteen. Having completed culinary training, Irvine served aboard Her Majesty's Royal Yacht Britannia. Upon completion of his 10-year tour of duty, Irvine performed consultant work in Bali, Jakarta and Ho Chi Minh City before becoming Executive Chef aboard numerous cruise ships and establishments such as Trump's Taj Mahal, culminating with the five-star MS Crystal Harmony.
Television career
2006–2010, 2021-present; Dinner: Impossible
Irvine started his television career on Food Network on a show called Fit for a King, which was later re-titled before broadcast to Dinner: Impossible, where he would be given countless challenges over the course of the life of the show.
Irvine also appeared in a December 2007 episode of Iron Chef America with Tyler Florence in a dessert battle (theme ingredient: sugar) against Paula Deen and Cat Cora in which the men lost.
In 2006, Irvine had announced his intention to open two restaurants in St. Petersburg, Florida. Irvine had impressed a Florida socialite with the claims he was a Knight Commander of the Royal Victorian Order, had a degree in food and nutrition from the University of Leeds, had worked on the wedding cake for Prince Charles and Princess Diana and had served at the White House as a chef, a claim Irvine also made in the opening segment of his Food Network show, Dinner: Impossible. An article in the 17 February 2008 issue of the St. Petersburg Times quoted sources who disputed some of Irvine's assertions. As a result, Food Network pulled Irvine's biography from its website. Network spokesperson Lisa De Colle said they were "taking the necessary steps to ensure the accuracy of all representations of Robert".
In 2008, Irvine posted to his blog to "set the record straight" regarding his past service and point out erroneous reports made by the St. Petersburg Times. This included letters from those he worked with at the White House, including Rear Admiral Michael H. Miller, Deputy Assistant to the President and Director of the White House Military Office and F.X. Fuller, Director of Presidential Food Service.
On 29 February 2008, Food Network announced it would |
https://en.wikipedia.org/wiki/Database%20connection | A database connection is a facility in computer science that allows client software to talk to database server software, whether on the same machine or not. A connection is required to send commands and receive answers, usually in the form of a result set.
Connections are a key concept in data-centric programming. Since some DBMS engines require considerable time to connect, connection pooling was invented to improve performance. No command can be performed against a database without an "open and available" connection to it.
Connections are built by supplying an underlying driver or provider with a connection string, which is a way of addressing a specific database or server and instance as well as user authentication credentials (for example, Server=sql_box;Database=Common;User ID=uid;Pwd=password;). Once a connection has been built it can be opened and closed at will, and properties (such as the command time-out length, or transaction, if one exists) can be set. The Connection String is composed of a set of key/value pairs as dictated by the data access interface and data provider being used.
Many databases (such as PostgreSQL) only allow one operation to be performed at a time on each connection. If a request for data (a SQL Select statement) is sent to the database and a result set is returned, the connection is open but not available for other operations until the client finishes consuming the result set. Other databases, like SQL Server 2005 (and later), do not impose this limitation. However, databases that provide multiple operations per connection usually incur far more overhead than those that permit only a single operation task at a time.
Pooling
Database connections are finite and expensive and can take a disproportionately long time to create relative to the operations performed on them. It is inefficient for an application to create, use, and close a database connection whenever it needs to update a database.
Connection pooling is a technique designed to alleviate this problem. A pool of database connections can be created and then shared among the applications that need to access the database.
The connection object obtained from the connection pool is often a wrapper around the actual database connection. The wrapper understands its relationship with the pool, and hides the details of the pool from the application. For example, the wrapper object can implement a "close" method that can be called just like the "close" method on the database connection. Unlike the method on the database connection, the method on the wrapper may not actually close the database connection, but instead return it to the pool. The application need not be aware of the connection pooling when it calls the methods on the wrapper object.
This approach encourages the practice of opening a connection in an application only when needed, and closing it as soon as the work is done, rather than holding a connection open for the entire life of the ap |
https://en.wikipedia.org/wiki/List%20of%20network%20protocol%20stacks | This is a list of protocol stack architectures. A protocol stack is a suite of complementary communications protocols in a computer network or a computer bus system.
See also
Lists of network protocols
IEEE 802
Network protocols
Communications protocols
Network protocol stacks
stacks |
https://en.wikipedia.org/wiki/NHL%20on%20USA | The NHL on USA was the de facto title of a television show that broadcast National Hockey League games on the USA Network.
History
Before the USA Network came to be (1969-1980)
Manhattan Cable and HBO (1969–1977)
Manhattan Cable (subsequently referred to as the MSG Network) debuted in the spring of 1969 and did all home events from the Madison Square Garden: New York Knicks basketball, New York Rangers hockey, college basketball, horse shows, Golden Gloves boxing, tennis, the Westminster Dog Show, ice capades, professional wrestling, etc. The first reference to the channel as “MSG Network” was sometime around 1971–72, although the name did not become official until 1977.
The first televised events were NHL and NBA playoffs in the spring of 1969; in those playoffs Marty Glickman did play-by-play for the Knicks broadcasts while Win Elliott did play-by-play for the Rangers.
Meanwhile, HBO began simulcasting some MSG games in 1972 beginning with the Rangers/Vancouver Canucks game on November 8, 1972 (the first ever program televised on HBO, to a few subscribers in Wilkes-Barre, PA). 1974–75 marked the only year in which HBO used MSG announcers for their feed. Because HBO is a premium cable service, this created a burden on announcers to fill in dead airtime on HBO while commercials aired on MSG Network. HBO did not broadcast Knicks or Rangers games after the 1976–77 season.
UA-Columbia (1977–1980)
When the MSG/HBO marriage ended in 1977, Madison Square Garden proceeded to seek a new partner to launch a national network to show off its events. So for several years, beginning with the 1977–78 season, all MSG home events (such as those involving the Knicks, Rangers, etc.) were then televised on a fledgling network that would eventually become known as the USA Network. This channel, which debuted on September 22, 1977, was basically a continuation of the existing MSG Network. The key difference however, was that it was now nationally syndicated via satellite rather than terrestrially. It was also the first cable channel to be supported by advertising revenues. By this time (as previously alluded to), the channel was officially called the “Madison Square Garden Network” or MSG Network.
In , the National Hockey League replaced their syndicated coverage package The NHL Network with a package on USA. At the time, the USA Network was called UA-Columbia. As the immediate forerunner for the USA Network, UA-Columbia, served as the cable syndicated arm of not only MSG Network in New York, but also PRISM channel in Philadelphia, and whatever pay/cable outlets were around in 1979.
The formation of the USA Network
On April 9, 1980, the Madison Square Garden Network changed its name to the USA Network. This occurred when the ownership structure was reorganized under a joint operating agreement by the UA-Columbia Cablevision cable system (now known as Cablevision Systems Corporation) and MCA (then the parent of Universal Studios, now owned by NBC |
https://en.wikipedia.org/wiki/Geographic%20routing | Geographic routing (also called georouting or position-based routing) is a routing principle that relies on geographic position information. It is mainly proposed for wireless networks and based on the idea that the source sends a message to the geographic location of the destination instead of using the network address. In the area of packet radio networks, the idea of using position information for routing was first proposed in the 1980s for interconnection networks. Geographic routing requires that each node can determine its own location and that the source is aware of the location of the destination. With this information, a message can be routed to the destination without knowledge of the network topology or a prior route discovery.
Approaches
There are various approaches, such as single-path, multi-path and flooding-based strategies (see for a survey). Most single-path strategies rely on two techniques: greedy forwarding and face routing. Greedy forwarding tries to bring the message closer to the destination in each step using only local information. Thus, each node forwards the message to the neighbor that is most suitable from a local point of view. The most suitable neighbor can be the one who minimizes the distance to the destination in each step (Greedy). Alternatively, one can consider another notion of progress, namely the projected distance on the source-destination-line (MFR, NFP), or the minimum angle between neighbor and destination (Compass Routing). Not all of these strategies are loop-free, i.e. a message can circulate among nodes in a certain constellation. It is known that the basic greedy strategy and MFR are loop free, while NFP and Compass Routing are not.
Greedy forwarding can lead into a dead end, where there is no neighbor closer to the destination. Then, face routing helps to recover from that situation and find a path to another node, where greedy forwarding can be resumed. A recovery strategy such as face routing is necessary to assure that a message can be delivered to the destination. The combination of greedy forwarding and face routing was first proposed in 1999 under the name GFG (Greedy-Face-Greedy). It guarantees delivery in the so-called unit disk graph network model. Various variants, which were proposed later
, also for non-unit disk graphs, are based on the principles of GFG
.
Face routing depends on a planar subgraph in general; however distributed planarization is difficult for real wireless sensor networks and does not scale well to 3D environments.
Greedy embedding
Although originally developed as a routing scheme that uses the physical positions of each node, geographic routing algorithms have also been applied to networks in which each node is associated with a point in a virtual space, unrelated to its physical position. The process of finding a set of virtual positions for the nodes of a network such that geographic routing using these positions is guaranteed to succeed is called greedy embe |
https://en.wikipedia.org/wiki/Net%20neutrality%20in%20the%20United%20States | In the United States, net neutrality, the principle that Internet service providers (ISPs) treat all data on the Internet the same, and not discriminate, has been an issue of contention between network users and access providers since the 1990s. With net neutrality, ISPs may not intentionally block, slow down, or charge money for specific online content. Without net neutrality, ISPs may prioritize certain types of traffic, meter others, or potentially block traffic from specific services, while charging consumers for various tiers of service.
A core issue to net neutrality is how ISPs should be classified under the Communications Act of 1934 as amended by the Telecommunications Act of 1996, as either Title I "information services" or Title II "common carrier services". The classification affects the Federal Communications Commission's (FCC) authority over ISPs: the FCC would have significant ability to regulate ISPs if classified as Title II common carriers, but would have little control over them if classified as Title I. Because the Communications Act has not been amended by the United States Congress to account for ISPs, the FCC has the authority to designate how ISPs should be classified, affirmed by the Supreme Court in the case National Cable & Telecommunications Ass'n v. Brand X Internet Services (2005), in addition to choosing what regulations to set on common carriers. The makeup of the 5-member FCC changes with each new administration, and thus the FCC's attitude and rules towards net neutrality has also shifted multiple times.
In the early 2000s, the FCC adopted a position that ISPs were Title I information services, and proposed net neutrality principles via the FCC Open Internet Order 2010. Courts ruled in Comcast v. FCC (2010) and Verizon v. FCC (2014) that the FCC did not have authority to enforce these net neutrality principles on Title I information services. Under FCC chair Tom Wheeler, the FCC voted in the 2015 Open Internet Order, categorizing ISPs as Title II common carriers and subject to net neutrality principles, which was upheld after a legal challenge raised by the ISP industry in United States Telecom Ass'n v. FCC in 2016.
With the Trump administration in 2017, the FCC reverted to handling ISPs as Title I information services with some court-mandated leeway being given to state-level legislation. As part of an executive order issued in July 2021, President Joe Biden called for the FCC to undo some of the Trump-era changes.
On October 19, 2023, the FCC voted 3-2 to approve a Notice of Proposed Rulemaking (NPRM) that seeks comments on a plan to restore net neutrality rules and regulation of Internet service providers.
Regulatory history
Early history 1980 – early 2000s
The ideas underlying net neutrality have a long pedigree in telecommunications practice and regulation. Services such as telegrams and the phone network (officially, the public switched telephone network or PSTN) have been considered common carriers |
https://en.wikipedia.org/wiki/List%20of%20software%20for%20the%20TRS-80 | The TRS-80 series of computers were sold via Radio Shack & Tandy dealers in North America and Europe in the early 1980s. Much software was developed for these computers, particularly the relatively successful Color Computer I, II & III models, which were designed for both home office and entertainment (gaming) uses.
A list of software for the TRS-80 computer series appears below. This list includes software that was sold labelled as a Radio Shack or Tandy product.#
Note: This List is by no means complete, especially with regards to the earlier non-color computer models.
Model I
Model II
VideoTex
Color Computer
TRS-80 Color Computer
Color Computer 1 & 2
Color Computer 3
Model III
Many of these titles also ran on the Model I, as the Model III was designed to be backward-compatible with the Model I.
Model 16 & 16B
Model 4, 4D & 4P
Model 12
MC-10
Model 100 & 102
TRS-80 software |
https://en.wikipedia.org/wiki/America%27s%20Next%20Top%20Model%20%28season%208%29 | The eighth cycle of America's Next Top Model aired from February 28, 2007 to May 16, 2007, and was the second season of the series to be aired on The CW network.
The winner, similar to all of the cycles aired on The CW network, received representation by Elite Model Management, a cover & six-page spread within Seventeen magazine, and a US$100,000 contract with CoverGirl cosmetics.
The international destination during this cycle was Sydney, Australia, the show's first visit to Oceania.
The cycle's promotional tagline was "Welcome To The Jungle, Ladies" and the promotional theme songs were both Danity Kane's "One Shot" and Shiny Toy Guns' "Le Disko."
The winner was 20-year-old Jaslene Gonzalez from Chicago, Illinois, who notably had made it to the semi-finals of cycle 7, but was not cast. Gonzalez was the first Hispanic woman to win ANTM. Gonzalez also became the first winner to compete on more than one cycle as well as have no bottom two appearance. Natasha Galkina placed as the runner up this season.
The cycle's finale episode attracted more than 6.6 million viewers, a record for both the franchise and the CW.
Contestants
(Ages stated are at start of contest)
Episodes
Summaries
Call-out order
The contestant was eliminated
The contestant won the competition
Bottom two
The contestant was eliminated after their first time in the bottom two
The contestant was eliminated after their second time in the bottom two
The contestant was eliminated after their third time in the bottom two
The contestant was eliminated in the final judging and placed as the runner-up
Average call-out order
Casting call-out order and final two are not included.
Photo Shoot Guide
Episode 1 photo shoot was split in two halves:
First half: Mark Ecko's Pool Party (casting)
Second half: Political Controversies
Episode 2 photo shoot: Highschool clichés
Episode 3 photo shoot: Nude Candy-coated
Episode 4 photo shoot: Crime Scene Victims
Episode 5 photo shoot: Gender-swap
Episode 6 photo shoot: Four Personalities Beautyshots
Episode 7 photo shoot: Unforgettable ANTM moments with Past Contestants
Episode 8 commercial: CoverGirl Queen Mascara Commercial with Australian Accent
Episode 10 photo shoots: Swimsuits for Women's and Men's Magazines
Episode 11 photo shoot: Aboriginal Dances
Episode 12 photo shoots & Commercial: Covergirl beauty shot; "My Life As A Covergirl" commercial shoot for truShine lip color; Seventeen magazine covers
Other cast members
Jay Manuel – photography
Sutan – make-up
Christian Marc – hair
Anda & Masha – wardrobe
Makeovers
Cassandra - Voluminous afro
Felicia - Long layered curly black weave with bangs
Diana - Long blonde extensions
Sarah - Cut shorter and dyed light brown
Whitney - Long wavy black weave
Jael - Long dark brown weave; later, Mia Farrow inspired pixie cut
Brittany - Long wavy red weave; later, weave removed
Dionne - Kelis inspired cut and dyed black
Renee - Yoanna House inspired cut
Natasha - Vidal Sassoon inspire |
https://en.wikipedia.org/wiki/Stained%20Glass%20Windows%20%28TV%20program%29 | Stained Glass Windows was an early religious television program, broadcast on early Sunday evenings on the ABC Television network. The program was hosted by the Reverend Everett C. Parker.
Broadcast history
The program ran from September 26, 1948 until October 16, 1949, and was a thirty-minute show. The program:
originally ran from 6:30 to 7pm ET (September to December 1948)
then 7:15-7:45 pm ET (January to March 1949)
and, finally, 7:00-7:30pm ET (March to October 1949)
The program contained dramatizations, and discussions, of moral problems, and was the very first religious TV program on ABC.
See also
1948-49 United States network television schedule
1949-50 United States network television schedule
Elder Michaux (DuMont Television Network religious program, 1948)
Lamp Unto My Feet (CBS Television, 1948-1979)
References
Bibliography
Tim Brooks and Earle Marsh, The Complete Directory to Prime Time Network and Cable TV Shows
External links
Fall 1948 schedule showing Stained Glass Windows on Sundays at 5:30pm ET
American Broadcasting Company original programming
1948 American television series debuts
1949 American television series endings
American religious television series |
https://en.wikipedia.org/wiki/Think%20Fast | Think Fast may refer to:
Quiz shows
Think Fast (1949 game show), an early show on the ABC network
Think Fast (1989 game show), a children's quiz show on the Nickelodeon network
Music
"Think Fast", a song by Crazy Town from the album The Gift of Game
"Think Fast", a song by All Too Much from the soundtrack for Clerks II
"Think Fast", a song by Poison Idea from the album Pick Your King, 1983
Think Fast! Records
Books
Think Fast: Mental Toughness Training for Runners, book by Joe Henderson, 1991
Think Fast!, book by Thom Hartmann and Jane Bowman, 1996
Think Fast: An Introduction to Present-Time Composition, in Researching Improvisation, book by Alan Bern, 2016
Others
"Think Fast" (The Flash), an episode of The Flash
Disney Think Fast, a video game
Think Fast!, the billing name for the boxing match Fernando Montiel vs. Nonito Donaire, 2011
See also
Think Fast, Mr. Moto, a 1936 film
"Think Fast, Father Ted," an episode of Father Ted
Thinking, Fast and Slow, book by Daniel Kahneman |
https://en.wikipedia.org/wiki/Railway%20accidents%20in%20Victoria | There have been a number of train accidents on the railway network of Victoria, Australia. Some of these are listed below.
Fatal accidents
North Geelong, 1857
On 25 June 1857, the inaugural train of the Geelong and Melbourne Railway Company left Geelong at 10 a.m., bound for the company's temporary Melbourne terminus at Greenwich (now Newport). When the train passed under the road overpass adjacent to the Ocean Child Hotel in North Geelong, Henry Walter, the locomotive superintendent of the company, was knocked off the locomotive and fatally injured.
Jolimont, 1881
On 30 August 1881, the first accident in Victoria involving passenger deaths and multiple injuries occurred. Four passengers were killed, and 39 were injured, when a tyre broke on one of the wheels of the 8:54am express from Brighton to Flinders Street Station, causing the derailment of five carriages near Jolimont. The first car to leave the rails, the fourth in a train of nine, was dragged along the metals for some distance. When the forward coupling eventually broke, the carriage fell over an embankment about three feet high, into swampy ground. With the rear coupling of the toppled carriage still attached to those behind, the remainder of the train was suddenly checked, and the momentum of the fifth and sixth carriages caused them to shoot upwards, and then fall in the same direction. The carriage that had fallen was completely crushed beneath the one to which it had been coupled. The remainder of the carriages were brought to a standstill, and although the seventh and eighth had left the rails, they did not fall. There were about 120 passengers in the three carriages that toppled over the embankment.
Picnic, 1882
On the evening of 2 December 1882, one passenger was killed and 178 were injured when a collision occurred between a special train, which had been engaged to convey intending purchasers of land from the sale of the Box Hill estate, and the ordinary train from Melbourne to Camberwell. The disaster happened about 100 yards from a small wayside station called Picnic, between East Richmond and Hawthorn. The drivers knew nothing of the impending catastrophe until they got within two or three hundred yards of each other, and, as both trains were travelling at a fair speed, the distance was too short to enable them to avoid a collision. The drivers stuck to their locomotives until they were just within a few feet of each other, when they jumped off. The buffers of the engines snapped, and the front of the engine attached to the train from Melbourne was smashed in right up to the funnel. Two carriages in each train were telescoped.
Little River, 1884
On Wednesday, 2 April 1884, the 8.20 p.m. goods train from Melbourne to Geelong received the staff from the porter at Werribee station and proceeded to Little River, where the train was to cross with the 7.10 p.m. passenger train from Geelong to Melbourne. In the unauthorised absence of the Werribee stationmaster at choir practi |
https://en.wikipedia.org/wiki/File%20system%20fragmentation | In computing, file system fragmentation, sometimes called file system aging, is the tendency of a file system to lay out the contents of files non-continuously to allow in-place modification of their contents. It is a special case of data fragmentation. File system fragmentation negatively impacts seek time in spinning storage media, which is known to hinder throughput. Fragmentation can be remedied by re-organizing files and free space back into contiguous areas, a process called defragmentation.
Solid-state drives do not physically seek, so their non-sequential data access is hundreds of times faster than moving drives, making fragmentation less of an issue. It is recommended to not manually defragment solid-state storage, because this can prematurely wear drives via unnecessary write–erase operations.
Causes
When a file system is first initialized on a partition, it contains only a few small internal structures and is otherwise one contiguous block of empty space. This means that the file system is able to place newly created files anywhere on the partition. For some time after creation, files can be laid out near-optimally. When the operating system and applications are installed or archives are unpacked, separate files end up occurring sequentially so related files are positioned close to each other.
As existing files are deleted or truncated, new regions of free space are created. When existing files are appended to, it is often impossible to resume the write exactly where the file used to end, as another file may already be allocated there; thus, a new fragment has to be allocated. As time goes on, and the same factors are continuously present, free space as well as frequently appended files tend to fragment more. Shorter regions of free space also mean that the file system is no longer able to allocate new files contiguously, and has to break them into fragments. This is especially true when the file system becomes full and large contiguous regions of free space are unavailable.
Example
The following example is a simplification of an otherwise complicated subject. Consider the following scenario: A new disk has had five files, named A, B, C, D and E, saved continuously and sequentially in that order. Each file is using 10 blocks of space. (Here, the block size is unimportant.) The remainder of the disk space is one free block. Thus, additional files can be created and saved after the file E.
If the file B is deleted, a second region of ten blocks of free space is created, and the disk becomes fragmented. The empty space is simply left there, marked as and available for later use, then used again as needed. The file system could defragment the disk immediately after a deletion, but doing so would incur a severe performance penalty at unpredictable times.
Now, a new file called F, which requires seven blocks of space, can be placed into the first seven blocks of the newly freed space formerly holding the file B, and the three blocks |
https://en.wikipedia.org/wiki/Fault%20injection | In computer science, fault injection is a testing technique for understanding how computing systems behave when stressed in unusual ways. This can be achieved using physical- or software-based means, or using a hybrid approach. Widely studied physical fault injections include the application of high voltages, extreme temperatures and electromagnetic pulses on electronic components, such as computer memory and central processing units. By exposing components to conditions beyond their intended operating limits, computing systems can be coerced into mis-executing instructions and corrupting critical data.
In software testing, fault injection is a technique for improving the coverage of a test by introducing faults to test code paths; in particular error handling code paths, that might otherwise rarely be followed. It is often used with stress testing and is widely considered to be an important part of developing robust software. Robustness testing (also known as syntax testing, fuzzing or fuzz testing) is a type of fault injection commonly used to test for vulnerabilities in communication interfaces such as protocols, command line parameters, or APIs.
The propagation of a fault through to an observable failure follows a well-defined cycle. When executed, a fault may cause an error, which is an invalid state within a system boundary. An error may cause further errors within the system boundary, therefore each new error acts as a fault, or it may propagate to the system boundary and be observable. When error states are observed at the system boundary they are termed failures. This mechanism is termed the fault-error-failure cycle and is a key mechanism in dependability.
History
The technique of fault injection dates back to the 1970s when it was first used to induce faults at a hardware level. This type of fault injection is called Hardware Implemented Fault Injection (HWIFI) and attempts to simulate hardware failures within a system. The first experiments in hardware fault involved nothing more than shorting connections on circuit boards and observing the effect on the system (bridging faults). It was used primarily as a test of the dependability of the hardware system. Later specialised hardware was developed to extend this technique, such as devices to bombard specific areas of a circuit board with heavy radiation. It was soon found that faults could be induced by software techniques and that aspects of this technique could be useful for assessing software systems. Collectively these techniques are known as Software Implemented Fault Injection (SWIFI).
Model implemented fault injection
By increasing complexity of Cyber-Physical Systems, applying traditional fault injection methods are not efficient anymore, so tester trying to use fault injection in the model level.
Software implemented fault injection
SWIFI techniques for software fault injection can be categorized into two types: compile-time injection and runtime injection.
Compile-ti |
https://en.wikipedia.org/wiki/WKNI-LP | WKNI-LP is a low power television station in Andalusia, Alabama, broadcasting on channel 25. The station is owned by Phoenix Rising Production, Inc., and is affiliated with Launch TV network.
External links
WKNI Web Site
KNI-LP
Television channels and stations established in 2005
2005 establishments in Alabama
Low-power television stations in Alabama |
https://en.wikipedia.org/wiki/Online%20health%20communities | Online health communities are online social networks related to health. They primarily provide a means for patients and their families to learn about illnesses, to seek and offer social support, and to connect with others in similar circumstances. These online groups can be composed of individuals with illnesses, groups of medical professionals with shared interests, non-professional caregivers and family of patients, or a combination. The term "online health community" is primarily academic jargon.
Changes in the health care system coupled with increased infiltration and use of the Internet have resulted in heavier reliance on the Internet for disease and health education. Eighty percent of American adult Internet users currently go online to find health care information for themselves and their loved ones, with health searches one of the most popular uses of the Internet. Furthermore, 1 in 4 of people with an illness have gone online to find other people who share similar experiences.
Individuals access these communities searching for a variety of resources. Existing medical and health websites, such as WebMD and Health Cloud, have recognized that they will have more visitors if they offer interactive community features such as discussion or Internet forums. Depending on the specific community, patients and medical professionals are able to engage in behaviors such as sharing their illness experiences, exchange knowledge, and increase disease-specific expertise.
Even more, these online communities provide users with a breadth of social resources that may be directly beneficial to their health. These communities have been particularly useful in providing emotional and informational support to those with various illnesses such as cancer, HIV/Aids, infertility, diabetes, and other rare illnesses.
These communities are distinct from general online communities in that they focus exclusively on health-related topics for those currently navigating the world of diseases, illness, and medicine. Furthermore, they also differ from other health-related sites that only allow users to retrieve information. The main hallmark of these communities is that they allow for communication between multiple people. That said, they can take a variety of forms, and vary drastically in their scope.
History
With the invention of email for ARPANET in 1972, communication through a computer to distant geographies became substantially easier. Listservs, which allow a multitude of respondents to interact with an email thread and Bulletin Boards, an online representation of the community bulletin boards commonly found on campuses, were introduced contemporary with one another. These three tools along with USENET provided the tools for rudimentary online communities to begin to coalesce around health related topics.
In 1991 CERN labs introduced the World Wide Web, allowing a more graphical representation of the topic to be discussed. This change lessened barriers to co |
https://en.wikipedia.org/wiki/HandBrake | HandBrake is a free and open-source transcoder for digital video files. It was originally developed in 2003 by Eric Petit to make ripping DVDs to a data storage device easier. HandBrake's backend contains comparatively little original code; the program is an integration of many third-party audio and video libraries, both codecs (such as FFmpeg, x264, and x265) and other components such as video deinterlacers (referred to as "filters"). These are collected in such a manner to make their use more effective and accessible (e.g., so that a user does not have to transcode a video's audio and visual components in separate steps, or with inaccessible command-line utilities).
HandBrake clients are available for Linux, macOS, and Windows.
History
Early versions
HandBrake was originally developed by Eric Petit in 2003 as software for BeOS, before porting it to other systems. He continued to be the primary developer until April 2006, when the last official Subversion revision was committed. Petit continued to be active on the HandBrake forum for a brief period after. From May–June 2006, no one in the HandBrake community was successful in contacting Petit, and no further code changes were officially made.
MediaFork
In September 2006, Rodney Hester and Chris Long had been independently working to extract the H.264 video compression format from Apple's iPod firmware (1.2) through reverse engineering before meeting on the HandBrake forum. Since their work was complementary, they began working together to develop an unstable, but still compileable, release of HandBrake supporting the H.264 format. Hester and Long made progress in terms of stability, functionality, and look and feel, but it was not possible to submit their patch to the HandBrake subversion repository without authorisation from Petit.
Unable to submit their revisions as a successor to HandBrake, Hester created a subversion repository mirroring HandBrake's final subversion (0.7.1) on the HandBrake website and began development on top of that. Hester and Long named the new project MediaFork.
From 2007
On 13 February 2007, Hester and Long were contacted by Petit who informed them of his support and encouraged them to continue development. Plans were then made to reintegrate MediaFork as a direct successor to HandBrake. The MediaFork website and forums were moved to HandBrake's, and the next release was officially named HandBrake. On 24 December 2016 after more than 13 years of development, HandBrake 1.0.0 was released.
There is another transcoder, called VidCoder, that uses HandBrake as its encoding engine.
Features
Hardware acceleration
Some GPUs (including GPUs physically integrated with CPUs, referred to by AMD as APUs) contain dedicated hardware for video encoding and decoding (Intel's Quick Sync Video, Nvidia's NVENC, or AMD's Video Coding Engine / Video Core Next). This hardware is usually provided for scenarios where quick and power-efficient compressed video is desired, such as vid |
https://en.wikipedia.org/wiki/Faves.com | Faves was a social bookmarking and networking software that installs a single browser button for users to "fave" a webpage, making a link to the page part of their Faves profile. Until October 2007, Faves was called Blue Dot. As of January 2012, the service has migrated to fave.net, and later on migrated to MaxiConnect.com and is no longer active on faves.com which says "Faves is evolving to social couponing."
Features
While offering a service similar to the better-known del.icio.us, Faves had a wider range of functionality that encouraged interaction with "friends" in rating the content of linked webpages. When a registered user visited their Faves home page, they saw a summary of the bookmarks, called "Faves" by the company, that had been most recently shared by their friends.
In addition to features shared with other bookmarking and social bookmarking services, Faves provided an in-page dialog for saving a Fave, thumbnails generated from the page, dynamic voting, and topic-based auto-generated favorites pages.
History
Blue Dot Inc. was co-founded in 2004 by Mohit Srivastava and Sumit Sen using $1.5 million from angel investors, and the website bluedot.us was launched in June 2006. Blue Dot hoped to profit on of sales from "dotted" websites from its affiliate marketing program, and was part of the technology resurgence in the Washington Puget Sound area.
Early on, Blue Dot actively sought interaction with early adopters in "pizza and soft drink" focus groups on campus that have been criticized by some academics.
In 2007, the service was renamed Faves. In December 2007, the web site still listed the company name as Blue dot, Inc.
In June 2011, Faves.com, the software, database, and email list was sold to SocialAdr, LLC.
In July 2011, only the domain Faves.com, was sold to Cut Media, LLC.
See also
List of social bookmarking websites
References
American social networking websites
Defunct social networking services
Social bookmarking websites
Companies based in Seattle
Companies established in 2004
Internet properties established in 2004 |
https://en.wikipedia.org/wiki/Information%20and%20computer%20science | Information and computer science (ICS) or computer and information science (CIS) (plural forms, i.e., sciences, may also be used) is a field that emphasizes both computing and informatics, upholding the strong association between the fields of information sciences and computer sciences and treating computers as a tool rather than a field.
Information science is one with a long history, unlike the relatively very young field of computer science, and is primarily concerned with gathering, storing, disseminating, sharing and protecting any and all forms of information. It is a broad field, covering a myriad of different areas but is often referenced alongside computer science because of the incredibly useful nature of computers and computer programs in helping those studying and doing research in the field – particularly in helping to analyse data and in spotting patterns too broad for a human to intuitively perceive. While information science is sometimes confused with information theory, the two have vastly different subject matter. Information theory focuses on one particular mathematical concept of information while information science is focused on all aspects of the processes and techniques of information.
Computer science, in contrast, is less focused on information and its different states, but more, in a very broad sense, on the use of computers – both in theory and practice – to design and implement algorithms in order to aid the processing of information during the different states described above. It has strong foundations in the field of mathematics, as the very first recognised practitioners of the field were renowned mathematicians such as Alan Turing.
Information science and computing began to converge in the 1950s and 1960s, as information scientists started to realize the many ways computers would improve information storage and retrieval.
Terminology
Due to the distinction between computers and computing, some of the research groups refer to computing or datalogy. The French refer to computer science as the term informatique. The term information and communications technology (ICT), refers to how humans communicate with using machines and computers, making a distinction from information and computer science, which is how computers use and gain information.
Informatics is also distinct from computer science, which encompasses the study of logic and low-level computing issues.
Education
Universities may confer degrees of ICS and CIS, not to be confused with a more specific Bachelor of Computer Science or respective graduate computer science degrees.
The QS World University Rankings is one of the most widely recognised and distinguished university comparisons. They ranked the top 10 universities for computer science and information systems in 2015.
They are:
Massachusetts Institute of Technology (MIT)
Stanford University
University of Oxford
Carnegie Mellon University
Harvard University
University of California, Berkel |
https://en.wikipedia.org/wiki/Ethnographic%20realism | Within the field of anthropology and other social sciences, ethnography is a form of research that relies on a range of sources of data, but usually tends to rely mainly on participant observation. However, the term also refers to the product of this type of research, which of course normally takes a textual form. As a result, ethnography is also sometimes seen as a genre of writing, one used to describe patterns of human social interaction in particular contexts.
Within the context of ethnography, the term 'realism' is often used to refer to the assumptions that some kinds of ethnographic work make about the phenomena to be investigated, and how these are to be understood. However, 'ethnographic realism' has also been used to refer to a style of writing that narrates the author's experiences and observations as if the reader were witnessing or experiencing events first hand. A work written using ethnographic realism may be referred to as a realist ethnography, and classified as a subgenre of ethnography.
Styles of ethnographic realism
George Marcus and Dick Cushman described and categorized realist ethnographies under certain characteristics.
Totalizing description
Omniscient narration
Native interpretation
Generalizations
Jargon
References
Anthropology
Ethnography
Realism (art movement) |
https://en.wikipedia.org/wiki/SIGMETRICS | SIGMETRICS is the Association for Computing Machinery's Special Interest Group on Measurement and Evaluation, which specializes in the field of performance analysis, measurement, and modeling of computer systems. It is also the name of an annual 'flagship' conference, organized by SIGMETRICS since 1973, which is considered to be the leading conference in performance analysis and modeling in the world. Known to have an extremely competitive acceptance rate (~15%), many of the landmark works in the area have been published through it.
Beyond the flagship conference, SIGMETRICS also promotes research into performance evaluation through a number of other activities. It co-sponsors other prestigious conferences: the Internet Measurement Conference (IMC), the International Conference on Performance Engineering (ICPE), the IEEE/ACM Symposium on Quality of Service (IWQoS), the ACM International Conference on Systems for Energy-Efficient Built Environments (BuildSys), and the ACM Conference on Embedded Network Sensor Systems (SenSys). In addition, every third year the SIGMETRICS conference is held jointly with IFIP performance. Additionally, SIGMETRICS produces a newsletter, Performance Evaluation Review, with both peer-reviewed and editorial content.
SIGMETRICS has four awards that are given out on an annual basis:
The SIGMETRICS Achievement Award, which recognizes a senior researcher who has made long-lasting influential contributions to computer/communication performance evaluation.
The SIGMETRICS Rising Star Award, which recognizes a junior researcher who demonstrates outstanding potential for research in computer/communication performance evaluation.
The SIGMETRICS Test of Time Award, which recognizes an influential SIGMETRICS paper from 10–12 years previously.
The SIGMETRICS Doctoral Dissertation Award, which recognizes excellent thesis research by doctoral candidates.
History
The group was formed as SIGME (Special Interest Committee on Measurement and Evaluation) in 1971, the name was changed to SIGMETRICS in 1972.
Awards
Each year the group gives three awards, the lifetime achievement award, rising star award and test of time award.
Achievement award
The achievement award is given each year to an individual who has made "long-lasting, influential contributions to the theory or practice of computer/communication system performance evaluation."
2022 Balaji Prabhakar
2021 R. Srikant
2020 Leandros Tassiulas
2019 Mary K. Vernon
2018 Jim Dai
2017 Sem Borst
2016 John Tsitsiklis
2015 Bruce Hajek
2014 François Baccelli
2013 Jean Walrand
2012 Debasis Mitra
2011 Onno J. Boxma
2010 Jeffrey P. Buzen
2009 Frank Kelly
2008 Erol Gelenbe
2007 Don Towsley
2006 Richard R. Muntz
2005 Stephen S. Lavenberg
2004 Ken C. Sevcik
2003 Edward G. Coffman, Jr.
Rising star award
The rising star award is given each year to an individual who "demonstrates outstanding potential for research in the field of computer and communication perfor |
https://en.wikipedia.org/wiki/Radar%20chart | A radar chart is a graphical method of displaying multivariate data in the form of a two-dimensional chart of three or more quantitative variables represented on axes starting from the same point. The relative position and angle of the axes is typically uninformative, but various heuristics, such as algorithms that plot data as the maximal total area, can be applied to sort the variables (axes) into relative positions that reveal distinct correlations, trade-offs, and a multitude of other comparative measures.
The radar chart is also known as web chart, spider chart, spider graph, spider web chart, star chart, star plot, cobweb chart, irregular polygon, polar chart, or Kiviat diagram. It is equivalent to a parallel coordinates plot, with the axes arranged radially.
Overview
The radar chart is a chart and/or plot that consists of a sequence of equi-angular spokes, called radii, with each spoke representing one of the variables. The data length of a spoke is proportional to the magnitude of the variable for the data point relative to the maximum magnitude of the variable across all data points. A line is drawn connecting the data values for each spoke. This gives the plot a star-like appearance and the origin of one of the popular names for this plot. The star plot can be used to answer the following questions:
Which observations are most similar, i.e., are there clusters of observations? (Radar charts are used to examine the relative values for a single data point (e.g., point 3 is large for variables 2 and 4, small for variables 1, 3, 5, and 6) and to locate similar points or dissimilar points.)
Are there outliers?
Radar charts are a useful way to display multivariate observations with an arbitrary number of variables. Each star represents a single observation. Typically, radar charts are generated in a multi-plot format with many stars on each page and each star representing one observation. The star plot was first used by Georg von Mayr in 1877. Radar charts differ from glyph plots in that all variables are used to construct the plotted star figure. There is no separation into foreground and background variables. Instead, the star-shaped figures are usually arranged in a rectangular array on the page. It is somewhat easier to see patterns in the data if the observations are arranged in some non-arbitrary order (if the variables are assigned to the rays of the star in some meaningful order).
Applications
Radar charts can be used in sports to chart players' strengths and weaknesses by calculating various statistics related to the player that can tracked along the central axis of the chart. Examples include a basketball players shots made, rebounds, assists, etc., or the batting or pitching stats of a baseball player. This creates a centralized visualization of the strengths and weaknesses of a player, and if overlapped with the statistics of other players or league averages, can display where a player excels and where they could improve |
https://en.wikipedia.org/wiki/Otis%20Boykin | Otis Frank Boykin (August 29, 1920March 26, 1982) was an American inventor and engineer. His inventions include electrical resistors used in computing, missile guidance, and pacemakers.
Early life and education
Otis Boykin was born on August 29, 1920, in Dallas, Texas. His father, Walter B. Boykin, was a carpenter, and later became a preacher. His mother, Sarah, was a maid, who died of heart failure when Otis was a year old. This inspired him to help improve the pacemaker. Boykin attended Booker T. Washington High School in Dallas, where he was the valedictorian, graduating in 1938. He attended Fisk University on a scholarship, worked as a laboratory assistant at the university's nearby aerospace laboratory, and left in 1941.
Boykin then moved to Chicago, where he found work as a clerk at Electro Manufacturing Company. He was subsequently hired as a laboratory assistant for the Majestic Radio and Television Corporation; at that company, he rose to become foreman of their factory. By 1944, he was working for the P.J. Nilsen Research Labs.
In 1946–1947, he studied at Illinois Institute of Technology, but dropped out after two years; some sources say it was because he could not afford his tuition, but he later stated he left for an employment opportunity and did not have time to return to finish his degree. One of his mentors was Dr. Denton Deere, an engineer and inventor with his own laboratory. Another mentor was Dr. Hal F. Fruth, with whom he collaborated on several experiments, including a more effective way to test automatic pilot control units in airplanes. The two men later went into business, opening an electronics research lab in the late 1940s.
In the 1950s, Boykin and Fruth worked together at the Monson Manufacturing Corporation; Boykin was the company's chief engineer. In the early 1960s, Boykin was a senior project engineer at the Chicago Telephone Supply Corporation, later known as CTS Labs. It was here that he did much of his pacemaker research. But Boykin subsequently sued CTS for $5 million, asserting that his former employer had obtained a patent and tried to take credit for the device that he developed.
After the suit was eventually dismissed, and his career at CTS had ended, he opened his own consulting and research company, with offices in both the US and Paris, France.
Legacy
Boykin patented as many as 26 devices. He is best known for inventing multiple different electronic control devices in guided missiles, IBM computers, and in the pacemaker. One of his early inventions was an improved wire resistor, which had reduced inductance and reactance, due to the physical arrangement of the wire.
Other notable inventions include a variable resistor used in guided missiles. His most famous invention was likely a control unit for the artificial cardiac pacemaker. The device essentially uses electrical impulses to maintain a regular heartbeat. Among his other inventions is a burglar-proof cash register.
See also
List of Afr |
https://en.wikipedia.org/wiki/Socialist%20Women%27s%20Network | The Socialist Women's Network is the women's wing of the Scottish Socialist Party and campaigns on issues particularly affecting women. Although primarily made up of party members, the SWN is open to all women who are interested in women's issues from a socialist perspective. Although the main ideology of the network is socialist feminist, there are a variety of interpretations of feminism within the network and there are a number of radical feminists who are also members.
The SWN has existed since the beginning of the SSP, however was relatively small until the Sheridan crisis occurred. The issues raised within that period of the party, together with the demonisation of leading women within the party led to a reinvigoration of the network and a renewed interest in feminist issues within the party.
The network has campaigned on issues as diverse as sweatshops, female deaths in custody, right to choose, prostitution, sexual violence and the rights of migrant women. It holds a regular event on International Women's Day and organises dayschools and residential weekends which are open to all women interested in feminist issues to meet up and discuss current issues in feminism and women's rights, both in formal and informal settings.
References
Women's wings of political parties in the United Kingdom
Scottish Socialist Party
1998 establishments in Scotland
Organizations established in 1998 |
https://en.wikipedia.org/wiki/Transport%20in%20New%20South%20Wales | An extensive multi-modal transport system serves the state of New South Wales, Australia. The lead government agency responsible for the network's operation and development is Transport for NSW.
Road
Transport for NSW is the main New South Wales Government agency responsible for major road infrastructure, licensing of drivers, and registration of motor vehicles. It directly manages State roads and provides funding to local councils for regional and local roads. In addition, with assistance from the Federal Government, Transport for NSW also manages the NSW national highway system.
Across the state, the RMS manages 4,787 bridges and 17,623 km of state roads and highways including 3,105 km of National Highways.
Rail
During the 20th century the railways were run by state-owned entity the New South Wales Government Railways and its successors. The current entity responsible for running the railways is Transport for New South Wales (TfNSW), with NSW TrainLink and Sydney Trains responsible for service provision and Transport Asset Holding Entity being the infrastructure owner. Freight services were operated by the state government through FreightCorp until 2001, when this business was sold to Pacific National. Since 2003, the NSW interstate and Hunter Valley rail corridors, and the dedicated metropolitan freight lines to the Sydney ports have been under the control of the Australian Rail Track Corporation. The rest of the network outside of Sydney is maintained under contract by John Holland.
Public transport
According to the New South Wales State Plan, the state has Australia's largest public transport system. Indeed, in the 1920s, Sydney also boasted the southern hemisphere's largest tram network. Public transport in Sydney accounts for almost double the share of commuter journeys in other state capitals. The network is regulated by TfNSW, which is working towards an integrated network serving Sydney, Newcastle, the Central Coast, the Blue Mountains, Wollongong and the Illawarra.
Taxis
New South Wales is served by a fleet of around 6,000 taxis. The industry employs over 22,000 taxi drivers. The network is the largest in Australia. Most taxis are Ford Falcons, Holden Commodores and Toyota Camrys, although a smaller number of Ford Fairlanes, Holden Statesman/Caprices and Toyota Priuses are in service. In general, taxis are required to run on liquid petroleum gas. In general, individual taxis are owned by small-scale operators who pay membership fees to regional or citywide radio communication networks. These networks provide branding as well as telephone and internet booking services to operators and drivers.
Air
The major airport is Sydney Airport. The Western Sydney Airport is scheduled to open in 2026.
Sea
Major seaport facilities are located at
Port Jackson, in central Sydney
Port Botany, in Sydney's south
Port Kembla, south of Wollongong
Port of Newcastle, at Newcastle, north of Sydney
Regional ports at Eden and Yamba are administered b |
https://en.wikipedia.org/wiki/MAC%20service%20data%20unit | MAC service data unit (media access control service data unit, MSDU) is the service data unit that is received from the logical link control (LLC) sub-layer which lies above the media access control (MAC) sub-layer in a protocol stack. The LLC and MAC sub-layers are collectively referred to as the data link layer (DLL).
See also
MAC protocol data unit
Packet segmentation
Packet aggregation
External links
802.11 Wireless LAN IEEE standard
Media access control |
https://en.wikipedia.org/wiki/Slum%20networking | Slum networking is a holistic approach to improving urban infrastructure, developed by Himanshu Parikh
It addresses a range of facilities needed by slum dwellers:
roads and footpaths
storm drainage
sanitation and sewerage
water supply
earthworks and soft landscaping
street lighting
solid waste management
This is achieved minimal donor funding by maximizing community participation and using microcredit systems.
Technical aspects
Drainage and sewerage are made lower cost by making them follow the topography. Thus sewers do not need to be buried deeply, digging is reduced, and pumping of sewage is avoided as the sewers follow the natural drainage paths.
In a lecture for Engineers Without Borders (UK), Himanshu Parikh explained that his research into the growth of slums had led to the realisation that slums always develop along natural drainage paths. Therefore, the cheapest way to provide sewerage to a city is to build major sewers through the slums and connect the higher (and usually richer) areas of the city to them. This then provides sewerage to the whole city for lower costs than just providing sewerage for the rich areas.
This approach opens up funding from local and national governments, which can then be matched by donor funding if necessary to construct sewerage and water supply systems. The cost savings provide leverage to get the local government to provide tenure to slum dwellers. The slum dwellers, once given tenure, are willing to spend their own money on developing the slums as the risk of losing their investment is removed. Microcredit schemes mobilise this funding and allow slum housing to be connected to sewers and water systems and for slums to be landscaped and lit.
The evidence from Indore City is that two years after the upgrade programme the slums are no longer recognisable as slums.
Awards
The scheme has won several awards, including the Dubai Award, the 1994 World Habitat Award and the Aga Khan Award for Architecture.
References
External links
Slum Networking - A Holistic Approach for Improvement of Urban Infrastructure and Environment
The magic of slums, by Priya Florence Shah, Humanscape, VOL VI, 1 January 1999. Focuses on Himanshu Parikh.
Talk by Priti Parikh, November 2004. (MP3 format, 44.39 MB) - Engineers Without Borders (UK) site.
Slums
Urban planning
Sewerage |
https://en.wikipedia.org/wiki/John%20Fairclough | Sir John Whitaker Fairclough (23 August 1930 – 5 June 2003) was a British computer designer, and later government policy advisor.
Education
John Fairclough was educated at Thirsk Grammar School and then studied electrical engineering at Manchester University, before undertaking national service with the RAF.
Career
In 1954, he joined the Ferranti computer department and in 1957 he moved to IBM, including working in Raleigh, North Carolina, USA. He returned to the UK to be the Managing Director of IBM Hursley near Winchester in 1974.
During 1986–90, Fairclough was Chief Scientific Adviser for the UK Conservative government led by Margaret Thatcher.
He left the Cabinet Office and was knighted in 1990. That year, he joined the Board of NM Rothschild and Sons in 1990, becoming Chairman of its venture capital section. He was also involved with a number of start-up companies.
He was President of the British Computer Society (1997–98).
Personal life
He married his first wife, Margaret Harvey, in 1954. After her death in 1996, he married his second wife, Karen, in 2000. He had two sons and a daughter from his first marriage.
References
1930 births
2003 deaths
Alumni of the University of Manchester
British computer scientists
Computer designers
British chief executives
IBM employees
Presidents of the British Computer Society
Knights Bachelor |
https://en.wikipedia.org/wiki/Walls%20and%20Mirrors | Walls And Mirrors is a computer science textbook, for undergraduates taking a second computer science course (typically on the subject of data structures and algorithms), originally written by Paul Helman and Robert Veroff. The book attempts to strike a balance between being too mathematically rigorous and formal, and being so informal, practical, and hands-on that computer science theory is not taught.
The "walls" of the title refer to the abstract data type (ADT) which has a wall between its public interface and private implementation. Early languages like Pascal did not build this wall very high; later languages like Modula-2 did create a much stronger wall between the two; and object-oriented languages such as C++ and Java implement walls using the class concept.
The "mirrors" of the title refer to recursion. The idea is of looking at a reflection in two mirrors placed in opposition to one another, so a repeated image is reflected smaller and smaller in them.
Editions
The first edition, which used the language Pascal, was published in 1986.
An edition that used Modula-2 was published in 1988. Modula-2 had much better support for the sort of ADT the book taught than Pascal.
Later editions from the mid-1990s and the 2000s used C++ and Java, reflecting a fundamental shift in how computer science was taught. The original authors' names have been removed from the most recent editions of the book.
Publication history
Walls and Mirrors, Intermediate Problem Solving and Data Structures (Pascal edition) (1986), Paul Helman and Robert Veroff. (Benjamin Cummings Publishing Co.)
Walls and Mirrors, Intermediate Problem Solving and Data Structures (Modula-2 edition) (1988), Paul Helman and Robert Veroff. (Benjamin Cummings Publishing Co.)
Intermediate Problem Solving and Data Structures: Walls and Mirrors, Second Pascal edition, (1991), Paul Helman, Robert Veroff, and Frank M. Carrano. (Benjamin Cummings Publishing Co.)
Data Structures and Problem Solving with Turbo Pascal: Walls and Mirrors, (1993), Frank M. Carrano, Paul Helman, and Robert Veroff. (Benjamin Cummings Publishing Co.)
Data Abstraction and Problem Solving with C++: Walls and Mirrors, (1995), Frank M. Carrano, Paul Helman, and Robert Veroff. (Benjamin Cummings Publishing Co.)
Data Abstraction and Problem Solving with C++: Walls and Mirrors, Second edition, (1998), Frank M. Carrano, Paul Helman, and Robert Veroff. (Addison Wesley Longman, Inc.)
Data Abstraction and Problem Solving with Java: Walls and Mirrors, (2001), Frank M. Carrano and Janet J. Prichard. . (Addison Wesley Longman, Inc.)
Data Abstraction and Problem Solving with C++: Walls and Mirrors, Third edition, (2002), Frank M. Carrano and Janet J. Prichard. (Pearson Education, Inc.)
Data Abstraction and Problem Solving with Java: Walls and Mirrors, Updated edition (2004), Frank M. Carrano and Janet J. Prichard. (.)
Data Abstraction and Problem Solving with C++: Walls and Mirrors, Fourth edition, (2005), Frank M |
https://en.wikipedia.org/wiki/Computer%20Aid%20International | Computer Aid International is a not-for-profit organisation active in the field of Information and Communication Technologies for Development. A registered charity, Computer Aid was founded in 1997 to bridge the digital divide by providing refurbished PCs from the UK to educational and non-profit organisations in developing countries.
Computer Aid has provided over 267,000 refurbished computers to educational institutions and not-for-profit organisations in more than 110 countries.
Organization
Computer Aid International is a non-governmental organisation registered with the Charity Commission of England & Wales and is a not-for-profit social business.
Computer Aid has offices in London, South Africa and Kenya. At the Africa HQ in Nairobi,
Computer Aid has a board of trustees that meet quarterly to provide strategic direction and fiduciary oversight.
Denis Goldberg was Computer Aid's Honorary Patron.
Strategy
Computer Aid offers a decommissioning service to UK companies, government departments and universities that are upgrading their computer systems – donated PCs are data-wiped, refurbished and tested. Non profit organisations in the developing world can apply for refurbished computers for educational projects. They also run their own projects, such as Digital Schools where computer labs are set up.
UK IT Donors
Computer Aid has partnered with Tier 1 to offer a secure service to UK companies and organisations replacing their hardware. The charity provides end-of-life IT asset management services, which include data removal, computer refurbishment, reuse, and recycling.
See also
Computer technology for developing areas
Geekcorps
Geeks Without Bounds
NetCorps
Random Hacks of Kindness
United Nations Information Technology Service (UNITeS)
References
Further reading
External links
Article on a Computer Aid project supporting blind and visually impaired children in Kenya
Article on a Computer Aid project helping farmers to maximise crop harvests in times of drought
Charities based in London
Development charities based in the United Kingdom
Information technology charities
Information technology organisations based in the United Kingdom
Organisations based in the London Borough of Hackney
Organizations established in 1997 |
https://en.wikipedia.org/wiki/NJA | NJA may refer to:
New Jewish Agenda, former US organization
Naval Air Facility Atsugi, Japan, IATA code
New Japan Aviation, Kagoshima, services company, ICAO code
Newman-Janis Algorithm, a method of finding solutions in general relativity |
https://en.wikipedia.org/wiki/Kekul%C3%A9%20Program | Kekulé was a computer program named after the chemist Friedrich August Kekulé von Stradonitz. The program was created starting in about 1990 by Joe McDaniel and Jason Balmuth while at Fein-Marquart Associates with funding from the National Cancer Institute under a Small Business Innovative Research Grant.
Overview
The program was created to satisfy a need at the NCI for entering chemical structures into a database. The format required for the database was a connection table while the published form of a structure was a drawing. The program could take a scanned image of the drawn structure and automatically read the atom labels (characters) and lines between atoms (bonds) to create the connection table for input into the database.
NCI continues to use the program () although it is no longer commercially available.
Several articles describing the internal operation of the program were written and published in refereed journals such as the Journal of Chemical Information and Computer Sciences.
References
Chemistry software |
https://en.wikipedia.org/wiki/DVB-SH | DVB-SH ("Digital Video Broadcasting - Satellite services to Handhelds") is a physical layer standard for delivering IP based media content and data to handheld terminals such as mobile phones or PDAs, based on a hybrid satellite/terrestrial downlink and for example a GPRS uplink. The DVB Project published the DVB-SH standard in February 2007.
The DVB-SH system was designed for frequencies below 3 GHz, supporting UHF band, L Band or S-band. It complements and improves the existing DVB-H physical layer standard. Like its sister specification (DVB-H), it is based on DVB IP Datacast (IPDC) delivery, electronic service guides and service purchase and protection standards.
Standard description
Architecture
There are two physical layers (terrestrial and satellite), what increases de system configuration options. Depending on the transmitted signal modulation we can find two kind of architectures: SH-A and SH-B.
SH-A Architecture
Both terrestrial and satellite layers use Orthogonal frequency-division multiplexing (OFDM) this modulation solves the multipath problem, where the same token can be received multiple times with a delay due to bounces. Use OFDM in both transmitters enables creating single-frequency networks (SFN), that increases spectral efficiency but forces the terrestrial signal being identical to the transmitted by the satellite. For this reason, is permitted to implement Multi-frequency network (MFN) where terrestrial and satellite components can broadcast through different channels with the same modulation.
SH-B Architecture
Terrestrial component uses OFDM but satellite uses Time-division multiplexing (TDM). Both components have to broadcast in different frequencies to avoid interference. It is not possible creating SFN but increases satellite´s signal transmission performance because TDM works better with these kinds of transmissions.
Comparison with DVB-H
The DVB-SH incorporates a number of enhancements when compared to DVB-H:
More alternative coding rates are available
The omission of the 64QAM modulation scheme
The inclusion of support for 1.7 MHz bandwidth and 1k FFT
FEC using Turbo coding
Improved time interleaving
Support for antenna diversity in terminals
Recently, results from BMCO forum (Alcatel April 2008) shows a radio improvement of at least 5.5 dB on signal requirements between DVB-H and DVB-SH in the UHF frequencies. The improvements to signal requirements translates to better in-building penetration, better in-car coverage and extension of outdoor coverage. DVB-SH chipsets are being developed now by DiBcom and NXP Semiconductors, and are expected to be available in beginning of 2008. Initial specifications show that the chipsets supports both UHF and S-Band and are compatible with DVB-H.
DiBcom has announced a DVB-SH chip with availability in 2008 Q3. Dibcom DVB-SH 2008 Q3.
The chip "has dual RF tuners supporting VHF, UHF, L-Band and S-Band frequencies".
Project organization
French Agence de l'innovation ind |
https://en.wikipedia.org/wiki/ZP-150 | The ZP-150 was one of the earliest commercially available laptops. It was released in late 1984 by Zenith Data Systems.
Market life
The ZP-150 was offered for when bundled with the Microsoft Works software, but could be found in the Fall 1985 Heathkit catalog for . The price came down to in the Winter 1986 edition of the same catalog and in the Fall 1987 edition, as it was being phased out with the release of the Z-181 and Z-183. The main target market was the U.S. government and "the mobile executive", for on-site applications. Its relatively small dimensions and light weight allowed it to be easily carried in a standard briefcase or the included carrying case.
Hardware specifications
Weight:
Dimensions: 13"W × 11.1"D × 1.8"H
RAM: 32K, expandable to 416K
ROM: 224K, plus 2 sockets for software expansion
CPU: Intel 80C88
Power: 12VDC or 10 AA alkaline batteries (providing 15 hours run-time w/o modem), plus internal nickel-cadmium battery for retaining memory while off, up to 8 days
Ports:
Parallel printer
RS-232C
Telephone line (300 baud modem)
System bus
BCR (for a bar code reader)
CMT (for data cassette recorder)
ACP (for acoustic coupler)
Handset (of telephone)
LCD display (80 characters/line with 16 lines), contrast control, volume control, and low-battery indicator
75-key typewriter-style keyboard
The stock 32K RAM could hold up to 10 typewritten pages. The main methods of file transfer were via the modem or the RS-232C port and a file transfer program.
Software specifications
The ZP-150 came with a built-in System Manager and calculator program, as well as a special version of Microsoft Works 1.10 stored in ROM. Most programs are very similar to the desktop versions, but with reduced functionality.
Word word processor
Plan electronic spreadsheet, similar to Multiplan (spreadsheet size up to 255 rows x 63 columns)
Calendar appointment organizer with alarm
File database manager
Telcom telecommunications package
BASIC program editor and compiler
Accessories
ZP-150-1 power transformer
ZP-150-2 32K RAM module
ZP-150-4 Parallel to Centronics printer cable
CB-5063-27 File transfer software
Historical significance
The most significant aspect of the ZP-150's history is that it is not remembered as one of the first portable computers, despite its relatively early appearance in the marketplace and being referred to in advertising as a "laptop". Like the IBM PC and Apple II computers, the ZP-150 was quickly copied. The most well-known clone is the Tandy 600, which was very similar in packaging, software, and hardware except for the addition of a floppy drive and the lacking of BASIC. This was not the first laptop that Tandy manufactured, but was one in the TRS-80 line.
See also
History of computing hardware
Laptop
References
ZP-150 User's guide, (1985) Zenith Data Systems Corporation, St. Joseph, MI and Heath Company, Benton Arbor, MI
Heathkit catalogs, Fall 1985 (No. 870R) pp90-91, Winter 1986 (No. 201) p89, Fall 1987 (No, 207 |
https://en.wikipedia.org/wiki/KJCP-LP | KJCP-TV was a television station in Pago Pago. The station broadcasts in the NTSC standard on UHF Channel 38. It was founded on November 4, 2003, to offer TBN and JCTV programming to the island, as WVUV-LP switched from TBN to NBC. It ceased transmissions in 2007 when its rented tower was dismantled.
See also
Communications in American Samoa
References
External links
JCP-LP
Trinity Broadcasting Network affiliates
Television channels and stations established in 2003
Defunct television stations in the United States
Television channels and stations disestablished in 2010
2003 establishments in American Samoa
2010 disestablishments in American Samoa
Defunct mass media in American Samoa
Religious television stations in the United States |
https://en.wikipedia.org/wiki/Hierocrypt | In cryptography, Hierocrypt-L1 and Hierocrypt-3 are block ciphers created by
Toshiba in 2000. They were submitted to the NESSIE project, but were not selected. Both
algorithms were among the cryptographic techniques recommended for Japanese government use by CRYPTREC in 2003, however, both have been dropped to "candidate" by CRYPTREC revision in 2013.
The Hierocrypt ciphers are very similar, differing mainly in block size: 64 bits for Hierocrypt-L1, 128 bits for Hierocrypt-3. Hierocrypt-L1's key size is 128 bits, while Hierocrypt-3 can use keys of 128, 192, or 256 bits. The number of rounds of encryption also varies: Hierocrypt-L1 uses 6.5 rounds, and Hierocrypt-3 uses 6.5, 7.5, or 8.5, depending on the key size.
The Hierocrypt ciphers use a nested substitution–permutation network (SPN) structure. Each round consists of parallel applications of a transformation called the XS-box, followed by a linear diffusion operation. The final half-round replaces the diffusion with a simple
post-whitening. The XS-box, which is shared by the two algorithms, is itself an SPN, consisting of a subkey XOR, an S-box lookup, a linear diffusion, another subkey XOR, and another S-box lookup. The diffusion operations use two MDS matrices, and there is a single 8×8-bit S-box. The key schedule uses the binary expansions of the square roots of some small integers as a source of "nothing up my sleeve numbers".
No analysis of the full ciphers has been announced, but certain weaknesses were discovered in the Hierocrypt key schedule, linear relationships between the master key and some subkeys. There has also been some success applying integral cryptanalysis to reduced-round Hierocrypt variants; attacks faster than exhaustive search have been found for 3.5 rounds of each cipher.
References
External links
256bit Ciphers - HIEROCRYPT Reference implementation and derived code
Block ciphers |
https://en.wikipedia.org/wiki/Multiservice%20Switch | Multiservice Switch (MSS) is originally a Nortel line of routers, historically called Passport, designed for carrier core and edge routing. They run the Passport Carrier Release operating system. The MSS has a significant installed base, with over 40,000 switches sold.
As of 27 September 2010, this product line was sold to Ericsson.
The Nortel MSS products have been rebranded to Ericsson PPX.
Features
Some core features of the Multiservice Switch series are:
MPLS with BGP VPNs
RFC2764 VPNs
SONET/ATM, Frame Relay and Ethernet Media Support
IPv4 Routing (layer 3)
Layer 3 Traffic Management
Architecture
The Multiservice switches are made up of a shelf of 16 cards. There are two key types of cards to consider:
the Control Processor or CP is the switch fabric processor: it controls shelf functionality, as well as controls routing as well as manages the provisioning interface;
the Function Processor or FP is in essence a line card, but there is processing logic and queue logic on the card. This allows for packets to be directly manipulated on the FP, decreasing the load on the CP. FPs normally process data frames on the ingress path and can autonomously forward frames to egress ports without further processing by protocol or control software on the egress FP. This is done by implementing backplane transfer, egress queuing and subsequent transmission all using ASICs.
A shelf can have up to 2 CPs (1 master, 1 hot spare) and 14 FPs (including hot spares).
The MSS has historically gone through two generations of Fabric Control Processors, starting with the i960 initially, and later moving to PowerPC.
MSS software development started in 1990 before MSS hardware was available by applying paravirtualization techniques to VxWorks and running each CP or FP application payload on Sun SPARC workstations, each as a Unix user process.
Models
The Multiservice Switch line is divided into several different models. This division is both historical and technical.
MSS 15000/20000
The top-of-the-line switch with a backplane capable of in excess of 50 Gbit/s of data transfer. This is the latest revision to the MSS line.
MSS 6400
One of the original Passport switches, the MSS 6400 has a significant historical installed base. Based on a redundant dual 800 Mbit/s backplane. The MSS 6400 had several different configurations available, the three slot 6420, the five slot 6440, and the 16 slot 6480.
MSS 7400
Initially running on the same hardware as the MSS 6400, the MSS 7400 uses Passport Carrier Release software only. The MSS 7400 range includes the three-slot 7420 (discontinued), the five-slot 7440, eight-slot 7460, and 16-slot 7480.
MSS 9400
The 16-slot MSS 9480 moves away from the dual shared 800Mbit/s backplanes found in the 6400/7400 series of products. The 9480 backplane is switched, providing a dedicated dual bus to each line card. Most current 7400 line cards work in the 9480 chassis.
Supported media types
There are a number of media types su |
https://en.wikipedia.org/wiki/Parallel%20manipulator | A parallel manipulator is a mechanical system that uses several computer-controlled serial chains to support a single platform, or end-effector. Perhaps, the best known parallel manipulator is formed from six linear actuators that support a movable base for devices such as flight simulators. This device is called a Stewart platform or the Gough-Stewart platform in recognition of the engineers who first designed and used them.
Also known as parallel robots, or generalized Stewart platforms (in the Stewart platform, the actuators are paired together on both the basis and the platform), these systems are articulated robots that use similar mechanisms for the movement of either the robot on its base, or one or more manipulator arms. Their 'parallel' distinction, as opposed to a serial manipulator, is that the end effector (or 'hand') of this linkage (or 'arm') is directly connected to its base by a number of (usually three or six) separate and independent linkages working simultaneously. No geometrical parallelism is implied.
Design features
A parallel manipulator is designed so that each chain is usually short, simple and can thus be rigid against unwanted movement, compared to a serial manipulator. Errors in one chain's positioning are averaged in conjunction with the others, rather than being cumulative. Each actuator must still move within its own degree of freedom, as for a serial robot; however in the parallel robot the off-axis flexibility of a joint is also constrained by the effect of the other chains. It is this closed-loop stiffness that makes the overall parallel manipulator stiff relative to its components, unlike the serial chain that becomes progressively less rigid with more components.
This mutual stiffening also permits simple construction: Stewart platform hexapods chains use prismatic joint linear actuators between any-axis universal ball joints. The ball joints are passive: simply free to move, without actuators or brakes; their position is constrained solely by the other chains. Delta robots have base-mounted rotary actuators that move a light, stiff, parallelogram arm. The effector is mounted between the tips of three of these arms and again, it may be mounted with simple ball-joints. Static representation of a parallel robot is often akin to that of a pin-jointed truss: the links and their actuators feel only tension or compression, without any bending or torque, which again reduces the effects of any flexibility to off-axis forces.
A further advantage of the parallel manipulator is that the heavy actuators may often be centrally mounted on a single base platform, the movement of the arm taking place through struts and joints alone. This reduction in mass along the arm permits a lighter arm construction, thus lighter actuators and faster movements. This centralisation of mass also reduces the robot's overall moment of inertia, which may be an advantage for a mobile or walking robot.
All these features result in manipu |
https://en.wikipedia.org/wiki/Perry%20Kivolowitz | Perry Kivolowitz (born 1961) is an American computer scientist and business person. In 1985, he co-founded Advanced Systems Design Group which built hardware for the Commodore Amiga. This company was renamed Elastic Reality, Inc. and became well known as a digital imaging software provider. In 1987, Kivolowitz invented the recoverable ram drive In 1995 this company sold to Avid Technology, Inc.
In 1996 he received an Academy Award for Scientific and Technical Achievement for the invention of shape-driven warping and morphing as exemplified in the Avid Elastic Reality package once in widespread use. Dr. Garth Dickie was a co-recipient of this award.
Kivolowitz is a principal in SilhouetteFX LLC. In December 2018, the Academy of Motion Picture Arts and Sciences granted an Academy Award for Scientific and Technical Achievement to Silhouette.
He co-founded Profound Effects, Inc. (2001–2008), Hypercosm Inc. (1999–2001) and KSK Electrics, LLC (2013–2015). Kivolowitz was accepted into the Visual Effects Society
in 2012.
From 1997 to 1999 and from 2006 to 2015, Kivolowitz was a member of the Computer Sciences Department of the University of Wisconsin–Madison, first as an adjunct faculty member and then as a Faculty Associate and Instructional Program Director. During the University of Wisconsin - Madison's Sesquicentennial Celebration, Kivolowitz was honored as being one of the 150 Ways the University of Wisconsin has Touched the World. In January 2018, Kivolowitz was made Chair of the Computer Science Department at Carthage College.
Kivolowitz lectured for AT&T and Bell Labs in the early 1980s on Unix Internals and debugging primarily at an AT&T facility in Piscataway New Jersey but also across the country. In April 2012, Kivolowitz resumed lecturing on the process of debugging
As a graduate student Kivolowitz authored one of the earliest key logger programs, the source code of which was posted to Usenet in November 1983. Kivolowitz authored an early paper on file systems for write-once media presented at the 1984 USENIX conference in Salt Lake City.
Since 2004 Kivolowitz has been an invited speaker and provides expert testimony on the subject of detecting tampered digital images (both still images and video).
In 2006, Kivolowitz wed Sara Krueger Kivolowitz. He is currently a computer science professor at Carthage College.
In October 2019 it was announced that Kivolowitz had won a 2019 Engineering Emmy Award for his software SilhouetteFX.
Patents
5881321 Camera motion sensing system
5754180 Computer system and process for defining and manipulating images using structured objects with variable edge characteristics
5077604 Color printing, correction can conversion apparatus and method
References
External links
SilhoutteFX web site
Wisconsin Association of Computer Crime Investigators
American computer scientists
Living people
Carthage College faculty
University of Wisconsin–Madison faculty
Stony Brook University alumni
1961 births
Acad |
https://en.wikipedia.org/wiki/YKAN | The young Korean American Network (yKAN) is a 501(c)(3) non-profit, non-partisan organization of 1.5 and 2nd generation Korean-Americans in the New York City area. The organization consists primarily of young professionals from various job industries, as well as academic fields. Members volunteer their time to help promote and advance the Korean-American presence in American society.
History
The young Korean American Network started in 1989 and was officially inaugurated on August 30, 1990 as a 501(c)(3) non-profit, non-partisan organization. Their first president, Michael Han, was a founding member who sought to create the organization as a response to the lack of a networking hub for the Korean-American community in New York.
Since its inauguration, the organization has grown to over 800 members.
Mission and Objective
The organization's mission
... is to elevate Korean-American professionals by fostering educational programs, community service, and networking opportunities. Through these activities yKAN addresses the issues of our community and provides a forum for those who share common experiences and face similar challenges.
The organizations' objectives are to
Create a professional network to facilitate the even exchange of ideas and common goals among all Korean American professionals
Foster a professional Korean-American presence in our community by sponsoring educational programs and opportunities
Promote social awareness and activism through community service
Foster mutual understanding between Korean-Americans and other ethnic groups
Promote greater opportunities for the current and future generations of all Korean Americans
Presidents
Media coverage
yKAN has appeared in the media various times, most notably for their community service events. These appearances include the following:
May 9, 2011 - Bone Marrow and Stem Cell Recruitment Drive. Video from NY1
December 18, 2006 - Milal House Visit. Article from Christian Daily
January 21, 2006 - Anna Erika Adult Home Visit. Scanned article from The Korea Times
January 19, 2006 - Media Coverage of guest speaker, Minya Oh ("aka Miss Info"). Scanned article from The Korea Times
October 29, 2005 - Flu Shot Drive. Scanned article from The Korea Times
September 17, 2005 - Anna Erika Adult Home Visit. Scanned article from The Korea Times
March 21, 2005 - Milal House Visit. Article from The Korea Times
February 15, 2005 - Tsunami Relief Fundraiser Event for the 2004 Tsunami that effected Southeast Asia. Article from The Korea Times
February 11, 2005 - Tsunami Relief Fundraiser Event for the 2004 Tsunami that effected Southeast Asia. Article from The Segye Times
External links
yKAN website - official
Youth organizations based in New York City
Korean-American organizations |
https://en.wikipedia.org/wiki/Small%20Claims%20%28film%29 | Small Claims is an Australian television film starring Rebecca Gibney and Claudia Karvan, which first aired on Network Ten in 2004. The film was a co-production with subscription television and was also broadcast on the Foxtel, Austar, and Optus Television Subscription Television services. The series was written by husband and wife team, Keith Thompson and Kaye Bendle.
The film is part one of a mystery series about two overworked young mums, de-skilled beyond their worst nightmares, who become a formidable pair of sleuths, directed by Cherie Nowlan. Their cases are the murders, greed and dark passions that lurk behind the anonymous facade of the suburbs. Two sequels followed, entitled Small Claims: White Wedding and Small Claims: The Reunion.
Cast
Rebecca Gibney, as Chrissy Hindmarsh
Claudia Karvan, as Jo Collins
Robert Mammone, as Todd Fehlers
Paul Barry, as Greg Collins
Carol Burns, as Pamela
Gyton Grantley, as Detective Senior Constable Brett
Wayne Blair, as Detective Senior Constable Lacey
Rebecca Massey, as Clare Santarini
See also
Australian films of 2004
Cinema of Australia
List of films shot in Sydney
List of Australian films
References
External links
Network 10 original programming
Australian television films
Films directed by Cherie Nowlan
2000s English-language films |
https://en.wikipedia.org/wiki/JGRASP | jGRASP is a development environment that includes the automatic creation of software visualizations. It produces static visualizations of source code structure and visualizations of data structures at runtime.
The runtime data structure visualizations are also available as plugins for IntelliJ IDEA, Android Studio, and Eclipse.
jGRASP is implemented in Java, and runs on all platforms with a Java Virtual Machine (Java version 1.8 or higher). GRASP (Linux, UNIX) and pcGRASP (Windows) are written in C/C++, whereas jGRASP is written in Java (the "j" in jGRASP means it runs on the JVM). The jGRASP web site offers downloads for Windows, Mac OS, and as a generic ZIP file suitable for Linux and other systems.
For languages other than Java, jGRASP is a source code editor. It can be configured to work with most free and commercial compilers for any programming language.
Visualizations
The Control Structure Diagram (CSD) is a control flow diagram that fits into the space normally taken by indentation in source code. Its purpose is to improve the readability of source code. jGRASP produces CSDs for Java, C, C++, Objective-C, Ada, and VHDL. The editing window provides CSD-based folding and a "context hint" feature that displays the first line of a code structure that is off-screen when the mouse is hovered over its CSD structure.
The Java object viewers in jGRASP provide interface-based, structural, and other views of data structures and other objects and primitives during debugging and workbench operations. For example, a content-based view shows ArrayList and LinkedList in an identical way, as a list of elements. Structural views show the internal structure of trees, linked lists, hash tables, etc. Structural views of linked data structures display local variable nodes and their relation to the main structure. The result is animated when changes occur, as when a node is added to a linked list. Common data structures are automatically identified and displayed structurally. Other viewers show, for example, a color swatch for a Color, the image for an icon, and the binary details of a double. Multiple viewers can be combined on a single viewer canvas window and the contents can be saved to file.
The Complexity Profile Graph (CPG) is a statement-level complexity diagram. Its purpose is to aid in identifying overly complex areas of source code. jGRASP generates CPGs for both Java and Ada. The metric includes common measures, such as reachability and content complexity, which can be displayed individually.
jGRASP also generates UML diagrams for Java, with interactive dependency information.
History
jGRASP was created by James Cross and Larry Barowski at the Department of Computer Science and Software Engineering in the Samuel Ginn College of Engineering at Auburn University. It is maintained and evaluated by the jGRASP Team. The development of jGRASP has been supported by a research grant from the National Science Foundation.
The development of previous |
https://en.wikipedia.org/wiki/Identity%20column | An identity column is a column (also known as a field) in a database table that is made up of values generated by the database. This is much like an AutoNumber field in Microsoft Access or a sequence in Oracle. Because the concept is so important in database science, many RDBMS systems implement some type of generated key, although each has its own terminology. Today a popular technique for generating identity is to generate a random UUID.
An identity column differs from a primary key in that its values are managed by the server and usually cannot be modified. In many cases an identity column is used as a primary key; however, this is not always the case.
It is a common misconception that an identity column will enforce uniqueness; however, this is not the case. If you want to enforce uniqueness on the column you must include the appropriate constraint too.
In Microsoft SQL Server you have options for both the seed (starting value) and the increment. By default the seed and increment are both 1.
Code samples
Create Table Contacts (
FirstName varChar(30),
LastName varChar(30),
Phone varChar(16),
ContactID int identity(1, 1)
)
or
Create Table Contacts (
FirstName varChar(30),
LastName varChar(30),
Phone varChar(16)
)
GO
Alter Table Contacts Add ContactID int identity(1, 1)
In PostgreSQL
CREATE TABLE contact
(
contact_uuid UUID PRIMARY KEY DEFAULT gen_random_uuid(),
first_name varchar,
last_name varchar,
phone varchar
);
Related functions
It is often useful or necessary to know what identity value was generated by an INSERT command. Microsoft SQL Server provides several functions to do this: @@IDENTITY provides the last value generated on the current connection in the current scope, while IDENT_CURRENT(tablename) provides the last value generated, regardless of the connection or scope it was created on.
Example:
Insert Into Contacts ( FirstName, LastName ) Values ( 'Test', 'User' )
--
Select @@Identity
-- OR --
Declare @ID int
Select @ID = @@Identity
Update Contacts Set Phone = 'XXX-YYY-ZZZZ' Where ContactID = @ID
See also
Surrogate key
Unique key
External links
MSDN Article "Managing Identity"
Databases
Articles with example SQL code |
https://en.wikipedia.org/wiki/Sudoku%20solving%20algorithms | A standard Sudoku contains 81 cells, in a 9×9 grid, and has 9 boxes, each box being the intersection of the first, middle, or last 3 rows, and the first, middle, or last 3 columns. Each cell may contain a number from one to nine, and each number can only occur once in each row, column, and box. A Sudoku starts with some cells containing numbers (clues), and the goal is to solve the remaining cells. Proper Sudokus have one solution. Players and investigators use a wide range of computer algorithms to solve Sudokus, study their properties, and make new puzzles, including Sudokus with interesting symmetries and other properties.
There are several computer algorithms that will solve 9×9 puzzles (=9) in fractions of a second, but combinatorial explosion occurs as increases, creating limits to the properties of Sudokus that can be constructed, analyzed, and solved as increases.
Techniques
Backtracking
Some hobbyists have developed computer programs that will solve Sudoku puzzles using a backtracking algorithm, which is a type of brute force search. Backtracking is a depth-first search (in contrast to a breadth-first search), because it will completely explore one branch to a possible solution before moving to another branch. Although it has been established that approximately 5.96 x 1126 final grids exist, a brute force algorithm can be a practical method to solve Sudoku puzzles.
A brute force algorithm visits the empty cells in some order, filling in digits sequentially, or backtracking when the number is found to be not valid. Briefly, a program would solve a puzzle by placing the digit "1" in the first cell and checking if it is allowed to be there. If there are no violations (checking row, column, and box constraints) then the algorithm advances to the next cell and places a "1" in that cell. When checking for violations, if it is discovered that the "1" is not allowed, the value is advanced to "2". If a cell is discovered where none of the 9 digits is allowed, then the algorithm leaves that cell blank and moves back to the previous cell. The value in that cell is then incremented by one. This is repeated until the allowed value in the last (81st) cell is discovered.
The animation shows how a Sudoku is solved with this method. The puzzle's clues (red numbers) remain fixed while the algorithm tests each unsolved cell with a possible solution. Notice that the algorithm may discard all the previously tested values if it finds the existing set does not fulfill the constraints of the Sudoku.
Advantages of this method are:
A solution is guaranteed (as long as the puzzle is valid).
Solving time is mostly unrelated to degree of difficulty.
The algorithm (and therefore the program code) is simpler than other algorithms, especially compared to strong algorithms that ensure a solution to the most difficult puzzles.
The disadvantage of this method is that the solving time may be slow compared to algorithms modeled after deductive methods. One pro |
https://en.wikipedia.org/wiki/Etherloop | Etherloop is a kind of DSL technology that combines the features of Ethernet and DSL. It allows the combination of voice and data transmission on standard phone lines. Under the right conditions it will allow speeds of up to 6 megabits per second over a distance of up to 6.4 km (21,000 feet).
Etherloop uses half-duplex transmission, and as such, is less susceptible to interference caused by poor line quality, bridge taps, etc. Also, etherloop modems can train up through line filters (although it is not recommended to do this).
Etherloop has been deployed by various internet service providers in areas where the loop length is very long or line quality is poor. Some Etherloop modems (those made by Elastic Networks) offer a "Central Office mode", in which two modems are connected back to back over a phone line and used as a LAN extension. An example of a situation where this would be done is to extend Ethernet to a building that is too far to reach with straight Ethernet.
See also
Ethernet in the first mile (especially 2BASE-TL)
References
Computer networking |
https://en.wikipedia.org/wiki/State%20Coroner%20%28TV%20series%29 | State Coroner is an Australian television series screened on Network Ten in 1997 and 1998. There were two series produced with a total of 28 episodes.
The series was set in the State Coroner's office complex and featured investigations into deaths, murders, suicides, accidents and natural causes. The drama begins from the initial inquiry through to the courtroom appearances, the Coroner's final verdict and recommendations for trial or reform.
Cast
Wendy Hughes as Kate Ferrari
Bob Baines as Clive Trimble
Andrew Clarke as Colin Decker
Christopher Stollery as Dermot McLeod
Elaine Smith as Julie Travers
Nick Carrafa as George Cardillo
Elise McCredie as Sharon Riley
Kristian Pithie as Paul Weiss
Christopher Gabardi as Daniel Ferris
James Reyne as Liam Pearce
Robert Grubb as Hugh Ferrari
Asher Keddie as Claire Ferrari
Paul Cronin as Ted Ames
Jennifer Botica as Liz Mason
Martin Jacobs as Frank Kelso
Alan Dale as Dudley Mills
Richard Moss as Gascoyne
Jerome Pride as Roly Fox
Peter Hosking as Phil Daly
Series overview
Episodes
Episode information retrieved from the Australian Television archive.
Season 1 (1997)
Season 2 (1998)
See also
List of Australian television series
External links
State Coroner at the National Film and Sound Archive
References
1990s Australian drama television series
Network 10 original programming
1997 Australian television series debuts
1998 Australian television series endings
Television series by Crawford Productions |
https://en.wikipedia.org/wiki/IEEE%20802.1AE | IEEE 802.1AE (also known as MACsec) is a network security standard that operates at the medium access control layer and defines connectionless data confidentiality and integrity for media access independent protocols. It is standardized by the IEEE 802.1 working group.
Details
Key management and the establishment of secure associations is outside the scope of 802.1AE, but is specified by 802.1X-2010.
The 802.1AE standard specifies the implementation of a MAC Security Entities (SecY) that can be thought of as part of the stations attached to the same LAN, providing secure MAC service to the client. The standard defines
MACsec frame format, which is similar to the Ethernet frame, but includes additional fields:
Security Tag, which is an extension of the EtherType
Message authentication code (ICV)
Secure Connectivity Associations that represent groups of stations connected via unidirectional Secure Channels
Security Associations within each secure channel. Each association uses its own key (SAK). More than one association is permitted within the channel for the purpose of key change without traffic interruption (standard requires devices to support at least two)
A default cipher suite of GCM-AES-128 (Galois/Counter Mode of Advanced Encryption Standard cipher with 128-bit key)
GCM-AES-256 using a 256 bit key was added to the standard 5 years later.
Security tag inside each frame in addition to EtherType includes:
association number within the channel
packet number to provide unique initialization vector for encryption and authentication algorithms as well as protection against replay attack
optional LAN-wide secure channel identifier (not required on point-to-point links).
The IEEE 802.1AE (MACsec) standard specifies a set of protocols to meet the security requirements for protecting data traversing Ethernet LANs.
MACsec allows unauthorized LAN connections to be identified and excluded from communication within the network. In common with IPsec and TLS, MACsec defines a security infrastructure to provide data confidentiality, data integrity and data origin authentication.
By assuring that a frame comes from the station that claimed to have sent it, MACSec can mitigate attacks on Layer 2 protocols.
Publishing history:
2006 – Original publication (802.1AE-2006)
2011 – 802.1AEbn amendment adds the option to use 256 bit keys to the standard. (802.1AEbn-2011)
2013 – 802.1AEbw amendment defines GCM-AES-XPN-128 and GCM-AES-XPN-256 cipher suites in order to extend the packet number to 64 bits. (802.1AEbw-2013)
2017 – 802.1AEcg amendment specifies Ethernet Data Encryption devices. (802.1AEcg-2017)
2018 – 802.1AE-2018
See also
Kerberos – using tickets to allow nodes communicating over a non-secure network to prove their identity to one another in a secure manner
Virtual LAN (VLAN) – any broadcast domain that is partitioned and isolated in a computer network at the data link layer
IEEE 802.11i-2004 (WPA2)
Wi-Fi Protected Access (WP |
https://en.wikipedia.org/wiki/Josephine%20Teo | Josephine Teo Li Min (née Yong; ; born 1968) is a Singaporean politician who has been serving as Minister for Communications and Information, Minister-in-charge of the Cyber Security Agency and Smart Nation Initiative since 2021 and Second Minister for Home Affairs since 2017. A member of the governing People's Action Party (PAP), she has been the Member of Parliament (MP) representing the Kreta Ayer–Kim Seng division of Jalan Besar GRC since 2020.
Prior to entering politics, Teo had worked at the Economic Development Board (EDB), Agency for Science, Technology and Research (A*STAR) and National Trades Union Congress (NTUC).
She made her political debut in the 2006 general election as part of a five-member PAP team contesting in Bishan–Toa Payoh GRC and won by an uncontested walkover. She has also been serving as Chairwoman of the PAP Community Foundation.
Education
Teo attended Dunman High School and Raffles Junior College before graduating from the National University of Singapore with a Bachelor of Arts degree in 1990 and a Bachelor of Social Sciences with honours degree in 1991.
During her studies in NUS, she was awarded several prizes, including the Rachel Meyer Book Prize, which is awarded to the best-performing female candidate in the Faculty of Arts and Social Sciences' final-year examinations.
She subsequently went on to complete a Master of Science degree in economics at the London School of Economics in 1992 under the Economic Development Board–Glaxo Scholarship Programme.
Early career
Teo worked at the Economic Development Board (EDB) from 1992 to 2002. She began her career in enterprise development before she was posted to Suzhou as part of the EDB team working on the China-Singapore Suzhou Industrial Park, where she was responsible for marketing resources. Upon her return to Singapore, she became the EDB's Head of Human Resources.
From 2002 to 2006, Teo was the Head of Human Resources at the Agency for Science, Technology and Research (A*STAR).
In November 2005, Teo also took on the role of Director of Human Resources at the Administration and Research Unit of the National Trades Union Congress (NTUC). After she was elected to Parliament in 2006, Teo took on additional roles within the NTUC and the labour movement. She served as the Executive Secretary of the Singapore Industrial Services Employees' Union (2006–2011). At the Administration and Research Unit, she served as the Alignment Director (Youth Development) and Alignment Director (Organisation Development) (2007–11), and as the Centric Director (Staff) (2008–2011). She also served as the NTUC's Assistant Secretary-General from 2007 to 2011.
From 2009 to 2011, Teo also served as the Chief Executive Officer of Business China, an organisation aimed at improving cultural and economic ties between Singapore and China.
Political career
Early political career
Teo made her political debut in the 2006 general election when she contested in Bishan–Toa Payoh GRC as par |
https://en.wikipedia.org/wiki/SIC%20Com%C3%A9dia | SIC Comédia was a Portuguese TV channel, available on cable. It was part of the television network SIC (Sociedade Independente de Comunicação). It closed on 31 December 2006.
The channel aired shows such as Seinfeld, The Tonight Show, Late Night with Conan O'Brien, Cheers, The Benny Hill Show, M*A*S*H, Benson, Saturday Night Live, 'Allo 'Allo!, Comedy Inc., Mad About You, Everybody Loves Raymond, Frasier, My Hero, Alas Smith and Jones, The War Next Door. It also showed home-grown products (either reruns from the main channel or original commissions), such as Biqueirada, HermanSic and Prazer dos Diabos.
It is now defunct, because TVCabo, Portugal's main cable provider, decided to drop it despite a petition for it to continue. On TVCabo, Fox Life replaced it, and on TVTEL (another Portuguese cable provider), SIC Mulher got the spot.
History
The channel was announced by SIC in 2000 as SIC Gold as part of the channel's plans to enter the cable television market. The director of programs for the two channels (the other being SIC Radical), Francisco Penim, was appointed on April 14, 2000. The initial purpose of the channel was to carry programming from SIC's archives, similar to what RTP Memória has done since 2004. The channel was set to begin operations on June 26, 2000 but the lack of action from the regulatory body delayed its launch. The channel eventually started broadcasting on June 29, achieving good ratings, equiparable to the most-watched Portuguese-language basic cable channels of the time.
References
Defunct television channels in Portugal
Television channels and stations established in 2004
Television channels and stations disestablished in 2006
2004 establishments in Portugal
2006 disestablishments in Portugal |
https://en.wikipedia.org/wiki/Real-time%20database | Real-time database has two meanings. The most common use of the term refers to a database system which uses streaming technologies to handle workloads whose state is constantly changing. This differs from traditional databases containing persistent data, mostly unaffected by time. When referring to streaming technologies, real-time processing means that a transaction is processed fast enough for the result to come back and be acted on right away. Such real-time databases are useful for assisting social media platforms in the removal of fake news, in-store surveillance cameras identifying potential shoplifters by their behavior/movements, etc.
The second meaning of the term “real-time database” adheres to a stricter definition of real-time consistent with Real-time computing. Hard real-time database systems work with a real-time operating system to ensure the temporal validity of data through the enforcement of database transaction deadlines and include a mechanism (such as transaction scheduling policies) to maximize the number of successfully committed transactions and minimize the number of rolled-back transactions. While the performance metric for most database systems is throughput or transactions-per-second, the performance metric of a hard real-time database system is the ratio of committed-to-aborted transactions. This ratio indicates how effective the transaction scheduling policy is, with the ultimate goal of meeting deadlines 100% of the time. Hard real-time databases, through enforcement of deadlines, may not allow transactions to be late (overrun the deadline).
Overview
Real-time databases are traditional databases that use an extension to give the additional power to yield reliable responses. They use timing constraints that represent a certain range of values for which the data are valid. This range is called temporal validity. A conventional database cannot work under these circumstances because the inconsistencies between the real world objects and the data that represents them are too severe for simple modifications. An effective system needs to be able to handle time-sensitive queries, return only temporally valid data, and support priority scheduling. To enter the data in the records, often a sensor or an input device monitors the state of the physical system and updates the database with new information to reflect the physical system more accurately. When designing a real-time database system, one should consider how to represent valid time, how facts are associated with real-time system. Also, consider how to represent attribute values in the database so that process transactions and data consistency have no violations.
When designing a system, it is important to consider what the system should do when deadlines are not met. For example, an air-traffic control system constantly monitors hundreds of aircraft and makes decisions about incoming flight paths and determines the order in which aircraft should land based on data |
https://en.wikipedia.org/wiki/W23BC | W23BC was a low-power television station in Jackson, Mississippi. The station was owned and operated by Jackson State University. The station carried some programming from America One.
Until April 30, 2007, W23BC carried programming from the Black Family Channel, which folded on that date. The station also carried some programming from Colours TV, a minority television channel that folded in July 2011. It is unknown when the station picked up Colours TV or America One.
The station's license was cancelled on September 24, 2013, due to its failure to file a renewal application. However, it continues to broadcast as JSU TV, and is available only to Xfinity cable subscribers in Hinds, Madison, and Rankin counties.
External links
TV 23 on Twitter
Jackson State University
23BC
Defunct television stations in the United States
Television channels and stations disestablished in 2013
2013 disestablishments in Mississippi
23BC |
https://en.wikipedia.org/wiki/7500 | 7500 may refer to:
The year 7500, in the 8th millennium
ATI Radeon 7500, a computer graphics card series
NVIDIA GeForce 7500, a computer graphics card series
Nokia 7500, a mobile phone released in 2007
Emergency Aviation Transponder code, indicating a possible hijacking
Flight 7500, a 2014 horror film
7500 (film), a 2019 action thriller film |
https://en.wikipedia.org/wiki/Reciprocity%20%28network%20science%29 | In network science, reciprocity is a measure of the likelihood of vertices in a directed network to be mutually linked. Like the clustering coefficient, scale-free degree distribution, or community structure, reciprocity is a quantitative measure used to study complex networks.
Motivation
In real network problems, people are interested in determining the likelihood of occurring double links (with opposite directions) between vertex pairs. This problem is fundamental for several
reasons. First, in the networks that transport information or material (such as email networks, World Wide Web (WWW), World Trade Web, or Wikipedia ), mutual links facilitate the transportation process. Second, when analyzing directed networks, people often treat them as undirected ones for simplicity; therefore, the information obtained from reciprocity studies helps to estimate the error introduced when a directed network is treated as undirected (for example, when measuring the clustering coefficient). Finally, detecting nontrivial patterns of reciprocity can reveal possible mechanisms and organizing principles that shape the observed network's topology.
Definitions
Traditional definition
A traditional way to define the reciprocity r is using the ratio of the number of links pointing in both directions to the total number of links L
With this definition, is for a purely bidirectional network while
for a purely unidirectional one. Real networks have an intermediate value between 0 and 1.
However, this definition of reciprocity has some defects. It cannot tell the relative difference of reciprocity compared with purely random network with the same number of vertices and edges. The useful information from reciprocity is not the value itself, but whether mutual links occur more or less often than expected by chance. Besides, in those networks containing self-linking loops (links starting and ending at the same vertex), the self-linking loops should be excluded when calculating L.
Garlaschelli and Loffredo's definition
In order to overcome the defects of the above definition, Garlaschelli and Loffredo defined reciprocity as the correlation coefficient between the entries of the adjacency matrix of a directed graph ( if a link from i to j is there, and if not):
,
where the average value .
measures the ratio of observed to possible directed links (link density), and self-linking loops are now excluded from L because of i not equal to j.
The definition can be written in the following simple form:
The new definition of reciprocity gives an absolute quantity which directly allows one to distinguish between reciprocal () and antireciprocal () networks, with mutual links occurring more and less often than random respectively.
If all the links occur in reciprocal pairs, ; if r=0, .
This is another advantage of using , because it incorporates the idea that complete antireciprocal is more statistical significant in the networks with larger density, while it has to |
https://en.wikipedia.org/wiki/.sol | .sol can refer to:
sol (format), a file format for presenting solutions of mathematical programming problems
Local shared object
Solidity .sol source file for smart contracts that run on the Ethereum Virtual Machine |
https://en.wikipedia.org/wiki/Computer%20Blue | "Computer Blue" is a song by Prince and The Revolution. Released on June 25, 1984, it is the fourth track on Prince's sixth album, Purple Rain, which also served as the soundtrack to the film of the same name. In the film, the song represents Prince's character's angst at the budding relationship between the characters played by Morris Day and Apollonia, the latter of whom he desires, and he performs it in front of the two during The Revolution's set at a nightclub with the aim of upsetting them. The song was composed by Prince with credit to his father, John L. Nelson, for the guitar solo based on a piano instrumental written by Nelson and Prince. He titled the instrumental piece "Father's Song" and recorded it on piano for the film, though onscreen it was portrayed as being played by Prince's character's father, played by Clarence Williams III. On the box-set Purple Rain Deluxe (2017), a different and longer recording of "Father's Song" was included.
"Computer Blue" was originally recorded at The Warehouse in Minneapolis with The Revolution a day after "Let's Go Crazy", and was later overdubbed at Sunset Sound in Los Angeles in August 1983. Prince, along with Wendy & Lisa and sound engineer Susan Rogers, set about doing further work on what would later end up being placed on the album Purple Rain, albeit in a very heavily edited form. The song begins with spoken lyrics by Wendy & Lisa which suggest a dominatrix-type relationship. The song then explodes into an experimental rock number with screaming, heavy synths, distorted guitars, and lyrics about the relationship between humans and computers. The released version has only one verse; the version that debuted at the First Avenue nightclub had a second verse, as did the song when it was originally recorded, and this original recording (later released as the "Hallway Speech" version) lasts for over 12 minutes.
Outtake
Originally conceived as a 14-minute opus, "Computer Blue" would later be edited down several times for inclusion on Purple Rain. The song was edited from a fully-mastered 7:30 down to its current length when "Take Me with U" was added to the album at the last minute. The full-length version of the song contains extended instrumental solos and additional lyrics. Also present is a repeated synthesizer segment with a sing-a-long chant, which was often played in live versions of the song. The synth part, without the vocals, made it into the film Purple Rain during a scene in which the Revolution rehearses while waiting for Prince to arrive. The track ends with three full minutes of screeching feedback. A shorter version, 12 minutes in length, was the one edited down to the album's version, and the feedback from this version forms the segue into "Darling Nikki" on Purple Rain itself. Widely regarded by hardcore Prince fans as a masterpiece, the original unedited recording features the infamous "Hallway Speech" (as termed by fans) about emotions likened to different rooms. During the P |
https://en.wikipedia.org/wiki/KNIC-DT | KNIC-DT (channel 17) is a television station licensed to Blanco, Texas, United States, broadcasting the Spanish-language UniMás network to the San Antonio area. It is owned and operated by TelevisaUnivision alongside Univision outlet KWEX-DT (channel 41). Both stations share studios on Network Boulevard in Northwest San Antonio, while KNIC's transmitter is located on Hogan Drive in Timberwood Park. Although Blanco is geographically within the Austin market, that city has its own UniMás station, KTFO-CD.
History
KNIC-DT's history traces back to the March 1991 sign-on of K17BY, a low-power television station that San Antonio-based Clear Channel Communications (now iHeartMedia) was issued a construction permit to build on March 23, 1988; operating on UHF channel 17, Clear Channel sold the station in March 1991 to Nicolas Communications. In November 1997, the station changed its calls to KNIC-LP (in reference to its owners); Nicolas Communications sold KNIC-CA in November 2001 (the station received approval to upgrade its license to Class A status that same month) to Univision Communications, a sale that was completed in January 2002; that month, it became a charter affiliate of Univision's secondary network, TeleFutura (which relaunched as UniMás on January 7, 2013).
Univision had applied for a license to build a full-power television station in 2000 on UHF channel 52 in Blanco; after the Federal Communications Commission awarded Univision the license at auction, Univision requested that the FCC move the allocation to UHF channel 17; the request was granted in February 2003. KNIC-TV was founded on July 13, 2005. The formal application for KNIC-TV called for Univision to either move KNIC-CA to another channel, or to shut it down outright, KNIC-CA moved to channel 34 under special temporary authorization, before it ceased operations on September 28, 2006; its license survives as KCOR-CD, a translator of KNIC-DT. KNIC-DT was one of the few television stations to have been built and signed on by Univision Communications.
Technical information
Subchannels
The station's digital signal is multiplexed:
Analog-to-digital conversion
Because it was granted an original construction permit after the FCC finalized the DTV allotment plan on April 21, 1997 , the station did not receive a companion channel for a digital television station. KNIC-TV discontinued regular programming on its analog signal, over UHF channel 17, on June 12, 2009. The station "flash-cut" its digital signal into operation UHF channel 18, using PSIP to display the station's virtual channel as its former UHF analog channel 17.
References
Television channels and stations established in 2006
UniMás network affiliates
Ion Mystery affiliates
Laff (TV network) affiliates
KNIC-DT
Spanish-language television stations in Texas
2006 establishments in Texas |
https://en.wikipedia.org/wiki/Combinator%20library | A combinator library is a software library which implements combinators for a functional programming language; "the key idea is this: a combinator library offers functions (the combinators) that combine functions together to make bigger functions". These kinds of libraries are particularly useful for allowing domain-specific programming languages to be easily embedded into a general purpose language by defining a few primitive functions for the given domain and turning over the task of expanding higher-level constructs to the general language. An example would be the monadic Parsec parser for Haskell. The library approach allows the parsers to be first-class citizens of the language.
See also
Run-time system
QuickCheck
Point-free style programming
References
External links
Application programming interfaces |
https://en.wikipedia.org/wiki/Sequential%20access%20memory | In computing, sequential access memory (SAM) is a class of data storage devices that read stored data in a sequence. This is in contrast to random access memory (RAM) where data can be accessed in any order. Sequential access devices are usually a form of magnetic storage or optical storage.
While sequential access memory is read in sequence, arbitrary locations can still be accessed by "seeking" to the requested location. This operation, however, is often relatively inefficient (see seek time, rotational latency).
Magnetic sequential access memory is typically used for secondary storage in general-purpose computers due to their higher density at lower cost compared to RAM, as well as resistance to wear and non-volatility. Magnetic tape is a type of sequential access memory still in use; historically, drum memory has also been used.
See also
Sequential access
Basic sequential access method (BSAM)
Queued sequential access method (QSAM)
Secondary storage
Hard disk drive
Solid state drive
Magnetic storage
Magnetic tape
Drum memory
Locality of reference
Streaming media
References
Computer memory |
https://en.wikipedia.org/wiki/EenVandaag | EénVandaag (OneToday) is a current affairs programme broadcast on the Dutch public television network NPO 1 (formerly Nederland 1), The programme, which airs on Monday to Saturday evenings at 6:15pm CET is a co-production of the broadcasting associations AVRO and TROS, and since 2014 AVROTROS.
Eén Vandaag initially aired on Nederland 2 as Twee Vandaag and was launched in 1993 as a joint-production between the pillar broadcasters TROS, the EO and Veronica. Up until that point, the three companies had produced their own weekly current affairs programmes - TROS Aktua, Tijdsein (EO) and Nieuwslijn (Veronica). Since then, the roll-call of participating broadcasters has changed several times. Currently, the programme is presented on alternate nights by Bas van Werven (originalfrom TROS) and Pieter Jan Hagens (original from AVRO). The programme's editor-in-chief is Jan Kriek.
EénVandaag is also broadcast each weekday on the international television station BVN.
Dossier EenVandaag
Since 2014 EenVandaag has also a spin off called Dossier EenVandaag that will be broadcast irregular, the concept is that questions were answered by Jan Born and Sander 't Sas, the emphasis is on criminality, corruption and secret documents leaked by whistleblowers.
Opinion panel
A recurring feature of the program is the Opinion Panel, a group of over 35,000 viewers who are regularly asked, via the Internet, for their opinion on current topics. This makes it one of the largest opinion panels in the Netherlands.
Politician of the year
In December 2004 the members of the opinion panel (together with members of parliament), were asked to choose their "politician of the year". Each group was asked to rank both the best and the worst politicians.
The parliamentarians chose as their best politician the Socialist Party leader Jan Marijnissen, followed by CDA leader (and Prime Minister at the time) Jan Peter Balkenende, followed by Wouter Bos (leader of the PvdA). As worst politician they chose Rita Verdonk, describing her as an "elephant in a china cabinet" (a Dutch expression meaning ruthless and incompetent). Geert Wilders and Mark Rutte are also elected to the Politician of the Year.
The members of the opinion panel also selected Marijnissen as best politician, but chose Bos as the worst. Remarkably, Verdonk appeared in second place and Balkenende in third on both the best and the worst lists.
Presenters and editors
Current
Jan Kriek (editor-in-chief)
Bas van Werven (presenter)
Pieter Jan Hagens (presenter)
Rik van de Westelaken (presenter)
Former
Peter Beker (EO; editor in chief)
Tijs van den Brink (EO; presenter)
Pieter Jan Hagens (AVRO; presenter)
Jaap Jongbloed (TROS; presenter)
Klaas Samplonius (TROS; editor in chief)
Jeroen Snel (EO; presenter)
André Zwartbol (EO; presenter)
Antoinette Hertsenberg (TROS)
External links
Dutch television news shows
1993 Dutch television series debuts
1990s Dutch television series
2000s Dutch television series
2010s Du |
https://en.wikipedia.org/wiki/Flemish%20Secession%20hoax | or Bye Bye Belgium, also called "The Flemish Secession Hoax," was a hoax perpetrated by the French-language Belgian public TV station RTBF on Wednesday, December 13, 2006. Regular programming on the channel La Une was interrupted for a news bulletin claiming that the Flemish parliament had issued a unilateral declaration of independence from the Kingdom of Belgium, mimicking the Belgian secession from the Netherlands some 175 years earlier.
Interviews with prominent Belgian politicians (some of whom had been informed about the hoax) as well as staged footage of the evacuation of the royal family as well as cheering crowds holding the Flag of Flanders were included so as to add credence to the news report.
The broadcast of the report led to widespread alarm and consternation in French-speaking Belgium. A hotline set up by the station was swamped by 2,600 calls, whilst RTBF's website crashed. Thirty minutes into the broadcast, on demand of the media minister of the French-speaking community in Belgium, , an on-screen message identified it as fiction.
The hoax was the creation of the journalist and had been prepared over a period of 2 years under the codename BBB for Bye-bye Belgium. Its goal was to show Belgians the intensity of the country's issue, and the real possibility of a split of Belgium. In the years coming to the hoax there was rising Flemish separatism and the Vlaams Belang party received strong support in the regional elections.
Prominent Belgian politicians, including Prime Minister Guy Verhofstadt, Flemish Minister-President Yves Leterme and Walloon Minister-President Elio Di Rupo, condemned the report as "irresponsible." International reaction included an angry statement by Jean-Claude Juncker, Prime Minister of Luxembourg, who said, "This is not the kind of issue you play around with."
See also
Partition of Belgium
References
External links
BBC news report
Belgian viewers fall for TV hoax announcing breakaway state, International Herald Tribune article documenting the hoax.
RTBF's website (in French).
Journalistic hoaxes
Flanders
Hoaxes in Belgium
2006 hoaxes
2006 in Belgian television
Television controversies in Belgium
Political controversies in television
Secession |
https://en.wikipedia.org/wiki/Global%20Information%20Network | Global Information Network, Ltd. or GIN, incorporated in 1986, is an independent, New York domestic non-profit news organization with an office in New York City that gathers and disseminates news from reporters in the field in Africa. It supplies news, analysis, and features to over 300 ethnic and minority newsweeklies nationwide. Its stories have appeared in print, broadcast and web media in the U.S.
Its executive director is Lisa Vives. The mission of the GIN news service is to give information on global issues that are overlooked or under-reported by mainstream media.
The Inter Press Service (IPS), an international newswire made up of journalists, academics, communications experts and specialists in international cooperation, that spotlights the developing world, is a news partner of GIN.
The agency's World Service covers over 150 countries and is produced in English and Spanish, with selected stories translated into eleven languages. The daily output is around 112,000 words. In addition to the news service, it provides a radio service and a columnist service, with columns written by statesmen/women, officials, opposition leaders and opinion-makers. Columnists have included Kofi Annan, the Dalai Lama, Bill Clinton, Mikhail Gorbachev and others. The trustees of the IPS include Boutros Boutros-Ghali (former UN Secretary General), Martti Ahtisaari (former President of Finland), I.K. Gujral (former Prime Minister of India) and Mário Soares (former President of Portugal).
Stories written for GIN have been picked up by IPS, and have been featured as lead articles on the IPS home page (www.ipsnews.net) and been distributed across the world in United Nations journals, radio stations in Latin America, Africa and Asia, and hundreds of international publications.
In addition to its role as news distributor, it produces a weekly Africa News Briefs bulletin and is a monthly host of African roundtable conferences that present human rights journalists honored by organizations such as the to Protect Journalists, PEN, the international writers' organization and The UN Human Rights Committee.
References
News agencies based in the United States |
https://en.wikipedia.org/wiki/Open%20Regulatory%20Annotation%20Database | The Open Regulatory Annotation Database (also known as ORegAnno) is designed to promote community-based curation of regulatory information. Specifically, the database contains information about regulatory regions, transcription factor binding sites, regulatory variants, and haplotypes.
Overview
Data Management
For each entry, cross-references are maintained to EnsEMBL, dbSNP, Entrez Gene, the NCBI Taxonomy database and PubMed. The information within ORegAnno is regularly mapped and provided as a UCSC Genome Browser track. Furthermore, each entry is associated with its experimental evidence, embedded as an Evidence Ontology within ORegAnno. This allows the researcher to analyze regulatory data using their own conditions as to the suitability of the supporting evidence.
Software and data access
The project is open source - all data and all software that is produced in the project can be freely accessed and used.
Database contents
As of December 20, 2006, ORegAnno contained 4220 regulatory sequences (excluding deprecated records) for 2190 transcription factor binding sites, 1853 regulatory regions (enhancers, promoters, etc.), 170 regulatory polymorphisms, and 7 regulatory haplotypes for 17 different organisms (predominantly Drosophila melanogaster, Homo sapiens, Mus musculus, Caenorhabditis elegans, and Rattus norvegicus in that order). These records were obtained by manual curation of 828 publications by 45 ORegAnno users from the gene regulation community. The ORegAnno publication queue contained 4215 publications of which 858 were closed, 34 were in progress (open status), and 3321 were awaiting annotation (pending status). ORegAnno is continually updated and therefore current database contents should be obtained from www.oreganno.org.
RegCreative Jamboree 2006
The RegCreative jamboree was stimulated by a community initiative to curate in perpetuity the genomic sequences which have been experimentally determined to control gene expression. This objective is of fundamental importance to evolutionary analysis and translational research as regulatory mechanisms are widely implicated in species-specific adaptation and the etiology of disease. This initiative culminated in the formation of an international consortium of like-minded scientists dedicated to accomplishing this task. The RegCreative jamboree was the first opportunity for these groups to meet to be able to accurately assess the current state of knowledge in gene regulation and to begin to develop standards by which to curate regulatory information.
In total, 44 researchers attended the workshop from 9 different countries and 23 institutions. Funding was also obtained from ENFIN, the BioSapiens Network, FWO Research Foundation, Genome Canada and Genome British Columbia.
The specific outcomes of the RegCreative meeting to date are:
Prior to the RegCreative Jamboree, attendees were asked to participate in an interannotator agreement assessment. Two ORegAnno mirrors were |
https://en.wikipedia.org/wiki/IBM%20storage | The IBM Storage product portfolio includes disk, flash, tape, NAS storage products, storage software and services. IBM's approach is to focus on data management.
Software
IBM Spectrum Storage
IBM Spectrum Storage portfolio can centrally manage more than 300 different storage devices and yottabytes of data.
IBM Spectrum Accelerate
The functionality of Spectrum Accelerate is based on the IBM XIV, a high-end disk storage system. IBM Spectrum Accelerate and XIV run the same base software stack and interoperate with features such as management, remote replication and volume mobility.
IBM Spectrum Scale
IBM Spectrum Scale is software-defined storage for cloud and analytics.
The product is very widely used in both commercial and academic environments. It has a history going back to the mid 1990s. It was known as GPFS before IBM re-branded all storage products in 2015.
IBM Spectrum Virtualize
IBM Spectrum Virtualize is a block storage virtualization system. Because the IBM Storwize V7000 uses SVC code, it can also be used to perform storage virtualization in exactly the same way as SVC. Since mid-2012 it offers real time compression with no performance impact, saving up to 80% of disk utilization. SVC can be configured on a Stretched Cluster Mode, with automatic fail over between two data centers, and can have SSD that can be used by EasyTier software to perform sub-LUN automatic tearing.
IBM Spectrum Control
IBM Spectrum Control provides infrastructure management for virtualized, cloud and software-defined storage.
IBM Spectrum Protect
IBM Spectrum Protect is a progression of the Tivoli Storage Management product.
IBM Spectrum Archive
IBM Spectrum Archive allows users to run any application designed for disk files against tape data without concern for the fact that the data is physically stored on tape.
IBM offers four options:
IBM LTFS Single Drive Edition access and manage data on a standalone tape drive as if the data were on disk
IBM LTFS Library Edition access and manage data on single or multiple cartridges in a tape library
IBM LTFS Storage Manager manage both online and offline files in IBM tape libraries
IBM LTFS Enterprise Edition run applications designed for disk files from tape storage
IBM SmartCloud Storage Access
IBM SmartCloud Storage Access is a software application designed to create a private cloud storage service on existing storage devices. The software can be configured to allow users self-service, Internet-based access for account creation, storage provisioning and file management. The software offers simple management with monitoring and reporting capabilities, including storage usage by user and group definitions.
Active Cloud Engine
The Active Cloud Engine (ACE) is a form of multiple site replication. ACE is designed to allow different types of cloud implementations to exchange data dynamically. ACE is designed to extend the SONAS capability for a single, centrally managed namespace, to a truly distribut |
https://en.wikipedia.org/wiki/Trans7 | PT Duta Visual Nusantara Tivi Tujuh, operating as Trans7 or TRANS7 in all capitals (pronounced Trans Tujuh in Indonesian, formerly known as TV7) is an Indonesian free-to-air television network owned by Trans Media, a part of Trans Corp, which in turn a subsidiary of CT Corp. For the first time, Trans7 was the official broadcaster of 2018 FIFA World Cup together with the sister channel Trans TV, also with Telkom Indonesia, K-Vision and MNC Media (MNC Vision only). Trans7 had broadcast 8 group-stage matches as well as shared broadcasting of quarterfinal, semifinal, 3rd place playoff, and final matches from Trans TV, also from UseeTV (now IndiHome TV), K-Vision, and MNC Sports.
The channel was officially launched as TV7 on 25 November 2001 at 5:00 PM local time. The final transmission and broadcast aired on 15 December 2006 at 19:00 WIB. The network was then sold by Kompas Gramedia Group and the new owners changed the name from TV7 to Trans7.
History
Trans7 was established as TV7 based on issuance of a permit by Department of Trade and Industry in Central Jakarta (No. 809/BH.09.05/III/2000). 80% of its share is largely owned by Kompas Gramedia Group. On 25 November 2001, the existence of TV7 was published in State Gazette No. 8687 as PT Duta Visual Nusantara Tivi Tujuh. The logo itself is the letters "JO", which stands for Jakob Oetama (1931-2020), the co-founder of Kompas Gramedia Group. The logo is also loosely based on the Circle 7 logo that used by the American broadcast network ABC for its several owned-and-operated and affiliated stations.
Iraq invasion coverage
In the first quarter of 2003, TV7 aired daily relays of Al Jazeera during the U.S. invasion of Iraq through a news program titled Invasi ke Irak (Invasion to Iraq). In response, rival broadcaster ANTV started relaying Al Arabiya's coverage of the invasion.
Indonesian society, in general, welcomed TV7's actions, especially with those who disagreed with the Western media's side of the events. Despite rumors that then-president Megawati Soekarnoputri urged TV7 to stop the relay broadcasts of Al Jazeera, PR TV7 at the time, Uni Lubis, denied it. Even, she asserted that the relays were continued and disturbances in the relay could be resolved.
Re-launch as Trans7
On 4 August 2006, CT Corp via Trans Corp authorized to buy a 55% stake in PT Duta Visual Nusantara Tivi Tujuh (as it noted in the book titled Chairul Tanjung si Anak Singkong; lit.: Chairul Tanjung the Cassava Boy). In conjunction with Trans TV's 5th anniversary on 15 December 2006 at 19:00 local time, the channel was rebranded as Trans7, making it the second CT Corp owned television network. With the buyout and relaunch, the network moved its office to Trans TV's offices.
Since 2 November 2022, Trans7 was terminated and stop of Analog transmission operation from Jakarta and its surrounding areas and switch over to Digital transmission by TransTV Jakarta operation during Modi countdown to midnight special coverage. since |
https://en.wikipedia.org/wiki/Visual%20sensor%20network | A visual sensor network or smart camera network or intelligent camera network is a network of spatially distributed smart camera devices capable of processing, exchanging data and fusing images of a scene from a variety of viewpoints into some form more useful than the individual images. A visual sensor network may be a type of wireless sensor network, and much of the theory and application of the latter applies to the former. The network generally consists of the cameras themselves, which have some local image processing, communication and storage capabilities, and possibly one or more central computers, where image data from multiple cameras is further processed and fused (this processing may, however, simply take place in a distributed fashion across the cameras and their local controllers). Visual sensor networks also provide some high-level services to the user so that the large amount of data can be distilled into information of interest using specific queries.
The primary difference between visual sensor networks and other types of sensor networks is the nature and volume of information the individual sensors acquire: unlike most sensors, cameras are directional in their field of view, and they capture a large amount of visual information which may be partially processed independently of data from other cameras in the network. Alternatively, one may say that while most sensors measure some value such as temperature or pressure, visual sensors measure patterns. In light of this, communication in visual sensor networks differs substantially from traditional sensor networks.
Applications
Visual sensor networks are most useful in applications involving area surveillance, tracking, and environmental monitoring. Of particular use in surveillance applications is the ability to perform a dense 3D reconstruction of a scene and storing data over a period of time, so that operators can view events as they unfold over any period of time (including the current moment) from any arbitrary viewpoint in the covered area, even allowing them to "fly" around the scene in real time. High-level analysis using object recognition and other techniques can intelligently track objects (such as people or cars) through a scene, and even determine what they are doing so that certain activities could be automatically brought to the operator's attention. Another possibility is the use of visual sensor networks in telecommunications, where the network would automatically select the "best" view (perhaps even an arbitrarily generated one) of a live event.
See also
Wireless sensor network
Computer vision
Smartdust
Smart camera
Sensor fusion
References
^ Cheng Qian, Hairong Qi: Coverage Estimation in the Presence of Occlusions for Visual Sensor Networks. DCOSS 2008: 346–356
^ Soro S., Heinzelman W.: A Survey of Visual Sensor Networks, Advances in Multimedia, vol. 2009, Article ID 640386, 21 pages, 2009.
^ Yang Bai, Hairong Qi: Feature-Based Image Comparison for |
https://en.wikipedia.org/wiki/Grace%20Covenant | Grace Covenant (officially Grace Covenant International), a non-denominational network or "family" of Christian churches, missionaries and ministries founded in 1995, was created to offer relationship and accountability and "connection without control" for ministries. Constituent ministries maintain local autonomy, boards and a variety of styles, but share a unified vision of reaching the world for Christ. Member congregations and ministries consider themselves "interdependent", rather than independent; and appreciate the fourfold ministry focus: Evangelism, church planting, World Missions, and Spiritual Renewal.
Grace Covenant, in its core beliefs, is evangelical and open to the Spirit, embracing the balance of "Word and Power".
Currently there are churches in California, Washington, and Missouri; as well as parachurch ministries under GCI's covering. Mission works exist in the Dominican Republic, Paraguay, Peru, The Bahamas and Spain. GCI's Ministry Skills Institute offers practical ministry equipping through regional training conferences, Individual Training Tracks, Correspondence Courses, and other ministry resources. Grace Covenant continues to develop new works of ministries in the United States and around the world; and is especially open to adopting like-minded ministries into the ministry family.
Heart values
Grace Covenant's official "heart values":
The Ministry of Jesus is the focus of the Church.
Worship is central in honoring and engaging our relationship.
Jesus is the Head of the Church.
The Word of God is central to faith and practice.
The Holy Spirit is the Church’s source (force) for comfort, guidance, renewal, power, service and evangelism with the Heavenly Father and provides an atmosphere for ministry.
The Fruit of the Spirit is the heart nature of the Church.
The Gifts of the Spirit are the ministry tools of the Church.
Ministry flows naturally through relationships.
Spiritual relationships provide mutual support, accountability and ministry impact.
God has called believers to be Kingdom minded, fulfilling our specific role in the Body, while affirming, assisting and laboring with other parts of His Body, for greater Kingdom work.
Believers are called to be culturally relevant, which is identifying and posturing ourselves with people as to meet their needs in the Name of Jesus.
The disciple of Jesus has a heart full of compassion and service toward the poor, orphaned, widowed and oppressed.
Ministry involves commitment to small groups.
External links
Grace Covenant official website
Non-denominational Evangelical unions
Emerging church movement |
https://en.wikipedia.org/wiki/Atari%20Program%20Exchange | Atari Program Exchange (APX) was a division of Atari, Inc. that sold software via mail-order for the Atari 8-bit family of home computers from 1981 until 1984. Quarterly APX catalogs were sent to all registered Atari 8-bit owners. APX encouraged any programmer, not just professionals, to submit video games, educational software, applications, and utilities. If selected, a program was added to the catalog with credit given to the programmer. The top submissions of the quarter in each category were recognized. One program each year received the top honor: the Atari Star award. Several APX titles, such as Eastern Front (1941), Caverns of Mars, and Atari Star winner Typo Attack, were moved to Atari's official product line. A few internally developed Atari products were sold through APX, such as Atari Pascal and the developer handbook De Re Atari.
The brainchild of Dale Yocum, the Atari Program Exchange started in February 1981. In 1982 its management was taken over by Fred Thorlin, who operated it until it closed. APX published quarterly catalogs until 1984, when new Atari CEO James J. Morgan closed down the mail-order division. Some APX software was later picked up by Antic Software and branded as "APX Classics".
History
When Atari first launched the Atari 8-bit family in late 1979, the company kept most of the hardware details secret. It intended to be the primary supplier of software for the platform, as had been the case with the Atari Video Computer System console. By the end of the first year on the market increasingly sophisticated applications from outside Atari were nonetheless becoming available. There were, however, a limited number of distribution channels at the time.
Dale Yocum approached Atari with the idea of setting up their own third-party publishing arm. With Atari's distribution capabilities the products would be seen by many more prospective customers, and at the same time, Atari would make money with every sale, money that would otherwise be lost. Chris Crawford later stated:
Catalogs
Atari mailed catalogs to all computer owners who sent in warranty cards. The first issue of the catalog, dated summer 1981, stated that while "Atari offers a wide variety of useful and entertaining software ... we've come across other interesting software deserving public recognition ... [APX] will make such software available quickly and inexpensively ... We'll keep costs down [by using] simple packaging and we'll rely on user-written documentation ... What we'll offer, then, is a lot of interesting software quickly and inexpensively".
The quarterly publication included descriptions and screenshots of each program, and advertisements for computer magazines. Other products sold included the book De Re Atari and various peripherals. Many APX programs were games, but it distributed a wide variety of applications, utilities, programming tools, and educational software.
Discontinuation
According to Atari CEO James Morgan, APX was losing money in |
https://en.wikipedia.org/wiki/ESPN2%20Garage | ESPN2 Garage was a new ninety-minute programming block dedicated to the automotive and motorsports world on ESPN2. Debuting Saturday, January 6, 2007, the programming will air on ESPN2 from 5pm ET to 6:30pm ET on weekdays, from 10am ET to 12pm ET on Saturdays and from 10am ET to 11am ET on Sundays. This programming block will be the preceding the new daily automotive news and analysis program, NASCAR Now.
ESPN2 Garage programming will cover topics ranging from car preparation (Matching Numbers, Garage Wars), automotive auctions (The Bidding Wars, RM Classic Car Auctions), how-to help (Import Racers, GearZ), racing programs (Race Wizard with Ray Evernham, Michael Waltrip Racing: A New Era), automotive entertainment/reality (P.I.P.E.S., King of the Street) and even an animated series about a family of motorsports fans entitled The Pits.
Programs
Autotrader.com DRIVE in HD
(Times TBD)
Former Motor Trend magazine editor C. Van Tune and others will take viewers behind the scenes at the top auto shows in the United States. Hosts will analyze the latest models, concept cars and other automotive industry innovations at shows in Los Angeles, Detroit, Chicago and New York.
The Bidding Wars
(2nd quarter, Sunday, 10 a.m.)
Focuses on car auctions from the buyers, sellers and auction officials’ points of view. These colorful characters are followed until the final two bidders on a car battle it out.
Chopper Nation
(1st quarter, Saturday, 10:30 a.m.)
For motorcycle enthusiasts, a series dedicated the world of choppers and v-twin cruiser motorcycles with profiles on custom builders, the top motorcycle rallies and more.
Funk Master Flex's Car Wars
(2nd quarter, Saturday 10:30 a.m., Monday 6 p.m.)
Amateur customizers prepare their cars for one of Funkmaster Flex's car shows. Contestants put everything on the line (second mortgage, rent money, etc.) to win and deal with the stress and realities of competition. Flex, one of the nation’s most well-known radio personalities, helps them along.
Garage Wars
(4th quarter, Saturday 10 a.m.)
A non-stop, deadline-driven show. In each episode, a real mechanic and a “crew” of four regular guys (the contestants) are pitted against a similar group. With three days and $10,000 to spend, each team has to design, find parts for, and then build their racer from the ground up.
GearZ
(2nd quarter, Saturday 10 a.m.)
Hosted by Stacey David (previously on Spike's popular and highly rated series Trucks!), Gearz is an entertaining how-to program that will focus on trucks, hot rods and other rides. Each episode will include David completing a high-end build and then taking it out on the road, off-road or in the mud for a true test drive.
Import Racers
(1st quarter, Monday, 5 p.m.)
A series dedicated to the turbocharged world of import tuner cars including sport compact drag racing and drifting. Import tuner racing/customizing is one of the fastest-growing and most popular forms of motorsports among the youth of America..
King of t |
https://en.wikipedia.org/wiki/Snap%20Server | The Snap Server is a network attached storage computer appliance sold since 2008 by Overland Storage. From 2002 to 2004 it was sold by a company called Snap Appliance.
Description
All modern Snap Servers include an embedded operating system called GuardianOS. The GuardianOS is a UNIX-like operating system based on the mainstream Linux kernel, and is used on the Snap Server line of network-attached storage devices. Older models used the SnapOS, which is a heavily customized BSD flavor. The SnapOS was originally created by Meridian Data for the Meridian Data Snap! Server, and shipped on products from May 1998 through February 2006.
Quantum had shipped more than 90,000 Snap Servers as of
December 31, 2001. , an estimated 150,000 Snap Servers had been sold. Many Snap Servers are visible operating on the open Internet, although it is generally more common for them to be deployed inside corporate intranets.
History
The ownership of the Snap Appliance product family went through several corporate mergers.
Meridian Data (founded in 1994 as Parallan Computer, based in Scotts Valley, California) had been shipping CD-ROM servers, which was a shrinking market in the late 1990s. In 1996 it started development of a network file server which it announced at the DEMO conference in February 1998.
In May 1998 Meridian Data began shipping the Meridian Data Snap! Server.
On May 10, 1999, Meridian agreed to be acquired by Quantum Corp. in a stock swap.
In December 1999 the deal closed, worth an estimated $85 million.
In October 2002 Quantum's Snap division was purchased by private investors for about $11 million, forming Snap Appliance.
In July 2004 Snap Appliance was purchased by Adaptec for about $100 million.
In July 2008 Overland Storage acquired the Snap server product line from Adaptec for $3.6 million.
References
External links
Snap Server web page
Overland Snap Server Product Specifications
Snap OS defined
Server appliance
Computer-related introductions in 1998 |
https://en.wikipedia.org/wiki/Dispose%20pattern | In object-oriented programming, the dispose pattern is a design pattern for resource management. In this pattern, a resource is held by an object, and released by calling a conventional method – usually called close, dispose, free, release depending on the language – which releases any resources the object is holding onto. Many programming languages offer language constructs to avoid having to call the dispose method explicitly in common situations.
The dispose pattern is primarily used in languages whose runtime environment have automatic garbage collection (see motivation below).
Motivation
Wrapping resources in objects
Wrapping resources in objects is the object-oriented form of encapsulation, and underlies the dispose pattern.
Resources are typically represented by handles (abstract references), concretely usually integers, which are used to communicate with an external system that provides the resource. For example, files are provided by the operating system (specifically the file system), which in many systems represents open files with a file descriptor (an integer representing the file).
These handles can be used directly, by storing the value in a variable and passing it as an argument to functions that use the resource. However, it is frequently useful to abstract from the handle itself (for example, if different operating systems represent files differently), and to store additional auxiliary data with the handle, so handles can be stored as a field in a record, along with other data; if this in an opaque data type, then this provides information hiding and the user is abstracted from the actual representation.
For example, in C file input/output, files are represented by objects of the FILE type (confusingly called "file handles": these are a language-level abstraction), which stores an (operating system) handle to the file (such as a file descriptor), together with auxiliary information like I/O mode (reading, writing) and position in the stream. These objects are created by calling fopen (in object-oriented terms, a constructor), which acquires the resource and returns a pointer to it; the resource is released by calling fclose on a pointer to the FILE object. In code:
FILE *f = fopen(filename, mode);
// Do something with f.
fclose(f);
Note that fclose is a function with a FILE * parameter. In object-oriented programming, this is instead an instance method on a file object, as in Python:
f = open(filename)
# Do something with f.
f.close()
This is precisely the dispose pattern, and only differs in syntax and code structure from traditional file opening and closing. Other resources can be managed in exactly the same way: being acquired in a constructor or factory, and released by an explicit close or dispose method.
Prompt release
The fundamental problem that freeing resources aims to solve is that resources are expensive (for example, there may be a limit on the number of open files), and thus should be released promptly |
https://en.wikipedia.org/wiki/NOC%20at%20Georgia%20State%20University | The Network Operations Center (or NOC) at Georgia State University (renamed the Technology Operations Center/TOC in 2007) is a showcase facility in downtown Atlanta, Georgia. It is staffed and managed 24x7x365 by the university's Information Systems & Technology (IS&T) department and is part of IS&T's Technology Infrastructure division. A staff of 16 technicians provide monitoring and troubleshooting of network services and environmental control systems such as HVAC and power. The TOC technicians are also in charge of racking all devices, providing power and network connectivity to hosts, and after-hours Help Center support for the university.
The GSU TOC has been an environmentally "green" facility since 2003. There are no batteries used anywhere in the delivery of protected power to the approximately 500 hosts and servers housed in the NOC. Protected power is provided by a 300 kVA (250 KW) CAT-branded Active Power flywheel/generator system and three ActivePower CoolAir DC UPS units (2 are 100 kVA (80 KW) and 1 is 80 kVA (40 KW)).
During the Fall of 2006, the Georgia State University underwent a US$4,000,000 network renovation where all of the networking equipment across the campus was upgraded and replaced without any detectable downtime to the delivery of campus network services of the TOC facility. This network upgrade has been done in preparation of a new AVAYA IP Telephony (IPT or VoIP) system that replaced the university's analog POTS telecommunications system in the summer of 2007.
GSU's TOC is home to the GALILEO Interconnected Libraries, the New Georgia Encyclopedia, the online presence of the Jimmy Carter Library, and three SURAGrid-networked IBM P575 Supercomputers.
The facility has been the subject of presentations at several national AFCOM conferences as well as three virtual tours hosted by AFCOM.
News articles
http://www.energyvortex.com/pages/headlinedetails.cfm?id=2393 Georgia State University's Network Operations Center Selects CoolAir Back-Up Power Solution
http://www.activepower.com/markets/data-center.html Data Center
https://web.archive.org/web/20061013172941/http://www2.gsu.edu/~wwwexa/news/archive/general/06_0831-computergrid.htm Southern Schools Form Computer Grid
http://midmarket.eweek.com/article/University+Breaks+All+the+Storage+Rules/217131_1.aspx University Breaks All the Storage Rules, eWeek Magazine
http://www.networkworld.com/news/2007/092007-data-center-overcrowding.html?page=3 IT Grapples with Overcrowded, Energy-guzzling Data Centers, Network World
References
External links
Division of Information Systems and Technology (IS&T)
Network management |
https://en.wikipedia.org/wiki/Retrospect%20%28Star%20Trek%3A%20Voyager%29 | "Retrospect" is the 85th episode of the American science fiction television series Star Trek: Voyager, airing on the UPN network. It is the 17th episode of the fourth season.
In this episode, Voyagers Doctor helps Seven of Nine interpret repressed memories, leading to an accusation of assault against an alien arms dealer.
Plot
Captain Janeway bargains with Kovin, a self-centered Entharan trader, about the purchase of an isokinetic cannon. Kovin agrees to install it, for a gratuity or fee. While Janeway has concerns about his attitude, she agrees to have Seven of Nine work with him on the installation of the device on Voyager. At one point during this work, Kovin pushes Seven out of his way and Seven angrily reacts by striking him.
In a subsequent medical examination conducted by the Doctor, Seven is overcome by distress.
Under hypnosis by the Doctor, Seven recalls a traumatic repressed memory. She now remembers Kovin forcefully removing Borg technology from her bodywhile on an earlier Voyager mission to the Entharan planet, with Tom Paris, to test some of Kovin's merchandise.
Seven then recounts to the Doctor what she now remembers regarding her violation. Seven went with Kovin to his workshop, to remodulate a new energy assault rifle he is selling. Kovin turned the weapon on her and incapacitated her. Seven then remembers a female lab assistant coming in, being placed on a medical laboratory bed, then the extraction of some of her Borg nanoprobes, which were tested on another person in the lab. Afterwards, she had only recalled Kovin telling her the weapon overloaded and burned her hand — which Seven now believes to be a lie.
The Doctor is strongly sympathetic to Seven's allegations and informs Captain Janeway, who wants first to corroborate the story.
While Paris confirms Seven was alone with Kovin for 2 hours, he observes that Seven seemed completely normal when she returned to him. The Doctor defends Seven's memories as facts as they are very recent, but Tuvok argues that memories are often unreliable, keeping in mind her hallucinations from previous events.
Voyager returns to Enthara, where Kovin denies having assaulted Seven, believing this is either Seven's payback for disagreeing on component procedures or a negotiating tactic. Kovin confirms he and Seven were alone in his lab for 2 hours, but only because Seven demanded 'absolute' perfection from the device. He recounts that the weapon overloaded and slightly burnt Seven's hands, which he treated with a dermal regenerator. When Janeway requests to see the lab for more investigating, Kovin protests, citing the fact that Enthara is totally dependent on trade and will immediately convict any Entharan in order to preserve trade relationships.
An Entharan magistrate accompanies Tuvok and the Doctor enter Kovin's private lab. There are no medical laboratory beds, but when the Doctor finds nanoprobes on tables in Kovin's lab, the magistrate issue a warrant for his arrest. Still proclai |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.