source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/PhpLDAPadmin | phpLDAPadmin is a web app for administering Lightweight Directory Access Protocol (LDAP) servers. It's written in the PHP programming language, and is licensed under the GNU General Public License. The application is available in 14 languages and supports UTF-8 encoded directory strings.
History
The project began in Fall of 2002 when Dave Smith, a student from Brigham Young University (BYU) and lead developer, needed a robust web application to manage his LDAP servers. Originally, phpLDAPadmin was called DaveDAP, but in August 2003, the name was changed to phpLDAPadmin. Since that time, the software has been downloaded approximately 150 times per day, and is commonly used throughout the world. Two other developers have contributed to the code base: Xavier Renard and Uwe Ebel. Xavier has focused on LDIF imports/exports and Samba software integration. Uwe has focused on internationalizing the application.
In Spring of 2005, Deon George took over maintenance of phpLDAPadmin.
Due to a long period starting from 2016, where no new pull requests have been merged into the master project, and no further releases were made, several forks exist, that implement new compatibilities and functionality. Since spring 2019 new development is going on and many pull requests were merged into the project restoring compatibility with recent PHP releases.
Distributions
The following Linux distributions include phpLDAPadmin in their official software repositories:
Ubuntu
Debian
Gentoo Linux
Arch Linux
It is available in the Extra Packages for Enterprise Linux (EPEL) repository, allowing managed installation to distributions such as Red Hat Enterprise Linux, Fedora, CentOS and Scientific Linux, and is included in the M23 software distribution system, which manages and distributes software for the Debian, Ubuntu, Kubuntu, Xubuntu, Linux Mint, Fedora, CentOS and openSUSE distributions.
It is also available in repositories for FreeBSD, OpenBSD, and Solaris.
References
External links
Free software programmed in PHP
Database administration tools
Products introduced in 2003
Directory services |
https://en.wikipedia.org/wiki/Cmp%20%28Unix%29 | In computing, cmp is a command-line utility on Unix and Unix-like operating systems that compares two files of any type and writes the results to the standard output. By default, cmp is silent if the files are the same; if they differ, the byte and line number at which the first difference occurred is reported. The command is also available in the OS-9 shell.
History
is part of the X/Open Portability Guide since issue 2 of 1987. It was inherited into the first version of POSIX.1 and the Single Unix Specification. It first appeared in Version 1 Unix.
The version of cmp bundled in GNU coreutils was written by Torbjorn Granlund and David MacKenzie.
The command is available as a separate package for Microsoft Windows as part of the UnxUtils collection of native Win32 ports of common GNU Unix-like utilities. The command has also been ported to the IBM i operating system.
Switches
cmp may be qualified by the use of command-line switches. The switches supported by notable implementations of cmp are:
Operands that are byte counts are normally decimal, but may be preceded by '0' for octal and '0x' for hexadecimal.
A byte count can be followed by a suffix to specify a multiple of that count; in this case an omitted integer is understood to be 1. A bare size letter, or one followed by 'iB', specifies a multiple using powers of 1024. A size letter followed by 'B' specifies powers of 1000 instead. For example, '-n 4M' and '-n 4MiB' are equivalent to '-n 4194304', whereas '-n 4MB' is equivalent to '-n 4000000'. This notation is upward compatible with the SI prefixes for decimal multiples and with the IEC 60027-2 prefixes for binary multiples.
Examples
Comparing
:020000040007F3
:10E00000840D80E501000000010000000100000017
:10E01000000000000000000070DE010062A726542E
with
:020000040007F3
:10E44400840D80E501000000010000000100000017
:10E01000000000000000000070DE010062A726542E
> cmp 0 00
0 00 differ: char 21, line 2
> cmp -l 0 00 # note: byte location is in decimal, contents is in octal
21 64 60
22 64 60
23 64 60
Return values
0 – files are identical
1 – files differ
2 – inaccessible or missing argument
See also
Comparison of file comparison tools
List of Unix commands
References
External links
Comparing and Merging Files: Invoking cmp The section of the manual of GNU cmp in the diffutils free manual.
Free file comparison tools
Standard Unix programs
Unix SUS2008 utilities
Plan 9 commands
Inferno (operating system) commands
IBM i Qshell commands |
https://en.wikipedia.org/wiki/E-Science | E-Science or eScience is computationally intensive science that is carried out in highly distributed network environments, or science that uses immense data sets that require grid computing; the term sometimes includes technologies that enable distributed collaboration, such as the Access Grid. The term was created by John Taylor, the Director General of the United Kingdom's Office of Science and Technology in 1999 and was used to describe a large funding initiative starting in November 2000. E-science has been more broadly interpreted since then, as "the application of computer technology to the undertaking of modern scientific investigation, including the preparation, experimentation, data collection, results dissemination, and long-term storage and accessibility of all materials generated through the scientific process. These may include data modeling and analysis, electronic/digitized laboratory notebooks, raw and fitted data sets, manuscript production and draft versions, pre-prints, and print and/or electronic publications." In 2014, IEEE eScience Conference Series condensed the definition to "eScience promotes innovation in collaborative, computationally- or data-intensive research across all disciplines, throughout the research lifecycle" in one of the working definitions used by the organizers. E-science encompasses "what is often referred to as big data [which] has revolutionized science... [such as] the Large Hadron Collider (LHC) at CERN... [that] generates around 780 terabytes per year... highly data intensive modern fields of science...that generate large amounts of E-science data include: computational biology, bioinformatics, genomics" and the human digital footprint for the social sciences.
Turing Award winner Jim Gray imagined "data-intensive science" or "e-science" as a "fourth paradigm" of science (empirical, theoretical, computational and now data-driven) and asserted that "everything about science is changing because of the impact of information technology" and the data deluge.
E-Science revolutionizes both fundamental legs of the scientific method: empirical research, especially through digital big data; and scientific theory, especially through computer simulation model building. These ideas were reflected by The White House's Office and Science Technology Policy in February 2013, which slated many of the aforementioned e-Science output products for preservation and access requirements under the memorandum's directive. E-sciences include particle physics, earth sciences and social simulations.
Characteristics and examples
Most of the research activities into e-Science have focused on the development of new computational tools and infrastructures to support scientific discovery. Due to the complexity of the software and the backend infrastructural requirements, e-Science projects usually involve large teams managed and developed by research laboratories, large universities or governments. Currently there is a large focu |
https://en.wikipedia.org/wiki/Robert%20Taylor%20%28computer%20scientist%29 | Robert William Taylor (February 10, 1932 – April 13, 2017), known as Bob Taylor, was an American Internet pioneer, who led teams that made major contributions to the personal computer, and other related technologies. He was director of ARPA's Information Processing Techniques Office from 1965 through 1969, founder and later manager of Xerox PARC's Computer Science Laboratory from 1970 through 1983, and founder and manager of Digital Equipment Corporation's Systems Research Center until 1996.
Uniquely, Taylor had no formal academic training or research experience in computer science; Severo Ornstein likened Taylor to a "concert pianist without fingers," a perception reaffirmed by historian Leslie Berlin: "Taylor could hear a faint melody in the distance, but he could not play it himself. He knew whether to move up or down the scale to approximate the sound, he could recognize when a note was wrong, but he needed someone else to make the music."
His awards include the National Medal of Technology and Innovation and the Draper Prize. Taylor was known for his high-level vision: "The Internet is not about technology; it's about communication. The Internet connects people who have shared interests, ideas and needs, regardless of geography."
Early life
Robert W. Taylor was born in Dallas, Texas, in 1932. His adoptive father, Rev. Raymond Taylor, was a Methodist minister who held degrees from Southern Methodist University, the University of Texas at Austin and Yale Divinity School. The family (including Taylor's adoptive mother, Audrey) was highly itinerant during Taylor's childhood, moving from parish to parish. Having skipped several grades as a result of his enrollment in an experimental school, he began his higher education at Southern Methodist University at the age of 16 in 1948; while there, he was "not a serious student" but "had a good time."
Taylor then served a stint in the United States Naval Reserve during the Korean War (1952–1954) at Naval Air Station Dallas before returning to his studies at the University of Texas at Austin under the GI Bill. At UT he was a "professional student," taking courses for pleasure. In 1957, he earned an undergraduate degree in experimental psychology from the institution with minors in mathematics, philosophy, English and religion.
He subsequently earned a master's degree in psychology from Texas in 1959 before electing not to pursue a PhD in the field. Reflecting his background in experimental psychology and mathematics, he completed research in neuroscience, psychoacoustics and the auditory nervous system as a graduate student. According to Taylor, "I had a teaching assistantship in the department, and they were urging me to get a PhD, but to get a PhD in psychology in those days, maybe still today, you have to qualify and take courses in abnormal psychology, social psychology, clinical psychology, child psychology, none of which I was interested in. Those are all sort of in the softer regions of psycho |
https://en.wikipedia.org/wiki/Absolute%20Radio%20Classic%20Rock | Absolute Classic Rock is a national digital radio station owned and operated by Bauer as part of the Absolute Radio Network. Its music output is non-stop classic rock hits.
Formerly known as Virgin Radio Classic Rock, it originally was an internet-only radio station, and launched in 2000 under the name Virgin Classic by Lee Roberts, SMG Radio Director. On DAB Digital Radio in London, the station launched at 12:15pm with Richard Skinner introducing Steppenwolf's "Born to Be Wild". The launch time, presenter, and song (though not the artist) were identical to its parent station Virgin Radio.
On 1 September 2008 it was announced that Virgin Radio Classic Rock would be rebranded as Absolute Classic Rock on 29 September 2008.
The station was removed from Freesat channel 725 on 8 December 2011 because of "economic realities".
DAB expansion
On 10 December 2010 Absolute Classic Rock expanded on DAB from London, taking over from Global Radio owned Gold on DAB in the North of England where there were 10 million potential new listeners on DAB in Newcastle, Sunderland, Darlington, Middlesbrough, Leeds, Hull, Scunthorpe, Grimsby, York, Huddersfield, Doncaster, Harrogate, Bradford, Sheffield, Blackburn, Preston, Blackpool, Bolton, Lancaster, Liverpool, Chester, Wrexham (North Wales) and Warrington
On 20 December 2010 Absolute Classic Rock launched on DAB to a potential new 3 million new listeners in Ayr, Bath, Cardiff, Coventry and Exeter.
In 2011 it was confirmed by Ofcom that to accommodate the launch of new sister station Absolute Radio 60s, the reduction of the broadcast bitrate of Absolute Classic Rock would be permitted on the various multiplexes on which it broadcasts.
On 16 October 2023, Absolute Radio Classic Rock began broadcasting nationally on DAB+, broadcasting in stereo.
West Midlands changes
On 7 January 2019, Bauer closed Free Radio 80s and replaced it with Greatest Hits Radio West Midlands. It launched the station on its 105.2 FM frequency which covers Birmingham and the Black Country and Bauer chose to allocate its AM frequencies which cover that area to Absolute Classic Rock. This was the first time that the station had been available on analogue radio. Transmissions on 990 and 1017 kHz ceased on 30 April 2020, with service remaining on 1152 kHz until 30 June 2020, when that was also ceased.
Notable former presenters
Former presenters include Richard Skinner, Tommy Vance, Alan Freeman, and Alice Cooper.
References
External links
Absolute Classic Rock's page on Last.fm, showing a listing of tracks played
See also
Bauer Media Group
Absolute Radio
Bauer Radio
Classic rock radio stations in the United Kingdom
Rock radio stations in the United Kingdom
Internet radio stations in the United Kingdom
Radio stations established in 2000
2000 establishments in the United Kingdom |
https://en.wikipedia.org/wiki/Out-of-order%20execution | In computer engineering, out-of-order execution (or more formally dynamic execution) is a paradigm used in most high-performance central processing units to make use of instruction cycles that would otherwise be wasted. In this paradigm, a processor executes instructions in an order governed by the availability of input data and execution units, rather than by their original order in a program. In doing so, the processor can avoid being idle while waiting for the preceding instruction to complete and can, in the meantime, process the next instructions that are able to run immediately and independently.
History
Out-of-order execution is a restricted form of data flow computation, which was a major research area in computer architecture in the 1970s and early 1980s.
Early use in supercomputers
The first machine to use out-of-order execution was the CDC 6600 (1964), designed by James E. Thornton, which uses a scoreboard to avoid conflicts. It permits an instruction to execute if its source operand (read) addresses aren't to be written to by any unexecuted earlier instruction (true dependency) and the destination (write) address not be an address used by any unexecuted earlier instruction (false dependency). The 6600 lacks the means to avoid stalling an execution unit on false dependencies (write after write (WAW) and write after read (WAR) conflicts, respectively termed first order conflict and third order conflict by Thornton, who termed true dependencies (read after write (RAW)) as second order conflict) because each address has only a single location referable by it. The WAW is worse than WAR for the 6600, because when an execution unit encounters a WAR, the other execution units still receive and execute instructions, but upon a WAW the assignment of instructions to execution units stops, and they can not receive any further instructions until the WAW-causing instruction's destination register has been written to by earlier instruction.
About two years later, the IBM System/360 Model 91 (1966) introduced register renaming with Tomasulo's algorithm, which dissolves false dependencies (WAW and WAR), making full out-of-order execution possible. An instruction addressing a write into a register rn can be executed before an earlier instruction using the register rn is executed, by actually writing into an alternative (renamed) register alt-rn, which is turned into a normal ("architectural") register rn only when all the earlier instructions addressing rn have been executed, but until then rn is given for earlier instructions and alt-rn for later ones addressing rn. In the Model 91 the register renaming is implemented by a bypass termed Common Data Bus (CDB) and memory source operand buffers, leaving the physical architectural registers unused for many cycles as the oldest state of registers addressed by any unexecuted instruction is found on the CDB. Another advantage the Model 91 has over the 6600 is the ability to execute out-of-order the inst |
https://en.wikipedia.org/wiki/AtheOS%20File%20System | The AtheOS file system (AFS) was originally used in the AtheOS operating system under MBR partition ID , and is now a part of the Syllable and the Syllable-based Wave OS operating system. AFS started with exactly the same data structures as the Be File System, BFS, and extended its feature set in many ways. As such, AFS is a 64-bit journaled file system with support for file attributes. File indexing and soft deletions are also partially supported.
References
Disk file systems |
https://en.wikipedia.org/wiki/Code%20page%20850 | Code page 850 (CCSID 850) (also known as CP 850, IBM 00850, OEM 850, DOS Latin 1) is a code page used under DOS and Psion's EPOC16 operating systems in Western Europe. Depending on the country setting and system configuration, code page 850 is the primary code page and default OEM code page in many countries, including various English-speaking locales (e.g. in the United Kingdom, Ireland, and Canada), whilst other English-speaking locales (like the United States) default to use the hardware code page 437.
Code page 850 differs from code page 437 in that many of the box-drawing characters, Greek letters, and various symbols were replaced with additional Latin letters with diacritics, thus greatly improving support for Western European languages (all characters from ISO 8859-1 are included). At the same time, the changes frequently caused display glitches with programs that made use of the box-drawing characters to display a GUI-like surface in text mode.
Systems largely replaced code page 850 with Windows-1252 which contains all same letters, and later with Unicode.
Character set
Each character appears with its equivalent Unicode code-point. Only the second half of the table (code points 128–255) is shown, the first half (code points 0–127) being the same as code page 437.
Code page 858
In 1998, code page 858 (CCSID 858) (also known as CP 858, IBM 00858, OEM 858) was derived from this code page by changing code point 213 (D5hex) from a dotless i to the euro sign . Unlike most code pages modified to support the euro sign, the generic currency sign at CFhex was not chosen as the character to replace (compare ISO-8859-15 (from ISO-8859-1), code pages 808 (from 866), 848 (from 1125), 849 (from 1131) and 872 (from 855), ISO-IR-205 (from ISO-8859-4), ISO-IR-206 (from ISO-8859-13), and the changes to MacRoman and MacCyrillic).
Instead of adding support for the new code page 858, IBM's PC DOS 2000, also released in 1998, changed the definition of the existing code page 850 to what IBM called modified code page 850 to include the euro sign at code point 213. The reason for this might have been due to restrictions in MS-DOS/PC DOS, which limited .CPI files to 64 KB in size or about six codepages maximum. Adding support for codepage 858 might have meant to drop another (e.g. codepage 850) at the same time, which might not have been a viable solution at that time, given that some applications were hard-wired to use codepage 850. More recent IBM/MS products implemented codepage 858 under its own ID.
Code page 1108
Code page 1108 (DITROFF Base Compatibility) is an extension of this codepage which alters some code points in the range 0–32 from their definitions in Code page 437.
DITROFF (device independent troff) is an intermediate
format of the standard Unix text formatter Troff.
Code page 1109
Code page 1109 (DITROFF Specials Compatibility) contains characters not available in Code page 1108.
Code page 1044
Code page 1044 (CCSID 1044) is a code page |
https://en.wikipedia.org/wiki/Gabor%20Herman | Gabor Tamas Herman is a Hungarian-American professor of computer science. He is Emiritas Professor of Computer Science at The Graduate Center, City University of New York (CUNY) where he was Distinguished Professor until 2017. He is known for his work on computerized tomography. He is a fellow of the Institute of Electrical and Electronics Engineers (IEEE).
Early life and education
Herman studied mathematics at the University of London, receiving his B.Sc. in 1963 and M.Sc. in 1964. In 1966, he received his M.S. in electrical engineering from the University of California, Berkeley, and in 1968 his Ph.D. in mathematics from the University of London.
Career
In 1969, Herman joined the department of computer science at Buffalo State College as an assistant professor. He became an associate professor in 1970 and a full professor in 1974. In 1976, he formed the Medical Image Processing Group. In 1980, he published the first edition of Reconstruction from Projections, his textbook on computerized tomography.
Herman moved the Medical Image Processing Group to the University of Pennsylvania in 1981. He was a professor in the radiology department from 1981 to 2000. In 1991, he was elected fellow of the IEEE. The citation reads: "For contributions to medical imagine, particularly in the theory and development of techniques for the reconstruction and display of computed tomographic images". In 1997, he was elected fellow of the American Institute for Medical and Biological Engineering. The citation reads: "For development implementation and evaluation of methods of reconstruction and 3D display of human organs based on transmitted or emitted radiation."
In 2001, Herman joined the faculty of CUNY as Distinguished Professor in the department of computer science, holding that position until his retirement in 2017. The second edition of his computerized tomography textbook, now titled Fundamentals of Computerized Tomography, was published in 2009.
Scientific Work
Together with Frank Natterer, he initiated in 1980 the series of conferences on "Mathematical Methods in Tomography“ at the Mathematical Research Institute of Oberwolfach, Germany.
During 1992-4 he was the Editor-in-Chief of the IEEE Transactions on Medical Imaging.
In recent years he has been involved with research on the superiorization methodology.
Awards and honors
1989 Honorary member – American Society of Neuroimaging
1991 Fellow - Institute of Electrical and Electronics Engineers
1996 Fellow – American Institute for Medical and Biological Engineering
2001 Hewlett Packard Visiting Research Professor, Mathematical Sciences Research Institute, Berkeley, California
Bibliography
His books include
3D Imaging in Medicine (CRC, 1991 and 2000),
Geometry of Digital Spaces (Birkhauser, 1998),
Discrete Tomography: Foundations, Algorithms and Applications (Birkhauser, 1999),
Advances in Discrete Tomography and Its Applications (Birkhauser, 2007),
Fundamentals of Computerized Tomography: Image |
https://en.wikipedia.org/wiki/Reference%20%28C%2B%2B%29 | In the C++ programming language, a reference is a simple reference datatype that is less powerful but safer than the pointer type inherited from C. The name C++ reference may cause confusion, as in computer science a reference is a general concept datatype, with pointers and C++ references being specific reference datatype implementations. The definition of a reference in C++ is such that it does not need to exist. It can be implemented as a new name for an existing object (similar to rename keyword in Ada).
Syntax and terminology
The declaration of the form:
<Type>& <Name>
where <Type> is a type and <Name> is an identifier is said to define an identifier whose type is lvalue reference to <Type>.
Examples:
int a = 5;
int& r_a = a;
extern int& r_b;
Here, r_a and r_b are of type "lvalue reference to int"
int& Foo();
Foo is a function that returns an "lvalue reference to int"
void Bar(int& r_p);
Bar is a function with a reference parameter, which is an "lvalue reference to int"
class MyClass { int& m_b; /* ... */ };
MyClass is a class with a member which is lvalue reference to int
int FuncX() { return 42 ; };
int (&f_func)() = FuncX;
FuncX is a function that returns a (non-reference type) int and f_func is an alias for FuncX
const int& ref = 65;
const int& ref is an lvalue reference to const int pointing to a piece of storage having value 65.
The declaration of the form:
<Type>&& <Name>
where <Type> is a type and <Name> is an identifier is said to define an identifier whose type is rvalue reference to <Type>.
Since the name of an rvalue reference is itself an lvalue, std::move must be used to pass an rvalue reference to a function overload accepting an rvalue reference parameter. Rvalue references to cv-unqualified type template parameters of that same function template or auto&& except when deduced from a brace-enclosed initializer list are called forwarding references (referred to as "universal references" in some older sources) and can act as lvalue or rvalue references depending on what is passed to them.
When found in function parameters, they are sometimes used with std::forward to forward the function argument to another function while preserving the value category (lvalue or rvalue) it had when passed to the calling function.
Types which are of kind "reference to <Type>" are sometimes called reference types. Identifiers which are of reference type are called reference variables. To call them variable, however, is in fact a misnomer, as we will see.
Arrays of references, pointers to references and references to references are not allowed., and will cause compilation errors (while and will not assuming they are initialized). References to void are also ill-formed. Declaring references as const or volatile() also fails unless a typedef/decltype is used in which case the const/volatile is ignored. However, if template argument deduction takes place and a reference type is deduced (which happens when forwarding refere |
https://en.wikipedia.org/wiki/Java%203D | Java 3D is a scene graph-based 3D application programming interface (API) for the Java platform. It runs on top of either OpenGL or Direct3D until version 1.6.0, which runs on top of Java OpenGL (JOGL). Since version 1.2, Java 3D has been developed under the Java Community Process. A Java 3D scene graph is a directed acyclic graph (DAG).
Compared to other solutions, Java 3D is not only a wrapper around these graphics APIs, but an interface that encapsulates the graphics programming using a true object-oriented approach. Here a scene is constructed using a scene graph that is a representation of the objects that have to be shown. This scene graph is structured as a tree containing several elements that are necessary to display the objects. Additionally, Java 3D offers extensive spatialized sound support.
Java 3D and its documentation are available for download separately. They are not part of the Java Development Kit (JDK).
History
Intel, Silicon Graphics, Apple, and Sun all had retained mode scene graph APIs under development in 1996. Since they all wanted to make a Java version, they decided to collaborate in making it. That project became Java 3D. Development was underway already in 1997. A public beta version was released in March 1998. The first version was released in December 1998. From mid-2003 through summer 2004, the development of Java 3D was discontinued. In the summer of 2004, Java 3D was released as a community source project, and Sun and volunteers have since been continuing its development.
On January 29, 2008, it was announced that improvements to Java 3D would be put on hold to produce a 3D scene graph for JavaFX JavaFX with 3D support was eventually released with Java 8. The JavaFX 3D graphics functionality has more or less come to supersede Java 3D.
Since February 28, 2008, the entire Java 3D source code is released under the GPL version 2 license with GPL linking exception.
Since February 10, 2012, Java 3D uses JOGL 2.0 for its hardware accelerated OpenGL rendering. The port was initiated by Julien Gouesse.
Features
Multithreaded scene graph structure
Cross-platform
Generic real-time API, usable for both visualization and gaming
Support for retained, compiled-retained, and immediate mode rendering
Includes hardware-accelerated JOGL, OpenGL, and Direct3D renderers (depending on platform)
Sophisticated virtual-reality-based view model with support for stereoscopic rendering and complex multi-display configurations
Native support for head-mounted display
CAVE (multiple screen projectors)
3D spatial sound
Programmable shaders, supporting both GLSL and CG
Stencil buffer
Importers for most mainstream formats, like 3DS, OBJ, VRML, X3D, NWN, and FLT
Competing technologies
Java 3D is not the only high-level API option to render 3D in Java. In part due to the pause in development during 2003 and 2004, several competing Java scene graph technologies emerged:
General purpose:
Ardor3D
JavaFX
Gaming:
jMonkeyEngine
Espresso3D
Vis |
https://en.wikipedia.org/wiki/Pspell | The purpose of Pspell (Portable Spell Checker Interface Library) was to provide a generic interface to the system spelling checking libraries. It was, and sometimes still is, used in computer programming such as C, and is licensed under the GNU Lesser General Public License.
Pspell has not been updated since 2001, but is still available on SourceForge at its project page. It has been replaced by GNU Aspell. PHP’s Pspell extension, while retaining its current name, now uses the Aspell library.
See also
GNU Aspell
Hunspell
Ispell
MySpell
Virastyar
External links
SourceForge.net Project Info
GNU Aspell SourceForge.net Project Info
Free spelling checking programs
Language software for Linux |
https://en.wikipedia.org/wiki/Meta%20key | The Meta key is a modifier key on certain keyboards. It first appeared on the Stanford Artificial Intelligence Lab (SAIL) keyboard in 1970.
History
The Meta key first appeared on the Stanford Artificial Intelligence Lab (SAIL) keyboard in 1970 and successors such as the Knight keyboard, space-cadet keyboard, MIT Lisp machine, Symbolics keyboards, and on Sun Microsystems keyboards (where it is marked with a black diamond "◆").
Use
Generally, the Meta key worked similar to Macintosh's Command key, in that when held down it modified letters and symbols into immediate commands (shortcuts). On these keyboards the Control key was placed closest to the space bar, then the Meta key outside Control. The space-cadet keyboard added the Super key outside Meta, and the Hyper key outside that. All these keys produced shortcuts (24 of them for every letter), but the Control ones were easiest to type and most popular, and the Meta ones second-easiest and thus second most popular. However, on most modern keyboards, the Control key is farthest from the space bar, reversing the convenience of shortcuts.
On keyboards that lack a physical Meta key, its functionality may be invoked by other keys such as the Windows key or Macintosh's Option key. However, software often provides another workaround, such as using the Alt key (which does not exist on the Knight keyboard), or using the Esc key as a prefix (e.g., in Emacs). Because of these workarounds, the need for Meta – despite being the most-used additional modifier key – was less than for other modifier keys. It is more common today to use the Windows key to emulate the Super key.
Gallery
See also
Modifier key
References
Computer keys |
https://en.wikipedia.org/wiki/La%20Premi%C3%A8re%20%28French%20TV%20network%29 | La Première is a French network of radio and television stations operating in France's overseas departments and collectivities around the world.
History
The service was first established in 1954 as the Radiodiffusion de la France Outre-Mer (RFOM). It was renamed a year later as the Société de radiodiffusion de la France d'outre-mer (SORAFOM).
This was replaced in 1964, following the creation of the Office de Radiodiffusion Télévision Française, by the Office de coopération radiophonique (OCORA).
In August 1974, OCORA became a part of the reformulated FR3: a network of regional television stations in mainland France. FR3's overseas operations were known as FR3 DOM-TOM and, unlike the arrangement in metropolitan France, were in charge of both television and radio.
In December 1982, France's overseas broadcasting operations were removed from FR3 and invested in the current organization, the Société de Radiodiffusion et de télévision Française pour l'Outre-mer (RFO).
In July 2004, Réseau France Outre-mer (RFO) was reunited with the French mainland's public broadcasters when it was merged into the France Télévisions network.
On 30 November 2010, Réseau France Outre-mer was renamed Réseau Outre-Mer 1ère.
Network services
Radio and television
La Première network manages nine generalist television channels and nine radio stations, broadcast in the eleven regions, departments or communities of Overseas France. They bear the name of "Pays" La Première, where "Country" is replaced by the name of the department or territory. The group also owns the former national television channel France Ô and the national radio station, Radio Outre-mer La Première (formerly Radio Ô).
La Première radio is available only in overseas territories/departments and on the Internet via the website la1ere.fr. The content changes depending on what radio station you're listening to online or depending on where you live in the overseas territories/departments just like France 3 does with the regional news bulletins such as 12/13, Soir 3 or other regional shows. It also offers free streaming online for radio and TV. The television broadcast on the website is only for those who live in the overseas territories/departments.
Note that the territory of French Southern and Antarctic Lands (TAAF) does not have a dedicated station as the population is transient and non-indigenous. Broadcasts, stories and breaking news concerning TAAF would be handled by Réunion La Première as they arise as oversight of TAAF is headquartered in the Réunionnaise commune of Saint Pierre. The other territory without a station, Clipperton Island, also has no permanent population and is actually private property of the French government.
External links
Television stations in France
Radio stations in France
France Télévisions
1954 establishments in France
Television channels and stations established in 1954 |
https://en.wikipedia.org/wiki/RFO | RFO may refer to:
RF Online, a multiplayer online role-playing computer game
Radio Frequency Overlay, analogue Cable TV over a GPON optical network
Réseau France Outre-mer, a network of radio and television stations operating in French overseas departments and territories
Range Forest Officer, similar to a forest ranger in the U.S.
Forest Range Officer, similar title in India
Read For Ownership, an operation in computer cache coherency protocols
Republicans for Obama
Request for offer
Residual fuel oil, a heavy product from oil refineries
Reason For Outage, a term related to network outage in system administration
Restrictive flow orifice, a tool to limit the danger of uncontrolled flow, for example, in a compressed gas cylinder
Robert-Falcon Ouellette (born 1979), Canadian politician |
https://en.wikipedia.org/wiki/S%20transform | S transform as a time–frequency distribution was developed in 1994 for analyzing geophysics data. In this way, the S transform is a generalization of the short-time Fourier transform (STFT), extending the continuous wavelet transform and overcoming some of its disadvantages. For one, modulation sinusoids are fixed with respect to the time axis; this localizes the scalable Gaussian window dilations and translations in S transform. Moreover, the S transform doesn't have a cross-term problem and yields a better signal clarity than Gabor transform. However, the S transform has its own disadvantages: the clarity is worse than Wigner distribution function and Cohen's class distribution function.
A fast S transform algorithm was invented in 2010. It reduces the computational complexity from O[N2·log(N)] to O[N·log(N)] and makes the transform one-to-one, where the transform has the same number of points as the source signal or image, compared to storage complexity of N2 for the original formulation. An implementation is available to the research community under an open source license.
A general formulation of the S transform makes clear the relationship to other time frequency transforms such as the Fourier, short time Fourier, and wavelet transforms.
Definition
There are several ways to represent the idea of the S transform. In here, S transform is derived as the phase correction of the continuous wavelet transform with window being the Gaussian function.
S-Transform
Inverse S-Transform
Modified form
Spectrum Form
The above definition implies that the s-transform function can be express as the convolution of and .
Applying the Fourier transform to both and gives
.
Discrete-time S-transform
From the spectrum form of S-transform, we can derive the discrete-time S-transform.
Let , where is the sampling interval and is the sampling frequency.
The Discrete time S-transform can then be expressed as:
Implementation of discrete-time S-transform
Below is the Pseudo code of the implementation.
Step1.Compute
loop over m (voices)
Step2.Compute for
Step3.Move to
Step4.Multiply Step2 and Step3
Step5.IDFT().
Repeat.}
Comparison with other time–frequency analysis tools
Comparison with Gabor transform
The only difference between the Gabor transform (GT) and the S transform is the window size. For GT, the windows size is a Gaussian function , meanwhile, the window function for S-Transform is a function of f. With a window function proportional to frequency, S Transform performs well in frequency domain analysis when the input frequency is low. When the input frequency is high, S-Transform has a better clarity in the time domain. As table below.
This kind of property makes S-Transform a powerful tool to analyze sound because human is sensitive to low frequency part in a sound signal.
Comparison with Wigner transform
The main problem with the Wigner Transform is the cross term, which stems from the auto-correlation |
https://en.wikipedia.org/wiki/Chicago%20%28typeface%29 | Chicago is a sans-serif typeface designed by Susan Kare for Apple Computer. It was used in the Macintosh operating system user interface between 1984 and 1997 and was an important part of Apple’s brand identity. It is also used in early versions of the iPod user interface. Chicago was initially a bitmap font; as the Apple OS’s capabilities improved, Apple commissioned the type foundry Bigelow & Holmes to create a vector-based TrueType version. The typeface is named after the U.S. city of Chicago, following the theme of original Macintosh fonts being named after major world cities.
Susan Kare has stated that Chicago was the first font to be developed for the Macintosh. Before the team settled on the convention of naming fonts after "world cities", it was called Elefont (Elefont is also the name of a bold semi-serif typeface designed by Bob McGrath in 1978). The first bitmap version included only a 12 pt. version. This font, with only very minor changes to spacing, was used for menus, dialogs, window titles, and text labels, through version 7.6 of the system. The TrueType version had many differences from the bitmap version, which became more apparent at greater sizes. One of Chicago's features was that it could remain legible while being made "grey" (to indicate a disabled menu item) by the removal of every other pixel (since actual grey type was not supported by the original Macintosh graphics hardware). The zero was slashed to distinguish it from capital "O".
In Mac OS 8, Charcoal replaced Chicago as the default system font. Chicago continued to be distributed as a standard component of the system, and Apple even urged developers to keep designing user interfaces for the Chicago typeface, since the new alternate fonts used the Chicago metrics as a foundation.
German-language versions of the Mac OS, as well as all language versions of Mac OS 9, had a different rendering of the 12-point version of Chicago. The letter W had two dips instead of one at the bottom of the letter, the letter V had its lower tip at the centre instead of veering left, and the letter I (capital "i") had serifs at the top and bottom, distinguishing it from l (lowercase "L"). A mix of this and the original Chicago was used in the original iPod.
Chicago was also used in Apple marketing materials. It was common to find this font in early amateur desktop publishing productions, since it was available as part of the system. While Apple gravitated away from Chicago following the adoption of the relatively easier-to-read Charcoal as part of the platinum theme in Mac OS, it was later revived in the user interface for the iPod music player, where legibility on a low resolution two-color screen once again became an asset. With the introduction of the iPod mini, a smaller typeface was needed, and the Espy Sans font from the Apple Newton was used. Finally, with the introduction of the iPod Photo, the color iPod interface changed to Podium Sans—a bitmap font similar to the Myriad P |
https://en.wikipedia.org/wiki/Ada%20%28computer%20virus%29 | Ada is a computer virus that can affect any of the DOS operating systems. Ada was first discovered in 1991.
History
Ada virus was first discovered in Argentina in .
Characteristics
Ada is a memory resident virus that infects files. The Ada virus mainly targets .COM files, specifically COMMAND.COM and stays in the memory of the computer it infects after the program it infected executes.
Infected programs have 2,600 bytes additional data inserted at the beginning of the file, and the file itself contains the text strings:
COMMAND.COM
PCCILLIN.COM
PCCILLIN.IMG
HATI-HATI !! ADA VIRUS DISINI !!Delete
Another version of Ada has these text strings along with the strings BASURA BASURA repeated numerous times.
Computers infected with the Ada virus often have a slow clicking sound emitting from their speakers; this clicking may sometimes change in pitch. Infected computers may show a "Disk Full" error even if the disk still has space on it.
While infected with the Ada virus, system memory measured by the DOS CHKDSK decreases by 21,296 bytes to 21,312 bytes. The virus resides in the memory after an infected file is run and will infect any other .COM files executed on the computer. It also hijacks interrupts 08, 13 and 21.
Infection route
There is only one way to infect a computer with the Ada virus; by executing an infected file. The infected file may come from a variety of sources: floppy disks, files downloaded from the Internet, and infected networks.
References
DOS file viruses |
https://en.wikipedia.org/wiki/Netfilter | Netfilter is a framework provided by the Linux kernel that allows various networking-related operations to be implemented in the form of customized handlers. Netfilter offers various functions and operations for packet filtering, network address translation, and port translation, which provide the functionality required for directing packets through a network and prohibiting packets from reaching sensitive locations within a network.
Netfilter represents a set of hooks inside the Linux kernel, allowing specific kernel modules to register callback functions with the kernel's networking stack. Those functions, usually applied to the traffic in the form of filtering and modification rules, are called for every packet that traverses the respective hook within the networking stack.
History
Rusty Russell started the netfilter/iptables project in 1998; he had also authored the project's predecessor, ipchains. As the project grew, he founded the Netfilter Core Team (or simply coreteam) in 1999. The software they produced (called netfilter hereafter) uses the GNU General Public License (GPL) license, and in March 2000 it was merged into version 2.4.x of the Linux kernel mainline.
In August 2003 Harald Welte became chairman of the coreteam. In April 2004, following a crack-down by the project on those distributing the project's software embedded in routers without complying with the GPL, a German court granted Welte an historic injunction against Sitecom Germany, which refused to follow the GPL's terms (see GPL-related disputes). In September 2007 Patrick McHardy, who led development for past years, was elected as new chairman of the coreteam.
Prior to iptables, the predominant software packages for creating Linux firewalls were ipchains in Linux kernel 2.2.x and ipfwadm in Linux kernel 2.0.x, which in turn was based on BSD's ipfw. Both ipchains and ipfwadm alter the networking code so they can manipulate packets, as Linux kernel lacked a general packets control framework until the introduction of Netfilter.
Whereas ipchains and ipfwadm combine packet filtering and NAT (particularly three specific kinds of NAT, called masquerading, port forwarding, and redirection), Netfilter separates packet operations into multiple parts, described below. Each connects to the Netfilter hooks at different points to access packets. The connection tracking and NAT subsystems are more general and more powerful than the rudimentary versions within ipchains and ipfwadm.
In 2017 IPv4 and IPv6 flow offload infrastructure was added, allowing a speedup of software flow table forwarding and hardware offload support.
Userspace utility programs
iptables
The kernel modules named ip_tables, ip6_tables, arp_tables (the underscore is part of the name), and ebtables comprise the legacy packet filtering portion of the Netfilter hook system. They provide a table-based system for defining firewall rules that can filter or transform packets. The tables can be administered through th |
https://en.wikipedia.org/wiki/Telecommunications%20Management%20Network | The Telecommunications Management Network is a protocol model defined by ITU-T for managing open systems in a communications network. It is part of the ITU-T Recommendation series M.3000 and is based on the OSI management specifications in ITU-T Recommendation series X.700.
TMN provides a framework for achieving interconnectivity and communication across heterogeneous operations system and telecommunication networks. To achieve this, TMN defines a set of interface points for elements which perform the actual communications processing (such as a call processing switch) to be accessed by elements, such as management workstations, to monitor and control them. The standard interface allows elements from different manufacturers to be incorporated into a network under a single management control.
For communication between Operations Systems and NEs (Network Elements), it uses the Common management information protocol (CMIP) or Mediation devices when it uses Q3 interface.
The TMN layered organization is used as fundamental basis for the management software of ISDN, B-ISDN, ATM, SDH/SONET and GSM networks. It is not as commonly used for purely packet-switched data networks.
Modern telecom networks offer automated management functions and are run by operations support system (OSS) software. These manage modern telecom networks and provide the data that is needed in the day-to-day running of a telecom network. OSS software is also responsible for issuing commands to the network infrastructure to activate new service offerings, commence services for new customers, and detect and correct network faults.
Architecture
According to ITU-T M.3010 TMN has 3 architectures:
Physical architecture
Security architecture
Logical layered architecture
Logical layers
The framework identifies four logical layers of network management:
Business management Includes the functions related to business aspects, analyzes trends and quality issues, for example, or to provide a basis for billing and other financial reports.
Service management Handles services in the network: definition, administration and charging of services.
Network management Distributes network resources, performs tasks of: configuration, control and supervision of the network.
Element management Handles individual network elements including alarm management, handling of information, backup, logging, and maintenance of hardware and software.
A network element provides agent services, mapping the physical aspects of the equipment into the TMN framework.
Recommendations
The TMN M.3000 series includes the following recommendations:
M.3000 Tutorial Introduction to TMN
M.3010 Principles for a TMN
M.3020 TMN Interface Specification Methodology
M.3050 Business Process Framework (eTOM)
M.3060 Principles for the Management of the Next Generation Networks
M.3100 Generic Network Information Model for TMN
M.3200 TMN Management Services Overview
M.3300 TMN Management Capabilities at the |
https://en.wikipedia.org/wiki/Standesamt%20Tremessen | Standesamt Tremessen was a civil registration district (Standesamt) located in Kreis Mogilno, province of Posen of the German Empire (1871-1918) and administered the communities of:
Population data may be inaccurate (see German census of 1895).
External links
This article is part of the project Wikipedia:WikiProject Prussian Standesamter. Please refer to the project page, before making changes.
Civil registration offices in the Province of Posen |
https://en.wikipedia.org/wiki/Java%20Heterogeneous%20Distributed%20Computing | Java Heterogeneous Distributed Computing refers to a programmable Java distributed system which was developed at the National University of Ireland in Maynooth. It allows researchers to access the spare clock cycles of a large number of semi-idle desktop PCs. It also allows for multiple problems to be processed in parallel with sophisticated scheduling mechanisms controlling the system. It has been successful when used for tackling problems in the areas of Bioinformatics, Biomedical engineering and cryptography.
It is an Open Source project licensed under the GPL.
See also
List of volunteer computing projects
Distributed computing
Java
External links
Heterogeneous Java Distributed Computing
Distributed computing projects |
https://en.wikipedia.org/wiki/Capstone%20Software | Capstone Software was a subsidiary of IntraCorp, a Miami-based computer and video game company. Founded in 1984, Capstone created first-person games such as Corridor 7: Alien Invasion, Operation Body Count, William Shatner's TekWar and Witchaven, and is also known for releasing games based on movie/TV licenses. Capstone's first-person games used the Wolfenstein 3D engine, and later, the Build engine.
IntraCorp went bankrupt in 1996 and shut down all its operations, including Capstone Software. Capstone's last game, Corridor 8: Galactic Wars, never left the prototype stage and was never released. Capstone became VRTech, providing first-person buildouts of new construction condominiums using the Build engine. It eventually closed down.
Games
The following is a list of games developed and/or published by Capstone Software as well its parent company Intracorp.
Intracorp
Capstone Software
Published
Distributed
Eternam
Pinball Arcade
Superman: The Man of Steel
Trolls
Cancelled
References
External links
Capstone Software
Video game publishers
Video game companies established in 1984
Video game companies disestablished in 1996
Video game development companies
Defunct video game companies of the United States
Companies based in Miami
Defunct companies based in Florida |
https://en.wikipedia.org/wiki/.arpa | The domain name arpa is a top-level domain (TLD) in the Domain Name System (DNS) of the Internet. It is used predominantly for the management of technical network infrastructure. Prominent among such functions are the subdomains in-addr.arpa and ip6.arpa, which provide namespaces for reverse DNS lookup of IPv4 and IPv6 addresses, respectively.
The name originally was the acronym for the Advanced Research Projects Agency (ARPA), the funding organization in the United States that developed the ARPANET, the precursor of the Internet. It was the first domain defined for the network in preparation for a hierarchical naming system for the delegation of authority, autonomy, and responsibility. It was originally intended only to serve in a temporary function for facilitating the systematic naming of the ARPANET computers. However, it became practically difficult to remove the domain after infrastructural uses had been sanctioned. As a result, the name was redefined as the backronym Address and Routing Parameter Area.
Domain-name registrations in arpa are not possible, and new subdomains are infrequently added by the Internet Engineering Task Force.
Purpose
Each computer using the Internet Protocol is identified by a numerical IP address for identification and location addressing. Each host is also assigned a more memorable hostname, which often relates to the purpose or ownership of the host, and is used more conveniently in user interaction with network functions, such as when connecting to or accessing a resource. Originally, the mapping between names and addresses was a cumbersome mechanical process using lookup tables distributed as computer files between network administrators. The Domain Name System (DNS) solved this inefficiency by automating the lookup function with a hierarchical naming system using domain names. When a user requests a network service using a domain name, the protocol implementation (protocol stack) translates the name to an address that can be used to reach a remote host.
This naming function, often called forward resolution, was the original purpose of the top-level domain "ARPA". It was the first domain defined in the first naming system of the nascent Internet, and was supposed to be an initial container domain for all then-existing ARPANET hosts. The next stage of development of the naming architecture foresaw the establishment of specific domains for other purposes based on certain requirements.
Reverse IP address mapping
In many applications the reverse of the name-to-address mapping is also required. The host receiving a service request may require the domain name of the originating computer, for example, to customize the service, or for verification purposes. This latter function, called Reverse DNS lookup, is implemented in the major uses of the domain arpa: its subdomains in-addr.arpa for Internet Protocol version 4, and ip6.arpa for IPv6.
Conceptually similar lookup and mapping functionality is provided by othe |
https://en.wikipedia.org/wiki/Expressways%20of%20China | The expressway network of China, with the national-level expressway system officially known as the National Trunk Highway System (; abbreviated as NTHS), is an integrated system of national and provincial-level expressways in China.
With the construction of the Shenyang–Dalian Expressway beginning between the cities of Shenyang and Dalian on 7 June 1984, the Chinese government started to take an interest in a national expressway system. The first modern at-grade China National Highways is the Shanghai–Jiading Expressway, opened in October 1988. The early 1990s saw the start of the country's massive plan to upgrade its network of roads. On 13 January 2005, Zhang Chunxian, China's Minister of Transport introduced the 7918 network, later renamed the 71118 network, composed of a grid of 7 radial expressways from Beijing, 9 north–south expressways (increased to 11), and 18 east–west expressways that would form the backbone of the national expressway system.
By the end of 2020, the total length of China's expressway network reached , the world's largest expressway system by length, having surpassed the overall length of the American Interstate Highway System in 2011. Note, it is not longer than the entire federal US numbered highway system which is 259,032 kilometers long and American State Highways both of which includes many roads that are up to the expressway standards (but also some that are not). Planned length of China's National Trunk Highway System is by 2020. Many of the major expressways parallel routes of the older China National Highways.
History
Origins
Prior to the 1980s, freight and passenger transport activities were predominantly achieved by rail transport rather than by road. The 1980s and 1990s saw a growing trend toward roads as a method of transportation and a shift away from rail transport. In 1978, rail transport accounted for 54.4 percent of the total freight movement in China, while road transport only accounted for 2.8 per cent. By 1997, road transport's share of freight movement had increased to 13.8 percent while the railway's share decreased to 34.3 percent. Similarly, road's share of passenger transport increased from 29.9% to 53.3% within the same time period, with railway's share decreasing from 62.7 percent to 35.4 percent. The shift from rail to road can be attributed to the rapid development of the expressway network in China.
Expressways were not present in China until 1988. On 7 June 1984, China's expressway ambitions began when construction of the Shenyang–Dalian Expressway began between the cities of Shenyang and Dalian. Due to policy restrictions, the expressway was nominally implemented on the first-grade automobile special highway standard in the initial stage of construction, thus making the highway technically not an expressway. Despite this, in October 1988, four years later, two full-speed, fully enclosed, controlled-accessed expressway sections from Shenyang to Anshan and Dalian to Sanshilipu total |
https://en.wikipedia.org/wiki/Needleman%E2%80%93Wunsch%20algorithm | The Needleman–Wunsch algorithm is an algorithm used in bioinformatics to align protein or nucleotide sequences. It was one of the first applications of dynamic programming to compare biological sequences. The algorithm was developed by Saul B. Needleman and Christian D. Wunsch and published in 1970. The algorithm essentially divides a large problem (e.g. the full sequence) into a series of smaller problems, and it uses the solutions to the smaller problems to find an optimal solution to the larger problem. It is also sometimes referred to as the optimal matching algorithm and the global alignment technique. The Needleman–Wunsch algorithm is still widely used for optimal global alignment, particularly when the quality of the global alignment is of the utmost importance. The algorithm assigns a score to every possible alignment, and the purpose of the algorithm is to find all possible alignments having the highest score.
Introduction
This algorithm can be used for any two strings. This guide will use two small DNA sequences as examples as shown in Figure 1:
GCATGCG
GATTACA
Constructing the grid
First construct a grid such as one shown in Figure 1 above. Start the first string in the top of the third column and start the other string at the start of the third row. Fill out the rest of the column and row headers as in Figure 1. There should be no numbers in the grid yet.
Choosing a scoring system
Next, decide how to score each individual pair of letters. Using the example above, one possible alignment candidate might be:
The letters may match, mismatch, or be matched to a gap (a deletion or insertion (indel)):
Match: The two letters at the current index are the same.
Mismatch: The two letters at the current index are different.
Indel (Insertion or Deletion): The best alignment involves one letter aligning to a gap in the other string.
Each of these scenarios is assigned a score and the sum of the scores of all the pairings is the score of the whole alignment candidate. Different systems exist for assigning scores; some have been outlined in the Scoring systems section below. For now, the system used by Needleman and Wunsch will be used:
Match: +1
Mismatch or Indel: −1
For the Example above, the score of the alignment would be 0:
+−++−−+− −> 1*4 + (−1)*4 = 0
Filling in the table
Start with a zero in the second row, second column. Move through the cells row by row, calculating the score for each cell. The score is calculated by comparing the scores of the cells neighboring to the left, top or top-left (diagonal) of the cell and adding the appropriate score for match, mismatch or indel. Calculate the candidate scores for each of the three possibilities:
The path from the top or left cell represents an indel pairing, so take the scores of the left and the top cell, and add the score for indel to each of them.
The diagonal path represents a match/mismatch, so take the score of the top-left diagonal cell and add the score for match if |
https://en.wikipedia.org/wiki/Gap%20penalty | A Gap penalty is a method of scoring alignments of two or more sequences. When aligning sequences, introducing gaps in the sequences can allow an alignment algorithm to match more terms than a gap-less alignment can. However, minimizing gaps in an alignment is important to create a useful alignment. Too many gaps can cause an alignment to become meaningless. Gap penalties are used to adjust alignment scores based on the number and length of gaps. The five main types of gap penalties are constant, linear, affine, convex, and profile-based.
Applications
Genetic sequence alignment - In bioinformatics, gaps are used to account for genetic mutations occurring from insertions or deletions in the sequence, sometimes referred to as indels. Insertions or deletions can occur due to single mutations, unbalanced crossover in meiosis, slipped strand mispairing, and chromosomal translocation. The notion of a gap in an alignment is important in many biological applications, since the insertions or deletions comprise an entire sub-sequence and often occur from a single mutational event. Furthermore, single mutational events can create gaps of different sizes. Therefore, when scoring, the gaps need to be scored as a whole when aligning two sequences of DNA. Considering multiple gaps in a sequence as a larger single gap will reduce the assignment of a high cost to the mutations. For instance, two protein sequences may be relatively similar but differ at certain intervals as one protein may have a different subunit compared to the other. Representing these differing sub-sequences as gaps will allow us to treat these cases as “good matches” even though there are long consecutive runs with indel operations in the sequence. Therefore, using a good gap penalty model will avoid low scores in alignments and improve the chances of finding a true alignment. In genetic sequence alignments, gaps are represented as dashes(-) on a protein/DNA sequence alignment.
Unix diff function - computes the minimal difference between two files similarly to plagiarism detection.
Spell checking - Gap penalties can help find correctly spelled words with the shortest edit distance to a misspelled word. Gaps can indicate a missing letter in the incorrectly spelled word.
Plagiarism detection - Gap penalties allow algorithms to detect where sections of a document are plagiarized by placing gaps in original sections and matching what is identical. The gap penalty for a certain document quantifies how much of a given document is probably original or plagiarized.
Bioinformatics applications
Global alignment
A global alignment performs an end-to-end alignment of the query sequence with the reference sequence. Ideally, this alignment technique is most suitable for closely related sequences of similar lengths. The Needleman-Wunsch algorithm is a dynamic programming technique used to conduct global alignment. Essentially, the algorithm divides the problem into a set of sub-problems, then |
https://en.wikipedia.org/wiki/The%20Soul%20of%20a%20New%20Machine | The Soul of a New Machine is a non-fiction book written by Tracy Kidder and published in 1981. It chronicles the experiences of a computer engineering team racing to design a next-generation computer at a blistering pace under tremendous pressure. The machine was launched in 1980 as the Data General Eclipse MV/8000.
The book, whose author was described by the New York Times as having "elevated it to a high level of narrative art" is "about real people working on a real computer for a real company," and it won the 1982 National Book Award for Nonfiction and a Pulitzer Prize for General Non-Fiction.
Plot
The book opens with a turf war between two computer design groups within Data General Corporation, a minicomputer vendor in the 1970s. Most of the senior designers are assigned the "sexy" job of designing the next-generation machine in North Carolina. Their project, code-named "Fountainhead", is to give Data General a machine to compete with the VAX computer from Digital Equipment Corporation (DEC), which is starting to take over the new 32-bit minicomputer market. Meanwhile, at the corporate headquarters at Westborough, Massachusetts, the few remaining senior designers there are assigned the much more humble job of improving Data General's existing products. Tom West, the leader of the Westborough designers, starts a skunkworks project. Code-named "Eagle", it becomes a backup plan in case Fountainhead fails, and then the company's only hope in catching up with DEC. In order to complete the project on time, West takes risks: he elects to use new technology, and he relies on new college graduates (who have never designed anything so complex) as the bulk of his design team. The book follows many of the designers as they give almost every waking moment of their lives to design and debug the new machine.
Themes
The work environment described in the book is in many ways opposite of traditional management. Instead of top-down management, many of the innovations are started at the grassroots level. Instead of management having to coerce labor to work harder, labor volunteers to complete the project on time. The reason for this is that people will give their best when the work itself is challenging and rewarding. Many of the engineers state that "they don't work for the money", meaning they work for the challenge of inventing and creating. The motivational system is akin to the game of pinball, the analogy being that if you win this round, you get to play the game again; that is, build the next generation of computers.
A running theme in the book is the tension between engineering quality and time to market: the engineers, challenged to bring a minicomputer to market on a very short time-frame, are encouraged to cut corners on design. Tom West describes his motto as "Not everything worth doing is worth doing well," or "If you can do a quick-and-dirty job and it works, do it."
The engineers, in turn, complain that the team's goal is to "put a bag on th |
https://en.wikipedia.org/wiki/Typography%20of%20Apple%20Inc. | Apple Inc. uses a large variety of typefaces in its marketing, operating systems, and industrial design with each product cycle. These change throughout the years with Apple's change of style in their products. This is evident in the design and marketing of the company.
Marketing
For at least 18 years, Apple's corporate typeface was a custom variant of the ITC Garamond typeface called Apple Garamond. It was used alongside the Apple logo for product names on computers, in many ads and printed materials, and on the company's website. Starting in 2001, Apple gradually shifted towards using Myriad in its marketing. Starting with iPhone 7 in 2016, Apple switched the typeface of the word mark "iPhone" to San Francisco on products and its website.
Hand-drawn logo
Prior to adopting the bitten Apple as its logo, Apple used a complex logo featuring Isaac Newton sitting below an apple tree. The words APPLE COMPUTER CO. were drawn on a ribbon banner ornamenting the picture frame. The frame itself held a quotation from Wordsworth: "Newton....A Mind Forever Voyaging Through Strange Seas of Thought...Alone.", taken from Wordsworth's autobiographical poem The Prelude. The logo was hand drawn and thus did not use an established font. However, the type is similar to Caslon.
Motter Tektura
Before the introduction of the first Macintosh, alongside the Apple logo, Apple used a typeface called Motter Tektura, which was designed in Austria by Othmar Motter of Vorarlberger Graphik in 1975 and distributed by Letraset (and also famously used by Reebok). At the time, the typeface was considered new and modern. One modification to the typeface was the removal of the dot over the i. The s was also modified for the label on the Disk II 5.25-inch floppy disk drive.
According to the logo designer, Rob Janoff, the typeface was selected for its playful qualities and techno look, which were in line with Apple's mission statement of making high technology accessible to anyone. Janoff designed the logo in 1977 while working with Palo Alto marketer Regis McKenna. The Apple logo's bite mark was originally designed to fit snugly with the Motter Tektura a.
In the early 1980s, the logo was simplified by removing computer . from the logo. Motter Tektura was also used for the Apple II logo. This typeface has sometimes been mislabeled Cupertino, a similar bitmap font probably created to mimic Motter Tektura.
Apple Garamond
Since the introduction of the Macintosh in 1984, Apple adopted a new corporate font called Apple Garamond. It was a variation of the classic Garamond typeface, both narrower and having a taller x-height. Specifically, ITC Garamond (created by Tony Stan in 1977) was condensed to 80% of its normal width. Bitstream condensed the font, subtly adjusted the stroke widths, and performed the hinting required to create the font, which was delivered to Apple as the Postscript font "apgaram".
In cases where the Apple logo was accompanied by text, it was always set in Apple |
https://en.wikipedia.org/wiki/DRDOS | DRDOS may refer to:
DR-DOS (originally DR DOS), a computer operating system developed by Digital Research, Novell, Caldera, and DeviceLogics
DRDOS, Inc. also known as DeviceLogics, a (former) developer of DR-DOS
Distributed reflective denial of service (DRDoS), a type of attempt to disrupt a computer network |
https://en.wikipedia.org/wiki/Elvish%20Linguistic%20Fellowship | The Elvish Linguistic Fellowship (E. L. F.) is a "Special Interest Group" of the Mythopoeic Society devoted to the study of J. R. R. Tolkien's constructed languages, headed by the computer scientist Carl F. Hostetter. It was founded by Jorge Quiñónez in 1988.
Organising Tolkien's language writings
In 1992, Christopher Tolkien appointed the editors of the E.L.F. to order, edit, and then publish his father's writings concerning his constructed languages. They have worked from photocopies of the materials sent to them and from notes taken by the group's members in the Bodleian and Marquette University Tolkien manuscript archives. This main course of publication was being carried out in the journal Parma Eldalamberon, until it halted in June 2015. There are, however, some writings that are largely independent, and/or whose context has been sufficiently established by Christopher Tolkien's own chronological publication efforts in The History of Middle-earth, and so do not have to be presented in the normal chronological flow of the larger project. Such materials are being published in the journal Vinyar Tengwar. Members include Christopher Gilson, Carl F. Hostetter, Arden R. Smith, Bill Welden, and Patrick H. Wynne.
Journals
The E. L. F. publishes two journals, Vinyar Tengwar, edited by Hostetter, and Parma Eldalamberon, edited by Christopher Gilson. There is also an online journal, Tengwestië, edited by Hostetter and Patrick H. Wynne; and it also sponsors the Lambengolmor mailing list.
Parma Eldalamberon
Parma Eldalamberon (broken Quenya for 'The Book of Elven-tongues') was founded in 1971 as a fanzine devoted to a variety of invented literary languages, published under the auspices of the Mythopoeic Society. Today it is an irregular publication dedicated to the editing of Tolkien's manuscripts describing his Elvish Languages. It is edited by Christopher Gilson. It has no ISSN or ISBN number.
In 1995, with the support of Christopher Tolkien and permission of the Tolkien Estate, Parma was reinvented as a series of standalone volumes publishing in full material from Tolkien's manuscripts relating to languages and scripts. Much of this material was previously unpublished or published only in heavily edited form (for example, selections from the "Gnomish Lexicon" published in full in Parma Eldalamberon #11 were published in the Appendices to The Book of Lost Tales.). For a list of material by Tolkien published in Parma Eldalamberon 1995 to date, see Elvish languages (Middle-earth)#Bibliography.
Vinyar Tengwar
Vinyar Tengwar (broken Quenya for "News Letters") is a refereed journal () published by the Elvish Linguistic Fellowship, dedicated to the study of the languages constructed by J. R. R. Tolkien. The publication is indexed by the Modern Language Association.
Vinyar Tengwar first appeared in 1988, at first edited by Jorge Quiñónez and later taken over by Hostetter. It appeared in bimonthly intervals at first, but after July 1994, issu |
https://en.wikipedia.org/wiki/Box%20score%20%28baseball%29 | A box score is a chart used in baseball to present data about player achievement in a particular game. An abbreviated version of the box score, duplicated from the field scoreboard, is the line score. The Baseball Hall of Fame credits Henry Chadwick with the invention of the box score in 1858.
Line score
The line score is a two-line chart that reports each team's run totals by inning, and total runs, total hits, and total errors on a line. The visiting team is on the top line and the home team on the bottom line. The terms top of the inning and bottom of the inning are derived from their positions in the line score. Sometimes, the winning team is bolded or colored for quick-reference. If the home team is leading after the top of the 9th inning, an "X" is placed for that team's entry in the line score for the bottom of the 9th inning instead of a number of runs scored since the team does not bat in the bottom of the 9th inning.
Line score for the Brooklyn Dodgers–New York Giants pennant-winning game of October 3, 1951:
Box score
The box score lists the line score as well as individual and team performance in the game. The statistics used are those recorded by the official scorer of each game.
The following box score is of a notable game in baseball history, Game 6 of the 1991 World Series.
(All game references below refer to the box score above.)
At the top of the box score, the editor of a publication may list the time, date, and/or place of the game. In the example, the stadium's name (the Hubert H. Humphrey Metrodome) and city (Minneapolis) are listed.
The line score is always listed as part of the box score, usually near the top; it lists the total runs scored in each inning. (The Atlanta Braves scored two runs in the fifth inning and one in the seventh. The Minnesota Twins scored two runs in the first inning, one in the fifth, and one in the eleventh. ) Innings are normally grouped in sets of three for ease of reading. The team totals of runs, hits, and errors are listed last, after a separating character such as a dash. The actual score of the game is represented by the first column after the dash; (the Twins won this game four runs to three.)
The batting performances of each player in the game are grouped by team, with the visiting team listed first. Players are listed by last name in the order in which they were listed on the lineup card for the game, showing all players who enter the game at any point whether they make a plate appearance or not. Their fielding positions or batting roles are normally listed next to their last name. Typically only last names are used, unless two players with the same name appear in the game, in which case a distinctive first initial is also used. When a player switches fielding position, both positions are listed. (Brian Hunter, in the sixth position of the Braves' batting order, started at left field but also served as the first baseman.) Substitute players are listed where they were placed i |
https://en.wikipedia.org/wiki/Carl%20F.%20Hostetter | Carl Franklin Hostetter is a Tolkien scholar and NASA computer scientist. He has edited and annotated many of J. R. R. Tolkien's linguistic writings, publishing them in Vinyar Tengwar and Parma Eldalamberon.
Career
NASA
Carl Hostetter joined NASA as a computer scientist at its Goddard Space Flight Center in 1985. In the 1990s, he edited the proceedings of the Goddard Space Conference for some years.
Tolkien scholar
Hostetter is a Tolkien scholar and key figure in the Elvish Linguistic Fellowship. He has written numerous articles on the linguistics of J. R. R. Tolkien's Middle-earth. He ran the scholarly mailing list Lambengolmor from 2002 to its closure in 2020. He is the editor of the Tolkien linguistics journals Vinyar Tengwar and Tengwestië. By arrangement with Christopher Tolkien, he edited and published a large quantity of J. R. R. Tolkien's writings on his constructed languages in Vinyar Tengwar (in various issues between 1991 and 2007) and in Parma Eldalamberon issues 11 (1995) to 22 (2015).
Reception
John S. Ryan, reviewing the 2000 collection Tolkien's Legendarium: Essays on The History of Middle-earth (edited by Hostetter and Verlyn Flieger) for VII, called it a "luminous companion" to the 12 volumes of Christopher Tolkien's The History of Middle-earth, and "clearly indispensable". The book won the 2002 Mythopoeic Scholarship Award for Inklings Studies.
The Tolkien scholar Douglas C. Kane, while welcoming the 2021 book The Nature of Middle-earth, writes that Hostetter "appears to overstep his role as editor" by presenting the materials according to his personal point of view. In particular, Kane states that Hostetter wrongly applies Tolkien's remark that The Lord of the Rings was fundamentally religious and Catholic to the whole of the legendarium. Kane calls this contrary to Christopher Tolkien's editorial practice, and "a blatant statement of intent". Kane quotes Verlyn Flieger's remark that Tolkien's work reflects the two sides of his nature; the work can be seen both "as Catholic [and] not Christian."
Books
Middle-earth
Edited
2000 Tolkien's Legendarium: Essays on The History of Middle-earth (with Verlyn Flieger) Westport: Greenwood Press
2003 Early Quenya Fragments / Early Quenya Grammar (with Bill Welden) Cupertino: The Tolkien Trust
2005 The Collected Vinyar Tengwar (with Jorge Quiñonez) Crofton: Elvish Linguistic Fellowship
2021 The Nature of Middle-earth: late writings on the lands, inhabitants, and metaphysics of Middle-earth (texts by J.R.R. Tolkien) Boston: Houghton Mifflin Harcourt
Space science
Edited
1993 Space applications of artificial intelligence: Goddard Conference. Goddard Space Flight Center, NASA
1994 Space applications of artificial intelligence: Goddard Conference. Goddard Space Flight Center, NASA
1995 Space applications of artificial intelligence: Goddard Conference. Goddard Space Flight Center, NASA
References
External links
Carl F. Hostetter at Tolkien Gateway
Carl F. Host |
https://en.wikipedia.org/wiki/Artronix | Artronix Incorporated began in 1970 and has roots in a project in a computer science class at Washington University School of Medicine in St Louis. The class designed, built and tested a 12-bit minicomputer, which later evolved to become the PC12 minicomputer. The new company entered the bio-medical computing market with a set of peripherals and software for use in Radiation Treatment Planning (see full article and abstract) and ultrasound scanning. Software for the PC12 was written in assembly language and FORTRAN; later software was written in MUMPS. The company was located in two buildings in the Hanley Industrial Park off South Hanley Road in Maplewood, Missouri.
The company later developed another product line of brain-scanning or computed tomography equipment based on the Lockheed SUE 16-bit minicomputer (see also Pluribus); later designs included an optional vector processor using AMD Am2900 bipolar bit-slices to speed tomographic reconstruction calculations. In contrast to earlier designs, the Artronix scanner used a fan-shaped beam with 128 detectors on a rotating gantry. The system would take 540 degrees of data (1½ rotations) to average out noise in the samples. The beam allowed 3mm slices, but several slices would routinely be mathematically combined into one image for display purposes. The first generation of scanners was a head scanner while a later generation was a torso (whole-body) scanner. The CAT-3 (computerized axial tomography) system was a success at first, but the technology surrendered ground to PET (positron emission tomography) and MRI (magnetic resonance imaging) systems. Artronix closed its doors in 1978. A video of the Artronix torso scanner operating without a shroud is available on YouTube at Commissie NVvRadiologie with narration in Dutch.
Artronix was founded by Arne Roestel. Mr. Roestel went on to found Multidata Systems International. For his leadership of Artronix, Mr. Roestel was named as the Small Businessman of the Year for Missouri in 1976 by the Small Business Administration and was hosted at a luncheon by President Gerald Ford (source: Ford Library Museum).
References
Link broken when tested on 2017-07-13.
Electronics companies of the United States
Companies based in Missouri |
https://en.wikipedia.org/wiki/List%20of%20academic%20databases%20and%20search%20engines | This article contains a representative list of notable databases and search engines useful in an academic setting for finding and accessing articles in academic journals, institutional repositories, archives, or other collections of scientific and other articles. Databases and search engines differ substantially in terms of coverage and retrieval qualities. Users need to account for qualities and limitations of databases and search engines, especially those searching systematically for records such as in systematic reviews or meta-analyses. As the distinction between a database and a search engine is unclear for these complex document retrieval systems, see:
the general list of search engines for all-purpose search engines that can be used for academic purposes
the article about bibliographic databases for information about databases giving bibliographic information about finding books and journal articles.
The terms "free", "subscription", and "free & subscription" will refer to the availability of the website as well as the journal articles used. Furthermore, some programs are only partly free (for example, accessing abstracts or a small number of items), whereas complete access is prohibited (login or institutional subscription required).
The "Size" column denotes the number of documents (articles, publications, datasets, preprints) rather than the number of citations or references. The database itself should be the primary source of statistics, and if it is not accessible, the independent estimates released as journal papers should be. Notably, Google Scholar does not offer such detail, but the database's size has been calculated.
Operating services
Full-text aggregators
The main academic full-text databases are open archives or link-resolution services, although others operate under different models such as mirroring or hybrid publishers. Such services typically provide access to full text and full-text search, but also metadata about items for which no full text is available.
This list focuses on general-purpose services; OpenDOAR can be used to find thousands of open-access repositories. The table is sorted by the number of works for which full-text is made available.
Metadata services
Smaller metadata services
Services with less than a million searchable records.
Publishers
Content by most academic publishers is indexed by CrossRef, DOAJ and/or DataCite. Some publishers are also listed separately in the table below.
Services no longer operating
The following services are no longer operating; this may be because they were not updated, abandoned entirely, replaced by other, etc.
See also
Academic publishing
List of digital library projects
List of educational video websites
List of neuroscience databases
List of online databases
List of online encyclopedias
List of open access journals
List of preprint repositories
References
Databases
Internet-related lists
Bibliographic databases and indexes
Databases
|
https://en.wikipedia.org/wiki/Unix%20time | Current Unix time ()
Unix time is a date and time representation widely used in computing. It measures time by the number of seconds that have elapsed since 00:00:00 UTC on 1 January 1970, the Unix epoch, without adjustments made due to leap seconds. In modern computing, values are sometimes stored with higher granularity, such as microseconds or nanoseconds.
Unix time originated as the system time of Unix operating systems. It has come to be widely used in other computer operating systems, file systems, programming languages, and databases.
Definition
Unix time is currently defined as the number of non-leap seconds which have passed since 00:00:00UTC on Thursday, 1 January 1970, which is referred to as the Unix epoch. Unix time is typically encoded as a signed integer.
The Unix time is exactly midnight UTC on 1 January 1970, with Unix time incrementing by 1 for every non-leap second after this. For example, 00:00:00UTC on 1 January 1971 is represented in Unix time as . Negative values, on systems that support them, indicate times before the Unix epoch, with the value decreasing by 1 for every non-leap second before the epoch. For example, 00:00:00UTC on 1 January 1969 is represented in Unix time as . Every day in Unix time consists of exactly seconds.
Unix time is sometimes referred to as Epoch time. This can be misleading since Unix time is not the only time system based on an epoch and the Unix epoch is not the only epoch used by other time systems.
Leap seconds
Unix time differs from both Coordinated Universal Time (UTC) and International Atomic Time (TAI) in its handling of leap seconds. UTC includes leap seconds that adjust for the discrepancy between precise time, as measured by atomic clocks, and solar time, relating to the position of the earth in relation to the sun. International Atomic Time (TAI), in which every day is precisely seconds long, ignores solar time and gradually loses synchronization with the Earth's rotation at a rate of roughly one second per year. In Unix time, every day contains exactly seconds. Each leap second uses the timestamp of a second that immediately precedes or follows it.
On a normal UTC day, which has a duration of seconds, the Unix time number changes in a continuous manner across midnight. For example, at the end of the day used in the examples above, the time representations progress as follows:
When a leap second occurs, the UTC day is not exactly seconds long and the Unix time number (which always increases by exactly each day) experiences a discontinuity. Leap seconds may be positive or negative. No negative leap second has ever been declared, but if one were to be, then at the end of a day with a negative leap second, the Unix time number would jump up by 1 to the start of the next day. During a positive leap second at the end of a day, which occurs about every year and a half on average, the Unix time number increases continuously into the next day during the leap second and then a |
https://en.wikipedia.org/wiki/Swedish%20telephone%20plugs%20%26%20sockets | A standard Swedish telephone plug carries one telephone line and has four flat metal pins and one plastic pin. The design is only used in Sweden and older installations in Iceland (RJ11 and a data/voice standard using an 8P8C modular connector are used in more recent buildings). Neither plug nor socket is compatible with other plugs and sockets. It is defined in Swedish Standard SS 455 15 50.
Sockets connected in cascade
When there is only one socket in a house or apartment, the incoming line is connected to the two lower receptacles and the upper receptacles are left unused. When a subscriber has more than one telephone socket, they typically are connected so that two telephones can not be connected to the telephone exchange at the same time. This is done by connecting the two upper receptacles of a socket to the lower receptacles of the next socket. When a connected telephone's handset is lifted the two twisted pair connections are separated, thus disconnecting any telephones downward in the chain.
The plastic pin adds a presence function. When not inserted into a jack, the jack itself (mechanically) connects the incoming line to the next socket.
The cascade topology makes installing a DSL splitter a matter of plugging it in the first socket since this socket provides both direct access to the PSTN and connections to the remaining sockets.
Sockets connected in parallel
When all sockets on a line are connected in parallel only the lower pins on a Swedish Standard plug (middle connectors on RJ-plugs) are used. This configuration was earlier not allowed due to Swedish law prohibiting the possibility of eavesdropping on a telephone line (and possibly also to limit each household's load on the exchange). Parallel connection of sockets are now allowed but can be considered bad practice by some, and makes DSL splitter installation more cumbersome. The advantages include compatibility with foreign equipment and conference call-type communication.
Other connectors used in Sweden
In addition to the standard Swedish plugs and sockets, RJ11 connectors are quite common, especially in offices. Even 8P8C modular telephone sockets can be found. Most telephone equipment sold in Sweden today has RJ11 sockets and corresponding cables with 6P4C plugs on each end and an adaptor from RJ11 to SS 455 15 50 sockets. The Swedish practice with sockets connected in cascade can be maintained with RJ plugs and sockets by using the first pair for connecting the terminal equipment to the PSTN and the second pair for the connection of a line towards the next socket. However, the presence function found in Swedish Standard sockets is lost, so disconnecting a telephone from its socket requires replacing it with a dummy plug so the sockets further down in the chain will remain connected.
6P6C modular plugs are also used for telephony, but only for certain telephone exchange systems - never for direct connection to the PSTN. ISDN telephones and outlets always have 8P8C modul |
https://en.wikipedia.org/wiki/Biorobotics | Biorobotics is an interdisciplinary science that combines the fields of biomedical engineering, cybernetics, and robotics to develop new technologies that integrate biology with mechanical systems to develop more efficient communication, alter genetic information, and create machines that imitate biological systems.
Cybernetics
Cybernetics focuses on the communication and system of living organisms and machines that can be applied and combined with multiple fields of study such as biology, mathematics, computer science, engineering, and much more.
This discipline falls under the branch of biorobotics because of its combined field of study between biological bodies and mechanical systems. Studying these two systems allow for advanced analysis on the functions and processes of each system as well as the interactions between them.
History
Cybernetic theory is a concept that has existed for centuries, dating back to the era of Plato where he applied the term to refer to the "governance of people". The term cybernetique is seen in the mid 1800s used by physicist André-Marie Ampère. The term cybernetics was popularized in the late 1940s to refer to a discipline that touched on, but was separate, from established disciplines, such as electrical engineering, mathematics, and biology.
Science
Cybernetics is often misunderstood because of the breadth of disciplines it covers. In the early 20th century, it was coined as an interdisciplinary field of study that combines biology, science, network theory, and engineering. Today, it covers all scientific fields with system related processes. The goal of cybernetics is to analyze systems and processes of any system or systems in an attempt to make them more efficient and effective.
Applications
Cybernetics is used as an umbrella term so applications extend to all systems related scientific fields such as biology, mathematics, computer science, engineering, management, psychology, sociology, art, and more. Cybernetics is used amongst several fields to discover principles of systems, adaptation of organisms, information analysis and much more.
Genetic engineering
Genetic engineering is a field that uses advances in technology to modify biological organisms. Through different methods, scientists are able to alter the genetic material of microorganisms, plants and animals to provide them with desirable traits. For example, making plants grow bigger, better, and faster. Genetic engineering is included in biorobotics because it uses new technologies to alter biology and change an organism's DNA for their and society's benefit.
History
Although humans have modified genetic material of animals and plants through artificial selection for millennia (such as the genetic mutations that developed teosinte into corn and wolves into dogs), genetic engineering refers to the deliberate alteration or insertion of specific genes to an organism's DNA. The first successful case of genetic engineering occurred in 1973 wh |
https://en.wikipedia.org/wiki/Star%20Wars%3A%20Clone%20Wars%20%282003%20TV%20series%29 | Star Wars: Clone Wars is an American animated TV series developed and directed by Genndy Tartakovsky and produced by Lucasfilm and Cartoon Network Studios for Cartoon Network. Set in the Star Wars universe, specifically between the Star Wars prequel trilogy films Attack of the Clones and Revenge of the Sith, it is amongst the first of many works to explore the Clone Wars. The show follows the actions of various prequel trilogy characters, notably Jedi and clone troopers, in their war against the droid armies of the Confederacy of Independent Systems and the Sith.
The series aired on Cartoon Network for three seasons consisting of 25 episodes altogether from November 7, 2003, to March 25, 2005, and was the first Star Wars television series since Ewoks (1985–1986). The first two seasons of Clone Wars, released on DVD as Volume One were produced in episodes ranging from two to three minutes, while the third season consists of five 12-minute episodes and was released on DVD as Volume Two. The two volumes were released on DVD by 20th Century Fox Home Entertainment. Since its release, the series has received critical acclaim and won multiple awards, including the Primetime Emmy Award for Outstanding Animated Program for both volumes. Its success led to it being spun off as the CGI series The Clone Wars in 2008. The show is available to be streamed on Disney+, due to Disney’s ownership of the franchise, making it the only Cartoon Network-produced series to be available to stream on a rival streaming platform.
Plot
The series begins shortly after Attack of the Clones, as the failing Galactic Republic and the Jedi are under siege from the Separatist Confederacy of Independent Systems and the Sith. As the war rages on, more and more planets start to slip from Republic control.
Synopsis
The main storyline of Volume One features the Jedi Knight Obi-Wan Kenobi leading an assault on the planet Muunilinst. This is the home of the Intergalactic Banking Clan, benefactors of the Separatists wishing to break away from the Republic. The Banking Clan have hired a bounty hunter named Durge to command their droid armies on the battlefield. Obi-Wan's apprentice, Anakin Skywalker, is personally appointed to lead the space forces in the battle by Supreme Chancellor Palpatine. Meanwhile, Separatist leader Count Dooku takes the Force-sensitive Asajj Ventress as his Sith apprentice and sends her to kill Anakin. On Yavin 4, Anakin manages to defeat Ventress in a lightsaber duel by drawing on his anger.
Surrounding this storyline are various battles focusing on other Jedi and their wartime exploits. Master Mace Windu faces a droid army unarmed on Dantooine, Master Yoda travels to the ice world Ilum to save Luminara Unduli and Barriss Offee, the amphibious Kit Fisto leads an aquatic regiment of clone troopers on the waterworld Mon Cala, and a group of stranded Jedi encounter the dreaded Jedi hunter General Grievous on Hypori.
Volume Two picks up right where Volume One en |
https://en.wikipedia.org/wiki/IRobot | iRobot Corporation is an American technology company that designs and builds consumer robots. It was founded in 1990 by three members of MIT's Artificial Intelligence Lab, who designed robots for space exploration and military defense. The company's products include a range of autonomous home vacuum cleaners (Roomba), floor moppers (Braava), and other autonomous cleaning devices.
In August 2022, Amazon.com, Inc. announced its intent to acquire iRobot for US$1.7billion; the deal is currently subject to regulatory approval, and is facing investigations by the U.S. Federal Trade Commission (FTC) and European Commission for potential abuse of market power. In July 2023, Amazon reduced the offer price to $1.42billion after iRobot raised $200million in new debt to fund its daily operations.
History
iRobot was founded in 1990 by Rodney Brooks, Colin Angle, and Helen Greiner after working in MIT's Artificial Intelligence Lab.
In 1998, the company received a DARPA research contract which led to the development of the PackBot.
In September 2002, iRobot unveiled its home robots flagship, the Roomba, which sold a million units by 2004.
iRobot began being traded on the NASDAQ in November 2005, under ticker symbol IRBT.
On September 17, 2012, iRobot announced that it had acquired Evolution Robotics, manufacturer of automated floor mopper Mint.
iRobot has sold more than 30 million home robots, and has deployed more than 5,000 defense & security robots, as of 2020.
In addition to deployment as bomb-disposal units with the US military in Iraq and Afghanistan, PackBots have been used to gather data in dangerous conditions at the Fukushima Daiichi nuclear disaster site, and an iRobot Seaglider detected underwater pools of oil after the Deepwater Horizon oil spill.
In February 2016, iRobot announced that it would sell its military robotics business to Arlington Capital Partners, in order to focus more on the consumer market.
In November 2021, iRobot announced that it had acquired Aeris Cleantec AG, a Swiss air purifier manufacturer. iRobot began selling Aeris-designed air purifiers through its own brand in 2022.
On August 5, 2022, Amazon announced its intent to acquire iRobot in a deal worth US$1.7billion. The deal is currently subject to federal approval from the U.S. Federal Trade Commission (FTC). In September 2022, the FTC requested more data from both companies, amid concerns about Amazon's market power and the privacy implications of it gaining information about consumer floorplans. In June 2023, the UK's Competition and Markets Authority cleared the acquisition, saying it wouldn't lead to competition concerns in the country. The European Commission launched a formal investigation into the proposed purchase in July 2023, citing that it would "allow Amazon to restrict competition in the market for robot vacuum cleaners ('RVCs') and to strengthen its position as online marketplace provider." In July 2023, Amazon reduced the offer price to $1.42billio |
https://en.wikipedia.org/wiki/Food%20Network%20%28disambiguation%29 | Food Network is an American cable television network.
Food Network may also refer to:
Food Network (Canada)
Food Network (New Zealand)
7food network, a former Australian television channel
SBS Food, an Australian television channel, formerly branded Food Network
Food Network Asia, a cable television channel in Asia
Food Network Magazine, published by Hearst Magazines
See also
Food chain, a concept in ecological science
Carlton Food Network, a defunct British cable television network
Good Food, a defunct British television network merged by Discovery with Food Network UK
Asian Food Network, an Asian pay TV channel formerly known as Asian Food Channel |
https://en.wikipedia.org/wiki/Job%20File%20Table | The Job File Table (JFT) is a DOS data structure in the Program Segment Prefix (PSP). It starts at PSP offset 0x18 and is 20 bytes long. For each open file handle, DOS stores the index into the System File Table (SFT). A file handle that is returned by open, _open, and other similar functions is simply an index into the JFT where DOS stored the SFT entry index for the file or device that the program opened.
When a program starts, the first 5 entries in the JFT are preconnected to the standard devices. All other handles are marked as closed by setting the value of the entry to 0xFF. The standard devices are initialised as follows:
Handles 0-2 are connected to the console device. During program execution they can get modified (closed, redirected) like any other handle.
Because the size of the JFT in the PSP is limited to 20 bytes, originally only 15 files (20 minus the 5 standard devices) could be open at a time. In MS-DOS 2.0, the Extended Job File Table was introduced, which allowed up to 254 files to be opened.
As of MS-DOS 3.30, the size of the JFT can be modified with a call to INT 21h, 67h.
References
DOS technology |
https://en.wikipedia.org/wiki/Program%20Segment%20Prefix | The Program Segment Prefix (PSP) is a data structure used in DOS systems to store the state of a program. It resembles the Zero Page in the CP/M operating system. The PSP has the following structure:
The PSP is most often used to get the command line arguments of a DOS program; for example, the command "FOO.EXE /A /F" executes FOO.EXE with the arguments '/A' and '/F'.
If the PSP entry for the command line length is non-zero and the pointer to the environment segment is neither 0000h nor FFFFh, programs should first try to retrieve the command line from the environment variable %CMDLINE% before extracting it from the PSP. This way, it is possible to pass command lines longer than 126 characters to applications.
The segment address of the PSP is passed in the DS register when the program is executed. It can also be determined later by using Int 21h function 51h or Int 21h function 62h. Either function will return the PSP address in register BX.
Alternatively, in .COM programs loaded at offset 100h, one can address the PSP directly just by using the offsets listed above. Offset 000h points to the beginning of the PSP, 0FFh points to the end, etc.
For example, the following code displays the command line arguments:
org 100h ; .COM - not using ds
; INT 21h subfunction 9 requires '$' to terminate string
xor bx,bx
mov bl,[80h]
cmp bl,7Eh
ja exit ; preventing overflow
mov byte [bx+81h],'$'
; print the string
mov ah,9
mov dx,81h
int 21h
exit:
mov ax,4C00h ; subfunction 4C
int 21h
In DOS 1.x, it was necessary for the CS (Code Segment) register to contain the same segment as the PSP at program termination, thus standard programming practice involved saving the DS register (since the DS register is loaded with the PSP segment) along with a zero word to the stack at program start and terminating the program with a RETF instruction, which would pop the saved segment value off the stack and jump to address 0 of the PSP, which contained an INT 20h instruction.
; save
push ds
xor ax,ax
push ax
; move to the default data group (@data)
mov ax,@data
mov ds,ax
; print message in mess1 (21h subfunction 9)
mov dx,mess1
mov ah,9
int 21h
retf
If the executable was a .COM file, this procedure was unnecessary and the program could be terminated merely with a direct INT 20h instruction or else calling INT 21h function 0. However, the programmer still had to ensure that the CS register contained the segment address of the PSP at program termination. Thus,
jmp start
mess1 db 'Hello world!$'
start:
mov dx,mess1
mov ah,9
int 21h
int 20h
In DOS 2.x and higher, program termination was accomplished instead with INT 21h function 4Ch which did not require the CS register to contain the segment value of the PSP.
See also
Zero page (CP/M)
CALL 5 (DOS)
Stack frame (Unix)
Process directory (Multics)
Process identifier (PID)
this (computer programming)
Self-reference
References
Further reading
(41 |
https://en.wikipedia.org/wiki/Consistency%20%28disambiguation%29 | Consistency, in logic, is a quality of no contradiction.
Consistency may also refer to:
Computer science
Consistency (database systems)
Consistency (knowledge bases)
Consistency (user interfaces)
Consistent hashing
Consistent heuristic
Consistency model
Data consistency
Statistics
Consistency (statistics), a property of an estimation technique giving the right answer with an infinite amount of data
Consistent estimator
Fisher consistency
Consistent test: see Statistical hypothesis testing
Physics
The viscosity of a thick fluid
Consistency (suspension) of a suspension
Consistent histories, in quantum mechanics
Other uses
Consistency (negotiation), the psychological need to be consistent with prior acts and statements
"Consistency", an 1887 speech by Mark Twain
"Consistency", a song by Megan Thee Stallion and Jhené Aiko from the album Traumazine, 2022
The consistency criterion, a measure of a voting system requiring that where one is elected by all segments of the voters, one must win the election
Consistency Theory, an album by 1200 Techniques
Consistent and inconsistent equations, in mathematics
Consistent life ethic, an ideology stating that life is sacred
Equiconsistency, in logic
Mr. Consistency (foaled 1958), American Thoroughbred racehorse
See also
Constancy (disambiguation) |
https://en.wikipedia.org/wiki/.th | .th is the Internet country code top-level domain (ccTLD) for Thailand.
It is administered by T.H.NIC Co., Ltd. (THNIC), the corporate entity of Thai Network Information Center Foundation.
Registration
Registration of a .co.th domain name is a complicated procedure; for this reason most Thai websites prefer to use a .com name. In order to register a .co.th domain name the registrar in Thailand requires copies of company documents in the same name as the required domain name, so for example if an entity required acme.co.th the entity would need to have a registered company called Acme Co., Ltd.
A company can only register a single .co.th domain with the company name or initial name of company, and/or one .co.th domain name per trademark.
In 2018, the foundation advance to the registration for authentic using of persons (natural persons and juristic persons); therefore, the foundation reserves the right to consider and decide the number of domain names of each person on a case-by-case basis. The person who registered more than one domain name from all categories must comply with the following conditions:
All domain name registrations must comply with the criteria of domain naming and conditions as provided specified policy by categories of domain name.
The registration of domain names shall be effected in good faith by a holder of the domain name and a contact person who having a residential address or an office address in Thailand which can be contacted by THNIC.
In the case THNIC detects any unusual act in domain name registration, specifically, registration of more than one domain name, THNIC reserves the right to refuse the request or revoke the domain name immediately.
Second-level domains
THNIC admits .th registration only third-level domain under seven groups of predefined second-level domains:
Second top domain
In 2010 a new top domain was registered and introduced for Thailand, intended for domain names in the local language. This top domain is . As of 2011, thousands of sites with this domain are active.
It appears that the Thai second-level domains are assigned directly to sites with English domain names. Other groups of domains must use third-level domains, as in the table above.
References
External links
IANA .th whois information
THNIC website
Thai Network Information Center Foundation website
ALL Statistic Domain .TH
Country code top-level domains
Telecommunications in Thailand
Computer-related introductions in 1988
Internet in Thailand
sv:Toppdomän#T |
https://en.wikipedia.org/wiki/LZH | LZH may refer to:
Classical Chinese (ISO 639: lzh), a written form of Old Chinese
LHA (file format), a data compression format
Liuzhou Bailian Airport (IATA code: LZH), an airport in China |
https://en.wikipedia.org/wiki/Samizdata | Samizdata is a British group weblog. Founded on 2 November 2001 by Perry de Havilland and originally named ‘Libertarian Samizdata’, it dropped the label due to the reluctance of editors to subscribe to a particular label.
Edited by "anarcho-libertarians, tax rebels, Eurosceptics, and Wildean individualists", Samizdata is one of the UK's oldest blogs. The editors describe Samizdata.net as "a blog for people with a critically rational individualist perspective. We are developing the social individualist meta-context for the future. From the very serious to the extremely frivolous...".
In 2005, The Guardian wrote that it was "by some measures the nation's most successful independent blog", with over 15,000 unique visitors a day, and "arguably the grandfather of British political blogs". In 2008, The Observer labelled it as one of the fifty most powerful blogs in the world.
References
British political blogs |
https://en.wikipedia.org/wiki/Identification%20%28information%29 | For data storage, identification is the capability to find, retrieve, report, change, or delete specific data without ambiguity. This applies especially to information stored in databases. In database normalisation, the process of organizing the fields and tables of a relational database to minimize redundancy and dependency, is the central, defining function of the discipline.
See also
Authentication
Identification (disambiguation)
Forensic profiling
Profiling (information science)
Unique identifier
References
Data modeling |
https://en.wikipedia.org/wiki/Iterative%20reconstruction | Iterative reconstruction refers to iterative algorithms used to reconstruct 2D and 3D images in certain imaging techniques.
For example, in computed tomography an image must be reconstructed from projections of an object. Here, iterative reconstruction techniques are usually a
better, but computationally more expensive alternative to the common filtered back projection (FBP) method, which directly calculates the image in
a single reconstruction step. In recent research works, scientists have shown that extremely fast computations and massive parallelism is possible for iterative reconstruction, which makes iterative reconstruction practical for commercialization.
Basic concepts
The reconstruction of an image from the acquired data is an inverse problem. Often, it is not possible to exactly solve the inverse
problem directly. In this case, a direct algorithm has to approximate the solution, which might cause visible reconstruction artifacts in the image. Iterative algorithms approach the correct solution using multiple iteration steps, which allows to obtain a better reconstruction at the cost of a higher computation time.
There are a large variety of algorithms, but each starts with an assumed image, computes projections from the image, compares the original projection data and updates the image based upon the difference between the calculated and the actual projections.
Algebraic reconstruction
The Algebraic Reconstruction Technique (ART) was the first iterative reconstruction technique used for computed tomography by Hounsfield.
iterative Sparse Asymptotic Minimum Variance
The iterative Sparse Asymptotic Minimum Variance algorithm is an iterative, parameter-free superresolution tomographic reconstruction method inspired by compressed sensing, with applications in synthetic-aperture radar, computed tomography scan, and magnetic resonance imaging (MRI).
Statistical reconstruction
There are typically five components to statistical iterative image reconstruction algorithms, e.g.
An object model that expresses the unknown continuous-space function that is to be reconstructed in terms of a finite series with unknown coefficients that must be estimated from the data.
A system model that relates the unknown object to the "ideal" measurements that would be recorded in the absence of measurement noise. Often this is a linear model of the form , where represents the noise.
A statistical model that describes how the noisy measurements vary around their ideal values. Often Gaussian noise or Poisson statistics are assumed. Because Poisson statistics are closer to reality, it is more widely used.
A cost function that is to be minimized to estimate the image coefficient vector. Often this cost function includes some form of regularization. Sometimes the regularization is based on Markov random fields.
An algorithm, usually iterative, for minimizing the cost function, including some initial estimate of the image and some stopping criterion f |
https://en.wikipedia.org/wiki/Sudo | sudo ( or ) is a program for Unix-like computer operating systems that enables users to run programs with the security privileges of another user, by default the superuser. It originally stood for "superuser do", as that was all it did, and it is its most common usage; however, the official Sudo project page lists it as "su 'do'". The current Linux manual pages for su define it as "substitute user", making the correct meaning of sudo "substitute user, do", because sudo can run a command as other users as well.
Unlike the similar command su, users must, by default, supply their own password for authentication, rather than the password of the target user. After authentication, and if the configuration file (typically /etc/sudoers) permits the user access, the system invokes the requested command. The configuration file offers detailed access permissions, including enabling commands only from the invoking terminal; requiring a password per user or group; requiring re-entry of a password every time or never requiring a password at all for a particular command line. It can also be configured to permit passing arguments or multiple commands.
History
Robert Coggeshall and Cliff Spencer wrote the original subsystem around 1980 at the Department of Computer Science at SUNY/Buffalo. Robert Coggeshall brought sudo with him to the University of Colorado Boulder. Between 1986 and 1993, the code and features were substantially modified by the IT staff of the University of Colorado Boulder Computer Science Department and the College of Engineering and Applied Science, including Todd C. Miller. The current version has been publicly maintained by OpenBSD developer Todd C. Miller since 1994, and has been distributed under an ISC-style license since 1999.
In November 2009 Thomas Claburn, in response to concerns that Microsoft had patented sudo, characterized such suspicions as overblown. The claims were narrowly framed to a particular GUI, rather than to the sudo concept.
The logo is a reference to an xkcd strip.
Design
Unlike the command su, users supply their personal password to sudo (if necessary) rather than that of the superuser or other account. This allows authorized users to exercise altered privileges without compromising the secrecy of the other account's password. After authentication, and if the configuration file permits the user access, the system invokes the requested command. sudo retains the user's invocation rights through a grace period (typically 5 minutes) per pseudo terminal, allowing the user to execute several successive commands as the requested user without having to provide a password again.
As a security and auditing feature, sudo may be configured to log each command run. When a user attempts to invoke sudo without being listed in the configuration file, an exception indication is presented to the user indicating that the attempt has been recorded. If configured, the root user will be alerted via mail. By default, an entry is re |
https://en.wikipedia.org/wiki/Switch%20%28ad%20campaign%29 | Switchers was an advertising campaign launched by Apple Computer, Inc. (now Apple Inc.) on June 10, 2002. It featured what the company referred to as "real people" who had "switched" from the Microsoft Windows platform to the Mac. An international television and print ad campaign directed users to a website where various "myths" about the Mac platform were "dispelled". The television commercials were directed by Errol Morris.
Switchers
A young woman who appeared in the commercials, Ellen Feiss, became an internet celebrity. Feiss was a friend of Morris's son Hamilton Morris, who also appeared in a commercial.
Localized versions of the commercials, with local "switchers", aired in Iceland and Japan.
Certain ads featured celebrities, such as Tony Hawk, DJ Q-Bert, Yo-Yo Ma, Kelly Slater, Will Ferrell, and the members of De La Soul.
Campaign
The Switch campaign, while distinctive, was not very effective, and was gradually phased out in 2003. This can be somewhat blamed, however, for the Macintosh lineup as the iMac G3 was becoming obsolete while the new iMac G4 that was showcased was considerably more expensive than comparable Wintel offerings. The advertising concept of the Mac's advantages over the PC was dropped in favor for the Get a Mac campaign in 2006.
Due to the simplicity of the ad, many parodies surfaced on the net shortly after the campaign started. Most of the parodies lamented features they had lost due to the switch, such as the ability to play popular games and use of the right mouse button. In what seemed like a parody, but was not, Microsoft's marketing team created a Web page titled "Confessions of a Mac to PC Convert", but Microsoft removed the Web page because it was fraudulent and misleading, even to the point of having a stock photograph used.
The background music of the Switch Ads is "Spit" by John Murphy. The music was produced for TBWA Chiat Day by Kendall Marsh of Mental Music Productions, Sherman Oaks, CA.
See also
Get a Mac
Think different
References
External links
Mirror of Apple Switch advertisements
Spoofs of Apple Switch advertisements
Hunter Cressall's Mac Switch spoof
Spoof switch ads by the Phone Losers of America
Press release from the launch
Errol Morris had some of the unreleased spots on his site via the Internet Archive
Apple's Switch ads page via WayBack Machine
Apple Inc. advertising
American television commercials
2000s television commercials
Advertising campaigns |
https://en.wikipedia.org/wiki/Derived%20object | In computer programming, derived objects are files (intermediate or not) that are not directly maintained, but get created.
The most typical context is that of compilation, linking, and packaging of source files.
Depending on the revision control (SCM) system, they may be
completely ignored,
managed as second class citizens or
potentially considered the archetype of configuration items.
The second case assumes a reproducible process to produce them. The third case implies that this process is itself being managed, or in practice audited. Currently, only builds are typically audited, but nothing in principle prevents the extension of this to more general patterns of production. Derived objects may then have a real identity. Different instances of the same derived object may be discriminated generically from each other on the basis of their dependency tree.
Version control |
https://en.wikipedia.org/wiki/Les%20Grosses%20T%C3%AAtes | Les Grosses Têtes (;"The Big Heads" or "The Big Brains" in English) is a daily comedy radio programme on the French language RTL radio network. Broadcast since 1 April 1977, the current host since 2014 has been Laurent Ruquier.
Presently broadcast from 15:30 to 18:00 in France and Belgium (on Bel RTL) this show has several regular segments. The first quarter of the show is hard-hitting news and the next quarter deals with cultural issues. Then, for the next 30 minutes the host takes phone calls from listeners. Finally, guests are interviewed and joked about (these jokes are called gauloises on the show). Part of the format is when guests are asked questions sent in by the listeners, the most famous being Mme Leprieur.
History
In 2000, station managers thought that they could do without the services of their aging top host (animateur de référence) and replaced him with Christophe Dechavanne. The rapid loss of listeners showed that the program's success was due as much to the audience's attachment to the hosts as to its formula, which led to the return of Philippe Bouvard as host and producer of the show the following season. Since then, the show has been hosted by Laurent Ruquier.
On television
A TV version aired in 1985 on Antenne 2 to celebrate its 2500th show, followed by another in 1992 for the 5000th show on TF1. A regular TV version aired on TF1 from 1992 to 1997 on Saturday evenings, with the same principles as the radio show. It attracted 11.2 million viewers.
Les Grosses Tetes has had many more special TV shows since then on France 2.
Reception and criticism
Les Grosses Tetes is the most popular show on RTL. Nevertheless it has been criticised for its crude humour with elements of racism, sexism and homophobia.
On 27 March 1996, Philippe Bouvard, Vincent Perrot, and the president of TF1 Patrick Le Lay were fined for having provoked racial hatred by telling a riddle comparing Muslim women to robbers.
The Association of LGBT Journalists investigated the show in 2020, noting homophobic and sexist humour as well as jokes about Romanians and Roma being thieves, and Asian people being responsible for the COVID-19 pandemic.
Notable past members
Léon Zitrone
Carlos
Olivier de Kersauson
Jackie Sardou
Jean-Pierre Foucault
Jean Dutourd
Alice Sapritch
Michel Galabru
Jacques Martin
Jean-Claude Brialy
Jean Yanne
Sim
Thierry Roland
Pierre Bellemare
Philippe Chevallier
Amanda Lear
Macha Méril
Liane Foly
Current members of the panel
Jacques Balutin (since 1977)
Jacques Mailhot (1983, since 1997)
Bernard Mabille (1985 / 1991-1992, since 2001)
Chantal Ladesou (since 2010)
Jean-Jacques Peroni (since 1998)
Laurent Baffie (1992-1993 / 1998-1999, since 2013)
Isabelle Alonso (1996-2000, since 2014)
Pierre Bénichou (1999-2000, 2014-2020)
Michèle Bernier (1984, since 2014)
Jean-Pierre Coffe (1986-2010, 2014-2016)
Christophe Dechavanne (2000, since 2015)
Arielle Dombasle (since January 2016)
Michel Drucker (since 2014)
Danièle Évenou (sinc |
https://en.wikipedia.org/wiki/Daisy%20Systems | Daisy Systems Corporation, incorporated in 1981 in Mountain View, California, was a computer-aided engineering company, a pioneer in the electronic design automation (EDA) industry.
It was a manufacturer of computer hardware and software for EDA, including schematic capture, logic simulation, parameter extraction and other tools for printed circuit board design and semiconductor chip layout.
In mid-1980s, it had a subsidiary in Germany, Daisy Systems GmbH and one in Israel.
The company merged with Cadnetix Corporation of Boulder, Colorado in 1988, with the resulting company then known officially as Daisy/Cadnetix, Inc. with the trade name DAZIX. It filed for protection under Chapter 11 of the Federal Bankruptcy Code in 1990 and was acquired by Intergraph later that year. Intergraph incorporated DAZIX into its EDA business unit, which was later spun off as an independent subsidiary named VeriBest, Inc. VeriBest was ultimately acquired by Mentor Graphics in late 1999. The Veribest tool suite became Mentors flagship layout tool. Today it is known as Mentor Xpedition.
Daisy Systems was founded by Aryeh Finegold, David Stamm and Vinod Khosla; its original investors were Fred Adler and Oak Investment Partners.
Daisy along with Valid Logic Systems and Mentor Graphics, collectively known as DMV, added front end design to the existing computer-aided design aspects of computer automation.
People
Many notable people in the EDA industry once worked for Daisy Systems, including Harvey Jones, who became the CEO of Synopsys, and Vinod Khosla, who, a year later in 1982, co-founded Sun Microsystems. Aryeh Finegold went on to co-found Mercury Interactive, and Dave Stamm and Don Smith went on to co-found Clarify. Tony Zingale became CEO of Clarify and then CEO of Mercury Interactive and later CEO of Jive Software. Mike Schuh co-founded Intrinsa Corporation before joining Foundation Capital as General Partner. George T. Haber went on to work at Sun and later founded CompCore Multimedia, GigaPixel, Mobilygen and CrestaTech. Dave Millman and Rick Carlson founded EDAC (now ESD Alliance), the industry organization for Electronic Design Automation vendors.
Software
Daisy applications ran on the Daisy-DNIX operating system, a Unix-like operating system running on Intel 80286 and later processors.
In 1983
DABL (Daisy Behavioral Language) was developed at Daisy by Fred Chow. It was a hardware modelling language similar to VHDL.
The use of DABL for simulation models of processor interconnection networks is described by Lynn R. Freytag.
References
1981 establishments in California
1990 disestablishments in California
American companies established in 1981
American companies disestablished in 1990
Companies based in Mountain View, California
Computer companies established in 1981
Computer companies disestablished in 1990
Defunct companies based in the San Francisco Bay Area
Defunct computer companies of the United States
Electronic design automation companies |
https://en.wikipedia.org/wiki/Elizabeth%20Vargas | Elizabeth Anne Vargas (born September 6, 1962) is an American television journalist who is the lead investigative reporter/documentary anchor for A&E Networks, and the host for Fox's revival of America's Most Wanted. She began her new position on May 28, 2018, after being an anchor of ABC's television newsmagazine 20/20 and ABC News specials for the previous 14 years. She is also a news anchor for NewsNation, where she hosts Elizabeth Vargas Reports currently based in New York City.
In 2006 Vargas was co-anchor of World News Tonight alongside ABC News journalist Bob Woodruff.
Early life and education
Elizabeth Anne Vargas was born in Paterson, New Jersey, the daughter of an Italian-Spanish father, Rafael "Ralf" Vargas, a colonel in the U.S. Army from Puerto Rico, and an Irish-American mother, Anne Vargas, a part-time English teacher. She has two siblings, Amy and Christopher, who both work in tech in Silicon Valley. Her father was a U.S. army captain and moved the family to Okinawa when she was four years old. Vargas then spent much of her youth moving from post to post in Germany, Belgium, and the United States. Vargas graduated from an American high school in Heidelberg, where she realized her passion for journalism.
Vargas enrolled at the University of Missouri in Columbia in 1980 and graduated with a bachelor's degree in journalism in 1984, having served as a student reporter at KOMU-TV and a student editor at KBIA. Former advisors spoke well of her competency in her journalism work on campus; Rod Gelatt, former KOMU news director, noted that she was the first student to ever fill in for him as moderator of the station's Missouri Forum public affairs program and Kent Collins, chairman of the university's journalism faculty, remembered her "aggressive and energetic" work ethic.
Career
1984–1993: Career beginnings
After college, Vargas worked at Reno's CBS affiliate KTVN, before moving to Phoenix as a lead reporter for then-ABC affiliate KTVK-TV. After three years there, she moved to Chicago to work at CBS station WBBM-TV, where Phyllis McGrady, a senior vice president at ABC, said of her: "Elizabeth is one of the most flexible talents I've ever worked with. She could do interviews, and do hour-long specials that make you think, and then she'll do a great interview with P. Diddy. She is versatile." Vargas left WBBM-TV in 1993.
1993–1996: NBC News
In 1993, Vargas joined NBC News as a correspondent for Now with Tom Brokaw and Katie Couric. She later became a correspondent mainly for Dateline NBC, and also served as a substitute anchor for Today and the weekend editions of NBC Nightly News.
1996–2018: ABC News
In June 1996, she joined ABC News' Good Morning America as the newsreader and Joan Lunden's likely "heir apparent". In June 1997, ABC promoted Vargas to prime time magazine show correspondent, succeeded by Kevin Newman as newsreader. In 2002, she became one of the anchors of 20/20 Downtown, which was later rebranded Downtown before |
https://en.wikipedia.org/wiki/Aspen%20Music%20Festival%20and%20School | The Aspen Music Festival and School (AMFS) is a classical music festival held annually in Aspen, Colorado.
It is noted both for its concert programming and the musical training it offers to mostly young-adult music students. Founded in 1949, the typical eight-week summer season includes more than 400 classical music events—including concerts by five orchestras, solo and chamber music performances, fully staged opera productions, master classes, lectures, and children's programming—and brings in 70,000 audience members.
In the winter, the AMFS presents a small series of recitals and Metropolitan Opera Live in HD screenings.
As a training ground for young-adult classical musicians, the AMFS draws more than 650 students from 40 states and 34 countries, with an average age of 22. While in Aspen, students participate in lessons, coaching, and public performances in orchestras, operas, and chamber music, often playing side-by-side with AMFS artist-faculty.
The organization is currently led by President and CEO Alan Fletcher and Music Director Robert Spano.
History
The Aspen Music Festival and School was founded in 1949 by Chicago businessman Walter Paepcke and Elizabeth Paepcke as a two-week bicentennial celebration of the 18th-century German writer Johann Wolfgang von Goethe. The event, which included both intellectual forums and musical performances, was such a success that it led to the formation of both the Aspen Institute and the Aspen Music Festival and School.
In the summers that followed, the participating musicians returned, bringing their music students, and the foundation was set for the AMFS as it is known today. In 1950, Igor Stravinsky became the first conductor to present his own works with the Festival. The following year in 1951, the School enrolled its first official class, with 183 music students.
Early founding musicians included baritone Mack Harrell (father of cellist Lynn Harrell) and violinist Roman Totenberg (father of NPR legal correspondent Nina Totenberg). Early performance highlights include then-student James Levine conducting the Benjamin Britten opera Albert Herring in 1964, coinciding with Britten's visit to Aspen that summer to accept an award from the Aspen Institute. In 1965, Duke Ellington and his orchestra came to the AMFS to perform a benefit concert. In 1971, Dorothy DeLay joined the AMFS strings artist-faculty and attracted more than 200 students each summer to her program. In 1975, Aaron Copland came to Aspen as a composer-in-residence on the occasion of his 75th birthday. In 1980, John Denver performed with the Aspen Festival Orchestra for his TV special Music and the Mountains, which aired the following year on ABC. Multiple artist-faculty members have also recorded albums while in Aspen, including the Emerson String Quartet, which recorded the Shostakovich: The String Quartets 5-disc set from AMFS venue Harris Concert Hall and won the 2000 Grammy Award for Best Classical Album.
Music Directors
1954: |
https://en.wikipedia.org/wiki/Girlfriends%20%28American%20TV%20series%29 | Girlfriends is an American sitcom television series created by Mara Brock Akil that premiered on September 11, 2000, on UPN and aired on UPN's successor network, The CW, before being canceled in 2008. The final episode aired on February 11, 2008.
Episodes
Broadcast history
The series debuted on UPN on Monday September 11, 2000. After airing for several years on the network at 9/8C on Mondays, The CW moved Girlfriends to Sundays at 8/7C. After this, the ratings plummeted. On October 9, 2006, Girlfriends, along with The CW's other African-American programs, moved back to Mondays. At this point, Girlfriends returned to its original time slot.
While UPN was still airing new episodes of Girlfriends, the network also began airing reruns five days per week. When the show moved to The CW network after UPN merged with The WB network, MyNetwork TV (which was created to take over UPN's former affiliate stations) picked up the rights to air reruns of Girlfriends, although they eventually discontinued running them. WE tv, a network primarily focused on women's programming, later acquired exclusive rights to air the limited-release episodes on Sundays and exercised an option to not allow broadcast television networks re-broadcast rights to these reruns.
Due to the 2007–08 Writers Guild of America strike, the last episodes produced aired on February 11, 2008. The CW had announced plans to move the series to Sunday nights. However, it was later announced on February 13, 2008 that the series was cancelled after 8 seasons and a proper series finale would not be produced. A representative from The CW stated that the network was going to cancel the series due to low ratings and that it would have been too expensive to re-enter production.
A retrospective episode was in development to conclude the series but was later scrapped. The network had offered the actors only half of their usual episodic salary to take part, and the actors collectively turned the offer down.
Characters
Main
Joan Carol Clayton, Esq: (played by Tracee Ellis Ross) is considered the unofficial "den mother" of the group, as she frequently looks out for her friends, even at the expense of dealing with her own problems, which are plentiful throughout the series. Originally from Fresno, Joan owns a home in the Wilton Historic District. Joan met Toni when they were children and then met Lynn in college, and Maya is her assistant at the law firm. She has always had relationship problems and gave up her law career to pursue her dreams. She and Toni clash several times throughout the series, resulting in ending and then reconciling their friendship. Major incidents involved Joan inadvertently revealing Toni's cheating to Greg, and Joan's jealousy of Toni's marriage to Todd, but their friendship officially ends by the end of Season 6 when Joan fails to appear for Toni's custody hearing. For much of Season 7, Joan mourned the loss of her friendship with Toni, eventually opting to resent and belitt |
https://en.wikipedia.org/wiki/GNU%20Linear%20Programming%20Kit | The GNU Linear Programming Kit (GLPK) is a software package intended for solving large-scale linear programming (LP), mixed integer programming (MIP), and other related problems. It is a set of routines written in ANSI C and organized in the form of a callable library. The package is part of the GNU Project and is released under the GNU General Public License.
GLPK uses the revised simplex method and the primal-dual interior point method for non-integer problems and the branch-and-bound algorithm together with Gomory's mixed integer cuts for (mixed) integer problems.
History
GLPK was developed by Andrew O. Makhorin (Андрей Олегович Махорин) of the Moscow Aviation Institute. The first public release was in October 2000.
Version 1.1.1 contained a library for a revised primal and dual simplex algorithm.
Version 2.0 introduced an implementation of the primal-dual interior point method.
Version 2.2 added branch and bound solving of mixed integer problems.
Version 2.4 added a first implementation of the GLPK/L modeling language.
Version 4.0 replaced GLPK/L by the GNU MathProg modeling language, which is a subset of the AMPL modeling language.
Interfaces and wrappers
Since version 4.0, GLPK problems can be modeled using GNU MathProg (GMPL), a subset of the AMPL modeling language used only by GLPK. However, GLPK is most commonly called from other programming languages. Wrappers exist for:
Julia and the JuMP modeling package
Java (using OptimJ)
Further reading
The book uses GLPK exclusively and contains numerous examples.
References
External links
GLPK official site
GLPK Wikibook
Linear Programming Kit
Mathematical optimization software
Free mathematics software
Free software programmed in C
Mathematics software for Linux |
https://en.wikipedia.org/wiki/Rail%20transport%20in%20Australia | Rail transport in Australia is a component of the Australian transport system. It is to a large extent state-based, as each state largely has its own operations, with the interstate network being developed ever since Australia's federation in 1901. , the Australian rail network consists of a total of of track built to three major track gauges: of standard gauge (1435 mm / 4 ft 8 in), of broad gauge (1600 mm / 5 ft 3 in), and of narrow gauge (1067 mm / 3 ft 6 in) lines. Additionally, about of 610 mm / 2 ft gauge lines support the sugar-cane industry. , around 11 per cent of the Australian heavy railways network route-kilometres are electrified.
Except for a small number of private railways, most of the Australian railway network infrastructure is government-owned, either at the federal or state level. The Australian federal government is involved in the formation of national policies, and provides funding for national projects.
National issues
Uniform gauge
Very little thought was given in the early years of the development of the colony-based rail networks of Australia-wide interests. The most obvious issue to arise was determining a track gauge. Despite advice from London to adopt a uniform gauge, should the lines of the various colonies ever meet, gauges were adopted in different colonies, and indeed within colonies, without reference to those of other colonies. This has caused problems ever since.
Attempts to fix the gauge problem are by no means complete. For example, the Mount Gambier line is isolated by gauge and of no operational value.
Electrification
With the electrification of suburban networks, which began in 1919, a consistent electric rail traction standard was not adopted. Electrification began in Melbourne in 1919 using 1500 V DC. Sydney's lines were electrified from 1926 using 1500 V DC, Brisbane's from 1979 using 25 kV AC, and Perth's from 1992 using 25 kV AC. There has also been extensive non-urban electrification in Queensland using 25 kV AC, mainly during the 1980s for the coal routes. From 2014 Adelaide's lines are being gradually electrified at 25 kV AC. 25 kV AC voltage has now become the international standard.
History
The first railways in Australia were built by private companies, based in the then colonies of New South Wales, Victoria and South Australia.
The first railway was privately owned and operated and commissioned by the Australian Agricultural Company in Newcastle in 1831, a cast-iron fishbelly rail on an inclined plane as a gravitational railway servicing A Pit coal mine. The first steam-powered line opened in Victoria in 1854. The four km long Flinders Street to Sandridge line was opened by the Melbourne & Hobson's Bay Railway Company at the height of the Victorian gold rush.
In these early years there was very little thought of Australia-wide interests in developing the colony-based networks. The most obvious issue to arise was determining a uniform gauge for the continent. Despite advice fr |
https://en.wikipedia.org/wiki/Austext | Austext is the former Australian teletext service based in Brisbane, Queensland. The service was carried and operated by the Seven Network and its affiliates over most of Australia. It carried news, financial information, weather, lottery results, a TV guide and other information, as well as closed captioning for programs. The service was freely available for viewing on any television, computer or other device with teletext functionality and the ability to access and view Channel Seven, or one of Seven's regional affiliates Prime, GWN or Southern Cross. Seven first began test Teletext services in 1977 with useful information being transmitted in 1982 in Brisbane and Sydney. Austext was shut down in September 2009.
Over the years, the service has had various names including SevenTel.
Content
The information available on Austext pages included the latest in news, weather, racing, general interests and a television guide. Also available are contact details for Austext and state deaf associations.
The news pages include the latest in business, national news, international news, sport, science and technology, and showbiz.
The weather pages include same day forecast capital city temperatures, same day forecast conditions and minimum/maximum temperatures as well as current temperature, humidity, dew point, wind speed, wind direction, sunrise and sunset times, and an outlook for the next five days for major centres across Australia which was all supplied by the Bureau of Meteorology. The racing pages included a national TAB racing index which ceased operation on 4 August 2009. The general interest pages included items such as lottery results, daily horoscopes and a joke of the day. The service also carried a TV guide with listings for the Seven Network in its five metropolitan markets, as well as listings for other networks, both metropolitan and regional, until 2007 when they disappeared.
Closed captioning for programs on the Seven Network's channels are also included in the Austext system. When produced by the Australian Caption Centre, they were branded as "Supertext". To access closed captions through Austext, viewers enter the navigation code number 801 on an analog television or by pressing the Text, CC, Subtitle or a designated coloured button (depending on make and model) on their digital set top box or television.
Closure
In July 2009 Seven announced that Austext would shut down on 30 September 2009. This was due to claims from the network that the technology had come to the end of its useful service life and is not commercially viable to replace. Seven also noted the wide availability of alternate sources of information now accessible to viewers such as Seven's own websites. Despite the closure, closed captioning services continued to remain available.
The onscreen closedown notice read:
See also
Ceefax
List of teletext services
References
Seven Network
Teletext
Mass media in Brisbane
1977 in Australian television
1982 in Australia |
https://en.wikipedia.org/wiki/Random-access%20channel | A random-access channel (RACH) is a shared channel used by wireless terminals to access the mobile network (TDMA/FDMA, and CDMA based network) for call set-up and bursty data transmission. Whenever mobile wants to make an MO (Mobile Originating) call it schedules the RACH. RACH is transport-layer channel; the corresponding physical-layer channel is PRACH.
RACH for GSM standard
Since RACH is shared, there is a probability that two or more mobiles transmit at the same time and their transmissions collide in the medium (air) and they will not be granted access to the network. This happens because limit for number of mobiles transmitting in one RACH time slot is not defined in the GSM standard. If collision happens then mobile waits for random period of time and transmits the RACH again. RACH uses GSM 51 frame multiframe structure in the uplink to transmit information. Mostly TS1 is used but in high capacity GSM cell areas, TS2, TS4 and TS6 is also used for RACH leaving TS0 (mainly used for broadcast frequency).
A random-access channel like that of mobile phone networks is also used in the OpenAirMesh network, between cluster heads and mesh routers.
A key feature of a random-access channel is that messages are not scheduled (compared to, for example, a "dedicated channel" in UMTS, which is assigned exclusively to one user at a time). There is no certainty that only a single device makes a connection attempt at one time, so collisions can result.
References
External links
Cell Access
RACH Procedure
Channel access methods |
https://en.wikipedia.org/wiki/Service%20Access%20Point | A Service Access Point (SAP) is an identifying label for network endpoints used in Open Systems Interconnection (OSI) networking.
The SAP is a conceptual location at which one OSI layer can request the services of another OSI layer. As an example, PD-SAP or PLME-SAP in IEEE 802.15.4 can be mentioned, where the medium access control (MAC) layer requests certain services from the physical layer. Service access points are also used in IEEE 802.2 Logical Link Control in Ethernet and similar data link layer protocols.
When using the OSI Network system (CONS or CLNS), the base for constructing an address for a network element is an NSAP address, similar in concept to an IP address. OSI protocols as well as Asynchronous Transfer Mode (ATM) can use Transport (TSAP), Session (SSAP) or Presentation (PSAP) Service Access Points to specify a destination address for a connection. These SAPs consist of NSAP addresses combined with optional transport, session and presentation selectors, which can differentiate at any of the three layers between multiple services at that layer provided by a network element.
OSI protocols |
https://en.wikipedia.org/wiki/Build%20order | In strategy computer games, of both the turn-based and real-time varieties, a build order is a linear pattern of production, research, and resource management aimed at achieving a specific and specialized goal. They are analogous to chess openings, in that a player will have a specific order of play in mind, however the amount the build order, the strategy around which the build order is built or even which build order is then used varies on the skill, ability and other factors such as how aggressive or defensive each player is.
Often, the name of a build order usually reflects two key aspects therein:
The desired goal of the entire build order.
The key management decisions involved in the build order.
Evidence of this can be found in the following examples:
Six-Pool Rush (StarCraft) – Six-Pool being the management decision (build a Spawning Pool immediately after reaching supply level 6), rush implying production of zerglings quickly.
4 Warp Gate Push (StarCraft II) – opening in which the goal is to have a Warp Gate and 4 gateways and then push (attack the enemy).
Rule of Ten (Warhammer 40,000: Dawn of War) – Ten being the desired production goal of infantry units.
Oranos 4:30 (Age of Mythology: The Titans) – 4:30 being the desired time to reach tech level 2.
4ES (Company of Heroes) - 4ES standing for 4 Engineers and a Sniper (a unique American opening);
Fast Armored Car (Company of Heroes) – the objective being to get an Armored Car before the opponent has reached the same tech level.
Riflestall (Company of Heroes) – the objective being to use the power and flexibility of Riflemen squads to hold off the opponent before pulling out higher-tech units.
Piospam (Company of Heroes) – the objective being to produce large numbers of Pioneers and nothing else, until higher tier.
Expansion first (generic): start by creating a new economic base, prioritizing your economy output rather than defensive or offensive units. This is usually easily countered if your opponent if going for an early-aggression build order.
Strategy computer games typically offer a player many choices in which structures to build, units to train, and which technologies to research. Each technology that a player researches will open up more options, but may or may not, depending on the computer game the player is playing, close off the paths to other options. A tech tree is the representation of all possible paths of research a player can take. Analysis of the tech tree leads to specific paths that a player can take to optimally advance specific strategic or tactical goals. These optimized paths are build orders.
For example, a player who plans to launch an attack by air may only build the structures necessary to construct air units and may research only the technologies which enhance the capabilities of air units. The order in which to build those structures and research those technologies is known as a build order. The same player could instead choose a slightly d |
https://en.wikipedia.org/wiki/File%20system | In computing, a file system or filesystem (often abbreviated to fs) is a method and data structure that the operating system uses to control how data is stored and retrieved. Without a file system, data placed in a storage medium would be one large body of data with no way to tell where one piece of data stopped and the next began, or where any piece of data was located when it was time to retrieve it. By separating the data into pieces and giving each piece a name, the data are easily isolated and identified. Taking its name from the way a paper-based data management system is named, each group of data is called a "file". The structure and logic rules used to manage the groups of data and their names is called a "file system."
There are many kinds of file systems, each with unique structure and logic, properties of speed, flexibility, security, size and more. Some file systems have been designed to be used for specific applications. For example, the ISO 9660 and UDF file systems are designed specifically for optical discs.
File systems can be used on many types of storage devices using various media. As of 2019, hard disk drives have been key storage devices and are projected to remain so for the foreseeable future. Other kinds of media that are used include SSDs, magnetic tapes, and optical discs. In some cases, such as with tmpfs, the computer's main memory (random-access memory, RAM) is used to create a temporary file system for short-term use.
Some file systems are used on local data storage devices; others provide file access via a network protocol (for example, NFS, SMB, or 9P clients). Some file systems are "virtual", meaning that the supplied "files" (called virtual files) are computed on request (such as procfs and sysfs) or are merely a mapping into a different file system used as a backing store. The file system manages access to both the content of files and the metadata about those files. It is responsible for arranging storage space; reliability, efficiency, and tuning with regard to the physical storage medium are important design considerations.
Origin of the term
From and before the advent of computers the terms file system and system for filing were used to describe a method of storing and retrieving paper documents. By 1961, the term file system was being applied to computerized filing alongside the original meaning. By 1964, it was in general use.
Architecture
A file system consists of two or three layers. Sometimes the layers are explicitly separated, and sometimes the functions are combined.
The logical file system is responsible for interaction with the user application. It provides the application program interface (API) for file operations — OPEN, CLOSE, READ, etc., and passes the requested operation to the layer below it for processing. The logical file system "manage[s] open file table entries and per-process file descriptors". This layer provides "file access, directory operations, [and] security and protect |
https://en.wikipedia.org/wiki/Smart%20File%20System | The Smart File System (SFS) is a journaling filesystem used on Amiga computers and AmigaOS-derived operating systems (though some support also exists for IBM PC compatibles). It is designed for performance, scalability and integrity, offering improvements over standard Amiga filesystems as well as some special or unique features.
Features
SFS uses block sizes ranging from 512 (29) to 32768 (215) bytes with a maximum partition size of 128 GB.
Its good performance, better than FFS, and lack of need for long "validation" in case of an error, is achieved by grouping multiple directory entries into a single block and by grouping meta data blocks together into clusters. A bitmap is used to keep track of free space, and file data is kept track of using extents arranged into a B+ tree structure.
Integrity is maintained by keeping a transaction log of all changes made to metadata over a certain period of time. The log is written to disk first into free space and then meta data blocks are overwritten directly. Should the system crash, the next time the filesystem is mounted it will notice the uncompleted operation and roll it back to the last known consistent state. For performance reasons, only metadata integrity is ensured. Actual data in files can still be corrupted if a write operation is terminated halfway through. Unlike the original Amiga filesystems, FFS and OFS, filesystem integrity is very rarely compromised by this.
One feature of SFS that is almost unique among Amiga filesystems is its ability to defragment itself while the filesystem is in use, even for locked files. The defragmentation process is almost completely stateless (apart from the location it is working on), which means it can be stopped and started instantly. During defragmentation data integrity is ensured of both meta data and normal data. The filesystem may attempt to move a whole file to a different location when fragmentation is going to occur otherwise.
The filesystem offers a directory containing deleted files for recovery.
History
SFS is written in C and was originally created and released as freeware in 1998 by John Hendrikx. After the original author left the Amiga scene in 2000, the source code to SFS was released and its development continued by Ralph Schmidt in MorphOS.
Since May 2005 SFSobjec and SFSconfig are available under the GPL license. SFS development has now forked; as well as the original Amiga version, there are now versions for MorphOS, AROS, AmigaOS 3, and a version for AmigaOS 4, which have different feature sets but remain compatible to each other. In addition, there is a driver for Linux to read (experimental to write) Amiga SFS volumes, GRUB natively supports it, and there are free drivers to use it from UEFI.
, SFS was one of the independent filesystems still being used on Amiga computers.
Versions for AROS, AmigaOS and MorphOS are based on different branches. The Linux version is independent code.
See also
Amiga Old File Syste |
https://en.wikipedia.org/wiki/Computer%20Professionals%27%20Union | Computer Professionals' Union (CPU or CP-Union) is a mass organization of information and communications technology (ICT) professionals, practitioners, and workers in the Philippines. It is registered in the Philippines as a non-stock, non-profit, non-government organization that promotes activist ICT principles and organize ICT professionals to provide ICT services to Filipino people. Their office is located at Quezon City and their current National Coordinator is Rick Bahague.
Some of CPU initiatives include Software Freedom Day celebration in the Manila, promotion of Free and Open Source Software including Drupal, and collaboration with Wikimedia Philippines.
History
The organization was started in 2001 by a group of information communications technology practitioners. They officially registered under the Philippine Securities and Exchange Commission in 2008 as a non-profit and non-stock corporation.
Activism
CPU is notable for its belief that the ICT sector in the Philippines is controlled and dominated by foreign monopoly capitalists, which stunts the growth and development of Filipino technology and economy. CPU supports a truly nationalist and democratic government that will advance and promote a people's ICT. CPU believes that, like farmers, workers, and other sectors in the country, ICT workers also need to organize in order to advance their specific needs.
A year before the 2010 Philippine general elections, CPU warns sophisticated cheating with the Philippines' first automated polls. They had hosted a national conference in University of the Philippines in Diliman, Quezon City to discuss the automated election system (AES). Rick Bahague, CPU National Coordinator said that the goal of the conference was to gather experiences and best practices in technologies relevant to AES. He further said that software bugs in the AES system can affect machines to be used in the elections and the automated election system is vulnerable to manipulation from inside or outside attacks.
During the height of the protests against Stop Online Piracy Act (SOPA) and PROTECT IP Act (PIPA) in January 2012, CPU expressed strong opposition to it. They said that SOPA and PIPA that were being pushed in the United States Congress attack free speech and expression and would have impacts to human rights groups, bloggers, advocacy groups and all content creators in the web. They believed that any website can be closed without due process.
In September 2012, Philippine President Aquino signed the Cybercrime Prevention Act of 2012 enacted by 15th Congress of the Philippines. The law had led numerous sectors including Computer Professionals' Union to protest it. According to CPU, sections of the law may have various interpretations that may lead to intentional or non-intentional misinterpretations by State authorities wherein computer users can be punished without due process. They further said that Section 19 of the law has become far worse than SOPA and PIPA.
O |
https://en.wikipedia.org/wiki/Reflected-wave%20switching | Reflected-wave switching is a signalling technique used in backplane computer buses such as PCI.
A backplane computer bus is a type of multilayer printed circuit board that has at least one (almost) solid layer of copper called the ground plane, and at least one layer of copper tracks that are used as wires for the signals. Each signal travels along a transmission line formed by its track and the narrow strip of ground plane directly beneath it. This structure is known in radio engineering as microstrip line.
Each signal travels from a transmitter to one or more receivers. Most computer buses use binary digital signals, which are sequences of pulses of fixed amplitude. In order to receive the correct data, the receiver must detect each pulse once, and only once. To ensure this, the designer must take the high-frequency characteristics of the microstrip into account.
When a pulse is launched into the microstrip by the transmitter, its amplitude depends on the ratio of the impedances of the transmitter and the microstrip. The impedance of the transmitter is simply its output resistance. The impedance of the microstrip is its characteristic impedance, which depends on its dimensions and on the materials used in the backplane's construction. As the leading edge of the pulse (the incident wave) passes the receiver, it may or may not have sufficient amplitude to be detected. If it does, then the system is said to use incident-wave switching. This is the system used in most computer buses predating PCI, such as the VME bus.
When the pulse reaches the end of the microstrip, its behaviour depends on the circuit conditions at this point. If the microstrip is correctly terminated (usually with a combination of resistors), the pulse is absorbed and its energy is converted to heat. This is the case in an incident-wave switching bus. If, on the other hand, there is no termination at the end of the microstrip, and the pulse encounters an open circuit, it is reflected back towards its source. As this reflected wave travels back along the microstrip, its amplitude is added to that of the original pulse. As the reflected wave passes the receiver for a second time, this time from the opposite direction, it now has enough amplitude to be detected. This is what happens in a reflected-wave switching bus.
In incident-wave switching buses, reflections from the end of the bus are undesirable and must be prevented by adding termination. Terminating an incident-wave trace varies in complexity from a DC-balanced, AC-coupled termination to a single resistor series terminator, but all incident wave terminations consume both power and space (Johnson and Graham, 1993). However, incident-wave switching buses can be significantly longer than reflected-wave switching buses operating at the same frequency.
If the limited bus length is acceptable, a reflected-wave switching bus will use less power, and fewer components to operate at a given frequency. The bus |
https://en.wikipedia.org/wiki/BTC | BTC may refer to:
Organizations
BAL Bashkirian Airlines (ICAO code)
Behavior Tech Computer, a Taiwanese computer hardware manufacturer
Belize Trans Colours, a Belizean LGBT rights organisation
Bodoland Territorial Council
Botswana Telecommunications Corporation
British Transport Commission
BTC (Bahamas), a telecommunications provider
Bulgarian Telecommunications Company, the former name of Vivacom
Busan Transportation Corporation, in Busan, South Korea
Education
Balderstone Technology College
Baptist Theological College of Southern Africa
Bellingham Technical College
Belmont Technical College
Blackhawk Technical College
Places
BTC City, a shopping and other use area in Ljubljana, Slovenia
Batticaloa Airport (IATA code)
Britomart Transport Centre, New Zealand
Bucharest Tower Center, a building in Romania
Bellevue Transit Center, the busiest bus stop in Washington state
Science and technology
Biochemistry
Betacellulin, a protein encoded by the BTC gene
Chemistry
Trimesic acid, or benzene-1,3,5-tricarboxylic acid, a chemical compound
Triphosgene, or bis-(trichloromethyl)carbonate, a chemical compound
Computing
Bit Test and Complement, an instruction in the X86 instruction set
Bitcoin (ticker symbol), a cryptocurrency
Block Truncation Coding, a lossy image compression technique
Sport
Budapesti TC, Hungarian football team
Bowerman Track Club, elite distance running group in Oregon, US
Other uses
Baku–Tbilisi–Ceyhan pipeline
Bicycle Torque Coupling
BTC Touring, specification of racing car formerly used in the British Touring Car Championship
Busch Tennis Courts, former name of the Millie West Tennis Facility
Curtiss XBTC, an airplane |
https://en.wikipedia.org/wiki/Method%20overriding | Method overriding, in object-oriented programming, is a language feature that allows a subclass or child class to provide a specific implementation of a method that is already provided by one of its superclasses or parent classes. In addition to providing data-driven algorithm-determined parameters across virtual network interfaces, it also allows for a specific type of polymorphism (subtyping). The implementation in the subclass overrides (replaces) the implementation in the superclass by providing a method that has same name, same parameters or signature, and same return type as the method in the parent class. The version of a method that is executed will be determined by the object that is used to invoke it. If an object of a parent class is used to invoke the method, then the version in the parent class will be executed, but if an object of the subclass is used to invoke the method, then the version in the child class will be executed. This helps in preventing problems associated with differential relay analytics which would otherwise rely on a framework in which method overriding might be obviated. Some languages allow a programmer to prevent a method from being overridden.
Language-specific examples
Ada
Ada provides method overriding by default.
To favor early error detection (e.g. a misspelling),
it is possible to specify when a method
is expected to be actually overriding, or not. That will be checked by the compiler.
type T is new Controlled with ......;
procedure Op(Obj: in out T; Data: in Integer);
type NT is new T with null record;
overriding -- overriding indicator
procedure Op(Obj: in out NT; Data: in Integer);
overriding -- overriding indicator
procedure Op(Obj: in out NT; Data: in String);
-- ^ compiler issues an error: subprogram "Op" is not overriding
C#
C# does support method overriding, but only if explicitly requested using the modifiers and or .
abstract class Animal
{
public string Name { get; set; }
// Methods
public void Drink();
public virtual void Eat();
public void Go();
}
class Cat : Animal
{
public new string Name { get; set; }
// Methods
public void Drink(); // Warning: hides inherited drink(). Use new
public override void Eat(); // Overrides inherited eat().
public new void Go(); // Hides inherited go().
}
When overriding one method with another, the signatures of the two methods must be identical (and with same visibility). In C#, class methods, indexers, properties and events can all be overridden.
Non-virtual or static methods cannot be overridden. The overridden base method must be virtual, abstract, or override.
In addition to the modifiers that are used for method overriding, C# allows the hiding of an inherited property or method. This is done using the same signature of a property or method but adding the modifier in front of it.
In the above example, hiding causes th |
https://en.wikipedia.org/wiki/Double%20dispatch | In software engineering, double dispatch is a special form of multiple dispatch, and a mechanism that dispatches a function call to different concrete functions depending on the runtime types of two objects involved in the call. In most object-oriented systems, the concrete function that is called from a function call in the code depends on the dynamic type of a single object and therefore they are known as single dispatch calls, or simply virtual function calls.
Dan Ingalls first described how to use double dispatching in Smalltalk, calling it multiple polymorphism.
Overview
The general problem addressed is how to dispatch a message to different methods depending not only on the receiver but also on the arguments.
To that end, systems like CLOS implement multiple dispatch. Double dispatch is another solution that gradually reduces the polymorphism on systems that do not support multiple dispatch.
Use cases
Double dispatch is useful in situations where the choice of computation depends on the runtime types of its arguments. For example, a programmer could use double dispatch in the following situations:
Sorting a mixed set of objects: algorithms require that a list of objects be sorted into some canonical order. Deciding if one element comes before another element requires knowledge of both types and possibly some subset of the fields.
Adaptive collision algorithms usually require that collisions between different objects be handled in different ways. A typical example is in a game environment where the collision between a spaceship and an asteroid is computed differently from the collision between a spaceship and a spacestation.
Painting algorithms that require the intersection points of overlapping sprites to be rendered in a different manner.
Personnel management systems may dispatch different types of jobs to different personnel. A schedule algorithm that is given a person object typed as an accountant and a job object typed as engineering rejects the scheduling of that person for that job.
Event handling systems that use both the event type and the type of the receptor object in order to call the correct event handling routine.
Lock and key systems where there are many types of locks and many types of keys and every type of key opens multiple types of locks. Not only do you need to know the types of the objects involved, but the subset of "information about a particular key that are relevant to seeing if a particular key opens a particular lock" is different between different lock types.
A common idiom
The common idiom, as in the examples presented above, is that the selection of the appropriate algorithm is based on the call's argument types at runtime. The call is therefore subject to all the usual additional performance costs that are associated with dynamic resolution of calls, usually more than in a language supporting only single method dispatch. In C++, for example, a dynamic function call is usually resolved by a single of |
https://en.wikipedia.org/wiki/Jakarta%20Connectors | Jakarta Connectors (JCA; formerly known as Java EE Connector Architecture and J2EE Connector Architecture) are a set of Java programming language tools designed for connecting application servers and enterprise information systems (EIS) as part of enterprise application integration (EAI). While JDBC is specifically used to establish connections between Java applications and databases, JCA provides a more versatile architecture for connecting to legacy systems. JCA was developed through the Java Community Process, with versions including JSR 16 (JCA 1.0), JSR 112 (JCA 1.5), and JSR 322 (JCA 1.6).
JCA and Java EE
J2EE Version 1.3 requires application servers to support JCA Version 1.0.
J2EE Version 1.4 requires application servers to support JCA Version 1.5.
Java EE Version 6 requires application servers to support JCA version 1.6.
Contracts
The Jakarta Connector Architecture defines a standard for connecting a compliant application server to an EIS. It defines a standard set of system-level contracts between the Jakarta EE application server and a resource adapter. The system contracts defined by Version 1.0 of the J2EE Connector Architecture are described by the specification as follows:
Connection management Connection management enables an application server to pool connections to the underlying EIS and enables application components to connect. This leads to a scalable application environment that can support a large number of clients.
Transaction management
Transaction management enables an application server to use a transaction manager to manage transactions across multiple resource managers. This contract also supports transactions that are managed internal to an EIS resource manager without the necessity of involving an external transaction manager.
Security management Security management reduces security threats to the EIS and protects valuable information resources managed by the EIS.
JCA Version 1.5 adds system contracts to the specification as follows:
Life cycle management Life cycle management enables an application server to manage the life cycle of a resource adapter from initiation through upgrades to obsolescence. This contract provides a mechanism for the application server to bootstrap a resource adapter instance during its deployment or application server startup, and to notify the resource adapter instance during its withdrawal or during an orderly shutdown.
Work management Work management enables a resource adapter to do work (monitor network endpoints, invoke application components, and so on) by submitting work instances to an application server for execution. The application server dispatches threads to execute submitted work instances. This allows a resource adapter to avoid creating or managing threads directly, and allows an application server to efficiently pool threads and have more control over its runtime environment. The resource adapter can control the transaction context with which work instances ar |
https://en.wikipedia.org/wiki/Granny%27s%20Garden | Granny's Garden is an educational adventure game for the British BBC Micro computer, released in 1983. It served as a first introduction to computers for many schoolchildren in the United Kingdom during the 1980s and 1990s. According to the 4Mation webpage about the original version, it was the reason many teachers decided that computers had a real place in education. The software is still available in its original and updated formats.
Created by Mike Matson for 4Mation, the game takes place in the Kingdom of the Mountains. The aim is to find the six missing children of the King and Queen, while avoiding the evil witch, by solving puzzles.
References
External links
Granny's Garden
Retro Granny's Garden
1983 video games
Acorn Archimedes games
Amiga games
Amstrad CPC games
BBC Micro and Acorn Electron games
Children's educational video games
Commodore 64 games
IOS games
Classic Mac OS games
MacOS games
Video games developed in the United Kingdom
Windows games
Video games about witchcraft
ZX Spectrum games |
https://en.wikipedia.org/wiki/Eumetcast | EUMETCast is a method of disseminating various (mainly satellite based) meteorological data operated by the European Organisation for the Exploitation of Meteorological Satellites (EUMETSAT). The main purpose is the dissemination of EUMETSAT's own data, but various data from other providers are broadcast as well.
EUMETCast is a contribution to GEONETCast and IGDDS (WMO's Integrated Global Data Dissemination Service) and provides data for GEOSS and GMES.
Services
EUMETCast satellite includes data and derived products from the geostationary Meteosat satellites, Meteosat-7 (over the Indian Ocean), 8, 9 and 10 and the Metop-A, B & C and NOAA polar orbiting satellites, plus data from other meteorological programmes, such as Jason-2 (the Ocean Surface Topography Mission).
Examples of data and products on EUMETCast satellite:
Space-based observations from the Meteosat, Metop, Jason-2 satellites. At their most frequent, these data are delivered to users within five minutes of processing.
Land application products covering Europe, Africa and South America.
Global and regional marine meteorological and ocean surface products.
Atmospheric chemistry products
A range of third-party meteorological and environmental products are also available. The range includes:
Level 1 satellite data and derived products from a range of atmospheric, marine and land monitoring satellites (e.g. GOES-E & GOES-W, S-NPP, Himawari, FY2, Saral, Mega-Tropiques Aqua/Terra MODIS, Sentinel)
European Commission Copernicus and FP7 funded data and products
In-situ observational data
Numerical weather forecasts
In 2016 EUMETSAT started a demonstration EUMETCast Terrestrial service, which sends multicast satellite data in Europe via the National Research and Education Network (NRENs) and the GÉANT infrastructure. Only organisations eligible for access to a NRENs can access the service, if the NREN supports multicasting.
The terrestrial service will re-use components familiar to users of the EUMETCast satellite service and then, as for EUMETCast satellite, subscribes to the related multicast channels to receive the data.
Transmission technology
EUMETCast uses the DVB-S MPEG2 stream for encapsulating IP frames (IP over DVB). At this IP layer, IP Multicast techniques are used for distributing the file based content. For this purpose, TelliCast (an IP multicast software from Newtec (formerly Tellitec)) is used. In 2014 EUMETCast was migrated to a DVB-S2 transponder, which allows for higher bandwidth rates, and in 2017 a second DVB-S2 transponder was added for the European service providing Sentinel satellite data.
Transmission is via Eutelsat's 10A satellite (in Ku band), Eutelsat's 5 WEST A satellite (C band) and SES-6 (C band).
Eutelsat 10A supplies coverage across Europe, North Africa and the Middle East. Eutelsat 5 supplies European African and western Asia coverage. SES-6 is located at 319.5º East, its tailored, high-powered hemispheric beam provides simult |
https://en.wikipedia.org/wiki/Multilevel%20security | Multilevel security or multiple levels of security (MLS) is the application of a computer system to process information with incompatible classifications (i.e., at different security levels), permit access by users with different security clearances and needs-to-know, and prevent users from obtaining access to information for which they lack authorization. There are two contexts for the use of multilevel security. One is to refer to a system that is adequate to protect itself from subversion and has robust mechanisms to separate information domains, that is, trustworthy. Another context is to refer to an application of a computer that will require the computer to be strong enough to protect itself from subversion and possess adequate mechanisms to separate information domains, that is, a system we must trust. This distinction is important because systems that need to be trusted are not necessarily trustworthy.
Trusted operating systems
An MLS operating environment often requires a highly trustworthy information processing system often built on an MLS operating system (OS), but not necessarily. Most MLS functionality can be supported by a system composed entirely from untrusted computers, although it requires multiple independent computers linked by hardware security-compliant channels (see section B.6.2 of the Trusted Network Interpretation, NCSC-TG-005). An example of hardware enforced MLS is asymmetric isolation. If one computer is being used in MLS mode, then that computer must use a trusted operating system (OS). Because all information in an MLS environment is physically accessible by the OS, strong logical controls must exist to ensure that access to information is strictly controlled. Typically this involves mandatory access control that uses security labels, like the Bell–LaPadula model.
Customers that deploy trusted operating systems typically require that the product complete a formal computer security evaluation. The evaluation is stricter for a broader security range, which are the lowest and highest classification levels the system can process. The Trusted Computer System Evaluation Criteria (TCSEC) was the first evaluation criteria developed to assess MLS in computer systems. Under that criteria there was a clear uniform mapping between the security requirements and the breadth of the MLS security range. Historically few implementations have been certified capable of MLS processing with a security range of Unclassified through Top Secret. Among them were Honeywell's SCOMP, USAF SACDIN, NSA's Blacker, and Boeing's MLS LAN, all under TCSEC, 1980s vintage and Intel 80386-based. Currently, MLS products are evaluated under the Common Criteria. In late 2008, the first operating system (more below) was certified to a high evaluated assurance level: Evaluation Assurance Level (EAL) - EAL 6+ / High Robustness, under the auspices of a U.S. government program requiring multilevel security in a high threat environment. While thi |
https://en.wikipedia.org/wiki/KTVQ | KTVQ (channel 2) is a television station in Billings, Montana, United States, affiliated with CBS. Owned by the E. W. Scripps Company, it is part of the Montana Television Network, a statewide network of CBS-affiliated stations. KTVQ's studios are located on Third Avenue North in Billings, and its transmitter is located on Sacrifice Cliff southeast of downtown.
History
The Montana Network, owner of radio station KOOK (970 AM), applied on December 13, 1952, for a construction permit to build a new TV station on channel 2 in Billings, which was granted by the Federal Communications Commission (FCC) on February 4, 1953. The turnaround time was short considering that Robert S. Howard, who owned Scripps-associated radio and newspaper holdings in Utah and Idaho, had also applied for channel 2, but his firm dropped its bid and cleared the way for The Montana Network. KOOK had already revealed it had held an option for two years to build a transmitter site on Coburn Hill. Ground was broken on the studio and transmitter facilities there in early June, and programming from KOOK-TV began on November 9, 1953. It was the third station in the state: Butte's KXLF-TV had begun in August, and a second station, KOPR-TV, had started there at about the same time. KOOK-TV was affiliated with CBS, ABC and the DuMont Television Network at launch.
In December 1956, Joseph Sample acquired majority control of KOOK radio and television from its previous ownership, headed by Charles L. Crist, a state representative. A year later, KOOK broke ground on a new radio and television center in downtown Billings, which was completed in 1959; three homes were moved off the property before construction began. By the time the building was completed, a second television station, KGHL-TV (channel 8, now KULR-TV), had begun in 1958.
Sample later expanded his holdings across the state. In 1961, he acquired KXLF in Butte; in 1969, he purchased KRTV in Great Falls, giving his Garryowen Broadcasting coverage of half the state's population. The Montana Television Network was formed that same year from these stations and KPAX-TV in Missoula, which was built in 1970. In 1972, seeking to get ahead of a proposed FCC rule that would have barred radio-television cross-ownership, Sample sold KOOK radio; the call letters were retained by the radio station, and the television station changed its call sign to KTVQ on September 5, 1972. The new designation was chosen because the station had exhausted its preferred options, it was available, "Q2" (which became the station's moniker) was a branding option, and due to a since-repealed FCC regulation prohibiting TV and radio stations in the same market, but different ownership, from sharing the same call signs.
In 1968, channel 2 picked up a secondary affiliation with NBC after KULR opted to take a primary affiliation with ABC. The two stations shared NBC programming. This was unusual for a two-station market. In most two-station markets, especially tho |
https://en.wikipedia.org/wiki/Illumination | Illumination may refer to:
Science and technology
Illumination, an observable property and effect of light
Illumination (lighting), the use of light sources
Global illumination, algorithms used in 3D computer graphics
Spirituality and religion
Divine illumination, the process of human thought needs to be aided by divine grace
Illuminationism, c.q. Illuminationist philosophy, a doctrine according to which the process of human thought needs to be aided by divine grace
Divine light, an aspect of divine presence
Arts and media
Illuminations (short story collection) - a 2022 collection of short stories written by Alan Moore
Illumination (image), the use of light and shadow in art
Illuminated manuscript, the artistic decoration of hand-written texts
The Damnation of Theron Ware, a 1896 novel by Harold Frederic, first published in England as Illumination
Illuminations (poetry collection), by French poet Arthur Rimbaud
Music
Albums
Illumination!, 1964 album by the Elvin Jones/Jimmy Garrison Sextet
Illumination (Walter Davis, Jr. album), 1977 album by American jazz pianist Walter Davis, Jr.
Illumination (The Pastels album), 1997 album by the Scottish band The Pastels
Illumination (Paul Weller album), 2002 album by English singer Paul Weller
Illumination (Earth, Wind & Fire album), 2005 album by American R&B group Earth, Wind & Fire
Illumination (Robert Rich album), 2007
Illumination (Tristania album), 2007 album by Norwegian gothic metal band Tristania
Illumination (Miami Horror album), 2010 album by Australian group Miami Horror
Illumination, a 2012 album by Jennifer Thomas
Songs
"Illumination", by Gogol Bordello from their 2005 album Gypsy Punks: Underdog World Strike
"Illumination", by Lindsey Buckingham from his 2011 album Seeds We Sow
Les Illuminations (Britten), a song cycle setting poems of Arthur Rimbaud
"Illumination", by Heaven 17
Other uses
Illumination (company), an American film and animation studio
See also
Illuminations (disambiguation) |
https://en.wikipedia.org/wiki/Commission%20nationale%20de%20l%27informatique%20et%20des%20libert%C3%A9s | The Commission nationale de l'informatique et des libertés (CNIL, ; ) is an independent French administrative regulatory body whose mission is to ensure that data privacy law is applied to the collection, storage, and use of personal data. Its existence was established by the French loi n° 78-17 on Information Technology, Data Files and Civil Liberty of 6 January 1978, and it is the national data protection authority for France. From September 2011 to February 2019, the CNIL has been chaired by Isabelle Falque-Pierrotin. It's now chaired by Marie-Laure Denis.
History
The CNIL was created partially in response to public outrage against the SAFARI program, which was an attempt by the French government to create a centralized database allowing French citizens to be personally identified by different government services. On 21 March 1974, an article in the newspaper Le Monde, "SAFARI ou la chasse aux Français" (SAFARI; or, Hunting Frenchmen) brought public attention to the project. Interior Minister Jacques Chirac, freshly appointed following the events of May 1968, had to face the public uproar. Chirac was the successor to Raymond Marcellin, who had been forced to resign in the end of February 1974 after having attempted to place wiretaps in the offices of the weekly newspaper Le Canard enchaîné. The massive popular rejection of the government's activities in this domain prompted the creation of the CNIL.
At the beginning of 1980, when the CNIL began its main activities, news anchorman Patrick Poivre d'Arvor announced that the CNIL had registered 125,000 files. By the end of 1980, Poivre d'Arvor counted 250,000 files (public and private).
Composition and independence
The CNIL is composed of seventeen members from various government entities, four of whom are members of the French parliament (Assemblée nationale and Sénat); twelve of these members are elected by their representative organisations in the CNIL.
The CNIL's status as an administrative regulatory body gives it total independence to choose its course of action. However, its power is limited and defined by law. The CNIL is financed by the budget of the French Republic.
Power
The CNIL registers the setup of information systems that process personal data on French territories. By September 2004, more than 800,000 declarations of such systems had been made. Additionally, CNIL checks the law to be applied in this domain as well as in about 50 annual 'control missions'. CNIL can warn organisations or people who are found to be non-compliant with the law, and also report them to the Parquet.
300 nominal information systems registered daily.
8,000 phone calls handled each month.
4,000 claims or requests for information received each year.
Regulation
The main principles for regulation of personal data processing are as follows (non-exhaustive list):
all illegal means of data collection are forbidden;
the purpose of the data files must be explicitly stated;
people registered in files |
https://en.wikipedia.org/wiki/Transitway%20%28Ottawa%29 | The Transitway is a bus rapid transit (BRT) network operated by OC Transpo in Ottawa, Ontario, Canada. It comprises a series of bus-only roadways and reserved lanes on city streets and highways. The dedicated busways ensure that buses and emergency vehicles on the Transitway rarely intersect directly with the regular traffic, and make it possible for them to continue at full speed even during rush hour. OC Transpo operates a network of rapid routes which use the Transitway to connect communities with the O-Train light rail system. Additional bus routes also use segments of the Transitway.
The Transitway opened in 1983 with five stations. The network expanded greatly to include over fifty stations at its peak. Beginning in 2015, segments of the Transitway were closed to be converted to light rail. Ottawa's Stage 2 and 3 O-Train expansions will see additional segments of the Transitway converted.
History
During the 1970s and 1980s, the Regional Municipality of Ottawa-Carleton approved the construction of a new transit corridor called the Transitway. The purpose of this busway was to increase the speed of city-bound services from east and west. The first two sections opened in 1983: the southwestern Transitway between Lincoln Fields and Baseline and the east between Lees and Hurdman.
The central Transitway was then added in the Westboro and Mechanicsville areas. In the downtown core, buses traveled along dedicated lanes on Albert and Slater streets. The eastern Transitway was extended in both directions, towards Laurier in the northwest and Blair in the east. These segments of the Transitway were serviced by route 95, travelling the full length of the Transitway from Baseline to Blair. Priority measures were later added to Woodroffe Avenue and Regional Road 174, extending service into the suburbs of Barrhaven and Orleans.
In the 1990s, a rail corridor was gradually converted into the southeast Transitway, spanning from Hurdman to South Keys. This new section necessitated the creation of route 97. Route 97 followed the new southwest Transitway before joining route 95 along the existing Transitway segments. The 97 was extended to service the suburb of Kanata. The Kanata section was later split off into route 96.
In 2001, the O-Train's Trillium Line (then simply the "O-Train") opened. Its northern terminus was at the new Bayview station on the central Transitway and its southern terminus at Greenboro on the southeast Transitway.
The southwest Transitway was gradually extended southward, first to Fallowfield in 2005 and then to Barrhaven Centre in 2011. A median busway section was added along Chapman Mills Drive to Nepean Woods in 2014. The first segment of the western Transitway opened in 2009 connecting Pinecrest and Bayshore. This was extended to Moodie in 2017.
Beginning in 2015, sections of the Transitway closed for conversion to light rail for the Confederation Line. Buses were rerouted to bus-only lanes along Highway 417, Regional Road 17 |
https://en.wikipedia.org/wiki/Remington | Remington may refer to:
Organizations
Remington Arms, American firearms manufacturer
Remington Rand, American computer manufacturer
Remington Products, American manufacturer of shavers and haircare products
Remington College, American chain of private schools
Remington Records, American record label
E. Remington and Sons, American manufacturer of firearms and typewriters 1816–1896
The Remingtons, American country music group
Remington & Co, a British publisher
Places
United States
Remington, Indiana
Remington, Ohio
Remington, Virginia
Remington, Wisconsin
Remington, Baltimore, Maryland
Remington Ranch, Texas
Antarctica
Mount Remington
Remington Glacier
Other uses
Remington (album), a 2016 album by Granger Smith
Remington Steele, an American television series
People
Given name
Remington Kellogg (1892–1969), American naturalist and a director of the United States National Museum
Remington Leith, singer of fashion-art rock band Palaye Royale
Remington Norman, British merchant and author
Remington Schuyler (1884–1955), American painter, illustrator, and writer
Remington D. B. Vernam (1896–1918), American flying ace pilot enlisted in the French Air Force during World War I before transferring to the U.S. Army Air Service
Remington Vernam (land developer) (1843–1907), American lawyer, real-estate developer, and founder of the Arverne community in Queens, New York
Surname
Arthur Remington (1856–1909), New Zealand politician
Ashley Remington (real name: Dalton Castle) (born 1986), an American pro wrestler in Chikara
Barbara Remington (1929–2020), American artist and illustrator
Charles Lee Remington (1922–2007), American entomologist and lepidopterist
Cyrus Remington (1824–1878), American politician and jurist
Deborah Remington (1930–2010), American painter
Eliphalet Remington (1793–1861), American firearms designer
Emory Remington (1892–1971), American trombonist
Frank J. Remington (1922–1995), American law professor
Frederic Remington (1861–1909), American painter and sculptor
Jennifer Kes Remington, American composer and filmmaker
Keith Remington (1923–2020), Australian politician
Mary Remington (1910-2003), British artist
Phil Remington (1921–2013), American motorsports engineer
Philo Remington (1816–1889), American firearms and typewriter manufacturer, son of Eliphalet Remington
Ralph Remington (born 1963), American theater producer and former politician
William Remington (1917–1954), American economist and McCarthy era "communist suspect"
William P. Remington (1879–1963), American athlete
Characters
Rip Kirby (Remington "Rip" Kirby), a comic strip detective character
Constable Remington, a character from the comic series Knuckles the Echidna
Remington Tufflips, a character from Sanjay and Craig
Charles Remington, a character in the 1996 film The Ghost and the Darkness, played by Michael Douglas
See also
Rimington (disambiguation)
Rimmington (disambiguation)
Remy (disambiguation)
Rem |
https://en.wikipedia.org/wiki/Thermal%20design%20power | The thermal design power (TDP), sometimes called thermal design point, is the maximum amount of heat generated by a computer chip or component (often a CPU, GPU or system on a chip) that the cooling system in a computer is designed to dissipate under any workload.
Some sources state that the peak power rating for a microprocessor is usually 1.5 times the TDP rating.
Intel has introduced a new metric called scenario design power (SDP) for some Ivy Bridge Y-series processors.
Calculation
The average CPU power (ACP) is the power consumption of central processing units, especially server processors, under "average" daily usage as defined by Advanced Micro Devices (AMD) for use in its line of processors based on the K10 microarchitecture (Opteron 8300 and 2300 series processors). Intel's thermal design power (TDP), used for Pentium and Core 2 processors, measures the energy consumption under high workload; it is numerically somewhat higher than the "average" ACP rating of the same processor.
According to AMD the ACP rating includes the power consumption when running several benchmarks, including TPC-C, SPECcpu2006, SPECjbb2005 and STREAM Benchmark (memory bandwidth),
which AMD said is an appropriate method of power consumption measurement for data centers and server-intensive workload environments. AMD said that the ACP and TDP values of the processors will both be stated and do not replace one another. Barcelona and later server processors have the two power figures.
The TDP of a CPU has been underestimated in some cases, leading to certain real applications (typically strenuous, such as video encoding or games) causing the CPU to exceed its specified TDP and resulting in overloading the computer's cooling system. In this case, CPUs either cause a system failure (a "therm-trip") or throttle their speed down. Most modern processors will cause a therm-trip only upon a catastrophic cooling failure, such as a no longer operational fan or an incorrectly mounted heat sink.
For example, a laptop's CPU cooling system may be designed for a 20 W TDP, which means that it can dissipate up to 20 watts of heat without exceeding the maximum junction temperature for the laptop's CPU. A cooling system can do this using an active cooling method (e.g. conduction coupled with forced convection) such as a heat sink with a fan, or any of the two passive cooling methods: thermal radiation or conduction. Typically, a combination of these methods is used.
Since safety margins and the definition of what constitutes a real application vary among manufacturers, TDP values between different manufacturers cannot be accurately compared (a processor with a TDP of, for example, 100 W will almost certainly use more power at full load than processors with a fraction of said TDP, and very probably more than processors with lower TDP from the same manufacturer, but it may or may not use more power than a processor from a different manufacturer with a not excessively lower TD |
https://en.wikipedia.org/wiki/COMIT | COMIT was the first string processing language (compare SNOBOL, TRAC, and Perl), developed on the IBM 700/7000 series computers by Dr. Victor Yngve, University of Chicago, and collaborators at MIT from 1957 to 1965. Yngve created the language for supporting computerized research in the field of linguistics, and more specifically, the area of machine translation for natural language processing. The creation of COMIT led to the creation of SNOBOL.
Bob Fabry, University of Chicago, was responsible for COMIT II on Compatible Time Sharing System.
References
Sammet, J.E. "String and list processing languages", in Programming Languages: History and Fundamentals. . Prentice-Hall. 1969.
Text-oriented programming languages
Pattern matching programming languages
Programming languages created in 1957 |
https://en.wikipedia.org/wiki/RTL%20%28French%20radio%29 | RTL is a French commercial radio network owned by the RTL Group. Founded in 1933 as Radio Luxembourg, it broadcast from outside France until 1981 because only public stations had been allowed until then. It is a general-interest, news, talk and music station, broadcasting nationally ("category E" as classified by the CSA) in France, Francophone Belgium, and Luxembourg. Until 2022, RTL was also broadcast on long wave frequency 234 kHz from Beidweiler which could be picked up in large parts of the continent. It has a sister station called Bel RTL tailored for the French Community of Belgium. As of 2018, RTL is France's most popular radio station with an average of 6.4 million daily listeners that year.
History
Radio Luxembourg
On 19 December 1929 the Grand Duchy of Luxembourg established a state monopoly on broadcasting, but the law provided for possible concessions to private companies who wanted to use radio bandwidth, with the state charging a fixed amount for private use of radio.
The Société Luxembourgeoise d'Études Radiophoniques (SLER) was founded on 11 May 1929 with the aim of obtaining an eventual broadcasting contract from the Luxembourg government. This company was run by Luxembourger François Anen, French publisher Henry Etienne, and French engineer Jean le Duc representing the Compagnie des Compteurs de Montrouge, which possessed 84% of the project's capital and had signed a secret agreement to work with the group CSF, the main stockholder in Radio Paris. Radio Paris wanted to set up a powerful peripheral radio station in Luxembourg, outside of the strict French regulations that only allowed public stations. An agreement between the SLER and the Luxembourg government signed on 29 September 1930 with a duration of 25 years ensured the Luxembourg government a fee of 30% on future profits of the station. The agreement also set up a committee for programming and a technical committee which allowed the government to regulate the private station.
The Compagnie Luxembourgeoise de Radiodiffusion (CLR) was founded on 30 May 1931, officially replacing the SLER.
On 14 January 1933 experimental broadcasts by Radio Luxembourg began at 1191 mètres (200 kW), an unauthorized wavelength, from the longwave transmitter at Junglinster. The official opening of broadcast was on 15 March 1933 at 19:00 with a pre-recorded concert of light music. Radio Luxembourg broadcast each evening from 19:00 to 23:00, in German, French and Dutch and was therefore the only French-language private broadcaster available in France and Belgium. Programmes in English débuted on 3 December 1933 under the editorial guidance of Stephen Williams.
The station closed down at the outbreak of World War II in 1939, but it resumed service after the War.
Beginning in 1946, it could be heard easily in France. Until the 1980s, only the French public radio networks could transmit from France itself. Radio Luxembourg was one of private "peripheral" networks transmitting from abroad.
|
https://en.wikipedia.org/wiki/Whetstone%20%28benchmark%29 | The Whetstone benchmark is a synthetic benchmark for evaluating the performance of computers. It was first written in Algol 60 in 1972 at the Technical Support Unit of the Department of Trade and Industry (later part of the Central Computer and Telecommunications Agency) in the United Kingdom. It was derived from statistics on program behaviour gathered on the KDF9 computer at NPL National Physical Laboratory, using a modified version of its Whetstone ALGOL 60 compiler. The workload on the machine was represented as a set of frequencies of execution of the 124 instructions of the Whetstone Code. The Whetstone Compiler was built at the Atomic Power Division of the English Electric Company in Whetstone, Leicestershire, England, hence its name. Dr. B.A. Wichman at NPL produced a set of 42 simple ALGOL 60 statements, which in a suitable combination matched the execution statistics.
To make a more practical benchmark Harold Curnow of TSU wrote a program incorporating the 42 statements. This program worked in its ALGOL 60 version, but when translated into FORTRAN it was not executed correctly by the IBM optimizing compiler. Calculations whose results were not output were omitted. He then produced a set of program fragments which were more like real code and which collectively matched the original 124 Whetstone instructions. Timing this program gave a measure of the machine’s speed in thousands of Whetstone instructions per second (). The Fortran version became the first general purpose benchmark that set industry standards of computer system performance. Further development was carried out by Roy Longbottom, also of TSU/CCTA, who became the official design authority. The Algol 60 program ran under the Whetstone compiler in July 2010, for the first time since the last KDF9 was shut down in 1980, but now executed by a KDF9 emulator. Following increased computer speeds, performance measurement was changed to Millions of Whetstone Instructions Per Second (MWIPS).
Source code and pre-compiled versions for PCs in C/C++, Basic, Visual Basic, Fortran and Java are available.
The Whetstone benchmark primarily measures the floating-point arithmetic performance. A similar benchmark for integer and string operations is the Dhrystone.
See also
Dhrystone
FLOPS
Gibson Mix
LINPACK benchmarks
Million instructions per second (MIPS)
References
External links
Benchmark Programs and Reports (see also Netlib)
Whetstone Algol Revisited, or Confessions of a compiler writer PDF file (B. Randell, 1964)
Benchmarks (computing)
Blaby
Computer-related introductions in 1972
History of computing in the United Kingdom
Science and technology in Leicestershire |
https://en.wikipedia.org/wiki/List%20of%20radio%20stations%20in%20Oklahoma | The following is a list of FCC-licensed radio stations in the U.S. state of Oklahoma, which can be sorted by their call signs, frequencies, cities of license, licensees, and programming formats.
List of radio stations
Defunct
KAMG-LP
KEIF-LP
KHVJ-LP
KIOP
KJRM-LP
KJZT-LP
KLGB-LP
KMAC
KNFB
KONZ
KPOP-LP
KPSU
KVWO-LP
KZPY-LP
KWPR
See also
Oklahoma media
List of newspapers in Oklahoma
List of television stations in Oklahoma
Media of locales in Oklahoma: Broken Arrow, Lawton, Norman, Oklahoma City, Tulsa
References
Bibliography
Gene Allen. Voices On the Wind: Early Radio in Oklahoma (Oklahoma City: Oklahoma Heritage Association, 1993).
External links
(Directory ceased in 2017)
Oklahoma Association of Broadcasters
Oklahoma Vintage Radio Club
Images
Oklahoma |
https://en.wikipedia.org/wiki/Multidimensional%20analysis | In statistics, econometrics and related fields, multidimensional analysis (MDA) is a data analysis process that groups data into two categories: data dimensions and measurements. For example, a data set consisting of the number of wins for a single football team at each of several years is a single-dimensional (in this case, longitudinal) data set. A data set consisting of the number of wins for several football teams in a single year is also a single-dimensional (in this case, cross-sectional) data set. A data set consisting of the number of wins for several football teams over several years is a two-dimensional data set.
Higher dimensions
In many disciplines, two-dimensional data sets are also called panel data. While, strictly speaking, two- and higher-dimensional data sets are "multi-dimensional", the term "multidimensional" tends to be applied only to data sets with three or more dimensions. For example, some forecast data sets provide forecasts for multiple target periods, conducted by multiple forecasters, and made at multiple horizons. The three dimensions provide more information than can be gleaned from two-dimensional panel data sets.
Software
Computer software for MDA include Online analytical processing (OLAP) for data in relational databases, pivot tables for data in spreadsheets, and Array DBMSs for general multi-dimensional data (such as raster data) in science, engineering, and business.
See also
MultiDimensional eXpressions (MDX)
Multidimensional panel data
Multivariate statistics
Dimension (data warehouse)
Dimension tables
Data cube
References
Dimension reduction |
https://en.wikipedia.org/wiki/Branch%20%28computer%20science%29 | A branch is an instruction in a computer program that can cause a computer to begin executing a different instruction sequence and thus deviate from its default behavior of executing instructions in order. Branch (or branching, branched) may also refer to the act of switching execution to a different instruction sequence as a result of executing a branch instruction. Branch instructions are used to implement control flow in program loops and conditionals (i.e., executing a particular sequence of instructions only if certain conditions are satisfied).
A branch instruction can be either an unconditional branch, which always results in branching, or a conditional branch, which may or may not cause branching depending on some condition. Also, depending on how it specifies the address of the new instruction sequence (the "target" address), a branch instruction is generally classified as direct, indirect or relative, meaning that the instruction contains the target address, or it specifies where the target address is to be found (e.g., a register or memory location), or it specifies the difference between the current and target addresses.
Implementation
Branch instructions can alter the contents of the CPU's Program Counter (or PC) (or Instruction Pointer on Intel microprocessors). The PC maintains the memory address of the next machine instruction to be fetched and executed. Therefore, a branch, if executed, causes the CPU to execute code from a new memory address, changing the program logic according to the algorithm planned by the programmer.
One type of machine level branch is the jump instruction. These may or may not result in the PC being loaded or modified with some new, different value other than what it ordinarily would have been (being incremented past the current instruction to point to the following, next instruction). Jumps typically have unconditional and conditional forms where the latter may be taken or not taken (the PC is modified or not) depending on some condition.
The second type of machine level branch is the call instruction which is used to implement subroutines. Like jump instructions, calls may or may not modify the PC according to condition codes, however, additionally a return address is saved in a secure place in memory (usually in a memory resident data structure called a stack). Upon completion of the subroutine, this return address is restored to the PC, and so program execution resumes with the instruction following the call instruction.
The third type of machine level branch is the return instruction. This "pops" a return address off the stack and loads it into the PC register, thus returning control to the calling routine. Return instructions may also be conditionally executed. This description pertains to ordinary practice; however, the machine programmer has considerable powers to manipulate the return address on the stack, and so redirect program execution in any number of different ways.
Depending on the |
https://en.wikipedia.org/wiki/MSI%20protocol | In computing, the MSI protocol - a basic cache-coherence protocol - operates in multiprocessor systems. As with other cache coherency protocols, the letters of the protocol name identify the possible states in which a cache line can be.
Overview
In MSI, each block contained inside a cache can have one of three possible states:
Modified: The block has been modified in the cache. The data in the cache is then inconsistent with the backing store (e.g. memory). A cache with a block in the "M" state has the responsibility to write the block to the backing store when it is evicted.
Shared: This block is unmodified and exists in read-only state in at least one cache. The cache can evict the data without writing it to the backing store.
Invalid: This block is either not present in the current cache or has been invalidated by a bus request, and must be fetched from memory or another cache if the block is to be stored in this cache.
These coherency states are maintained through communication between the caches and the backing store. The caches have different responsibilities when blocks are read or written, or when they learn of other caches issuing reads or writes for a block.
When a read request arrives at a cache for a block in the "M" or "S" states, the cache supplies the data. If the block is not in the cache (in the "I" state), it must verify that the block is not in the "M" state in any other cache. Different caching architectures handle this differently. For example, bus architectures often perform snooping, where the read request is broadcast to all of the caches. Other architectures include cache directories which have agents (directories) that know which caches last had copies of a particular cache block. If another cache has the block in the "M" state, it must write back the data to the backing store and go to the "S" or "I" states. Once any "M" line is written back, the cache obtains the block from either the backing store, or another cache with the data in the "S" state. The cache can then supply the data to the requester. After supplying the data, the cache block is in the "S" state.
When a write request arrives at a cache for a block in the "M" state, the cache modifies the data locally. If the block is in the "S" state, the cache must notify any other caches that might contain the block in the "S" state that they must evict the block. This notification may be via bus snooping or a directory, as described above. Then the data may be locally modified. If the block is in the "I" state, the cache must notify any other caches that might contain the block in the "S" or "M" states that they must evict the block. If the block is in another cache in the "M" state, that cache must either write the data to the backing store or supply it to the requesting cache. If at this point the cache does not yet have the block locally, the block is read from the backing store before being modified in the cache. After the data is modified |
https://en.wikipedia.org/wiki/MOESI%20protocol | (For a detailed description see Cache coherency protocols (examples))
In computing, MOESI is a full cache coherency protocol that encompasses all of the possible states commonly used in other protocols. In addition to the four common MESI protocol states, there is a fifth "Owned" state representing data that is both modified and shared. This avoids the need to write modified data back to main memory before sharing it. While the data must still be written back eventually, the write-back may be deferred.
In order for this to be possible, direct cache-to-cache transfers of data must be possible, so a cache with the data in the modified state can supply that data to another reader without transferring it to memory.
As discussed in AMD64 Architecture Programmer's Manual Vol. 2 'System Programming', each cache line is in one of five states:
Modified This cache has the only valid copy of the cache line, and has made changes to that copy.
OwnedThis cache is one of several with a valid copy of the cache line, but has the exclusive right to make changes to it—other caches may read but not write the cache line. When this cache changes data on the cache line, it must broadcast those changes to all other caches sharing the line. The introduction of the Owned state allows dirty sharing of data, i.e., a modified cache block can be moved around various caches without updating main memory. The cache line may be changed to the Modified state after invalidating all shared copies, or changed to the Shared state by writing the modifications back to main memory. Owned cache lines must respond to a snoop request with data.
Exclusive This cache has the only copy of the line, but the line is clean (unmodified).
SharedThis line is one of several copies in the system. This cache does not have permission to modify the copy (another cache can be in the "owned" state). Other processors in the system may hold copies of the data in the Shared state, as well. Unlike the MESI protocol, a shared cache line may be dirty with respect to memory; if it is, some cache has a copy in the Owned state, and that cache is responsible for eventually updating main memory. If no cache holds the line in the Owned state, the memory copy is up to date. The cache line may not be written, but may be changed to the Exclusive or Modified state after invalidating all shared copies. (If the cache line was Owned before, the invalidate response will indicate this, and the state will become Modified, so the obligation to eventually write the data back to memory is not forgotten.) It may also be discarded (changed to the Invalid state) at any time. Shared cache lines may not respond to a snoop request with data.
Invalid This block is not valid; it must be fetched to satisfy any attempted access.
For any given pair of caches, the permitted states of a given cache line are as follows:
(The order in which the states are normally listed serves only to make the acronym "MOESI" pronounceable. |
https://en.wikipedia.org/wiki/.sg | .sg is the Internet country code top-level domain (ccTLD) for Singapore. It was first registered in September 1988. It is administered by the Singapore Network Information Centre. Registrations are processed via accredited registrars.
In 2011, two new internationalized country code top-level domains were registered for Singapore, intended for domain names in the local languages. These domains are (encoded as .xn—yfro4i67o) and (encoded as .xn—clchc0ea0b2g2a9gcd).
Restrictions
SGNIC requires that all .sg domains registered after 2 May 2013 have proof of Singaporean presence. This is facilitated by requiring the registrant to login to the Verified@SG portal with their SingPass account.
Second-level domains
.com.sg – Commercial entities
.net.sg – Network providers and info-com operators
.org.sg – Organizations in the Registry of Societies
.gov.sg – Government entities
.edu.sg – Educational institutions
.per.sg – Personal domain names
.sg – Open to all with a valid Singapore postal address
.新加坡 – for Chinese websites
.சிங்கப்பூர் – for Tamil websites
.sg domain statistics
As of September 2022, there were 198,564 registered .sg domains.
References
External links
IANA .sg whois information
Singapore Network Information Centre (SGNIC)
Country code top-level domains
Domain names of Singapore
Computer-related introductions in 1988
Internet in Singapore
sv:Toppdomän#S |
https://en.wikipedia.org/wiki/Component%20Manager | In Apple Macintosh computer programming, Component Manager was one of many approaches to sharing code that originated on the pre-PowerPC Macintosh. It was originally introduced as part of QuickTime, which remained the part of the classic Mac OS that used it most heavily.
Technical details
A component was a piece of code that provided various functions that may be invoked by clients. Each function was identified by a signed 16-bit integer ID code. Non-positive codes were reserved for predefined functions that should be understood by all components—open/close a component instance, query whether a function was supported, etc. The meanings of positive function codes depended on the type of component.
A component instance was created by opening a component. This called the component's open function to allocate and initialize any necessary storage for the instance. Closing the instance got rid of this storage and invalidated all references to that instance.
Components and component instances were referenced by 32-bit values that were not pointers. Instead, they were interpreted as keys into internal Component Manager tables. These references were generated in such a way that, once they became invalid, those values were unlikely to become valid again for a long time. This minimized the chance of obscure bugs due to dangling references.
Components were identified by OSType codes giving their type, subtype and "manufacturer". For instance, a component type might be "raster image compressor", subtypes of which might exist for JPEG, H.261, Sorenson, and Intel Indeo, among others. It was possible to have multiple components registered with exactly the same identification codes, giving alternative implementations of the same algorithm for example using hardware versus software, trading off speed versus quality, or other criteria. It was possible for the applications to query the existence of such alternatives and make explicit choices between them, or let the system choose a default.
Among the options available, a component could delegate parts of its functions to another component as a form of subclassing for code reuse. It was also possible for one component to capture another, which meant that all accesses to the captured component had to go through the capturing one.
Mac OS Components
Mac OS accumulated a great variety of component types:
Within QuickTime, there were image codecs, media handlers, media data handlers, video digitizer drivers, file format importers and exporters, and many others.
The Sound Manager moved to a predominantly component-based architecture in version 3.0: sound output devices were represented as components, and there were also component types for mixing multiple channels, converting between different sample rates and sample sizes, and encoding and decoding compressed formats.
AppleScript introduced the concept of scripting languages implemented as components.
ColorSync implemented different colour-matching methods as |
https://en.wikipedia.org/wiki/Sydney%20Orbital%20Network | The Sydney Orbital Network is a 110 kilometre motorway standard ring road around and through Sydney, the capital of New South Wales in Australia. It runs north from Sydney Airport, underneath the CBD to the North Shore, west to the Hills District, south to Prestons and then east to connect with the airport. Much of the road is privately owned and financed by tolls.
History
Planning for this beltway, orbital or ring road began as early as 1962 under the "County of Cumberland scheme" (CCS) and was talked about as far back as 1944. Then, from 1973 to 1989, things started to take shape with new sections opening-up and then further advancing by 1999. In 2007, the Lane Cove Tunnel opened, completing the orbital network.
Motorways that make up the orbital road
The 110 km Sydney orbital consists of several motorways and freeways, they are listed below:
Eastern Distributor
Southern Cross Drive
General Holmes Drive
M5 Motorway
Westlink M7
M2 Hills Motorway
Lane Cove Tunnel
Gore Hill Freeway
Warringah Freeway
Sydney Harbour Tunnel
The major sunken/underground sections of the orbital are:
Sydney Harbour Tunnel
Eastern Distributor
M5 East tunnel
Epping Tunnel (M2 Hills Motorway, although not really a major tunnel)
Sunken Section of the M2 Hills Motorway (The trench between Epping Road)
Lane Cove Tunnel
The major elevated sections are:
Parts of the Westlink M7
Parts of Southern Cross Drive and General Holmes Drive (past the airport)
There is significant upgrade work occurring as part of the WestConnex project, which will see the M5 duplicated (total of 4 lanes each way) along with the addition of new freeways to the Sydney network.
Tolling
The Sydney Orbital Road Network consists of a number of roads built by private companies: tolling is mostly unavoidable when using the road network. A $6.95 toll was added to the M5 East motorway from King Georges Road to Marsh Street on the 5th of July 2020, to coincide with the opening of the M8 tunnel.
Highway links
Intercity highways are linked to the Orbital, moving traffic away from the old busy National Routes. They are:
NorthConnex - linking M1 Pacific Motorway, Newcastle and Brisbane to M2 Hills Motorway
M4 Motorway - linking Great Western Highway and Bathurst to Westlink M7
Hume Motorway - linking Melbourne and Canberra to M5 Motorway and Westlink M7
King Georges Road - linking Princes Highway, Princes Motorway and Wollongong to M5 Motorway
Proposed or missing freeway/motorway links
M6 Motorway – A proposal that links the New M5 Tunnels and the southern suburbs of Sydney, as the M6 Motorway. The only section which was built is the Captain Cook Bridge and its approaches. Land is still reserved north of this point through Sandringham, and south through the Royal National Park. In October 2017, the government announced it will proceed with Stage 1 of the F6 extension, which will run via two 4 km tunnels linking the New M5 tunnels at Arncliffe to President Avenue at Kogarah. In October 2019, the go |
https://en.wikipedia.org/wiki/Paradox%20%28database%29 | Paradox is a relational database management system currently published by Corel Corporation.
It was originally released for MS-DOS by Ansa Software, and then updated by Borland after it bought the company. In mid 1991 Borland began the process to acquire Ashton-Tate and its competing
dBase product line; A Windows version was planned for release by Borland in 1992, but was delayed until January 1993, by which time Microsoft's Access for Windows was available. It was last updated in 2009.
Paradox for DOS
Paradox for DOS was a relational database management system originally written by Richard Schwartz and Robert Shostak, and released by their Belmont, California-based company Ansa Software in 1985.
The New York Times described it as "among the first of an emerging generation of software making extensive use of artificial intelligence techniques," and noted that Paradox could read the competing Ashton Tate's dBase files.
In September 1987, Borland purchased Ansa Software, including their Paradox/DOS 2.0 software. Notable classic versions were 3.5 and 4.5. Versions up to 3.5 were evolutions from 1.0. Version 4.0 and 4.5 were retooled in the Borland C++ windowing toolkit and used a different extended memory access scheme.
Paradox/DOS was a successful DOS-based database of the late 1980s and early 1990s. At that time, dBase and its xBase clones (Foxpro, Clipper) dominated the market. Other notable competitors were Clarion, DataEase, R:Base, and DataFlex.
The features that distinguished Paradox/DOS were:
An enhanced design and implementation of visual Query by Example that was supported by an AI engine for heuristic, dynamic query optimization.
Effective use of conventional, extended, and expanded memory – caching data tables and particularly indexes, which caused Paradox to execute tasks very quickly in contrast to the explicit skills required for xBase performance optimisation.
An innovative programming language, the Paradox Application Language (PAL), that was readable, powerful, and could be recorded from keyboard actions (rather like Lotus 1-2-3 macro recording).
Lotus-like text menus and windows, which was the native interface (in contrast to dBase, which had a command-line interface with menus layered on top).
Particularly in Paradox 1.0 and 2.0, the user and programming manuals won readability awards – they were copiously illustrated, well laid out, and explanations were written in common English.
There are a few MSDOS emulators, among which are dbDOS (a paid-for product) and https://www.vdos.info/ (which has a freeware option), both of which provide the ability to run Paradox for DOS applications (such as Paradox 4.5 for DOS) on Windows Vista and above 64-bit operating systems.
Paradox for Windows
Paradox for Windows is distinctly different from Paradox for DOS, and was produced by a different team of programmers. Paradox for Windows applications are programmed in a different programming language called ObjectPAL. Although key fe |
https://en.wikipedia.org/wiki/Secure%20file%20transfer%20protocol | The term secure file transfer protocol or secure FTP may refer to:
Network protocols
SSH File Transfer Protocol — a file transfer protocol specifically developed by the IETF to run over secure shell connections
FTP over SSH, also known as "secure FTP" — the practice of using SSH to tunnel the older, well-known File Transfer Protocol (FTP)
Computer programs
Secure file transfer program, usually known as "sftp" — a well-known command-line program, common in Unix, for using SSH File Transfer Protocol
Secure FTP (software) — a software package, by Glub Tech, for using FTPS (traditional FTP over SSL/TLS)
See also
FTPS — sometimes called "FTP Secure"
SFTP (disambiguation)
SFT (disambiguation) |
https://en.wikipedia.org/wiki/JCA | JCA may refer to:
Computing
Java Cryptography Architecture
Java EE Connector Architecture, for connecting application servers and enterprise information systems (EIS)
Military
Joint capability areas, US Department of Defense listing of military capabilities
Joint Cargo Aircraft, US Army and Air Force designation for the C-27 Spartan
Joint Combat Aircraft, Royal Navy and RAF designation for the F-35 Joint Strike Fighter
Organizations
Camp JCA Shalom, a sleep-away camp in Malibu, California
Jain Center of America, a Jain temple in New York, United States
Japan Cricket Association, the governing body for cricket in Japan
Japan Chess Association, the governing body for chess in Japan
Japanese Cancer Association, a cancer research association in Japan
Jewish Colonisation Association, founded 1891 to facilitate emigration of Jews
Joliet Catholic Academy, Illinois, US
Josephite Community Aid, Australian charity founded in 1986
Publications
Journal of Computational Acoustics
Other uses
Juvenile chronic arthritis
Jean-Claude Ades, German electronic music producer
Jackie Chan Adventures |
https://en.wikipedia.org/wiki/List%20of%20MSX%20games | The following is an incomplete list of video games for the MSX, MSX2, MSX2+, and MSX turbo R home computers.
Here are listed games released for the system. The total number of games published for this platform is over 2000. (Please see external links)
See also
Konami Game Master (1988)
List of Konami games
Notes
References
External links
MSX games |
https://en.wikipedia.org/wiki/RealNetworks%20Public%20Source%20License | The RealNetworks Public Source License (RPSL) is a software licence. It has been approved as a free software licence by both Free Software Foundation and Open Source Initiative (OSI), but it is incompatible with the GPL and the Debian Free Software Guidelines.
The RPSL is used by the Helix project.
See also
RealNetworks
References
External links
RealNetworks Public Source License text
Free and open-source software licenses
Copyleft software licenses
Public Source License |
https://en.wikipedia.org/wiki/MPICH | MPICH, formerly known as MPICH2, is a freely available, portable implementation of MPI, a standard for message-passing for distributed-memory applications used in parallel computing. MPICH is Free and open source software with some public domain components that were developed by a US governmental organisation, and is available for most flavours of Unix-like OS (including Linux and Mac OS X).
History
The Argonne National Laboratory and Mississippi State University jointly developed early versions (MPICH-1) as public domain software. The CH part of the name was derived from "Chameleon", which was a portable parallel programming library developed by William Gropp, one of the founders of MPICH.
The original implementation of MPICH (sometimes called "MPICH1") implemented the MPI-1.1 standard. Starting around 2001, work began on a new code base to replace the MPICH1 code and support the MPI-2 standard. Until November 2012, this project was known as "MPICH2". As of November 2012, the MPICH2 project renamed itself to simply "MPICH". MPICH v3.0 implements the MPI-3.0 standard. MPICH v4.0 implements the MPI-4.0 standard.
MPICH is one of the most popular implementations of MPI. It is used as the foundation for the vast majority of MPI implementations, including IBM MPI (for Blue Gene), Intel MPI, Cray MPI, Microsoft MPI, Myricom MPI, OSU MVAPICH/MVAPICH2, and many others.
MPICH channels
Based on ch3 infrastructure:
Nemesis - Universal, has inter-node modules: elan, GM, IB (infiniband), MX (myrinet express), NewMadeleine, tcp; and several intra-node variants of shared memory for large messages (LMT interface).
ssm - Sockets and Shared Memory
shm - SHared memory
sock - tcp/ip sockets
sctp - experimental channel over SCTP sockets
MPICH derivatives
IBM (MPI for the Blue Gene series and, as an option, for x86 and POWER clusters)
Cray (MPI for all Cray platforms)
SiCortex (MPI SiCortex)
Microsoft (MS-MPI)
Intel (Intel MPI)
Qlogic (MPICH2-PSM)
Myricom (MPICH2-MX)
Ohio State University (MVAPICH and MVAPICH2)
ParTec (ParaStation MPI)
University of British Columbia (MPICH2/SCTP, and Fine-Grain MPI (FG-MPI) which adds support for coroutines)
See also
Open MPI, another popular open source MPI implementation
MVAPICH
References
External links
MPICH Home Page
standards documents
Concurrent programming libraries
Free software
Public-domain software with source code |
https://en.wikipedia.org/wiki/Ratio%20Club | The Ratio Club was a small British informal dining club from 1949 to 1958 of young psychiatrists, psychologists, physiologists, mathematicians and engineers who met to discuss issues in cybernetics.
History
The idea of the club arose from a symposium on animal behaviour held in July 1949 by the Society of Experimental Biology in Cambridge. The club was founded by the neurologist John Bates, with other notable members such as W. Ross Ashby.
The name Ratio was suggested by Albert Uttley, it being the Latin root meaning "computation or the faculty of mind which calculates, plans and reasons". He pointed out that it is also the root of rationarium, meaning a statistical account, and ratiocinatius, meaning argumentative. The use was probably inspired by an earlier suggestion by Donald Mackay of the 'MR club', from Machina ratiocinatrix, a term used by Norbert Wiener in the introduction to his then recently published book Cybernetics, or Control and Communication in the Animal and the Machine. Wiener used the term in reference to calculus ratiocinator, a calculating machine constructed by Leibniz.
The initial membership was W. Ross Ashby, Horace Barlow, John Bates, George Dawson, Thomas Gold, W. E. Hick, Victor Little, Donald MacKay, Turner McLardy, P. A. Merton, John Pringle, Harold Shipton, Donald Sholl, Eliot Slater, Albert Uttley, W. Grey Walter and John Hugh Westcott. Alan Turing joined after the first meeting with I. J. Good, Philip Woodward and William Rushton added soon after. Giles Brindley was also a member for a short period.
The club was the most intellectually powerful and influential cybernetics grouping in the UK, and many of its members went on to become extremely prominent scientists.
References
External links
1949 establishments in England
Scientific organizations established in 1949
Cybernetics
Dining clubs
History of artificial intelligence
Systems sciences organizations |
https://en.wikipedia.org/wiki/Mark%20Weiser | Mark D. Weiser (July 23, 1952 – April 27, 1999) was a computer scientist and chief technology officer (CTO) at Xerox PARC. Weiser is widely considered to be the father of ubiquitous computing, a term he coined in 1988. Within Silicon Valley, Weiser was broadly viewed as a visionary and computer pioneer, and his ideas have influenced many of the world's leading computer scientists.
Early life and education
Weiser was born in Chicago, Illinois, to David and Audra Weiser. He grew up in Stony Brook, New York. He moved to Sarasota, Florida, to study philosophy at New College of Florida but dropped out in his second year when he ran out of money. He then moved to Ann Arbor, Michigan, where he found a job as a computer programmer. While working as a computer programmer he began taking computer science classes and excelled to the point that he was directly admitted into a master's program at the University of Michigan. He studied Computer and Communication Science at the University of Michigan, receiving an M.A. in 1976, and a Ph.D. in 1979.
Career
Weiser later taught computer science at the University of Maryland, College Park and became associate chairman of the department in 1986.
Weiser joined PARC (then Xerox PARC) in 1987 and became manager of its computer science laboratory in 1988, the same year he pioneered the concept of ubiquitous computing. He became PARC's chief technology officer in 1996.
Honors
In 2001, the Association for Computing Machinery's special interest group in operating systems (SIGOPS) established the Mark Weiser Award for individuals who innovate within operating systems research. The Mark D. Weiser Excellence in Computing Scholarship Fund at the University of California, Berkeley was also established in Weiser's memory.
Personal life
In addition to his work in the field of computer science, Weiser was also the drummer for the avant-garde/experimental rock band, Severe Tire Damage, which was the first band to broadcast live over the Internet.
On April 27, 1999, Weiser died of liver failure that was caused by cancer.
Ubiquitous computing and calm technology
During one of his talks, Weiser outlined a set of principles describing ubiquitous computing:
The purpose of a computer is to help you do something else.
The best computer is a quiet, invisible servant.
The more you can do by intuition the smarter you are; the computer should extend your unconscious.
Technology should create calm.
In Designing Calm Technology, Weiser and John Seely Brown describe calm technology as "that which informs but doesn't demand our focus or attention."
Low-powered portable computing
Weiser advocated to look at performance in non traditional ways. Instead of measuring computational performance in MIPS, he focused on increasing the instructions per joule of energy, pushing the computer industry toward low-powered portable computing.
Works
"The Computer for the 21st Century" - Scientific American Special Issue on Communications, Computer |
https://en.wikipedia.org/wiki/Resilient%20Packet%20Ring | Resilient Packet Ring (RPR), as defined by IEEE standard 802.17, is a protocol designed for the transport of data traffic over optical fiber ring networks. The standard began development in November 2000 and has undergone several amendments since its initial standard was completed in June 2004. The amended standards are 802.17a through 802.17d, the last of which was adopted in May 2011. It is designed to provide the resilience found in SONET and Synchronous Digital Hierarchy networks (50 ms protection) but, instead of setting up circuit oriented connections, provides a packet based transmission, in order to increase the efficiency of Ethernet and IP services.
Technical details
RPR works on a concept of dual counter rotating rings called ringlets. These ringlets are set up by creating RPR stations at nodes where traffic is supposed to drop, per flow (a flow is the ingress and egress of data traffic). RPR uses Media Access Control protocol (MAC) messages to direct the traffic, which can use either ringlet of the ring. The nodes also negotiate for bandwidth among themselves using fairness algorithms, avoiding congestion and failed spans. The avoidance of failed spans is accomplished by using one of two techniques known as steering and wrapping. Under steering, if a node or span is broken, all nodes are notified of a topology change and they reroute their traffic. In wrapping, the traffic is looped back at the last node prior to the break and routed to the destination station.
Class of service and traffic queues
All traffic on the ring is assigned a Class of Service (CoS) and the standard specifies three classes. Class A (or High) traffic is a pure committed information rate (CIR) and is designed to support applications requiring low latency and jitter, such as voice and video. Class B (or Medium) traffic is a mix of both a CIR and an excess information rate (EIR; which is subject to fairness queuing). Class C (or Low) is best effort traffic, utilizing whatever bandwidth is available. This is primarily used to support Internet access traffic.
Spatial reuse
Another concept within RPR is what is known as spatial reuse. Because RPR strips the signal once it reaches the destination (unlike a SONET UPSR/SDH SNCP ring, in which the bandwidth is consumed around the entire ring) it can reuse the freed space to carry additional traffic. The RPR standard also supports the use of learning bridges (IEEE 802.1D) to further enhance efficiency in point to multipoint applications and VLAN tagging (IEEE 802.1Q).
One drawback of the first version of RPR was that it did not provide spatial reuse for frame transmission to/from MAC addresses not present in the ring topology. This was addressed by IEEE 802.17b, which defines an optional spatially aware sublayer (SAS). This allows spatial reuse for frame transmission to/from MAC address not present in the ring topology.
See also
Ethernet Automatic Protection Switching
Spatial Reuse Protocol (Cisco)
Metro Ring P |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.