source
stringlengths 32
199
| text
stringlengths 26
3k
|
|---|---|
https://en.wikipedia.org/wiki/Belanova
|
Belanova is a Mexican pop band that formed in the city of Guadalajara, Jalisco, in 2000. The group consisted of Denisse Guerrero (lead vocals), Edgar Huerta (keyboards, programming) and Ricardo "Richie" Arreola (bass, guitar). Although these are the only three official members, several other musicians performed in the band's live lineup, most notably Israel "Campanita" Ulloa (drums) and Richo Acosta (guitar). The band was signed to Virus Records, owned by Universal Music, in 2002.
History
Early years & Cocktail (2000–2004)
All three members of the band had a passion for music since childhood. Richie, from Guadalajara, developed his interest in music out of an admiration for The Beatles member Paul McCartney as a child. Edgar, also from Guadalajara, first became interested in music when his brother received a little keyboard as a Christmas present, showing little interest in it, and so Edgar simply began playing it one day. Denisse, originally from Los Mochis, Sinaloa, enjoyed singing since she was a child, and was previously a member of the band 40 Grados, literally "40 Degrees (Celsius)." The trio met in Guadalajara at a bar where both Edgar and Denisse were working.
Their first album was titled Cocktail and was released in 2003. The first single off the album was "Tus Ojos", which gained popularity due to its inclusion in a Mitsubishi publicity campaign, just after the Japanese car maker's arrival in Mexico. The song reached number one on the Mexican Top 100 and stayed there for 3 consecutive weeks. The album reached number five on the Mexican Albums Chart and was certified Gold; consequently, the album was named one of the Top Five albums of 2003 by Rolling Stone Mexico.
Apart from "Tus Ojos", the album also spawned two more top-twenty hits, "Suele Pasar" and "Y Aún Así Te Vas".
The band spent 2003 and 2004 on a 100-Concert Tour around Mexico promoting the album. Following Cocktail'''s success, management at Universal Music Mexico company encouraged the band to adopt a more commercial sound. Belanova flew to Argentina to record their second album, moving from electronic music to electropop, and the band was moved from the company's dance-music branch, Virus Records, to the larger one, Universal.
Dulce Beat & commercial success (2005–2007)
In 2005, Belanova released their second album, Dulce Beat, which gained popularity in the Latin American music market thanks largely to television stations such as MTV. The album was released on June 21, 2005, in Mexico, reaching the number one spot and holding the spot for four non-consecutive weeks. The album went on to sell over 200,000 copies in Mexico alone.
The first single was "Me Pregunto", with a sound similar to that of Cocktail. The single was followed soon after by "Por Ti", much more grounded in pop music. Both songs reached number one in Mexico. "Rosa Pastel" was released in July 2006 as the third single. The fourth single, "Niño", was used in promotions for Pizza Hut Mexico. The huge suc
|
https://en.wikipedia.org/wiki/Apple%20II%20accelerators
|
Apple II accelerators are computer hardware devices which enable an Apple II computer to operate faster than their intended clock rate.
8-bit accelerators
Number Nine Apple Booster – Number Nine Computer Corporation (Number Nine Visual Technology)
Platform: Apple II, Apple II Plus
Form Factor: 50-pin slot card
Speed: 3.58 MHz
Cache: 64 KB on board RAM
DMA compatible: No
Upgradeable: No
Number Nine Apple Booster (1982) was one of the first accelerators for the Apple II series of computers. This card is the original version of Saturn's Accelerator II (thus the Accelerator II PCB shares both Saturn Systems' and NNCC's logos.) At $598, the Saturn was much cheaper than the NNCC, but little information about the board is available today.
SpeedDemon – Microcomputer Technologies (M-c-T)
Platform: Apple II, Apple II Plus, Apple IIe
Form Factor: 50-pin slot card
Speed: 3.58 MHz
Cache: 4 KB cache
DMA compatible: No
Upgradeable: No
Microcomputer Technologies (M-c-T) SpeedDemon card was the one of early Apple II accelerator which used the newer 65C02 microprocessor, and the first to implement caching technology. This allowed the card to use small amounts of memory, making the card less expensive to produce and eliminated the need to waste clock cycles in order to refresh the dynamic RAM that other cards used. Other accelerators which did not use caching operated at 3.58 MHz most of the time but had to slow down to 1 MHz for this refresh cycle. For peripheral cards that required 1 MHz "slow" operations, the Speed Demon always slowed access to slot #6 to 1 MHz, while an on-card jumper controlled the slot #4 and #5 slowdown. The SpeedDemon originally retailed for $295.
Accelerator II – Saturn Systems (Titan Technologies)
Platform: Apple II, Apple II Plus
Form Factor: 50-pin slot card
Speed: 3.58 MHz
Cache: 64 KB on board RAM
DMA compatible: No
Upgradeable: No
Saturn System's Accelerator II was the original accelerator for the Apple II series of computers. The card accelerated the Apple II and the Apple II Plus using a faster MOS 6502 microprocessor and on-board high speed RAM. When the accelerator card was activated, software would execute within the CPU and memory on the card, not utilizing those components on the motherboard. The card used a series of 8 DIP switches to configure slot access speeds as well as the speed of the card. Since the Accelerator II was released before Apple's introduction of the Apple IIe, while the card would run in an Apple IIe, software which required a 65C02 microprocessor or used auxiliary memory would not function properly—this problem was solved with the Accelerator IIe, which was a complete redesign. Saturn Systems changed their name during the early 1980s to Titan Technologies due to trademark complications.
Accelerator IIe – Titan Technologies (formerly Saturn Systems)
Platform: Apple II, Apple II Plus
Form Factor: 50-pin slot card
Speed: 3.58 MHz
Cache: 64 KB on board RAM + 16 KB shadow ROM
|
https://en.wikipedia.org/wiki/Wildstorm%20Thunderbook
|
The Wildstorm Thunderbook is a comic book anthology that was published by DC Comics/Wildstorm in 2000.
Stories
This prestige format one-shot relaunched a few characters such as Cybernary 2.0 and Jet, and featured the following stories:
Wham! (Gen¹³)
Professionals (Grifter)
Family Matters (Jet)
Return to Gamorra (Cybernary 2.0)
Down and Out with the Deviants (DV8)
References
External links
Thunderbook preview from ComicBookResources.com
Thunder In A Honey Pot - commentary from the editor
2000 comics debuts
DC Comics one-shots
WildStorm limited series
|
https://en.wikipedia.org/wiki/Alias%20analysis
|
Alias analysis is a technique in compiler theory, used to determine if a storage location may be accessed in more than one way. Two pointers are said to be aliased if they point to the same location.
Alias analysis techniques are usually classified by flow-sensitivity and context-sensitivity. They may determine may-alias or must-alias information. The term alias analysis is often used interchangeably with points-to analysis, a specific case.
Alias analysers intend to make and compute useful information for understanding aliasing in programs.
Overview
In general, alias analysis determines whether or not separate memory references point to the same area of memory. This allows the compiler to determine what variables in the program will be affected by a statement. For example, consider the following section of code that accesses members of structures:
p.foo = 1;
q.foo = 2;
i = p.foo + 3;
There are three possible alias cases here:
The variables p and q cannot alias (i.e., they never point to the same memory location).
The variables p and q must alias (i.e., they always point to the same memory location).
It cannot be conclusively determined at compile time if p and q alias or not.
If p and q cannot alias, then i = p.foo + 3; can be changed to i = 4. If p and q must alias, then i = p.foo + 3; can be changed to i = 5 because p.foo + 3 = q.foo + 3. In both cases, we are able to perform optimizations from the alias knowledge (assuming that no other thread updating the same locations can interleave with the current thread, or that the language memory model permits those updates to be not immediately visible to the current thread in absence of explicit synchronization constructs). On the other hand, if it is not known if p and q alias or not, then no optimizations can be performed and the whole of the code must be executed to get the result. Two memory references are said to have a may-alias relation if their aliasing is unknown.
Performing alias analysis
In alias analysis, we divide the program's memory into alias classes. Alias classes are disjoint sets of locations that cannot alias to one another. For the discussion here, it is assumed that the optimizations done here occur on a low-level intermediate representation of the program. This is to say that the program has been compiled into binary operations, jumps, moves between registers, moves from registers to memory, moves from memory to registers, branches, and function calls/returns.
Type-based alias analysis
If the language being compiled is type safe, the compiler's type checker is correct, and the language lacks the ability to create pointers referencing local variables, (such as ML, Haskell, or Java) then some useful optimizations can be made. There are many cases where we know that two memory locations must be in different alias classes:
Two variables of different types cannot be in the same alias class since it is a property of strongly typed, memory reference-free (i.e., reference
|
https://en.wikipedia.org/wiki/Clinical%20data%20repository
|
A Clinical Data Repository (CDR) or Clinical Data Warehouse (CDW) is a real time database that consolidates data from a variety of clinical sources to present a unified view of a single patient. It is optimized to allow clinicians to retrieve data for a single patient rather than to identify a population of patients with common characteristics or to facilitate the management of a specific clinical department. Typical data types which are often found within a CDR include: clinical laboratory test results, patient demographics, pharmacy information, radiology reports and images, pathology reports, hospital admission, discharge and transfer dates, ICD-9 codes, discharge summaries, and progress notes.
A Clinical Data Repository could be used in the hospital setting to track prescribing trends as well as for the monitoring of infectious diseases. One area CDR's could potentially be used is monitoring the prescribing of antibiotics in hospitals especially as the number of antiobiotic-resistant bacteria is ever increasing. In 1995, a study at the Beth Israel Deaconess Medical Center conducted by the Harvard Medical School used a CDR to monitor vancomycin use and prescribing trends since vancomycin-resistant enterococci is a growing problem. They used the CDR to track the prescribing by linking the individual patient, medication, and the microbiology lab results which were all contained within the CDR. If the microbiology lab result did not support the use of vancomycin, it was suggested to change the medication to something appropriate as under the Center for Disease Control CDC guidelines. The use of CDR's could help monitor infectious diseases in the hospital and the appropriate prescribing based on lab results.
The use of Clinical Data Repositories could provide a wealth of knowledge about patients, their medical conditions, and their outcome. The database could serve as a way to study the relationship and potential patterns between disease progression and management. The term "Medical Data Mining" has been coined for this method of research. Past epidemiological studies may not have had as complete of information as that which is contained in a CDR, which could lead to inconclusive data/results. The use of medical data mining and correlative studies using the CDR could serve as a valuable resource helping the future of healthcare in all facets of medicine. The idea of data mining a CDW was used for screening variables that were associated with diabetes and poor glycemic control. It allowed for novel correlations that may have not been discovered without this method.
One potential use of a clinical data repository would be for clinical trials. This would allow for researchers to have all the information from a study in one place as well as let other researchers benefit from the data to further innovation. They would also be advantageous since they are digital and real-time. This would be easier to log data and keep it accurate since it would be di
|
https://en.wikipedia.org/wiki/Eckert%E2%80%93Mauchly%20Award
|
The Eckert–Mauchly Award recognizes contributions to digital systems and computer architecture. It is known as the computer architecture community’s most prestigious award. First awarded in 1979, it was named for John Presper Eckert and John William Mauchly, who between 1943 and 1946 collaborated on the design and construction of the first large scale electronic computing machine, known as ENIAC, the Electronic Numerical Integrator and Computer. A certificate and $5,000 are awarded jointly by the Association for Computing Machinery (ACM) and the IEEE Computer Society for outstanding contributions to the field of computer and digital systems architecture.
Recipients
1979 Robert S. Barton
1980 Maurice V. Wilkes
1981 Wesley A. Clark
1982 Gordon C. Bell
1983 Tom Kilburn
1984 Jack B. Dennis
1985 John Cocke
1986 Harvey G. Cragon
1987 Gene M. Amdahl
1988 Daniel P. Siewiorek
1989 Seymour Cray
1990 Kenneth E. Batcher
1991 Burton J. Smith
1992 Michael J. Flynn
1993 David J. Kuck
1994 James E. Thornton
1995 John Crawford
1996 Yale Patt
1997 Robert Tomasulo
1998 T. Watanabe
1999 James E. Smith
2000 Edward Davidson
2001 John Hennessy
2002 Bantwal Ramakrishna "Bob" Rau
2003 Joseph A. (Josh) Fisher
2004 Frederick P. Brooks
2005 Robert P. Colwell
2006 James H. Pomerene
2007 Mateo Valero
2008 David Patterson
2009 Joel Emer
2010 Bill Dally
2011 Gurindar S. Sohi
2012 Algirdas Avizienis
2013 James R. Goodman
2014 Trevor Mudge
2015 Norman Jouppi
2016 Uri Weiser
2017 Charles P. Thacker
2018 Susan J. Eggers
2019 Mark D. Hill
2020 Luiz André Barroso
2021 Margaret Martonosi
2022 Mark Horowitz
2023 Kunle Olukotun
See also
ACM Special Interest Group on Computer Architecture
Computer engineering
Computer science
Computing
List of computer science awards
References
ACM-IEEE CS Eckert-Mauchly Award winners
Eckert Mauchly Award
Computer science awards
IEEE society and council awards
|
https://en.wikipedia.org/wiki/HP%20Saturn
|
The Saturn family of 4-bit (datapath) microprocessors was developed by Hewlett-Packard in the 1980s first for the HP-71B handheld computer and then later for various HP calculators (starting with the HP-18C). It succeeded the Nut family of processors used in earlier calculators. The original Saturn chip was first used in the HP-71B hand-held BASIC-programmable computer, introduced in 1984. Later models of the family powered the popular HP 48 series of calculators. The HP48SX and HP48S were the last models to use genuine Saturn processors manufactured by HP. Later calculator models used Saturn processors manufactured by NEC. The HP 49 series initially used the Saturn CPU as well, until the NEC fab could no longer manufacture the processor for technical reasons in 2003. Therefore, starting with the HP 49g+ model in 2003, the calculators switched to a Samsung S3C2410 processor with an ARM920T core (part of the ARMv4T architecture) which ran an emulator of the Saturn hardware in software. In 2000, the HP 39G and HP 40G were the last calculators introduced based on the actual NEC fabricated Saturn hardware. The last calculators based on the Saturn emulator were the HP 39gs, HP 40gs and HP 50g in 2006, as well as the 2007 revision of the hp 48gII. The HP 50g, the last calculator utilizing this emulator, was discontinued in 2015 when Samsung stopped producing the ARM processor on which it was based.
Architecture
The Saturn hardware is a nibble serial design as opposed to its Nut predecessor, which was bit-serial. Internally, the Saturn CPU has four 4-bit data buses that allow for nearly 1-cycle per nibble performance with one or two buses acting as a source and one or two acting as a destination. The smallest addressable word is a 4-bit nibble which can hold one binary-coded decimal (BCD) digit. Any unit of data in the registers larger than a nibble, in which the end of said data unit falls on a nibble boundary and the start of said data unit starts at nibble zero (and also in some cases where said data unit's starting position falls on a nibble boundary with certain register fields eg. "M" or "X"), and which can be up to 64-bits, can be operated on as a whole, but the Saturn CPU performs the operation serially internally on a nibble-by-nibble basis.
The Saturn architecture has a 64-bit data word width and 20-bit address width, with memory being addressed to 4-bit (nibble) granularity. Saturn ALU instructions support variable data width, operating on one to 16 nibbles of a word. The main registers (GPRs), along with the temporary registers, are fully 64-bits wide, but the address registers are only 20-bits wide. The original Saturn CPU chips provided a four-bit external data bus, but later Saturn-based SoCs included on chip bus conversion to an 8-bit external data bus and 19-bit external address bus.
The Saturn architecture has four 64-bit GPRs (General Purpose Registers), named A, B, C and D. In addition, there are also five 64-bit "scratch" regi
|
https://en.wikipedia.org/wiki/Morpheus%20%281998%20video%20game%29
|
Morpheus is an American computer game released in 1998.
Gameplay
The game is a first-person adventure game similar to Myst with a point and click interface however, the player may also pan around a location by clicking and dragging the mouse. Clicking the mouse to go in a certain direction results in a transition video showing the player's movement.
Reception
Morpheus became a hit in Spain, with sales of 50,000 units in that region. Bob Mandel of The Adrenaline Vault gave the game the "Seal of Excellence".
References
External links
Morpheus on Itch.io
1998 video games
Adventure games
First-person adventure games
Classic Mac OS games
Single-player video games
Video games developed in the United States
Video games about virtual reality
Windows games
|
https://en.wikipedia.org/wiki/Concurrent%20constraint%20logic%20programming
|
Concurrent constraint logic programming is a version of constraint logic programming aimed primarily at programming concurrent processes rather than (or in addition to) solving constraint satisfaction problems. Goals in constraint logic programming are evaluated concurrently; a concurrent process is therefore programmed as the evaluation of a goal by the interpreter.
Syntactically, concurrent constraint logic programs are similar to non-concurrent programs, the only exception being that clauses include guards, which are constraints that may block the applicability of the clause under some conditions. Semantically, concurrent constraint logic programming differs from its non-concurrent versions because a goal evaluation is intended to realize a concurrent process rather than finding a solution to a problem. Most notably, this difference affects how the interpreter behaves when more than one clause is applicable: non-concurrent constraint logic programming recursively tries all clauses; concurrent constraint logic programming chooses only one. This is the most evident effect of an intended directionality of the interpreter, which never revise a choice it has previously taken. Other effects of this are the semantical possibility of having a goal that cannot be proved while the whole evaluation does not fail, and a particular way for equating a goal and a clause head.
Constraint handling rules can be seen as a form of concurrent constraint logic programming, but are used for programming a constraint simplifier or solver rather than concurrent processes.
Description
In constraint logic programming, the goals in the current goal are evaluated sequentially, usually proceeding in a LIFO order in which newer goals are evaluated first. The concurrent version of logic programming allows for evaluating goals in parallel: every goal is evaluated by a process, and processes run concurrently. These processes interact via the constraint store: a process can add a constraint to the constraint store while another one checks whether a constraint is entailed by the store.
Adding a constraint to the store is done like in regular constraint logic programming. Checking entailment of a constraint is done via guards to clauses. Guards require a syntactic extension: a clause of concurrent constraint logic programming is written as H :- G | B where G is a constraint called the guard of the clause. Roughly speaking, a fresh variant of this clause can be used to replace a literal in the goal only if the guard is entailed by the constraint store after the equation of the literal and the clause head is added to it. The precise definition of this rule is more complicated, and is given below.
The main difference between non-concurrent and concurrent constraint logic programming is that the first is aimed at search, while the second is aimed at implementing concurrent processes. This difference affects whether choices can be undone, whether processes are allowed not to ter
|
https://en.wikipedia.org/wiki/Sysquake
|
Sysquake is a numerical computing environment based on a programming language mostly-compatible with MATLAB. It offers facilities for interactive graphics which give insights into the problems being analyzed. It is used in teaching, research, and engineering.
Sysquake supports two kinds of codes: libraries (collections of related functions which extend Sysquake capabilities), and SQ files, applications with interactive graphics which can have their own menus. Sysquake Pro can also be extended with plugins.
Code
Several applications share a large part of Sysquake code:
Sysquake Application Builder program which creates stand-alone executable applications (bundled with Sysquake Pro)
Sysquake for LaTeX Sysquake's language and graphics directly in LaTeX (package file and compiled application)
Libraries are usually compatible with all these applications.
History
Sysquake 3 supported MySQL and SQLite databases, TCP/IP and audio input and output.
See also
List of numerical analysis software
Comparison of numerical analysis software
References
External links
The Sysquake product page at Calerga
Using lpsolve from Sysquake at mit.edu
Array programming languages
Numerical programming languages
Statistical programming languages
|
https://en.wikipedia.org/wiki/Siemianice%20railway%20station
|
Siemianice is a non-operational PKP railway station in Siemianice (Pomeranian Voivodeship), Poland.
Lines crossing the station
References
Siemianice article at Polish Stations Database, URL accessed at 21 March 2006
Railway stations in Pomeranian Voivodeship
Disused railway stations in Pomeranian Voivodeship
Słupsk County
|
https://en.wikipedia.org/wiki/Karzcino%20railway%20station
|
Karzcino is a non-operational PKP railway station in Karzcino (Pomeranian Voivodeship), Poland.
Lines crossing the station
References
Karzcino article at Polish Stations Database, URL accessed at 21 March 2006
Railway stations in Pomeranian Voivodeship
Disused railway stations in Pomeranian Voivodeship
Słupsk County
|
https://en.wikipedia.org/wiki/%C5%81%C4%99kwica%20railway%20station
|
Łękwica is a non-operational PKP railway station in Łękwica (Pomeranian Voivodeship), Poland.
Lines crossing the station
References
Łękwica article at Polish Stations Database, URL accessed at 21 March 2006
Railway stations in Pomeranian Voivodeship
Disused railway stations in Pomeranian Voivodeship
Słupsk County
|
https://en.wikipedia.org/wiki/%C5%BBoruchowo%20railway%20station
|
Żoruchowo is a non-operational PKP railway station in Żoruchowo (Pomeranian Voivodeship), Poland.
Lines crossing the station
References
Żoruchowo article at Polish Stations Database, URL accessed at 21 March 2006
Railway stations in Pomeranian Voivodeship
Disused railway stations in Pomeranian Voivodeship
Słupsk County
|
https://en.wikipedia.org/wiki/%C5%BBelkowo%20railway%20station
|
Żelkowo is a non-operational PKP railway station in Żelkowo (Pomeranian Voivodeship), Poland.
Lines crossing the station
References
Żelkowo article at Polish Stations Database, URL accessed at 21 March 2006
Railway stations in Pomeranian Voivodeship
Disused railway stations in Pomeranian Voivodeship
Słupsk County
|
https://en.wikipedia.org/wiki/Cho%C4%87mirowo%20railway%20station
|
Choćmirowo is a non-operational PKP railway station in Choćmirowo (Pomeranian Voivodeship), Poland.
Lines crossing the station
References
Choćmirowo article at Polish Stations Database, URL accessed at 21 March 2006
Railway stations in Pomeranian Voivodeship
Disused railway stations in Pomeranian Voivodeship
Słupsk County
|
https://en.wikipedia.org/wiki/B%C4%99dziechowo%20railway%20station
|
Będziechowo is a non-operational PKP railway station in Będziechowo (Pomeranian Voivodeship), Poland.
Lines crossing the station
References
Będziechowo article at Polish Stations Database, URL accessed at 21 March 2006
Railway stations in Pomeranian Voivodeship
Disused railway stations in Pomeranian Voivodeship
Słupsk County
|
https://en.wikipedia.org/wiki/Kl%C4%99cino%20railway%20station
|
Klęcino is a non-operational PKP railway station in Klęcino (Pomeranian Voivodeship), Poland.
Lines crossing the station
References
Klęcino article at Polish Stations Database, URL accessed at 21 March 2006
Railway stations in Pomeranian Voivodeship
Disused railway stations in Pomeranian Voivodeship
Słupsk County
|
https://en.wikipedia.org/wiki/G%C5%82%C3%B3wczyce%20railway%20station
|
Główczyce is a non-operational PKP railway station in Główczyce (Pomeranian Voivodeship), Poland.
Lines crossing the station
References
Główczyce article at Polish Stations Database , URL accessed at 21 March 2006
Disused railway stations in Pomeranian Voivodeship
Railway stations in Pomeranian Voivodeship
Słupsk County
|
https://en.wikipedia.org/wiki/Computer%20museum
|
A computer museum is devoted to the study of historic computer hardware and software, where a "museum" is a "permanent institution in the service of society and of its development, open to the public, which acquires, conserves, researches, communicates, and exhibits the tangible and intangible heritage of humanity and its environment, for the purposes of education, study, and enjoyment", as defined by the International Council of Museums.
Some computer museums exist within larger institutions, such as the Science Museum in London, United Kingdom; and the Deutsches Museum in Munich, Germany. Others are dedicated specifically to computing, such as:
the Computer History Museum in Mountain View, California, United States.
the American Computer & Robotics Museum in Bozeman, Montana, United States.
The National Museum of Computing at Bletchley Park, United Kingdom.
The Centre for Computing History in Cambridge, United Kingdom
the Nexon Computer Museum in Jeju Province. South Korea.
Some specialize in the early history of computing, others in the era that started with the first personal computers such as the Apple I and Altair 8800, Apple II systems, older Apple Macintoshes, Commodore Internationals, Amigas, IBM PCs and more rare computers such as the Osborne 1. Others Some concentrate more on research and conservation, others more on education and entertainment. There are also private collections, most of which can be visited by appointment.
See also
List of computer museums
List of science museums
Computer Conservation Society (UK)
History of computer hardware
IT History Society
KansasFest annual event for Apple II computer enthusiasts. Held every July at Rockhurst University, Kansas City, Missouri.
Retrocomputing
Vintage Computer Festival held annually in Mountain View, California, and elsewhere
Technology museum
Further reading
Bell, Gordon (2011). Out of a Closet: The Early Years of the Computer Museums. Microsoft Technical Report MSR-TR-2011-44.
Bruemmer, Bruce H. (1987). Resources for the History of Computing: A Guide to U.S. & Canadian Records. Charles Babbage Institute.
Cortada, James W. (1990). Archives of Data-Processing History: A Guide to Major U.S. Collections. Greenwood
References
Types of museums
|
https://en.wikipedia.org/wiki/Przeb%C4%99dowo%20railway%20station
|
Przebędowo is a non-operational PKP railway station in Przebędowo (Pomeranian Voivodeship), Poland.
Lines crossing the station
References
Przebędowo article at Polish Stations Database, URL accessed at 21 March 2006
Railway stations in Pomeranian Voivodeship
Disused railway stations in Pomeranian Voivodeship
Wejherowo County
|
https://en.wikipedia.org/wiki/Dargoleza%20railway%20station
|
Dargoleza is a non-operational PKP railway station in Dargoleza (Pomeranian Voivodeship), Poland.
Lines crossing the station
References
Dargoleza article at Polish Stations Database , URL accessed at 21 March 2006
Railway stations in Pomeranian Voivodeship
Disused railway stations in Pomeranian Voivodeship
Słupsk County
|
https://en.wikipedia.org/wiki/Wolinia%20railway%20station
|
Wolinia is a non-operational PKP railway station in Wolinia (Pomeranian Voivodeship), Poland.
Lines crossing the station
References
Wolinia article at Polish Stations Database, URL accessed at 21 March 2006
Railway stations in Pomeranian Voivodeship
Disused railway stations in Pomeranian Voivodeship
Słupsk County
|
https://en.wikipedia.org/wiki/Cecenowo%20railway%20station
|
Cecenowo is a non-operational PKP railway station in Cecenowo (Pomeranian Voivodeship), Poland.
Lines crossing the station
References
Cecenowo article at Polish Stations Database, URL accessed at 21 March 2006
Railway stations in Pomeranian Voivodeship
Disused railway stations in Pomeranian Voivodeship
Słupsk County
|
https://en.wikipedia.org/wiki/Wriggler
|
Wriggler may refer to:
Collared wrigglers, fish in the family Xenisthmidae
Wriggler (mosquito larva), larvae of mosquitoes
Wriggler (video game), a computer game for the ZX Spectrum
See also
Wiggler (disambiguation)
|
https://en.wikipedia.org/wiki/Dominek%20railway%20station
|
Dominek is a non-operational PKP railway station in Dominek (Pomeranian Voivodeship), Poland.
Lines crossing the station
References
Dominek article at Polish Stations Database , URL accessed at 21 March 2006
Railway stations in Pomeranian Voivodeship
Disused railway stations in Pomeranian Voivodeship
Słupsk County
|
https://en.wikipedia.org/wiki/Komnino%20railway%20station
|
Komnino is a non-operational PKP railway station in Komnino (Pomeranian Voivodeship), Poland.
Lines crossing the station
References
Komnino article at Polish Stations Database, URL accessed at 21 March 2006
Railway stations in Pomeranian Voivodeship
Disused railway stations in Pomeranian Voivodeship
Słupsk County
|
https://en.wikipedia.org/wiki/Czysta%20railway%20station
|
Czysta is a non-operational PKP railway station in Czysta (Pomeranian Voivodeship), Poland.
Lines crossing the station
References
Czysta article at Polish Stations Database, URL accessed at 21 March 2006
Railway stations in Pomeranian Voivodeship
Disused railway stations in Pomeranian Voivodeship
Słupsk County
|
https://en.wikipedia.org/wiki/Gardna%20Wielka%20railway%20station
|
Gardna Wielka is a non-operational PKP railway station in Gardna Wielka (Pomeranian Voivodeship), Poland.
Lines crossing the station
References
Gardna Wielka article at Polish Stations Database , URL accessed on 21 March 2006
Railway stations in Pomeranian Voivodeship
Disused railway stations in Pomeranian Voivodeship
Słupsk County
|
https://en.wikipedia.org/wiki/Stojcino%20railway%20station
|
Stojcino is a non-operational PKP railway station in Stojcino (Pomeranian Voivodeship), Poland.
Lines crossing the station
References
Stojcino article at Polish Stations Database, URL accessed at 21 March 2006
Railway stations in Pomeranian Voivodeship
Disused railway stations in Pomeranian Voivodeship
Słupsk County
|
https://en.wikipedia.org/wiki/%C5%BBelazo%20railway%20station
|
Żelazo is a non-operational PKP railway station in Żelazo (Pomeranian Voivodeship), Poland.
Lines crossing the station
References
Żelazo article at Polish Stations Database, URL accessed at 21 March 2006
Railway stations in Pomeranian Voivodeship
Disused railway stations in Pomeranian Voivodeship
Słupsk County
|
https://en.wikipedia.org/wiki/Smo%C5%82dzino%20railway%20station
|
Smołdzino is a non-operational PKP railway station in Smołdzino (Pomeranian Voivodeship), Poland.
Lines crossing the station
References
Smołdzino article at Polish Stations Database, URL accessed at 21 March 2006
Railway stations in Pomeranian Voivodeship
Disused railway stations in Pomeranian Voivodeship
Słupsk County
|
https://en.wikipedia.org/wiki/Sorter
|
Sorter may refer to:
Sorter (logistics), a system that sorts products according to destination
Card sorter, a machine to sort computer punched card
Cash sorter machine, a machine used for sorting banknotes
Coin sorter, a machine used for sorting coins
Keirsey Temperament Sorter, a self-assessed personality questionnaire
Sorting algorithm, an algorithm to put elements of a list into order
See also
Sort (disambiguation)
|
https://en.wikipedia.org/wiki/Shadowserver%20Foundation
|
Shadowserver Foundation is a nonprofit security organization that gathers and analyzes data on malicious Internet activity (including malware, botnets, and computer fraud), sends daily network reports to subscribers, and works with law enforcement organizations around the world in cybercrime investigations. Established in 2004 as a "volunteer watchdog group," it liaises with national governments, CSIRTs, network providers, academic institutions, financial institutions, Fortune 500 companies, and end users to improve Internet security, enhance product capability, advance research, and dismantle criminal infrastructure.
Funding
In early 2020, Cisco, which has been the primary funder for 15 years, announced they would be withdrawing their funding. In late May 2020 it was announced that the Shadowserver Foundation had received funding from various sources to enable “the group to continue in a more sustainable way without becoming dependent on a single backer again.”
Activities
Data collection
Shadowserver scans the IPv4 Internet 45 times per day. It harvests data on malware, spam, bots, and botnets using large-scale sensor networks of honeypots and honeyclients placed throughout the world. It uses sinkholes to collect data on bots and DDOS attacks. It also receives additional malware and sinkhole data from governments, industry partners, and law enforcement agencies that have established reciprocal data-sharing agreements with Shadowserver.
Data analysis
Shadowserver stores raw malware data permanently in its repository. As new data are collected, Shadowserver analyzes them using thousands of virtual sandboxes and hundreds of bare metal sandboxes. It regularly re-analyzes raw data previously collected. The results of these analyses are stored in the organization's analysis cluster.
Network reporting
Shadowserver sends free daily network reports to users who have subscribed to them. The reports contain all the data that Shadowserver has collected and analyzed about any suspicious activity it was able to detect within the specific networks or regions for which the subscriber is responsible. For example, a national government might receive data aggregated by geo-spatial coordinates defined by latitude and longitude, while an international network provider might receive data filtered by ASN.
Investigation support
Shadowserver liaises with security organizations, national governments, and CSIRTs to dismantle global cybercrime networks; for example, it worked with the FBI, Europol, and Interpol to take down the Avalanche network in 2016. It also helps law enforcement partners to develop strategies against cyber security threats and to mitigate threats as they emerge, focusing on cases that involve criminal abuse of the Internet’s infrastructure.
References
External links
Computer security organizations
|
https://en.wikipedia.org/wiki/E3000
|
E3000 may refer to:
Eurostar E3000, a satellite platform manufactured by Airbus
A variant of the HP 3000, a minicomputer line manufactured by Hewlett-Packard
|
https://en.wikipedia.org/wiki/Varying%20Permeability%20Model
|
The Varying Permeability Model, Variable Permeability Model or VPM is an algorithm that is used to calculate the decompression stops needed for ambient pressure dive profiles using specified breathing gases. It was developed by D.E. Yount and others for use in professional diving and recreational diving. It was developed to model laboratory observations of bubble formation and growth in both inanimate and in vivo systems exposed to pressure. In 1986, this model was applied by researchers at the University of Hawaii to calculate diving decompression tables.
Theoretical basis
The VPM presumes that microscopic bubble nuclei always exist in water and tissues that contain water. Any nuclei larger than a specific "critical" size, which is related to the maximum dive depth (exposure pressure), will grow upon decompression when the diver ascends. The VPM aims to minimize the total volume of these growing bubbles by keeping the external pressure large, and the inspired inert gas partial pressures low during decompression. The model depends on the assumptions that different sizes of bubbles exist within the body; that the larger bubbles require less reduction in pressure to begin to grow than smaller ones; and that fewer large bubbles exist than smaller ones. These are used to construct an algorithm that provides decompression schedules designed to allow the larger, growing bubbles to be eliminated before they can cause problems.
Bibliography
This bibliography list was compiled by E.B. Maiken and E.C. Baker as reference material for the V-Planner web site in 2002.
Primary Modeling Sources
</ref>
VPM Research and Development Sources
Kunkle, T.D. 1979. Bubble nucleation in supersaturated fluids. Univ. of Hawaii Sea Grant Technical Report UNIHI-SEAGRANT-TR-80-01. Pp. 108.
Yount, D.E. 1979. Multiple inert-gas bubble disease: a review of the theory. In: Lambertsen, C.J. and Bornmann, R.C. eds. . Undersea Medical Society, Bethesda, 90-125.
VPM Dive Planning Software
V-Planner: VPM-B & VPM-B/E, VPM-B/FBO.
MultiDeco: VPM-B & VPM-B/E, VPM-B/FBO, ZHL-B, ZHL-C, GF, and GFS.
Ultimate Planner: VPM-B, VPM-B/U, VPM-B (Dec-12), VPM-B/U (Dec-12), ZHL-B, ZHL-C, ZHL-D, GF and GF/U.
DecoPlanner: VPM-B.
HLPlanner: VPM-B.
JDeco: VPM-B.
PalmVPM: VPM.
DivePlan: VPM.
Baltic Deco Planner: VPM-B.
Subsurface: VPM-B.
VPM Dive computers
V-Planner Live: VPM-B & VPM-B/E.
MultiDeco-X1: VPM-B & VPM-B/E, VPM-B/FBO, ZHL-C, GF, and GFS.
MultiDeco-DR5: VPM-B & VPM-B/E, VPM-B/FBO, ZHL-C, GF, and GFS.
Shearwater Research Predator, Petrel, Perdix and NERD models: GF, VPM-B plus GFS.
RATIO Computers: iX3M series and iDive (Tech and Reb) series VPM-B and ZHL16-B.
TDC-3 with MultiDeco-TDC: VPM-B & VPM-B/E, VPM-B/FBO, ZHL-C, GF, and GFS.
HeinrichsWeikamp OSTC4: VPM-B
See also
References
External links
VPM web site
VPM development time line
Decompression algorithms
|
https://en.wikipedia.org/wiki/SpeedTouch
|
SpeedTouch is the brand name of a line of networking equipment produced by Alcatel and Technicolor SA. Before 27 January 2010 Technicolor was known as Thomson SA.
Under the SpeedTouch name Alcatel and Technicolor retail a variety of equipment including ADSL and ADSL2+ modems, residential gateways, wireless access equipment, VoIP handsets and SHDSL interconnect equipment. They are a major brand in home and business networking products.
Models
Following is a non-exhaustive list of existing SpeedTouch models:
Single-user modems
SpeedTouch Home
A modem which provides bridged and PPTP connections for Internet connectivity. The modem uses an Ethernet cable to connect to a PC, or may be connected to a router that supports PPPoE.
Speedtouch Pro
Same as the SpeedTouch Home, but with added Point-to-Point Protocol and basic NAT (Network Address Translation) functionality.
SpeedTouch USB and SpeedTouch 330
A basic ADSL USB modem, without router features and capable of speeds up to 1Mbit up and 7Mbit down. Due to its USB connection it requires drivers to work and is currently not supported well on Linux and not at all on intel-powered Macs or on Windows 95 and earlier.
SpeedTouch PC
A PCI extension card ADSL modem. This modem is more or less obsolete and has never been distributed in large numbers.
TG508
A single ethernet port ADSL2+ gateway with built in firewall.
Multi-user modems with built-in NAT router
ST510 1/4 ports /ST530(+USB)
Widely distributed ADSL modems with built in NAT router, firewall and UPnP. The ST510 is available with either 1 or 4 Ethernet ports. The ST530 only provides 1 Ethernet socket, but can also be connected through USB.
ST516
The first ADSL2+ modem in the SpeedTouch line-up. As with the ST510, this modem has a built in NAT router, firewall and UPnP. Firmware versions R5.3 and up also provide functionalities such as ALG (Application Layer Gateway) for VPN connections, remote management of the webinterface and Dynamic DNS. The middle number in the model number "5x6" indicates the number of Ethernet ports available on the modem. Firmware version 6.2.29.2 does not support PPTP (or GRE forwarding) when the ST516 is used in router mode.
ST536
A single ethernet and single USB port gateway with built in firewall.
ST546
A four ethernet port gateway with built in firewall.
TG605
A four ethernet port gateway with built in firewall designed for business use, VLAN support and remote management.
ST610 / ST610i / ST610s / ST610v
A line of business DSL routers launched in 2003, with optional IPSec and SIP support activated by software keys. Fixed WAN options are ADSL over POTS (ST610), ADSL over ISDN (ST610i), SHDSL (ST610s) and VDSL (ST610v). They are available either with a 4-port 10/100 LAN switch, or with an ATMF-25 LAN or WAN interface (except the 610v)
Wireless modems
TG185
A device that adds wireless transmission capabilities to an existing modem though an ethernet connection.
ST570
The first wireless modem in the SpeedTouch
|
https://en.wikipedia.org/wiki/Nominal%20type%20system
|
In computer science, a type system is nominal (also called nominative or name-based) if compatibility and equivalence of data types is determined by explicit declarations and/or the name of the types. Nominal systems are used to determine if types are equivalent, as well as if a type is a subtype of another. Nominal type systems contrast with structural systems, where comparisons are based on the structure of the types in question and do not require explicit declarations.
Nominal typing
Nominal typing means that two variables are type-compatible if and only if their declarations name the same type. For example, in C, two struct types with different names in the same translation unit are never considered compatible, even if they have identical field declarations.
However, C also allows a typedef declaration, which introduces an alias for an existing type. These are merely syntactical and do not differentiate the type from its alias for the purpose of type checking. This feature, present in many languages, can result in a loss of type safety when (for example) the same primitive integer type is used in two semantically distinct ways. Haskell provides the C-style syntactic alias in the form of the type declaration, as well as the newtype declaration that does introduce a new, distinct type, isomorphic to an existing type.
Nominal subtyping
In a similar fashion, nominal subtyping means that one type is a subtype of another if and only if it is explicitly declared to be so in its definition. Nominally-typed languages typically enforce the requirement that declared subtypes be structurally compatible (though Eiffel allows non-compatible subtypes to be declared). However, subtypes which are structurally compatible "by accident", but not declared as subtypes, are not considered to be subtypes.
C++, C#, Java, Objective-C, Delphi, Swift, Julia and Rust all primarily use both nominal typing and nominal subtyping.
Some nominally-subtyped languages, such as Java and C#, allow classes to be declared final (or sealed in C# terminology), indicating that no further subtyping is permitted.
Comparison
Nominal typing is useful at preventing accidental type equivalence, which allows better type-safety than structural typing. The cost is a reduced flexibility, as, for example, nominal typing does not allow new super-types to be created without modification of the existing subtypes.
See also
Structural type system
Abstract type
Type system
References
Sources
External links
c2.com: Nominative and structural typing
Type systems
|
https://en.wikipedia.org/wiki/Amber%3A%20Journeys%20Beyond
|
Amber: Journeys Beyond is an American computer game released in 1996 for Apple Macintosh computers and Windows 95. It is the only game produced by Hue Forest Entertainment, founded by Frank and Susan Wimmer.
Gameplay
Amber: Journeys Beyond is a first-person point-and-click adventure game similar to Myst. Gameplay is nonlinear and events in the game occur at random depending on the player's progress.
Plot
Note: As the game is nonlinear, events described below may not necessarily occur in that order when playing the game.
The player character's friend Dr. Roxanne ("Roxy") Westbridge purchases a reportedly haunted house in North Carolina and begins to perform paranormal tests there. A mutual friend asks the player character to check on her, as he is worried that she may be too hasty with the still undeveloped ghost hunting equipment. The player character drives to the house. Suddenly, in the middle of the road an apparition appears. The player character swerves to the right to avoid the ghostly shape and ends up in the nearby pond. The player character emerges soaking wet and explores the garage and house. Roxy appears to be unconscious in the garage with a device on her head, and the house has no electricity.
After restoring electricity, the player character discovers that Roxy has several types of ghost-hunting equipment: surveillance cameras; the BAR (Bulbic Activity Reader); a doorknob sensor which detects spiritual residue in doorknobs; the PeeK, a pocket television-like device which allows the user to listen to the sounds in the doorknobs and works with the BAR and cameras to observe spiritual activity from a safe distance; and the AMBER (Astral Mobility By Electromagnetic Resonance) headset device itself, which allows the user to enter the minds of ghosts to discover what they are thinking and seeing and to remind them of who they are so they may ascend. The last device is still in the testing phase and its use is considered to be very risky. Apparently Roxy's spirit was lost while she was attempting to use the AMBER device.
Through the combined use of the devices, the player character discover that there are three resident ghosts in and around the house.
Brice, a gardener who believed that UFOs would come to take him away, became obsessed with his employer's daughter, Mandy, who disliked him and didn't share his interests. When he believed that they were finally coming, he banged on the backdoor to the house and called Mandy, who answered. Mandy did not respond positively, so he killed her and placed the body in a hidden compartment under the gazebo he had built. Subsequently, he killed her parents and committed suicide after he realized what he had done. After the player character assists his spirit, Brice is received by the aliens; however, rather than being sent to paradise, he is sent to another unpleasant place.
Another ghost is Margaret, who committed suicide after her husband died overseas fighting in World War II. After the
|
https://en.wikipedia.org/wiki/WSJX-LP
|
WSJX-LP, UHF analog channel 24, was a low-power LATV-affiliated television station licensed to Aguadilla, Puerto Rico. The station was owned by Caribbean Broadcasting Network along with sister station WSJP-LD (channel 18).
History
The station had been silent in January 2014. From that point until the Fox affiliation ended, it continued broadcasting on channel 18.2 of sister station WSJP-LD.
On January 1, 2016, and after two years off the air, WSJX-LP resumed broadcasting and becomes an affiliate of the LATV network.
WSJX-LP broadcast the entire LATV schedule with Shop LC paid programming overnights.
The station had been silent since November 1, 2020. Caribbean Broadcasting Network surrendered WSJX-LP's license to the Federal Communications Commission for cancellation on January 14, 2021. The LATV affiliation has been moved to the fifth subchannel of WSJP-LD.
External links
Caribbean Broadcasting Network
Aguadilla, Puerto Rico
SJX-LP
Television channels and stations established in 2005
2005 establishments in Puerto Rico
Television channels and stations disestablished in 2021
2021 disestablishments in Puerto Rico
SJX-LP
Low-power television stations in Puerto Rico
|
https://en.wikipedia.org/wiki/NVM
|
NVM may refer to:
NewVoiceMedia, cloud service company specialising in contact centre technology
Node Version Manager, a tool for Node.js
Non-volatile memory, a type of computer memory
NVM, a 2014 album by Seattle band Tacocat
National Videogame Museum, a museum in Frisco, Texas
Newhaven Marine railway station, a disused railway station in Sussex, England
Shorthand for 'nevermind', used in text messaging
de:Liste von Abkürzungen (Netzjargon)#N
|
https://en.wikipedia.org/wiki/Machine-dependent%20software
|
Machine-dependent software is software that runs only on a specific computer. Applications that run on multiple computer architectures are called machine-independent, or cross-platform. Many organisations opt for such software because they believe that machine-dependent software is an asset and will attract more buyers. Organizations that want application software to work on heterogeneous computers may port that software to the other machines. Deploying machine-dependent applications on such architectures, such applications require porting. This procedure includes composing, or re-composing, the application's code to suit the target platform.
Porting
Porting is the process of converting an application from one architecture to another. Software languages such as Java are designed so that applications can migrate across architectures without source code modifications. The term is applied when programming/equipment is changed to make it usable in a different architecture.
Code that does not operate properly on a specific system must be ported to another system.
Porting effort depends upon a few variables, including the degree to which the first environment (the source stage) varies from the new environment (the objective stage) and the experience of the creators in knowing platform-specific programming dialects.
Many languages offer a machine independent intermediate code that can be processed by platform-specific interpreters to address incompatibilities. The transitional representation characterises a virtual machine that can execute all modules written in the intermediate dialect. The intermediate code guidelines are interpreted into distinct machine code arrangements by a code generator to make executable code. The intermediate code may also be executed directly without static conversion into platform-specific code.
Approaches
Port the translator. This can be coded in portable code.
Adapt the source code to the new machine.
Execute the adjusted source utilizing the translator with the code generator source as data. This will produce the machine code for the code generator.
See also
Virtual machine
Java (programming language)
Hardware-dependent software
References
External links
Agrawala, A. K., & Rauscher, T. G., 2014, Foundations of microprogramming: architecture, software, and applications, Academic press
Huang, J., Li, Y. F., & Xie, M., 2015, An empirical analysis of data preprocessing for machine learning-based software cost estimation, Information and Software Technology, 67, 108-127
Lee, J. H., Yu, J. M., & Lee, D. H., 2013, A tabu search algorithm for unrelated parallel machine scheduling with sequence-and machine-dependent setups: minimizing total tardiness, The International Journal of Advanced Manufacturing Technology, 69(9-12), 2081-2089
Lin, S. W., & Ying, K. C., 2014, ABC-based manufacturing scheduling for unrelated parallel machines with machine-dependent and job sequence-dependent setup times, Computers & Oper
|
https://en.wikipedia.org/wiki/Traverse%20%28surveying%29
|
Traverse is a method in the field of surveying to establish control networks. It is also used in geodesy. Traverse networks involve placing survey stations along a line or path of travel, and then using the previously surveyed points as a base for observing the next point. Traverse networks have many advantages, including:
Less reconnaissance and organization needed;
While in other systems, which may require the survey to be performed along a rigid polygon shape, the traverse can change to any shape and thus can accommodate a great deal of different terrains;
Only a few observations need to be taken at each station, whereas in other survey networks a great deal of angular and linear observations need to be made and considered;
Traverse networks are free of the strength of figure considerations that happen in triangular systems;
Scale error does not add up as the traverse is performed. Azimuth swing errors can also be reduced by increasing the distance between stations.
The traverse is more accurate than triangulateration (a combined function of the triangulation and trilateration practice).
Types
Frequently in surveying engineering and geodetic science, control points (CP) are setting/observing distance and direction (bearings, angles, azimuths, and elevation). The CP throughout the control network may consist of monuments, benchmarks, vertical control, etc. There are mainly two types of traverse:
Closed traverse: either originates from a station and returns to the same station completing a circuit, or runs between two known stations
Open traverse: neither returns to its starting station, nor closes on any other known station.
Compound traverse: it is where an open traverse is linked at its ends to an existing traverse to form a closed traverse. The closing line may be defined by coordinates at the end points which have been determined by previous survey. The difficulty is, where there is linear misclosure, it is not known whether the error is in the new survey or the previous survey.
Components
Control point — The primary/base control used for preliminary measurements; it may consist of any known point capable of establishing accurate control of distance and direction (i.e. coordinates, elevation, bearings, etc.).
Starting – The initial starting control point of the traverse.
Observation – All known control points that are set or observed within the traverse.
Terminal – The initial ending control point of the traverse; its coordinates are unknown.tr
See also
Great Trigonometrical Survey
Polygonal chain
Side shot
Transcontinental Traverse
References
Civil engineering
Earth sciences
Geodesy
Surveying
|
https://en.wikipedia.org/wiki/PQCC
|
The Production Quality Compiler-Compiler Project (or PQCC) was a long-term project led by William Wulf at Carnegie Mellon University to produce an industrial-strength compiler-compiler. PQCC would produce full, optimizing programming language compilers from descriptions of the programming language and the target machine. Though the goal of a fully automatic process was not realized, PQCC technology and ideas were the basis of production compilers from Intermetrics, Tartan Laboratories, and others.
Objective
The focus of the project was on the semantics and machine-dependent phases of compilation, since lexical and syntactic analysis were already well understood. Each phase was formalized in a manner that permits expression in table-driven form. The automatic construction of the compiler then consists of deriving these tables from the semantic definitions of the language and target machine. Though this approach was largely successful for target machine description, it was less so for semantics.
See also
GNU Bison
yacc
References
Compilers
Parsing algorithms
Parsing
|
https://en.wikipedia.org/wiki/ECC%20memory
|
Error correction code memory (ECC memory) is a type of computer data storage that uses an error correction code (ECC) to detect and correct n-bit data corruption which occurs in memory. ECC memory is used in most computers where data corruption cannot be tolerated, like industrial control applications, critical databases, and infrastructural memory caches.
Typically, ECC memory maintains a memory system immune to single-bit errors: the data that is read from each word is always the same as the data that had been written to it, even if one of the bits actually stored has been flipped to the wrong state. Most non-ECC memory cannot detect errors, although some non-ECC memory with parity support allows detection but not correction.
Description
Error correction codes protect against undetected data corruption and are used in computers where such corruption is unacceptable, examples being scientific and financial computing applications, or in database and file servers. ECC can also reduce the number of crashes in multi-user server applications and maximum-availability systems.
Electrical or magnetic interference inside a computer system can cause a single bit of dynamic random-access memory (DRAM) to spontaneously flip to the opposite state. It was initially thought that this was mainly due to alpha particles emitted by contaminants in chip packaging material, but research has shown that the majority of one-off soft errors in DRAM chips occur as a result of background radiation, chiefly neutrons from cosmic ray secondaries, which may change the contents of one or more memory cells or interfere with the circuitry used to read or write to them. Hence, the error rates increase rapidly with rising altitude; for example, compared to sea level, the rate of neutron flux is 3.5 times higher at 1.5 km and 300 times higher at 10-12 km (the cruising altitude of commercial airplanes). As a result, systems operating at high altitudes require special provisions for reliability.
As an example, the spacecraft Cassini–Huygens, launched in 1997, contained two identical flight recorders, each with 2.5 gigabits of memory in the form of arrays of commercial DRAM chips. Due to built-in EDAC functionality, the spacecraft's engineering telemetry reported the number of (correctable) single-bit-per-word errors and (uncorrectable) double-bit-per-word errors. During the first 2.5 years of flight, the spacecraft reported a nearly constant single-bit error rate of about 280 errors per day. However, on November 6, 1997, during the first month in space, the number of errors increased by more than a factor of four on that single day. This was attributed to a solar particle event that had been detected by the satellite GOES 9.
There was some concern that as DRAM density increases further, and thus the components on chips get smaller, while operating voltages continue to fall, DRAM chips will be affected by such radiation more frequently, since lower-energy particles will be abl
|
https://en.wikipedia.org/wiki/Troy%20University%20Public%20Radio
|
Troy Public Radio is a network of public radio stations based in Troy, Alabama, United States, that serve southeastern Alabama and parts of western Georgia and northwestern Florida with classical music, folk music, and jazz programs, as well as news and feature programs from the National Public Radio, Public Radio Exchange, and American Public Media networks. The stations are licensed to Troy University, on whose main campus the studios are located.
History
WTSU-FM started broadcasting on March 1, 1977 as the state's third public radio station (the callsign stands for the university's name then, "Troy State University,"), and the first south of Birmingham. WTSU originally broadcast at 90.1 MHz with a power of 50,000 watts; by 1981, it moved to its present frequency of 89.9, doubling its wattage to 100,000. Programming from the start was a blend of NPR news and classical music, combined with an automated block of "beautiful music" between 9:00 a.m. and 4:00 p.m. TUPR discontinued the easy-listening daytime format in 1993 in favor of then-more conventional classical programming.
The station would expand its service area to all of southeastern Alabama in the 1980s, adding the frequencies in Columbus in 1984 and Dothan in 1986. On January 1, 2000, TUPR began broadcasting 24 hours per day.
Public Radio is one component of Troy University's Broadcast and Digital Network; the other is "TrojanVision", a student-operated television channel seen on several cable systems throughout southeastern Alabama. The Broadcast and Digital Network enlist students from the Hall School of Journalism as staffers.
TUPR set a tentative date of May 2010 to begin streaming all three HD channels. HD-2 consists of the all-music Classical 24 network, while HD-3 airs news programs from the BBC World Service.
In 2011, TUPR began streaming all three of its channels live on the Internet. It had been one of the few NPR members not to offer live streaming.
Network
Three stations comprise the network:
Notes:
Weekday hosts
Ann Kenda--Morning Edition
Carolyn Hutchinson--In Focus
Joey Hudson--All Things Considered
References
External links
Troy Public Radio
NPR member networks
Classical music radio stations in the United States
Radio stations established in 1977
1977 establishments in Alabama
|
https://en.wikipedia.org/wiki/CSN.1
|
In telecommunications and computer networking, Concrete Syntax Notation One (CSN.1) is a standard and flexible notation that describes data structures for representing, encoding, transmitting, and decoding data, specifically GPRS used for cell phones. Many examples of CSN.1 encoded data structures can be found in 3GPP TS44.060 and an informative description of the CSN.1 syntax is found in 3GPP TS 24.007.
Here is an example of a CSN.1 description of a message. If the first bit is 1, an apple structure follows, which is a 5-bit Apple code. If the first bit is 0, on the other hand, a 3-bit orange code, and a 2-bit peel type follow.
<Example> ::= { 1 <Apple struct> | 0 <Orange struct> } 0;
<Apple struct> ::= < Apple Code : bit(5) >;
<Orange struct> ::= <Orange Code : bit(3) > <PeelType: bit(2)>;
Advantages
It is relatively simple to understand.
The notation is extremely compact - any bit can be addressed
Disadvantages
It is very difficult to maintain when extensions and new releases of the protocols need to be implemented
Creating a compiler for the language is very difficult, because the language can include expressions that refer to any named elements previously decoded.
The CSN.1 structures listed in communication standards are not checked and are often filled with errors and non-standard notation.
See also
Annex B of 3GPP TS 24.007 contains a detailed description of CSN.1.
CSN1.INFO provides a complete online description of CSN.1 (including those parts not explained on TS 24.007), with examples and common pitfalls.
External links
A free tool that encodes/decodes CSN.1 3GPP messages and allows easy editing of these messages.
Mobile telecommunications standards
3GPP standards
|
https://en.wikipedia.org/wiki/Pan-Borneo%20Highway
|
Pan Borneo Highway (), also known as Trans-Borneo Highway or Trans-Kalimantan Highway (), is a road network on Borneo Island connecting two Malaysian states, Sabah and Sarawak, with Brunei and Kalimantan region in Indonesia. The highway is numbered AH150 in the Asian Highway Network and as Federal Route 1 in Sarawak. In Sabah, the route numbers given are 1, 13 and 22. The highway is a joint project between both governments which started as soon as the formation of Malaysia in 1963 which comprised Malaya, Sabah, Sarawak and Singapore. The lack of a road network system in Sarawak was the main factor of the construction.
The length of the entire highway is expected to be about for the Malaysian section, for the Bruneian section and for the Indonesian section. The Indonesian sections of the Pan Borneo Highway is known as the Trans-Kalimantan Highway. The western route connects the city of Pontianak to Tebedu.
Route background
The Pan-Borneo Highway, Asian Highway Route AH150 is supposed to be a circular highway that runs along the coastlines of Sabah, Sarawak, Brunei and Kalimantan. However, a missing link does exist from Serudong, Sabah to Simanggaris, North Kalimantan, which is supposed to connect Sabah with North Kalimantan.
The Malaysian section of the Pan-Borneo Highway is signposted as Federal Route 1 in Sarawak and Federal Routes 1, 22 and 13 in Sabah. The 1,077-km highway in Sarawak is divided to 92 sections altogether, and the sections are sometimes being signposted along with the route number with the syntax of xx-yy, where xx is the route number and yy is the section code. In Brunei, the highway is signposted simply as the AH150.
In Kalimantan, the Trans-Kalimantan Highway consists of three main highways. The northern route, also dubbed as Trans Border Highway (Jalan Lintas Perbatasan), runs along the Malaysia-Indonesia border from Tamajuk to Sei Ular. The central route runs from Pontianak to Samarinda through the interior of Kalimantan. The southern route, which runs along the coastline of Kalimantan from Sambas to Simanggaris, is gazetted as the Indonesian section of the Asian Highway Route AH150. None of the three highways bear any route number yet.
The Malaysian and Indonesian sections are linked together by a highway known as the Trans-Malindo Highway (Jalan Lintas Malindo), which is gazetted as Federal Route 21 in Malaysia.
History
The Pan-Borneo Highway was built due to the lack of the intercity highway network in the island of Borneo. In East Malaysia, the intercity highway plan only existed after the Second World War ended in 1945, after the states of North Borneo (Sabah) and Sarawak were ceded to Britain to become British Crown Colonies. By 1949, the Governor of North Borneo reported that there were of roads paved with asphalt, of other metalled roads, of dirt roads and of bridle paths.
The construction of the intercity highway network in Sabah and Sarawak intensified at a faster pace after both states participat
|
https://en.wikipedia.org/wiki/MyLifeBits
|
MyLifeBits is a life-logging experiment begun in 2001. It is a Microsoft Research project inspired by Vannevar Bush's hypothetical Memex computer system. The project includes full-text search, text and audio annotations, and hyperlinks. The "experimental subject" of the project is computer scientist Gordon Bell, and the project will try to collect a lifetime of storage on and about Bell. Jim Gemmell of Microsoft Research and Roger Lueder were the architects and creators of the system and its software.
MyLifeBits is an attempt to fulfill Vannevar Bush's vision of an automated store of the documents, pictures (including those taken automatically), and sounds an individual has experienced in his lifetime, to be accessed with speed and ease. For this, Bell has digitized all documents he has read or produced, CDs, emails, and so on. He continues to do so, gathering web pages browsed, phone and instant messaging conversations and the like more or less automatically. The book Total Recall describes the vision and implications for a personal, lifetime e-memory for recall, work, health, education, and immortality.
In 2010, Total Recall was published in paperback. , Bell was no longer using the wearable camera associated with the project. He described the rise of the smartphone as largely fulfilling Bush's vision of the Memex.
See also
Dymaxion Chronofile
Lifelog
Microsoft SenseCam
References
External links
MyLifeBits - Microsoft Research Archived version.
Gordon Bell and Jim Gemmell – A look into Microsoft's Bay Area Research Center, Part I Channel9 video, including MyLifeBits material.
Flogging Gordon Bell's Memory Thinking about how lifelogs, or flogs, would fundamentally change psychotherapy and psychiatry.
"A Head For Detail" Clive Thompson, Fast Company
Microsoft Research
|
https://en.wikipedia.org/wiki/Cook%27s%20distance
|
In statistics, Cook's distance or Cook's D is a commonly used estimate of the influence of a data point when performing a least-squares regression analysis. In a practical ordinary least squares analysis, Cook's distance can be used in several ways: to indicate influential data points that are particularly worth checking for validity; or to indicate regions of the design space where it would be good to be able to obtain more data points. It is named after the American statistician R. Dennis Cook, who introduced the concept in 1977.
Definition
Data points with large residuals (outliers) and/or high leverage may distort the outcome and accuracy of a regression. Cook's distance measures the effect of deleting a given observation. Points with a large Cook's distance are considered to merit closer examination in the analysis.
For the algebraic expression, first define
where is the error term, is the coefficient matrix, is the number of covariates or predictors for each observation, and is the design matrix including a constant. The least squares estimator then is , and consequently the fitted (predicted) values for the mean of are
where is the projection matrix (or hat matrix). The -th diagonal element of , given by , is known as the leverage of the -th observation. Similarly, the -th element of the residual vector is denoted by .
Cook's distance of observation is defined as the sum of all the changes in the regression model when observation is removed from it
where p is the rank of the model and is the fitted response value obtained when excluding , and is the mean squared error of the regression model.
Equivalently, it can be expressed using the leverage ():
Detecting highly influential observations
There are different opinions regarding what cut-off values to use for spotting highly influential points. Since Cook's distance is in the metric of an F distribution with and (as defined for the design matrix above) degrees of freedom, the median point (i.e., ) can be used as a cut-off. Since this value is close to 1 for large , a simple operational guideline of has been suggested.
The -dimensional random vector , which is the change of due to a deletion of the -th case, has a covariance matrix of rank one and therefore it is distributed entirely over one dimensional subspace (a line) of the -dimensional space.
However, in the introduction of Cook’s distance, a scaling matrix of full rank is chosen and as a result is treated as if it is a random vector distributed over the whole space of dimensions.
Hence the Cook's distance measure does not always correctly identify influential observations.
Relationship to other influence measures (and interpretation)
can be expressed using the leverage () and the square of the internally Studentized residual (), as follows:
The benefit in the last formulation is that it clearly shows the relationship between and to (while p and n are the same for all observations). If
|
https://en.wikipedia.org/wiki/Trusted%20Network%20Connect
|
Trusted Network Connect (TNC) is an open architecture for Network Access Control, promulgated by the Trusted Network Connect Work Group (TNC-WG) of the Trusted Computing Group (TCG).
History
The TNC architecture was first introduced at the RSA Conference in 2005. TNC was originally a network access control standard with a goal of multi-vendor endpoint policy enforcement.
In 2009 TCG announced expanded specifications which extended the specifications to systems outside of the enterprise network. Additional uses for TNC which have been reported include Industrial Control System (ICS), SCADA security, and physical security.
Specifications
Specifications introduced by the TNC Work Group:
TNC Architecture for Interoperability
IF-IMC - Integrity Measurement Collector Interface
IF-IMV - Integrity Measurement Verifier Interface
IF-TNCCS - Trusted Network Connect Client-Server Interface
IF-M - Vendor-Specific IMC/IMV Messages Interface
IF-T - Network Authorization Transport Interface
IF-PEP - Policy Enforcement Point Interface
IF-MAP - Metadata Access Point Interface
CESP - Clientless Endpoint Support Profile
Federated TNC
TNC Vendor Adoption
A partial list of vendors who have adopted TNC Standards:
ArcSight
Aruba Networks
Avenda Systems
Enterasys
Extreme Networks
Fujitsu
IBM
Pulse Secure
Juniper Networks
Lumeta
McAfee
Microsoft
Nortel
ProCurve
strongSwan
Wave Systems
Also, networking by
Cisco
HP
Symantec
Trapeze Networks
Tofino
TNC Customer Adoption
The U.S. Army has planned to use this technology to enhance the security of its computer networks.
The South Carolina Department of Probation, Parole, and Pardon Services has tested a TNC-SCAP integration combination in a pilot program.
See also
IF-MAP
Trusted Computing
Trusted Computing Group
Trusted Internet Connection
References
Sources
Dornan, Andy. “'Trusted Network Connect' Puts Hardware Security Agent In Every PC”, “Information Week Magazine”, UBM Techweb Publishing.
Vijayan, Jaikumar. “Vendor Group Adds Net Access Specs”, “Computer World Magazine”, IDG Publishing.
Higgins, Kelly Jackson. “Trusted Computing Group Widens Security Specs Beyond Enterprise Networks”, “Dark Reading”, UBM Techweb Publishing.
Townsend, Mark. “Naked endpoints on your net, and what to do about them”, “SC Magazine”, Haymarket Media.
Fang, Juan and Zeng, Hongli. “The Model of Trusted Network Connect Based on Credibility of the Hierarchy”, nswctc, vol. 2, pp. 454–457, 2010 Second International Conference on Networks Security, Wireless Communications and Trusted Computing, 2010.
Howard, Scott (2010-06)(“Securing SCADA and Control Networks”, “urunkoruma.com”.
External links
Trusted Network Connect
Specifications
TNC SDK
Computer network security
Trusted computing
|
https://en.wikipedia.org/wiki/Apple%20II%20processor%20cards
|
Apple II processor cards (or co-processor cards) were special cards that could be used to allow the Apple II to use different processors on the (otherwise) same computer hardware. This allowed other operating systems to run on the Apple II.
Here are some processors that were available on coprocessor cards for the Apple II:
Zilog Z80 – Microsoft SoftCard or compatibles, ran CP/M
Intel 8088 – the AD8088 Processor Card, from ALF Products, ran CP/M-86 and MS-DOS as well as increased the speed of math functions in Applesoft BASIC. MetaCard, from Metamorphic Systems (a 1982 startup by Phil Zimmermann), ran CP/M-86, MS-DOS, and UCSD Pascal
Motorola 6809 – The Mill, by Stellation Two, ran OS-9 Level One. AP10 by IBS running FLEX
Motorola 68008 – mc magazine
DEC LSI-11 – (unconfirmed)
See also
Apple II peripheral cards
References
Processor cards
Compatibility cards
|
https://en.wikipedia.org/wiki/Temptation%20%28Australian%20game%20show%29
|
Temptation is an Australian game show which premiered on the Nine Network on 30 May 2005 and aired at 7.00pm (5.30pm for most regionals). Hosted by Ed Phillips and Livinia Nixon, the show was a remake of Sale of the Century, which aired on Nine in the same timeslot for more than twenty years between 1980 and 2001. Temptation had the same general format of its predecessor, but with several new features and a de-emphasis on the "shopping" aspects of the endgame. The show ran until 30 November 2007, when it was placed on hiatus by the network following strong competition from game show Deal or No Deal on the rival Seven Network; during the hiatus, Nine filled the timeslot with episodes of the American sitcom Two and a Half Men. When Ed Phillips made an appearance on The NRL Footy Show he announced "maybe summer" would be the return of the show. This statement was accurate, as Temptation returned for a shortened fourth series from 1 December 2008 with unaired episodes which were recorded during 2008. During that time, Ed Phillips was dumped by the Nine Network after his contract expired in November, and Temptation never returned to the schedule. After 23 January 2009, when the show's final episode aired, all Temptation websites were removed, and Two and a Half Men returned to Channel Nine's 7:00pm schedule.
Format
Main game
As in Sale, the game was split into four rounds. Contestants begin with a score of . When Ed Phillips asks a question, the first contestant to buzz in had the chance to answer the question; if correct, he or she gained $5; if wrong, he or she lost $5. Phillips revealed the answer immediately if the contestant answered incorrectly; no other contestants were given the opportunity to answer. Contestants needed not wait until Phillips had finished asking the question before buzzing in.
Also throughout the game were several "Who Am I?" questions. Phillips read out a series of clues to the identity of a famous person, revealing facts which became progressively more helpful; the final and most helpful clue was the person's first name and last initial. As before, the first contestant to buzz in had the chance to answer the question; if correct, he or she made a "famous faces" selection (see below); if wrong, he or she lost no money, but Phillips continued reading clues and the other contestants were given the chance to answer.
Round One: After the first three questions, there was a 20-second "Sprint" speed round. Immediately after this, the first Gift Shop of the night was offered to the leading player or players. The first Gift Shop item cost $6, and usually had a retail cost between $1,500 and $2,500; this $6 price could be reduced at the discretion of producers, or alternatively an additional cash incentive could be included into the prize, which was usually either $200 or $400. In any Gift Shop, if two or more players were tied in the lead, Ed would conduct a Dutch auction.
There were a few more questions, and then the first "Who
|
https://en.wikipedia.org/wiki/Cyrix%20coma%20bug
|
The Cyrix coma bug is a design flaw in Cyrix 6x86 (introduced in 1996), 6x86L, and early 6x86MX processors that allows a non-privileged program to hang the computer.
Discovery
According to Andrew Balsa, around the time of the discovery of the F00F bug on Intel Pentium, Serguei Shtyliov from Moscow found a flaw in a Cyrix processor while developing an IDE disk driver in assembly language. Alexandr Konosevich, from Omsk, further researched the bug and coauthored an article with Uwe Post in the German technology magazine c't, calling it the "hidden CLI bug" (CLI is the instruction that disables interrupts in the x86 architecture). Balsa, as a member on the Linux kernel mailing list, confirmed that the following C program (which uses inline x86-specific assembly language) could be compiled and run by an unprivileged user:
unsigned char c[4] = {0x36, 0x78, 0x38, 0x36};
int main()
{
asm (
" movl $c, %ebx\n"
"again: xchgl (%ebx), %eax\n"
" movl %eax, %edx\n"
" jmp again\n"
);
}
Execution of this program renders the processor completely useless until it is rebooted, as it enters an infinite loop that cannot be interrupted. This allows any user with access to a Cyrix system with this bug to perform a denial-of-service attack.
It is similar to execution of a Halt and Catch Fire instruction, although the coma bug is not any one particular instruction.
Analysis
What causes the bug is not an interrupt mask, nor are interrupts being explicitly disabled. Instead, an anomaly in the Cyrix's instruction pipeline prevents interrupts from being serviced for the duration of the loop; since the loop never ends, interrupts will never be serviced. The xchg instruction is atomic, meaning that other instructions are not allowed to change the state of the system while it is executed. In order to ensure this atomicity, the designers at Cyrix made the xchg uninterruptible. Due to pipelining and branch predicting, however, another xchg enters the pipeline before the previous one completes, causing a deadlock.
Workarounds
A fix for unintentional instances of the bug is to insert another instruction in the loop, the nop instruction being a good candidate. Cyrix suggested serializing the xchg opcode, thus bypassing the pipeline. However, these techniques will not serve to prevent deliberate attacks.
One can also prevent the bug by disabling implicit bus locking normally done by xchg instruction. This is accomplished by setting bit four (mask of 0x10) in the configuration register, CCR1.
See also
Pentium F00F bug
Halt and Catch Fire
Notes
External links
Andrew Balsa's early description of the bug
Cx6x86 registers (and undocumented features)
Hardware bugs
Denial-of-service attacks
|
https://en.wikipedia.org/wiki/The%20Torkelsons
|
The Torkelsons is an American sitcom television series which aired on the NBC television network from September 21, 1991, to June 6, 1993. Produced by Walt Disney Television in season 1 and Touchstone Television in season 2, the series starred Connie Ray, Olivia Burnette, and William Schallert. For the second and final season, the series was retooled and renamed Almost Home. The series lasted a total of two seasons, consisting of 33 episodes.
Synopsis
Living in Pyramid Corners, a community near Vinita, Oklahoma, Millicent Torkelson (Connie Ray) did what she could to survive financially after her husband Randy (Gregg Henry) left the family. Randy later returned and was seen in 2 episodes, and the couple ended up divorcing. The pilot episode deals with Millicent being so far in debt that she even has her home appliances repossessed. To support her family, Millicent gets a boarder named Wesley Hodges (William Schallert) who ends up living with them for the year in the house basement.
Millicent's children were 14-year-old Dorothy Jane (Olivia Burnette), sweet and exceptionally articulate for her age, who also served running commentary throughout the show by having talks with the "Man in the Moon" by her bedroom window; 12-year-old Steven Floyd (Aaron Michael Metchik), the athletic second-oldest; 10-year-old Ruth Ann (Anna Slotky), who was musically inclined; 8-year-old Chuckie Lee (Lee Norris), the bug collector, always recognizable with his thick-rimmed glasses; and the youngest, 6-year-old Mary Sue (Rachel Duncan), who acted as if nothing was ever wrong. In the first episode, Dorothy Jane meets 18-year-old new neighbor Riley Roberts (Michael Landes) for the first time and becomes infatuated with him. Throughout the first season Riley remains oblivious to this, mainly because of her being a high-school freshman while he was a senior, but they do develop a strong connection. Meanwhile, pesky but well-meaning Kirby Scroggins, a plaid-clad nerd, was forever chasing an uninterested Dorothy Jane. Although her family embarrasses her, Dorothy never let anyone else make fun of them. The pilot also featured Ernie Lively as Jacob "J.W." Presley, a butcher who is smitten with Millicent. In the pilot episode, Benj Thall and Elizabeth Poyer played Steven Floyd and Ruth Ann Torkelson. All these actors were originally to be permanent parts of the show so were credited in the pilot's opening sequence, but the children were subsequently recast, and the character of J.W. was dropped entirely.
Almost Home
After ending its first season on June 16, 1992, the series was retooled and renamed Almost Home. Premiering on February 6, 1993, the second incarnation features the Torkelsons relocating to Seattle after Millicent accepts a job as a nanny, following the foreclosure of the Torkelson family home. In this series, Steven Floyd and Ruth Ann were now considered to have never existed as Millicent refers to Chuckie Lee in Almost Home as her only son and Chuckie Lee refer
|
https://en.wikipedia.org/wiki/Jesse%20Stagg
|
Jesse Stagg is a creative director, writer and producer.
See also
Cartoon Network - What A Cartoon!
Batman Beyond
External links
Vice: World Unknown: South African Acid House
History of South African Dance Culture
Iraq War Billboard Statement - LA Times
1970 births
Advertising directors
American art directors
Living people
|
https://en.wikipedia.org/wiki/Conky
|
Conky may refer to:
Conky (software), a computer software used for system monitoring
Conky, a hand puppet used by Bubbles on Trailer Park Boys
"Conky", an episode of Trailer Park Boys
See also
Conky 2000, a robot on Pee-wee's Playhouse
Conkey, a surname
Konqi, the green dragon mascot for the KDE community
|
https://en.wikipedia.org/wiki/Catholic%20Church%20in%20the%20Republic%20of%20the%20Congo
|
The Catholic Church in the Republic of Congo is part of the worldwide Catholic Church, under the spiritual leadership of the Pope in Rome.
According to the Association of Religion Data Archives, 61.62% of the population was Catholic in 2020.
There are three archdioceses and six suffragan dioceses.
Brazzaville
Gamboma
Kinkala
Owando
Impfondo
Ouesso
Pointe-Noire
Dolisie
Nkayi
See also
Religion in the Republic of the Congo
References
Congo
Congo
|
https://en.wikipedia.org/wiki/PDAG
|
PDAG may refer to:
Propositional directed acyclic graph, a data structure in computer science
Mixed graph or partially directed acyclic graph
|
https://en.wikipedia.org/wiki/Euclid%27s%20Data
|
Data (Greek: Δεδομένα, Dedomena) is a work by Euclid. It deals with the nature and implications of "given" information in geometrical problems. The subject matter is closely related to the first four books of Euclid's Elements.
Editions and translations
Greek text
Data, ed. H. Menge, in Euclidis opera omnia, vol. 6, Leipzig: Teubner, 1896 (Google Books, Wilbour Hall)
English versions
Translated by Robert Simson: 1821 edition, 1838 edition
The Data of Euclid, trans. from the text of Menge by George L. McDowell and Merle A. Sokolik, Baltimore: Union Square Press, 1993 ()
The Medieval Latin Translation of the Data of Euclid, translated by Shuntaro Ito, Tokyo University Press, 1980 and Birkhauser, 1998. ()
Ancient Greek mathematical works
Works by Euclid
|
https://en.wikipedia.org/wiki/Pepsi%20Chart
|
The Pepsi Chart (previously known as "The Pepsi Network Chart Show") was a networked Sunday afternoon Top 40 countdown on UK radio that started life on 1 August 1993 with Neil 'Doctor' Fox hosting the show live from the Capital Radio studios in London. The Pepsi Chart show carried an emphasis in fun and was the UK's first personality-led chart show: the presenter was live and exciting and big-prize competitions were held.
The Pepsi Chart was produced for the Commercial Radio Companies Association by the Unique Broadcasting Company, who along with the (then) programme director of Capital Radio Richard Park, and Fox, came up with the new show concept. The show was broadcast on between 80 and 110 local commercial radio stations across the UK via SMS satellite. Locums for the 'Doctor' included Capital's own Steve Penk and Key 103 Manchester's Darren Proctor. Occasional guest presenters filled in, such as Richard Blackwood of MTV UK & Ireland fame.
The Top 10 of the Pepsi Chart was the same as the official Top 10 of the UK Singles Chart that was compiled by the Official Charts Company (OCC but then CIN) and which was used by the BBC's Radio 1 Official Chart Show. However, the lower positions of 11–40 on the Pepsi Chart combined sales with radio airplay data. The Pepsi Chart was a re-branded version of The Network Chart Show which had previously been compiled by MRIB until Pepsi took over sponsorship from Nescafé in August 1993. In 1995, it was called the Pepsi Network Chart Show, but in 1996 it was renamed the Pepsi Chart.
Compilation
Different compilation methods of the chart show were employed in its time. Initially, the sales: airplay ratio for its 40-11 positions were 30:70, but later became 50:50. Sales data was provided by Chart Information Network (CIN - now known as The Official UK Charts Company) and airplay data from Music Control. The final chart show on the Sunday before the new year would air with a chart of the year, counting down the Top 40 most popular singles of that particular year. An exception took place in December 1999, the last countdown of the millennium, when the Top 40 of all time was compiled and aired instead. Elton John's Candle in the Wind came out as top. The Pepsi Chart Show used Satellite Media Services to receive new releases and interview cuts.
Show format
Over the years of the show's broadcast, little variation in the format was applied. A typical 3-hour show was aired live between 4pm and 7pm each Sunday, and consisted of the standard 40-1 singles countdown with the inclusion of recaps after every 10 songs. Competition announcements, live calls from contestants, interviews with the artists making that particular week's chart, and advertisements made up the remaining airtime. Criticism from chart purists and fans of the rival Radio 1 Official Top 40 show naturally included comment on the show's 40-11 compilation methods, regular advert slots interrupting the show, and the presenter talking over the starts and en
|
https://en.wikipedia.org/wiki/Bill%20McCuddy
|
Bill McCuddy is a comedian, and was previously an American cable news network entertainment reporter.
McCuddy, who had previously been employed in the field of advertising, began his broadcasting career in 1994 after winning a talk show host contest on CNBC featuring unknown participants. His reward was a contract to host a program that would air on America's Talking, a CNBC spin-off cable channel that would launch shortly thereafter. After his stint as the host of Wake Up America on the fledgling network, McCuddy joined Fox News in 1996 as a regular contributor to various programming on the network. In June 2007 Fox News announced it would not renew McCuddy's contract.
For a brief time McCuddy was also a writer for Saturday Night Live.
Since 2012, McCuddy has co-hosted the roundtable movie review series "Talking Pictures on Demand" with Neil Rosen and Lisa Rosman for Time Warner Cable. In August 2015, McCuddy and Rosen launched the "Sitting Around Talking Movies" podcast. Bill is a founding member of the Whiskey Heaven club in Bridgehampton, NY.
American male journalists
Living people
Year of birth missing (living people)
|
https://en.wikipedia.org/wiki/MikroMikko
|
MikroMikko was a Finnish line of microcomputers released by Nokia Corporation's computer division Nokia Data from 1981 through 1987. MikroMikko was Nokia Data's attempt to enter the business computer market. They were especially designed for good ergonomy.
History
The first model in the line, MikroMikko 1, was released on 29 September 1981, 48 days after IBM introduced its Personal Computer. The launch date of MikroMikko 1 is the name day of Mikko in the Finnish almanac. The MikroMikko line was manufactured in a factory in the Kilo district of Espoo, Finland, where computers had been produced since the 1960s. Nokia later bought the computer division of the Swedish telecommunications company Ericsson.
During Finland's economic depression in the early 1990s, Nokia streamlined many of its operations and sold many of its less profitable divisions to concentrate on its key competence of telecommunications. Nokia's personal computer division was sold to the British computer company ICL (International Computers Limited) in 1991, which later became part of Fujitsu. However, ICL and later Fujitsu retained the MikroMikko trademark in Finland. Internationally the MikroMikko line was marketed by Fujitsu under the trademark ErgoPro.
Fujitsu later transferred its personal computer operations to Fujitsu Siemens Computers, which shut down its only factory in Espoo at the end of March 2000, thus ending large-scale PC manufacturing in the country.
Models
MikroMikko 1 M6
Processor: Intel 8085, 2 MHz
64 KB RAM, 4 KB ROM
Display: 80×24 character text mode, the 25th row was used as a status row. Graphics resolutions 160×75 and 800×375 pixels, refresh rate 50 Hz
Two 640 KB 5.25" floppy drives (other models might only have one drive)
Optional 5 MB hard disk (stock in model M7)
Connectors: two RS-232s, display, printer, keyboard
Software: Nokia CP/M 2.2 operating system, Microsoft BASIC, editor, assembler and debugger
Cost: 30,000 mk in 1984
MikroMikko 2
Released in 1983
Processor: Intel 80186
Partly MS-DOS compatible, used Nokia's own version of MS-DOS 2.x
MikroMikko 3
Released in 1986
PC/AT compatible
Processor: 6 or 8 MHz Intel 80286
Hercules monitor
Six extension card slots
Mouse
Cost: 47,950 mk
MikroMikko 3 TT
Team workstation, released in spring 1987
Processor: 8 MHz Intel 80286
1 MB RAM
Two extension card slots
One or two 3.5" 720 KB floppy drives
Optional 20 MB hard disk
MS-DOS 3.2 operating system
Cost: with one floppy drive 21,500 mk, two drives 23,000 mk, one floppy drive and 20 MB hard disk 25,900 mk
MikroMikko 3 TT M125
Processor: 33 MHz Intel 80386DX
4 MB RAM
1.44 MB 3.5" floppy drive
40 MB hard disk
Connectors: display, keyboard, mouse, RS-232 serial port, Centronics printer port
Software: MS-DOS 5.0 operating system
Laptop computers
MikroMikko 4m310
MikroMikko N3/25x
Tiimi workgroup system
The "Tiimi" workgroup system was a local area network consisting of MikroMikko workstations and servers, popular in the lat
|
https://en.wikipedia.org/wiki/Arab%20News%20Network
|
Arab News Network (ANN) was an Arab news channel broadcast on satellite from London.
History and profile
ANN was established in 1997. The channel is currently owned by Siwar al Assad, a first cousin of the President of Syria, Bashar al-Assad. The channel states its goal to be democratic reform.
The station broadcast daily English news from November 2004 to March 2006, but since then had been broadcasting solely in Arabic until 2014. The desire to remove the programme reflected a change in management. Ribal al-Assad, took over as director of the London Bureau from 2006 to 2010. He decided to cancel the English programming due what he perceived to be the lack of an audience for it. However, since the latest change of management in 2010, the new proprietor, Siwar al Assad, has decided to reintroduce English Language programming alongside the Arabic. In 2014 Siwar launched a program modeled on the BBC's Hardtalk called The English Hour which is recorded in London broadcast at peak time and subtitled in Arabic.
The channel has faced some financial issues. Major restructuring has been undertaken and technological updates have been acquired by the channel in order to improve its image.
ANN formerly broadcast on Hotbird and Arabsat but now broadcasts on Nilesat.
References
External links
Channel info
The English Hour Blog
A.N.N. online (online streaming)
The A.N.N. website
Arabic-language television stations
Television channels and stations established in 1997
|
https://en.wikipedia.org/wiki/Compact%20Macintosh
|
A Compact Macintosh (or Compact Mac) is an all-in-one Apple Mac computer with a display integrated in the computer case, beginning with the original Macintosh 128K. Compact Macs include the original Macintosh through to the Color Classic sold between 1984 and 1995. The larger Macintosh LC 500 series, Power Macintosh 5000 series, iMac and eMac are not described as a "Compact Mac."
Apple divides these models into five form factors: The Macintosh 128K, Macintosh SE, and Macintosh Classic (all with a black and white screen), the modernized Macintosh Color Classic with a color screen, and the very different Macintosh XL.
Models
*220 V international models are appended with the letter "P" (e.g. M0001P)
Timeline
See also
All-in-one desktop computer
References
Compact Macs Index and Compact Macs Guide at lowendmac.com
Early Compact "Classic" Macs at EveryMac
External links
The Vintage Mac Museum: Compact Mac -9inch/mono Display 68000-
Macintosh case designs
Computer-related introductions in 1984
Products and services discontinued in 1995
Discontinued Apple Inc. products
|
https://en.wikipedia.org/wiki/Microcom%20Networking%20Protocol
|
The Microcom Networking Protocols, almost always shortened to MNP, is a family of error-correcting protocols commonly used on early high-speed (2400 bit/s and higher) modems. Originally developed for use on Microcom's own family of modems, the protocol was later openly licensed and used by most of the modem industry, notably the "big three", Telebit, USRobotics and Hayes. MNP was later supplanted by V.42bis, which was used almost universally starting with the first V.32bis modems in the early 1990s.
Overview
Although Xmodem was introduced 1977, as late as 1985 The New York Times described XMODEM first, then discussed MNP as a leading contender, and that 9600 baud modems "are beginning to make their appearance."
By 1988, the Times was talking about 9600 and 19.2K, and that "At least 100 other brands of modems follow" MNP (compared to Hayes' use of LAP-B).
Error correction basics
Modems are, by their nature, error-prone devices. Noise on the telephone line, a common occurrence, can easily mimic the sounds used by the modems to transmit data, thereby introducing errors that are difficult to notice. For some tasks, like reading or writing simple text, a small number of errors can be accepted without causing too many problems. For other tasks, like transferring computer programs in machine format, even one error can render the received data useless. As modems increase in speed by using up more of the available bandwidth, the chance that random noise would introduce errors also increases; above 2400 bit/s these errors are quite common.
To deal with this problem, a number of file transfer protocols were introduced and implemented in various programs. In general, these protocols break down a file into a series of frames or packets containing a number of bytes from the original file. Some sort of additional data, normally a checksum or CRC, is added to each packet to indicate whether the packet encountered an error while being received . The packet is then sent to the remote system, which recomputes the checksum or CRC of the data and compares it to the received checksum or CRC to determine if it was received properly. If it was, the receiver sends back an ACK (acknowledgement) message, prompting the sender to send the next packet. If there was any problem, it instead sends a NAK (not-acknowledged) message, and the sender resends the damaged packet.
This process introduces "overhead" into the transfer. For one, the additional checksum or CRC uses up time in the channel that could otherwise be used to send additional data. This is a minor concern, however, unless the packets are very small (which they are in UUCP for instance). A more serious concern is the time needed for the receiver to examine the packet, compare it to the CRC, and then send the ACK back to the sender. This delay grows in relative terms as the speed of the modem increases; the latency of the phone line is a constant, but the amount of data that could be sent in that fixed amount o
|
https://en.wikipedia.org/wiki/National%20Association%20of%20Women%20Business%20Owners
|
The National Association of Women Business Owners (NAWBO) is an organization in the United States founded in 1975 that has the purpose of networking the approximately 10.6 million women-owned businesses so as to provide mutual support, share resources, and provide a single voice to help shape economic and public policy. As of 2007, the president of the organization is Lisa Kaiser Hickey of Lakeland, Florida.
History
According to its official timeline, NAWBO was founded in 1975 by a group of like-minded businesswomen in Washington D.C. area. It was incorporated as the Association of Women Business Owners (AWBO) before evolving to its current name.
In 1982, NAWBO held its first conference in Houston, Texas. Its first National Public Affairs Day saw the attendance of then-US Vice President George H. W. Bush and nine members of the U.S. Congress. Eight years later, it moved its headquarters from Chicago to Silver Spring, Maryland.
NAWBO has chapters in all 50 states, including several chapters in a single state, such as Illinois and California.
Remarkable Woman Award
NAWBO presents the annual Remarkable Woman Award. The first award was given out in 1996 to women who contributed time and talent to their organization and community.
Members
Charlotte chapter
President: Marise Kumar, C2B Strategies
Brenda Harris, BPN Healthcare Concepts
Carolina Aponte, Caja Holdings LLC
Vilma Betancourt-O'Day,
Carol Bondy, Center for the Healing Arts, LLC
Lauren Cantor, The Entrepreneuers Source
Mindy Hinson, M3 Real Estate Group
Laurie Johnson, Financial Therapist
Suzy Johnson, Employer Benefit Advisors of the Carolinas, LLC
Melinda McVadon, McLynn Group
Donna North, McLynn Group
Elaine Piraneo, Accubill/Tele-Vantage Inc
Stacey Randall, Growth By Referrals
Pam Secrest, Pentagon Group
Michelle Smith, MBS Custom Business Solutions, LLC
New Orleans chapter
President: Shelly Grimm-Latino, LUTCF - Pinnacle Financial Strategies
Tonia D. Aiken - Breezzangel, LLC
Jennifer F. Brimm - Foster-Brimm Consulting
Miriam Browns - Browns Tax Services, Inc.
Georgia Collier-Bolling
Deanna Causey - Sankofa Record Retrieval, LLC
Elizabeth "Dee" Clubb - Omni Advertising
McKenzie Coco - FSC Interactive
Myra L. Corrello - Find Your Spice Seminars, LLC
Sheila M. Craft - OfficeLink LC and FileLink
Nicole Dennis - XOCOMP, LLC
Patricia R Hightower CEO - Bayouequity Mortgage
Terri Hogan Dreyer - Nano, LLC
Robin G. Kaplan - Inn The Quarter, LLC
Teresa Lawrence - Delta Personnel, Inc.
Barbara Ann Locklear - Hotel Storyville
Ashley Machen - Treasure Travel, LLC
Martha Madden - M Madden Associates, LLC
Tina Dandry-Mayes, CLU, ChFC, CLTC - NYLIFE Securities, LLC/ New York
Cheryl Meral - MCS Software, LLC
Brenda Prudhomme - K-Paul's Louisiana Kitchen
Jessica Rareshide CPC CSP - Rare insight, LLC
Gina N. Ruttley -Ericksen, Krentel, &LaPorte, LLC
Jeffrie Schultis Fricke - Paramount Shows
Janet Fabre Smith - Fabre Smith & Co.
Dorothy L Tarver - Taggart Mort
|
https://en.wikipedia.org/wiki/Reactome
|
Reactome is a free online database of biological pathways. There are several Reactomes that concentrate on specific organisms, the largest of these is focused on human biology, the following description concentrates on the human Reactome. It is authored by biologists, in collaboration with Reactome editorial staff. The content is cross-referenced to many bioinformatics databases. The rationale behind Reactome is to visually represent biological pathways in full mechanistic detail, while making the source data available in a computationally accessible format.
The website can be used to browse pathways and submit data to a suite of data analysis tools. The underlying data is fully downloadable in a number of standard formats including PDF, SBML and BioPAX. Pathway diagrams use a Systems Biology Graphical Notation (SBGN)-based style.
The core unit of the Reactome data model is the reaction. Entities (nucleic acids, proteins, complexes and small molecules) participating in reactions form a network of biological interactions and are grouped into pathways. Examples of biological pathways in Reactome include signaling, innate and acquired immune function, transcriptional regulation, translation, apoptosis and classical intermediary metabolism.
The pathways represented in Reactome are species-specific, with each pathway step supported by literature citations that contain an experimental verification of the process represented. If no experimental verification using human reagents exists, pathways may contain steps manually inferred from non-human experimental details, but only if an expert biologist, named as Author of the pathway, and a second biologist, names as reviewer, agree that this is a valid inference to make. The human pathways are used to computationally generate by an orthology-based process derived pathways in other organisms.
Database organization
In Reactome, human biological processes are annotated by breaking them down into series of molecular events. Like classical chemistry reactions each Reactome event has input physical entities (substrates) which interact, possibly facilitated by enzymes or other molecular catalysts, to generate output physical entities (products).
Reactions include the classical chemical interconversions of intermediary metabolism, binding events, complex formation, transport events that direct molecules between cellular compartments, and events such as the activation of a protein by cleavage of one or more of its peptide bonds. Individual events can be grouped together into pathways.
Physical entities can be small molecules like glucose or ATP, or large molecules like DNA, RNA, and proteins, encoded directly or indirectly in the human genome. Physical entities are cross-referenced to relevant external databases, such as UniProt for proteins and ChEBI for small molecules. Localization of molecules to subcellular compartments is a key feature of the regulation of human biological processes, so molecules in the
|
https://en.wikipedia.org/wiki/Transilien%20Line%20N
|
Transilien Line N is a railway line of the Paris Transilien suburban rail network operated by the SNCF. The trains on this line travel between Gare Montparnasse in Paris and the west of Île-de-France region, with termini in Rambouillet, Dreux and Mantes-la-Jolie on a total of . The line has a total of 117,000 passengers per weekday. Passenger service started in 2004.
Rolling stock
As of October 2022, the following trains are operated on the line : SNCF Class Z 57000 (Regio 2N), and occasionally SNCF Class Z 8800.
Former rolling stock include SNCF Class Z 5300, which only ran on sections electrified with 1500 V direct current, SNCF Class BB 27300 and (SNCF Class BB 7200 modified, since 2012, also only on sections electrified with 1500 V direct current) with voiture de banlieue à 2 niveaux coaches, which are currently being withdrawn alongside Z 8800 material.
Rambouillet Line
This line, according to SNCF, will travel from start to the terminus in 1 hour, and operates as per this route, on the Paris–Brest railway:
Gare Montparnasse
Vanves–Malakoff station
Clamart station
Meudon station
Bellevue station
Sèvres-Rive-Gauche station
Chaville-Rive-Gauche station
Viroflay-Rive-Gauche station
Versailles-Chantiers station
Saint-Cyr station
Saint-Quentin-en-Yvelines–Montigny-le-Bretonneux station
Trappes station
La Verrière station
Coignières station
Les Essarts-le-Roi station
Le Perray station
Rambouillet station
This line is electrified using a 1500 V direct current.
Dreux Line
This line according to SNCF will get from start to terminus in 1hr, and operates as per this route, on the Paris–Brest railway up to Saint-Cyr, then on the :
same route as the Rambouillet line between Paris-Montparnasse and Saint-Cyr
Fontenay-le-Fleury station
Villepreux–Les-Clayes station
Plaisir–Les-Clayes station
Plaisir–Grignon station
Villiers–Neauphle–Pontchartrain station
Montfort-l'Amaury–Méré station
Garancières–La Queue station
Orgerus–Béhoust station
Tacoignières–Richebourg station
Houdan station
Leave Île-de-France
Marchezais–Broué station
Dreux station
This line is electrified using a 1500 V direct current between the Montparnasse station and the Plaisir-Grignon station, and a 25000 V alternating current elsewhere.
Mantes-la-Jolie Line
same route as the Dreux line between Paris-Montparnasse and Plaisir - Grignon, on the Paris–Brest railway up to Saint-Cyr, then on the up to Plaisir, then on the up to Épône - Méziéres, and finally on the Paris–Le Havre railway:
Beynes station
Mareil-sur-Mauldre station
Maule station
Nézel–Aulnay station
Épône–Mézières station
Mantes-la-Jolie station
This line is electrified using a 1500 V direct current between the Montparnasse station and the Plaisir-Grignon station, and a 25000 V alternating current elsewhere.
Names of service
Like other Transilien lines the name of service consists of four letters, but is not always displayed on trains, but it can be seen on passenger information display systems.
Taking GEPU (which is
|
https://en.wikipedia.org/wiki/Transilien%20Line%20R
|
Transilien Line R is a railway line of the Paris Transilien suburban rail network. The trains on this line travel between Paris-Gare-de-Lyon in central Paris, as well as from Melun station in the suburbs, and the south-east of Île-de-France region. Transilien services from Paris-Gare-de-Lyon are part of the SNCF Gare de Lyon rail network. The line has 60,000 passengers per weekday.
Stations served
Montargis line
Paris-Gare-de-Lyon
Melun station
Bois-le-Roi station
Halte de Fontainebleau-Forêt
Fontainebleau–Avon station
Thomery station
Moret-Veneux-les-Sablons station
Montigny-sur-Loing station
Bourron-Marlotte–Grez station
Nemours–Saint-Pierre station
Bagneaux-sur-Loing station
Souppes–Château-Landon station
Dordives station
Ferrières–Fontenay station
Montargis station
Montereau line
same route as the Montargis line between Paris-Gare-de-Lyon and Moret-Veneux-les-Sablons
Saint-Mammès station
Montereau station
Montereau line (via Héricy)
Melun station
Livry-sur-Seine station
Chartrettes station
Fontaine-le-Port station
Héricy station
Vulaines-sur-Seine–Samoreau station
Champagne-sur-Seine station
Vernou-sur-Seine station
La Grande-Paroisse station
Montereau station
Services
There are three services, which are Paris-Gare-de-Lyon–Melun–Montargis, Paris-Gare-de-Lyon–Melun–Fontainebleau–Montereau and Melun–Héricy–Montereau. Like all other Transilien lines every train has a "name of service" consisting of four letters.
The first letter indicates the destination of the train. Trains to Montargis have a four-letter code beginning with G (GAMA, GAME, GAMO, GAMU, GOMO, GOMU), while those to Montereau have the first letter of the four always a K (KAMO, KOHO, KUMO). Trains to Paris-Gare de Lyon begin with P (POMA, POME, POMO, POMU, PUMA), which is also the first letter of the station's name. Those to Melun have a four-letter code beginning with Z (ZOHA).
The second letter indicates that the train might call at all stations, or at selected stations only. An "O" indicates an all stops train (French ), as in this case of GOMO, which is an all stops train to Montargis.
Trains running via Héricy have the letter H as the third letter (KOHO is an example), while trains running via Moret-Veneux-les-Sablons have the letter M as the third letter (KUMO is an example).
Rolling stock
The Transilien R line is operated by Z 5600, Z 20500 and Regio 2N trains. The rolling stock of the line is shared with that of the RER line D.
Since December 8, 2017, forty-eight Regio 2N trainsets have been progressively delivered to enable the redeployment of twenty-four Z 2N double-deck trainsets on the network's other lines, as well as the deletion of the stainless steel Z 5300 trainsets. The Syndicat des transports d'Île-de-France (STIF) decided to acquire them, during the Board of Directors meeting of December 11, 2013, so that they would completely renew the current fleet.
The Regio 2N trains will be 110 m long, double-decker, with 582 seats per train. At peak times, they
|
https://en.wikipedia.org/wiki/Transilien%20Line%20P
|
Transilien Paris-Est is a railway line of the Paris Transilien suburban rail network. The trains on this line travel between Gare de l'Est in central Paris and the east of Île-de-France region. Transilien services from Paris-Est are part of the SNCF Gare de l'Est rail network. They have a total of 83,000 passengers per weekday.
Stations served
Meaux line
Paris-Est
Chelles - Gournay Station
Vaires - Torcy Station
Lagny - Thorigny Station
Esbly Station
Meaux Station
Château-Thierry line
Paris-Est
Meaux Station
Trilport Station
Changis-Saint-Jean Station
La Ferté-sous-Jouarre Station
Nanteuil - Saâcy Station
Nogent-l'Artaud - Charly Station
Chézy-sur-Marne Station
Château-Thierry Station
La Ferté-Milon line
Paris-Est
Meaux Station
Trilport Station
Isles - Armentières - Congis Station
Lizy-sur-Ourcq Station
Crouy-sur-Ourcq Station
Mareuil-sur-Ourcq Station
La Ferté-Milon Station
Crécy-la-Chapelle line
Esbly Station
Montry - Condé Station
Couilly - Saint-Germain - Quincy Station
Villiers - Montbarbin Station
Crécy-la-Chapelle Station
Coulommiers line
Paris-Est
Tournan Station
Marles-en-Brie Station
Mortcerf Station
Guérard - La Celle-sur-Morin Station
Faremoutiers - Pommeuse Station
Mouroux Station
Coulommiers Station
Provins line
Paris-Est
Verneuil-l'Étang Station
Mormant Station
Nangis Station
Longueville Station
Sainte-Colombe - Septveilles Station
Champbenoist - Poigny Station
Provins Station
Services
Line P is operated by the six following services:
Paris-Est - Meaux
Paris-Est - Meaux - Château-Thierry
Paris-Est - Meaux - La Ferté-Milon
Esbly - Crécy-la-Chapelle
Paris-Est - Coulommiers
Paris-Est - Provins
Line P uses a four-letter mission coding system. Only in the section between Paris-Est and Chateau-Thierry the trains display the mission code; otherwise they only appear on passenger information display systems and on timetables.
NOTE: EICE, EIME, RICE and RIME are mission codes used for the line/axis between Esbly and Crécy-la-Chapelle.
Rolling stock
Current Fleet
Past fleet
See also
List of Transilien stations
References
Transilien
|
https://en.wikipedia.org/wiki/Transilien%20Paris-Nord
|
Transilien Paris-Nord is one of the sectors in the Paris Transilien suburban rail network. The trains on this sector depart from Gare du Nord in central Paris, and serve the north-west and north-east of Île-de-France region with Transilien lines H and K. Transilien services from Gare du Nord are part of the SNCF Gare du Nord rail network.
Line H
The trains on Line H travel between Gare du Nord in Paris and the north-west of Île-de-France region, with termini in Luzarches, Pontoise, Persan–Beaumont and Creil.
List of Line H stations
Pontoise branch
Gare du Nord
Saint-Denis station
Épinay–Villetaneuse station
La Barre - Ormesson station
Enghien-les-Bains station
Champ de courses d'Enghien station
Ermont–Eaubonne station
Cernay station
Franconville – Le Plessis-Bouchard station
Montigny–Beauchamp station
Pierrelaye station
Saint-Ouen-l'Aumône-Liesse station
Saint-Ouen-l'Aumône station
Pontoise station
Persan-Beaumont West Branch
Ermont-Halte station
Gros Noyer–Saint-Prix station
Saint-Leu-la-Forêt station
Vaucelles station
Taverny station
Bessancourt station
Frépillon station
Méry-sur-Oise station
Mériel station
Valmondois station
L'Isle-Adam–Parmain station
Champagne-sur-Oise station
Persan–Beaumont station
Persan-Beaumont East Branch
Deuil - Montmagny station
Groslay station
Sarcelles–Saint-Brice station
Écouen - Ézanville station
Domont station
Bouffémont - Moisselles station
Montsoult–Maffliers station
Presles–Courcelles station
Nointel - Mours station
Persan–Beaumont station
Luzarches branch
Villaines station
Belloy–Saint-Martin station
Viarmes station
Seugy station
Luzarches station
Pontoise-Creil branch
Pontoise station
Saint-Ouen-l'Aumône station
Épluches station
Pont-Petit station
Chaponval station
Auvers-sur-Oise station
same route as the Persan-Beaumont west line between Valmondois and Persan-Beaumont
Bruyères-sur-Oise station
Boran-sur-Oise station
Précy-sur-Oise station
Saint-Leu-d'Esserent station
Creil station
Services
Like other Transilien lines, every train service consists of four letters and is called a name of mission, mission code or a name of service. These have been adopted during the Transilien service update of 2004. They are only displayed on timetables and on passenger information display systems.
The first letter corresponds to the destination of the train.
A: Gare du Nord
D: Saint-Denis
E: Ermont-Eaubonne
F: Saint-Leu-la-Forêt
L: Luzarches
M: Montsoult–Maffliers
O: Pontoise
P: Persan–Beaumont
S: Sarcelles–Saint-Brice
T: Transversal (Creil, Pontoise or Persan–Beaumont) or Ermont-Eaubonne for work missions
V: Valmondois
The second, third and fourth letters indicate the stations served by the train. A Transilien Line H train calling all stations has an O as the second or the third letter (AOLA, OPOC, POVA, SOGA). An E on the second position indicates that a radial service does not serve nearly all stations on the route (LEMI, LEVI). If the train ru
|
https://en.wikipedia.org/wiki/Highways%20Act%201980
|
The Highways Act 1980 (1980 c.66) is an Act of the Parliament of the United Kingdom dealing with the management and operation of the road network in England and Wales. It consolidated with amendments several earlier pieces of legislation. Many amendments relate only to changes of highway authority, to include new unitary councils and national parks. By virtue of the Local Government (Wales) Act 1994 and the Environment Act 1995, most references to local authority are taken to also include Welsh councils and national park authorities.
By virtue of the National Assembly for Wales (Transfer of Functions) Order 1999 most references to 'the Minister' are taken to include the Senedd. The Act is split into 14 parts covering 345 sections, it also includes 25 schedules.
Part 1: Highway authorities and agreements between authorities
Part 1 includes sections 1 to 9 of the Act. The legislation contained in these sections covers:
Highway Authorities
Agreements between authorities
Part 2: Trunk roads, classified roads, metropolitan roads, special roads
Part 2 includes sections 10 to 23 of the Act. The legislation contained in these sections covers:
Trunk roads
Classified roads
Metropolitan roads
Special roads (such as motorways)
Part 3: Creation of highways
Part 3 includes sections 24 to 35 of the Act. The legislation contained in these sections covers:
Creation of new highways
Creation of new footpaths and bridleways
Dedication of highways
Private landowners sometimes display a notice quoting Section 31, when there is no dedication of a public right of way.
Part 4: Maintenance of highways
Part 4 includes sections 36 to 61 of the Act. The legislation contained in these sections covers:
Highways maintainable at public expense, and their maintenance
Maintenance of privately maintainable highways
Powers covering enforcement of liabilities and recovery of costs
Defence in respect of specific matters in legal action against a highway authority for damages for non-repair of highway
Section 38 Agreement
Under Section 38 of the Act, the highway authority may agree to adopt private roads. The authority can agree to adopt the street as a highway maintainable at public expense when all the street works have been carried out to their satisfaction, within a stated time. It is customary for the developer to enter into a bond for their performance with a bank or building society.
Part 5: Improvement of highways
Part 5 includes sections 62 to 105 of the Act. The legislation contained in these sections covers:
Various powers to improve highways including – but not limited to:
Widening of highways
Installation of guardrails
Construction, reconstruction and improvement of bridges and the like
Part 6: Navigable waters and watercourses
Part 6 includes sections 106 to 111 of the Act. The legislation contained in these sections covers:
Construction of bridges over and tunnels under navigable waters
Diversions of watercourses
Part 7: Provision of spec
|
https://en.wikipedia.org/wiki/Kurt-Schumacher-Platz%20%28Berlin%20U-Bahn%29
|
Kurt-Schumacher-Platz is a station on the line of the Berlin U-Bahn. There had been a bus link outside the station connecting Berlin's Tegel International Airport to the U-Bahn network. The station was opened on 3 May 1956 and named after famous German politician Kurt Schumacher.
The station was built by B. Grimmek, and has yellow tiles on the wall. The U6 extension between Seestrasse (Berlin U-Bahn) and Kurt-Schumacher-Platz was the first new subway line built after World War II in Berlin. After this station, the U6 trains travel above ground towards Alt-Tegel (except that Borsigwerke and Alt-Tegel stations are underground).
References
U6 (Berlin U-Bahn) stations
Buildings and structures in Reinickendorf
Railway stations in Germany opened in 1956
|
https://en.wikipedia.org/wiki/Transilien%20Paris-Saint-Lazare
|
Transilien Paris-Saint-Lazare is one of the sectors in the Paris Transilien suburban rail network. The trains on this sector depart from Gare Saint-Lazare in central Paris and serve the north and north-west of Île-de-France region with Transilien lines "J" and "L". Transilien services from Paris to Saint-Lazare are part of the SNCF Saint-Lazare rail network.
The two lines are the busiest lines in the Transilien system, excluding lines signed as part of the RER.
Line J
The trains on Line J travel between Gare Saint-Lazare in Paris and the north-west of Île-de-France region, with termini in Ermont–Eaubonne, Gisors and Vernon. The line has a total of 260,000 passengers per weekday.
List of Line J stations
Gisors Branch
Paris-Saint-Lazare
Asnières-sur-Seine station
Bois-Colombes station
Colombes station
Le Stade station
Argenteuil station
Val d'Argenteuil station
Cormeilles-en-Parisis station
La Frette–Montigny station
Herblay station
Conflans-Sainte-Honorine station
Éragny–Neuville station
Saint-Ouen-l'Aumône-Quartier de l'Église station
Pontoise station
Osny station
Boissy-l'Aillerie station
Montgeroult–Courcelles station
Us station
Santeuil–Le Perchay station
Chars station
Lavilletertre station
Liancourt-Saint-Pierre station
Chaumont-en-Vexin station
Trie-Château station
Gisors station
Ermont Branch
same route as the Gisors line between Paris-Saint-Lazare and Argenteuil
Sannois station
Ermont–Eaubonne station
Mantes Branch
same route as the Gisors line between Paris-Saint-Lazare and Conflans-Sainte-Honorine
Conflans-Fin-d'Oise station
Maurecourt station
Andrésy station
Chanteloup-les-Vignes station
Triel-sur-Seine station
Vaux-sur-Seine station
Thun-le-Paradis station
Meulan–Hardricourt station
Juziers station
Gargenville station
Issou–Porcheville station
Limay station
Mantes-Station station
Mantes-la-Jolie station
Poissy-Vernon Branch
Paris-Saint-Lazare
Houilles–Carrières-sur-Seine station
Sartrouville station
Maisons-Laffitte station
Poissy station
Villennes-sur-Seine station
Vernouillet–Verneuil station
Les Clairières de Verneuil station
Les Mureaux station
Aubergenville-Élisabethville station
Épône–Mézières station
Mantes-Station station
Mantes-la-Jolie station
Rosny-sur-Seine station
Bonnières station
Vernon–Giverny station
Services
Line J utilises four-letter codes, called a mission code or the name of service. The four-letter code begins with a letter that designates the terminus of the station.
The first letter designates the train's destination.
A: Argenteuil
C: Conflans Sainte-Honorine
E: Ermont-Eaubonne
G: Gisors
H: Houilles Carrières-sur-Seine
J: Vernon
K: Cormeilles-en-Parisis
L: Les Mureaux
M: Mantes-la-Jolie
P: Paris Saint-Lazare
T: Pontoise
V: Vernon
Y: Boissy-l'Aillerie
The second, third and fourth letters indicate the stations served by the train. Formerly, the second letter was used to designate the train type (I for express trains, A for semi-express trains, O for local trains), but this is no longer the
|
https://en.wikipedia.org/wiki/Propositional%20directed%20acyclic%20graph
|
A propositional directed acyclic graph (PDAG) is a data structure that is used to represent a Boolean function. A Boolean function can be represented as a rooted, directed acyclic graph of the following form:
Leaves are labeled with (true), (false), or a Boolean variable.
Non-leaves are (logical and), (logical or) and (logical not).
- and -nodes have at least one child.
-nodes have exactly one child.
Leaves labeled with () represent the constant Boolean function which always evaluates to 1 (0). A leaf labeled with a Boolean variable is interpreted as the assignment , i.e. it represents the Boolean function which evaluates to 1 if and only if . The Boolean function represented by a -node is the one that evaluates to 1, if and only if the Boolean function of all its children evaluate to 1. Similarly, a -node represents the Boolean function that evaluates to 1, if and only if the Boolean function of at least one child evaluates to 1. Finally, a -node represents the complementary Boolean function its child, i.e. the one that evaluates to 1, if and only if the Boolean function of its child evaluates to 0.
PDAG, BDD, and NNF
Every binary decision diagram (BDD) and every negation normal form (NNF) are also a PDAG with some particular properties. The following pictures represent the Boolean function :
See also
Data structure
Boolean satisfiability problem
Proposition
References
M. Wachter & R. Haenni, "Propositional DAGs: a New Graph-Based Language for Representing Boolean Functions", KR'06, 10th International Conference on Principles of Knowledge Representation and Reasoning, Lake District, UK, 2006.
M. Wachter & R. Haenni, "Probabilistic Equivalence Checking with Propositional DAGs", Technical Report iam-2006-001, Institute of Computer Science and Applied Mathematics, University of Bern, Switzerland, 2006.
M. Wachter, R. Haenni & J. Jonczy, "Reliability and Diagnostics of Modular Systems: a New Probabilistic Approach", DX'06, 18th International Workshop on Principles of Diagnosis, Peñaranda de Duero, Burgos, Spain, 2006.
Graph data structures
Directed graphs
Boolean algebra
|
https://en.wikipedia.org/wiki/Haseo
|
, real name , is a fictional character in the .hack franchise first introduced as the main character in the video game trilogy .hack//G.U. in 2006 by CyberConnect2. He is also the lead character in the anime television series .hack//Roots by Bee Train. A player character from the fictional massively multiplayer online role-playing game The World, he is feared in the .hack//G.U. narrative as the player killer of all player killers. This earned Haseo the nickname . Searching for the killer Tri-Edge, who sent his friend Shino into a coma in real life, Haseo comes into contact with the guild G.U.. They seek to use his PC (player character) to destroy AIDA, a computer anomaly responsible for leaving players in a coma. Haseo's appearances in .hack//Roots depict his early days in The World as a member of the Twilight Brigade guild led by Ovan, where he first meets Shino. He has also appeared in other printed adaptations based on the .hack//G.U. games.
Haseo was created by CyberConnect2 CEO Hiroshi Matsuyama whose aim was for him to be a different protagonist from the previous .hack lead Kite. Since Kite was created to be the player's avatar in the original story, Haseo was meant to be more individual when it came to his characterization, by giving him darker traits. He was designed by Seiichiro Hosokawa, a new artist who joined CyberConnect2 in 2006. Takahiro Sakurai voices Haseo in Japanese. In the English version, he is voiced by Yuri Lowenthal in the games and Andrew Francis in the anime.
Video game publications have published both positive and negative reviews of Haseo's character, with most of the criticism being aimed at his rude personality. On the other hand, his development across the games and the improvement to his PC resulted in positive responses. Both Sakurai and Lowenthal were praised for their role in the games. Haseo's characterization was also the subject of mixed responses in other media.
Creation
Haseo was devised to have a darker design than previous .hack characters to reflect the more mature storyline of the .hack//G.U. games. Hiroshi Matsuyama considered Kite a relatable character and wanted the next game to feature a different type of lead character for .hack//G.U.. In the three games, Haseo can have a deepened bond with a friend he has met with an ambiguous romantic tone based on who is chosen. Although Atoli was the main heroine, the team had issues with writing her to the point that Matsuyama himself chose other characters when he played the game alone. This spurred him to make her more appealing for the second chapter of .hack//G.U. since he saw himself as Haseo and had to pick the heroine as she was originally set up. Matsuyama also wanted the film to focus on Haseo and Atoli's relationship.
Since .hack and .hack//Sign were conceived as two ongoing and connected projects, Matsuyama wanted to do the same with .hack//GU. However, he wanted both .hack//G.U. and .hack//Roots to feature the same lead character, Haseo. Howev
|
https://en.wikipedia.org/wiki/List%20of%20Mac%20models
|
This is a list of all major types of Mac computers produced by Apple Inc. in order of introduction date. Macintosh Performa models were often physically identical to other models, in which case they are omitted in favor of the identical twin. Also not listed are model numbers that identify software bundles. For example, the Performa 6115CD and 6116CD differed only in software and were identical to the Power Macintosh 6100, so only the 6100 is listed below. The Apple Network Server and Apple Lisa are included, as they filled high-end niches of the Macintosh line despite not directly running Mac OS.
Timeline
Detailed timeline
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
See also
Mac (computer)
List of Mac models grouped by CPU type
Timeline of Apple Inc. products
Timeline of the Apple II series
Notes
References
Citations
Sources
Specifications, Apple Computer, Inc.
Mac Systems: Apple, EveryMac.com
Glen Sanford, Apple History, apple-history.com
Dan Knight, Computer Profiles, LowEndMac, Cobweb Publishing, Inc.
External links
Ultimate Mac Timeline at EveryMac.com
Mactimeline a timeline of Apple software and hardware updates
3
Macintosh models
Macintosh models
|
https://en.wikipedia.org/wiki/Organization%20for%20Women%20in%20Science%20for%20the%20Developing%20World
|
The Organization for Women in Science for the Developing World (OWSD) is an international organisation that provides research training, career development and networking opportunities for women scientists throughout the developing world at different stages in their career. It was founded in 1987 and was officially launched in 1993. The organisation was formerly known as the Third World Organization for Women in Science (TWOWS). It is a program unit of UNESCO and based at the offices of The World Academy of Sciences in Trieste, Italy.
The organisation aims to unite eminent scientists from the developing and developed world with an objective of supporting their efforts in the development process. It also aims at promoting the representation of its members in the sphere of scientific and technological leadership. It does so through different programs like memberships, fellowships, and awards.
Objectives
Scientific research and advancement is important to generate knowledge and products aimed at solving problems faced by society. The generation of such knowledge is especially important in the developing countries which face numerable problems like poverty, food scarcity, disease, climate change, and many more. Scientific innovation is not only important to find solutions to these problems but can also contribute to local economies. The inclusion of women in this innovation process provides a unique perspective on the local problems. In many developing countries, women have daily needs and routines oriented to their roles as main care-givers to the elderly and children. Women make up the majority of agricultural workers too, growing and harvesting food for their families, as well as collecting fresh water for drinking. If women are included as both participants in scientific research and as the beneficiaries of scientific research, the impact on children, on the elderly and on local communities will be direct and highly effective.
OWSD aims to pursue the following objectives:
a. Increase the participation of women in developing countries in scientific and technological research, teaching and leadership;
b. Promote the recognition of the scientific and technological achievements of women scientists and technologists in developing countries;
c. Promote collaboration and communication among women scientists and technologists in developing countries and with the international scientific community as a whole;
d. Increase access of women in developing countries to the socio-economic benefits of science and technology;
e. Promote the participation of women scientists and technologists in the sustainable and economic development of their country; and
f. Increase understanding of the role of science and technology in supporting women's development activities.
History
The idea for OWSD was first raised at a conference on The Role of Women in the Development of Science and Technology in the Third World in 1988, organized by the World Academy of Scien
|
https://en.wikipedia.org/wiki/MegaHAL
|
MegaHAL is a computer conversation simulator, or "chatterbot", created by Jason Hutchens.
Background
In 1996, Jason Hutchens entered the Loebner Prize Contest with HeX, a chatterbot based on ELIZA. HeX won the competition that year and took the $2000 prize for having the highest overall score. In 1998, Hutchens again entered the Loebner Prize Contest with his new program, MegaHAL. MegaHAL made its debut in the 1998 Loebner Prize Contest. Like many chatterbots, the intent is for MegaHAL to appear as a human fluent in a natural language. As a user types sentences into MegaHAL, MegaHAL will respond with sentences that are sometimes coherent and at other times complete gibberish. MegaHAL learns as the conversation progresses, remembering new words and sentence structures. It will even learn new ways to substitute words or phrases for other words or phrases. Many would consider conversation simulators like MegaHAL to be a primitive form of artificial intelligence. However, MegaHAL doesn't understand the conversation or even the sentence structure. It generates its conversation based on sequential and mathematical relationships.
In the world of conversation simulators, MegaHAL is based on relatively old technology and could be considered primitive. However, its popularity has grown due to its humorous nature; it has been known to respond with twisted or nonsensical statements that are often amusing.
Theory of Operation
MegaHal is based at least in part on a so-called "hidden Markov Model", so that the first thing that Megahal does when it "trains" on a script or text is to build a database of text fragments encompassing every possible subset of perhaps 4, 5, or even 6 consecutive words, so that for example - if MegaHal trains on the Declaration of Independence, then MegaHal will build a database containing text fragments such as "When in the course", "in the course of", "the course of human", "course of human events", "of human events, one", "human events, one people", and so on. Then if Megahal is fed another text, such has "Superman, Yes! It's Superman - he can change the course of mighty rivers, bend steel with his bare hands - and who disguised at Clark Kent …" IT MIGHT induce Megahal to apparently bemuse itself to proffer whether Superman can change the course of human events, or something else altogether - such as some rambling about "when in the course of mighty rivers", and so on. Thus likewise - if a phrase like "the White house said" comes up a lot in some text; then Megahal's ability to switch randomly between different contexts which otherwise share some similarity can result at times in some surprising lucidity, or else it might otherwise seem quite bizarre.
Examples
There are some sentences that MegaHAL generated:
CHESS IS A FUN SPORT, WHEN PLAYED WITH SHOT GUNS.
and
COWS FLY LIKE CLOUDS BUT THEY ARE NEVER COMPLETELY SUCCESSFUL.
Distribution
MegaHAL is distributed under the Unlicense. Its source code can be downloaded from t
|
https://en.wikipedia.org/wiki/HashClash
|
HashClash was a volunteer computing project running on the Berkeley Open Infrastructure for Network Computing (BOINC) software platform to find collisions in the MD5 hash algorithm. It was based at Department of Mathematics and Computer Science at the Eindhoven University of Technology, and Marc Stevens initiated the project as part of his master's degree thesis.
The project ended after Stevens defended his M.Sc. thesis in June 2007. However SHA1 was added later, and the code repository was ported to git in 2017.
The project was used to create a rogue certificate authority certificate in 2009.
See also
Berkeley Open Infrastructure for Network Computing (BOINC)
List of volunteer computing projects
References
External links
HashClash
HashClash at Stevens' home page
Create your own MD5 collisions on AWS, Nat McHugh's blog
Science in society
Free science software
Volunteer computing projects
Cryptography
Cryptanalytic software
|
https://en.wikipedia.org/wiki/MXM
|
MXM may refer to:
Mobile PCI Express Module (MXM, created 2011), a computing hardware standard
Master X Master (MXM, released 2017), a video game
MPEG eXtensible Middleware (MXM, released 2013), a video standard by the Moving Picture Experts Group
Methoxmetamine (MXM et al), a dissociative drug
MXM (musical duo) (2017–2018), a South Korean duo under Brand New Music
mxmtoon (b. 2000), American singer-songwriter and internet personality
|
https://en.wikipedia.org/wiki/Plugpoint
|
Plugpoint is a term for application programming interface (API). In use, one may say plugpoint to indicate a specific place in an API, or in the API of a framework designed to have software components "plugged" into it. However, plugpoint has no particular meaning in major APIs and frameworks such as .NET, J2EE, and web services. API, listener, interface, and endpoint are accepted terms used in formal documentation.
Plugpoint is a well established term for electrical power-supply devices, such as specific types of wallanisotropic sockets, remote-controlled power devices, and other similar devices. Plugpoint may also refer to the locations where plug-in appliances are permitted at trade shows or other activities where flexible power facilities are required.
References
Computer jargon
|
https://en.wikipedia.org/wiki/Paul%20Jones%20%28computer%20technologist%29
|
Paul Jones (born February 5, 1950 in Hickory, North Carolina) is a graduate of NC State University and the Director of ibiblio, a contributor-run, digital library of public domain and creative commons media, administered by the Office of Information Technology Service of the University of North Carolina at Chapel Hill. On the basis of his bachelor's in Computer Science from NC State University and MFA from Warren Wilson College, he has become Clinical Associate Professor in the School of Journalism and Mass Communication, and Clinical Associate Professor in the School of Information and Library Science, at UNC-Chapel Hill.
Jones was the first manager of SunSITE, one of the first World Wide Web sites in North America. He is an author of The Web Server Book (Ventana, 1995), and of numerous articles about topics such as digital libraries and the Open Source movement. He is an actively publishing poet.
He is married to Sally Greene, a research lawyer and former member of the Town Council of Chapel Hill.
See also
References
Living people
North Carolina State University alumni
Warren Wilson College alumni
University of North Carolina at Chapel Hill staff
1950 births
|
https://en.wikipedia.org/wiki/Inferior%20ophthalmic%20vein
|
The inferior ophthalmic vein is a vein of the orbit that - together with the superior ophthalmic vein - represents the principal drainage system of the orbit. It begins from a venous network in the front of the orbit, then passes backwards through the lower orbit. It drains several structures of the orbit. It may end by splitting into two branches, one draining into the pterygoid venous plexus and the other ultimately (i.e. directly or indirectly) into the cavernous sinus.
Structure
The inferior ophthalmic vein - together with the superior ophthalmic vein - represents the principal drainage system of the orbit. It forms/represents a connection between facial veins, and intracranial veins. It is valveless.
Origin
The inferior ophthalmic vein originates from a venous network at the anterior part of the floor and anterior part of the medial wall of the orbit.
Course
The inferior ophthalmic vein passes posterior-ward through the inferior orbit upon the inferior rectus muscle. It passes across (not through) the inferior orbital fissure before either draining into the superior ophthalmic vein within the orbit, or passing through or below the common tendinous ring and exiting the orbit through the superior orbital fissure to empty into the cavernous sinus.
Distribution
The inferior ophthalmic vein drains venous blood from the inferior rectus muscle, inferior oblique muscle, lateral rectus muscle, lacrimal sac, lower conjunctiva, and lower vorticose veins.
Fate
The inferior ophthalmic vein empties either into the superior ophthalmic vein (which subsequently drains into the cavernous sinus), or into the cavernous sinus directly.
Depending upon the source, it may terminate by splitting into two branches: one passing through the superior orbital fissure to drain into the superior ophthalmic vein or cavernous sinus; another passing through the inferior orbital fissure to empty into the pterygoid venous plexus. The branch to the pterygoid venous plexus may however instead be considered not a terminal branch but rather a communicating branch.
Clinical significance
In periorbital cellulitis, the inferior ophthalmic vein may be compressed. This can increase pressure, causing oedema.
See also
Superior ophthalmic vein
References
Veins of the head and neck
|
https://en.wikipedia.org/wiki/Route%20Views
|
RouteViews is a project founded by the Advanced Network Technology Center at the University of Oregon to allow Internet users to view global Border Gateway Protocol routing information from the perspective of other locations around the internet. Originally created to help Internet Service Providers determine how their network prefixes were viewed by others in order to debug and optimize access to their network, RouteViews is now used for a range of other purposes including academic research.
RouteViews collectors obtain BGP data by directly peering with network operators at Internet exchange points or by multi-hop peering with network operators that aren't colocated at an exchange where RouteViews has a collector. The collectors can be queried using telnet. Historical data is stored in MRT format and can be downloaded using HTTP or FTP from archive.routeviews.org.
As of 2023, the RouteViews project has collectors at 39 exchange points and more than 1,000 peers.
References
External links
RouteViews homepage
Internet architecture
Network management
|
https://en.wikipedia.org/wiki/Quizmaster
|
Quizmaster can refer to:
Quizmaster (game show), a 2002 game show produced by the Seven Network
Temptation Quizmaster (game show), the 2006 series on Nine Network's Temptation
Quizmaster (DC Comics) an alternate universe superhero version of the Riddler
Game show host, a quizmaster on a broadcast program
Quizmaster Law Review a series of review books for law school exams.
Quizmaster Bar Review a series of books for the bar examination
Quizmaster Learn Chinese a series of books for learning Chinese as a second language
|
https://en.wikipedia.org/wiki/Perle%20Systems
|
Perle Systems is a technology company that develops and manufactures serial to Ethernet, fiber to Ethernet, I/O connectivity, and device networking equipment. These types of products are commonly used to establish network connectivity across multiple locations, securely transmit sensitive information across a LAN, and remotely monitor and control networked devices via out-of-band management.
Perle has offices and representative offices in North America, Europe, and Asia and sells its products through distribution and OEM (original equipment manufacturer) channels worldwide.
On August 31, 2016, Phoenix Contact GmbH & Co. KG, Blomberg, Germany concluded a contract for the acquisition of Perle Systems Limited, Toronto. Thus, Perle Systems becomes an international subsidiary of the Phoenix Contact Group.
Products
5G and LTE Routers: Use to provide primary or failover back-up connectivity to remote infrastructure and assets through wireless cellular connections
Terminal Servers: Used to connect any device with serial ports over Ethernet for access to network server applications. Examples of devices with serial ports include Cisco console ports, POS terminals, servers, modems, card readers and a wide range of industrial equipment.
Device Servers: Used to web or network enable existing equipment with RS-232, RS-422 or RS-485 serial interfaces.
Console Servers: Used to provide data center managers with secure remote management of Cisco routers, switches and firewalls, Solaris, Windows, Unix and Linux servers, PBXs or any device with a serial console port. Also referred to as out-of-band management of IT assets.
Ethernet I/O Device Servers: Used for access and control of remote digital I/O, analog I/O, pulse I/O, relays and temperature sensors on any IP network. Monitor environmental alarms, intrusion detection, relay contact closures and equipment failure.
Remote Power Switches: Used to remotely power on/off/cycle Data Center equipment.
Serial Cards: Used to add RS-232, RS-422, RS-485 serial ports to PCs or servers via PCI, PCI-X or PCI Express bus slots.
Parallel Cards: Used to add IEEE 1284 Parallel ports to PCs or servers via PCI, PCI-X or PCI Express bus slots.
Fiber Media Converters: Used to extend copper to fiber, multimode to multimode and multimode to single mode fiber
Ethernet extenders: Used to transparently extend 10/100/1000 Ethernet connections across copper wiring
Industrial Ethernet network switches
Small form-factor pluggable transceivers and XFP transceivers
History
1976, Perle Systems is founded.
1977, Establishes manufacturing capabilities.
1983, Launches a new family of ATM Controllers.
1985, Stock goes public.
1987, Introduces standardized IBM Midrange and AS/400 products.
1998, Acquires Specialix. Specialix designed, developed, manufactured, and marketed a broad range of serial connectivity and remote access solutions that provided connectivity between PCs/servers and peripheral devices.
1999, Acquires Zeta Communication Lim
|
https://en.wikipedia.org/wiki/FreeMat
|
FreeMat is a free open-source numerical computing environment and programming language, similar to MATLAB and GNU Octave. In addition to supporting many MATLAB functions and some IDL functionality, it features a codeless interface to external C, C++, and Fortran code, further parallel distributed algorithm development (via MPI), and has plotting and 3D visualization capabilities. Community support takes place in moderated Google Groups.
See also
Comparison of numerical-analysis software
Notes
Array programming languages
Free mathematics software
Free software primarily written in assembly language
Free software programmed in C
Free software programmed in C++
Free software programmed in Fortran
Numerical analysis software for Linux
Numerical analysis software for macOS
Numerical analysis software for Windows
Numerical programming languages
Science software that uses Qt
Unix programming tools
|
https://en.wikipedia.org/wiki/KQCV-FM
|
KQCV-FM, known as the Bott Radio Network, is a Christian Teaching radio station serving the Oklahoma City, Oklahoma, area and is licensed to Community Broadcasting, Inc.
History
The station began broadcasting in 1998 with the call letters KQCV-FM. It has been a member of The Bott Radio Network.
KQCV's programming is simulcast on translators K231BH 94.1 and K238AT 95.7, which both transmit with 250 watts from Northern Oklahoma City, K272FD 102.3, which transmit with 215 watts from South Oklahoma City, K223CG 92.5, which both transmit with 62 watts from Sands Springs, K229CQ 93.7, which transmit with 115 watts from Bartlesville, K227CI 93.3, which transmit with 99 watts from Ardmore, K293BO 106.5, which transmit with 170 watts from Lawton, K264BT 100.7, which transmit with 92 watts from Muskogee, and K260CV 99.9, which transmit with 250 watts from Stillwater.
External links
KQCV official website
QCV
QCV
Bott Radio Network stations
|
https://en.wikipedia.org/wiki/NZNOG
|
NZNOG is the New Zealand Network Operators' Group. Originally formed as a mailing list hosted by the University of Waikato and intended to provide a means of easy collaboration between Internet service provider network operations staff, its role has expanded to that of an online community of network operators, predominantly in the ISP space, allowing for the discussion of topics of a technical and operational nature. NZNOG has existed as a legal entity in the form of the NZNOG Trust since 2009.
NZNOG runs a yearly conference, during which workshops, tutorials and presentations on various topics of interest to the network operations community in New Zealand. It also provides an excellent opportunity to network with others in the industry - there is usually at least one evening which provides a catered dinner, as well as opportunity for BoF's.
The ongoing success of the NZNOG Conference owes much to the enthusiastic support of its participants, being key staff of various New Zealand Internet service providers, IT companies and tertiary education institutions.
As an example of the role NZNOG has had in the Internet world in New Zealand, it played a major part in the formation of the first of the vendor-neutral Peering Exchanges in New Zealand - such as the Wellington Internet Exchange (WIX) and the Auckland Peering Exchange (APE).
The NZNOG mailing list remains a fairly influential aspect of the New Zealand Internet service provider community, and a useful communications channel for the participants.
Conferences
2002 - Auckland at Airport Sheraton - Joint Conference with UniforumNZ
2003 - Auckland at Waipuna Lodge - Joint Conference with UniforumNZ
2004 - Hamilton at University of Waikato
2005 - Hamilton at University of Waikato
2006 - Wellington at Victoria University of Wellington
2007 - Palmerston North at Massey University. Hosted by InspireNet
2008 - Dunedin at Otago Museum. Hosted by WIC
2009 - Auckland at Mount Richmond Hotel and Conference Centre. Hosted by FX Networks
2010 - Hamilton at University of Waikato. Hosted by WAND and Rurallink
2011 - Wellington at InterContinental Hotel. Hosted by Vodafone
2012 - Christchurch at Copthorne Commodore Hotel.
2013 - Wellington at Mercure Hotel.
2014 - Nelson at Rutherford Hotel.
2015 - Rotorua at Distinction Hotel.
2016 - No Conference due to APRICOT (conference) in Auckland
2017 - Tauranga at Trinity Wharf
2018 - Queenstown at Rydges Hotel
2019 - Napier Conference Centre
2020 - Christchurch at Rydges Latimer
2021 - No Conference due to the COVID-19 pandemic
2022 - Wellington at InterContinental Hotel. Conference postponed to May due to restrictions under the COVID-19 Protection Framework.
2023 - Rotorua announced for the Rydges Hotel in late March.
See also
Internet network operators' group
External links & References
NZNOG Conference & Official website
NZNOG Mailing List
Announcement regarding the formation of the NZNOG Trust
NZ Societies and Trusts record for NZNOG Tr
|
https://en.wikipedia.org/wiki/TV18
|
TV18 Broadcast Limited (formerly Global Broadcast News and IBN18 Broadcast Limited) is an Indian entity belonging to Network18 Group based in Mumbai. TV18 owns and operates various national channels in separate partnerships with NBCUniversal (CNBC TV18, CNBC Awaaz and CNBC-TV18 Prime HD), Warner Bros. Discovery (CNN-News18) and Paramount Global (as majority owner of Viacom18).
In the regional space, the group operates a Gujarati business news channel – CNBC Bajar, a Marathi general news channel – News18 Lokmat and operates ten regional news channels under the News18 umbrella and 3 regional entertainment channels under the News18 brand. The group also operates a 24-hour Indian news channel in English – News18 India, targeting global audiences.
TV18 and Viacom18 have formed a strategic joint venture called IndiaCast, a multi-platform 'content asset monetisation' entity that drives domestic and international channel distribution, placement services and content syndication for the bouquet of channels from the group and third parties.
On 31 January 2018, TV18 increased its stake in the Viacom18 joint venture to 51% taking operational control.
Channels
History
1992–1999: Production firm
1999–2006: News broadcasting and partnerships
2006–2014: Subsidiary of Network18
2014–Present: Reliance Industries era
References
Television stations in Mumbai
Companies based in Mumbai
Network18 Group
Mass media companies established in 1996
Year of establishment missing
Companies listed on the National Stock Exchange of India
Companies listed on the Bombay Stock Exchange
Television broadcasting companies of India
Mass media companies of India
Television networks in India
Broadcasting
|
https://en.wikipedia.org/wiki/Copwatch
|
Copwatch (also Cop Watch or Cop-Watch) is a network of typically autonomous activist organizations, focused in local areas in the United States, Canada, and Europe, that observe and document police activity looking for signs of police misconduct and brutality. They believe that monitoring police activity on the streets is a way to prevent police brutality.
They also propose theoretical and practical approaches to security and justice structures to replace the police. They criticize capitalism and see crime as a consequence of social problems that cannot be fought by surveillance and punishment.
Copwatch was started in Berkeley, California, in 1990.
Methods
The main function of most Copwatch groups is monitoring police activity. "Copwatchers" go out on foot or driving patrols in their communities and record interactions between the police, suspects, and civilians. Copwatchers hope that monitoring police activity will provide a deterrent against police misconduct. Some groups also patrol protests and demonstrations to ensure that police do not violate the rights of protesters. One Copwatch organization states that it has a policy of non-interference with the police, although this may not be true for all groups. In Phoenix, Arizona, copwatchers have increased the practice of "reverse surveillance" of the police in an effort to document racial profiling. They believe that Arizona Senate Bill 1070, a controversial law that allows police to question people they believe are illegal immigrants, will increase racial profiling by police.
Copwatch groups also hold "Know Your Rights" forums to educate the public about their legal and human rights when interacting with the police, and some groups organize events to highlight problems of police abuse in their communities.
Copwatch calls for responses to, or critical evaluation of, police controls in order to support those affected, especially by racial or class profiling. Educational work regarding the powers of the police as well as civilian rights is a focus of Copwatch in order to support more people in their encounters with police.
Activities
Response to the killing of Kendra James
In 2003, Kendra James was fatally shot by Portland, Oregon officer Scott McCollister as she attempted to drive away from a traffic stop with Officer McCollister attempting to pull her out of the vehicle. After the shooting Copwatch offered a reward for a photograph of McCollister. It then produced and distributed posters bearing McCollister's photo and the phrase "Getting away with murder".
The editorial staff of Willamette Week opined that the poster was "inflamed rhetoric" which would harm "the relationship between the Portland police and the community it serves", and said that protest posters put up by the Rose City chapter of Copwatch were aimed at "inciting generalized anti-cop hysteria at the expense of informed criticism".
A member of the Rose City Copwatch group said that the shooting "demonstrate[s] a culture
|
https://en.wikipedia.org/wiki/National%20Computerization%20Agency
|
The South Korean National Computerization Agency (NCA) () is a statutory government agency acting as Korea's top IT policy and technical support agency.
Overview
The agency was founded by Article 10 of the Framework Act on Information Promotion for the purpose of promoting computerization and to support development of related policies for Korean national agencies and local governments.
NCA was able to launch an e-Government project to enhance public convenience and improve administrative efficiency.
The name was changed to the National Information Society Agency (NIA) in December 2020, and before that, it was known as the Korea Information Society Development Institute. The title of this article, "National Computerization Agency," was used only until 2006.
It is being prepared for the launch of a Digital Platform Government project similar to the e-Government project implemented by the former National Computerization Agency in the past. It aims to move away from the previous method where each government agency provided services separately, and to create a single platform that enables access to all government data, with the goal of enhancing convenience for the public.
History
1987 Established for the NBIS Project
1995 KII-G Project
1997 Government Information Exchange Center, IT Evaluation
1999 Cyber Korea 21
2000 National Knowledge & Information Resources Management Project
2001 Information Certification Center
2002 e-Korea Vision 2006, NII Back-up Center
2003 Establishment of Korea-Mexico IT Cooperation Center
2004 Establishment of Korea-Chile IT Cooperation Center
2004 Commencement of BcN Project such as Home Network, RFID, etc.
Organization
Staff 202 Members (as of 2005)
Budget (FY 2005) of 455 million USD
References
External links
National Computerization Agency Official website.
Ministry of Information and Communication Official website of Korean Ministry of Information and Communication
Science and technology in South Korea
Government agencies of South Korea
|
https://en.wikipedia.org/wiki/Deep%20palmar%20arch
|
The deep palmar arch (deep volar arch) is an arterial network found in the palm. It is usually primarily formed from the terminal part of the radial artery. The ulnar artery also contributes through an anastomosis. This is in contrast to the superficial palmar arch, which is formed predominantly by the ulnar artery.
Structure
The deep palmar arch is usually primarily formed from the radial artery. The ulnar artery also contributes through an anastomosis.
The deep palmar arch lies upon the bases of the metacarpal bones and on the interossei of the hand. It is deep to the oblique head of the adductor pollicis muscle, the flexor tendons of the fingers, and the lumbricals of the hand.
Alongside of it, but running in the opposite direction—toward the radial side of the hand—is the deep branch of the ulnar nerve.
The superficial palmar arch is more distally located than the deep palmar arch. If one were to fully extend the thumb and draw a line from the distal border of the thumb across the palm, this would be the level of the superficial palmar arch (Boeckel's line). The deep palmar arch is about a finger width proximal to this. The connection between the deep and superficial palmar arterial arches is an example of anastomosis. This anastomosis can be tested for using Allen's test.
The palmar metacarpal arteries arise from the deep palmar arch.
Function
The deep palmar arch supplies the thumb and the lateral side of the index finger.
See also
Superficial palmar arch
Palmar carpal arch
Dorsal carpal arch
References
External links
("Palm of the hand, deep dissection, anterior view")
Additional Images
Arteries of the upper limb
|
https://en.wikipedia.org/wiki/Ahmet%20M%C3%BCcahid%20%C3%96ren
|
Ahmet Mücahid Ören (born 1972), is the chairman and current CEO of İhlas Holding, Ören studied economics at Anadolu University and also trained as a computer systems specialist.
Ören is a naturalised citizen of the United States and had his Oath of Allegiance ceremony on 14 June 2001.
Oren is also a member of the Board of Directors at the Atlantic Council.
See also
Enver Ören, Ahmet Ören's father and the former Chairman of the Board of İhlas Holding.
References
External links
İhlas Holding Official Website
21st-century American businesspeople
Turkish emigrants to the United States
Living people
1972 births
|
https://en.wikipedia.org/wiki/Kernel%20Transaction%20Manager
|
Kernel Transaction Manager (KTM) is a component of the Windows operating system kernel in Windows Vista and Windows Server 2008 that enables applications to use atomic transactions on resources by making them available as kernel objects.
Overview
The transaction engine, which operates in kernel mode, allows for transactions on both kernel mode and user mode resources, as well as among distributed resources. The Kernel Transaction Manager intends to make it easy for application developers to do much error recovery, virtually transparently, with KTM acting as a transaction manager that transaction clients can plug into. Those transaction clients can be third-party clients that want to initiate transactions on resources that are managed by Transaction Resource Manager. The resource managers can also be third-party or built into the system.
KTM is used to implement Transactional NTFS (TxF) and Transactional Registry (TxR). KTM relies on the Common Log File System (CLFS) for its operation. CLFS is a general-purpose log-file subsystem designed for creating data and event logs.
References
Further reading
External links
Kernel Transaction Manager - Win32 apps | Microsoft Docs
Transactional Vista: Kernel Transaction Manager and friends (TxF, TxR) | Going Deep | Channel 9
Transaction processing
Windows Vista
Windows Server 2008
Windows NT kernel
|
https://en.wikipedia.org/wiki/Fundamental%20matrix%20%28computer%20vision%29
|
In computer vision, the fundamental matrix is a 3×3 matrix which relates corresponding points in stereo images. In epipolar geometry, with homogeneous image coordinates, x and x′, of corresponding points in a stereo image pair, Fx describes a line (an epipolar line) on which the corresponding point x′ on the other image must lie. That means, for all pairs of corresponding points holds
Being of rank two and determined only up to scale, the fundamental matrix can be estimated given at least seven point correspondences. Its seven parameters represent the only geometric information about cameras that can be obtained through point correspondences alone.
The term "fundamental matrix" was coined by QT Luong in his influential PhD thesis. It is sometimes also referred to as the "bifocal tensor". As a tensor it is a two-point tensor in that it is a bilinear form relating points in distinct coordinate systems.
The above relation which defines the fundamental matrix was published in 1992 by both Olivier Faugeras and Richard Hartley. Although H. Christopher Longuet-Higgins' essential matrix satisfies a similar relationship, the essential matrix is a metric object pertaining to calibrated cameras, while the fundamental matrix describes the correspondence in more general and fundamental terms of projective geometry.
This is captured mathematically by the relationship between a fundamental matrix
and its corresponding essential matrix ,
which is
and being the intrinsic calibration
matrices of the two images involved.
Introduction
The fundamental matrix is a relationship between any two images of the same scene that constrains where the projection of points from the scene can occur in both images. Given the projection of a scene point into one of the images the corresponding point in the other image is constrained to a line, helping the search, and allowing for the detection of wrong correspondences. The relation between corresponding points, which the fundamental matrix represents, is referred to as epipolar constraint, matching constraint, discrete matching constraint, or incidence relation.
Projective reconstruction theorem
The fundamental matrix can be determined by a set of point correspondences. Additionally, these corresponding image points may be triangulated to world points with the help of camera matrices derived directly from this fundamental matrix. The scene composed of these world points is within a projective transformation of the true scene.
Proof
Say that the image point correspondence derives from the world point under the camera matrices as
Say we transform space by a general homography matrix such that .
The cameras then transform as
and likewise with still get us the same image points.
Derivation of the fundamental matrix using coplanarity condition
The fundamental matrix can also be derived using the coplanarity condition.
For satellite images
The fundamental matrix expresses the epipolar geometry in ster
|
https://en.wikipedia.org/wiki/3G-324M
|
3G-324M is the 3GPP umbrella protocol for video telephony in 3G mobile networks.
The 3G-324M protocol operates over an established circuit switched connection between two
communicating peers. 3G-324M is an umbrella specification to enable conversational multimedia
communication over Circuit Switched (CS) networks and has been adopted by the 3GPP. 3G-324M is based on the ITU-T H.324 specification for multimedia conferencing over Circuit switched networks. 3G-324M is composed of the following sub-protocols:
ITU-T H.245 for call control
ITU-T H.223 for bit streams to data packets multiplexer/demultiplexer
ITU-T H.223 Annex A and B for error handling of low and medium BER detection, correction and concealment
ITU-T H.324 with Annexes A and C for operating in wireless environment
The 3G-324M specification using the Circuit switched network allows delay sensitive conversational multimedia services such as:
Videoconferencing for personal and business use
Multimedia entertainment services
Telemedicine
Surveillance
Live Video Broadcasting– Cable TV On-the-Go
Video-on-demand (movies, news clips)
3G-324M is agnostic to the actual Circuit switched network that uses it. It can run as easily over UMTS as well as TD-SCDMA networks.
3G-324M operating over a circuit switched channel between two communication peers guarantees the fixed-delay quality of service for multimedia communications. Combining Circuit switched 3G-324M services with packet-based SIP services such as presence can leverage the strength of both networks to enable new types of differentiated and innovative mobile 3G services.
Codecs
Audio Codec
GSM Adaptive Multi-Rate, mandatory
AMR-WB (G.722.2), optional
ITU-T G.723.1, optional
Video Codec
ITU-T H.263, mandatory
ITU-T H.261, optional
MPEG-4 part 2 simple profile 1 level 0, optional
ITU-T H.264, optional
References
External links
3GPP TS 26.111 - Codec for circuit switched multimedia telephony service; Modifications to H.324
IMTC 3G-324M AG - Interoperability and testing activity group covering the 3G-324M and H.324 protocol
3G-324M on Windows Mobile - An interesting article on the integration of 3G-324M into a Windows Mobile operating system
Understanding the 3G-324M Spec - A good explanation on the specification of 3G-324M
Videotelephony
Application layer protocols
|
https://en.wikipedia.org/wiki/Sizeof
|
sizeof is a unary operator in the programming languages C and C++. It generates the storage size of an expression or a data type, measured in the number of char-sized units. Consequently, the construct sizeof (char) is guaranteed to be 1. The actual number of bits of type char is specified by the preprocessor macro , defined in the standard include file limits.h. On most modern computing platforms this is eight bits. The result of sizeof has an unsigned integer type that is usually denoted by size_t.
The operator has a single operand, which is either an expression or the cast of a data type, which is a data type enclosed in parentheses. Data types may not only be primitive types, such as integer and floating-point types, but also pointer types, and compound datatypes (unions, structs, and C++ classes).
Purpose
Many programs must know the storage size of a particular datatype. Though for any given implementation of C or C++ the size of a particular datatype is constant, the sizes of even primitive types in C and C++ may be defined differently for different platforms of implementation. For example, runtime allocation of array space may use the following code, in which the sizeof operator is applied to the cast of the type int:
int *pointer = malloc(10 * sizeof (int));
In this example, function malloc allocates memory and returns a pointer to the memory block. The size of the block allocated is equal to the number of bytes for a single object of type int multiplied by 10, providing space for ten integers.
It is generally not safe to assume the size of any datatype. For example, even though most implementations of C and C++ on 32-bit systems define type int to be four octets, this size may change when code is ported to a different system, breaking the code. The exception to this is the data type char, which always has the size 1 in any standards-compliant C implementation. In addition, it is frequently difficult to predict the sizes of compound datatypes such as a struct or union, due to padding. The use of sizeof enhances readability, since it avoids unnamed numeric constants (magic numbers).
An equivalent syntax for allocating the same array space results from using the dereferenced form of the pointer to the storage address, this time applying the operator to a pointer variable:
int *pointer = malloc(10 * sizeof *pointer);
Use
The operator sizeof produces the required memory storage space of its operand when the code is compiled. The operand is written following the keyword sizeof and may be the symbol of a storage space, e.g., a variable, an expression, or a type name. Parentheses for the operand are optional, except when specifying a type name. The result of the operator is the size of the operand in bytes, or the size of the memory storage requirement. For expressions, it evaluates to the representation size for the type that would result from evaluation of the expression, which is not performed.
For example, since sizeof (char) is
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.