source
stringlengths 32
199
| text
stringlengths 26
3k
|
|---|---|
https://en.wikipedia.org/wiki/Security%20Identifier
|
In the context of the Microsoft Windows NT line of operating systems, a Security Identifier (SID) is a unique, immutable identifier of a user, user group, or other security principal. A security principal has a single SID for life (in a given domain), and all properties of the principal, including its name, are associated with the SID. This design allows a principal to be renamed (for example, from "Jane Smith" to "Jane Jones") without affecting the security attributes of objects that refer to the principal.
Overview
Windows grants or denies access and privileges to resources based on access control lists (ACLs), which use SIDs to uniquely identify users and their group memberships. When a user logs into a computer, an access token is generated that contains user and group SIDs and user privilege level. When a user requests access to a resource, the access token is checked against the ACL to permit or deny particular action on a particular object.
SIDs are useful for troubleshooting issues with security audits, Windows server and domain migrations.
The format of a SID can be illustrated using the following example: "S-1-5-21-3623811015-3361044348-30300820-1013":
Identifier Authority Values
Identifier Authority Value
Known identifier authority values are:
Identifying a capability SID:
If a user finds the SID in the registry data, then it is a capability SID. By design, it will not resolve into a friendly name.
If the user does not find the SID in the registry data, then it is not a known capability SID. It can still be troubleshooted as a normal unresolved SID. There is a small chance that the SID could be a third-party capability SID, in which case it will not resolve into a friendly name.
Per Microsoft Support: Important - DO NOT DELETE capability SIDS from either the Registry or file system permissions. Removing a capability SID from file system permissions or registry permissions may cause a feature or application to function incorrectly. After you remove a capability SID, you cannot use the UI to add it back.
S-1-5 Subauthority Values
Virtual Accounts are defined for a fixed set of class names, but the account name isn't defined. There are a nearly infinite number of accounts available within a Virtual Account. The names work like "Account Class\Account Name" so "AppPoolIdentity\Default App Pool". The SID is based on a SHA-1 hash of the lower-case name. Virtual Accounts can each be given permissions separately as each maps to a distinct SID. This prevents the "cross-sharing permissions" problem where each service is assigned to the same NT AUTHORITY class (such as "NT AUTHORITY\Network Service").
Machine SIDs
The machine SID (S-1-5-21) is stored in the SECURITY registry hive located at SECURITY\SAM\Domains\Account, this key has two values F and V. The V value is a binary value that has the computer SID embedded within it at the end of its data (last 96 bits). (Some sources state that it is stored in the SAM hive instead.) A b
|
https://en.wikipedia.org/wiki/KGCW
|
KGCW (channel 26) is a television station licensed to Burlington, Iowa, United States, serving as the CW network outlet for the Quad Cities area. It is owned and operated by network majority owner Nexstar Media Group alongside regional CBS affiliate WHBF-TV (channel 4). Nexstar also provides certain services to Fox affiliate KLJB (channel 18) under a shared services agreement (SSA) with Mission Broadcasting. The stations share studios in the Telco Building on 18th Street in downtown Rock Island, Illinois, while KGCW's transmitter is located near Orion, Illinois.
Channel 26 began broadcasting as KJMH, a local station for Burlington, in January 1988 and became a Fox affiliate that July. It was owned by local businessman Steve Hoth, who named it for his wife, JoEllen M. Hoth. In May 1994, the station lost access to Fox programming after the network moved to strip KJMH of its affiliation. It then went off the air that November.
Grant Communications acquired the station and returned it to the air on March 1, 1996, rebroadcasting KLJB-TV in Davenport. In January 2001, channel 26 was split from channel 18 to become the affiliate of The WB in the Quad Cities, where it was seen on cable and a subchannel of KLJB, and its transmitter was relocated from Burlington to a site that offered increased coverage of the Quad Cities. The station became affiliated with The CW in 2006 when The WB and UPN merged. Nexstar acquired the Grant stations in 2014, coinciding with the separate purchase of WHBF-TV.
History
KJMH: The Hoth years
Burlington Broadcast Company, which was owned by local businessman Steve Hoth, obtained a construction permit for a new television station in Burlington in 1984. The station went unbuilt for three years. An intended November 1987 launch was scrapped because of equipment problems. KJMH—named for JoEllen M. Hoth, Steven's wife—began broadcasting on January 5, 1988. The station, airing a mix of independent station programming and (for a time) a local newscast, represented a $1 million investment. It broadcast with an effective radiated power of 200,000 watts from a transmitting facility at Roosevelt Avenue and Winegard Drive in Burlington, sufficient only to reach the Burlington area: Mount Pleasant sat on the edge of the contour, and cities such as Keokuk and Muscatine were outside of its signal range.
Even though KJMH affiliated with Fox on July 31, 1988, financial precarity was a major issue in the station's early history. Amid reports that the station's payroll checks were bouncing, the general manager resigned in 1991. Two years later, in November 1993, Fox moved to strip KJMH of its affiliation. Hoth hired a Chicago law firm to fight the disaffiliation in court but was unsuccessful, and KJMH ceased airing Fox programming in May 1994. The station then aired programming from home shopping service ValueVision and Channel America, which had historically catered to low-power stations.
In November 1994, Hoth announced the sale of 80 per
|
https://en.wikipedia.org/wiki/3-partition%20problem
|
The 3-partition problem is a strongly NP-complete problem in computer science. The problem is to decide whether a given multiset of integers can be partitioned into triplets that all have the same sum. More precisely:
The input to the problem is a multiset S of n = 3 positive integers. The sum of all integers is .
The output is whether or not there exists a partition of S into m triplets S1, S2, …, Sm such that the sum of the numbers in each one is equal to T. The S1, S2, …, Sm must form a partition of S in the sense that they are disjoint and they cover S.
The 3-partition problem remains strongly NP-complete under the restriction that every integer in S is strictly between T/4 and T/2.
Example
The set can be partitioned into the four sets , each of which sums to T = 90.
The set can be partitioned into the two sets each of which sum to T = 15.
(every integer in S is strictly between T/4 and T/2): , thus m=2, and T=15. There is feasible 3-partition .
(every integer in S is strictly between T/4 and T/2): , thus m=2, and T=15. There is no feasible solution.
Strong NP-completeness
The 3-partition problem remains NP-complete even when the integers in S are bounded above by a polynomial in n. In other words, the problem remains NP-complete even when representing the numbers in the input instance in unary. i.e., 3-partition is NP-complete in the strong sense or strongly NP-complete. This property, and 3-partition in general, is useful in many reductions where numbers are naturally represented in unary.
3-Partition vs Partition
The 3-partition problem is similar to the partition problem, in which the goal is to partition S into two subsets with equal sum, and the multiway number partitioning, in which the goal is to partition S into k subsets with equal sum, where k is a fixed parameter. In 3-Partition the goal is to partition S into m = n/3 subsets, not just a fixed number of subsets, with equal sum. Partition is "easier" than 3-Partition: while 3-Partition is strongly NP-hard, Partition is only weakly NP-hard - it is hard only when the numbers are encoded in non-unary system, and have value exponential in n. When the values are polynomial in n, Partition can be solved in polynomial time using the pseudopolynomial time number partitioning algorithm.
Variants
In the unrestricted-input variant, the inputs can be arbitrary integers; in the restricted-input variant, the inputs must be in (T/4, T/2). The restricted version is as hard as the unrestricted version: given an instance Su of the unrestricted variant, construct a new instance of the restricted version }. Every solution of Su corresponds to a solution of Sr but with a sum of 7 instead of T, and every element of Sr is in which is contained in .
In the distinct-input variant, the inputs must be in (T/4, T/2), and in addition, they must all be distinct integers. It, too, is as hard as the unrestricted version.
In the unrestricted-output variant, the m output subsets
|
https://en.wikipedia.org/wiki/Intelligent%20computer-assisted%20language%20learning
|
Intelligent Computer Assisted Language Learning (ICALL), or Intelligent Computer Assisted Language Instruction (ICALI), involves the application of computing technologies to the teaching and learning of second or foreign languages. ICALL combines Artificial intelligence with Computer Assisted Language Learning (CALL) systems to provide software that interacts intelligently with students, responding flexibly and dynamically to student's learning progress.
Natural language processing (NLP) and Intelligent tutoring systems (ITS) are prominent computing technologies in artificial intelligence that inform and influence ICALL. Other computing technologies applied to ICALL include Knowledge representation (KP), Automatic Speech Recognition (ASR), Neural networks, User modelling, and Expert systems. In relation to language learning, ICALL utilizes linguistic theory and theories of second-language acquisition in its pedagogy.
History
ICALL developed from the field of Computer Assisted Language Learning (CALL) in the late 1970s and early 1980s. ICALL is a smaller field, and not yet fully formed.
Following the pattern of most language learning technologies, English is a prominent language featured in ICALL technology. ICALL programs have also been developed in languages such as German, Japanese, Portuguese, Mandarin Chinese, and Arabic. ICALL systems are also contributing to the learning of languages that are not as accessible to learn (due to a lesser amount of language resources), or less commonly learned languages, such as Cree.
Features
Intelligent CALL is sometimes called parser-based CALL, due to the heavy reliance that ICALL has on parsing. An example of the function of parsing in an ICALL software is a parser detecting errors in the syntax and morphology of sentences freely generated by student users. After using parsing to find any errors, ICALL can provide corrective feedback to students. Parsing is considered a task of natural language processing.
The ability for students to receive feedback on random, uniquely produced sentences places ICALL in a more engaging teacher role. If students are struggling in certain areas, some ICALL systems will invent new sentences or questions in those areas, giving students more practice. Basically, ICALL is meant to intelligently adapt to student learning needs as a student progresses; this often means (partially or wholly) fulfilling a tutor or teacher role. Programs that attempt to fulfill this role are categorized as tutorial ICALL.
Non-tutorial ICALL systems include various language tools and dialogue systems, such as a digital interlocutor. Programs for automatically evaluating student-written essays have also been invented, such as the E-rater.
Limitations
ICALL technology still has many issues and limitations, due to the recency of artificial intelligence being integrated into CALL systems, and the complexity of this enormous task. Artificially intelligent educational software should do it
|
https://en.wikipedia.org/wiki/Job%20control%20%28Unix%29
|
In Unix and Unix-like operating systems, job control refers to control of jobs by a shell, especially interactively, where a "job" is a shell's representation for a process group. Basic job control features are the suspending, resuming, or terminating of all processes in the job/process group; more advanced features can be performed by sending signals to the job. Job control is of particular interest in Unix due to its multiprocessing, and should be distinguished from job control generally, which is frequently applied to sequential execution (batch processing).
Overview
When using Unix or Unix-like operating systems via a terminal (or terminal emulator), a user will initially only have a single process running, their interactive shell (it may be login shell or may be not). Most tasks (directory listing, editing files, etc.) can easily be accomplished by letting the program take control of the terminal and returning control to the shell when the program exits – formally, by attaching to standard input and standard output to the shell, which reads or writes from the terminal, and catching signals sent from the keyboard, like the termination signal resulting from pressing .
However, sometimes the user will wish to carry out a task while using the terminal for another purpose. A task that is running but is not receiving input from the terminal is said to be running "in the background", while the single task that is receiving input from the terminal is "in the foreground". Job control is a facility developed to make this possible, by allowing the user to start processes in the background, send already running processes into the background, bring background processes into the foreground, and suspend or terminate processes.
The concept of a job maps the (shell) concept of a single shell command to the (operating system) concept of the possibly many processes that the command entails. Multi-process tasks come about because processes may create additional child processes, and a single shell command may consist of a pipeline of multiple communicating processes. For example, a command to select lines containing the text "title", sort these alphabetically, and display the result in a pager.
grep title somefile.txt | sort | less
This creates at least three processes: one for , one for , and one for . Job control allows the shell to control these related processes as one entity, and when a user issues the appropriate key combination (usually ), the entire group of processes gets suspended.
Jobs are managed by the operating system as a single process group, and the job is the shell's internal representation of such a group. This is defined in POSIX as:
A job can be referred to by a handle called the job control job ID or simply , which is used by shell builtins to refer to the job. Job IDs begin with the % character; %n identifies job n, while %% identifies the current job. Other job IDs are specified by POSIX. In informal usage the number may be referre
|
https://en.wikipedia.org/wiki/Unicode%20font
|
A Unicode font is a computer font that maps glyphs to code points defined in the Unicode Standard. The vast majority of modern computer fonts use Unicode mappings, even those fonts which only include glyphs for a single writing system, or even only support the basic Latin alphabet. Fonts which support a wide range of Unicode scripts and Unicode symbols are sometimes referred to as "pan-Unicode fonts", although as the maximum number of glyphs that can be defined in a TrueType font is restricted to 65,535, it is not possible for a single font to provide individual glyphs for all defined Unicode characters (). This article lists some widely used Unicode fonts (shipped with an operating system or produced by a well-known commercial font company) that support a comparatively large number and broad range of Unicode characters.
Background
The Unicode standard does not specify or create any font (typeface), a collection of graphical shapes called glyphs, itself. Rather, it defines the abstract characters as a specific number (known as a code point) and also defines the required changes of shape depending on the context the glyph is used in (e.g., combining characters, precomposed characters and letter-diacritic combinations). The choice of font, which governs how the abstract characters in the Universal Coded Character Set (UCS) are converted into a bitmap or vector output that can then be viewed on a screen or printed, is left up to the user. If a font is chosen which does not contain a glyph for a code point used in the document, it typically displays a question mark, a box, or some other substitute character.
Computer fonts use various techniques to display characters or glyphs. A bitmap font contains a grid of dots known as pixels forming an image of each glyph in each face and size. Outline fonts (also known as vector fonts) use drawing instructions or mathematical formulæ to describe each glyph. Stroke fonts use a series of specified lines (for the glyph's border) and additional information to define the profile, or size and shape of the line in a specific face and size, which together describe the appearance of the glyph.
Fonts also include embedded special orthographic rules to output certain combinations of letterforms (an alternative symbols for the same letter) be combined into special ligature forms (mixed characters). Operating systems, web browsers (user agent), and other software that extensively use typography, use a font to display text on the screen or print media, and can be programmed to use those embedded rules. Alternatively, they may use external script-shaping technologies (rendering technology or “smart font” engine), and they can also be programmed to use either a large Unicode font, or use multiple different fonts for different characters or languages.
No single "Unicode font" includes all the characters defined in the present revision of ISO 10646 (Unicode) standard, as more and more languages and characters
are continual
|
https://en.wikipedia.org/wiki/GDAL
|
The Geospatial Data Abstraction Library (GDAL) is a computer software library for reading and writing raster and vector geospatial data formats (e.g. shapefile), and is released under the permissive X/MIT style free software license by the Open Source Geospatial Foundation. As a library, it presents a single abstract data model to the calling application for all supported formats. It may also be built with a variety of useful command line interface utilities for data translation and processing. Projections and transformations are supported by the PROJ library.
The related OGR library (OGR Simple Features Library), which is part of the GDAL source tree, provides a similar ability for simple features vector graphics data.
GDAL was developed mainly by Frank Warmerdam until the release of version 1.3.2, when maintenance was officially transferred to the GDAL/OGR Project Management Committee under the Open Source Geospatial Foundation.
GDAL/OGR is considered a major free software project for its "extensive capabilities of data exchange" and also in the commercial GIS community due to its widespread use and comprehensive set of functionalities.
Software using GDAL/OGR
Several software programs use the GDAL/OGR libraries to allow them to read and write multiple GIS formats. Such programs include:
ArcGIS – Uses GDAL for custom raster formats
Avenza MAPublisher - GIS and mapping tools for Adobe Illustrator. Uses GDAL for coordinate system transformation, format reading & writing, geometry operations, & unit conversion.
Avenza Geographic Imager - Spatial imaging tools for Adobe Photoshop. Uses GDAL for coordinate system transformation, format reading & writing, & unit conversion.
Avenza Maps - iOS & Android mobile mapping application. Uses GDAL to read metadata information for geospatial maps / data to transform them to WGS84 for offline navigation.
Biosphere3D – Open source landscape scenery globe
Biotop Invent
Cadwork
ENVI – Remote Sensing software
ERDAS APOLLO - Image Server and remote sensing geo-services
ERDAS GeoCompressor - Image compression to ECW and JP2 formats
Geoconcept integrated GDAL in its 7.1 release
FWTools – A cross-platform open source GIS software bundle compiled by Frank Warmerdam
gdaltokmz – A Python module translating from GDAL-supported raster graphics formats to the Google Earth KMZ format
GeoDjango – Django's support for GIS-enabled databases
GeoDMS - A framework for building spatial calculation models.
GeoView Pro – iOS mobile mapping application
Google Earth – A virtual globe and world imaging program
GRASS GIS
gvSIG
JMap
MangoMap
MapServer
MS4W - MapServer for Windows, a widely popular installer for the MapServer community, using GDAL for data access.
MapWindow GIS - Open Source C++ based geographic information system, ActiveX Control, and application programmer interface
Merkaartor
NASA Ames Stereo Pipeline, an open-source software package for photogrammetry
World Wind Java – NASA's open source virtual globe and world
|
https://en.wikipedia.org/wiki/Sidalcea%20pedata
|
Sidalcea pedata, also called birdfoot checkerbloom or Big Bear checkerbloom, is a rare and endangered perennial herb of California. It blooms between May and July. However, it is an endemic species of California and only occurs in few places in the San Bernardino Mountains, primarily at Bear Valley, Bluff Lake. It grows at 1500–2100 m elevation in moist meadows to open woodlands and the unique pebble plain habitat of the area. Since Big Bear Valley is a resort destination, the birdfoot checkerbloom is threatened by development, vehicles and grazing.
Description
Sidalcea pedata grows from a fleshy taproot and can be as tall as 40 cm. It has few stems, which are erect and somewhat stellate at the base. The leaves are basal and are ternately divided into 5–7 parts. The flowers are about 1.3 cm long and are a deep rose-pink with darker veins. They are arranged in a spike-like raceme, with the upper flowers closely crowded together.
Like other species within the genus Sidalcea, such as S. oregana ssp,S. pedata is sexually dimorphic.
Other information
The birdfoot checkerbloom was listed as endangered by the state of California January 1982 and by the U.S. Federal Government August 31, 1984.
References and external links
Jepson Flora Project
Cal Flora
Ashman, T.-L.; Stanton, M.L. 1991. "Seasonal variation in pollination dynamics of the sexually dimorphic species, Sidalcea oregana ssp. spicata" (Malvaceae). Ecology''. 72: 993-1003.
pedata
Endemic flora of California
~
Natural history of the Transverse Ranges
Natural history of San Bernardino County, California
|
https://en.wikipedia.org/wiki/ASDF
|
ASDF may refer to:
asdfmovie, an animated sketch comedy series first distributed on YouTube
Advanced Scientific Data Format, a form of storing astronomical data
Air Self-Defense Force, in Japan
Alabama State Defense Force, a military entity
Alaska State Defense Force, a military entity
Another System Definition Facility, a build system for Common Lisp
ASDF, the sequence of letters from the left end of the home row on some keyboard layouts
|
https://en.wikipedia.org/wiki/NICMOSlook
|
NICMOSlook is a computer program to analyze spectral data obtained with the Near Infrared Camera and Multi-Object Spectrometer (NICMOS) on board the Hubble Space Telescope (HST). The program originated as Calnic C, which was designed at the Space Telescope European Coordinating Facility (ST-ECF) and programmed in IDL. NICMOSlook is available from their website.
One of the capabilities of NICMOS is its grism mode for slitless spectrometry at low resolution. Typically, a direct image is taken in conjunction with grism images for wavelength calibration. NICMOSlook is a highly specialized interactive tool to extract
one-dimensional spectra (flux versus wavelength) from such data.
NICMOSlook is most commonly used for small amounts of data when users prefer to have full control of all the parameters for individual spectrum extraction, or for cases where Calnic C did not extract the spectra satisfactorily. Unlike Calnic C, NICMOSlook requires the user to determine the best way to find an object and provides a number of different ways to accomplish this. Similarly, the user decides whether to use a weighting appropriate for point sources or weighting by the size of the object for the extraction of the spectra.
Calnic C
Calnic C is a non-interactive counterpart, a program that performs a subset of NICMOSlook's functions with a "pipelined" approach. Maintenance of Calnic C stopped in 2000 and the program is now considered to be obsolete.
External links
ST-ECF page for NICMOSlook
Hubble Space Telescope
Astronomy software
|
https://en.wikipedia.org/wiki/Space%20Telescope%20Science%20Data%20Analysis%20System
|
The Space Telescope Science Data Analysis System (STSDAS) is an IRAF-based suite of astronomical software for reducing and analyzing astronomical data. It contains general purpose tools and packages for processing data from the Hubble Space Telescope. STSDAS is produced by Space Telescope Science Institute (STScI). The STSDAS software is in the public domain and the source code is available.
See also
Space flight simulation game
List of space flight simulation games
Planetarium software
List of observatory software
References
External links
STSDAS Home Page
Free astronomy software
Hubble Space Telescope
|
https://en.wikipedia.org/wiki/NCOIC
|
NCOIC may refer to:
Non-Commissioned Officer in Charge, an individual in the enlisted ranks of a military unit who has limited command authority over others in the unit
Network Centric Operations Industry Consortium, an international not-for-profit, chartered in the United States
|
https://en.wikipedia.org/wiki/U.S.%20standard%20clothing%20size
|
U.S. standard clothing sizes for women were originally developed from statistical data in the 1940s and 1950s. At that time, they were similar in concept to the EN 13402 European clothing size standard, although individual manufacturers have always deviated from them, sometimes significantly.
However, as a result of various cultural pressures, most notably vanity sizing, North American clothing sizes have drifted substantially away from this standard over time, and now have very little connection to it. Instead, they now follow the more loosely defined standards known as U.S. catalog sizes.
Body measurements below are given in inches.
History
Men's standard sizes were probably developed first during the American Revolutionary War, and they were in regular use by the American army during the War of 1812 for ready-made uniforms . These were based on the chest measurement, with other measurements being assumed to be either proportional (the circumference of the neck, waist, hips, and thighs) or easily altered (length of the inseam) .
As this was largely successful in men, the same approach was attempted in the early 20th century for women using the bust as the sole measurement . However, this proved unsuccessful because women's bodies have far more variety in shape. The hourglass figure is frequently used as an industry standard, but only 8% of women have this body shape . A woman with an hourglass figure and a woman with an apple-shaped figure who have the same bust size will not have the same waist or hip sizes.
This was a significant problem for mail-order companies, and several attempts at predictable, standard sizing were made . In the 1940s, the statisticians Ruth O'Brien and William Shelton received a Works Progress Administration grant to conduct the most ambitious effort to solve this problem. Their team measured almost 15,000 women across the US. After discovering the complex diversity of women's actual sizes, which produced five to seven body shapes, they proposed a three-part sizing system. Each size would be the combination of a single number, representing an upper body measurement, plus an indicator for height (short, regular, and long) and an indication for girth (slim, regular, and stout). The various combinations of height and girth resulted in nine sizes for each numerical upper-body measurement, which was highly impractical for manufacturing .
As a result, O'Brien and Shelton's work was rejected. In 1958, the National Bureau of Standards invented a new sizing system, based on the hourglass figure and using only the bust size to create an arbitrary standard of sizes ranging from 8 to 38, with an indication for height (short, regular, and tall) and lower-body girth (plus or minus). The resulting commercial standard was not widely popular, and was declared voluntary in 1970 and withdrawn entirely in 1983. In 1995, ASTM International published its own voluntary standard, which has been revised since then . It has not been wide
|
https://en.wikipedia.org/wiki/Astrovirtel
|
Astrovirtel (Accessing Astronomical Archives as Virtual Telescopes, obs. code: I03) is a data archive used as virtual astronomical observatory. The project was funded from 2000 until 2003 and supported by the European Commission's Access to Research Infrastructures action of the Improving Human Potential Programme and managed by the Space Telescope European Coordinating Facility (ST-ECF) on behalf of European Space Agency and European Southern Observatory (ESO).
Its aim was to enhance the scientific return of the ST-ECF/ESO Archive, allowing European users to exploit the archive as a virtual telescope, retrieving and analyzing large quantities of data with the assistance of the archive operators and personnel. The Astrovirtel Selection Panel selected up to six proposals per year.
Astrovirtel was an initial step towards a proper virtual observatory, such as the European Virtual Observatory.
External links
First Light for ASTROVIRTEL Project, ESO, 10 April 2000
Virtual Telescope Observes Record-Breaking Asteroid, larger than Ceres, ESO, 23 August 2001
ASTROVIRTEL: Accessing Astronomical Archives as Virtual Telescopes, Pierfederici, F., Benvenuti, P. (2001)
ASTROVIRTEL: Tools and Operations, F. Pierfederici, M. Dolensky, Conference paper (2004), Springer Verlag
Virtual observatories
|
https://en.wikipedia.org/wiki/ESO/ST-ECF%20Science%20Archive%20Facility
|
The ESO/ST-ECF Science Archive Facility is an electronic archive for astronomical data. It currently contains more than 40.0 Terabytes of scientific data obtained with the ESA/NASA Hubble Space Telescope (HST), with the ESO New Technology Telescope (NTT) and Very Large Telescope (VLT) and with the Wide Field Imager on the ESO/MPI 2.2m Telescope.
External links
The ESO/ST-ECF Science Archive Facility
The European Southern Observatory
The Space Telescope-European Coordinating Facility
Works about astronomy
Hubble Space Telescope
|
https://en.wikipedia.org/wiki/On-The-Fly%20Calibration
|
In observational astronomy an On-The-Fly Calibration (OTFC) system calibrates data when a user's request for the data is processed so that users can obtain data that are calibrated with up-to-date calibration files, parameters, and software.
History of OTFC
The OTFC processing system was developed at the Canadian Astronomy Data Centre (CADC) and the Space Telescope European Coordinating Facility (ST-ECF) and is implemented at both sites and at Space Telescope Science Institute (STScI). The OTFC system currently provides data calibration for the Wide Field and Planetary Camera 2 (WFPC2) and Space Telescope Imaging Spectrograph (STIS). In the future, the Advanced Camera for Surveys (ACS) and possibly the Near Infrared Camera and Multi-Object Spectrometer (NICMOS) will be supported.
Goals of the system
The main goals behind the implementation of the OTFC system are to take advantage of better calibration files and the much smaller storage area required if only raw files are kept in the archives. The system can also offer more calibration steps than were available when the data was first released and can implement improved pipeline software.
Currently, for example, HST data are calibrated as they are received at the STScI. Raw and calibrated data are stored in the HST archive (DADS). Frequently, users must recalibrate the data at their home sites to take advantage of better calibration files or software. A large fraction (over 90%) of the calibrated data in the HST archive could be improved by recalibration, although the improvements are not always significant. In the past, instruments that undergo evolution of calibration files or calibration software often required users to carry out their own recalibrations at their home sites. With OTFC, the HST data archives carry out the recalibration.
Hubble Space Telescope
Space imagers
|
https://en.wikipedia.org/wiki/Lucy%E2%80%93Hook%20coaddition%20method
|
The Lucy–Hook coaddition method is an image processing technique for combining sub-stepped astronomical image data onto a finer grid. The method allows the option of resolution and contrast enhancement or the choice of a conservative, re-convolved, output.
Tests with very deep Hubble Space Telescope Wide Field and Planetary Camera 2 (WFPC2) imaging data of excellent quality show that these methods can be very effective and allow fine-scale features to be studied better than on the unprocessed images. The Lucy–Hook coaddition method is an extension of the standard Richardson–Lucy deconvolution iterative restoration method.
For many purposes it may be more convenient to combine dithered datasets using the Drizzle method.
References
External links
ST-ECF page about Lucy–Hook coaddition method
Astronomical imaging
Image processing
|
https://en.wikipedia.org/wiki/Casio%209850%20series
|
The Casio CFX-9850G series is a series of graphing calculators manufactured by Casio Computer Co., Ltd. from 1996 to 2008.
fx-9750G
Power
The back of the device shows a slightly protruding battery case cover, which slides out to reveal the compartment for the four AAA alkaline batteries used for primary power, and a CR2032 lithium button cell used for memory backup when primary power is down or being changed. The device consumes power at the rate of 0.06W, and turns itself off automatically after about 6 minutes of time spent without any keypad activity. Battery life for the primary power cells ranges from 300 hours (LR03 battery) to 200 hours (R03 battery) for continuous display of main menu. Backup cells last up to about 2 years each.
The calculators weigh about 190 grams including batteries, and measure about 19.7 mm x 83 mm x 176 mm. Features include scientific calculations, including calculus, graphing and programming, statistics and matrix operations.
Display
The display has a graphics resolution of 127 by 63 pixels (the first row and column of pixels are unusable in graphing), and a character resolution of 21 columns by 8 lines. The bottom line is reserved for function key menu tips, and the rest is available for the graphics and character display.
Memory
The calculators includes program capacity of 26 kilobytes. This is divided among storage blocks for programs, statistics, matrices, lists, static and dynamic graphs and their associated settings, functions, recursions, equations, financial data, and variables (all of which are global). These can be cleared individually or completely in the MEM menu.
When saving files, a file name uses 17 bytes of memory.
A command consumes 1 or 2 bytes.
Graphing
Graphs can be drawn with split-screen viewing of graphs as well as tables or zooms. Graphed areas can be shaded in customizable colors. The graph viewport can be resized and shifted (these settings can be saved for later retrieval), and points along the graph curves can be traced. Graph solver tools can also be used to find useful points, such as maxima/minima and intersection points. The calculator also has a special section for advanced conic section graphing. Dynamic graphing provides all the functionality of regular graphing, but allows the binding of a variable in the graph equation to time over a value range.
Lists and tables
Up to 36 lists can be stored and manipulated in various ways in the list manager. The lists can also be used to feed data into inbuilt statistics operations, producing various statistical figures, performing regression analysis, and generating graphs like scatter and box and whisker plots, among others. Tables can be generated from functions, recursive series can be generated, and equations can be solved - both simultaneous and polynomial.
Communications
The device can link up by cable to a computer (FA-122 and FA-123 (serial) and FA-124 (USB) interface unit and cables) or to another calculator (SB-62 cable) t
|
https://en.wikipedia.org/wiki/Drizzle%20%28disambiguation%29
|
Drizzle is a light liquid precipitation.
Drizzle may also refer to:
Drizzle (image processing), a digital image processing method
Drizzle (database server), a database management system
|
https://en.wikipedia.org/wiki/ACE%20%28magazine%29
|
ACE (Advanced Computer Entertainment) was a multi-format computer and video game magazine first published in the United Kingdom by Future Publishing and later acquired by EMAP.
History
ACE launched in October 1987, roughly the same time as Ludlow-based publisher Newsfield's own multi-format magazine The Games Machine.
The magazine staff consisted mainly of ex-Amstrad Action (AA) and Personal Computer Games staff, including launch co-editors Peter Connor and Steve Cooke. Andy Wilton, ex-AA, was brought in as Reviews Editor, while Dave Packer and Andy Smith were hired as Staff Writers. Trevor Gilham, another ex-AA member, held the position of Art Editor.
Between June and July 1989 (issues 21 and 22) the magazine was sold to EMAP, and Future Publishing redeployed the original ACE staff to work on their Amiga Format and ST Format titles. After the magazine was cancelled in April 1992, a number of the staff working on ACE at the time were moved to The One (for Amiga Games) to relaunch the latter magazine.
Content
Coverage initially included Atari ST, Amiga, C64, ZX Spectrum and Amstrad CPC, but also included newer machines as they were released. Although games features were the mainstay, other articles on graphics and computer music were featured. A cover cassette, and later a floppy disk, was included with the magazine featuring games demos.
Regular editorial features included Interface; News, Letters, The Blitter End. The Specials; features and Gameplay; Screen Test, Arcades, Tricks 'n' Tactics, Adventures.
Screen Test
Screen Test was the games review section. Games were rated (out of ten) on Visual effects, Audio, IQ Factor, Fun Factor and an overall rating. Games were seen by all the reviewers, and the overall rating was notable for scoring games out of 1000 rather than the usual percentage or mark out of 10. Also introduced was the Predicted Interest Curve graph where the game was given a line graph predicting the long term interest in the game over many months.
See also
Video game journalism
Video game industry
References
External links
Profile of ACE magazine at Amiga History
ACE Magazine Archive at the Internet Archive
1987 establishments in the United Kingdom
1992 disestablishments in the United Kingdom
Defunct computer magazines published in the United Kingdom
Magazines established in 1987
Magazines disestablished in 1992
Mass media in Bath, Somerset
Monthly magazines published in the United Kingdom
Video game magazines published in the United Kingdom
|
https://en.wikipedia.org/wiki/Flux%20qubit
|
In quantum computing, more specifically in superconducting quantum computing, flux qubits (also known as persistent current qubits) are micrometer sized loops of superconducting metal that is interrupted by a number of Josephson junctions. These devices function as quantum bits. The flux qubit was first proposed by Terry P. Orlando et al. at MIT in 1999 and fabricated shortly thereafter. During fabrication, the Josephson junction parameters are engineered so that a persistent current will flow continuously when an external magnetic flux is applied. Only an integer number of flux quanta are allowed to penetrate the superconducting ring, resulting in clockwise or counter-clockwise mesoscopic supercurrents (typically 300 nA) in the loop to compensate (screen or enhance) a non-integer external flux bias. When the applied flux through the loop area is close to a half integer number of flux quanta, the two lowest energy eigenstates of the loop will be a quantum superposition of the clockwise and counter-clockwise currents. The two lowest energy eigenstates differ only by the relative quantum phase between the composing current-direction states. Higher energy eigenstates correspond to much larger (macroscopic) persistent currents, that induce an additional flux quantum to the qubit loop, thus are well separated energetically from the lowest two eigenstates. This separation, known as the "qubit non linearity" criteria, allows operations with the two lowest eigenstates only, effectively creating a two level system. Usually, the two lowest eigenstates will serve as the computational basis for the logical qubit.
Computational operations are performed by pulsing the qubit with microwave frequency radiation which has an energy comparable to that of the gap between the energy of the two basis states, similar to RF-SQUID. Properly selected pulse duration and strength can put the qubit into a quantum superposition of the two basis states while subsequent pulses can manipulate the probability weighting that the qubit will be measured in either of the two basis states, thus performing a computational operation.
Fabrication
Flux qubits are fabricated using techniques similar to those used for microelectronics. The devices are usually made on silicon or sapphire wafers using electron beam lithography and metallic thin film evaporation processes. To create Josephson junctions, a technique known as shadow evaporation is normally used; this involves evaporating the source metal alternately at two angles through the lithography defined mask in the electron beam resist. This results in two overlapping layers of the superconducting metal, in between which a thin layer of insulator (normally aluminum oxide) is deposited.
Dr. Shcherbakova's group reported using niobium as the contacts for their flux qubits. Niobium is often used as the contact and is deposited by employing a sputtering technique and using optical lithography to pattern the contacts. An argon beam ca
|
https://en.wikipedia.org/wiki/TransPAC2
|
The TransPAC2 Network was a US National Science Foundation-funded high-speed international computer network circuit connecting national research and education networks in the Asia-Pacific region to those in the US. It was the continuation of the TransPAC project which ran from 2000 through 2005.
History
The first TransPAC effort started in 1998.
The original link of 35 Mbit/sec connected to the Very high-speed Backbone Network Service (vBNS) near Chicago.
TransPAC2's Network Operations Center was located in the Informatics and Communications Technology Complex in Indianapolis, Indiana on the Indiana University – Purdue University Indianapolis (IUPUI) campus. The NOC operated 24 hours a day and 7 days a week starting in October 1998.
In May 1999 link speed was expanded to 73 Mbit/s with funding from the Japan Science and Technology Corporation.
In June 2000 link speed increased to 100 Mbit/s, and in September to 155 Mbit/s.
In May 2001, equipment from Cisco Systems replaced that from Juniper Networks in Chicago.
The principal investigator for this first phase was Michael McRobbie.
The NSF awarded a follow-on grant on December 20, 2004, with principal investigators James Williams and Douglas Van Houweling.
TransPAC2 was part of the NSF's International Research Network Connections (IRNC) program.
In April 2005, a single OC-192 circuit was provided by KDDI America.
It connected to the Asia Pacific Advanced Network in Tokyo and to a TransPAC2-managed router in Los Angeles. The Los Angeles router, using the TransPAC2 Autonomous System number 22388, maintained a 10 Gigabit Ethernet connection to the CENIC managed Pacific Wave Ethernet switch. This connection enabled direct peering with the Internet2 Abilene Network, National LambdaRail and other high speed networks on the US West Coast.
Use of the TransPAC2 network was limited to the networks carried by other research and education network aggregators. In the Pacific region, this list includes APAN, TEIN2, and AARNet. In North America, the primary connection is via the Internet2 Abilene network, though TransPAC2 peers with other R&E networks at the Pacific Wave Exchange Point.
In February 2006, TransPAC2 established direct connection to JGN2 switch in Los Angeles.
The grant expired at the end of 2011. A total of about $6.3 million was awarded for TransPAC2.
References
External links
TransPAC2 Project Page
TranspAC2 NOC
IRNC Programs
Global Research NOC
Academic computer network organizations
|
https://en.wikipedia.org/wiki/Minion%20%28solver%29
|
Minion is a solver for constraint satisfaction problems. Unlike constraint programming toolkits, which expect users to write programs in a traditional programming language like C++, Java or Prolog, Minion takes a text file which specifies the problem, and solves using only this. This makes using Minion much simpler, at the cost of much less customization.
This limitation allows Minion to be many times faster than competing commercial solvers, for example Minion was found to be faster than the major commercial constraint solver, CPLEX (formerly ILOG CPLEX then IBM ILOG).
External links
Github Repository
Constraint programming
|
https://en.wikipedia.org/wiki/Total%20Sports
|
Total Sports may refer to:
Total Sports Publishing
Total Sports Entertainment
Total Sports TV
Total Sports Network
|
https://en.wikipedia.org/wiki/German%20Green%20Belt
|
The German Green Belt (Grünes Band Deutschland in German) is a project of Bund Naturschutz (BUND), one of Germany's largest environmental groups. The project began in 1989 facing the network of inner-German border fences and guard towers formerly separating East and West Germany. It is one of the world's most unusual nature reserves, lying along the old "Death Strip," turning a monument to repression into a symbol of renewal.
While Germany was separated, the border sector became an inaccessible region. Nature was able to develop in a nearly undisturbed environment over this period. This also applied to extensive tracts of adjacent land because they were so cut off. The overall "Green Belt" is characterized by an exceptional wealth of species and habitats, most of which are now endangered, representing a system of interlinked biotopes of national importance, which joins or passes through valuable swathes of land and intensively farmed agricultural landscapes. The federal government, states (Länder) and nature conservation organisations are joining forces to protect this "Green Belt" and develop it into a valuable habitat for humans and nature.
East and West border
Construction and purpose
The Inner German Border was formally established on 1 July 1945 as the boundary between the Western and Soviet occupation zones of Germany. On the eastern side, it was made one of the world's most heavily fortified frontiers, defined by a continuous line of high metal fences and walls, barbed wire, alarms, anti-vehicle ditches, watchtowers, automatic booby traps and minefields. It was patrolled by 50,000 armed GDR guards who faced tens of thousands of West German, British and US guards and soldiers.
Despite the extensiveness of the Inner Border, it was the Berlin Wall (German: Berliner Mauer) that would serve as the famous and infamous representation of the "Iron Curtain" and the Cold War. The Berlin Wall was a barrier that divided Berlin from 1961 to 1989, constructed by the German Democratic Republic (GDR, East Germany) starting on 13 August 1961, that completely cut off (by land) West Berlin from surrounding East Germany and from East Berlin until it was opened in November 1989. In practice, the Wall served to prevent the massive emigration and defection that marked East Germany and the communist Eastern Bloc during the post-World War II period.
From the outset, West Germany and the Allies rejected East Germany's legitimacy. The "West" saw the creation of the GDR as an extension of the Soviet Union and an illegitimate heir to German history and culture following World War II. The East German government sought to define the country as a legitimate state in its own right and portrayed West Germany as enemy territory (feindliches Ausland) – a capitalist, semi-fascist state that exploited its citizens, sought to regain the lost territories of the Third Reich, and stood opposed to the peaceful socialism of the GDR.
Fortifications
The GDR side of the Inne
|
https://en.wikipedia.org/wiki/Center%20for%20Advanced%20Defense%20Studies
|
The Center for Advanced Defense Studies is a 501(c)(3) nonprofit research organization based in Washington, D.C. that provides data-driven analysis and evidence-based reporting on global conflict and transnational security issues.
References
External links
Think tanks based in Washington, D.C.
Non-profit organizations based in Washington, D.C.
Think tanks established in 1999
1999 establishments in Washington, D.C.
|
https://en.wikipedia.org/wiki/RapLeaf
|
RapLeaf was a US-based marketing data and software company, which was acquired by email data provider TowerData in 2013.
Company
RapLeaf was founded in San Francisco by Auren Hoffman and Manish Shah in March 2005.
In May 2006 the Founders Fund led a seed round of about $1 million, including angel investors such as Peter Thiel and Ron Conway.
In June 2007 a second round included Founders Fund, Rembrandt Venture Partners and included Conway.
The company's first product was a meta-reputation system that allows users to create reviews and ratings of consumer transactions, which they then contribute to multiple e-commerce websites.
On January 26, 2007, Rapleaf released Upscoop, a service that allowed users to search for and manage their contacts by email address across multiple social networking sites.
In 2011, Rapleaf created a data onboarding division named LiveRamp, which later spun out into an independent company which was acquired by Acxiom in 2014 for $310 million.
In 2012, Rapleaf began selling segmented data tied to email addresses for marketers to personalize email communications. Around September 2012 the company moved its headquarters from San Francisco to Chicago, and Phil Davis became chief executive, replacing Hoffman.
Rapleaf was acquired by TowerData in 2013.
Controversy and backlash
On May 15, 2006, eBay removed a number of auction listings where the seller had included links to Rapleaf, claiming they were in violation of its terms of use.
In late August 2007, Upscoop began e-mailing entire contact lists that were provided by their users when they log in. This caused some criticism, and the company later apologized for doing so.
On July 10, 2008, Rapleaf changed its interface so that it no longer allows users to search people by email addresses. Instead, the service only allows a registered user to view their own reputation and the websites (social and business networking) to which their own e-mail address is registered. There was an immediate negative backlash by companies and individuals who had been using Rapleaf to both manage reputations and investigate the authenticity of people.
In October 2010, the Wall Street Journal reported that Rapleaf had transmitted personally identifiable information, including Facebook and MySpace IDs. Rapleaf said it had inadvertently transmitted that info and had ceased the practice.
On October 28, 2010, Facebook banned Rapleaf from scraping data on Facebook, and Rapleaf said it would delete the Facebook IDs it had collected.
A 2011 report said the company could tell the food preferences of employees of major companies.
Between 2007-2013, Rapleaf received significant backlash over the data collection practices and sale of individuals' personal information to advertisers. As a public spokesperson for the company, much of the criticism was directed at the CEO Auren Hoffman personally. A 2010 investigation by The Wall Street Journal revealed that the company transmitted identifying details a
|
https://en.wikipedia.org/wiki/Enoc
|
Enoc or ENOC may refer to:
ENOC, Emirates National Oil Company
European Network of Ombudspersons for Children (abbreviated ENOC)
Saint Issel, the father of Saint Teilo whose name is also given as Enoc
Enoc Huws, 1891 Welsh novel by Daniel Owen
EnerNOC, American utilities company, NASDAQ code ENOC
ENOC (album), a 2020 album by Ozuna
See also
Enoch (disambiguation)
|
https://en.wikipedia.org/wiki/ABC%20Movie%20of%20the%20Week
|
The ABC Movie of the Week was an American weekly television anthology series featuring made-for-TV movies that aired on the ABC network in various permutations from 1969 to 1975.
History
In the 1960s, movie studios viewed television as a second-rate medium but also as a threat to their theatrical revenue, so they charged high fees for the privilege to broadcast their films. The networks experimented with having films made specifically for TV to lower expenses. NBC created the first weekly umbrella for such films with their World Premiere Movie in 1966, running in a two-hour time slot.
Until the late 1960s, ABC ran a distant third behind rivals CBS and NBC, leading to jokes about it coming in fourth among the three networks or about its acronym meaning "Almost Broadcasting Company". Desperation and a looser corporate structure allowed ABC to consider plans that the other two networks would not. Barry Diller, then a junior executive at ABC and later a co-founder of the Fox network, is often cited as the creator of the Movie of the Week (MotW), although the concept was actually originated by producer Roy Huggins. Huggins reasoned that many older theatrical films ran shorter than 90 minutes so requiring a 120-minute time slot was unnecessary. His proposal was rejected by NBC and CBS but became the subject of a cover story in the March 21, 1968 issue of Variety magazine. ABC executives read the article and contacted Huggins, who did not want to sell the idea but could produce the series through Universal, where he was under contract. Universal demanded a larger budget than ABC wanted to spend, as well as the exclusive right to produce all future TV movies for ABC, conditions that pushed ABC to control production on their own, purchasing films from various studios and production companies. As the Variety article had effectively placed the concept into the public domain, ABC continued to develop it without Huggins' permission or involvement. ABC consoled Huggins by allowing him to produce several films, including The Young Country, precursor to Alias Smith and Jones. Michael Karol repeated the claim in his book The ABC Movie of the Week Companion: A Loving Tribute to the Classic Series that the Movie of the Week was Diller's idea, but this was based on hearsay.
The shorter format allowed a smaller budget than two-hour TV movies. At $350,000 per film, it was less than half the budget of NBC's World Premiere movies. It featured the work of producers like Aaron Spelling, David Wolper and Harve Bennett (all of whom later developed hit series of their own), and was produced by different production companies such as Bing Crosby Productions and the network's own ABC Circle Films. Spelling was particularly prolific, producing films under his own credit as well as through Spelling-Goldberg Productions and Thomas-Spelling Productions (partly owned by Danny Thomas).
The MotW provided ABC with a ratings hit and, along with Monday Night Football, helped establis
|
https://en.wikipedia.org/wiki/Marc%20Levoy
|
Marc Levoy is a computer graphics researcher and Professor Emeritus of Computer Science and Electrical Engineering at Stanford University, a vice president and Fellow at Adobe Inc., and (until 2020) a Distinguished Engineer at Google. He is noted for pioneering work in volume rendering, light fields, and computational photography.
Education and early career
Levoy first studied computer graphics as an architecture student under Donald P. Greenberg at Cornell University. He received his B.Arch. in 1976 and M.S. in architecture in 1978. He developed a 2D computer animation system as part of his studies, receiving the Charles Goodwin Sands Memorial Medal for this work. Greenberg and he suggested to Disney that they use computer graphics in producing animated films, but the idea was rejected by several of the Nine Old Men who were still active. Following this, they were able to convince Hanna-Barbera Productions to use their system for television animation. Despite initial opposition by animators, the system was successful in reducing labor costs and helping to save the company, and was used until 1996. Levoy worked as director of the Hanna-Barbera Animation Laboratory from 1980 to 1983.
He then did graduate study in computer science under Henry Fuchs at the University of North Carolina at Chapel Hill, and received his Ph.D. in 1989. While there, he published several important papers in the field of volume rendering, developing new algorithms (such as volume ray tracing), improving efficiency, and demonstrating applications of the technique.
Teaching career
He joined the faculty of Stanford's Computer Science Department in 1990. In 1991, he received the National Science Foundation's Presidential Young Investigator Award. In 1994, he co-created the Stanford Bunny, which has become an icon of computer graphics. In 1996, he and Pat Hanrahan coauthored the paper, "Light Field Rendering," which forms the basis behind many image-based rendering techniques in modern-day computer graphics. His lab also worked on applications of light fields, developing technologies such as a light-field camera and light-field microscope, and on computational photography. (The phrase "computational photography" was first used by Steve Mann in 1995. It was re-coined and given a broader meaning by Levoy for a course he taught at Stanford in 2004 and a symposium he co-organized in 2005.)
Google
Levoy took a leave of absence from Stanford in 2011 to work at GoogleX as part of Project Glass. In 2014, he retired from Stanford to become full-time at Google, where until 2020 he led a team in Google Research that worked broadly on cameras and photography. One of his projects was HDR+ mode for Google Pixel smartphones. In 2016, the French agency DxO gave the Pixel the highest rating ever given to a smartphone camera, and again in 2017 for the Pixel 2. His team also developed Portrait Mode, a single-camera background defocus technology launched in October 2017 on Pixel
|
https://en.wikipedia.org/wiki/FreeWave%20Technologies
|
Free Wave Technologies, Inc. designs and manufactures secure machine-to-machine wireless networking, communications, and computing systems. Their radios can capture and transmit data from devices such as sensors, gauges, valves, robots, drones, and unmanned vehicles over long distances (60+ miles / 96+ kilometers) in clear line-of-sight environments and harsh environments. Free Wave's radios support a variety of industrial applications, such as supervisory control and data acquisition (SCADA), wireless I/O, cathodic protection (CP), remote monitoring, telemetry, and analytics. Free Wave can provide long range, reliable and rugged wireless data links through both licensed and license-free radios.
The Company sells to a variety of enterprises such as energy, utilities, agricultural, government, defence, water, wastewater, manufacturing, and commercial enterprises. The company also conducts network designs, path studies, and pre-installation engineering services to support its customers.
History
Free Wave Technologies was founded in August 1993, by Jonathan Sawyer and Steve Wulchin. From the beginning, Sawyer and Wulchin aimed to help customers transmit mission-critical data via secure, highly reliable, licensed, and license-free spread spectrum radios. Free Wave has manufactured all of its radios in Boulder, Colorado since the first radio was shipped in 1994. In June 2007, TA Associates led a $113 million investment in Free Wave Technologies. The company's major markets are oil & gas, government, and defence, agriculture, water and wastewater, and manufacturing industries since that time. Today, Free Wave Technologies has more than 800,000 industrial radios and embedded modules in the field.
Uses
FreeWave's wireless M2M solutions are deployed across many industries including oil and gas, government, precision agriculture, traffic systems, water/wastewater, manufacturing, and other utilities. For instance, FreeWave radios are used by energy companies to maximize production and reduce operating costs for mission-critical applications within the military, and for environmental monitoring to provide warning of impending natural disasters such as volcanoes.
The Institute of Geophysics of Ecuador uses FreeWave technology at Tungurahua, the highest volcano in the world which operates at below-zero temperatures from a height of above sea level. FreeWave M2M devices capture early-warning signs that an eruption is imminent and transmit images from the top of the volcano. With hundreds of thousands of residents living around the volcano, early warning is crucial to take precautionary measures and evacuate citizens before an eruption can take place. The Geophysical Institute of Peru also uses FreeWave technology to capture and transmit sensor data across a line-of-sight path of up to at 115 kbit/s or up to at 1 Mbit/s.
At an elevation of more than , the Mount Washington Observatory (MWO) in New Hampshire uses a FreeWave solution to capture data from
|
https://en.wikipedia.org/wiki/Mobile%20number%20portability
|
Mobile number portability (MNP) enables mobile phone users to retain a mobile telephone number when changing the mobile network operator.
Overview
Mobile number portability is implemented in varying ways across the globe. The international and European standard implements "recipient-led" porting, in which a customer wishing to port a telephone number contacts the new network (recipient), which sends the number portability request (NPR) to the current network operator (donor). By contrast, the United Kingdom and India are the only exceptions, and implement a "donor-led" system, in which the customer is required to contact the donor to obtain a Porting Authorisation Code (PAC) in the UK—or a Unique Porting Code (UPC) in India—which is submitted to the recipient network. The recipient continues the porting process by contacting the donor with a porting code. The method has been criticised by some industry analysts as being inefficient, though it prevents MNP scams. It has also been observed that it may act as customer deterrent as well as allowing the donor an opportunity of "winning back" the customer. This might lead to distortion of competition, especially in the markets with new entrants that are yet to achieve scalability of operation. From 1 July 2019 as a result of new rules from Ofcom, In the UK a customer can request a PAC without having to speak to their provider by texting PAC to 65075.
Technical details
A significant technical aspect of MNP is related to the routing of calls or mobile messages (SMS, MMS) to a number once it has been ported. There are various flavours of call routing implementation across the globe but the International and European best practice is via the use of a central database (CDB) of ported numbers. A network operator makes copies of the CDB and queries it to find out to which network to send a call. According to RFC3482, this is also known as All Call Query (ACQ) and is highly efficient and scalable. A majority of the established and upcoming MNP systems across the world are based on this ACQ/CDB method of call routing. One of the very few countries not to use ACQ/CDB is the UK, where once a number has been ported, calls to that number are still routed via the donor network. This is also known as "indirect routing" and is highly inefficient as it is wasteful of transmission and switching capacity. Because of its donor dependent nature, indirect routing also means that if the donor network develops a fault or goes out of business, the customers who have ported numbers out of that network will lose incoming calls to their numbers. The UK telecoms regulator Ofcom completed its extended review of the UK MNP process on 29 November 2007, and mandated that ACQ/CDB be implemented for mobile to mobile ported calls by no later than 1 September 2009.
Prior to March 2008, it took a minimum of 5 working days to port a number in the UK, compared to 3.5 working days in Pakistan, 2 hours in United States, as quickly as 20 m
|
https://en.wikipedia.org/wiki/VoIP%20VPN
|
A VoIP VPN combines voice over IP and virtual private network technologies to offer a method for delivering secure voice. Because VoIP transmits digitized voice as a stream of data, the VoIP VPN solution accomplishes voice encryption quite simply, applying standard data-encryption mechanisms inherently available in the collection of protocols used to implement a VPN.
The VoIP gateway-router first converts the analog voice signal to digital form, encapsulates the digitized voice within IP packets, then encrypts the digitized voice using IPsec, and finally routes the encrypted voice packets securely through a VPN tunnel. At the remote site, another VoIP router decodes the voice and converts the digital voice to an analog signal for delivery to the phone.
A VoIP VPN can also run within an IP in IP tunnel or using SSL-based OpenVPN. There is no encryption in former case, but traffic overhead is significantly lower in comparison with IPsec tunnel. The advantage of OpenVPN tunneling is that it can run on a dynamic IP and may provide up to 512 bits SSL encryption.
Advantages
Security is not the only reason to pass Voice over IP through a virtual private network, however. Session Initiation Protocol, a commonly used VoIP protocol is notoriously difficult to pass through a firewall because it uses random port numbers to establish connections. A VPN is also a workaround to avoid a firewall issue when configuring remote VoIP clients.
However, latest VoIP standard STUN, ICE and TURN eliminate natively some NAT problems of VoIP.
Installing an extension on a VPN is a simple means to obtain an off-premises extension (OPX), a function which in conventional landline telephony required a leased line from the private branch exchange to the remote site. A worker at a remote location could therefore appear virtually to be at the company's main office, with full internal access to telephone and network.
Disadvantages
The protocol overhead caused by the encapsulation of VoIP protocol within IPSec dramatically increases the bandwidth requirements for VoIP calls, thus making the VoIP over VPN protocols too "fat" to be used over a mobile data connections like GPRS, EDGE or UMTS.
Although VoIP over VPN is not as usable in mobile environments, it is sometimes used to create "encrypted VoIP trunk" between different sites of a corporations, running VoIP PBX interconnections over a VPN connection.
New solutions
The recent publication of new VoIP encryption standards built into the protocol, such as ZRTP and SRTP, allow the VoIP client to run without the VPN overhead, integrating with standard features of VoIP PBX without having to manage both the VPN gateway and the PBX.
Free implementation
VoIP VPN solution may be accomplished with free open source software by using a Linux distribution or BSD as an operating system, a VoIP server, and an IPsec server.
References
https://www.pcmag.com/article/365673/when-to-use-a-vpn-to-carry-voip-traffic
Sources
Voice over IP
Vi
|
https://en.wikipedia.org/wiki/WinTuition
|
WinTuition is an American game show created as an original series for Game Show Network, on which it originally ran from December 9, 2002 to April 1, 2003, with repeats until January 4, 2004. The game had a school-oriented theme in which three contestants competed to answer questions on general school-based subjects in an attempt to win a $50,000 college fund, hence the name of the show. The show was hosted by Marc Summers and announced by Burton Richardson. Henry Winkler served as the show's executive producer. WinTuition would end up being the final game show that Summers would emcee.
History
WinTuition went into production and first aired on GSN in late 2002. The show was produced by Henry Winkler and hosted by Marc Summers. Lisa Kennedy Montgomery (then known by her stage name of Kennedy), who at the time was the host of Friend or Foe?, hosted one episode in 2003 as part of an April Fool's Day prank in which the hosts of Game Show Network's original series traded places. Incidentally, the shows April Fool's Day episode was the final episode of the series.
Burton Richardson announced the show, and a male model identified as "Gorgeous George" Davidson occasionally brought out props related to the questions.
Gameplay
The main game was divided into twelve levels, or "grades," with each level containing question material appropriate to that particular grade. The subject of each grade was announced before the question was asked. All three players started the game with 500 points.
Round 1: Elementary School (1st-5th Grade)
One buzz-in question per grade level was asked for the first four grades, while in fifth grade every player was asked his/her own question as part of a spelling bee or matching/guessing game. Correct answers were worth 100 points each; missed questions cost the player 100. On some episodes, an elementary school age student provided a home viewer question before the commercial break at the end of this round, then gave the answer after the break ended.
Round 2: Middle School (6th-8th Grade)
Questions in this round had several correct answers, each of which was worth 250 points. Each player got to give one answer, starting with whoever buzzed in first, after which any player who had answered correctly could try to give answers to any or all remaining parts of the question. A miss at any time cost the player no points, but froze him/her out of the rest of the question. Four correct answers were possible in 6th and 7th grades, seven correct in 8th. After all three grades had been played, the lowest-scoring player was "expelled" from the game and received consolation prizes; a second-place tie was broken via a buzz-in tiebreaker question.
The first player to give a correct answer in this round won a bonus prize.
Round 3: High School (9th-12th Grade)
Players alternated answering questions, one per grade, starting with the leader. Correct answers scored 500 points, while wrong ones deducted 500. In addition, each player could use o
|
https://en.wikipedia.org/wiki/PUF%20%28disambiguation%29
|
PUF may refer to:
Physical unclonable function, in computer security, a physically-implemented secure identifier
Presses Universitaires de France
Permanent University Fund, for Texas public universities
Pau Pyrénées Airport in France (IATA code: PUF)
Por Um Fio, a Brazilian reality television show
Poughkeepsie Underwear Factory, a historic building in New York
Public Universal Friend (1752–1819), American preacher
|
https://en.wikipedia.org/wiki/Len%20Pasquarelli
|
Len Pasquarelli is an American sports writer and analyst with The Sports Xchange and a 25-year veteran of covering the National Football League (NFL). The Sports Xchange is a network of professional, accredited reporters and analysts who cover each team or sport full-time.
Prior to joining the Sports Xchange, he wrote for ESPN.com starting in 2001 and was a frequent contributor to the other ESPN outlets, including SportsCenter, ESPNEWS, ESPN Radio and ESPN The Magazine. Before ESPN, Pasquarelli served as a senior writer for CBS SportsLine.com. He has also covered the NFL for the Atlanta Journal-Constitution from 1989 to 1999, the Fort Wayne News-Sentinel from 1985 to 1989, Pro Football Weekly from 1982 to 1985, and Pittsburgh Steelers Weekly from 1978 to 1982.
Pasquarelli is a member of the Pro Football Writers of America and has twice won national awards as the Best NFL Reporter of the Year. He also has won several writing awards, including an Associated Press Deadline Sports Reporting Award in 1988.
Pasquarelli has been on the committee that selects inductees for the Pro Football Hall of Fame. During the annual selection meeting on February 2, 2008, he fell ill and was taken to an area hospital. The following day he had quintuple bypass surgery.
While in rehabilitation for the bypass surgery, he began to experience new symptoms which were later diagnosed as Guillain–Barré syndrome.
Pasquarelli is a Pittsburgh, Pennsylvania native and graduated from the University of Pittsburgh in 1972. He currently resides in Atlanta, Georgia.
References
External links
Pasquarelli’s sports columns from ESPN.com
Dick McCann Memorial Award recipients
Writers from Pittsburgh
University of Pittsburgh alumni
Living people
Year of birth missing (living people)
ESPN Radio
Sportswriters from Pennsylvania
|
https://en.wikipedia.org/wiki/Notebook%20%28disambiguation%29
|
A notebook is a small book often used for writing.
Notebook or The Notebook may also refer to:
Computing
Laptop, a type of personal computer
Google Notebook, a discontinued online application
Notebook interface, a type of programming environment
Books
Notebook (style), a writing technique
The Notebook (1986), a novel by Ágota Kristóf
"The Notebook" (1994), a poem from Early Work by Patti Smith
The Notebook (novel) (1996), by Nicholas Sparks
Film and TV
The Notebook (2004), an American romantic drama film directed by Nick Cassavetes, based on the Sparks novel
Notebook (2006 film), an Indian romantic drama directed by Rosshan Andrrews
The Notebook (2013 Hungarian film), a Hungarian drama directed by János Szász, based on the Kristóf novel
Notebook (2013 Nepali film), a Nepali romance directed by Yogesh Ghimire
Notebook (2019 film), a 2019 Indian Hindi-language romantic drama film
Music
The Partridge Family Notebook, a 1972 album by The Partridge Family
The Notebook, the soundtrack by Aaron Zigman 2004
"Notebook", a song by American singer Melanie Martinez from her 2020 deluxe album K-12
Other
The Philadelphia Public School Notebook a bimonthly newspaper
See also
Notepad (disambiguation)
|
https://en.wikipedia.org/wiki/PAL%20%28programming%20language%29
|
PAL, the Pedagogic Algorithmic Language, is a programming language developed at the Massachusetts Institute of Technology in around 1967 to help teach programming language semantics and design. It is a "direct descendant" of ISWIM and owes much of its philosophy to Christopher Strachey.
The initial implementation of PAL, in Lisp, was written by Peter Landin and James H. Morris, Jr. It was later redesigned by Martin Richards, Thomas J. Barkalow, Arthur Evans, Jr., Robert M. Graham, James Morris, and John Wozencraft. It was implemented by Richards and Barkalow in BCPL as an intermediate-code interpreter and ran on the IBM System/360; this was called PAL/360.
RPAL
RPAL, the Right-reference Pedagogic Algorithmic Language, is a functional subset of PAL with an implementation on SourceForge. It is used at the University of Florida to teach the construction of programming languages and functional programming. Programs are strictly functional, with no sequence or assignment operations.
References
Programming languages created in 1967
Academic programming languages
Functional languages
|
https://en.wikipedia.org/wiki/National%20Child%20Victim%20Identification%20Program
|
The National Child Victim Identification Program (NCVIP) is the world's largest database of child pornography, maintained by the Child Exploitation and Obscenity Section (CEOS) of the United States Department of Justice and the National Center for Missing and Exploited Children (NCMEC) for the purpose of identifying victims of child abuse.
The program was created by Andrew Oosterban, head of the Child Exploitation and Obscenity Section. Development of the database began in 1999, and it was launched in 2003. It contains images contributed by US Immigration and Customs Enforcement (ICE), FBI, Secret Service, Postal Inspection Service, and several other organizations. In March 2005, the Justice Department's database was merged with that of the NCMEC. The database uses image analysis software developed by LTU Technologies to detect victims.
As a security measure, police are not allowed to personally browse the database, and they cannot identify victims by name. Instead, they are given contact information for higher-level officers who have security clearance. When child pornography is seized, specialist FBI investigators analyze the entire collection before running the images through the database, as the way the computer files are organized can help in identifying victims. Following a seizure of more than 10,000 images in California in 2007, two officers from the Washington Field Office of the FBI reviewed every image.
In early 2006, United States Attorney General Alberto Gonzales used images from the NCVIP database to view child pornography, as part of a campaign for his Project Safe Childhood initiative. According to a speech he gave at the NCMEC, Gonzales saw images of "older men forcing naked young girls to have anal sex", "a young toddler, tied up with towels, desperately crying in pain while she is being brutally raped and sodomized by an adult man", and "a mere infant being savagely penetrated". He described the experience as "shocking".
References
Anti–child pornography organizations
Child welfare in the United States
Missing people organizations
United States Department of Justice
Law enforcement databases in the United States
|
https://en.wikipedia.org/wiki/Apomorphine%20%28data%20page%29
|
This is a page of data for apomorphine.
References
Chemical data pages
Chemical data pages cleanup
|
https://en.wikipedia.org/wiki/WPXK-TV
|
WPXK-TV (channel 54) is a television station licensed to Jellico, Tennessee, United States, broadcasting the Ion Television network to the Knoxville area. Owned and operated by the Ion Media subsidiary of the E. W. Scripps Company, the station has offices on Executive Park Drive in west Knoxville, and its transmitter is located on Sharp's Ridge in North Knoxville. Despite Jellico being WPXK-TV's city of license, the station maintains no physical presence there.
Technical information
Subchannels
The station's digital signal is multiplexed:
Analog-to-digital conversion
WPXK-TV shut down its analog signal, over UHF channel 54, on June 12, 2009, the official date on which full-power television stations in the United States transitioned from analog to digital broadcasts under federal mandate. The station's digital signal remained on its pre-transition UHF channel 23. Through the use of PSIP, digital television receivers display the station's virtual channel as its former UHF analog channel 54, which was among the high band UHF channels (52-69) that were removed from broadcasting use as a result of the transition.
References
External links
PXK-TV
E. W. Scripps Company television stations
Ion Television affiliates
Court TV affiliates
Laff (TV network) affiliates
Ion Mystery affiliates
Scripps News affiliates
Television channels and stations established in 1993
1993 establishments in Tennessee
|
https://en.wikipedia.org/wiki/UCSF%20Chimera
|
UCSF Chimera (or simply Chimera) is an extensible program for interactive visualization and analysis of molecular structures and related data, including density maps, supramolecular assemblies, sequence alignments, docking results, trajectories, and conformational ensembles. High-quality images and movies can be created. Chimera includes complete documentation and can be downloaded free of charge for noncommercial use.
Chimera is developed by the Resource for Biocomputing, Visualization, and Informatics (RBVI) at the University of California, San Francisco. Development is partially supported by the National Institutes of Health (NIGMS grant P41-GM103311).
The next-generation program is UCSF ChimeraX.
General structure analysis
automatic identification of atom
hydrogen addition and partial charge assignment
high-quality hydrogen bond, contact, and clash detection
measurements: distances, angles, surface area, volume
calculation of centroids, axes, planes and associated measurements
amino acid rotamer libraries, protein Ramachandran plot, protein contact map
structure building and bond rotation
molecular dynamics trajectory playback (many formats), distance and angle plots
morphing between conformations of a protein or even different proteins
display of attributes (B-factor, hydrophobicity, etc.) with colors, radii, "worms"
easy creation of custom attributes with simple text file inputs
ViewDock tool to facilitate interactive screening of docking results
rich set of commands, powerful specification syntax
many formats read, PDB and Mol2 written
Web and fetch from Protein Data Bank, CATH or SCOP (domains), EDS (density maps), EMDB (density maps), ModBase (comparative models), CASTp (protein pocket measurements), Pub3D (small molecule structures), VIPERdb (icosahedral virus capsids), UniProt (protein sequences with feature annotations), others
interfaces to PDB2PQR charge/radius assignment, APBS electrostatics calculations, AutoDock Vina single-ligand docking
Presentation images and movies
high-resolution images
visual effects including depth-cueing, interactive shadows, silhouette edges, multicolor backgrounds
standard molecular representations (sticks, spheres, ribbons, molecular surfaces)
pipes-and-planks for helices and strands; nucleotide objects including lollipops and ladder rungs
ellipsoids to show anisotropic B-factors
nonmolecular geometric objects
renderings of density maps and other volume data (see below)
labeling with text, symbols, arrows, color keys
different structures can be clipped differently and at any angle
optional raytracing with bundled POV-Ray
scene export to X3D and other formats
simple graphical interface for creating movies interactively
scenes can be placed as keyframes along an animation timeline
alternatively, movie content and recording can be scripted; rich set of related commands
movie recording is integrated with morphing and MD trajectory playback
Volume data tools
man
|
https://en.wikipedia.org/wiki/Melbourne%20%26%20Metropolitan%20Tramways%20Board
|
The Melbourne & Metropolitan Tramways Board (MMTB) was a government-owned authority that was responsible for the tram network in Melbourne, Australia between 1919 and 1983, when it was merged into the Metropolitan Transit Authority. It had been formed by the merger of a number of smaller tramway trusts and companies that operated throughout the city.
History
In 1869 Francis Boardman Clapp set up the Melbourne Omnibus Company (MOC) which ran horse-drawn omnibuses in the inner suburbs of Melbourne. The company carried five million passengers. By 1882 the company had over 1,600 horses and 178 omnibuses. In 1885 the company carried 11.7 million passengers.
In 1885 Clapp's MOC was granted a 30-year exclusive franchise for a cable tram network in Melbourne, with no competing lines being permitted. Clapp reorganised the company as the Melbourne Tramway & Omnibus Company (MTOC). A total of 15 lines were built, opening progressively between 1885 and 1919.
The first serious electric trams in Melbourne began in 1906, when the North Melbourne Electric Tramway & Lighting Company commenced operating an electric tram line from the terminus of the cable tram to Essendon, the motivation being the selling of electricity to customers along the route.
In the 1900s and 1910s, the government legislated for the formation of suburban electric tramway trusts to build and operate electric trams outside MTOC's exclusive licence area. These were:
Prahran & Malvern Tramways Trust
Hawthorn Tramways Trust
Melbourne, Brunswick & Coburg Tramway Trust
Fitzroy, Northcote & Preston Tramways Trust
Footscray Tramway Trust
Northcote Municipality Cable Tramways
When the MTOC franchise expired on 30 June 1916, the entire operation of the Melbourne cable tramway system passed to the State Government. The MMTB was formed in November 1919 to take over the street tramways systems in Melbourne. It had the responsibility of operating all tramways within a ten-mile (sixteen kilometre) radius of the Melbourne GPO, the only exceptions being the lines operated by Victorian Railways.
In January 1925, the M&MTB began operating buses.
The MMTB ceased on 30 June 1983 with its function taken over by the Metropolitan Transit Authority.
Takeover of tramways network
The MMTB commenced operations on 1 November 1919, taking over the cable tram network with 44 route miles of track, 539 grips cars, 485 four wheel trailer cars, 58 double bogie trailers, 11 engine sheds and 15 carriage sheds. On 2 February 1920, it took over the six suburban electric tramway trusts, which were dissolved later that month. The MMTB also succeeded the Cable Tramway Board and the Royal Park Horse Tramway.
The MMTB took over the North Melbourne Electric Tramway & Lighting Company's tramways operation on 1 August 1922, and its lighting undertakings on 21 December 1922.
Conversion of cable system
One of the MMTB's original purposes was to decide whether or whether not to keep the cable trams. The MMTB progressively convert
|
https://en.wikipedia.org/wiki/Oh%20Yoon-ah
|
Oh Yoon-ah is a South Korean actress and a former racing model.
Career
Oh Yoon-ah began her career as a racing model ("race queen" or "pit babe"), and in 2000 she won the first Cyber Race Queen Contest. She became an entertainment reporter for MBC's Section TV in 2003. However, she was fired in a live interview where she stayed silent for 3 minutes.
Oh made her acting debut in 2004 TV series Into the Storm, but it was her supporting role as the heroine's friend in hit sitcom Old Miss Diary that made her into a household name. She continued acting on television, starring in That Woman, Mr. Goodbye, Surgeon Bong Dal-hee, Master of Study, Marry Me, Please, and notably Alone in Love, for which she won Best Supporting Actress at the 2006 SBS Drama Awards.
Personal life
Oh married advertising executive Song Hoon at Imperial Palace Hotel Seoul on January 5, 2007. The couple divorced in 2015; they have one son, born in August 2007. Oh and her son, who has autism, were featured together on the 10th anniversary cover of The Big Issue Korea to raise awareness for people with autism.
Filmography
Television series
Film
Variety show
Web shows
Music video
Book
Awards and nominations
References
External links
Oh Yoon-ah at Polaris Entertainment
South Korean film actresses
South Korean television actresses
South Korean female models
1980 births
Living people
People from Ulsan
|
https://en.wikipedia.org/wiki/CMOT
|
CMOT can be the initials of:
Children's Museum of Taipei, a former museum in Taipei, Taiwan
Common management information protocol over TCP/IP, an architecture for managing a network remotely
Computational and Mathematical Organization Theory, an academic journal
Cut-Me-Own-Throat Dibbler, the fictional salesman
|
https://en.wikipedia.org/wiki/DDN
|
DDN may refer to:
Arts, media and entertainment
Daydream Nation, a music album by Sonic Youth
Dayton Daily News, a daily newspaper in Dayton, Ohio, US
Digital Delivery Network, a service of the Community Radio Network in Australia
Digital Distribution Netherlands, a Dutch digital music distributor
Double Down News, an alternative media outlet in the UK
Dustin's Daily News, a comedic current affairs TV show
Computing
DataDirect Networks, a data storage company
Defense Data Network, a separate instantiation of the ARPANET used by the U.S. Department of Defense from 1983 to 1995
Dot-decimal notation, a human readable way to write IPv4 internet addresses
Other uses
Dehradun railway station (station code), India
Digital Divide Network, an online community of activists
|
https://en.wikipedia.org/wiki/MINC%20%28disambiguation%29
|
Minc, MINC, or MinC may refer to:
MINC, a data specification language.
MinC, one of three proteins encoded by the minB operon
Alain Minc (1949–), French businessman, political advisor, and author
Carlos Minc (1951–), Brazilian geographer and politician
Hilary Minc (1905–1974), Polish economist and member of Communist Party of Poland
Ministério da Cultura (MinC), Brazil's Culture of Ministry
MINC-11 computer, a PDP-11/03 or PDP-11/23 computer for laboratory applications
|
https://en.wikipedia.org/wiki/Amphibian%20Species%20of%20the%20World
|
Amphibian Species of the World 6.1: An Online Reference (ASW) is a herpetology database. It lists the names of frogs, salamanders and other amphibians, which scientists first described each species and what year, and the animal's known range.
The American Museum of Natural History hosts Amphibian Species of the World, which is updated by herpetologist Darrel Frost. As of 2019, it contained more than 8000 species.
History
The Association of Systematics Collections (ASC) started this project in 1978 because the Convention on Trade in Endangered Species of Fauna and Flora (CITES) needed a database for animals. (The ASC later changed its name to Natural Science Collections Alliance.) The ASC's Stephen R. Edwards wrote Mammal Species of the World first and started Amphibian Species of the World second. Edwards decided to write about living amphibians because Richard G. Zweifel had just composed a large list of amphibian names and because experts from the University of Kansas were available to assist him. Darrel Frost joined the project to help Edwards. Frost planned to write Turtle and Crocodilian Species of the World next, but he left to complete his Ph.D. instead.
The first version of the catalogue was published as a book in 1985, and well-received by specialists in the field.
In 1989, the ASC gave the copyright for Amphibian Species of the World to the Herpetologists' League, and they added more amphibians to the database. The League and American Museum of Natural History put Darrel Frost in charge of the project. At the time, Frost was a curator at the American Museum of Natural History. Frost added more information for professional herpetologists to use and made many corrections. He added more species that had been discovered since 1985. The project's own page notes that there are ten times as many amphibian species known to science today than were known in the mid-1980s.
On July 1999, the catalogue was first published on the internet, in its 2.0 version. New versions were added in 2004, 2006 and 2007. The 6.0 version, published in 2014, allows for real-time modifications.
The 6.2 version was published in January 2023. As of August, the website contains 8 674 species and over 17 848 references.
Critical response
According to Amphibians.org, "For three decades ASW has been the primary reference for amphibian taxonomy." In 2013, Frost won the Sabin Award for his work on Amphibian Species of the World.
Related pages
Mammal Species of the World
AmphibiaWeb
References
Other websites
Site hosted by American Museum of Natural History
Science websites
Biodiversity databases
Online taxonomy databases
|
https://en.wikipedia.org/wiki/Common%20babbler
|
The common babbler (Argya caudata) is a member of the family of Leiothrichidae. They are found in dry open scrub country mainly in India. Two populations are recognized as subspecies and the populations to the west of the Indus river system are now usually treated as a separate species, the Afghan babbler (Turdoides huttoni). The species is distinctly long-tailed, slim with an overall brown or greyish colour, streaked on the upper plumage and having a distinctive whitish throat.
Taxonomy
The common babbler was formerly placed in the genus Turdoides but following the publication of a comprehensive molecular phylogenetic study in 2018, it was moved to the resurrected genus Argya.
Description
This small, slim babbler with a long tail is buff to grey above with dark streaks. The underside is unstreaked and paler, the throat being nearly whitish.
The species was originally described as Crateropus caudatus before it was moved to the genus Argya and still later to Turdoides. The species ending was, however, retained in these new combinations but the corrected feminine form caudata matches the Latin gender of the genus Turdoides.
The common babbler group includes eclipes (Hume, 1877) from northern Pakistan to northwestern India and nominate caudata ( Dumont de Sainte Croix, 1823) in southern Pakistan, Nepal, Bangladesh and India (including the Lakshadweep Islands).
Behaviour and ecology
Like most other babblers, the common babbler is found in small parties of six to twenty. They are vociferous, moving on the ground often with members keeping watch from the tops of bushes. They forage through the undergrowth hopping on the ground and creeping like rodents. When moving on the ground, they often keep the long tail raised. The calls include a rapid trill which-which-whichi-ri-ri-ri-ri while the alarm consists of a high pitched squeak. They are found mainly in dry regions with sparse and low thorny scrub vegetation. They feed on insects, berries and grains. Favourite berries include those of the Lantana and Capparis.
Several breeding pairs may be found within a group. Adults will often indulge in preening the head and neck feathers of other group members. The nesting season in India is in summer (May to July) with two peaks broken by a gap during the rains. They build a shallow cup nest low in a thorny bush and lay about 2-3 turquoise blue eggs. In northern India, they have been found to use heaps of lopped up Zizyphus for nesting. The eggs hatch after about 13–15 days. Broods may be parasitized by the Jacobin cuckoo and the common hawk-cuckoo. The young birds are able to fly after about a week and continue to stay with the group, joining the adults at the roost. Helpers, possibly young birds from the previous brood may assist the parents, feeding the brooding females and the young birds. The feeding bird often hops after delivering food calls with a low trill and shivers its feathers. The gape of young birds is yellow and the iris colour changes from
|
https://en.wikipedia.org/wiki/Sex%20%28TV%20series%29
|
Sex, also known as Sex with Sophie Lee, is an Australian television series that ran from 1992 to 1993 on the Nine Network. It was hosted by Sophie Lee in its first season and Pamela Stephenson in its second. As the title of the show suggests, the program was about sex and its related aspects. The series was created by Tim Clucas.
Controversy
The program caused controversy for a number of reasons, these mainly being the graphic depictions it featured of the subject and featuring such depictions in the early 8:30pm timeslot. Sex pushed boundaries, with explicit shots of genitalia, simulated sex and discussion of controversial topics such as abortion and homosexuality.
Viewer reaction to Sex varied. Some saw the program as useful and valid television, while others felt uncomfortable or found the program exploitative. General Motors Holden announced that it would not advertise during Sex because it wanted to be associated with "wholesome" topics.
In 1993, the show was moved to a later timeslot but despite good ratings, the controversy became too much for then managing director David Gyngell, who announced its departure on the Midday show with the final show airing on 27 May. However, the show's success sparked a similar series on Network Ten, Sex/Life hosted by Tottie Goldsmith and Alyssa-Jane Cook, which ran from 1994 to 1998.
Cast
Sophie Lee's reputation for sexual appeal, from her time as host of The Bugs Bunny Show, delivered a very high rating for Sex, a 32 share for its premiere. By the end of 1992, she became disenchanted with the show and left the program.
In 1993, comedian Pamela Stephenson took over as host, presenting in a more humorous style. At that time she was known as a performer, but in later years earned a PhD as a psychologist, specializing in the area of human sexuality.
One of the reporters on the show was Dr Kerryn Phelps, who would later go on to become president of the Australian Medical Association and a member of parliament.
References
1990s Australian documentary television series
Nine Network original programming
Sex education television series
1992 Australian television series debuts
1993 Australian television series endings
Television controversies in Australia
Obscenity controversies in television
|
https://en.wikipedia.org/wiki/List%20of%20programmes%20broadcast%20by%20Animax
|
This is a list of anime series, anime films, and anime OVA series broadcast by the Japanese anime satellite television network Animax in its networks across Southeast Asia, Taiwan, Hong Kong, Korea. Meanwhile, Tokusatsu is only available in Korea.
Currently broadcast
Japan
Sources:
North America and Asia
Korea
Ultraman Orb
Kamen Rider Ghost
Tokyo Revengers
Formerly broadcast
A
A Certain Magical Index
A Certain Scientific Railgun
Accel World
Acchi Kocchi (also known as Place to Place)
Angel beats
Aikatsu!
Aikatsu Stars!
Aikatsu Friends!
Aikatsu on Parade!
Alice Academy
Alice and Zoroku
Arcana Famiglia
Aria The Scarlet Ammo Double A (also known as Hidan No Aria)
Ayakashi Japanese Classic Horror
Anonymous Noise
Arpeggio of Blue Steel
B
The Boondocks
Bleach
Brynhildr in the Darkness
C
D
E
Eight Clouds Rising
Emma - A Victorian Romance
Emma - A Victorian Romance: Second Act
Elmo's World
Eon Kid
Ergo Proxy
Eureka 7
éX-Driver
éX-Driver - The Movie
Excel Saga
Eyeshield 21
F
G
H
I
Ichigo 100%
Infinite Ryvius
Inari, Konkon, Koi Iroha
Initial D
Invaders of the Rokujyōma!?
I'm Gonna Be An Angel!, also known as I Wanna Be An Angel!
Inuyasha
J
Jigoku Shōjo Futakomori
Jinki: Extend
Jinzo Konchu Kabutoborg VxV
Jubei-chan 2
Jubei-chan the Ninja Girl
Jujutsu Kaisen
Jūsō Kikō Dancouga Nova
Jyu Oh Sei
K
. Kamisama kiss (2 seasons)
L
M
N
Nisekoi
Najica
Naruto
Naruto the Movie: Ninja Clash in the Land of Snow
Naruto the Movie 2: Legend of the Stone of Gelel
Naruto the Movie 3: Guardians of the Crescent Moon Kingdom
Naruto: Shippūden
Naruto: Shippūden the Movie
Nasu: Summer in Andalusia
Neon Genesis Evangelion
Nisekoi (transferred to Aniplus Asia)
Night Head Genesis
Ningyō Animation Licca-chan
Noir
Nuy Pole
Nodame Cantabile
O
Offside
Ohayo! Spank
Oku-sama wa Joshi Kōsei
One Piece
Onegai My Melody
Onegai My Melody ~Kuru Kuru Shuffle~
Onegai My Melody Sukkiri♪
Onegai My Melody Kirara★
Osomatsu kun
Otogi Zoshi
Ouran High School Host Club
Outlaw Star
Overman King Gainer
P
R
R.O.D the TV
Ran, The Samurai Girl
Ranma ½
REC
Record of Lodoss War
Remi, Nobody's Girl
Ring ni Kakero
The Rose of Versailles
Rozen Maiden
Ruin Explorers
Rurouni Kenshin
Rurouni Kenshin: Ishin Shishi no Requiem
Rurouni Kenshin: Seishou Hen
Rurouni Kenshin: Tsuioku Hen
Ryūsei Sentai Musumetto (流星戦隊ムスメット)
Ryo work has never done
S
T
U
UFO Baby
Ultra Maniac
Unbreakable Machine-Doll
Urusei Yatsura (also known as Lum, Lamu, The Invader Girl, Those Obnoxious Aliens and Alien Musibat)
V
Vampire Hunter D
Vandread
Vandread Gekitouhen
Vandread: The Second Stage
Vandread Taidouhen
Viking
Virgin Fleet
The Vision of Escaflowne
Escaflowne the Movie
Valvrave the Liberator
W
Wakusei Daikaijû Negadon (a.k.a. Negadon: The Monster from Mars)
The World God Only Knows
Wangan Midnight (湾岸MIDNIGHT)
Whistle!
Wild 7
Windy Tales
Winter Sonata
Witch Hunter Robin
Wolf's Rain
World Masterpiece Theater
Ai Shoujo Pollyanna Monogatari
Flanders no Inu
Kon'nichiwa Anne 〜 Before Green G
|
https://en.wikipedia.org/wiki/Laboratoire%20d%27Informatique%20de%20Paris%206
|
The LIP6, the computer science laboratory of Sorbonne University's Faculty of Science and Engineering is a joint research laboratory of Sorbonne University and CNRS, the French national research organization. The current name comes from the acronym of its historical name, Laboratoire d'Informatique de Paris 6. It was founded in January, 1997, with the fusion of three smaller laboratories: LAFORIA, LITP, and MASI. Employing over 150 permanent professors and research scientists, LIP6 is one of the largest computer science laboratories in France.
Research activities
LIP6's research activities are organized around five general areas of research:
Embedded systems
Scientific computation
Networking and Distributed systems
Databases and Machine learning
Decision making and Optimization
See also
References and sources
Rapport du comité d'experts. Report on LIP6 by a committee of independent experts. Published by AERES (Agence de l'évaluation de la recherche et de l'enseignement supérieur), France's independent research evaluation agency. February 2008. This report states: "Sa notoriété scientifique nationale et européenne est globalement très bonne" ("Its national and international scientific reputation is overall very good"). Retrieved 2013-03-02.
External links
Research institutes in France
Computer science institutes in France
French National Centre for Scientific Research
1997 establishments in France
|
https://en.wikipedia.org/wiki/Seventeam%20Electronics
|
Seventeam Electronics () is a Taiwanese manufacturer of power supplies for Personal Computer and Industrial PC. Some earlier models from Seventeam were sold by Cooler Master and SilverStone under their own respective brand names.
See also
List of companies of Taiwan
References
Torres, Gabriel (2008-03-06) "ST-420BKV 420W Power Supply Review". HardwareSecrets.com.
Torres, Gabriel (2008-11-20) "ST-550P-AG Power Supply Review". HardwareSecrets.com.
Methious (2008-07-02) "V-Force 850W PSU". PCFrags.com.
"Seventeam 1200W - 3DGAMEMAN's Choice Award"
External links
Official website
Who is the manufacturer of your PSU?
Computer power supply unit manufacturers
Electronics companies of Taiwan
Manufacturing companies established in 1986
Privately held companies
Taiwanese companies established in 1986
|
https://en.wikipedia.org/wiki/Error%20hiding
|
In computer programming, error hiding (or error swallowing) is the practice of catching an error or exception, and then continuing without logging, processing, or reporting the error to other parts of the software. Handling errors in this manner is considered bad practice and an anti-pattern in computer programming. In languages with exception handling support, this practice is called exception swallowing.
Errors and exceptions have several purposes:
Help software maintainers track down and understand problems that happen when a user is running the software, when combined with a logging system
Provide useful information to the user of the software, when combined with meaningful error messages, error codes or error types shown in a UI, as console messages, or as data returned from an API (depending on the type of software and type of user)
Indicate that normal operation cannot continue, so the software can fall back to alternative ways of performing the required task or abort the operation.
When errors are swallowed, these purposes can't be accomplished. Information about the error is lost, which makes it very hard to track down problems. Depending on how the software is implemented, it can cause unintended side effects that cascade into other errors, destabilizing the system. Without information about the root cause of the problem, it's very hard to figure out what is going wrong or how to fix it.
Examples
Languages with exception handling
In this C# example, even though the code inside the try block throws an exception, it gets caught by the blanket catch clause. The exception has been swallowed and is considered handled, and the program continues.
try {
throw new Exception();
} catch {
// do nothing
}
In this PowerShell example, the trap clause catches the exception being thrown and swallows it by continuing execution. The "I should not be here" message is shown as if no exception had happened.
&{
trap { continue }
throw
write-output "I should not be here"
}
Exception swallowing can also happen if the exception is handled and rethrown as a different exception, discarding the original exception and all its context.
In this C# example, all exceptions are caught regardless of type, and a new generic exception is thrown, keeping only the message of the original exception. The original stacktrace is lost, along with the type of the original exception, any exception for which the original exception was a wrapper, and any other information captured in the exception object.
try {
// do something
} catch (Exception ex) {
// maybe do some local handling of the exception
throw new Exception(ex.Message);
}
A better way of rethrowing exceptions without losing information is to throw the original exception from the catch clause:
try {
// do something
} catch (Exception ex) {
// do some local handling of the exception
throw;
}
Alternatively, a new exception can be created that wraps the original exception,
|
https://en.wikipedia.org/wiki/Nissan%20Motors%20v.%20Nissan%20Computer
|
Nissan Motors v. Nissan Computer was a lengthy court case between the two parties over use of the name Nissan and the domain name nissan.com. The case has received national attention in the U.S.
Background
Nissan Motor Company
Beginning in the late 1970s, Datsun began progressively fitting its cars with small "Nissan" and "Datsun by Nissan" badges. The company eventually changed its branding at 1,100 Datsun dealerships. In autumn 1981, Datsun announced that its name would be changed in the United States. Between 1982 and 1986, the company transitioned from its "Datsun, We Are Driven!" to its "The Name is Nissan" campaign. Five years after the name change program was over, cars in some export markets continued to display badges bearing both names and Datsun still remained more familiar than Nissan.
Uzi Nissan
In 1980, Uzi Nissan founded Nissan Foreign Car, an automobile service, in Raleigh, North Carolina. In 1987, Uzi Nissan founded Nissan International, Ltd, an import/export company that traded primarily in heavy equipment and computers. On 14 May 1991, Uzi Nissan founded Nissan Computer Corporation, which provides sales and service of personal computers, servers, and computer parts, as well as internet hosting and development. Nissan Computer registered nissan.com for its use on 4 June 1994, five years prior to Nissan Motor Corporation's interest in the domain.
In July 2020, Uzi Nissan died of complications from COVID-19.
Case
Nissan Motors considered Nissan Computer's use of the name to be trademark dilution, and laid claim to the domain by alleging cyber squatting. However, Nissan Computer was named after its owner, Uzi Nissan. Following the outcome of the case, Nissan Motors uses the name nissanusa.com for its U.S. website.
References
2004 in United States case law
United States trademark case law
Nissan
|
https://en.wikipedia.org/wiki/Comparison%20of%20open-source%20operating%20systems
|
These tables compare free software / open-source operating systems. Where not all of the versions support a feature, the first version which supports it is listed.
General information
Supported architectures
Supported hardware
General
Networking
Network technologies
Supported file systems
Supported file system features
Security features
See also
Berkeley Software Distribution
Comparison of operating systems
Comparison of Linux distributions
Comparison of BSD operating systems
Comparison of kernels
Comparison of file systems
Comparison of platform virtualization software
Comparison of DOS operating systems
List of operating systems
Live CD
Microsoft Windows
RTEMS
Unix
Unix-like
References
External links
Open Source Operating Systems
|
https://en.wikipedia.org/wiki/Levenmouth
|
Levenmouth is a conurbation comprising a network of settlements on the north side of the Firth of Forth, in Fife on the east coast of Scotland. It consists of three principal coastal towns; Leven, Buckhaven, and Methil, and a number of villages and hamlets inland. The industrial towns of Buckhaven and Methil lie on the west bank of the River Leven, and the resort town of Leven is on the east bank. The "Bawbee Bridge" links the two sides of the river. Historically, Buckhaven and Methil were joined together as one burgh, while Leven was separate. The area had an estimated population of 37,238 in 2006.
Levenmouth's economy has traditionally been focussed on heavy and traditional industries and has struggled economically since the closure of its coal mines. The main employers are Fife Scottish Omnibuses Ltd. Bi-Fab, Diageo, Donaldson Timber, Pfaudler Balfour and Silberline.
History
Toponymy
The area is named after the mouth of the River Leven. The word 'Leven' comes from the Pictish word for 'flood' and was originally given to Loch Leven, the 'flood lake' at the head of the river.
Early history
The first mention of the town of 'Leven' was made in two separate records in the mid-15th century, with urgent need for repair work at the monastery at 'levynnis-mouth' and George Durie – an estate owner – became the keeper of the harbour at 'levynnismouth'.
19th century
Until 1821, the only bridge across the river was the Cameron Brig on the main Kirkcaldy - Cupar road. In that year a pedestrian suspension bridge was built at Leven, which was replaced by a three-arched stone bridge in 1840. The toll to cross this bridge was a Scottish halfpenny, or bawbee. Even though the stone bridge was replaced by a single-span bridge in 1957, it is still known locally as the 'Bawbee Brig'.
In 1854 the Leven Railway opened, linking the town with Thornton Junction on the Edinburgh - Aberdeen main line. This helped it to become a tourist resort popular with visitors from the west of Scotland, and particularly Glasgow. Later in the 19th century the Leven Railway became part of a loop line of the North British Railway linking Thornton Junction and Leuchars Junction via St Andrews. The railway between Leven and St Andrews closed in 1964/65. The railway between Leven and Thornton Junction closed to freight in 1966 and passengers in 1969. On 8 August 2019, the Scottish Government announced that the line between Thornton Junction and Leven would reopen within five years.
With the growth of coal mining and activity at Methil docks, the two towns of Buckhaven and Methil expanded until they were merged into a single burgh in 1891.
Administration
In 1975, the burghs were replaced by a two-tier system of Regional Councils and smaller District Councils. At this time Levenmouth fell under the control of Kirkcaldy District Council as part of the region of Fife. Further reforms in 1996 saw Fife Council become one of 32 unitary authorities.
Under the 1996 scheme Levenmouth is ad
|
https://en.wikipedia.org/wiki/Supersoft
|
Supersoft was a software and computer game developer and publisher founded in England in 1978. It was founded by Peter Calver and Pearl Wellard to develop and publish software primarily for the Commodore PET.
History
The earliest Supersoft catalogue known to have survived dates from December 1979. Earlier catalogues were photocopied in small quantities.
Hardware
In 1980 Supersoft released the first user-installable firmware product to be developed in the UK, the Petmaster Superchip. The following year the company expanded into hardware with the release of a high-resolution graphics card for the Commodore PET - and although by modern standards the resolution of 320 × 200 pixels is not high, it was a considerable improvement on the 80 × 50 capability of the standard model. Originally run from the founders' home in Eastcote, Middlesex the business moved to office premises in Wealdstone in 1981.
Software
Early games published by Supersoft for the Commodore PET included Air Attack (see Blitz computer game) and Super Glooper, the latter based on the popular Pac-Man arcade game. A text-adventure game based on the Douglas Adams book Hitchhiker's Guide to the Galaxy was withdrawn following legal action. The game's programmer, Bob Chappell, rewrote the game to remove all Hitchhiker's references, and Supersoft republished it as "Cosmic Capers.". The most successful business program developed by Supersoft was Busicalc, a spreadsheet program originally produced for the Commodore PET, and converted to the Vic-20 and Commodore 64; it was one of Supersoft's most successful products in the UK and became the company's first and most successful product in the USA, where it was published under licence by Skyles Electric Works. Busicalc 2 and Busicalc 3 followed, the latter offering three-dimensional capabilities.
Forming Audiogenic
In 1984 development commenced on a cricket game for the Commodore 64, which was programmed by Michael McLean and released the following year as Graham Gooch's Test Cricket by Audiogenic Software, a newly formed subsidiary of Supersoft. From 1985 onwards Supersoft focused on home office programs and utilities, as the Audiogenic name was better-known in the games business.
Microvox
In 1987 Supersoft released Microvox, a high-quality digital sampler for the Commodore 64 which, with its accompanying software was developed by Andrew Trott. While only hundreds were sold (the device cost more than the computer), many were used by serious musicians and in professional studios, and one was supplied to Feargal Sharkey, the former lead singer of the Undertones.
Present day
Although Supersoft is still in existence, the company has not developed any new products for retail sale since 1990. The company is wholly owned by Peter Calver.
Reception
Ahoy! in May 1984 stated that the original Busicalc program was written in Commodore BASIC and was "very sluggish".
The original program had been rushed out to compete with an earlier spreadsheet for the
|
https://en.wikipedia.org/wiki/Process%20group
|
In a POSIX-conformant operating system, a process group denotes a collection of one or more processes.
Among other things, a process group is used to control the distribution of a signal;
when a signal is directed to a process group, the signal is delivered to each process that is a member of the group.
Similarly, a session denotes a collection of one or more process groups.
A process may not create a process group that belongs to another session;
furthermore, a process is not permitted to join a process group that is a member of another session—that is, a process is not permitted to migrate from one session to another.
When a process replaces its image with a new image (by calling one of the exec functions), the new image is subjected to the same process group (and thus session) membership as the old image.
Applications
The distribution of signals to process groups forms the basis of job control employed by shell programs.
The TTY device driver incorporates a notion of a foreground process group, to which it sends signals generated by keyboard interrupts, notably SIGINT ("interrupt", ), SIGTSTP ("terminal stop", ), and SIGQUIT ("quit", ).
It also sends the SIGTTIN and SIGTTOU signals to any processes that attempt to read from or write to the terminal and that are not in the foreground process group.
The shell, in turn, partitions the command pipelines that it creates into process groups, and controls what process group is the foreground process group of its controlling terminal, thus determining what processes (and thus what command pipelines) may perform I/O to and from the terminal at any given time.
When the shell forks a new child process for a command pipeline, both the parent shell process and the child process immediately make the child process into the leader of the process group for the command pipeline. In this way, it is ensured that the child is the leader of the process group before either the parent or the child relies on this being the case.
Where a textual user interface is being used on a Unix-like system, sessions are used to implement login sessions.
A single process, the session leader, interacts with the controlling terminal in order to ensure that all programs are terminated when a user "hangs up" the terminal connection.
(Where a session leader is absent, the processes in the terminal's foreground process group are expected to handle hangups.)
Where a graphical user interface is being used, the session concept is largely lost, and the kernel's notion of sessions largely ignored.
Graphical user interfaces, such as where the X display manager is employed, use a different mechanism for implementing login sessions.
Details
The system call setsid is used to create a new session containing a single (new) process group, with the current process as both the session leader and the process group leader of that single process group.
Process groups are identified by a positive integer, the process group ID, which is the proce
|
https://en.wikipedia.org/wiki/Commodore%20Force
|
Commodore Force was a computer games magazine covering games for the Commodore 64. It was published in the UK by Europress Impact. Its predecessor was Zzap!64.
Background
Commodore Force was created when Zzap! 64 was re-launched with a new name and design. The name change was not only in line with the then current Europress Impact titles, Sega Force, N-Force, Amiga Force, but served to distance the magazine from the old Zzap! 64 style.
The editorial team included Steve Shields (managing editor), Phil King (deputy editor), Chris Hayward, Ian Osborne and James Price, all staff writers. Issue 1 had the cover date of January 1993. Regular editorial content included What's Happening (news), Reel Action (2x cover tapes), Lloyd Mangram's Mail Bag (letters), The Tipster, Public Sector (PD column), Bash Yer Brains (Adventure section) and The Mighty Brian (a technical section). First Samurai received the first new Commodore Force "Hurricane Hit" accolade with a 97% overall rating.
By issue 2 Phil King had gone, his vacant Deputy Editor position filled by Ian Osborne. Miles Guttery joined as staff writer to replace James Price who had also left.
In issue 4, publishers Europress Impact changed their name to Impact Magazines. Controversy ensued as Emlyn Hughes International Soccer was released on budget and harshly reviewed by Chris Hayward and Miles Guttery, who gave ratings of 46% and 70%. Countless Emlyn Hughes International Soccer fans bombarded the magazine with complaints. The magazine later retracted the rating in a games round up in issue 10 and awarded it a middle-of-the-road 75%.
With issue 10 Zzap! 64, or Commodore Force (incorporating Zzap! 64), reached 100 issues. A pull-out Zzap!64 100th issue special featured all the gold medal games in the magazine's history. Steve Shields had left, to go to Sega Force Mega / Sega Master Force, leaving the Editor's position to James Price, who had previously returned in issue 6. Ian Osborne had also left, going over to Amiga Force.
In Issue 11 and Commodore Force listed its Top 100 Commodore 64 games of all time. Top three games listed included Head over Heels, runner up Laser Squad and top spot goes to Frankie Goes To Hollywood. Chris Hayward also departed during this time.
A triple whammy of Hurricanes were reviewed in issue 12. The long-awaited Mayhem In Monsterland and Lemmings both received an overall rating of 97%, while Alien 3 was awarded 93%.
The readers got their chance to have a top 100 Commodore 64 game of all-time list. Creatures came out on top, followed by The Blues Brothers, Creatures 2, Turrican 2 and Bubble Bobble.
A readers awards of 1993 is listed in issue 15. Main awards included Beat ‘em up for Barbarian 2, best sport game was Emlyn Hughes International Soccer. The Blues Brothers won best movie tie-in, while the main best game overall went to Mayhem In Monsterland.
Issue 16’s next-month page announced that the next issue would feature the CF team's favourite gam
|
https://en.wikipedia.org/wiki/Upoc%20Networks
|
Upoc Networks was a New York–based mobile phone services provider and carrier aggregator. Upoc was founded in 1999 and has developed mobile community solutions for carriers, consumers, media companies and marketers to communicate via SMS (text messaging), WAP (wireless Internet), voice, MMS (multimedia messaging), BREW, Java, and other technologies.
Upoc was sold in 2006 to Dada USA, at a reported loss of approximately $19 million.
Dada USA then was renamed Dada Entertainment and today is a Subsidiary of Buongiorno, an International mobile content Company
Upoc announced it was discontinuing service on October 25, 2011, in a short website statement and a posting on its official Twitter page.
November 30, 2011, was the last day of service, as of December 1, 2011, the Upoc service has been shut down.
References
External links
Official Site
Upoc Community Portal
Defunct mobile phone companies of the United States
|
https://en.wikipedia.org/wiki/Login%20session
|
In computing, a login session is the period of activity between a user logging in and logging out of a (multi-user) system.
On Unix and Unix-like operating systems, a login session takes one of two main forms:
When a textual user interface is used, a login session is represented as a kernel session — a collection of process groups with the logout action managed by a session leader.
Where an X display manager is employed, a login session is considered to be the lifetime of a designated user process that the display manager invokes.
On Windows NT-based systems, login sessions are maintained by the kernel and control of them is within the purview of the Local Security Authority Subsystem Service (LSA). winlogon responds to the secure attention key, it requests the LSA to create login sessions on login, and terminates all of the processes belonging to a login session on logout.
See also
Booting process of Windows NT
Architecture of Windows NT
Booting
Master boot record
Power-on self-test
BootVis
Further reading
Operating system technology
|
https://en.wikipedia.org/wiki/Student/Farmworker%20Alliance
|
Student/Farmworker Alliance (SFA) is a network of students and youth formally organized in 2000 in the United States. SFA campaigns for the improvement of working conditions in the agricultural fields of the United States. The organization cooperates with the Coalition of Immokalee Workers (CIW), a membership-led organization of mostly Mexican, Guatemalan and Mayan Indian immigrants working in agricultural and other low-wage jobs throughout the state of Florida.
Taco Bell Boycott
In March 2005, after four years of campaigning, farmworkers from the CIW and their allies scored a decisive victory in their national Taco Bell boycott. Yielding to growing pressure from the CIW, students, and other allies, Taco Bell and its parent company Yum! Brands conceded to all of the boycott's demands, agreeing to work with the CIW to improve the sub-poverty wages and working conditions of farmworkers in its tomato supply chain.
Students and youth were a crucial part of this grassroots coalition. As Taco Bell's target market (18- to 24-year-olds), they instead put a target on Taco Bell, making the boycott one of the fastest-growing campaigns for economic justice on campuses and communities throughout the country. Between 2002 and 2005, twenty-two high schools and universities removed or prevented Taco Bell restaurants and sponsorships as part of SFA's “Boot the Bell” campaign. By the boycott's end, dozens of additional campaigns were underway, and Taco Bell was unable to secure new campus contracts without fear of vocal student opposition.
The Campaign Against McDonald's
In the wake of the Taco Bell Boycott victory, the CIW focused in 2006 on the McDonald's Corporation, demanding better wages for the farmworkers providing tomatoes in their supply chain. On April 9, 2007, after two years of intense campaigning, McDonald's agreed to meet all of the CIW's demands. As in the Taco Bell Boycott victory, youth and student organizing played a crucial role in the swift success of the McDonald's campaign.
References
Media resources
Farm Workers Target McDonald's, Suppliers Common Dreams News Center
I'm leavin' it: Students and Farmworkers Bring on McDonald's: AFL-CIO
Students take tomato pickers' fight to McDonald's: Workday Minnesota
An Open Letter to Ronald McDonald: Guerrilla News Network
Student Groups to McD's: "Our Patience Is All But Exhausted": Student/Farmworker Alliance
A win for the Coalition of Immokalee Workers: In These Times
Doing It For Themselves: In These Times
After McDonald's Victory, Labor Activists Target Burger King: The New Standard
External links
Student organizations in the United States
Workers' rights organizations based in the United States
Agricultural organizations based in the United States
|
https://en.wikipedia.org/wiki/Edge%20computing
|
Edge computing is a distributed computing paradigm that brings computation and data storage closer to the sources of data. This is expected to improve response times and save bandwidth. Edge computing is an architecture rather than a specific technology, and a topology- and location-sensitive form of distributed computing.
The origins of edge computing lie in content distribution networks that were created in the late 1990s to serve web and video content from edge servers that were deployed close to users. In the early 2000s, these networks evolved to host applications and application components on edge servers, resulting in the first commercial edge computing services that hosted applications such as dealer locators, shopping carts, real-time data aggregators, and ad insertion engines.
Internet of things (IoT) is an example of edge computing. A common misconception is that edge and IoT are synonymous.
Definition
One definition of edge computing is the use of any type of computer program that delivers low latency nearer to the requests. Karim Arabi, in an IEEE DAC 2014 Keynote and subsequently in an invited talk at MIT's MTL Seminar in 2015, defined edge computing broadly as all computing outside the cloud happening at the edge of the network, and more specifically in applications where real-time processing of data is required. Thus, edge computing does not have the climate-controlled advantages of data centers despite the large amount of processing power necessary.
The term is often used as synonymous with fog computing. This especially is quite relevant for small deployments. However, when the deployment size is large, e.g., for Smart Cities, fog computing can be a distinct layer between the Edge and the Cloud. Hence in such deployments, Edge layer is a distinct layer too which has specific responsibilities.
According to The State of the Edge report, edge computing concentrates on servers "in proximity to the last mile network". Alex Reznik, Chair of the ETSI MEC ISG standards committee, loosely defines the term by essentially suggesting that anything that's not a traditional data center could be the 'edge' for somebody.
Edge nodes used for game streaming are known as gamelets, which are usually one or two hops away from the client. Per Anand and Edwin say "the edge node is mostly one or two hops away from the mobile client to meet the response time constraints for real-time games' in the cloud gaming context."
Edge computing may employ virtualization technology to make it easier to deploy and run a wide range of applications on edge servers.
Concept
The world's data is expected to grow 61 percent to 175 zettabytes by 2025. According to research firm Gartner, around 10 percent of enterprise-generated data is created and processed outside a traditional centralized data center or cloud. By 2025, the firm predicts that this figure will reach 75 percent. The increase of IoT devices at the edge of the network is producing a massive amount
|
https://en.wikipedia.org/wiki/Whale%20%28computer%20virus%29
|
The Whale virus is a computer virus discovered on July 1, 1990. The file size, at 9,216 bytes, was for its time the largest virus ever discovered. It is known for using several advanced "stealth" methods.
Description
After the file becomes resident in the system memory below the 640k DOS boundary, the operator will experience total system slow down as a result of the virus' polymorphic code. Symptoms include video flicker to the screen writing very slowly. Files may seem to "hang" even though they will eventually execute correctly. This is just a product of the total system slow down within the system's memory.
It was reported that one infected program displayed the following message when run:
THE WHALE IN SEARCH OF THE 8 FISH
I AM '~knzyvo}' IN HAMBURG addr error D9EB,02
Shifting the letters of "~knzyvo}" left in the ASCII table by 10 characters turns the string into "tadpoles".
See also
Computer virus
Comparison of computer viruses
References
External links
McAfee Virus Description
F-Secure Virus Description
DOS file viruses
Crime in Hamburg
Cybercrime in Germany
|
https://en.wikipedia.org/wiki/Short%20Code%20%28computer%20language%29
|
Short Code was one of the first higher-level languages developed for an electronic computer. Unlike machine code, Short Code statements represented mathematic expressions rather than a machine instruction. Also known as an automatic programming, the source code was not compiled but executed through an interpreter to simplify the programming process; the execution time was much slower though.
History
Short Code was proposed by John Mauchly in 1949 and originally known as Brief Code. William Schmitt implemented a version of Brief Code in 1949 for the BINAC computer, though it was never debugged and tested. The following year Schmitt implemented a new version of Brief Code for the UNIVAC I, where it was now known as Short Code (also Short Order Code). A revised version of Short Code was developed in 1952 for the Univac II by A. B. Tonik and J. R. Logan.
While Short Code represented expressions, the representation itself was not direct and required a process of manual conversion. Elements of an expression were represented by two-character codes and then divided into 6-code groups in order to conform to the 12-byte words used by BINAC and Univac computers. For example, the expression
a = (b + c) / b * c
was converted to Short Code by a sequence of substitutions and a final regrouping:
X3 = ( X1 + Y1 ) / X1 * Y1 substitute variables
X3 03 09 X1 07 Y1 02 04 X1 Y1 substitute operators and parentheses.
Note that multiplication is
represented by juxtaposition.
07Y10204X1Y1 group into 12-byte words.
0000X30309X1
Along with basic arithmetic, Short Code allowed for branching and calls to a library of functions. The language was interpreted and ran about 50 times slower than machine code.
See also
History of programming languages
Algorithm
References
External links
Wexelblat, Richard L. (Ed.) (1981). History of Programming Languages, p. 9. New York: Academic Press.
Procedural programming languages
Programming languages created in 1950
|
https://en.wikipedia.org/wiki/SportsNation%20%28website%29
|
SportsNation is a feature section on ESPN.com, labeled "Where America's Sports Fans Meet".
Programming
Daily features include "The Show", which consisted of "The Morning Quickie with Dan Shanoff" until September 2006. Depending on the sports in season, there may be two to three shows on that sport. Currently, after The Morning Buzz, fantasy analysis is presented from any of Christopher Harris, Matthew Berry, Stephania Bell, Scott Engel, AJ Mass, Nate Ravitz, Eric Karabell, and Tristan Cockcroft. On Monday Nights, Buzz used to chat during the Monday Night Football game. But that has been discontinued.
The Morning Buzz
"The Morning Buzz" was the first of many chat sessions and took place every weekday from 10am EST to 11am EST, followed by chat sessions with other notable ESPN.com personalities; along with celebrities and athletes. The Morning Buzz discussed current sports news, along with pop culture, pop tarts and the chatters' lunch selection for the day. The most infamous chatter on the Morning Buzz was Hurricane Jeff from Byesville, Ohio. At the beginning of every post, Hurricane would reintroduce himself. Hurricane Jeff was eventually banned from the Morning Buzz for trying to replace Robert's WIR with the Weekly Whisper. Hurricane Jeff was a controversial character and will go down in history as one of the most influential and creative chatters on the Morning Buzz. A Facebook page for chatters on the Morning Buzz has been created, and started both awards and a Hall of Fame for chatters. Common jokes included Rich Rodriguez, Zach Rastall being pond scum, and fat jokes aimed towards buzz. At 50 past the hour, everyone posted what they were having for lunch. When Buzz was off for the day(or week) the infamous Buzzette filled in and took his place. Buzz announced on September 23, 2011 that the Morning Buzz will officially end on Friday, September 30, 2011.
The Week in Review
The Week in Review (abbreviated WIR in the chat) is a long post written by Robert in Raleigh NC every Friday. The WIR generally is posted around 10:50 and reviews topics from the week in a story format. The topics which are generally unrelated, are tied together in some way. The WIR started when a chat user asked what happened during a week of chat that he missed. Robert responded using a similar format to the current WIR and most of the chat users enjoyed it, so the WIR became a weekly segment.
In late 2007, Robert posted that he had to leave the Morning Buzz to do discipline at work and the WIR stopped. During the last week in February, Robert returned to the chat and posted his first WIR on February 29.
An example of a WIR that was posted on February 29, 2008 is shown below:
The End of The Morning Buzz
On September 23, 2011 at 10:15 ET, Buzz announced that The Morning Buzz was going to be canceled. Buzz stated,
The last chat was held on September 30, ending its 4-year run.
External links
SportsNation home page
SportsNation Chat Archives
ESPN.com
|
https://en.wikipedia.org/wiki/World%20Youth%20Student%20and%20Educational%20Travel%20Confederation
|
The World Youth Student and Educational Travel Confederation was formed in 2006. It has a network of 5000 locations in 118 countries.
The International Student Travel Confederation was a non-profit organisation founded in 1949 with a goal to secure and inform students of cheaper and or tax free travel. Working in more than 100 countries. It merged with the Federation of Youth Travel Organisation in 2006 to form a new organisation based in Amsterdam.
Local Associations that belong to ISIC (partial list)
Argentina: ASATEJ
Australia: STA Travel
Belarus: Youth Travel Centre
Belgium: Connections
Brazil: STB Student Travel Bureau
Perú: ISIC - INTEJ
Canada: Canadian Federation of Students-Services (CFS-Services)
Denmark: STA Travel Denmark
France: Wasteels Voyages
India: STIC Travels
Israel: Issta
Japan: University Coop. Federation
Lebanon: Campus Travel
Mexico: SETEJ Mexico A.C.
New Zealand: STA Travel
Poland: Almatur
South Africa: STA Travel
United Kingdom: STA Travel
External links
http://www.istc.org/
References
International non-profit organizations
International student organizations
Non-profit organisations based in the Netherlands
Organisations based in Amsterdam
Travelers organizations
|
https://en.wikipedia.org/wiki/Bundesautobahn%2017
|
is an autobahn in Saxony, south-eastern Germany. It links Dresden to the Czech border where the D8 continues to Prague. The road is a fairly new contribution to the German autobahn network. Construction began in 1998, with the first stretch opening in 2001 and the last in 2006.
History
The Dresden-Prague connection was first conceptualized in 1938 as Strecke 72. In Dresden, both a south-western variant and a north-eastern variant via the Dresdener Heide and Pirna were planned. The latter was chosen in 1940, but work was postponed owing to the war. In the late 1960s, the GDR revived the pre-war plans, and at the end of the 1970s, a southern route, similar to that existing today, was decided upon. However, probably for cost reasons, this project remained at planning stage.
After reunification, the German government decided that due to the increased truck traffic on federal highway (Bundesstraße) B170, construction had become more urgent. Building on the existing plans, various routes west of Dresden were designed, of which a relatively near-urban variant was adopted. The section from Pirna to the state border, however, was planned further to the west for reasons of landscape protection, as the original route would have touched the Saxon Switzerland National Park region.
The name A17 was earmarked for another highway in the early 1990s. This road was to lead southeast from Bautzen to Zittau and on to the Czech Republic, where it would connect with the D35. In Zittau a triangular junction was to connect with the A18 from Cottbus to Zittau, which has not been built. Part of this route has been built and numbered B178n. Today's A17 is eventually to be renumbered as part of the A13.
Several citizens' initiatives and environmental groups (including the Green League) opposed construction, while the Bundestag, the Federal Ministry of Transport and the Saxon cabinet pushed it on economic grounds. The Dresden City Council rejected a variant of the A17 which cut through the city as it feared, among other things, unacceptable noise and air pollution. Even the then mayor of Dresden, Herbert Wagner (CDU), failed with his veto. Then a citizens' initiative for the construction of the A17 was founded, which initiated a referendum together with parts of the Dresden CDU-Stadtspitze. On 5 November 1995, about 50% of the Dresden electorate took part in this referendum, of whom around 2/3 voted in favour of the construction of the city-cutting variant.
The plan went through an environmental impact study, to prevent damage to the habitat. The hills are not required to be flattened:
FFH (Fauna-Flora-Habitat-Richtlinie - Habitats Directive) area 37E - Valleys of the United and Wilder Weisseritz
FFH area 179 - Lockwitzgrund and Wilisch (compatibility with low-wing bridge, see above)
FFH area 180 - Meuschaer Höhe (compatibility by green bridge)
FFH area 85E - Seidewitztal and Börnersdorfer Bach (compatibility through arch bridge without supports in the valley bot
|
https://en.wikipedia.org/wiki/American%20Independent%20Network
|
The American Independent Network was one of the first major attempts at building a commercial television network consisting of low-powered television stations. Started by Don Shelton, Randy Moseley, and Lyn Snyder, it was similar to the older Channel America (and its successor, America One (A1)), and was the foundation for Urban America TV (UATV). In 2000, several stations sold by USA Networks to Univision carried AIN for about a year while Univision got their second network, TeleFutura, ready to launch on the stations. AIN merged with Hispano Television Ventures in early 2000, forming Hispanic Television Network (HTVN). The new company operated both HTVN and AIN, but the majority of the company's attention was focused on HTVN. HTVN went off the air in 2003, while AIN went off the air two years earlier in 2001, and turned into Urban America Television, with most AIN affiliates either going independent or switching to other networks, like A1 or UATV.
See also
AMGTV
America One
Channel America
Hispanic Television Network
Independent station
Ion Television
Network One
Urban America Television
Defunct television networks in the United States
Television channels and stations disestablished in 2003
Television channels and stations established in 2000
|
https://en.wikipedia.org/wiki/SQLFilter
|
SQLFilter is a plugin for OmniPeek that indexes packets and trace files into an SQLite database. The packets can then be searched using SQL queries. The matching packets are loaded directly into OmniPeek and analyzed. The packet database can also be used to build multi-tier data mining and network forensics systems.
As more companies save large quantities of network traffic to disk, tools like the WildPackets SQLFilter make it possible to search through packet data more efficiently. For network troubleshooters, this revolutionizes the job of finding packets. Not only does the SQLFilter allow users to search for packets across thousands of trace files, it also loads the resulting packets directly into OmniPeek or EtherPeek. This cuts out many of the steps usually involved in this process and dramatically shortens time to knowledge, and time to fix.
External links
discussion of the SQLFilter Packet Data Mining and Network Forensics.
Network analyzers
Packets (information technology)
|
https://en.wikipedia.org/wiki/Jack%20Lutz
|
Jack Lutz is an American theoretical computer scientist best known for developing the concepts of resource bounded measure and effective dimension; he has also published research on DNA computing and self-assembly. He is a professor of computer science and mathematics at Iowa State University.
Education and career
Lutz was a student at the University of Kansas, graduating in 1976 and earning master's degrees in mathematics and in computer science there in 1979 and 1981 respectively. He went to the California Institute of Technology for doctoral study in mathematics, and completed his Ph.D. in 1987, with the dissertation Resource-Bounded Category and Measure in Exponential Complexity Classes supervised by Alexander S. Kechris.
He has spent the rest of his career at Iowa State University, as an assistant professor from 1987 to 1992, associate professor from 1992 to 1996, and full professor since 1996. At Iowa State, he directs the Laboratory for Molecular Programming.
Personal life
Lutz is married to Robyn Lutz, a professor of computer science at Iowa State University; their son Neil Lutz is also a computer scientist and a visiting assistant professor of computer science at Swarthmore College. They have published together on algorithmic game theory in DNA computing.
References
External links
Homepage of Jack Lutz at Iowa State University
American computer scientists
University of Kansas alumni
California Institute of Technology alumni
Iowa State University faculty
Living people
Year of birth missing (living people)
Place of birth missing (living people)
20th-century American mathematicians
21st-century American mathematicians
Theoretical computer scientists
|
https://en.wikipedia.org/wiki/Cisco%20HDLC
|
Cisco HDLC (cHDLC) is an extension to the High-Level Data Link Control (HDLC) network protocol, and was created by Cisco Systems, Inc. HDLC is a bit-oriented synchronous data link layer protocol that was originally developed by the International Organization for Standardization (ISO). Often described as being a proprietary extension, the details of cHDLC have been widely distributed and the protocol has been implemented by many network equipment vendors. cHDLC extends HDLC with multi-protocol support.
Framing
Cisco HDLC frames uses an alternative framing structure to the standard ISO HDLC. To support multiple protocols encapsulation, cHDLC frames contain a field for identifying the network protocol.
Structure
cHDLC frame structure
The following table describes the structure of a cHDLC frame on the wire.
The Address field is used to specify the type of packet contained in the cHDLC frame; 0x0F for Unicast and 0x8F for Broadcast packets.
The Control field is always set to zero (0x00).
The Protocol Code field is used to specify the protocol type encapsulated within the cHDLC frame (e.g. 0x0800 for Internet Protocol).
SLARP address request–response frame structure
The Serial Line Address Resolution Protocol (SLARP) frame is designated by a specific cHDLC protocol code field value of 0x8035.
Three types of SLARP frame are defined: address requests (0x00), address replies (0x01), and keep-alive frames (0x02).
The following table shows the structure of a SLARP cHDLC address request–response frame.
The op-code will be 0x00 for address requests and 0x01 for address responses.
The Address and Mask fields are used to contain a four-octet IP address and mask. These are 0 for address requests.
The two-byte Reserved field is currently unused and undefined.
SLARP Keep-Alive frame structure
The following table shows the structure of a SLARP cHDLC keep-alive frame.
The op-code is 0x02 for keep-alives.
The sender sequence number increments with each keep-alive sent by this sender.
The received sequence number is the last sequence number received by this sender.
The two-byte Reliability field is required to be set to 0xFFFF.
See also
Point-to-Point Protocol, an Internet Standard defined by RFC 1661 and RFC 1662 that solves the problems Cisco HDLC solves as well as many other problems.
External links
Serial Line Address Resolution Protocol, IP Addressing: ARP Configuration Guide, Cisco IOS Release 15M&T, December 3, 2012
http://www.nethelp.no/net/cisco-hdlc.txt
http://securitydigest.org/tcp-ip/archive/1990/11#000068
https://web.archive.org/web/20110723160051/http://www.irbs.net/internet/nanog/9610/0459.html
Link protocols
Telecommunication protocols
Year of introduction missing
|
https://en.wikipedia.org/wiki/OK%20Calculator
|
OK Calculator is a demo collection from TV on the Radio which they self-released in 2002. The album's title alludes to Radiohead's album OK Computer.
Origins
Reception
In Magnet, Bryan Bierman listed the album as a hidden gem and wrote, “Adebimpe’s voice alone makes up most of the tracks, and though the album’s rough sound takes some getting used to, this arrangement is surprisingly effective. Songs like ‘Yr God’ and ‘Aim To Please’ show off his soulful vocals, and you can hear some early signs of the later songwriting style the group would adapt. Sitek's recordings are a little more polished, using the atmospheric electronics that would later envelope a lot of TVOTR's music, like the slow ambience of ‘On A Train,” or the Kraftwerk fever dream ‘Pulse Of Pete.’”
Track listing
"Freeway" – 2:19
"Say You Do" (Samples Raymond Scott's "Night and Day" and Nina Simone's Wild is the Wind) – 5:19
"Pulse of Pete" – 3:36
"Me - I" – 3:20
"Buffalo Girls" – 2:58
"Ending of a Show" – 1:09
"Hurt You" – 6:28
"Netti Fritti" – 5:14
"Yr God" – 2:35
"On a Train" – 16:07
"Sheba Baby" – 3:56
"Y King" – 2:43
"Aim to Please" – 3:07
"Bicycles Are Red Hot" – 3:57
"Los Mataban" – 3:00
"Robots" – 3:10
"Doing My Duty" – 5:52
"Untitled" – 0:06
The tracks "Freeway" and "On a Train" later re-appeared on the 2004 7" and CD single for "Staring at the Sun".
References
External links
Downhill Battle Interview
2002 debut albums
TV on the Radio albums
Self-released albums
Albums produced by Dave Sitek
|
https://en.wikipedia.org/wiki/Big%20Iron%20%28disambiguation%29
|
Big Iron is a western ballad by Marty Robbins, released in 1960.
Big Iron may also refer to:
Mainframe computer, a large, powerful computer
Big Iron River, a river in Ontonagon County, Michigan
Big Iron (album), an album by Carol Noonan
"Big Iron", an episode of Knight Rider
See also
Big Iron Farm Show in West Fargo, North Dakota, USA
Big Iron World, a 2006 album by Old Crow Medicine Show
|
https://en.wikipedia.org/wiki/David%20Asman
|
David Asman (; born February 15, 1954) is an American television news anchor for Fox Business and Fox News.
Asman first joined Fox News in 1997. He hosts Bulls & Bears on the Fox Business Network and numerous other Fox News Specials. He previously hosted Forbes on Fox and Fox News Live weekdays before joining the Fox News Channel's documentary unit.
Career
Early career
In 1978, Asman was hired as an assistant editor at Prospect. The next year, he became the magazine's executive editor. In 1980, Asman was hired by George Gilder to start an economic journal at the Manhattan Institute.
The Wall Street Journal
Asman began his career at the editorial page of The Wall Street Journal, where he covered Latin America for 12 years, before becoming editorial features editor. While in Latin America during the volatile period of the 1980s, he wrote over 100 articles and won several awards from the Inter-American Press Association for his writings on Cuba and Mexico, as well as for his editing of a weekly column on Latin America. During this period, Asman also edited a column on business management for The Wall Street Journal called "Manager's Journal." Two collections of these columns were published, the last of which, The Wall Street Journal On Management: Adding Value Through Synergy, was published by Doubleday. Asman was appointed editorial features editor at a time when the Journal'''s editorial page was breaking stories on Whitewater.
Fox News
Asman left The Wall Street Journal to join Fox News in 1997, one year after the news channel's inception. He has interviewed many politicians, newsmakers, and business leaders such as Sarah, Duchess of York, Congressman Ron Paul, Rupert Murdoch, Barry Diller, Michael Eisner, Steve Forbes, William F. Buckley, Jr., John R. Bolton, Otto Reich, Mosab Hassan Yousef, Pat Robertson, Rudy Giuliani, Woody Johnson, Donald Trump, Buzz Aldrin, Ben Stein, Dick Cavett, Stan Lee, Peter Guber, Chuck Norris, David Stern, Don Garber, Joe Gibbs, Cal Ripken Jr., Danika Patrick, and the Williams sisters; U.S. President George W. Bush; Canadian Prime Minister Stephen Harper; Navy secretary J. William Middendorf; 9/11 Hero Dave Karnes; Securities and Exchange Commission chairman Harvey Pitt; and former House Speaker Newt Gingrich.
Publications
Asman continues to write articles for The Wall Street Journal and other publications, including an article about his Marine stepson, and an article about his wife's stroke and their experiences with British Health Care.
Cable news show history
Fox Business
Fox Business, (Co-Anchor, 2007–present)
America's Nightly Scoreboard, (Anchor, 2007–2011)
After the Bell, (Co-Anchor, 2008–present)
Power and Money (2011)
Fox News
Fox News Live (anchor, 1997–2005)
Forbes on Fox'' (host, 2002–2018)
Personal
Asman is married to Marta Cecilia, a native of Nicaragua. Asman's stepson, Felipe, served with the U.S. Marine Corps during the Iraq War.
References
External links
FOX News Channel: David As
|
https://en.wikipedia.org/wiki/Network%20One
|
Network One was a small "independent" network, consisting of mostly low-powered television stations, scattered across the Continental United States, similar to Urban America Television, America One, or the better-known Ion (formerly PAX). The network officially launched on December 1, 1993, around the same time as Channel America and the American Independent Network, but shut down on November 13, 1997.
"Alternative" programming
Focusing on "alternative" programming, the network consisted of various B-Grade movies, beauty pageants, anime, and episodes of the series Night Flight and Bohemia Afterdark (a Portland, Oregon-based Music Video show). Classic episodes of the 1950s "hard-boiled" crime drama Lock-Up with Macdonald Carey were featured as well. Commercials were filled with advertisements for 1-900 chat lines with a more mature focus.
List of affiliates
Most affiliates have either gone independent, switched affiliations to another television network, or have simply gone off the air. Some, however, have simply turned into rebroadcasters for other stations.
See also
America One
American Independent Network
Channel America
ION Television
Independent station
Urban America Television
References
Sources
Network One on the Web Archive
Defunct television networks in the United States
Television channels and stations established in 1993
Television channels and stations disestablished in 1997
|
https://en.wikipedia.org/wiki/Computer%20Chronicles
|
Computer Chronicles (also titled as The Computer Chronicles from 1983 to 1989) is an American half-hour television series, which was broadcast from 1983 to 2002 on Public Broadcasting Service (PBS) public television and which documented various issues from the rise of the personal computer from its infancy to the global market at the turn of the 21st century.
History and overview
The series was created by Stewart Cheifet (later the show's co-host), who was then the station manager of the College of San Mateo's KCSM-TV (now independent non-commercial KPJK). The show was initially broadcast as a local weekly series beginning in 1981. The show was, at various points in its run, produced by KCSM-TV, WITF-TV in Harrisburg, Pennsylvania, and KTEH in San Jose. It became a national series on PBS in 1983, running until 2002, with Cheifet as host.
Gary Kildall, founder of the software company Digital Research, served as Cheifet's co-host from 1983 to 1990, providing insights and commentary on products, as well as discussions on the future of the ever-expanding personal computer sphere. After Kildall left the show, Cheifet would serve as solo host from 1991 onward. After his death in 1994, the show paid tribute to Kildall in a special episode.
Computer Chronicles had several supporting presenters appearing alongside Cheifet, including:
George Morrow: Presenter, commentator and occasional co-host, who for a time headed the Morrow Design company, Morrow was a well-known face on the Chronicles until the 1990s. Morrow died in 2003.
Paul Schindler: Featured predominantly in software reviews, Schindler contributed to the series until the early 1990s.
Tim Bajarin: author and columnist who appeared on a few of the 1990s episodes as a co-host and contributor.
Wendy Woods: Provided reports for many software and hardware products, as well as talking with the main presenters in the studio about specific topics.
Janelle Stelson: presented the news and reviews segment.
Jan Lewis: Former president of the Palo Alto Research Group (not to be confused with Xerox PARC), served as both co-host and interviewee throughout the 1980s.
Herb Lechner: with SRI International, served as both co-host and interviewee on some of the earliest episodes.
Format
The Computer Chronicles format remained relatively unchanged throughout its run, except perhaps with the noticeable difference in presenting style; originally formal, with Cheifet and the guests wearing business suits (with neckties) customary in the professional workplace in the early 1980s, it evolved by the 1990s into a more relaxed, casual style, with Cheifet and guests adopting the "business casual" style of dress that the Silicon Valley computer industry arguably helped pioneer.
Beginning in 1984, the last five minutes or so featured Random Access, a segment that gave the viewer the latest computer news from the home and business markets. Stewart Cheifet, Janelle Stelson, Maria Gabriel and various other individuals
|
https://en.wikipedia.org/wiki/Mr.%20Microchip
|
Mr. Microchip is a live-action children's television series that focused on the world of computer technology and the (then) relatively new home computer trend of the early 1980s. Several 8-bit home computers of the era were seen in the show, including the Apple II, Commodore, Atari and Tandy series. It was originally broadcast in Canada on the CBC, between 1983 and 1985, and later shown in the U.K., Australia and South Africa.
Production
The show was produced by Canadian animation company, Nelvana, whom at the time had also produced some of its first television series: Inspector Gadget, 20 Minute Workout and The Edison Twins. A total of thirteen episodes were produced. The original scripts were later re-used to produce the same thirteen episodes in French, using different actors, as a show titled M. Micropuce. All twenty-six episodes were produced during the summer of 1982 through the fall of 1984.
The series was created by Skip Lumley and Michael Hirsh, Nelvana and Ventura Pictures, produced by Michael Hirsh and directed by Peter Jennings. Most of the computer hardware, software and electronics in the show were donated by various companies, looking to promote their products at the time.
To date, the show has not been released on home video or DVD.
Synopsis
Aimed at school students aged nine to fifteen, and designed to teach children basic knowledge about computers. It featured Skip Lumley, an adult computer consultant, and his two neighbours, twelve-year-old Stevie Grosfield and his ten-year-old sister Dayna Simon. Visiting Skip's workshop, Stevie and Dayna learned about computers through hands-on demonstrations and clear, analogy-filled explanations. The trio were accompanied by an artificial intelligence fantasy computer named Lumley and a robot called Hero.
Episodes (1982-84)
Episode 1 - "Information please"
Episode 2 - "Bits of programming"
Episode 3 - "Memory is made of this"
Episode 4 - "The computer has a code"
Episode 5 - "Problems, problems, problems"
Episode 6 - "You can count on computers"
Episode 7 - "Flights of fancy"
Episode 8 - "A pixel is worth a thousand words"
Episode 9 - "Music on key"
Episode 10 - "Does that compute?"
Episode 11 - "Games computers play"
Episode 12 - "Ask the teacher"
Episode 13 - "Computers don't do windows"
See also
The Edison Twins, Nelvana's first live-action series.
Bill Nye the Science Guy
Beakman's World
The Screen Savers
References
1980s Canadian children's television series
Television series by Nelvana
1983 Canadian television series debuts
1983 Canadian television series endings
|
https://en.wikipedia.org/wiki/Dave%20Kleiman
|
Dave Kleiman (22 January 1967 – 26 April 2013) was an American computer forensics expert, an author or co-author of multiple books and a frequent speaker at security related events.
Craig Steven Wright claims Kleiman was involved in the invention of Bitcoin, and that Wright himself was Satoshi Nakamoto, Bitcoin's main inventor. Wright's claims are widely regarded as a hoax.
Background
At the age of 21 in 1988, Kleiman was named United States Army Soldier of the Year. He received the Army Achievement Medal and a commendation signed by the Secretary of the Army. The commendation said in part, "Appearance, knowledge of general military subjects, current events and other subjects covered coupled with your strong dedication to duty, never failed to produce anything but outstanding results."
After distinguished service in the Army, Kleiman
returned to his hometown and became a sworn law enforcement officer for the Palm Beach County Sheriff's Office (PBSO). In 1995, a motorcycle accident left him paralyzed, requiring the use of a wheelchair. After his recovery, he continued working at PBSO and attained the rank of detective. He also worked as a System Security Analyst in the Computer Crimes Division and helped configure the Computer Forensics Lab. Kleiman went on to work at a number of high tech companies before becoming a partner in a computer forensics business. Kleiman died in his home in late April 2013, seemingly of natural causes related to complications from a MRSA infection.
Computer security & cryptography
Some of Kleiman's most notable work took place at S-doc (Securit-e-doc, ) where his role was Chief Information Security Officer. While there he developed a Windows encryption tool that surpassed NSA, NIST, and Microsoft Common Criteria Guidelines. This technology was used at NASA, U.S. Dept. of Treasury, Office of the Inspector General, and the US Post Office. Cryptography was routinely used at S-doc to develop several products, broadly aimed at the reliable and verifiable transmission of data and messages, centered around the idea of an "unalterable, encrypted audit log system".
Kleiman was also a regular contributor to cryptography and security mailing lists where discussions included technical aspects of cryptosystems and the politics of cryptography. Kleiman was a long-time member of the same Metzdowd Cryptography mailing list where Satoshi Nakamoto first announced Bitcoin on Oct. 31, 2008.
Kleiman held the following certifications:
Information Systems Security Management Professional (ISSMP), Information Systems Security Architecture Professional (ISSAP), Certified Information Systems Security Professional (CISSP), Certified Information Forensics Investigator (CIFI), Certified Information Security Manager (CISM), Certified Anti-Terrorism Specialist (CAS), Certified Computer Examiner (CCE), a Microsoft Certified Systems Engineer (MCSE).
For multiple years, Kleiman was awarded Microsoft MVP for Windows – Security.
Alleged
|
https://en.wikipedia.org/wiki/Desktop%20sharing
|
Desktop sharing is a common name for technologies and products that allow remote access and remote collaboration on a person's computer desktop through a graphical terminal emulator.
The most common two scenarios for desktop sharing are:
Remote login
Real-time collaboration
Remote log-in allows users to connect to their own desktop while being physically away from their computer. Systems that support the X Window System, typically Unix-based ones, have this ability "built in". Windows versions starting from Windows 2000 have a built-in solution for remote access as well in the form of Remote Desktop Protocol and prior to that in the form of Microsoft’s NetMeeting.
Virtual Network Computing (VNC) is a cross-platform solution accomplished through a common client/server model. The client, or VNC viewer, is installed on a local computer and then connects to the network via a server component, which is installed on a remote computer. In a typical VNC session, all keystrokes and mouse clicks are registered as if the client were actually performing tasks on the end-user machine.
The shortcoming of the above solutions are their inability to work outside of a single NAT environment. A number of commercial products overcome this restriction by tunneling the traffic through rendezvous servers.
Apple machines require Apple Remote Desktop (ARD).
Real-time collaboration is a bigger area of desktop sharing use and has gained momentum as an important component of rich multimedia communications.
Desktop sharing, when used in conjunction with other components of multimedia communications such as audio and video, offers people to meet and work together. On the larger scale, this area is also referred as web conferencing.
With a larger number of applications moving from desktop machines to cloud computing, newer forms of browser based instant screen sharing have developed such as Cobrowsing.
Comparison of notable desktop sharing software
See also
Comparison of remote desktop software
Collaborative real-time editor
Desktop virtualization
References
Collaboration
Remote desktop
|
https://en.wikipedia.org/wiki/Gadfly%20%28database%29
|
Gadfly is a relational database management system written in Python. Gadfly is a collection of Python modules that provides relational database functionality entirely implemented in Python. It supports a subset of the standard RDBMS Structured Query Language (SQL).
Gadfly runs wherever Python runs and supports client/server on any platform that supports the standard Python socket interface. The file formats used by Gadfly for storage are cross-platform—a gadfly database directory can be moved from Windows 95 to Linux using a binary copying mechanism and gadfly will read and run the database.
It supports persistent databases consisting of a collection of structured tables with indices, and a large subset of SQL for accessing and modifying those tables. It supports a log-based recovery protocol which allows committed operations of a database to be recovered even if the database was not shut down in a proper manner (i.e., in the event of a CPU or software crash, [but not in the event of a disk crash]). It also supports a TCP/IP Client/Server mode where remote clients can access a Gadfly database over a TCP/IP network (such as the Internet) subject to configurable security mechanisms.
Since Gadfly depends intimately on the kwParsing package it is distributed as part of the kwParsing package, under the same copyright.
Gadfly allows Python programs to store, retrieve and query tabular data without having to rely on any external database engine or package. It provides an in-memory relational database style engine for Python programs, complete with a notion of a "committed, recoverable transaction" and "aborts".
Usage
The main "gadfly" module attempts to faithfully adhere to Greg Stein's Python Database API, as discussed and certified by the Python DB-SIG.
Concurrent database updates are not supported. The "databases" are currently designed to be written/modified by one process in isolation. Multiple processes can access a Gadfly database when accesses are arbitrated by a TCP/IP Gadfly server process.
Creating a new database
Unlike most Python/database-engine interfaces Gadfly databases must be created using Python. To accomplish this programmers use:
import gadfly
connection = gadfly.gadfly()
with no arguments. Then they startup a database using the startup method:
connection.startup("mydatabase", "mydirectory")
Here "mydirectory" must be a directory which exists and which can be written to in order to store the database files. The startup creates some files in "mydirectory". This has the effect of clobbering any existing Gadfly database called "mydatabase" in the directory "mydirectory". Gadfly will not allow a start up the same connection twice, however.
The first "import gadfly" reads in and initializes some rather large data structures used for parsing SQL, and thus may take longer than other module imports.
Within the database the user can create tables, populate them, and commit the result when they are happy:
cursor = connection.curso
|
https://en.wikipedia.org/wiki/Vividata
|
Vividata is a Toronto-based not-for-profit research organization that provides impact and marketing data on print media readership in Canada.
Vividata resulted from a 2014 merger between the Print Measurement Bureau (PMB) and the Newspaper Audience Databank (NADbank). The merged company temporarily used the name Amalco. The non-profit PMB traced itself back to 1973, when it conducted its first national print survey. PMB conducted surveys to assess the level of readership for many magazines sold in Canada, and also conducts industry-specific surveys such as for medical profession publications. NADbank's work had significant overlap with PMB. Vividata also has a custom syndicated survey division known as Vivintel.
See also
Numeris, an analogous company covering Canadian broadcast media
References
External links
Vividata official website
1973 establishments in Ontario
Publishing in Canada
Market research companies of Canada
Business services companies established in 1973
|
https://en.wikipedia.org/wiki/Multisample%20anti-aliasing
|
Multisample anti-aliasing (MSAA) is a type of spatial anti-aliasing, a technique used in computer graphics to remove jaggies.
Definition
The term generally refers to a special case of supersampling. Initial implementations of full-scene anti-aliasing (FSAA) worked conceptually by simply rendering a scene at a higher resolution, and then downsampling to a lower-resolution output. Most modern GPUs are capable of this form of anti-aliasing, but it greatly taxes resources such as texture, bandwidth, and fillrate. (If a program is highly TCL-bound or CPU-bound, supersampling can be used without much performance hit.)
According to the OpenGL GL_ARB_multisample specification, "multisampling" refers to a specific optimization of supersampling. The specification dictates that the renderer evaluate the fragment program once per pixel, and only "truly" supersample the depth and stencil values. (This is not the same as supersampling but, by the OpenGL 1.5 specification, the definition had been updated to include fully supersampling implementations as well.)
In graphics literature in general, "multisampling" refers to any special case of supersampling where some components of the final image are not fully supersampled. The lists below refer specifically to the ARB_multisample definition.
Description
In supersample anti-aliasing, multiple locations are sampled within every pixel, and each of those samples is fully rendered and combined with the others to produce the pixel that is ultimately displayed. This is computationally expensive, because the entire rendering process must be repeated for each sample location. It is also inefficient, as aliasing is typically only noticed in some parts of the image, such as the edges, whereas supersampling is performed for every single pixel.
In multisample anti-aliasing, if any of the multi sample locations in a pixel is covered by the triangle being rendered, a shading computation must be performed for that triangle. However this calculation only needs to be performed once for the whole pixel regardless of how many sample positions are covered; the result of the shading calculation is simply applied to all of the relevant multi sample locations.
In the case where only one triangle covers every multi sample location within the pixel, only one shading computation is performed, and these pixels are little more expensive (and the result is no different) than in the non-anti-aliased image. This is true of the middle of triangles, where aliasing is not an issue. (Edge detection can reduce this further by explicitly limiting the MSAA calculation to pixels whose samples involve multiple triangles, or triangles at multiple depths.) In the extreme case where each of the multi sample locations is covered by a different triangle, a different shading computation will be performed for each location and the results then combined to give the final pixel, and the result and computational expense are the same as in the equivalent s
|
https://en.wikipedia.org/wiki/Glutamine%20%28data%20page%29
|
References
(Gln)
(D)
(L)
Chemical data pages
Chemical data pages cleanup
|
https://en.wikipedia.org/wiki/Split-radix%20FFT%20algorithm
|
The split-radix FFT is a fast Fourier transform (FFT) algorithm for computing the discrete Fourier transform (DFT), and was first described in an initially little-appreciated paper by R. Yavne (1968) and subsequently rediscovered simultaneously by various authors in 1984. (The name "split radix" was coined by two of these reinventors, P. Duhamel and H. Hollmann.) In particular, split radix is a variant of the Cooley–Tukey FFT algorithm that uses a blend of radices 2 and 4: it recursively expresses a DFT of length N in terms of one smaller DFT of length N/2 and two smaller DFTs of length N/4.
The split-radix FFT, along with its variations, long had the distinction of achieving the lowest published arithmetic operation count (total exact number of required real additions and multiplications) to compute a DFT of power-of-two sizes N. The arithmetic count of the original split-radix algorithm was improved upon in 2004 (with the initial gains made in unpublished work by J. Van Buskirk via hand optimization for N=64 ), but it turns out that one can still achieve the new lowest count by a modification of split radix (Johnson and Frigo, 2007). Although the number of arithmetic operations is not the sole factor (or even necessarily the dominant factor) in determining the time required to compute a DFT on a computer, the question of the minimum possible count is of longstanding theoretical interest. (No tight lower bound on the operation count has currently been proven.)
The split-radix algorithm can only be applied when N is a multiple of 4, but since it breaks a DFT into smaller DFTs it can be combined with any other FFT algorithm as desired.
Split-radix decomposition
Recall that the DFT is defined by the formula:
where is an integer ranging from to and denotes the primitive root of unity:
and thus: .
The split-radix algorithm works by expressing this summation in terms of three smaller summations. (Here, we give the "decimation in time" version of the split-radix FFT; the dual decimation in frequency version is essentially just the reverse of these steps.)
First, a summation over the even indices . Second, a summation over the odd indices broken into two pieces: and , according to whether the index is 1 or 3 modulo 4. Here, denotes an index that runs from 0 to . The resulting summations look like:
where we have used the fact that . These three sums correspond to portions of radix-2 (size N/2) and radix-4 (size N/4) Cooley–Tukey steps, respectively. (The underlying idea is that the even-index subtransform of radix-2 has no multiplicative factor in front of it, so it should be left as-is, while the odd-index subtransform of radix-2 benefits by combining a second recursive subdivision.)
These smaller summations are now exactly DFTs of length N/2 and N/4, which can be performed recursively and then recombined.
More specifically, let denote the result of the DFT of length N/2 (for ), and let and denote the results of the DFTs of
|
https://en.wikipedia.org/wiki/Transport%20in%20Sydney
|
Transport in Sydney is provided by an extensive network of public transport operating modes including metro, train, bus, ferry and light rail, as well as an expansive network of roadways, cycleways and airports. According to the 2006 census, in terms of travel to work or study Sydney has the highest rate of public transport usage among the Australian capital cities of 26.3% with more than 80% of weekday trips to/from Central Sydney being made by public transport. According to the New South Wales State Plan, the state has Australia's largest public transport system. The public transport network is regulated by Transport for NSW.
History
Sydney's early urban sprawl can be traced in part to the development of its passenger rail network as well as the availability of the automobile as the dominant mode of transport–a similar history has shaped the transport and infrastructure of most major Australian cities. The first rail services began in 1855, 67 years after the settlement's foundation and a tram network which began in 1861, becoming the Southern Hemisphere's largest by the 1920s. This rail infrastructure allowed working-class suburbs to develop at a large distance from the city centre. In terms of effectiveness and sustainability of public transport, Sydney lagged behind Brisbane and many other cities in a 2017 study by design firm Arcadis, where it was ranked at 51.
Ticketing
Transport for NSW public transport services use the Opal ticketing system. The rollout of this contactless system started in December 2012 and completed in December 2014. The previous generation of ticketing products were withdrawn in August 2016.
Fares are controlled by the Independent Pricing and Regulatory Tribunal of New South Wales. As of January 2009, Sydney public transport prices were slightly higher than in other mainland Australian cities.
Bus
Commuter bus services account for about half of the public transport journeys taken in the city on weekdays. Services are provided by private sector operators under contract to Transport for NSW.
The largest private bus operator is CDC NSW. Other significant players include Busways and Transit Systems
Bus services in the regions surrounding Sydney are considered part of the metropolitan network. Outer-metropolitan services are provided by the private sector under contract to Transport for NSW. Here, Busways, Hunter Valley Buses, Newcastle Transport and Premier Illawarra are significant players.
Network
Sydney's bus network has been divided into different regions. Of these regions, bus routes are classified with three-digit route numbers.
Currently, Sydney has two operating T-Ways:
The Liverpool-Parramatta T-way opened in 2003
The North-West T-way opened in 2007
Additional bus networks operate in the Outer Sydney region, which include:
Blue Mountains
Newcastle
Rail
Commuter Rail
Suburban rail services within Sydney are provided by Sydney Trains. Sydney's suburban commuter rail service consists of a complex s
|
https://en.wikipedia.org/wiki/Roud%20Folk%20Song%20Index
|
The Roud Folk Song Index is a database of around 250,000 references to nearly 25,000 songs collected from oral tradition in the English language from all over the world. It is compiled by Steve Roud. Roud's Index is a combination of the Broadside Index (printed sources before 1900) and a "field-recording index" compiled by Roud. It subsumes all the previous printed sources known to Francis James Child (the Child Ballads) and includes recordings from 1900 to 1975. Until early 2006, the index was available by a CD subscription; now it can be found online on the Vaughan Williams Memorial Library website, maintained by the English Folk Dance and Song Society (EFDSS). A partial list is also available at List of folk songs by Roud number.
Purpose of index
The primary function of the Roud Folk Song Index is as a research aid correlating versions of traditional English-language folk song lyrics independently documented over past centuries by many different collectors across (especially) the UK and North America. It is possible by searching the database, for example by title, by first line(s), or subject matter (or a combination of any of a dozen fields) to locate each of the often numerous variants of a particular song. Comprehensive details of those songs are then available, including details of the original collected source, and a reference to where to find the text (and possibly music) of the song within a published volume in the EFDSS archive.
A related index, the Roud Broadside Index, includes references to songs which appeared on broadsides and other cheap print publications, up to about 1920. In addition, there are many entries for music hall songs, pre-World War II radio performers' song folios, sheet music, etc. The index may be searched by title, first line etc. and the result includes details of the original imprint and where a copy may be located. The Roud number – "Roud num" – field may be used as a cross-reference to the Roud Folk Song Index itself in order to establish the traditional origin of the work.
The database is recognised as a "significant index" by the EFDSS and was one of the first items to be published on its web site after the launch of the online version of the Vaughan Williams Memorial Library in 2006.
Numbering scheme and cross references
The purpose of the index is to give each song a unique identifier. The numbers were assigned on a more or less arbitrary basis, and are not intended to carry any significance in themselves. However, because of the practicalities of compiling the index (building on previously published sources) it is true as a general rule that older and better-known songs tend to occupy low numbers, while songs which are obscure have higher numbers.
Closely related songs are grouped under the same Roud number.
If a trusted authority gives the name of a song but not the words, it is assigned Roud number 000.
The Index cross-references to the Child Ballad number, if one is available for the particula
|
https://en.wikipedia.org/wiki/Steambot%20Chronicles
|
Steambot Chronicles, known in Japan as is a 2005 action role-playing game developed and published by Irem Software Engineering in Japan for the PlayStation 2. It was later published by Atlus in North America and 505 Games in PAL regions. The game features a sandbox style of steam-powered, mech-based gameplay.
A sequel, Bumpy Trot 2, was announced and shown at the 2006 Tokyo Game Show, though it was officially cancelled in 2011. Two spin-off titles were also released: Steambot Chronicles: Battle Tournament for the PlayStation Portable and Blocks Club with Bumpy Trot, originally released for the PlayStation 2 and later ported to the PlayStation Portable.
Plot
Steambot Chronicles begins with a personality quiz, answers to these questions affecting the personality of the character and how others will react towards him. Afterwards, a young male named Vanilla awakes on the shore of Seagull Beach, a seemingly cheerful girl named Coriander (shortened Connie) beside him, and currently suffers from amnesia due to a shipwreck nearby that occurred before the events of the game. The player learns that Connie is picking herbs to use as medicine for her bed-ridden mother, Rosemary, who lives in Nefroburg. Vanilla spots a vehicle on a nearby cliff that shoots a bazooka, trapping the two in Seagull Beach.
Connie must get home to Nefroburg on the last bus, but cannot because of the fallen boulder blocking her path. They go to a nearby cottage that, the player finds out, holds bad memories for Connie, evidence of this being her in a picture with two unknown figures. The two stumble upon an old run-down Trotmobile resembling a bipedal automobile, which they use to leave Seagull Beach. Connie discovers that the bus already left minutes ago, and requests that Vanilla take her to Nefroburg.
On the trip, the two encounter a hoodlum from a gang known as the "Killer Elephants", who challenges Vanilla to a duel. After defeating him, the two encounter Marjoram, one of the members of the Garland Globetrotters (a band in which Connie is the lead singer). Vanilla will have to find Basil, another member of the band, and take him back to Marjoram and Connie.
The four later head back to Nefroburg. On the way, they encounter a humongous quadruped mechanical fortress (operated by the "Killer Elephants"), and Vanilla must destroy it before they officially head to Nefroburg, where they encounter yet another member, Fennel (who is suspected of firing the bazooka as Connie and Vanilla on the beach). After attending a concert at night, the player may choose to change the plot and Vanilla himself.
Characters
Vanilla R. Beans (Voiced by Spike Spencer in English) is the protagonist of the game. He awakes on a plank of wood in Seagull Beach, a shipwreck found nearby, and suffers from amnesia after the accident. After attending a concert in Nefroburg, the player may choose to make Vanilla a hero or villain, depending on the decisions chosen.
Coriander is the lead vocalist of the Garl
|
https://en.wikipedia.org/wiki/The%20Voice%20TV
|
The Voice TV is a network of music television channels owned by ProSiebenSat.1 Media (formally SBS Broadcasting Group). Previously broadcast in Finland (2004-2012), Denmark (2004-2012), Norway (2004-2012) and Sweden (2004-2008). In October 2006 the channel began broadcasting in Bulgaria.
See also
The Voice TV Bulgaria
The Voice TV Danmark
The Voice TV Finland
The Voice TV Norway
The Voice TV Sweden
References
External links
Corporate Website
The Voice TV Bulgaria
The Voice TV Denmark
The Voice TV Norway
The Voice TV Finland
Television channels in Finland
Music television channels in Bulgaria
|
https://en.wikipedia.org/wiki/Comparison%20of%20mobile%20phone%20standards
|
This is a comparison of standards of wireless networking technologies for devices such as mobile phones. A new generation of cellular standards has appeared approximately every tenth year since 1G systems were introduced in 1979 and the early to mid-1980s.
Issues
Global System for Mobile Communications (GSM, around 80–85% market share) and IS-95 (around 10–15% market share) were the two most prevalent 2G mobile communication technologies in 2007. In 3G, the most prevalent technology was UMTS with CDMA-2000 in close contention.
All radio access technologies have to solve the same problems: to divide the finite RF spectrum among multiple users as efficiently as possible. GSM uses TDMA and FDMA for user and cell separation. UMTS, IS-95 and CDMA-2000 use CDMA. WiMAX and LTE use OFDM.
Time-division multiple access (TDMA) provides multiuser access by chopping up the channel into sequential time slices. Each user of the channel takes turns to transmit and receive signals. In reality, only one person is actually using the channel at a specific moment. This is analogous to time-sharing on a large computer server.
Frequency-division multiple access (FDMA) provides multiuser access by separating the used frequencies. This is used in GSM to separate cells, which then use TDMA to separate users within the cell.
Code-division multiple access (CDMA) This uses a digital modulation called spread spectrum which spreads the voice data over a very wide channel in pseudorandom fashion using a user or cell specific pseudorandom code. The receiver undoes the randomization to collect the bits together and produce the original data. As the codes are pseudorandom and selected in such a way as to cause minimal interference to one another, multiple users can talk at the same time and multiple cells can share the same frequency. This causes an added signal noise forcing all users to use more power, which in exchange decreases cell range and battery life.
Orthogonal frequency-division multiple access (OFDMA) uses bundling of multiple small frequency bands that are orthogonal to one another to provide for separation of users. The users are multiplexed in the frequency domain by allocating specific sub-bands to individual users. This is often enhanced by also performing TDMA and changing the allocation periodically so that different users get different sub-bands at different times.
In theory, CDMA, TDMA and FDMA have exactly the same spectral efficiency but practically, each has its own challenges – power control in the case of CDMA, timing in the case of TDMA, and frequency generation/filtering in the case of FDMA.
For a classic example for understanding the fundamental difference of TDMA and CDMA, imagine a cocktail party where couples are talking to each other in a single room. The room represents the available bandwidth:
TDMA: A speaker takes turns talking to a listener. The speaker talks for a short time and then stops to let another couple talk. There is nev
|
https://en.wikipedia.org/wiki/Mac%20Pro
|
Mac Pro is a series of workstations and servers for professionals made by Apple Inc. since 2006. The Mac Pro, by some performance benchmarks, is the most powerful computer that Apple offers. It is one of four desktop computers in the current Mac lineup, sitting above the Mac Mini, iMac and Mac Studio.
Introduced in August 2006, the Mac Pro was an Intel-based replacement for the Power Mac line and had two dual-core Xeon Woodcrest processors and a rectangular tower case carried over from the Power Mac G5. It was updated on April 4, 2007, by a dual quad-core Xeon Clovertown model, then on January 8, 2008, by a dual quad-core Xeon Harpertown model. Revisions in 2010 and 2012 revisions had Nehalem/Westmere architecture Intel Xeon processors.
In December 2013, Apple released a new cylindrical Mac Pro (colloquially called the "trash can Mac Pro"). Apple said it offered twice the overall performance of the first generation while taking up less than one-eighth the volume. It had up to a 12-core Xeon E5 processor, dual AMD FirePro D series GPUs, PCIe-based flash storage and an HDMI port, but lacked PCIe expansion slots. Thunderbolt 2 ports brought updated wired connectivity and support for six Thunderbolt Displays. Reviews initially were generally positive, with caveats. Limitations of the cylindrical design prevented Apple from upgrading the cylindrical Mac Pro with more powerful hardware.
The 2019 Mac Pro returned to a tower form factor reminiscent of the first-generation model, but with larger air cooling holes. It has up to a 28-core Xeon-W processor, eight PCIe slots, AMD Radeon Pro Vega GPUs, and replaces most data ports with USB-C and Thunderbolt 3.
The 2023 Mac Pro carried over the design of the 2019 model and is based on the Apple M2 Ultra chip. It is the first model with an Apple silicon chip. Its introduction completed the Mac transition from Intel to Apple processors, first announced in June 2020 and started in November that year.
Tower (2006–2012)
Apple said that an Intel-based replacement for the 2003's PowerPC-based Power Mac G5 machines had been expected for some time before the Mac Pro was formally announced on August 7, 2006, at the annual Apple Worldwide Developers Conference (WWDC). In June 2005, Apple released the Developer Transition Kit, a prototype Intel Pentium 4–based Mac housed in a Power Mac G5 case, that was temporarily available to developers. The iMac, Mac Mini, MacBook, and MacBook Pro had moved to an Intel-based architecture starting in January 2006, leaving the Power Mac G5 as the only machine in the Mac lineup still based on the PowerPC processor architecture Apple had used since 1994. Apple had dropped the term "Power" from the other machines in their lineup and started using "Pro" on their higher-end laptop offerings. As such, the name "Mac Pro" was widely used before the machine was announced. The Mac Pro is in the Unix workstation market. Although the high-end technical market has not traditionally been an area
|
https://en.wikipedia.org/wiki/Heather%20Hiscox
|
Heather Hiscox (born 18 November 1965) is a Canadian news anchor who hosts CBC Morning Live with Heather Hiscox from 6 to 10 a.m. during weekdays on CBC News Network. She was also the host of the CBC's former flagship morning television program CBC News: Morning which became part of CBC News Now when the network re-branded itself in 2009.
Biography
Hiscox was born in Owen Sound, Ontario and grew up in a medical family. She graduated in 1986 from the University of Toronto, with a B.A. in French language and literature and from the University of Western Ontario in 1987 with a master's degree in journalism. She has previously worked for CFPL-TV, CBC Montreal, the Global Television Network, ASN and CHCH in Hamilton, Ontario, before returning to the CBC at the network level. She also co-hosted a morning show on 1290 CJBK in London, Ontario with Steve Garrison from 1990–1991. In 1988–89 she did a variety of radio shifts at London's Rock FM96 CFPL-FM including afternoon drive and evenings. She began her broadcasting career in her hometown of Owen Sound at radio station CFOS/CFPS. In 1997, she appeared on the CIQC AM 600 Montreal program Travel World as part of a feature headlined as "The Hidden Holiday Hide-away Haunts of Heather Hiscox".
Hiscox won the Miss Teen Canada pageant in 1981 when she was 16 years old. She is married to a heart surgeon, Martin Goldbach.
References
External links
CBC News Morning: Heather Hiscox, profile
CBC News Now with Heather Hiscox, her titular program
digitaljournal.com
pageantopolis.com
lfpress.com
1965 births
Canadian television news anchors
Living people
People from Owen Sound
University of Toronto alumni
University of Western Ontario alumni
CBC Television people
Canadian women television journalists
Canadian beauty pageant winners
20th-century Canadian journalists
21st-century Canadian journalists
20th-century Canadian women
Canadian Screen Award winning journalists
|
https://en.wikipedia.org/wiki/Physical%20address
|
In computing, a physical address (also real address, or binary address), is a memory address that is represented in the form of a binary number on the address bus circuitry in order to enable the data bus to access a particular storage cell of main memory, or a register of memory-mapped I/O device.
Use by central processing unit
In a computer supporting virtual memory, the term physical address is used mostly to differentiate from a virtual address. In particular, in computers utilizing a memory management unit (MMU) to translate memory addresses, the virtual and physical addresses refer to an address before and after translation performed by the MMU, respectively.
Unaligned addressing
Depending upon its underlying computer architecture, the performance of a computer may be hindered by unaligned access to memory. For example, a 16-bit computer with a 16-bit memory data bus, such as Intel 8086, generally has less overhead if the access is aligned to an even address. In that case fetching one 16-bit value requires a single memory read operation, a single transfer over a data bus.
If the 16-bit data value starts at an odd address, the processor may need to perform two memory read cycles to load the value into it, i.e. one for the low address (throwing away half of it) and then a second read cycle to load the high address (throwing away again half of the retrieved data). On some processors, such as the Motorola 68000 and Motorola 68010 processors, and SPARC processors, unaligned memory accesses will result in an exception being raised (usually resulting in a software exception, such as POSIX's SIGBUS, being raised).
Use by other devices
The direct memory access (DMA) feature allows other devices in the mother board besides the CPU to address the main memory. Such devices, therefore, also need to have a knowledge of physical addresses.
See also
Address constant
Addressing mode
Address space
Page address register
Pointer (computer programming)
Primary storage, also known as main memory
Virtual memory
Virtual address, also known as logical address
Page table
Memory management unit (MMU)
Gray code addressing
References
Computer memory
Virtual memory
Data types
|
https://en.wikipedia.org/wiki/Overground%20Network
|
Overground Network (abbreviated on or ON) was a branding initiative launched in 2003 by the Strategic Rail Authority (SRA) and Transport for London (TfL), the public transport authority in London, England. Its aim was to encourage use of National Rail services in South London. The project was a partnership between the SRA, TfL, three train operating companies (Connex South Eastern, South Central Trains and South West Trains), the South and West London Transport Conference (SWELTRAC) and the South East London Transport Strategy (SELTRANS). The scheme is no longer being promoted and the Overground Network project has since been abandoned.
Note that in common parlance within London, the term "overground" may be used in reference to any National Rail line, in order to distinguish it from the Underground.
Background
Suburban rail services in London, as in the rest of Great Britain, are run on a system of rail franchises and operated by a number of private train operating companies, managed by National Rail.
South London is poorly served by the London Underground network, but does have a large number of suburban rail lines. Transport studies had suggested that the public perceived the South London rail network as confusing, with multiple operators and a lack of consistent information design, in contrast to the clarity of London Underground's Tube map.
A pilot scheme was launched on 30 September 2003 to bring National Rail services operated by multiple companies at 41 stations under one branding umbrella within London.
Control of rail services
Unlike the today's London Overground, TfL exercised no operational or regulatory control over rail services on the Overground Network, but funded station improvements such as standardised information presentation, branded signage, CCTV and lighting. Operational powers remained with the individual train operators.
In 2004 TfL put forward proposals for a "London Regional Rail Authority" to be established, which would give TfL regulatory powers over rail services in and around Greater London. The Department for Transport considered that granting operational control of rail services to the London mayor would result in fragmentation of the National Rail system. Out of these proposals evolved a new mechanism for giving the London mayor more control over rail services within London, and London Overground was established as a National Rail franchise managed by TfL in 2007. This new system, mostly in North London, was the successor to the Overground Network pilot. ON was quietly forgotten and TfL now promotes LO as its rail service.
Ticketing
The Overground Network pilot was a branding exercise and did not include any new ticketing policies. When London Overground was launched, it was fully integrated into TfL's ticketing network from its launch, including full acceptance of the Oyster card electronic smartcard system. This ticketing policy was not extended to the former Overground Network, and for a number of years
|
https://en.wikipedia.org/wiki/Wrath%20of%20the%20Gods
|
Wrath of the Gods is a 1994 adventure-style computer game. It makes use of digitised backgrounds and sprites. The story is based on concepts and characters from Greek mythology. Billboard called it "a landmark effort in the realm of live-action games."
The game is played from the point of view of a young royal child who is prophesied to take his parents' kingdom. He is abandoned to the wolves on a mountainside, but is discovered by the centaur Chiron and raised by him. When the character is grown, Chiron gives the young man a ring that was found in his baby blankets and a few gems and then sends him out into the world.
The game is played from a two-dimensional perspective, and the player moves by clicking in the appropriate direction. Throughout the adventures, the player meets characters from Greek mythology. Billboard noted its "high quality visuals, seamless effects and wealth of interactive features".
The game also features an educational component where the player can view images of Greek art and learn about Greek mythology and history.
Reception
In April 1994 Computer Gaming World said that Wrath of the Gods offered "hours and hours of enjoyment" for fans of Ray Harryhausen's Jason and the Argonauts and others. The magazine stated that unlike other multimedia titles it "is interactive enough to play like a game, yet still retains a cinematic feel", with good acting, a "solid story line", and hints for those unfamiliar with Greek myth. Despite lacking fast travel, the magazine concluded that "Wrath of the Gods is a fun and educational adventure for both the seasoned and novice player. Luminaria has blended a fine mix of hip history, challenging game play, and quality presentation".
References
External links
Official website
1994 video games
Adventure games
Classic Mac OS games
Windows games
Video games with digitized sprites
Video games set in antiquity
Video games based on Greek mythology
Video games developed in the United States
Maxis games
|
https://en.wikipedia.org/wiki/XO%20Communications
|
XO Communications, LLC (previously Nextlink Communications, Concentric Network Corporation and Allegiance Telecom, Inc.) was an American telecommunications company. It was purchased and absorbed by Verizon Communications.
Services
XO provided managed and converged Internet Protocol (IP) network services for small and medium-sized enterprises. XO delivered services through a mix of fiber-based Ethernet and Ethernet over Copper (EoC). In addition, the company had external network-to-network interface (E-NNI) agreements with traditional carriers and cable companies.
Acquisition
In a news release dated February 22, 2016, Verizon announced plans to acquire XO Communications' "fiber-optic network business." In 2017, Verizon completed its $1.8 billion acquisition of XO Communications. As of summer 2020 all XO services have been migrated to Verizon.
References
Companies based in Fairfax County, Virginia
Telecommunications companies of the United States
Transit-free networks
Telecommunications companies established in 1996
American companies established in 1996
1996 establishments in Washington (state)
Herndon, Virginia
Verizon Communications acquisitions
2017 mergers and acquisitions
|
https://en.wikipedia.org/wiki/Demand%20optimization
|
Demand optimization is the application of processes and tools to maximize return on sales. This usually involves the application of mathematical modeling techniques using computer software.
It has particular applications in retail, where merchants wish to identify the best combination of price and promotion to achieve desired sales, gross margin, inventory or market share objectives.
The methods used are similar to those applied in the related field of supply chain optimization, where mathematical algorithms are applied to large databases of sales data to help predict future outcomes. In the case of demand optimization, as well as in house sales history, there may be competitive pricing information.
Because it is still a new field, authoritative data on the benefits of demand optimization is not widely available, although suppliers offer case studies of early adopters which claim rapid return on investment, especially in the optimization of the timing and level of price markdowns.
See also
Demand shortfall
Price
Profit maximization
Yield management
Price discrimination
References
Pricing
Mathematical optimization in business
|
https://en.wikipedia.org/wiki/Dorsal%20carpal%20arch
|
The dorsal carpal arch (dorsal carpal network, posterior carpal arch) is an anatomical term for the combination (anastomosis) of dorsal carpal branch of the radial artery and the dorsal carpal branch of the ulnar artery near the back of the wrist.
It is made up of the dorsal carpal branches of both the ulnar and radial arteries. It also anastomoses with the anterior interosseous artery and the posterior interosseous artery. The arch gives off three dorsal metacarpal arteries.
See also
Palmar carpal arch
Deep palmar arch
Superficial palmar arch
References
External links
Arteries of the upper limb
|
https://en.wikipedia.org/wiki/Console%20application
|
A console application or command-line program is a computer program (applications or utilities) designed to be used via a text-only user interface, such as a text terminal, the command-line interface of some operating systems (Unix, DOS, etc.) or the text-based interface included with most graphical user interface (GUI) operating systems, such as the Windows Console in Microsoft Windows, the Terminal in macOS, and xterm in Unix.
Overview
A user typically interacts with a console application using only a keyboard and display screen, as opposed to GUI applications, which normally require the use of a mouse or other pointing device. Many console applications such as command line interpreters are command line tools, but numerous text-based user interface (TUI) programs also exist.
As the speed and ease-of-use of GUIs applications have improved over time, the use of console applications has greatly diminished, but not disappeared. Some users simply prefer console based applications, while some organizations still rely on existing console applications to handle key data processing tasks.
The ability to create console applications is kept as a feature of modern programming environments such as Visual Studio and the .NET Framework on Microsoft Windows. It simplifies the learning process of a new programming language by removing the complexity of a graphical user interface (see an example in the C# article).
For data processing tasks and computer administration, these programming environments represent the next level of operating system or data processing control after scripting. If an application is only going to be run by the original programmer and/or a few colleagues, there may be no need for a pretty graphical user interface, leaving the application leaner, faster and easier to maintain.
Text User Interface
Libraries
Multiple libraries are available to assist with the development of Text User Interfaces.
On Unix systems, such libraries are ncurses and curses.
On Microsoft Windows, conio.h is an example of such library.
Examples
Console-based applications include Alpine (an e-mail client), cmus (an audio player), Irssi (an IRC client), Lynx (a web browser), Midnight Commander (a file manager), Music on Console (an audio player), Mutt (an e-mail client), nano (a text editor), ne (a text editor), newsbeuter (an RSS reader), and ranger (a file manager).
See also
Text-based (computing)
Box-drawing character
Shell (computing)
References
Further reading
Terminal emulators
User interfaces
Windows administration
MacOS administration
Unix software
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.