source
stringlengths 32
199
| text
stringlengths 26
3k
|
|---|---|
https://en.wikipedia.org/wiki/Greater%20Washington%20Board%20of%20Trade
|
The Greater Washington Board of Trade is a network of business and non-profit leaders in Washington, D.C. The Board of Trade invests in the cultural infrastructure of the area and promotes the construction and maintenance of public venues, including for professional sports, civic meetings, conventions, arts, and cultural events. The organization is composed of membership levels that range from "Business Member" to "Chairman's Council". Notable organizations and companies that are currently a part of the Board of Trade include KPMG, Hilton Hotels, The Washington Post, and the Calvert Group.
History
Before the creation of the Board of Trade, the District of Columbia did not have a cohesive method of organizing and supporting its cultural infrastructure. Therefore, on November 27, 1889, the Greater Washington Board of Trade was founded after the local paper, The Washington Post, ran an advertisement. The board came into existence as a legal entity on December 2, 1889.
Known as the Board of Trade for the District of Columbia at the time of its creation, the organization was referred locally to as the Washington Board of Trade. During the 70th annual meeting on October 20, 1959, the organization welcomed its first female members when 188 businesswomen were added to the 7,200 total enrollment. The name of the organization was changed to the Metropolitan Washington Board of Trade. At the 90th annual meeting in 1979, the members approved a name change to the Greater Washington Board of Trade. During that meeting, the Board adopted the logo that is still being used today: three interlocking circles that symbolize the unity of Northern Virginia, the District of Columbia, and suburban Maryland.
On November 3, 1992, the Greater Washington Board of Trade challenged the Washington, D.C. law that required employers to provide their at-work employees health insurance to continue to offer the equivalent health insurance coverage for disabled employees who are eligible for workers compensation insurance. On December 14, 1992, the legal decision that the Supreme Court ruled was that states cannot require employers to provide disabled employees the same health insurance with they provide active employees.
The archives of the Greater Washington Board of Trade are housed in the Special Collections Research Center of the Estelle and Melvin Gelman Library at George Washington University.
References
External links
Board of Trade home page
A history of the Washington Board of Trade from the Center of History and New Media
Greater Washington Initiative Affiliated research and economic development marketing organization
Guide to the Greater Washington Board of Trade Records, 1889-1996, Special Collections Research Center, Estelle and Melvin Gelman Library, The George Washington University
Organizations based in Washington, D.C.
Organizations established in 1889
1889 establishments in Washington, D.C.
|
https://en.wikipedia.org/wiki/XVRML
|
xVRML (eXtensible Virtual Reality Modeling Language, usually pronounced ex-vermal) is a standard file format for representing 3-dimensional (3D) interactive computer graphics, designed particularly with the World Wide Web in mind.
Format
xVRML is a text-file format from the xVRML Project at RIT. While xVRML evolved from VRML; it now has an easy-to-learn, XML-based syntax, for which it utilizes an XML Schema to insure both a clear structure and understandable constraints.
Downloads
The specifications, documentation, and example files, as well as information about a viewer application (Carina), may all be found at the xVRML Project website. All but the examples may be downloaded from the Project SourceForge site. An extensive and growing object library is available for public use through the xVRML Project site.
References
External links
Graphics file formats
XML-based standards
Virtual reality
Vector graphics markup languages
|
https://en.wikipedia.org/wiki/VideoGames%20%26%20Computer%20Entertainment
|
VideoGames & Computer Entertainment (abbreviated as VG&CE) was an American magazine dedicated to covering video games on computers, home consoles and arcades. It was published by LFP, Inc. from the late 1980s until the mid-1990s. Offering game reviews, previews, game strategies and cheat codes as well as coverage of the general industry, VG&CE was also one of the first magazines to cover both home console and computer games. The magazine gave out annual awards in a variety of categories, divided between the best of home video games and computer video games. The magazine featured original artwork by Alan Hunter and other freelance artists.
History
VG&CE began as a spinoff of ANALOG Computing, a magazine published by LFP devoted to Atari 8-bit family of home computers.
VG&CE was started at LFP by Lee H. Pappas (publisher), with Andy Eddy as executive editor (Eddy was a freelance contributor to the first issue of the magazine, which had the cover date of December 1988, just before relocating to California in September 1988 to become its editor before the first issue hit the streets. During Eddy's tenure at the magazine, there was no one listed as editor-in-chief, simply due to odd staff-titling decisions.) Contributors included Arnie Katz and Bill "The Game Doctor" Kunkel, co-founders of the first video game magazine, Electronic Games. Tips & Tricks editor-in-chief Chris Bieniek was an associate editor at VG&CE. Computer Player editor-in-chief Mike Davila was an associate editor and later executive editor at VG&CE. Knights of Xentar writer David Moskowitz was also an associate editor at VG&CE during the Eddy/Davila/Bieniek tenure.
VideoGames - The Ultimate Gaming Magazine
The magazine was renamed into VideoGames - The Ultimate Gaming Magazine starting with the September 1993 issue and dropped computer game coverage.
In an effort to compete with magazines popular at the time, such as GamePro, the magazine was made more kid-friendly with vibrant colors and issues often featured a videogame cheat printed on the cover, labelled as a "free code" (this ended in late 1994). For much of this era, Chris Gore was editor-in-chief, and had a monthly news and gossip column "The Gore Score". The magazine ended publication in late 1996, when Ziff-Davis bought VideoGames from LFP and folded the brand.
Spin-off magazines
VG&CE spun off several other video game magazines:
TurboPlay (June/July 1990-August/September 1992), a bi-monthly magazine dedicated to covering TurboGrafx-16 hardware and software.
Tips & Tricks (February 1995-August 2007), a game magazine dedicated to game strategies and cheat codes. The magazine concept was spun out of the "Easter Egg Hunt" and "Tips & Tricks" sections in VG&CE, which offered extensive codes and cheats for video games, as well as the "walkthrough" strategies that VG&CE also provided.
References
External links
VideoGames & computer entertainment. at worldcat.org
VideoGames. at worldcat.org
An interview with former
|
https://en.wikipedia.org/wiki/Advanced%20Resource%20Connector
|
Advanced Resource Connector (ARC) is a grid computing middleware introduced by NorduGrid. It provides a common interface for submission of computational tasks to different distributed computing systems and thus can enable grid infrastructures of varying size and complexity. The set of services and utilities providing the interface is known as ARC Computing Element (ARC-CE). ARC-CE functionality includes data staging and caching, developed in order to support data-intensive distributed computing. ARC is an open source software distributed under the Apache License 2.0.
History
ARC appeared (and is still often referred to) as the NorduGrid middleware, originally proposed as an architecture on top of the Globus Toolkit optimized for the needs of High-Energy Physics computing for the Large Hadron Collider experiments. First deployment of ARC at the NorduGrid testbed took place in summer 2002, and by 2003 it was used to support complex computations.
The first stable release of ARC (version 0.4) came out in April 2004 under the GNU General Public License. The name "Advanced Resource Connector" was introduced for this release to distinguish the middleware from the infrastructure. In the same year, the Swedish national Grid project Swegrid became the first large cross-discipline infrastructure to be based on ARC.
In 2005, NorduGrid was formally established as a collaboration to support and coordinate ARC development. In 2006 two closely related projects were launched: the Nordic Data Grid Facility, deploying a pan-Nordic e-Science infrastructure based on ARC, and KnowARC, focused on transforming ARC into a next generation Grid middleware.
ARC v0.6 was released in May 2007, becoming the second stable release. Its key feature was introduction of the client library enabling easy development of higher-level applications. It was also the first ARC release making use of open standards, as it included support for JSDL. Later that year, the first technology preview of the next generation ARC middleware was made available, though was not distributed with ARC itself. The new approach involved switching to a Web service based architecture, and in general a very substantial re-factorisation of the core code.
In 2008, the NorduGrid consortium adopted the Apache License for all ARC components.
The last stable release in the 0-line was ARC v0.8, shipped in September 2009. It eventually included a preview version of the new execution service - the A-REX' - and several other components, like Chelonia, ISIS, Charon' and the arcjobtool GUI.
In parallel to ARC v0.8, the EU KnowARC project released in November 2009 the conceptual ARC NOX suite, which was a complete Grid solution, fully based on Web service technologies. The name NOX actually indicates the release date: November of the Year of the Ox.
In May 2011, NorduGrid released ARC v11.05 (adopting Ubuntu versioning scheme this time). This release marked the complete transition from the old execution service to
|
https://en.wikipedia.org/wiki/SQP
|
SQP may refer to:
Sequential quadratic programming, an iterative method for constrained nonlinear optimization
South Quay Plaza, a residential-led development under construction in Canary Wharf on the Isle of Dogs, London
SQP, the ICAO code for SkyUp, Kyiv, Ukraine
|
https://en.wikipedia.org/wiki/Hyperscore
|
Hyperscore is a computer-assisted music composition program intended to make the creation of music readily accessible to experienced musicians as well as those without any musical training. To accomplish this, the software maps complex musical concepts to intuitive visual representations. Color, shape, and texture are used to convey high-level musical features such as timbre, melodic contour, and harmonic tension.
Hyperscore has received international media attention and awards. It has been featured in numerous news and journal publications, including the New York Times, as well as television programs such as Scientific American Frontiers.
Composing
Users of Hyperscore compose music by first creating simple melodies or sequences of notes. A library of predefined elements is also provided. These melodies are assigned unique colors. The user then creates a musical sketch composed of colored lines, where each line instances the notes from the corresponding melody. The contour and position of the line alters the pitch at which notes are played back.
The software can optionally use different classes of automated harmonization to organize the given notes, in order to easily generate more pleasing results. The effects of the harmony algorithms can be controlled by contours in a special line presented throughout the sketch. Modulations and sections of harmonic tension and resolution can be introduced in this manner, adding interest and variation to the music.
Hyperscore also provides users with control over tempo and dynamics. MIDI synthesis is used for audible output from within the application and all General MIDI voices are available for use.
History
Hyperscore was originally developed by Morwaread Farbood in Tod Machover's Opera of the Future group at the Massachusetts Institute of Technology Media Lab. Early versions of the software allowed users to generate novel compositions from predefined motives by sketching lines indicating patterns of musical tension. In 2021, Hyperscore was re-developed by Peter Torpay, who earned his PhD in Machover's group at the MIT Media Lab. In the new version, scheduled for release in 2022, the graphical user interface has been updated and the application is web-based so that it will be broadly accessible.
The application evolved to play a prominent role in the Toy Symphony. During an international tour of this project, children were given the opportunity to compose orchestral pieces using Hyperscore, which were then performed in concert along with other works utilizing traditional and technologically enhanced instruments and approaches. Hyperscore was also used extensively in Machover's series of City Symphonies, in which children and adults in cities around the world composed original music that was incorporated by Machover into orchestral works performed by major symphony orchestras.
Current applications
In 2004, Hyperscore became a commercial product under Harmony Line, Inc. The company created H-Lounge,
|
https://en.wikipedia.org/wiki/The%20Health%20Improvement%20Network
|
The Health Improvement Network (THIN) is a large database of anonymised electronic medical records collected at primary care clinics throughout the UK. The THIN database is owned and managed by The Health Improvement Network Ltd in collaboration with In Practice Systems Ltd.
The Health Improvement Network Ltd & In Practice Systems Ltd are both subsidiary companies of Cegedim SA
History
The THIN database is similar in structure and content to the Clinical Practice Research Datalink (CPRD, previously known as GPRD), which is now managed by the United Kingdom Medicines and Healthcare products Regulatory Agency (MHRA).
Between 1994 and 2002, EPIC (UK), a not-for-profit company, held a non-exclusive licence to use GPRD for research benefitting public health. On the expiry of that licence, THIN was developed by EPIC as an alternative to the GPRD, and a substantial number of primary care practitioners now contribute data to both resources. In 2005 EPIC was acquired by Cegedim, a global technology and services company specialising in the healthcare field.
THIN data are made available under more permissive terms than other similar resources (such as the CPRD, which does not allow for-profit use by private companies), but access is subject to ethical approval by an independent Scientific Review Committee.
Data
Data collection commenced in January 2003, using information extracted from VISION a widely used general practice management software package developed by In Practice Systems Ltd a company also owned by Cegedim SA.
The database is regularly updated and currently contains data on over 10 million individuals living in the United Kingdom.
Clinical data in THIN are catalogued using Read codes, a comprehensive and searchable classification scheme for medical conditions, symptoms and important background information. This system is complemented by a set of Additional Health Data (AHD) codes which provide a standardised system for the recording of a wide variety of clinical measurements, and by drug codes which identify prescribed medications.
Since 2004, the UK Quality and Outcomes Framework, a performance-related pay scheme for primary care practitioners, has effectively mandated the use of computer systems (such as Vision) to maintain patient medical records, and has imposed standardised recording methods for a wide range of important medical conditions. In addition, practitioners contributing data to THIN receive training to ensure consistent recording of important clinical outcomes and indicators including:
Asthma
Coronary heart disease
Diabetes mellitus
Epilepsy
Menopause
Hypertension
Hypothyroidism
Leg ulcers
Heart failure
Warfarin use
Lithium use
Use of hormonal contraception
Pernicious anaemia
Rheumatoid arthritis
Secondary stroke prevention
Lower back pain
Mental health
Smoking status
THIN is an important resource in the fields of epidemiology, drug safety and health outcomes research, providing an inexpensive means to study the causes
|
https://en.wikipedia.org/wiki/Ternary%20search
|
A ternary search algorithm is a technique in computer science for finding the minimum or maximum of a unimodal function.
The function
Assume we are looking for a maximum of and that we know the maximum lies somewhere between and . For the algorithm to be applicable, there must be some value such that
for all with , we have , and
for all with , we have .
Algorithm
Let be a unimodal function on some interval . Take any two points and in this segment: . Then there are three possibilities:
if , then the required maximum can not be located on the left side – . It means that the maximum further makes sense to look only in the interval
if , that the situation is similar to the previous, up to symmetry. Now, the required maximum can not be in the right side – , so go to the segment
if , then the search should be conducted in , but this case can be attributed to any of the previous two (in order to simplify the code). Sooner or later the length of the segment will be a little less than a predetermined constant, and the process can be stopped.
choice points and :
Run time order
Recursive algorithm
def ternary_search(f, left, right, absolute_precision) -> float:
"""Left and right are the current bounds;
the maximum is between them.
"""
if abs(right - left) < absolute_precision:
return (left + right) / 2
left_third = (2*left + right) / 3
right_third = (left + 2*right) / 3
if f(left_third) < f(right_third):
return ternary_search(f, left_third, right, absolute_precision)
else:
return ternary_search(f, left, right_third, absolute_precision)
Iterative algorithm
def ternary_search(f, left, right, absolute_precision) -> float:
"""Find maximum of unimodal function f() within [left, right].
To find the minimum, reverse the if/else statement or reverse the comparison.
"""
while abs(right - left) >= absolute_precision:
left_third = left + (right - left) / 3
right_third = right - (right - left) / 3
if f(left_third) < f(right_third):
left = left_third
else:
right = right_third
# Left and right are the current bounds; the maximum is between them
return (left + right) / 2
See also
Newton's method in optimization (can be used to search for where the derivative is zero)
Golden-section search (similar to ternary search, useful if evaluating f takes most of the time per iteration)
Binary search algorithm (can be used to search for where the derivative changes in sign)
Interpolation search
Exponential search
Linear search
N Dimensional Ternary Search Implementation
References
Search algorithms
Optimization algorithms and methods
|
https://en.wikipedia.org/wiki/Materialized%20view
|
In computing, a materialized view is a database object that contains the results of a query. For example, it may be a local copy of data located remotely, or may be a subset of the rows and/or columns of a table or join result, or may be a summary using an aggregate function.
The process of setting up a materialized view is sometimes called materialization. This is a form of caching the results of a query, similar to memoization of the value of a function in functional languages, and it is sometimes described as a form of precomputation. As with other forms of precomputation, database users typically use materialized views for performance reasons, i.e. as a form of optimization.
Materialized views that store data based on remote tables were also known as snapshots (deprecated Oracle terminology).
In any database management system following the relational model, a view is a virtual table representing the result of a database query. Whenever a query or an update addresses an ordinary view's virtual table, the DBMS converts these into queries or updates against the underlying base tables. A materialized view takes a different approach: the query result is cached as a concrete ("materialized") table (rather than a view as such) that may be updated from the original base tables from time to time. This enables much more efficient access, at the cost of extra storage and of some data being potentially out-of-date. Materialized views find use especially in data warehousing scenarios, where frequent queries of the actual base tables can be expensive.
In a materialized view, indexes can be built on any column. In contrast, in a normal view, it's typically only possible to exploit indexes on columns that come directly from (or have a mapping to) indexed columns in the base tables; often this functionality is not offered at all.
Implementations
Oracle
Materialized views were implemented first by the Oracle Database: the Query rewrite feature was added from version 8i.
Example syntax to create a materialized view in Oracle:
CREATE MATERIALIZED VIEW MV_MY_VIEW
REFRESH FAST START WITH SYSDATE
NEXT SYSDATE + 1
AS SELECT * FROM <table_name>;
PostgreSQL
In PostgreSQL, version 9.3 and newer natively support materialized views. In version 9.3, a materialized view is not auto-refreshed, and is populated only at time of creation (unless WITH NO DATA is used). It may be refreshed later manually using REFRESH MATERIALIZED VIEW. In version 9.4, the refresh may be concurrent with selects on the materialized view if CONCURRENTLY is used.
Example syntax to create a materialized view in PostgreSQL:
CREATE MATERIALIZED VIEW MV_MY_VIEW
[ WITH (storage_parameter [= value] [, ... ]) ]
[ TABLESPACE tablespace_name ]
AS SELECT * FROM <table_name>;
SQL Server
Microsoft SQL Server differs from other RDBMS by the way of implementing materialized view via a concept known as "Indexed Views". The main difference is that such views do not require a refresh b
|
https://en.wikipedia.org/wiki/Huang%27s%20algorithm
|
Huang's algorithm is an algorithm for detecting termination in a distributed system. The algorithm was proposed by Shing-Tsaan Huang in 1989 in the Journal of Computers.
Termination detection
The basis of termination detection is in the concept of a distributed system process' state. At any time, a process in a distributed system is either in an active state or in an idle state. An active process may become idle at any time but an idle process may only become active again upon receiving a computational message.
Termination occurs when all processes in the distributed system become idle and there are no computational messages in transit.
Algorithm
Huang's algorithm can be described by the following:
Initially all processes are idle.
A distributed task is started by a process sending a computational message to another process. This initial process to send the message is the "controlling agent".
The initial weight of the controlling agent is (usually 1).
The following rules are applied throughout the computation:
A process sending a message splits its current weight between itself and the message.
A process receiving a message adds the weight of the message to itself.
Upon becoming idle, a process sends a message containing its entire weight back to the controlling agent and it goes idle.
Termination occurs when the controlling agent has a weight of and is in the idle state.
Some weaknesses to Huang's algorithm are that it is unable to detect termination if a message is lost in transit or if a process fails while in an active state.
See also
Dijkstra–Scholten algorithm
Notes
Termination algorithms
|
https://en.wikipedia.org/wiki/APTN%20National%20News
|
APTN National News is a Canadian television national news program broadcast by the Aboriginal Peoples Television Network from Winnipeg, Manitoba, Canada.
The program formerly broadcast in two daily editions, APTN National News Daytime at 12:30 p.m. and APTN National News Primetime at 6:30 p.m.. The program now produces a single half hour of news each day, broadcasts at 6 and 11:30 p.m. Eastern Time nightly, as well as various specialty programs including Investigates on Mondays and Fridays, Laughing Drum, a half hour talk show where comedians review the headlines of the week, Face-to-Face, a long form interview show, InFocus an hour long live interactive talk show, and Nation to Nation, a show examining the political relationship between First Peoples and Canada. Each day there are also short headline news updates on the hour during the afternoon.
The daily newscast's current presenters are Dennis Ward and Melissa Ridgen. Ridgen also hosts InFocus and Ward also hosts Face-to-Face. Todd Lamirande hosts Nation to Nation. Investigates has no single overall host, but has reports filed by all members of APTN's news team.
In 2019, the news division also launched Nouvelles Nationales d’APTN, a weekly French language news program presented by Sophie Claude Miller.
In addition to its main newsroom in Winnipeg, APTN National News has news bureaus in Halifax, Montreal, Ottawa, Toronto, Thunder Bay, Saskatoon, Edmonton, Calgary, Vancouver, Iqaluit, Yellowknife and Whitehorse.
News and current affairs staff at APTN applied for and received union certification with the Canadian Media Guild from the Canadian Labour Board in 2002. Unionized staff reached its first collective agreement with APTN management in April 2003.
On June 8, 2012, the award-winning journalist Karyn Pugliese was appointed as the director of news and current affairs for APTN. Pugliese previously worked as the Ottawa correspondent for APTN National News from 2000 to 2006.
History
APTN National News started on a daily basis on October 28, 2002, and was hosted by Nola Wuttunee until 2006. Before the daily launch of APTN National News, the newscast on APTN was called In-Vision News and was hosted by Carol Morin (2000-2001). In-Vision News began on April 16, 2000. Other previous hosts of APTN National News include Donna Smith (2006-2008), Holly Bernier (2008-2009), Todd Lamirande (2008-2010), Patrice Mousseau (2009-2010) and Dana Foster (2011).
APTN National News Contact was hosted by Rick Harp from 2000 to 2005, Madeleine Allakariallak from 2005 to 2007 and Cheryl McKenzie from 2007 to 2009.
Previous news directors have included Dan David (1999-2001), Jim Compton (2001-2002), Rita Deverell (2002-2005) and Vera Houle (2005-2011) Karyn Pugliese (2012-2019).
References
External links
APTN National News
Aboriginal Peoples Television Network original programming
2002 Canadian television series debuts
2000s Canadian television news shows
2010s Canadian television news shows
2020s Canadian
|
https://en.wikipedia.org/wiki/Dijkstra%E2%80%93Scholten%20algorithm
|
The Dijkstra–Scholten algorithm (named after Edsger W. Dijkstra and Carel S. Scholten) is an algorithm for detecting termination in a distributed system. The algorithm was proposed by Dijkstra and Scholten in 1980.
First, consider the case of a simple process graph which is a tree. A distributed computation which is tree-structured is not uncommon. Such a process graph may arise when the computation is strictly a divide-and-conquer type. A node starts the computation and divides the problem in two (or more, usually a multiple of 2) roughly equal parts and distribute those parts to other processors. This process continues recursively until the problems are of sufficiently small size to solve in a single processor.
Algorithm
The Dijkstra–Scholten algorithm is a tree-based algorithm which can be described by the following:
The initiator of a computation is the root of the tree.
Upon receiving a computational message:
If the receiving process is currently not in the computation: the process joins the tree by becoming a child of the sender of the message. (No acknowledgment message is sent at this point.)
If the receiving process is already in the computation: the process immediately sends an acknowledgment message to the sender of the message.
When a process has no more children and has become idle, the process detaches itself from the tree by sending an acknowledgment message to its tree parent.
Termination occurs when the initiator has no children and has become idle.
Dijkstra–Scholten algorithm for a tree
For a tree, it is easy to detect termination. When a leaf process determines that it has terminated, it sends a signal to its parent. In general, a process waits for all its children to send signals and then it sends a signal to its parent.
The program terminates when the root receives signals from all its children.
Dijkstra–Scholten algorithm for directed acyclic graphs
The algorithm for a tree can be extended to acyclic directed graphs. We add an additional integer attribute Deficit to each edge.
On an incoming edge, Deficit will denote the difference between the number of messages received and the number of signals sent in reply.
When a node wishes to terminate, it waits until it has received signals from outgoing edges reducing their deficits to zero.
Then it sends enough signals to ensure that the deficit is zero on each incoming edge.
Since the graph is acyclic, some nodes will have no outgoing edges and these nodes will be the first to terminate after sending enough signals to their incoming edges. After that the nodes at higher levels will terminate level by level.
Dijkstra–Scholten algorithm for cyclic directed graphs
If cycles are allowed, the previous algorithm does not work. This is because, there may not be any node with zero outgoing edges. So, potentially there is no node which can terminate without consulting other nodes.
The Dijkstra–Scholten algorithm solves this problem by implicitly creating a spanning tre
|
https://en.wikipedia.org/wiki/Jongno%203%28sam%29-ga%20station
|
Jongno 3(sam)-ga Station is an underground station on lines 1, 3 and 5 of the Seoul Subway in South Korea.
In December 2010 the station is recorded as having the fifth highest WiFi data consumption of all the Seoul Metropolitan Subway stations, following Express Bus Terminal Station, Sadang Station, Dongdaemun Station and Jamsil Station.
Station layout
History
The station opened to Line 1 services on August 15, 1974. On October 18, 1985, services on Line 3 began stopping at Jongno 3(sam)-ga, and on December 30, 1996, Line 5 trains began calling here.
Entrances
The following places are accessible from this station's exits as listed.
Exit 1: Jongno 1, 2, 3, 4 Ga Dong Office, Jongno 2 Ga Post Office, Jongno 2 Ga Public Safety Centre, Tapgol Park; Insa Dong
Exit 2; 2-1: Changdeokgung
Exit 3: Donui Dong; Jongno 3 Ga Fire Station; Jongno 3 Ga Public Safety Centre; Jongmyo; Jongmyo Citizens' Park
Exit 4: Nakwon Dong
Exit 5: Seoul Gyodong Primary School; Seoul Unhyeon Primary School; Jongnno 1, 2, 3, 4 Ga Dong Office; Jongno 2 Ha Post Office; Jongno 2 Ga Public Safety Centre; Jongno Tax Office; Tapgol Park
Exit 6: Jongno 3 Ga Fire Station
Exit 7: Anguk Dong; Donhwamun; Jongno 3 Ga Public Safety Centre; Changdeokgung
Exit 8: Myo Dong; Changdeokgung; Jongmyo Citizens' Park
Exit 9: Jongmyo; Jongno 3 Ga Fire Station; Jongno 3 Ga Public Safety Centre
Exit 10: Jongmyo; Jongmyo Citizens' Park
Exit 11: Daerim Shopping
Exit 12: Jongno 4 Ga
Exit 13: Jangsa Dong; Cheonggyecheon 3 Ga
Exit 14: Cheonggyecheon 3 Ga; Seoul Teenagers' Training Centre
Exit 15: Gwansu Dong; Jongno 2 Ga; Industrial Bank of Korea, End of Jongno
Tourism
In January 2013, the Seoul Metropolitan Rapid Transit Corporation, which operates this line, published free guidebooks in three languages: English, Japanese and Chinese (simplified and traditional), which features eight tours as well as recommendations for accommodations, restaurants and shopping centers. The tours are designed with different themes, e.g. Korean traditional culture, which goes from this station to Anguk Station and Gyeongbokgung Station on line No 3 that showcases antique shops and art galleries of Insa-dong.
References
Seoul Metropolitan Subway stations
Metro stations in Jongno District
Railway stations opened in 1974
Seoul Subway Line 3
Seoul Subway Line 1
Seoul Subway Line 5
Railway stations in South Korea opened in the 1970s
|
https://en.wikipedia.org/wiki/Globix%20Corporation
|
Globix Corporation is a company that provided internet infrastructure and network services; it went bankrupt following the dot-com bubble, recovered, and was bought by RCN Corporation in 2007.
History
Globix Corporation was founded in 1989 as Bell Technology Group, a value-added reseller of computers; Marc Bell served as CEO from its founding until 2001.
In the mid-1990s the company expanded into Internet products and services and completed an IPO in January 1996.
By June 1998 the company offered "dedicated Internet access, Web Hosting, Co-location, network and systems integration, interactive media development (including 2-D and 3-D animation) and instructor-led corporate training" and changed its name to Globix Corporation.
During the dot-com bubble, Globix bought an eight-story building in New York City to serve as a data center, which was announced at Internet World 2000 by Bell, who cited "tremendous demand for our managed Internet Data Center services". The company already had nearly 300,000 square feet of data center space, and planned four additional centers. The company completed a $600 million bond offering in 2001 to fund further expansion.
As the dot-com bubble burst, in August 2001 the company hired a new CEO and in January 2002, Globix filed for Chapter 11 bankruptcy; its market capitalization had fallen from almost $1 billion in 1999 to $5.87 million. Globix emerged from Chapter 11 bankruptcy in April 2002, with creditors receiving $120 million in notes in exchange for the $600 million in bonds they held. In October 2003 Globix sold its New York City data center to fund operations and retire some of its debt.
In November 2003 Globix acquired Aptegrity Inc., a managed services provider focused on Web-based applications. In July 2004, Globix announced it intended to merge with NEON Communications, Inc., a provider of optical networking to carriers and large companies in the US Northeast and mid-Atlantic, and the deal closed in March 2005. For the fiscal year ending September 30, 2004, Globix reported a net loss of $41.4 million and had $95.8 million in debt.
In late 2005 and 2006 Globix restructured and paid down debt by selling off assets, including its New York city headquarters, a UK subsidiary, and its hosting business, the latter of which it sold to Quality Technology Services.
In February 2007 Globix changed its name to NEON Communications Group, Inc.
In June 2007 RCN Corporation announced it intended to acquire NEON and the deal closed in November 2007.
References
Companies based in New York City
|
https://en.wikipedia.org/wiki/Garbage%20%28computer%20science%29
|
In computer science, garbage includes data, objects, or other regions of the memory of a computer system (or other system resources), which will not be used in any future computation by the system, or by a program running on it. Because every computer system has a finite amount of memory, and most software produces garbage, it is frequently necessary to deallocate memory that is occupied by garbage and return it to the heap, or memory pool, for reuse.
Classification
Garbage is generally classified into two types: syntactic garbage, any object or data which is within a program's memory space but unreachable from the program's root set; and semantic garbage, any object or data which is never accessed by a running program for any combination of program inputs. Objects and data which are not garbage are said to be live.
Casually stated, syntactic garbage is data that cannot be reached, and semantic garbage is data that will not be reached. More precisely, syntactic garbage is data that is unreachable due to the reference graph (there is no path to it), which can be determined by many algorithms, as discussed in tracing garbage collection, and only requires analyzing the data, not the code. Semantic garbage is data that will not be accessed, either because it is unreachable (hence also syntactic garbage), or is reachable but will not be accessed; this latter requires analysis of the code, and is in general an undecidable problem.
Syntactic garbage is a (usually strict) subset of semantic garbage, as it is entirely possible for an object to hold a reference to another object without ever using that object.
Example
In the following simple stack implementation in Java, each element popped from the stack becomes semantic garbage once there are no outside references to it:
public class Stack {
private Object[] elements;
private int size;
public Stack(int capacity) {
elements = new Object[capacity];
}
public void push(Object e) {
elements[size++] = e;
}
public Object pop() {
return elements[--size];
}
}
This is because elements[] still contains a reference to the object, but the object will never be accessed again through this reference, because elements[] is private to the class and the pop method only returns references to elements it has not already popped. (After it decrements size, this class will never access that element again.) However, knowing this requires analysis of the code of the class, which is undecidable in general.
If a later push call re-grows the stack to the previous size, overwriting this last reference, then the object will become syntactic garbage, because it can never be accessed again, and will be eligible for garbage collection.
Automatic garbage collection
An example of the automatic collection of syntactic garbage, by reference counting garbage collection, can be produced using the Python command-line interpreter:
>>> class Foo:
... """This is an empty testing
|
https://en.wikipedia.org/wiki/Diode%20logic
|
Diode logic (or diode-resistor logic) constructs AND and OR logic gates with diodes and resistors.
An active device (vacuum tubes in early computers, then transistors in diode–transistor logic) is additionally required to provide logical inversion (NOT) for functional completeness and amplification for voltage level restoration, which diode logic alone can't provide.
Since voltage levels weaken with each diode logic stage, multiple stages can't easily be cascaded, limiting diode logic's usefulness. However, diode logic has the advantage of utilizing only cheap passive components.
Background
Logic gates
Logic gates evaluate Boolean algebra, typically using electronic switches controlled by logical inputs connected in parallel or series. Diode logic can only implement OR and AND, because inverters (NOT gates) require an active device.
Logic voltage levels
Main article:
Binary logic uses two distinct logic levels of voltage signals that may be labeled high and low. In this discussion, voltages close to +5 volts are high, and voltages close to 0 volts (ground) are low. The exact magnitude of the voltage is not critical, provided that inputs are driven by strong enough sources so that output voltages lie within detectably different ranges.
For active-high or positive logic, high represents logic 1 (true) and low represents logic 0 (false). However, the assignment of logical 1 and logical 0 to high or low is arbitrary and is reversed in active-low or negative logic, where low is logical 1 while high is logical 0. The following diode logic gates work in both active-high or active-low logic, however the logical function they implement is different depending on what voltage level is considered active. Switching between active-high and active-low is commonly used to achieve a more efficient logic design.
Diode biasing
Forward-biased diodes have low impedance approximating a short circuit with a small voltage drop, while reverse-biased diodes have a very high impedance approximating an open circuit. The diode symbol's arrow shows the forward-biased direction of conventional current flow.
Diode AND and OR logic gates
Each input of a diode logic gate connects through a diode connected to a shared wired logic output. Depending on the voltage level of each input and direction of the diode, each diode may or may not be forward-biased. If any are forward-biased, the shared output wire will be one small forward voltage drop within the forward-biased diode's input.
If no diode is forward-biased then no diode will provide drive current for the output's load (such as a subsequent logic stage). So the output additionally requires a pull-up or pull-down resistor connected to a voltage source, so that the output can transition quickly and provide a strong driving current when no diodes are forward-biased.
Note: the following circuits have two inputs for each gate and thus use two diodes, but can be extended with more diodes to allow for more inputs. At l
|
https://en.wikipedia.org/wiki/1st%20%26%20Ten%20%28graphics%20system%29
|
1st & Ten is a computer system that augments televised coverage of American football by inserting graphical elements on the field of play as if they were physically present; the inserted element stays fixed within the coordinates of the playing field and obeys the visual rules of foreground objects occluding background objects. Developed by Sportvision and PVI Virtual Media Services, it is best known for generating and displaying a yellow first down line over a live broadcast of a football gamemaking it easier for viewers to follow play on the field. The line is not physically present on the field and is seen only by the television audience.
1st & Ten is sometimes used generically to refer to the class of systems capable of adding first down lines and similar visual elements and not just the Sportvision system. However, PVI's competing system is more accurately named L-VIS, for Live Video Insertion System.
Over time, usage has evolved. Some football broadcasts change the color of the line from yellow to red on 4th down, or show a second computer-generated line (usually blue in color) that marks the line of scrimmage. Lines can also be projected to show other types of field position, including markings for the red zone and the optimum maximum distance for a placekicker's statistical field goal range. In extreme weather situations, an entire virtual field with yard and boundary markers can be projected onto the field in order to allow league officials, broadcasters and viewers some way to follow action when all field markings are obscured by snow, fog or mud.
The system makes use of a combination of motion sensors mounted on the broadcast cameras to record what they are viewing, and/or the use of match moving computer graphics technology and an enhanced version of chroma key or "green screen" technology.
History and development
The idea of creating an on-field marker to help TV viewers identify first down distances was conceived and patented in 1978 by David W. Crain, who presented the concept to Roone Arledge and Roger Goodman of ABC News and Sports and to the CBS Technology Center. At the time, both decided the broadcast industry was not ready to use Crain's invention.
In 1998, ESPN programmer Gary Morgenstern and others revived the idea. ESPN's NFL coordinating producer, Fred Gaudelli, was tasked with overseeing an implementation for his network. The 1st & Ten line was first broadcast by Sportvision, a private company, during ESPN's coverage of a Cincinnati Bengals-Baltimore Ravens game on September 27, 1998. A few weeks later, on Thanksgiving Day in 1998, Princeton Video Image (PVI) aired its version of the virtual yellow down line on a CBS broadcast of a Pittsburgh Steelers–Detroit Lions game. Four years later, SportsMEDIA introduced a third version during NBC coverage of a Notre Dame game.
The rivalry between PVI and Sportvision began with a collaboration. In July 1995, PVI had successfully used its L-VIS (Live Video Insertion Syste
|
https://en.wikipedia.org/wiki/Best%20Flow
|
Best Flow, Inc.(베스트플로우) is a Korean entertainment company, headquartered in Seoul, Korea. It was founded on 26 September 1994 as Datagate International, changed its name to Yuri International(여리인터내셔널) in 2005 and Best Flow in 2008.
Business sector
Management of Celebrities
Producing and investing in films and TV programs
Producing and distributing music
Star marketing, selling merchandise
Multimedia
Games
Related companies
Trifecta Entertainment
Climix Entertainment
I Star Cinema
Companies listed on KOSDAQ
Entertainment companies of South Korea
South Korean companies established in 1994
|
https://en.wikipedia.org/wiki/FASTOPEN
|
In computing, FASTOPEN is a DOS terminate-and-stay-resident command, introduced in MS-DOS version 3.3, that provides accelerated access to frequently-used files and directories. The command is also available in SISNE plus.
Overview
The command works with hard disks, but not with diskettes (probably for security when swapping) or with network drives (probably because such drives do not offer block-level access, only file-level access).
It is possible to specify for which drives should operate, how many files and directories should be cached on each (10 by default, up to 999 total), how many regions for each drive should be cached and whether the cache should be located in conventional or expanded memory.
If a disk defragmenter tool is used, or if Windows Explorer is to move files or directories, while is installed, it is necessary to reboot the computer afterwards, because would remember the old position of files and directories, causing MS-DOS to display garbage if e.g. "DIR" was performed.
DR DOS 6.0 includes an implementation of the command. is also part of the Windows XP MS-DOS subsystem to maintain MS-DOS and MS OS/2 version 1.x compatibility. It is not available on Windows XP 64-Bit Edition.
The "fastopen" name has since been reused for various other "accelerating" software products.
See also
FASTOPEN (CONFIG.SYS directive)
SmartDrive
List of DOS commands
References
Further reading
External DOS commands
|
https://en.wikipedia.org/wiki/PlayNetwork
|
PlayNetwork, Inc. is a provider of in-store music and entertainment for retail, restaurant, and hospitality environments.
PlayNetwork merged with TouchTunes in May 2017, but in September 2021, TouchTunes sold PlayNetwork to Mood Media.
History
The company was founded by Kevin Robell in 1996. As a music programmer for the Tom Selleck-owned nightclub Black Orchid in Honolulu, HI during the 80s, Kevin noticed "the synergetic relationship between customers, music, and their environment"; He went on to establish PlayNetwork in Seattle with brother Gordon Robell as a digital music provider for businesses.
In 1996, Adam Brotman, who was a consultant to Kevin Robell, became CEO. Adam went on to become Starbucks’ Chief Digital Officer in 2009.
In 1998, PlayNetwork began a partnership with Starbucks to provide digital music systems and service to over 1,800 retail locations in North America. By 2001, the company was providing services to more than 3,500 international locations.
In 2003, PlayNetwork is named one of the Inc. 500 Fastest Growing Private Companies.
In 2005, Executive Chairman of the Board, Lon Troxel is appointed as CEO. PlayNetwork acquires Crows Nest Entertainment (digital signage and advertising). PlayNetwork is named one of the Deloitte Technology Fast 500.
In 2009, PlayNetwork acquires custom in-store television network developer Channel M.
In 2013, offices in London and Hong Kong open.
In May 2017, PlayNetwork merged with TouchTunes Interactive Network and the combined company's headquarters was reported to be located at New York City and Seattle.
International expansion
PlayNetwork continues to expand internationally with the opening of office locations in London and Hong Kong, with an additional office in Santiago, Chile in 2014.
References
2021 mergers and acquisitions
Companies based in Redmond, Washington
Companies established in 1996
Industrial music services
|
https://en.wikipedia.org/wiki/TPC-5CN
|
TPC-5CN or Trans-Pacific Cable 5 Cable Network is a submarine telecommunications cable system linking Japan, Guam, Hawaii and mainland United States.
It has landing points in:
Ninomiya, Kanagawa Prefecture, Japan
Bandon, Coos County, Oregon, United States
San Luis Obispo, San Luis Obispo County, California, United States
Keawaula/Yokohama Beach, Wai'anae, Honolulu County, Oahu, Hawaii, United States
Tumon Bay, Tumon, Tamuning, Guam
Miyazaki, Miyazaki Prefecture, Japan
It has a transmission capacity of 5 Gbit/s, and a total cable length of . It started operation on 31 December 1996.
External links
References
Submarine communications cables in the Pacific Ocean
Japan–United States relations
1996 establishments in California
1996 establishments in Oregon
1996 establishments in Guam
1996 establishments in Hawaii
1996 establishments in Japan
|
https://en.wikipedia.org/wiki/APCN
|
APCN or Asia-Pacific Cable Network is a submarine telecommunications cable system linking nine Asian countries.
It has landing points in:
Petchaburi, Thailand
Mersing, Malaysia
Changi, Singapore
Ancol, Indonesia
Lantau, Hong Kong
Batangas, Philippines
Toucheng, Taiwan
Busan, Korea
Miyazaki, Japan
It has a transmission capacity of 5 Gbit/s, and a total cable length of approximately 12,000 km. It started operations in 1997.
See also
APCN 2
List of international submarine communications cables
Cable landing point
Sources
Submarine communications cables in the Pacific Ocean
1997 establishments in Asia
Submarine communications cables in the Indian Ocean
|
https://en.wikipedia.org/wiki/Center%20for%20Research%20in%20Security%20Prices
|
The Center for Research in Security Prices, LLC (CRSP) is a provider of historical stock market and investable index data. CRSP is an affiliate of the Booth School of Business at the University of Chicago. CRSP maintains some of the largest and most comprehensive proprietary historical databases in stock market research. Academic researchers and investment professionals rely on CRSP for accurate, survivor bias-free information which provides a foundation for their research and analyses. As of 2023, CRSP claims over 600 clients. The name is usually pronounced "crisp".
CRSP was founded in 1960 by James H. Lorie (professor of finance and director of research) and Lawrence Fisher (assistant professor of finance) of the University of Chicago, with a grant from Merrill Lynch, Pierce, Fenner & Smith. Its goal was to provide a source of accurate and comprehensive data that could be used to answer basic questions about the behavior of stock markets. The first effort of the Center was the production of a database consisting of monthly stock prices on the New York Stock Exchange for all common stocks from 1926 to 1962. Dividends, shares outstanding, capital changes, and delisting information was also included. Taken together, this data made possible the first comprehensive study of the rates of return on common stocks. Since then the database has been kept up to date to the present day, daily data has been expanded back to 1926, and other exchanges and financial instruments have been added.
On January 1, 2020, CRSP spun off from Chicago Booth and became Center for Research in Security Prices, LLC. CRSP, LLC is an affiliate of the University of Chicago Booth School of Business.
CRSP's flagship databases include:
Common stocks on the NYSE from 1926, AMEX from 1962, and NASDAQ from 1972
CRSP Indexes
NASDAQ and S&P 500 Composite Indices
NASDAQ and AMEX Industry Indices
US Treasury bonds
Survivor bias-free mutual funds
Market capitalization reports;
Proxy graphs for 10-K SEC filings
Other custom datasets
In partnership with Compustat, CRSP provides the CRSP/Compustat Merged Database, and in partnership with the Ziman School of Real Estate at UCLA's Anderson School of Management, the CRSP/Ziman REIT Data Series.
Notes
References
External links
Economic research institutes
Research institutes of the University of Chicago
|
https://en.wikipedia.org/wiki/Andhra%20Bank
|
Andhra Bank was a medium-sized public sector bank (PSB) of India, with a network of 2885 branches, 4 extension counters, 38 satellite offices and 3798 automated teller machines (ATMs) as of 31 March 2019. During 2011–12, the bank entered the states of Tripura and Himachal Pradesh. It operated in 25 states and three union territories. It had its headquarters in Hyderabad, Telangana, India. Along with Corporation Bank, Andhra Bank was merged with Union Bank of India in April 2020.
The government of India owned 90.85% of its share capital as on 31 March 2019. The state owned Life Insurance Corporation held 7.80% of the shares. The bank had done a total business of and has earned a net profit of for the financial year 2015–16.
History
Bhogaraju Pattabhi Sitaramayya founded Andhra Bank in 1923 in Machilipatnam, Madras Presidency (present-day Andhra Pradesh). Raja Yarlagadda Sivarama Prasad was the individual who committed the financial resources for starting the institution. The bank was registered on 20 November 1923 and commenced business on 28 November 1923 with a paid up capital of and an authorised capital of . In 1956, linguistic division of States was promulgated and Hyderabad was made the capital of Andhra Pradesh. The registered office of the bank was subsequently shifted to Andhra Bank Buildings, Sultan Bazar, Hyderabad. In the second phase of nationalisation of commercial banks commenced in April 1980, the bank became a wholly Government-owned. In 1964, the bank merged with Bharat Lakshmi Bank and further consolidated its position in Andhra Pradesh.
IndiaFirst Life Insurance Company is a life insurance company in India. It is a joint venture between two of India's public sector banks – Bank of Baroda (44%) and Andhra Bank (30%), and UK's financial and investment company Legal & General (26%). It was incorporated in November 2009. It has its headquarters in Mumbai. India First Life made more than in turnover in just four and half months since the insurance company became operational. India First Life insurance company is headquartered in Mumbai. India First is the first life insurance company to be recommended for ISO certification within 7 months of inception.
On 30 August 2019, Finance Minister Nirmala Sitharaman announced that Andhra Bank and Corporation Bank would be merged into Union Bank of India. The proposed merger would make Union Bank of India the fifth largest public sector bank in the country with assets of and 9,609 branches. The Board of Directors of Andhra Bank approved the merger on 13 September. The Union Cabinet approved the merger on 4 March, and it was completed on 1 April 2020.
Products and services
Andhra Bank introduced Internet Banking Facility (AB INFI-net) to all customers of cluster linked branches. Rail Ticket Booking Facility is made available to all debit card holders as well as to internet banking customers through IRCTC Website through a separate gateway. Corporate Website is available in English
|
https://en.wikipedia.org/wiki/Server
|
Server may refer to:
Computing
Server (computing), a computer program or a device that provides requested information for other programs or devices, called clients.
Role
Waiting staff, those who work at a restaurant or a bar attending customers and supplying them with food and drink as requested.
A tennis player who makes a serve.
Altar server, a lay assistant to a member of the clergy during a Christian liturgy.
Other uses
Server (name)
Server Sundaram, a 1964 Indian comedy film
Server, any serving utensil; see List of serving utensils
See also
Serve (disambiguation)
Service (disambiguation)
Cake and pie server
|
https://en.wikipedia.org/wiki/Media%20processor
|
A media processor, mostly used as an image/video processor, is a microprocessor-based system-on-a-chip which is designed to deal with digital streaming data in real-time (e.g. display refresh) rates. These devices can also be considered a class of digital signal processors (DSPs).
Unlike graphics processing units (GPUs), which are used for computer displays, media processors are targeted at digital televisions and set-top boxes.
The streaming digital media classes include:
uncompressed video
compressed digital video - e.g. MPEG-1, MPEG-2, MPEG-4
digital audio- e.g. PCM, AAC
Such SOCs are composed of:
a microprocessor optimized to deal with these media datatypes
a memory interface
streaming media interfaces
specialized functional units to help deal with the various digital media codecs
The microprocessor might have these optimizations:
vector processing or SIMD functional units to efficiently deal with these media datatypes
DSP-like features
Previous to media processors, these streaming media datatypes were processed using fixed-function, hardwired ASICs, which could not be updated in the field. This was a big disadvantage when any of the media standards were changed. Since media processors are software programmed devices, the
processing done on them could be updated with new software releases. This allowed new generations of systems to be created without hardware redesign. For set-top boxes this even allows for the possibility of in-the-field upgrade by downloading of new software through cable or satellite networks.
Companies that pioneered the idea of media processors (and created the marketing term of media processor) included:
MicroUnity MediaProcessor - Cancelled in 1996 before introduction
IBM Mfast - Described at the Microprocessor Forum in 1995, planned to ship in mid-1997 but was cancelled before introduction
Equator Semiconductor BSP line - their processors are used in Hitachi televisions, company acquired by Pixelworks
Chromatic Research MPact line - their products were used on some PC graphics cards in the mid-1990s, company acquired by ATI Technologies
Philips TriMedia line - used in Philips, Dell, Sony, etc. consumer electronics, Philips Semiconductors split off from Philips and became NXP Semiconductors in 2006
Consumer electronics companies have successfully dominated this market by designing their own media processors and integrating them into their video products. Companies such as Philips, Samsung, Matsushita, Fujitsu, Mitsubishi have their own in-house media processor devices.
Newer generations of such devices now use various forms of multiprocessing—multiple CPUs or DSPs, in order to deal with the vastly increased computational needs when dealing with high-definition television signals.
External links
http://www.microunity.com
http://www.equator.com
best lga 1155 cpu
http://www.philips.com
http://www.nxp.com
Central processing unit
Coprocessors
Digital electronics
Digital signal processing
|
https://en.wikipedia.org/wiki/Application%20discovery%20and%20understanding
|
Application discovery and understanding (ADU) is the process of automatically analyzing artifacts of a software application and determining metadata structures associated with the application in the form of lists of data elements and business rules. The relationships discovered between this application and a central metadata registry is then stored in the metadata registry itself.
Business benefits of ADU
On average, developers are spending only 5% of their time writing new code, 20% modifying the legacy code and up to 60% understanding the existing code.
Thus, ADU saves a great deal of time and expense for organizations that are involved in the change control and impact analysis of complex computer systems. Impact analysis allows managers to know that if specific structures are changed or removed altogether, what the impact of those changes might be to enterprise-wide systems. This process has been largely used in the preparation of Y2K changes and validations in software.
Application Discovery and Understanding is part of the process enabling development teams to learn and improve themselves by providing information on the context and current state of the application.
The process of gaining application understanding is greatly accelerated when the extracted metadata is displayed using interactive diagrams.
When a developer can browse the metadata, and drill down into relevant details on demand, then application understanding is achieved in a way that is natural to the developer. Significant reductions in the effort and time required to perform full impact analysis have been reported when ADU tools are implemented.
ADU tools are especially beneficial to newly hired developers. A newly hired developer will be productive much sooner and will require less assistance from the existing staff when ADU tools are in place.
ADU process
ADU software is usually written to scan the following application structures:
Data structures of all kinds
Application source code
User interfaces (searching for labels of forms)
Reports
The output of the ADU process frequently includes:
Lists of previously registered data elements discovered within an application
List of unregistered data elements discovered
Note that a registered data element is any data element that already exists within a metadata registry.
See also
metadata
metadata registry
data element
Related
Configuration Management
References
Metadata
|
https://en.wikipedia.org/wiki/Jamie%20Colby
|
Jamie Nell Colby is an American former national news correspondent and anchor for Fox News Channel (FNC). Her last assignment was to host the show, Strange Inheritance, on Fox Business Network and was formerly co-host of America's News Headquarters with Eric Shawn on Sunday mornings. Colby and Fox News Channel parted ways in February, 2019.
Career
Colby has worked for Fox News since July 2003 as National News Correspondent and Anchor. Prior to joining FOX News Channel, Colby was a correspondent for CNN and served as an anchor and reporter for CBS News including fill-in anchor for CBS's Up to the Minute. She was also an anchor for WPIX/WB-11 New York, a reporter at WNYW FOX 5 New York, and a correspondent/co-anchor on FOX News' WebMD TV. Colby is an attorney admitted to practice law in New York, California, Florida and the District of Columbia.
She has received such honors as the Edward R. Murrow National Award in 2002 for her coverage of the September 11 attacks; the Gracie Award for investigative reporting in 2000, and the Clarion Award from the Association for Women in Communications. She was also named Television Week's "Rising News Star To Watch". Aside from her journalism career, Colby, an attorney, served in private practice for 10 years. Her law practice began with a Hollywood entertainment firm that assigned her to The Tonight Show. At 22, she worked for Johnny Carson during his contract renewal with NBC and also his divorce.
Since January 2015, Colby has served as host and reporter on the Fox Business show, Strange Inheritance, which covers quirky or unexpected legacies left behind by friends or family.
Personal
Attending the University of Miami's International School of Business, she earned a Bachelor of Business Administration degree in accounting as well as a Juris Doctor degree from the University of Miami School of Law at age 22.
Colby authored Back to Life After a Heart Crisis: A Doctor and His Wife Share Their 8-Step Cardiac Comeback Plan () with her ex-husband Marc Wallack, the Chief of Surgery at Metropolitan Hospital in New York City.
References
External links
Biography at FOXNews.com
Living people
Mass media people from Queens, New York
Television personalities from New York City
American women journalists
University of Miami School of Law alumni
Fox News people
Journalists from New York City
Year of birth missing (living people)
University of Miami Business School alumni
21st-century American women
|
https://en.wikipedia.org/wiki/First%20Cellular%20of%20Southern%20Illinois
|
First Cellular of Southern Illinois was a telecommunications company in Illinois, United States.
Services included:
Owned and Operated Wireless phone carrier
At its time, the largest digital network in area served with significant market share.
Extensive nationwide network by partnering with multiple companies across the United States
Sponsorship of local arts and education programs as well as wireless phone donations to area shelters.
The company was purchased by Alltel in an all-cash deal; the acquisition closed on May 1, 2006. Complete turnover of all stores occurred in early October.
External links
Acquisition article
Company website
Acquisition press release
Defunct mobile phone companies of the United States
Communications in Illinois
Defunct companies based in Illinois
Telecommunications companies disestablished in 2006
Alltel
|
https://en.wikipedia.org/wiki/Rural%20Cellular
|
Rural Cellular was a telecommunications company that had run the Unicel mobile network. It operated in Midwest, Northeast, Northwest and the Southern regions of the United States and was bought by Verizon Wireless on January 25, 2009, for approximately $2.67 billion in cash and assumed debt.
External links
Rural Cellular Corporation
Defunct mobile phone companies of the United States
Defunct companies based in Minnesota
Verizon Wireless
|
https://en.wikipedia.org/wiki/Nan%20Lin
|
Nan Lin (born 1938 in Chongqing, China) is the Oscar L. Tang Family Professor of Sociology of the Trinity College, Duke University. He is most notable for his research and writing on social networks and social capital.
Biography
Lin received his undergraduate degree from Tunghai University, Taiwan, in 1960; his M.A. from Syracuse University in 1963; and his doctorate degree from Michigan State University in 1966. He entered the sociology department at the University at Albany, SUNY in 1971, became a full professor there in 1976 and served as department chair from 1979 to 1982. In 1979, he established contacts with sociologists in the People's Republic of China and established an exchange program between Albany and Nankai University. He also helped organize the first U.S.-China doctoral program in sociology.
In 1990 he took a position as sociology professor at Duke University, where he also served as Director of the Asian-Pacific Studies Institute.
A former Vice President of the American Sociological Association, he has also taught at Johns Hopkins University. He has worked in the United States, Central America, Haiti, China, and Taiwan.
Research
Lin's research interest lies in social networks, social support and social capital. He has contributed theory, devised measurements and conducted empirical research in each of these areas. He has applied the theory and measurements to the study of social stratification and mobility, stress and coping, and individual, organization and community well-being.
Lin has employed both quantitative methods—such as large-scale national surveys, and surveys in organizations and communities—and qualitative methods, such as intensive long-term observations in villages, for example.
Having written about social networks since the early 1980s, Lin contributed to the economically-oriented branch of the literature on social capital defined by Mark Granovetter and James Coleman, seeking to establish a research paradigm which integrates theory with empirical testing. His definition of social capital as access to resources through network ties is one of the most widely accepted conceptualizations of the term. This definition of social capital is quantifiable and widely held to be more precise than the one popularized by Robert Putnam. Lin also rejects Putnam's thesis, put forward in Bowling Alone, that social capital is decreasing; he maintains that it is, in fact, on the ascent thanks to increasingly pervasive online networking.
Honors and awards
Lin is an academician at the Academia Sinica, Taiwan. He delivered the Fei Xiao-tong Memorial Lecture at Peking University in 2008, was honored the same year at the “Re-construction and Development of Sociology in China and Nan Lin’s Intellectual Thoughts” at Tsinghua University, and gave the Famous Foreign Lectures at the Interuniversity Center for Social Science Theory and Methodology at the University of Groningen in 2006. He holds an honorary doctorate degree from the Na
|
https://en.wikipedia.org/wiki/Jump%20Raven
|
Jump Raven was the second game released by Cyberflix, in 1994. The game's technology is similar to that of Lunicus, released by Cyberflix one year prior, but this time employs a more detailed storyline and environment. In an opening sequence of the game, we see future New York City, which has fallen into horrible disrepair in the aftermath of global warming and rising sea levels and a bankrupt federal government. The premise of the story is that gangsters, neo-nazis, and various other thugs have acquired large stores of weapons (from the government) and have ransacked New York's store of cryogenically-frozen DNA of endangered species. The player's job as a bounty hunter is to retrieve them.
Gameplay
Before taking off in a fancy hovercraft, the player chooses a co-pilot who can navigate or fire weapons. selecting Nikki, Chablis, "Cheesestick" Limbaugh (supposedly descended from Rush, though he is black), Thrash, Lark or Dogstar. Each co-pilot is unique and may not be available for every level.
The game's three difficult and lengthy levels are played in the player's hovercraft flying around the streets of New York. The opponents drive tanks or fly planes and insult the player frequently. The user can choose between one of several bands for theme music in each level. each band has a unique song per level. the bands include: x-static, deathkiller, pink flaand (a reference to Pink Floyd), and smoove da groove. The name "deathkiller" was coined at a trade show - two Japanese girls watched the demo and described it as "deathkiller". evidently there is no accurate translation from Japanese to English for that type of video game...
Game control is rather complicated as the player can move up, down, left, right, and forward and backward. The player must also control weapons. Fortunately, the copilot can take care of one or more of these functions.
Development
Following the successful launch of its CD-ROM game Lunicus in April 1993, developer CyberFlix began to create Jump Raven with the DreamFactory development environment from the first title. At the time, CD-ROM games tended to run slowly, but DreamFactory was designed to allow an unusually high level of speed for the era. However, CyberFlix considered its projects to be "interactive movies" rather than games, according to Jack Neely of Metro Pulse, and DreamFactory placed an emphasis on storytelling. As with Lunicus, production of Jump Raven began in the basement of a log cabin owned by CyberFlix founder William Appleton. The game's development team was composed of four members: Appleton, creator of DreamFactory, who handled the game's programming; audio lead Scott Scheinbaum; artist Jamie Wicks; and screenwriter Andrew Nelson. The four had originally founded CyberFlix to create Lunicus, and the company was incorporated a month after its release, with the help of manager Erik Quist. Science Fiction and Fantasy Illustrator: Debbie Hughes was hired as a freelancer to create the "puppet characters" fo
|
https://en.wikipedia.org/wiki/InfoSpace
|
Infospace, Inc. was an American company that offered private label search engine, online directory, and provider of metadata feeds. The company's flagship metasearch site was Dogpile and its other notable consumer brands were WebCrawler and MetaCrawler. After a 2012 rename to Blucora, the InfoSpace business unit was sold to data management company OpenMail.
History
The company was founded in March 1996 by Naveen Jain after he left Microsoft. The company started with six employees, and Jain served as CEO until 2000. InfoSpace provided content and services, such as phone directories, maps, games and information on the stock market, to websites and mobile device manufacturers. The company grew at low cost without funding using co-branding strategies. Rather than try to get traffic to an InfoSpace website, sites like Lycos, Excite and Playboy embedded InfoSpace's features and content into their site and added an InfoSpace icon to it. InfoSpace then earned money by taking a small percentage of licensing, subscription or advertising fees. On December 15, 1998, InfoSpace went public under the ticker INSP, raising $75 million in the offering.
By April 2000, InfoSpace was working with 1,500 websites, 60 content providers and 20 telecommunications companies. InfoSpace was praised by Wall Street analysts and at its peak its market cap was $31 billion. It became the largest internet business in the American Northwest. InfoSpace may have contributed to the inflated expectations in internet companies during the height of the dot-com bubble. In July 2000, InfoSpace acquired Go2Net. After the merger, Go2Net CEO Russell Horowitz became president of InfoSpace. The same year, InfoSpace used a controversial accounting method to report $46 million in profits when in fact it had lost $282 million. Company executives skirted SEC trading restrictions to sell large blocks of their personal stock.
Jain resumed the role of CEO in 2001, but was soon forced out by InfoSpace's board in December 2002. By June 2002, the company's stock price, which reached $1,305 in March 2000, had dropped sharply to $2.67.
In December 2002, Jim Voelker assumed Jain's role as chairman, CEO and President of InfoSpace. Voelker shut down or sold many of InfoSpace's 12 businesses to focus on five core segments. In 2003, InfoSpace acquired Moviso from Vivendi Universal Net USA. In early March 2003, InfoSpace sued Jain alleging he violated non-compete agreements in his role at newly founded Intelius. In April 2003, Jain resigned from the InfoSpace board.
In 2004, InfoSpace acquired online yellow pages service Switchboard. It also moved into the mobile games space, acquiring Atlas Mobile, IOMO and Elkware. InfoSpace reported $249 million in revenue that year, up 89 percent from the previous year.
In 2007, InfoSpace sold Atlas Mobile studio to Twistbox, Moviso to mobile content tech firm FunMobility, and IOMO re-emerged as FinBlade. InfoSpace's directory services were acquired by Idearc for $225
|
https://en.wikipedia.org/wiki/Transactional%20NTFS
|
Transactional NTFS (abbreviated TxF) is a component introduced in Windows Vista and present in later versions of the Microsoft Windows operating system that brings the concept of atomic transactions to the NTFS file system, allowing Windows application developers to write file-output routines that are guaranteed to either succeed completely or to fail completely.
Major operating system components, including System Restore, Task Scheduler, and Windows Update, rely on TxF for stability. During the development of Windows Vista, WinFS also relied on TxF for storing files.
Due to its complexity and various nuances which developers need to consider as part of application development, Microsoft has deprecated TxF and stated that it may be removed in a future version of Windows. Microsoft has strongly recommended that developers investigate using the alternatives rather than adopting the Transactional NTFS API platform which may not be available in future versions of Windows.
Overview
Transactional NTFS allows for files and directories to be created, modified, renamed, and deleted atomically. Using transactions ensures correctness of operation; in a series of file operations (done as a transaction), the operation will be committed if all the operations succeed. In case of any failure, the entire operation will roll back and fail.
Transactional NTFS is implemented on top of the Kernel Transaction Manager, which is a Windows kernel component introduced in Windows Vista that provides transactioning of objects in the kernel. The NTFS file system already supports journaling of low-level operations, such as writing a block of data. Transactional NTFS expands on this capability to include:
Atomic operations on a single file: A common example of this is saving a file from an application; if the application or machine were to crash while writing the file, then only part of the file could be written, possibly resulting in a corrupted file. This would be a very significant problem if a previous version of the file was being over-written, as data would likely be lost.
Atomic operations spanning multiple files: If an application needs to update several files at once with a set of changes, all the necessary file operations can be performed as a single transaction, preventing inconsistent updates in the event of a failure.
Atomic operations spanning multiple computers: Performing the same operation on multiple computers is a fairly common administrative task in a corporate network; Transactional NTFS integrates with the Distributed Transaction Coordinator to ensure that the change is successfully applied to all machines.
With the exception of read operations, using Transactional NTFS for transactions on Encrypting File System files is not supported in Windows Vista until Service Pack 1 and Windows Server 2008.
See also
ACID
Features new to Windows Vista
Technical features new to Windows Vista
References
External links
Because We Can, a Microsoft devel
|
https://en.wikipedia.org/wiki/Manual%20memory%20management
|
In computer science, manual memory management refers to the usage of manual instructions by the programmer to identify and deallocate unused objects, or garbage. Up until the mid-1990s, the majority of programming languages used in industry supported manual memory management, though garbage collection has existed since 1959, when it was introduced with Lisp. Today, however, languages with garbage collection such as Java are increasingly popular and the languages Objective-C and Swift provide similar functionality through Automatic Reference Counting. The main manually managed languages still in widespread use today are C and C++ – see C dynamic memory allocation.
Description
Many programming languages use manual techniques to determine when to allocate a new object from the free store. C uses the malloc function; C++ and Java use the new operator; and many other languages (such as Python) allocate all objects from the free store. Determining when an object ought to be created (object creation) is generally trivial and unproblematic, though techniques such as object pools mean an object may be created before immediate use. The real challenge is object destruction – determination of when an object is no longer needed (i.e. is garbage), and arranging for its underlying storage to be returned to the free store for re-use. In manual memory allocation, this is also specified manually by the programmer; via functions such as free() in C, or the delete operator in C++ – this contrasts with automatic destruction of objects held in automatic variables, notably (non-static) local variables of functions, which are destroyed at the end of their scope in C and C++.
Manual memory management techniques
For example
malloc/free
Memory arena
scratch buffer
...
Manual management and correctness
Manual memory management is known to enable several major classes of bugs into a program when used incorrectly, notably violations of memory safety or memory leaks. These are a significant source of security bugs.
When an unused object is never released back to the free store, this is known as a memory leak. In some cases, memory leaks may be tolerable, such as a program which "leaks" a bounded amount of memory over its lifetime, or a short-running program which relies on an operating system to deallocate its resources when it terminates. However, in many cases memory leaks occur in long-running programs, and in such cases an unbounded amount of memory is leaked. When this occurs, the size of the available free store continues to decrease over time; when it is finally exhausted, the program then crashes.
Catastrophic failure of the dynamic memory management system may result when an object's backing memory is deleted out from under it more than once; an object is explicitly destroyed more than once; when, while using a pointer to manipulate an object not allocated on the free store, a programmer attempts to release said pointer's target object's backing memor
|
https://en.wikipedia.org/wiki/Flying%20Warriors
|
Flying Warriors is an action video game developed and published by Culture Brain for the NES in North America in February 1991. It is a mixture of two Family Computer video games in the Hiryū no Ken franchise: it is a heavily reworked version of Hiryu no Ken II: Dragon no Tsubasa, in which various ideas and elements from Hiryu no Ken III: 5 Nin no Ryuu Senshi have also been implemented.
The first installment of the Hiryū no Ken series had already been released in North America as Flying Dragon: The Secret Scroll, with virtually no modification aside from the language.
Gameplay
The game features combat in a variety of formats, such as kicking and using fireballs to repel monsters in scrolling stages, a system during one-on-one duels against Tusk Soldiers or a pair of martial arts tournaments where the player must attack a mark that appears on their opponent's body, or defend the area when it appears on them (this system is similar to Culture Brain's original Flying Dragon for the NES), and RPG-style command battles against monster bosses. When confronted by a Tusk Soldier or other otherworldly villain, Rick can change into a costumed superhero form or switch with one of his teammates. The player must switch to Flying Warrior form to use the characters' magic powers and defend themselves from the Tusk Soldiers' magic spells.
Plot
A long time ago, Demonyx of the Dark Dimension attempted to invade the Light Dimension. After a long battle, the hero of the Light Dimension, Dragonlord, sealed Demonyx up by the power of the Mandara Talisman, at which time Demonyx prophesied that he would be back upon the appearance of the Red Evil Star.
Years later, an ominous red star appeared in the sky. Just then, five shooting lights came down toward the ground.
Rick Stalker was brought up by Kung Fu master Gen Lao-Tsu, and is alone in the mountains as usual brushing up on his Kung Fu skills when he comes upon a weeping angel missing her robe. He explores the mountain's caves and ends up encountering a gargoyle who is really a Tusk Soldier in disguise guarding the robe, which is embedded in a rock. Upon the return of her robe, the angel shows Rick a secret passage down the ravine, where he finds a mysterious orb.
Rick goes back to tell Gen the whole story. Gen apprises him that this orb is the Orb of Courage, and that Rick should cross the ocean to Gen's motherland China, where his fate is waiting for him.
Rick goes to China and enters the Shorin temple, the head temple of Kung-Fu, where he spars with Fusetsu, Ensetsu, and Rakan in three separate chambers. When Ensetsu is defeated by Rick, he gives him the Mirror of Mercury, stating that Rick may be the fighter for whom they have been waiting. In the final chamber, Rakan tells Rick that the Orb of Courage is part of the Mandara Talisman, which was used to seal up Demonyx a long time ago, and that Rick will have to locate all the broken pieces of the Talisman to seal him up again. While sparring with Rick, Raka
|
https://en.wikipedia.org/wiki/SMDR
|
SMDR may refer to:
Simple Metadata Registry, a way of describing metadata
Station Messaging Detail Record, a way to record telecommunications system activity, also known as Call detail record or CDR
Prince Rogers Nelson song title, SMDR is an abbreviation for "Sex, Music, Drugs, Romance".
|
https://en.wikipedia.org/wiki/Fox%20Saturday%20Baseball
|
Fox Saturday Baseball is an American television presentation of Major League Baseball (MLB) games produced by Fox Sports for the Fox network on Saturday afternoons.
Fox's coverage includes 4 weeks worth of coverage as of 2023. Coverage usually includes 2 to 4 separate games all starting at 4PM ET, local affiliates air the game of most interest to their audience.
History
Fox has used numerous scheduling formulas for its Saturday regular season coverage. These have often changed based on the rights granted by new television contracts, and the pregame programs that the network has chosen to air. From 1996 to 2006, Fox began its weekly game telecasts on the Saturday of Memorial Day weekend or the weekend before. The selection of games varied on a regional basis, and the start times were staggered based on region. A half-hour pregame show aired at 12:30 p.m. Eastern Time, followed by game broadcasts held at 1 p.m. in the Eastern and Central Time Zones. West Coast games did not air until 4 p.m. Eastern Time (1 p.m. in the Pacific Time Zone). All of these games were exclusive to the broadcast network, and as a result, Fox's exclusivity window lasted through the entire afternoon.
In 2007, Fox began airing games every Saturday during the season. A new scheduling format was devised, in which all of the regional games started simultaneously. Fox moved the pregame, which became part of the exclusive game window, to 3:30 p.m. Eastern Time. All of the Fox games would then start at 3:55 p.m. Eastern Time, regardless of region. This format gave more leeway for teams not being shown on Fox to schedule daytime games. Fox's exclusivity began at the start of the pregame at 3:30 and ran until 7 p.m. Eastern.
Fox discontinued its pregame show in 2009, with the telecasts now beginning at 4 p.m. Eastern and the game time being pushed to 4:10. Fox gave up the first half-hour of its exclusivity, with its window now beginning at 4 p.m. Eastern Time. This scheduling formula was used through 2011 for the regular season. Beginning in 2010, several of the Saturday games aired in prime time during the spring. These telecasts used an exclusivity window from 7 to 10:30 p.m. Eastern Time, as the network revived a pregame show for these games, airing at 7 p.m. with the game at 7:15.
In 2012, the pregame show returned full-time, prompting another change in scheduling. The normal scheduling in 2012 and 2013 was for the pregame airing at either 12:30 or 3:30 p.m. Eastern Time. The pregame is not a part of Fox's exclusive window, which began with the game telecast starting a half-hour later. The scheduling did not change for the spring prime time games, however, as the scheduling for these games remained the same as in 2010 and 2011. However these games began being branded as Baseball Night in America games instead of Fox Saturday Baseball.
In 2021 and 2022, Fox did not air Fox Saturday Baseball afternoon games, instead moving its entire MLB schedule to primetime Baseball Night
|
https://en.wikipedia.org/wiki/X.28
|
X.28 is an ITU-T standard specifying the interface between asynchronous character-mode data terminal equipment (DTE), such as computer terminals, and a Packet Assembler/Disassembler (PAD) that connects the DTE to a packet switched network such as an X.25 network.
External links
X.28 standard at ITU site
ITU-T recommendations
ITU-T X Series Recommendations
|
https://en.wikipedia.org/wiki/Referer%20spoofing
|
In HTTP networking, typically on the World Wide Web, referer spoofing (based on a canonised misspelling of "referrer") sends incorrect referer information in an HTTP request in order to prevent a website from obtaining accurate data on the identity of the web page previously visited by the user.
Overview
Referer spoofing is typically done for data privacy reasons, in testing, or in order to request information (without genuine authority) which some web servers may only supply in response to requests with specific HTTP referers.
To improve their privacy, individual browser users may replace accurate referer data with inaccurate data, though many simply suppress their browser's sending of any referer data. Sending no referrer information is not technically spoofing, though sometimes also described as such.
In software, systems and networks testing, and sometimes penetration testing, referer spoofing is often just part of a larger procedure of transmitting both accurate and inaccurate as well as expected and unexpected input to the HTTPD system being tested and observing the results.
While many websites are configured to gather referer information and serve different content depending on the referer information obtained, exclusively relying on HTTP referer information for authentication and authorization purposes is not a genuine computer security measure. HTTP referer information is freely alterable and interceptable, and is not a password, though some poorly configured systems treat it as such.
Application
Some websites, especially many image hosting sites, use referer information to secure their materials: only browsers arriving from their web pages are served images. Additionally a site may want users to click through pages with advertisements before directly being able to access a downloadable file – using the referring page or referring site information can help a site redirect unauthorized users to the landing page the site would like to use.
If attackers acquire knowledge of these approved referrers, which is often trivial because many sites follow a common template, they can use that information combined with this to exploit and gain access to the materials.
Spoofing often allows access to a site's content where the site's web server is configured to block browsers that do not send referer headers. Website owners may do this to disallow hotlinking.
It can also be used to defeat referer checking controls that are used to mitigate Cross-Site Request Forgery attacks.
Tools
Several software tools exist to facilitate referer spoofing in web browsers. Some are extensions to popular browsers such as Mozilla Firefox or Internet Explorer, which may provide facilities to customise and manage referrer URLs for each website the user visits.
Other tools include proxy servers, to which an individual configures their browser to send all HTTP requests. The proxy then forwards different headers to the intended website, usually removing or modify
|
https://en.wikipedia.org/wiki/X.3
|
X.3 is an ITU-T standard indicating what functions are to be performed by a Packet Assembler/Disassembler (PAD) when connecting character-mode data terminal equipment (DTE), such as a computer terminal, to a packet switched network such as an X.25 network, and specifying the parameters that control this operation.
The following is list of X.3 parameters associated with a PAD:
1 PAD recall using a character
2 Echo
3 Selection of data forwarding character
4 Selection of idle timer delay
5 Ancillary device control
6 Control of PAD service signals
7 Operation on receipt of break signal
8 Discard output
9 Padding after carriage return
10 Line folding
11 DTE speed
12 Flow control of the PAD
13 Linefeed insertion after carriage return
14 Padding after linefeed
15 Editing
16 Character delete
17 Line delete
18 Line display
19 Editing PAD service signals
20 Echo mask
21 Parity treatment
22 Page wait
References
External links
X.3 standard at ITU site
Cisco Web Page Definition of X.3 parameters
Networking standards
X.25
|
https://en.wikipedia.org/wiki/Noweb
|
Noweb, stylised in lowercase as noweb, is a literate programming tool, created in 1989–1999 by Norman Ramsey, and designed to be simple, easily extensible and language independent.
As in WEB and CWEB, the main components of Noweb are two programs: "notangle", which extracts 'machine' source code from the source texts, and "noweave", which produces nicely-formatted printable documentation.
Noweb supports TeX, LaTeX, HTML, and troff back ends and works with any programming language. Besides simplicity this is the main advantage over WEB, which needs different versions to support programming languages other than Pascal. (Thus the necessity of CWEB, which supports C and similar languages.)
Noweb's input
A Noweb input text contains program source code interleaved with documentation. It consists of so-called chunks that are either documentation chunks or code chunks.
A documentation chunk begins with a line that starts with an at sign (@) followed by a space or newline. A documentation chunk has no name. Documentation chunks normally contain LaTeX, but Noweb is also used with HTML, plain TeX, and troff.
Code chunks are named. A code chunk begins with
<<chunk name>>=
on a line by itself. The double left angle bracket (<<) must be in the first column.
Each chunk is terminated by the beginning of another chunk. If the first line in the file does not mark the beginning of a chunk, it is assumed to be the first line of a documentation chunk.
Code chunks aren't treated specially by Noweb's tools—they may be placed in any order and, when needed, they are just concatenated. Chunk references in code are dereferenced and the whole requested source code is extracted.
Example of a simple Noweb program
This is an example of a "hello world" program with documentation:
\section{Hello world}
Today I awoke and decided to write
some code, so I started to write Hello World in \textsf C.
<<hello.c>>=
/*
<<license>>
*/
#include <stdio.h>
int main(int argc, char *argv[]) {
printf("Hello World!\n");
return 0;
}
@
\noindent \ldots then I did the same in PHP.
<<hello.php>>=
<?php
/*
<<license>>
*/
echo "Hello world!\n";
?>
@
\section{License}
Later the same day some lawyer reminded me about licenses.
So, here it is:
<<license>>=
This work is placed in the public domain.
Assuming that the above code is placed in a file named 'hello.nw', the command to extract the human-readable document in HTML format is:
noweave -filter l2h -index -html hello.nw | htmltoc > hello.html
... and in LaTeX format:
noweave -index -latex hello.nw > hello.tex
To extract machine source code:
notangle -Rhello.c hello.nw > hello.c
notangle -Rhello.php hello.nw > hello.php
Compatibility
Noweb defines a specific file format and a file is likely to interleave three different formats (Noweb, LaTeX and the language used for the software). This is not recognised by other software development tools and consequently using Noweb excludes the use of UML or code documentation
|
https://en.wikipedia.org/wiki/ACM%20Transactions%20on%20Graphics
|
ACM Transactions on Graphics (TOG) is a bimonthly peer-reviewed scientific journal that covers the field of computer graphics.
The editor-in-chief is Carol O'Sullivan (Trinity College Dublin). According to the Journal Citation Reports, the journal had a 2020 impact factor of 5.414. The journal ranks 1st in computer graphics publications, according to Google Scholar Metrics.
History
It was established in 1982 and is published by the Association for Computing Machinery. TOG publishes two special issues for ACM SIGGRAPH's conference proceedings. Starting in 2003, all papers accepted for presentation at the annual SIGGRAPH conference are printed in a special summer issue of the journal. Beginning in 2008, papers presented at SIGGRAPH Asia are printed in a special November/December issue.
References
External links
Computer graphics
Computer science journals
Transactions on Graphics
Bimonthly journals
|
https://en.wikipedia.org/wiki/Cadena%20Salsoul
|
Cadena Salsoul is an entertainment-focused salsa radio network in Puerto Rico.
The SalSoul Network, made up of two simulcast FM facilities, has been top rated in every significant demographic since 1986. In the important age groups, the network often doubled the audience of the number two station in this market of 125 stations and 3.5 million persons.
The WPRM-FM and WIVA-FM network made up the first instance in the U.S. of using two FM signals to cover all of a large market. WPRM covers San Juan and Ponce; WIVA covers Mayagüez and Arecibo. They also added WRIO Ponce to the network. Together, they cover the "consolidated" market favored by advertising agencies. In a survey conducted in 2015, listeners ranked them the third best station, after KQ 105 FM and Z-93 FM. Through use of parallel clustering, spots could be sold locally on either signal for smaller retail accounts.
Since December 26, 2012, and after 53 years broadcasting on the frequency of 98.5 FM, the radio station, with the approval of the Federal Communications Commission in the United States, has changed to 99.1 FM for the best coverage.
Programming
La Perrera
Móntala con Salsoul
El Show de Jesse y Bebe
El Bollete
SalSoul en la Noche
References
External links
Propulsor de una radio revolucionaria (Spanish)
Puerto Rican radio
Radio stations established in 1959
1959 establishments in Puerto Rico
Salsa music
|
https://en.wikipedia.org/wiki/Recursion%20%28computer%20science%29
|
In computer science, recursion is a method of solving a computational problem where the solution depends on solutions to smaller instances of the same problem. Recursion solves such recursive problems by using functions that call themselves from within their own code. The approach can be applied to many types of problems, and recursion is one of the central ideas of computer science.
Most computer programming languages support recursion by allowing a function to call itself from within its own code. Some functional programming languages (for instance, Clojure) do not define any looping constructs but rely solely on recursion to repeatedly call code. It is proved in computability theory that these recursive-only languages are Turing complete; this means that they are as powerful (they can be used to solve the same problems) as imperative languages based on control structures such as and .
Repeatedly calling a function from within itself may cause the call stack to have a size equal to the sum of the input sizes of all involved calls. It follows that, for problems that can be solved easily by iteration, recursion is generally less efficient, and, for large problems, it is fundamental to use optimization techniques such as tail call optimization.
Recursive functions and algorithms
A common algorithm design tactic is to divide a problem into sub-problems of the same type as the original, solve those sub-problems, and combine the results. This is often referred to as the divide-and-conquer method; when combined with a lookup table that stores the results of previously solved sub-problems (to avoid solving them repeatedly and incurring extra computation time), it can be referred to as dynamic programming or memoization.
Base case
A recursive function definition has one or more base cases, meaning input(s) for which the function produces a result trivially (without recurring), and one or more recursive cases, meaning input(s) for which the program recurs (calls itself). For example, the factorial function can be defined recursively by the equations and, for all , . Neither equation by itself constitutes a complete definition; the first is the base case, and the second is the recursive case. Because the base case breaks the chain of recursion, it is sometimes also called the "terminating case".
The job of the recursive cases can be seen as breaking down complex inputs into simpler ones. In a properly designed recursive function, with each recursive call, the input problem must be simplified in such a way that eventually the base case must be reached. (Functions that are not intended to terminate under normal circumstances—for example, some system and server processes—are an exception to this.) Neglecting to write a base case, or testing for it incorrectly, can cause an infinite loop.
For some functions (such as one that computes the series for ) there is not an obvious base case implied by the input data; for these one may add a parameter (s
|
https://en.wikipedia.org/wiki/Programming%20model
|
A programming model is an execution model coupled to an API or a particular pattern of code. In this style, there are actually two execution models in play: the execution model of the base programming language and the execution model of the programming model. An example is Spark where Java is the base language, and Spark is the programming model. Execution may be based on what appear to be library calls. Other examples include the POSIX Threads library and Hadoop's MapReduce. In both cases, the execution model of the programming model is different from that of the base language in which the code is written. For example, the C programming language has no behavior in its execution model for input/output or thread behavior. But such behavior can be invoked from C syntax, by making what appears to be a call to a normal C library.
What distinguishes a programming model from a normal library is that the behavior of the call cannot be understood in terms of the language the program is written in. For example, the behavior of calls to the POSIX thread library cannot be understood in terms of the C language. The reason is that the call invokes an execution model that is different from the execution model of the language. This invocation of an outside execution model is the defining characteristic of a programming model, in contrast to a programming language.
In parallel computing, the execution model often must expose features of the hardware in order to achieve high performance. The large amount of variation in parallel hardware causes a concurrent need for a similarly large number of parallel execution models. It is impractical to make a new language for each execution model, hence it is a common practice to invoke the behaviors of the parallel execution model via an API. So, most of the programming effort is done via parallel programming models rather than parallel languages. The terminology around such programming models tends to focus on the details of the hardware that inspired the execution model, and in that insular world the mistaken belief is formed that a programming model is only for the case when an execution model is closely matched to hardware features.
References
Computer programming
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.