source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/John%20Koza | John R. Koza is a computer scientist and a former adjunct professor at Stanford University, most notable for his work in pioneering the use of genetic programming for the optimization of complex problems. Koza co-founded Scientific Games Corporation, a company which builds computer systems to run state lotteries in the United States. John Koza is also credited with being the creator of the 'scratch card' with the help of retail promotions specialist Daniel Bower.
Koza was born in 1944 and earned a bachelor's degree in computer science from the University of Michigan, being the second person to ever earn a bachelor's degree in computer science. He earned a doctoral degree in computer science from the University of Michigan in 1972.
Koza was featured in Popular Science for his work on evolutionary programming that alters its own code to find far more complex solutions. The machine, which he calls the "invention machine", has created antennae, circuits, and lenses, and has received a patent from the US Patent Office.
In the political space, Koza advocates for a plan to revamp the way states choose their electors for the Electoral College in the United States, such that candidates who win the majority of the popular vote would then win a majority of the electors through an interstate compact. He established the organization National Popular Vote Inc. to advocate for state adoption of the policy and the election of supportive candidates.
References
Works by Koza
Koza, J.R. (1990). Genetic Programming: A Paradigm for Genetically Breeding Populations of Computer Programs to Solve Problems, Stanford University Computer Science Department technical report STAN-CS-90-1314. A thorough report, possibly used as a draft to his 1992 book.
Koza, J.R. (1992). Genetic Programming: On the Programming of Computers by Means of Natural Selection, MIT Press.
Koza, J.R. (1994). Genetic Programming II: Automatic Discovery of Reusable Programs, MIT Press.
Koza, J.R.; Goldberg, David; Fogel, David; & Riolo, Rick, (Eds.) (1996). Genetic Programming 1996: Proceedings of the First Annual Conference (Complex Adaptive Systems), MIT Press.
Koza, J.R.; Deb, K.; Dorigo, M.; Fogel, D.; Garzon, M.; Iba, H.; & Riolo, R., (Eds.) (1997). Genetic Programming 1997: Proceedings of the Second Annual Conference, Morgan Kaufmann.
Koza, J.R.; & Others (Eds.)(1998). Genetic Programming 1998, Morgan Kaufmann Publishers.
Koza, J.R.; Bennett, F.H.; Andre, D.; & Keane, M.A. (1999). Genetic Programming III: Darwinian Invention and Problem Solving, Morgan Kaufmann.
Koza, J.R.; Keane, M.A.; Streeter, M.J.; Mydlowec, W.; Yu, J.; & Lanza, G. (2003). Genetic Programming IV: Routine Human-Competitive Machine Intelligence, Springer.
External links
Interview with John Koza about creating scratch cards
Living people
Theoretical computer scientists
University of Michigan alumni
Polish computer scientists
Stanford University School of Engineering faculty
American computer scien |
https://en.wikipedia.org/wiki/Filename%20extension | A filename extension, file name extension or file extension is a suffix to the name of a computer file (for example, .txt, .docx, .md). The extension indicates a characteristic of the file contents or its intended use. A filename extension is typically delimited from the rest of the filename with a full stop (period), but in some systems it is separated with spaces. Other extension formats include dashes and/or underscores on early versions of Linux and some versions of IBM AIX.
Some file systems implement filename extensions as a feature of the file system itself and may limit the length and format of the extension, while others treat filename extensions as part of the filename without special distinction.
Operating system handling
File systems for UNIX-like operating systems do not separate the extension metadata from the rest of the file name. The dot character is just another character in the main filename. A file name may have no extensions. Sometimes it is said to have more than one extension, although terminology varies in this regard, and most authors define extension in a way that does not allow more than one in the same file name. More than one extension usually represents nested transformations, such as files.tar.gz (the .tar indicates that the file is a tar archive of one or more files, and the .gz indicates that the tar archive file is compressed with gzip). Programs transforming or creating files may add the appropriate extension to names inferred from input file names (unless explicitly given an output file name), but programs reading files usually ignore the information; it is mostly intended for the human user.
It is more common, especially in binary files, for the file to contain internal or external metadata describing its contents.
This model generally requires the full filename to be provided in commands, whereas the metadata approach often allows the extension to be omitted.
The VFAT, NTFS, and ReFS file systems for Windows also do not separate the extension metadata from the rest of the file name, and allow multiple extensions.
With the advent of graphical user interfaces, the issue of file management and interface behavior arose. Microsoft Windows allowed multiple applications to be associated with a given extension, and different actions were available for selecting the required application, such as a context menu offering a choice between viewing, editing or printing the file. The assumption was still that any extension represented a single file type; there was an unambiguous mapping between extension and icon.
The classic Mac OS disposed of filename-based extension metadata entirely; it used, instead, a distinct file type code to identify the file format. Additionally, a creator code was specified to determine which application would be launched when the file's icon was double-clicked. macOS, however, uses filename suffixes as a consequence of being derived from the UNIX-like NeXTSTEP operating system, in additi |
https://en.wikipedia.org/wiki/Creator%20code | A creator code is a mechanism introduced in the classic Mac OS to link a data file to the application program which created it. The similar type code held the file type, like "TEXT". Together, the type and creator indicated what application should be used to open a file, similar to (but richer than) the file extensions in other operating systems.
Creator codes are four-byte OSTypes. They allow applications to launch and open a file whenever any of their associated files is double-clicked. Creator codes could be any four-byte value, but were usually chosen so that their ASCII representation formed a word or acronym. For example, the creator code of the HyperCard application and its associated "stacks" is represented in ASCII as , from the application's original name of WildCard. Occasionally they represented inside jokes. For instance, the Marathon computer game had a creator code of (the approximate length, in miles, of a marathon) and Marathon 2: Durandal had a creator code of .
The binding are stored inside the resource fork of the application as BNDL and fref resources. These resources maintained the creator code as well as the association with each type code and icon. The OS collected this data from the files when they were copied between mediums, thereby building up the list of associations and icons as software was installed onto the machine. Periodically this "desktop database" would become corrupted, and had to be fixed by "rebuilding the desktop database."
The key difference between extensions and Apple's system is that file type and file ownership bindings are kept distinct. This allows files to be written of the same type - TEXT say - by different applications. Although any application can open anyone else's TEXT file, by default, opening the file will open the original application that created it. With the extensions approach, this distinction is lost - all files with a .txt extension will be mapped to a single text editing application of the user's choosing. A more obvious advantage of this approach is allowing for double click launching of specialized editors for more complex but common file types, like .csv or .html. This can also represent a disadvantage as in the illustration above, where double clicking the four mp3 files would launch and play the files in four different music applications instead of queuing them in the user's preferred player application.
macOS retains creator codes, but supports extensions as well. However, beginning with Mac OS X Snow Leopard, creator codes are ignored by the operating system. Creator codes have been internally superseded by Apple's Uniform Type Identifier scheme, which manages application and file type identification as well as type codes, creator codes and file extensions.
To avoid conflicts, Apple maintained a database of creator codes in use. Developers could fill out an online form to register their codes. Apple reserves codes containing all lower-case ASCII characters for its o |
https://en.wikipedia.org/wiki/Derive | Derive may refer to:
Derive (computer algebra system), a commercial system made by Texas Instruments
Dérive (magazine), an Austrian science magazine on urbanism
Dérive, a psychogeographical concept
Derived trait, or apomorphy
See also
Derivation (disambiguation)
Derivative (disambiguation) |
https://en.wikipedia.org/wiki/Poqet%20PC | The Poqet PC is a very small, portable IBM PC compatible computer, introduced in 1989 by Poqet Computer Corporation with a price of $2000. The computer was discontinued after Fujitsu Ltd. bought Poqet Computer Corp. It was the first subnotebook form factor IBM PC compatible computer that ran MS-DOS. The Poqet PC is powered by two AA-size batteries. Through the use of aggressive power management, which includes stopping the CPU between keystrokes, the batteries are able to power the computer for anywhere between a couple of weeks and a couple of months, depending on usage. The computer also uses an "instant on" feature, such that after powering it down, it can be used again immediately without having to go through a full booting sequence. The Poqet PC is comparable to the HP 95LX/HP 100LX/HP 200LX and the Atari Portfolio handheld computers.
Poqet PC, "Classic" and Prime
Three variants were produced. The Poqet PC was the first to be introduced and the Poqet PC Prime followed shortly after. (The original version was subsequently renamed the Poqet PC "Classic"). Several years later, the Poqet PC Plus was introduced. The main difference between the Poqet PC Classic and the Prime was the expansion of RAM from 512 to 640 KB and enhancement of the power management features.
Specifications
Size: x x
Weight: with batteries
Battery life: 50–100 hours (expect a lot less if running long, CPU-intensive programs (10-20 h approx.))
Microprocessor: 80C88 / 7 MHz
Memory: 640 KB SRAM
Display: Reflective DSTN (no backlight)
Display compatibility: MDA: 80 × 25 characters CGA: 640 × 200 pixels
PCMCIA: 2 × Type I, Revision 1.0 memory card slots
Secondary storage: Drive A: 512 KB-2 MB PCMCIA (not included) Drive B: 512-2 MB PCMCIA (not included) Drive C: 768 KB ROM drive with MS-DOS 3.3 and PoqetTools Drive D: 22 KB volatile RAM drive
Built-in software: MS-DOS 3.3, PoqetLink, and PoqetTools
Poqet PC Plus
Several years after the Poqet Prime and Classic, and some time after Fujitsu purchased Poqet Computer Corp., the new and improved Poqet PC Plus was introduced. The Poqet PC Plus had significant differences from the Classic and Prime models, some better than others. It features a rechargeable battery pack that holds a smaller charge than the "Classic", enhanced PC Card slots that now support more PC Cards, a transflective backlit LCD and 2 MB of RAM (640 KB to DOS, 64 KB shadow, and 1-1344 KB for a RAM disk). The Poqet "Classic"'s LCD didn't have a backlight and was more prone to breaking than the Poqet PC Plus. It also only took Type I, Release 1.0 SRAM cards, as opposed to Type II cards and Release 2.0 cards, including flash, SRAM, and a few modem cards. The Plus also had more memory. Despite many improvements, the Plus also had its drawbacks. The Poqet PC Plus was considerably larger and heavier than its predecessors. It weighed approximately as opposed to the Classic's . It also has a very odd miniature 26-pin serial connector for which there is no |
https://en.wikipedia.org/wiki/IBM%20PC%20DOS | IBM PC DOS (commonly called The IBM Personal Computer DOS and IBM DOS), an acronym for IBM Personal Computer Disk Operating System, is a discontinued disk operating system for the IBM Personal Computer, its successors, and IBM PC compatibles. It was manufactured and sold by IBM from the early 1980s into the 2000s. Developed by Microsoft, it was also sold by that company as MS-DOS. Both operating systems were identical or almost identical until 1993, when IBM began selling PC DOS 6.1 with new features. The collective shorthand for PC DOS and MS-DOS was DOS, which is also the generic term for disk operating system, and is shared with dozens of disk operating systems called DOS.
History
The IBM task force assembled to develop the IBM PC decided that critical components of the machine, including the operating system, would come from outside vendors. This radical break from company tradition of in-house development was one of the key decisions that made the IBM PC an industry standard. Microsoft, founded five years earlier by Bill Gates, was eventually selected for the operating system.
IBM wanted Microsoft to retain ownership of whatever software it developed, and wanted nothing to do with helping Microsoft, other than making suggestions from afar. According to task force member Jack Sams:
The reasons were internal. We had a terrible problem being sued by people claiming we had stolen their stuff. It could be horribly expensive for us to have our programmers look at code that belonged to someone else because they would then come back and say we stole it and made all this money. We had lost a series of suits on this, and so we didn't want to have a product which was clearly someone else's product worked on by IBM people. We went to Microsoft on the proposition that we wanted this to be their product.
IBM first contacted Microsoft to look the company over in July 1980. Negotiations continued over the months that followed, and the paperwork was officially signed in early November.
Although IBM expected that most customers would use PC DOS, the IBM PC also supported CP/M-86, which became available six months after PC DOS, and UCSD p-System operating systems. IBM's expectation proved correct: one survey found that 96.3% of PCs were ordered with the $40 PC DOS compared to 3.4% with the $240 CP/M-86.
Over the history of IBM PC DOS, various versions were developed by IBM and Microsoft. By the time PC DOS 3.0 was completed, IBM had a team of developers covering the full OS. At that point in time, either IBM or Microsoft completely developed versions of IBM PC DOS going forward. By 1985 the joint development agreement (JDA) between IBM and Microsoft for the development of PC DOS had each company giving the other company a completely developed version. Most of the time branded versions were identical, but there were some cases in which each of the companies made minor modifications to their version of DOS. In the fall of 1984, IBM gave all the source code |
https://en.wikipedia.org/wiki/Best-first%20search | Best-first search is a class of search algorithms, which explores a graph by expanding the most promising node chosen according to a specified rule.
Judea Pearl described the best-first search as estimating the promise of node n by a "heuristic evaluation function which, in general, may depend on the description of n, the description of the goal, the information gathered by the search up to that point, and most importantly, on any extra knowledge about the problem domain."
Some authors have used "best-first search" to refer specifically to a search with a heuristic that attempts to predict how close the end of a path is to a solution (or, goal), so that paths which are judged to be closer to a solution (or, goal) are extended first. This specific type of search is called greedy best-first search or pure heuristic search.
Efficient selection of the current best candidate for extension is typically implemented using a priority queue.
The A* search algorithm is an example of a best-first search algorithm, as is B*. Best-first algorithms are often used for path finding in combinatorial search. Neither A* nor B* is a greedy best-first search, as they incorporate the distance from the start in addition to estimated distances to the goal.
Greedy BeFS
Using a greedy algorithm, expand the first successor of the parent. After a successor is generated:
If the successor's heuristic is better than its parent, the successor is set at the front of the queue (with the parent reinserted directly behind it), and the loop restarts.
Else, the successor is inserted into the queue (in a location determined by its heuristic value). The procedure will evaluate the remaining successors (if any) of the parent.
Below is a pseudocode example of this algorithm, where queue represents a priority queue which orders nodes based on their heuristic distances from the goal. This implementation keeps track of visited nodes, and can therefore be used for undirected graphs. It can be modified to retrieve the path.
procedure GBS(start, target) is:
mark start as visited
add start to queue
while queue is not empty do:
current_node ← vertex of queue with min distance to target
remove current_node from queue
foreach neighbor n of current_node do:
if n not in visited then:
if n is target:
return n
else:
mark n as visited
add n to queue
return failure
See also
Beam search
A* search algorithm
Dijkstra's algorithm
References
External links
Wikibooks: Artificial Intelligence: Best-First Search
Search algorithms
Greedy algorithms |
https://en.wikipedia.org/wiki/VMEbus | VMEbus (Versa Module Eurocard bus) is a computer bus standard, originally developed for the Motorola 68000 line of CPUs, but later widely used for many applications and standardized by the IEC as ANSI/IEEE 1014-1987. It is physically based on Eurocard sizes, mechanicals and connectors (DIN 41612), but uses its own signalling system, which Eurocard does not define. It was first developed in 1981 and continues to see widespread use today.
History
In 1979, during development of the Motorola 68000 CPU, one of their engineers, Jack Kister, decided to set about creating a standardized bus system for 68000-based systems. The Motorola team brainstormed for days to select the name VERSAbus. VERSAbus cards were large, , and used edge connectors. Only a few products adopted it, including the IBM System 9000 instrument controller and the Automatix robot and machine vision systems.
Kister was later joined by John Black, who refined the specifications and created the VERSAmodule product concept. A young engineer working for Black, Julie Keahey designed the first VERSAmodule card, the VERSAbus Adaptor Module, used to run existing cards on the new VERSAbus. Sven Rau and Max Loesel of Motorola-Europe added a mechanical specification to the system, basing it on the Eurocard standard that was then late in the standardization process. The result was first known as VERSAbus-E but was later renamed to VMEbus, for VERSAmodule Eurocard bus (although some refer to it as Versa Module Europa).
At this point, a number of other companies involved in the 68000's ecosystem agreed to use the standard, including Signetics, Philips, Thomson, and Mostek. Soon it was officially standardized by the IEC as the IEC 821 VMEbus and by ANSI and IEEE as ANSI/IEEE 1014-1987.
The original standard was a 16-bit bus, designed to fit within the existing Eurocard DIN connectors. However, there have been several updates to the system to allow wider bus widths. The current VME64 includes a full 64-bit bus in 6U-sized cards and 32-bit in 3U cards. The VME64 protocol has a typical performance of 40 MB/s. Other associated standards have added hot-swapping (plug-and-play) in VME64x, smaller 'IP' cards that plug into a single VMEbus card, and various interconnect standards for linking VME systems together.
In the late 1990s, synchronous protocols proved to be favourable. The research project was called VME320. The VITA Standards Organization called for a new standard for unmodified VME32/64 backplanes. The new 2eSST protocol was approved in ANSI/VITA 1.5 in 1999.
Over the years, many extensions have been added to the VME interface, providing 'sideband' channels of communication in parallel to VME itself. Some examples are IP Module, RACEway Interlink, SCSA, Gigabit Ethernet on VME64x Backplanes, PCI Express, RapidIO, StarFabric and InfiniBand.
VMEbus was also used to develop closely related standards, VXIbus and VPX.
The VMEbus had a strong influence on many later computer buses such as STEbus |
https://en.wikipedia.org/wiki/64-bit%20computing | In computer architecture, 64-bit integers, memory addresses, or other data units are those that are 64 bits wide. Also, 64-bit central processing units (CPU) and arithmetic logic units (ALU) are those that are based on processor registers, address buses, or data buses of that size. A computer that uses such a processor is a 64-bit computer.
From the software perspective, 64-bit computing means the use of machine code with 64-bit virtual memory addresses. However, not all 64-bit instruction sets support full 64-bit virtual memory addresses; x86-64 and ARMv8, for example, support only 48 bits of virtual address, with the remaining 16 bits of the virtual address required to be all zeros (000...) or all ones (111...), and several 64-bit instruction sets support fewer than 64 bits of physical memory address.
The term 64-bit also describes a generation of computers in which 64-bit processors are the norm. 64 bits is a word size that defines certain classes of computer architecture, buses, memory, and CPUs and, by extension, the software that runs on them. 64-bit CPUs have been used in supercomputers since the 1970s (Cray-1, 1975) and in reduced instruction set computers (RISC) based workstations and servers since the early 1990s. In 2003, 64-bit CPUs were introduced to the mainstream PC market in the form of x86-64 processors and the PowerPC G5.
A 64-bit register can hold any of 264 (over 18 quintillion or 1.8×1019) different values. The range of integer values that can be stored in 64 bits depends on the integer representation used. With the two most common representations, the range is 0 through 18,446,744,073,709,551,615 (264 − 1) for representation as an (unsigned) binary number, and −9,223,372,036,854,775,808 (−263) through 9,223,372,036,854,775,807 (263 − 1) for representation as two's complement. Hence, a processor with 64-bit memory addresses can directly access 264 bytes (16 exbibytes or EiB) of byte-addressable memory.
With no further qualification, a 64-bit computer architecture generally has integer and addressing registers that are 64 bits wide, allowing direct support for 64-bit data types and addresses. However, a CPU might have external data buses or address buses with different sizes from the registers, even larger (the 32-bit Pentium had a 64-bit data bus, for instance).
Architectural implications
Processor registers are typically divided into several groups: integer, floating-point, single instruction, multiple data (SIMD), control, and often special registers for address arithmetic which may have various uses and names such as address, index, or base registers. However, in modern designs, these functions are often performed by more general purpose integer registers. In most processors, only integer or address-registers can be used to address data in memory; the other types of registers cannot. The size of these registers therefore normally limits the amount of directly addressable memory, even if there are registers, such as |
https://en.wikipedia.org/wiki/Stored-program%20computer | A stored-program computer is a computer that stores program instructions in electronically or optically accessible memory. This contrasts with systems that stored the program instructions with plugboards or similar mechanisms.
The definition is often extended with the requirement that the treatment of programs and data in memory be interchangeable or uniform.
Description
In principle, stored-program computers have been designed with various architectural characteristics. A computer with a von Neumann architecture stores program data and instruction data in the same memory, while a computer with a Harvard architecture has separate memories for storing program and data. However, the term stored-program computer is sometimes used as a synonym for the von Neumann architecture. Jack Copeland considers that it is "historically inappropriate, to refer to electronic stored-program digital computers as 'von Neumann machines'". Hennessy and Patterson wrote that the early Harvard machines were regarded as "reactionary by the advocates of stored-program computers".
History
The concept of the stored-program computer can be traced back to the 1936 theoretical concept of a universal Turing machine. Von Neumann was aware of this paper, and he impressed it on his collaborators.
Many early computers, such as the Atanasoff–Berry computer, were not reprogrammable. They executed a single hardwired program. As there were no program instructions, no program storage was necessary. Other computers, though programmable, stored their programs on punched tape, which was physically fed into the system as needed.
In 1936, Konrad Zuse anticipated in two patent applications that machine instructions could be stored in the same storage used for data.
The University of Manchester's Baby is generally recognized as world's first electronic computer that ran a stored program—an event that occurred on 21 June 1948. However the Baby was not regarded as a full-fledged computer, but more a proof of concept predecessor to the Manchester Mark 1 computer, which was first put to research work in April 1949. On 6 May 1949 the EDSAC in Cambridge ran its first program, making it another electronic digital stored-program computer. It is sometimes claimed that the IBM SSEC, operational in January 1948, was the first stored-program computer; this claim is controversial, not least because of the hierarchical memory system of the SSEC, and because some aspects of its operations, like access to relays or tape drives, were determined by plugging. The first stored-program computer to be built in continental Europe was the MESM, completed in the Soviet Union in 1950.
The first stored-program computers
Several computers could be considered the first stored-program computer, depending on the criteria.
IBM SSEC, became operational in January 1948 but was electromechanical
In April 1948, modifications were completed to ENIAC to function as a stored-program computer, with the program stored by |
https://en.wikipedia.org/wiki/Michigan%20Terminal%20System | The Michigan Terminal System (MTS) is one of the first time-sharing computer operating systems. Created in 1967 at the University of Michigan for use on IBM S/360-67, S/370 and compatible mainframe computers, it was developed and used by a consortium of eight universities in the United States, Canada, and the United Kingdom over a period of 33 years (1967 to 1999).
Overview
The University of Michigan Multiprogramming Supervisor (UMMPS) was initially developed by the staff of the academic computing center at the University of Michigan for operation of the IBM S/360-67, S/370 and compatible computers. The software may be described as a multiprogramming, multiprocessing, virtual memory, time-sharing supervisor that runs multiple resident, reentrant programs. Among these programs is the Michigan Terminal System (MTS) for command interpretation, execution control, file management, and accounting. End-users interact with the computing resources through MTS using terminal, batch, and server oriented facilities.
The name MTS refers to:
The UMMPS Job Program with which most end-users interact;
The software system, including UMMPS, the MTS and other Job Programs, Command Language Subsystems (CLSs), public files (programs), and documentation; and
The time-sharing service offered at a particular site, including the MTS software system, the hardware used to run MTS, the staff that supported MTS and assisted end-users, and the associated administrative policies and procedures.
MTS was used on a production basis at about 13 sites in the United States, Canada, the United Kingdom, Brazil, and possibly in Yugoslavia and at several more sites on a trial or benchmarking basis. MTS was developed and maintained by a core group of eight universities included in the MTS Consortium.
The University of Michigan announced in 1988 that "Reliable MTS service will be provided as long as there are users requiring it ... MTS may be phased out after alternatives are able to meet users' computing requirements". It ceased operating MTS for end-users on June 30, 1996. By that time, most services had moved to client/server-based computing systems, typically Unix for servers and various Mac, PC, and Unix flavors for clients. The University of Michigan shut down its MTS system for the last time on May 30, 1997.
Rensselaer Polytechnic Institute (RPI) is believed to be the last site to use MTS in a production environment. RPI retired MTS in June 1999.
Today, MTS still runs using IBM S/370 emulators such as Hercules, Sim390, and FLEX-ES.
Origins
In the mid-1960s, the University of Michigan was providing batch processing services on IBM 7090 hardware under the control of the University of Michigan Executive System (UMES), but was interested in offering interactive services using time-sharing. At that time the work that computers could perform was limited by their small real memory capacity. When IBM introduced its System/360 family of computers in the mid-1960s, it did not provide a |
https://en.wikipedia.org/wiki/Second%20City%20Television | Second City Television, commonly shortened to SCTV and later known as SCTV Network and SCTV Channel, is a Canadian television sketch comedy show that ran intermittently between 1976 and 1984. It was created as an offshoot from Toronto's Second City troupe. It is an example of a Canadian show that moved successfully to U.S. television, where it aired on NBC in 1981–83.
Premise
The show's premise is the broadcast day of a fictitious TV station (later network) in the town of Melonville. Melonville's location is left unspecified; the earliest episodes imply it is in Canada, but most later episodes place it in the U.S.
A typical episode of SCTV presents a compendium of programming seen on the station throughout its broadcast day. A given episode could contain SCTV news broadcasts, sitcoms, dramas, movies, talk shows, children's shows, advertising send-ups hawking fictitious products, and game shows. Several "shows" are seen regularly on SCTV, including SCTV News; soap opera The Days of the Week; late-night movie features Monster Chiller Horror Theater and Dialing For Dollars; and Great White North (a show centered around two Canadian 'hosers'), among others. Many other SCTV shows are seen only once, such as the game show Shoot at the Stars, in which celebrities are literally shot at like shooting gallery targets, or full-blown movie spoofs such as Play It Again, Bob, in which Woody Allen (Rick Moranis) tries to get Bob Hope (Dave Thomas) to star in his next film. Episodes also feature a range of SCTV-produced promotions (for imaginary future shows) and commercials, such as spots for "Al Peck's Used Fruit" or "Shower in a Briefcase", or a public service announcement that helpfully describes "Seven Signs You May Already Be Dead".
Also seen fairly frequently, particularly in later episodes, are behind-the-scenes plots focusing on life at the station/network. These often feature Guy Caballero (Joe Flaherty), SCTV's cheap, tyrannical owner and president who, despite being perfectly ambulatory, uses a wheelchair to earn "respect" (i.e., sympathy) from employees and viewers. Also seen regularly are weaselly, sweating station manager Maurice "Moe" Green (Harold Ramis), succeeded in the position by flamboyant, leopard-skin clad, foul-mouthed Mrs. Edith Prickley (Andrea Martin); vain variety star Johnny LaRue (John Candy); washed-up entertainers such as singer Lola Heatherton (Catherine O'Hara) and comedian Bobby Bittman (Eugene Levy); news anchors Floyd Robertson (Flaherty) and Earl Camembert (Levy), talk-show host Sammy Maudlin (Flaherty), cult-stardom-destined and beer-addled brothers Bob and Doug McKenzie (Moranis and Thomas), and many others.
The small cast, typically six to eight members at any given time, play a wide variety of other station roles ranging from program hosts to commercial spokespersons. They also impersonate numerous popular celebrities appearing on the station's programming.
History
Show creation
There is much dispute as to who |
https://en.wikipedia.org/wiki/Video%20poker | Video poker is a casino game based on five-card draw poker. It is played on a computerized console similar in size to a slot machine.
History
Video poker first became commercially viable when it became economical to combine a television-like monitor with a solid state central processing unit. The earliest models appeared at the same time as the first personal computers were produced, in the mid-1970s, although they were primitive by today's standards.
Video poker became more firmly established when SIRCOMA, which stood for Si Redd's Coin Machines (and which evolved over time to become International Game Technology), introduced Draw Poker in 1979. Throughout the 1980s video poker became increasingly popular in casinos, as people found the devices less intimidating than playing table games. Today, video poker enjoys a prominent place on the gaming floors of many casinos. The game is especially popular with Las Vegas local, who tend to patronize local casinos off the Las Vegas Strip. These local casinos often offer lower-denomination machines or better odds.
A few people who are skilled in calculating odds have become professional video poker players.
The game
After inserting money (or a bar-coded paper ticket with credit) into the machine, play begins by placing a bet of one or more credits and pressing the "deal" button. The player is then given 5 cards (like five-card draw) and has the opportunity to discard one or more of them in exchange for new ones drawn from the same virtual deck. After the draw, the machine pays out if the hand or hands played match one of the winning combinations, which are posted in the pay table. Unlike the table version, the player may discard all 5 of their original cards if they so choose.
Pay tables allocate the payouts for hands and are based on how rare they are, the game variation, and the decision of the game operator. A typical pay table starts with a minimum hand of a pair of jacks, which pays even money. All the other hand combinations in video poker are the same as in table poker, including such hands as two pair, three of a kind, straight (a sequence of 5 cards of consecutive value), flush (any 5 cards of the same suit), full house (a pair and a three of a kind), four of a kind (four cards of the same value), straight flush (5 consecutive cards of the same suit) and royal flush (a Ten, a Jack, a Queen, a King and an Ace of the same suit).
Some machines offer progressive jackpots or other unique bonuses, spurring players to both play more coins and to play more frequently.
Regulation
Video poker machines in casinos in the United States are regulated by state or Indian gaming agencies. These agencies typically require that the machines deal random card sequences using a virtual deck of cards. This is based on a Nevada Gaming Commission regulation later adopted by other states with a gaming authority. Video poker machines are tested to ensure compliance with this requirement before being offered to |
https://en.wikipedia.org/wiki/Delegation%20pattern | In software engineering, the delegation pattern is an object-oriented design pattern that allows object composition to achieve the same code reuse as inheritance.
In delegation, an object handles a request by delegating to a second object (the delegate). The delegate is a helper object, but with the original context. With language-level support for delegation, this is done implicitly by having self in the delegate refer to the original (sending) object, not the delegate (receiving object). In the delegate pattern, this is instead accomplished by explicitly passing the original object to the delegate, as an argument to a method. "Delegation" is often used loosely to refer to the distinct concept of forwarding, where the sending object simply uses the corresponding member on the receiving object, evaluated in the context of the receiving object, not the original object.
This article uses "sending object/receiving object" for the two objects, rather than "receiving object/delegate", emphasizing which objects send and receive the delegation call, not the original call.
Definition
In the Introduction to Gamma et al. 1994, delegation is defined as:
Example
In the example below (using the Kotlin programming language), the class Window delegates the area() call to its internal Rectangle object (its delegate).
class Rectangle(val width: Int, val height: Int) {
fun area() = width * height
}
class Window(val bounds: Rectangle) {
// Delegation
fun area() = bounds.area()
}
Language support
Some languages have special support for delegation built in. For example, in the Kotlin programming language the by keyword delegates to another object's interface:
interface ClosedShape {
fun area(): Int
}
class Rectangle(val width: Int, val height: Int) : ClosedShape {
override fun area() = width * height
}
// The ClosedShape implementation of Window delegates to that of the Rectangle that is bounds
class Window(private val bounds: Rectangle) : ClosedShape by bounds
See also
Delegation (object-oriented programming)
Forwarding (object-oriented programming)
Aspect-oriented programming
Delegation (computing)
Design pattern
Facade pattern
Schizophrenia (object-oriented programming)
References
External links
What Is Delegation, WikiWikiWeb
Delegation on Rosetta Code
Articles with example C++ code
Articles with example Java code
Software design patterns |
https://en.wikipedia.org/wiki/Cacti%20%28software%29 | Cacti is an open-source, web-based network monitoring, performance, fault and configuration management framework designed as a front-end application for the open-source, industry-standard data logging tool RRDtool. Cacti allows a user to poll services at predetermined intervals and graph the resulting data. Through the use of Cacti plugins, it has been extended to encompass all of the FCAPS operational management categories. It is generally used to graph time-series data of metrics such as CPU load and network bandwidth utilization. A common usage is to monitor network traffic by polling a network switch or router interface via Simple Network Management Protocol (SNMP).
The Cacti end user front end supports both User and User Groups security models and supports Role Based Access Control (RBAC) for access to not only monitoring data, but various areas of the user interface. Source users can either be locally defined or sourced from LDAP, Active Directory and other protocols via Apache and Nginx Basic Authentication which includes Single Signon providers (SSO).
The Cacti framework can be extended using Plugins which transform Cacti from a pure Time Series Graphing solution into a robust Performance Monitoring, Fault and Configuration Management platform. The Cacti Group maintains over 20 such Plugins on GitHub that deliver these capabilities.
Cacti is primarily used by Telco providers and Network Operation Centers throughout the world in addition to being the heart of the commercial Spectrum LSF RTM solution which monitors High Performance Computing (HPC) clusters based on IBM LSF product. Additional use cases include web hosting providers (especially dedicated server, virtual private server, and colocation providers) to display bandwidth statistics for their customers. It can be used to configure the data collection itself, allowing certain setups to be monitored without any manual configuration of RRDtool. Cacti data collection can be extended to monitor any source via shell scripts and executables.
Cacti provides both a built-in and optional data collectors. back ends: The first, referenced to as "cmd.php", is a PHP script suitable for smaller installations. The second, referred to as "spine", is a multi-threaded and massively parallel C-based data collector which can scale to tens of thousands of hosts per Cacti Data Collector.
History
The Cacti project was first started by Ian Berry on September 2, 2001. Berry was inspired to start the project while working for a small ISP while also still in high school, learning PHP and MySQL. His central aim in creating Cacti "was to offer more ease of use than RRDtool and more flexibility than MRTG".
On September 13, 2004, version 0.8.6 was released, and with it came more developers and, later on, greater program speed and scalability.
Version 0.8.7 was released for use in October 2007. In June 2012, a roadmap on the website indicated that version 1.0.0 was scheduled for release in the first |
https://en.wikipedia.org/wiki/Parallel%20algorithm | In computer science, a parallel algorithm, as opposed to a traditional serial algorithm, is an algorithm which can do multiple operations in a given time. It has been a tradition of computer science to describe serial algorithms in abstract machine models, often the one known as random-access machine. Similarly, many computer science researchers have used a so-called parallel random-access machine (PRAM) as a parallel abstract machine (shared-memory).
Many parallel algorithms are executed concurrently – though in general concurrent algorithms are a distinct concept – and thus these concepts are often conflated, with which aspect of an algorithm is parallel and which is concurrent not being clearly distinguished. Further, non-parallel, non-concurrent algorithms are often referred to as "sequential algorithms", by contrast with concurrent algorithms.
Parallelizability
Algorithms vary significantly in how parallelizable they are, ranging from easily parallelizable to completely unparallelizable. Further, a given problem may accommodate different algorithms, which may be more or less parallelizable.
Some problems are easy to divide up into pieces in this way – these are called embarrassingly parallel problems. Examples include many algorithms to solve Rubik's Cubes and find values which result in a given hash.
Some problems cannot be split up into parallel portions, as they require the results from a preceding step to effectively carry on with the next step – these are called s. Examples include iterative numerical methods, such as Newton's method, iterative solutions to the three-body problem, and most of the available algorithms to compute pi (π). Some sequential algorithms can be converted into parallel algorithms using automatic parallelization.
Motivation
Parallel algorithms on individual devices have become more common since the early 2000s because of substantial improvements in multiprocessing systems and the rise of multi-core processors. Up until the end of 2004, single-core processor performance rapidly increased via frequency scaling, and thus it was easier to construct a computer with a single fast core than one with many slower cores with the same throughput, so multicore systems were of more limited use. Since 2004 however, frequency scaling hit a wall, and thus multicore systems have become more widespread, making parallel algorithms of more general use.
Issues
Communication
The cost or complexity of serial algorithms is estimated in terms of the space (memory) and time (processor cycles) that they take. Parallel algorithms need to optimize one more resource, the communication between different processors. There are two ways parallel processors communicate, shared memory or message passing.
Shared memory processing needs additional locking for the data, imposes the overhead of additional processor and bus cycles, and also serializes some portion of the algorithm.
Message passing processing uses channels and message boxes but |
https://en.wikipedia.org/wiki/CAML | Caml is a dialect of the ML programming language.
CAML may also refer to:
Calcium modulating ligand
Canadian Association of Music Libraries, Archives and Documentation Centres
Census of Antarctic Marine Life, a field project of the Census of Marine Life
Collaborative Application Markup Language
See also
Camel (disambiguation)
OCaml |
https://en.wikipedia.org/wiki/Computational%20biology | Computational biology refers to the use of data analysis, mathematical modeling and computational simulations to understand biological systems and relationships. An intersection of computer science, biology, and big data, the field also has foundations in applied mathematics, chemistry, and genetics. It differs from biological computing, a subfield of computer science and engineering which uses bioengineering to build computers.
History
Bioinformatics, the analysis of informatics processes in biological systems, began in the early 1970s. At this time, research in artificial intelligence was using network models of the human brain in order to generate new algorithms. This use of biological data pushed biological researchers to use computers to evaluate and compare large data sets in their own field.
By 1982, researchers shared information via punch cards. The amount of data grew exponentially by the end of the 1980s, requiring new computational methods for quickly interpreting relevant information.
Perhaps the best-known example of computational biology, the Human Genome Project, officially began in 1990. By 2003, the project had mapped around 85% of the human genome, satisfying its initial goals. Work continued, however, and by 2021 level "complete genome" was reached with only 0.3% remaining bases covered by potential issues. The missing Y chromosome was added in January 2022.
Since the late 1990s, computational biology has become an important part of biology, leading to numerous subfields. Today, the International Society for Computational Biology recognizes 21 different 'Communities of Special Interest', each representing a slice of the larger field. In addition to helping sequence the human genome, computational biology has helped create accurate models of the human brain, map the 3D structure of genomes, and model biological systems.
Applications
Anatomy
Computational anatomy is the study of anatomical shape and form at the visible or gross anatomical scale of morphology. It involves the development of computational mathematical and data-analytical methods for modeling and simulating biological structures. It focuses on the anatomical structures being imaged, rather than the medical imaging devices. Due to the availability of dense 3D measurements via technologies such as magnetic resonance imaging, computational anatomy has emerged as a subfield of medical imaging and bioengineering for extracting anatomical coordinate systems at the morpheme scale in 3D.
The original formulation of computational anatomy is as a generative model of shape and form from exemplars acted upon via transformations. The diffeomorphism group is used to study different coordinate systems via coordinate transformations as generated via the Lagrangian and Eulerian velocities of flow from one anatomical configuration in to another. It relates with shape statistics and morphometrics, with the distinction that diffeomorphisms are used to map coordinate sy |
https://en.wikipedia.org/wiki/Subnet | A subnetwork or subnet is a logical subdivision of an IP network. The practice of dividing a network into two or more networks is called subnetting.
Computers that belong to the same subnet are addressed with an identical group of its most-significant bits of their IP addresses. This results in the logical division of an IP address into two fields: the network number or routing prefix, and the rest field or host identifier. The rest field is an identifier for a specific host or network interface.
The routing prefix may be expressed as the first address of a network, written in Classless Inter-Domain Routing (CIDR) notation, followed by a slash character (/), and ending with the bit-length of the prefix. For example, is the prefix of the Internet Protocol version 4 network starting at the given address, having 24 bits allocated for the network prefix, and the remaining 8 bits reserved for host addressing. Addresses in the range to belong to this network, with as the subnet broadcast address. The IPv6 address specification is a large address block with 296 addresses, having a 32-bit routing prefix.
For IPv4, a network may also be characterized by its subnet mask or netmask, which is the bitmask that, when applied by a bitwise AND operation to any IP address in the network, yields the routing prefix. Subnet masks are also expressed in dot-decimal notation like an IP address. For example, the prefix would have the subnet mask .
Traffic is exchanged between subnets through routers when the routing prefixes of the source address and the destination address differ. A router serves as a logical or physical boundary between the subnets.
The benefits of subnetting an existing network vary with each deployment scenario. In the address allocation architecture of the Internet using CIDR and in large organizations, efficient allocation of address space is necessary. Subnetting may also enhance routing efficiency, or have advantages in network management when subnets are administratively controlled by different entities in a larger organization. Subnets may be arranged logically in a hierarchical architecture, partitioning an organization's network address space into a tree-like routing structure, or other structures, such as meshes.
Network addressing and routing
Computers participating in an IP network have at least one network address. Usually, this address is unique to each device and can either be configured automatically by a network service with the Dynamic Host Configuration Protocol (DHCP), manually by an administrator, or automatically by the operating system with stateless address autoconfiguration.
An address fulfills the functions of identifying the host and locating it on the network in destination routing. The most common network addressing architecture is Internet Protocol version 4 (IPv4), but its successor, IPv6, has been increasingly deployed since approximately 2006. An IPv4 address consists of 32 bits. An IPv6 address consists |
https://en.wikipedia.org/wiki/Hospitality%20Club | Hospitality Club (HC) was a hospitality exchange service (a gift economy network for finding homestays whereby hosts were not allowed to charge for lodging) accessible via a website.
History
The first hospitality exchange service based on internet technology was Hospex.org in 1992 from Poland, which was later folded to Hospitality Club. Hospitality Club was founded in July 2000 in Koblenz, by Veit Kühne.
In 2005, a disagreement between some members of Hospitality Club and its founder led to the foundation of BeWelcome. Many HC members, who became distinguished volunteers within Couchsurfing (so-called CS ambassadors), left HC towards CS because of its missing legal status and insufficient management transparency.
In February 2006, Kühne was working full-time on Hospitality Club. In the spring of 2006, the hitherto biggest HC-Party took place in Riga counting 430 participants from 36 countries. As of July 2006, the site had 155,000 members. This number grew by around 1,000 new members a week in 2006.
In 2007, Google Trends search volume for hospitalityclub.org started to decline and was overtaken by the search volume for CouchSurfing. In 2007, HC's specified goals have been to facilitate "intercultural understanding ... bringing people together ... travelers and locals".
In 2008, HC had more than 400,000 members from 200 countries.
In 2012, HC made a partnership with AirBnB, inviting its members to join AirBnB.
In 2013, HC had more than a half of million members from 200 countries.
By 2017, only one third of members were still active.
Maintenance of the portal stalled in 2019, since early 2021 Hospitality Club was unusable, since April 2022 it is not possible to access the website.
Safety measures
Hospitality Club had a reputation system, whereby members left references for others. For added safety, members were encouraged to check each other's passports, although it rarely happened.
References
External links
A podcast about hospitality club on German RTL
Hospitality exchange services
German social networking websites |
https://en.wikipedia.org/wiki/Dye-sublimation%20printing | Dye-sublimation printing (or dye-sub printing) is a term that covers several distinct digital computer printing techniques that involve using heat to transfer dye onto a substrate.
The sublimation name was first applied because the dye was thought to make the transition between the solid and gas states without going through a liquid stage. This understanding of the process was later shown to be incorrect, as there is some liquefication of the dye. Since then, the proper name for the process has become known as dye diffusion, though this technically correct term has not supplanted the original name.
Historically, "dye sublimation" referred to page printers that use a thermal printhead to transfer dye from a ribbon directly onto the print media via sublimation. While it originally was used in creating prepress proofs, today this technology survives in ID card printers and dedicated photo printers, often under the name dye diffusion thermal transfer (D2T2).
The term was later also applied to the indirect sublimation transfer printing process, which uses a standard printer to deposit sublimation-capable toner or ink onto a transfer sheet. The printed transfer sheet is then pressed with the substrate with heat, transferring the dye to the substrate, such as plastic or fabric, via sublimation. Thus, this process is indirect, since the final substrate does not pass through the printer, and the sublimation step occurs separately.
The term direct dye sublimation is sometimes applied to a variant of digital textile printing using dye-sublimation inks printed directly onto fabric, which must then be heated to set the dyes, without the use of a transfer sheet.
Dye-sublimation page printing
Process
Using a mechanism which is a variant of the thermal-transfer printer, the most common direct process lays down one color at a time, the dye being stored on a polyester ribbon that has each color on a separate panel. Each colored panel is the size of the medium that is being printed on; for example, a 4x6 in (10x15cm) dye-sub printer would have four 4x6 in (10x15cm) panels.
During the printing cycle, the printer rollers will move the medium and one of the colored panels together under a thermal printing head, which is usually the same width as the shorter dimension of the print medium. Tiny heating elements on the head change temperature rapidly, laying different amounts of dye depending on the amount of heat applied. Some of the dye diffuses into the printing medium.
After the printer finishes printing the medium in one color, it advances the ribbon to the next color panel and partially ejects the medium from the printer to prepare for the next cycle. The entire process is repeated four or five times in total: the first three lay the colors onto the medium to form a complete image; there may or may not then be a (wax ink) black thermal transfer process; the last pass lays the laminate over top. This layer protects the dyes from UV light and moisture.
For |
https://en.wikipedia.org/wiki/ANN | ANN may refer to:
Media
All Night Nippon, Japan
All-Nippon News Network, Japan
Arab News Network, exile Syrian
Asia News Network, Asia
Asianet News, India
Anime News Network, online
Adventist News Network, online
Transportation
Annan railway station, from its National Rail code
Annette Island Airport, Alaska, United States, from its IATA airport code
Computing
Announcement (computing)
Artificial neural network
Other
Academy of Neonatal Nursing, US professional organization
New Nation Alternative (Alternativa Nueva Nación), a former political coalition in Guatemala
Ann Inc., US retail group, also with stock ticker symbol ANN
See also
Ann (disambiguation) |
https://en.wikipedia.org/wiki/IBM%207030%20Stretch | The IBM 7030, also known as Stretch, was IBM's first transistorized supercomputer. It was the fastest computer in the world from 1961 until the first CDC 6600 became operational in 1964.
Originally designed to meet a requirement formulated by Edward Teller at Lawrence Livermore National Laboratory, the first example was delivered to Los Alamos National Laboratory in 1961, and a second customized version, the IBM 7950 Harvest, to the National Security Agency in 1962. The Stretch at the Atomic Weapons Research Establishment at Aldermaston, England was heavily used by researchers there and at AERE Harwell, but only after the development of the S2 Fortran Compiler which was the first to add dynamic arrays, and which was later ported to the Ferranti Atlas of Atlas Computer Laboratory at Chilton.
The 7030 was much slower than expected and failed to meet its aggressive performance goals. IBM was forced to drop its price from $13.5 million to only $7.78 million and withdrew the 7030 from sales to customers beyond those having already negotiated contracts. PC World magazine named Stretch one of the biggest project management failures in IT history.
Within IBM, being eclipsed by the smaller Control Data Corporation seemed hard to accept. The project lead, , was initially made a scapegoat for his role in the "failure", but as the success of the IBM System/360 became obvious, he was given an official apology and, in 1966 was made an IBM Fellow.
In spite of Stretch's failure to meet its own performance goals, it served as the basis for many of the design features of the successful IBM System/360, which was announced in 1964 and first shipped in 1965.
Development history
In early 1955, Dr. Edward Teller of the University of California Radiation Laboratory wanted a new scientific computing system for three-dimensional hydrodynamic calculations. Proposals were requested from IBM and UNIVAC for this new system, to be called Livermore Automatic Reaction Calculator or LARC. According to IBM executive Cuthbert Hurd, such a system would cost roughly $2.5 million and would run at one to two MIPS. Delivery was to be two to three years after the contract was signed.
At IBM, a small team at Poughkeepsie including John Griffith and Gene Amdahl worked on the design proposal. Just after they finished and were about to present the proposal, Ralph Palmer stopped them and said, "It's a mistake." The proposed design would have been built with either point-contact transistors or surface-barrier transistors, both likely to be soon outperformed by the then newly invented diffusion transistor.
IBM returned to Livermore and stated that they were withdrawing from the contract, and instead proposed a dramatically better system, "We are not going to build that machine for you; we want to build something better! We do not know precisely what it will take but we think it will be another million dollars and another year, and we do not know how fast it will run but we would like to |
https://en.wikipedia.org/wiki/Exidy%20Sorcerer | The Sorcerer is a home computer system released in 1978 by the video game company Exidy, later under their Exidy Systems subsidiary. Based on the Zilog Z80 and the general layout of the emerging S-100 standard, the Sorcerer was comparatively advanced when released, especially when compared to the contemporary more commercially successful Commodore PET and TRS-80. The basic design was proposed by Paul Terrell, formerly of the Byte Shop, a pioneering computer store.
Lacking strong support from its parent company, who were focused on the successful arcade game market, the Sorcerer was sold primarily through international distributors and technology licensing agreements. Distribution agreements with Dick Smith Electronics in Australia and Liveport in the UK as well as Compudata which included a manufacturing license to build, market and distribute the Tulip line of computers in Europe. The system remains relatively unknown outside these markets.
The Exidy Data Systems division was sold to a Wall Street firm, Biotech, in 1983.
History
Origins
Paul Terrell entered the computer industry by starting the first personal computer store, the Byte Shop, in 1975. By 1977, the store had grown into a chain of 58 stores, and Terrell sold the chain to John Peers of Logical Machine Corporation.
With free time on his hands, Terrell started looking for new ventures. He wanted a consumer computer that was user-friendly beyond anything currently in the marketplace. At the time, the Commodore PET and Tandy TRS-80 offered the out-of-the-box experience he considered essential, yet required a costly computer monitor (the PET did not require a monitor) in spite of their inadequate graphics. The Apple II had superior graphics and color, but required some user assembly before being operational.
Terrell's objective was a machine offering the best of both worlds. Looking for a suitable name, he noted "Computers are like magic to people, so let's give them computer magic with the Sorcerer computer."
Exidy
Terrell was friends with H.R. "Pete" Kauffman and Howell Ivy of Exidy, a successful arcade game manufacturer. Terrell noted "Their graphic designs with a computer were so good they would take quarters out of my pocket." Howell, VP of Engineering, was a computer enthusiast and was interested in Terrell's concept. The wish list of design improvements over the existing designs went like this:
A keyboard computer that could plug into a television set like the Apple II and TRS-80 but also plug into a computer monitor to display high resolution graphics.
An easily programmable graphics character set like the Commodore PET, so aspiring programmers could write BASIC language programs that would impress their friends. The Sorcerer design was eloquent with the highest resolution in the marketplace and innovative because the graphic characters could be reprogrammed to represent any kind of 8x8 character the programmer wanted and was not fixed like the graphic characters on the |
https://en.wikipedia.org/wiki/Microsoft%20BASIC | Microsoft BASIC is the foundation software product of the Microsoft company and evolved into a line of BASIC interpreters and compiler(s) adapted for many different microcomputers. It first appeared in 1975 as Altair BASIC, which was the first version of BASIC published by Microsoft as well as the first high-level programming language available for the Altair 8800 microcomputer.
During the home computer craze during the late-1970s and early-1980s, BASIC was ported to and supplied with many home computer designs. Slight variations to add support for machine-specific functions, especially graphics, led to a profusion of related designs like Commodore BASIC and Atari Microsoft BASIC.
As the early home computers gave way to newer designs like the IBM Personal Computer and Macintosh, BASIC was no longer as widely used, although it retained a strong following. The release of Visual Basic reboosted its popularity and it remains in wide use on Microsoft Windows platforms in its most recent incarnation, Visual Basic .NET.
Altair BASIC and early microcomputers
The Altair BASIC interpreter was developed by Microsoft founders Paul Allen and Bill Gates using a self-written Intel 8080 emulator running on a PDP-10 minicomputer. The MS dialect is patterned on Digital Equipment Corporation's BASIC-PLUS on the PDP-11, which Gates had used in high school. The first versions supported integer math only, but Monte Davidoff convinced them that floating-point arithmetic was possible, and wrote a library which became the Microsoft Binary Format.
Altair BASIC was delivered on paper tape and in its original version took 4 KB of memory. The following functions and statements were available:
LIST, NEW, PRINT, INPUT, IF...THEN, FOR...NEXT, SQR, RND, SIN, LET, USR, DATA, READ, REM, CLEAR, STOP, TAB, RESTORE, ABS, END, INT, RETURN, STEP, GOTO, and GOSUB.
There were no string variables in 4K BASIC and single-precision 32-bit floating point was the only numeric type supported. Variable names consisted of one letter (A–Z) or one letter followed by one digit (0–9), thus allowing up to 286 numeric variables.
For machines with more memory, the 8 KB version added 31 additional statements and support for string variables and their related operations like MID$ and string concatenation. String variables were denoted with a $ suffix, which remained in later versions of the language. Later on, Microsoft released the 12K Extended BASIC, which included double precision 64-bit variables, IF...THEN...ELSE structures, user defined functions, more advanced program editing commands, and descriptive error messages as opposed to error numbers. Numeric variables now had three basic types, % denoted 16-bit integers, # denoted 64-bit doubles, and ! denoted 32-bit singles, but this was the default format so the ! is rarely seen in programs.
The extended 8 KB version was then generalized into BASIC-80 (8080/85, Z80), and ported into BASIC-68 (6800), BASIC-69 (6809), and 6502-BASIC. The 6502 ha |
https://en.wikipedia.org/wiki/Framebuffer | A framebuffer (frame buffer, or sometimes framestore) is a portion of random-access memory (RAM) containing a bitmap that drives a video display. It is a memory buffer containing data representing all the pixels in a complete video frame. Modern video cards contain framebuffer circuitry in their cores. This circuitry converts an in-memory bitmap into a video signal that can be displayed on a computer monitor.
In computing, a screen buffer is a part of computer memory used by a computer application for the representation of the content to be shown on the computer display. The screen buffer may also be called the video buffer, the regeneration buffer, or regen buffer for short. Screen buffers should be distinguished from video memory. To this end, the term off-screen buffer is also used.
The information in the buffer typically consists of color values for every pixel to be shown on the display. Color values are commonly stored in 1-bit binary (monochrome), 4-bit palettized, 8-bit palettized, 16-bit high color and 24-bit true color formats. An additional alpha channel is sometimes used to retain information about pixel transparency. The total amount of memory required for the framebuffer depends on the resolution of the output signal, and on the color depth or palette size.
History
Computer researchers had long discussed the theoretical advantages of a framebuffer, but were unable to produce a machine with sufficient memory at an economically practicable cost. In 1947, the Manchester Baby computer used a Williams tube, later the Williams-Kilburn tube, to store 1024 bits on a cathode-ray tube (CRT) memory and displayed on a second CRT. Other research labs were exploring these techniques with MIT Lincoln Laboratory achieving a 4096 display in 1950.
A color scanned display was implemented in the late 1960s, called the Brookhaven RAster Display (BRAD), which used a drum memory and a television monitor. In 1969, A. Michael Noll of Bell Labs implemented a scanned display with a frame buffer, using magnetic-core memory. Later on, the Bell Labs system was expanded to display an image with a color depth of three bits on a standard color TV monitor.
In the early 1970s, the development of MOS memory (metal–oxide–semiconductor memory) integrated-circuit chips, particularly high-density DRAM (dynamic random-access memory) chips with at least 1kb memory, made it practical to create, for the first time, a digital memory system with framebuffers capable of holding a standard video image. This led to the development of the SuperPaint system by Richard Shoup at Xerox PARC in 1972. Shoup was able to use the SuperPaint framebuffer to create an early digital video-capture system. By synchronizing the output signal to the input signal, Shoup was able to overwrite each pixel of data as it shifted in. Shoup also experimented with modifying the output signal using color tables. These color tables allowed the SuperPaint system to produce a wide variety of colors outs |
https://en.wikipedia.org/wiki/Csound | Csound is a domain-specific computer programming language for audio programming. It is called Csound because it is written in C, as opposed to some of its predecessors.
It is free software, available under the LGPL-2.1-or-later.
Csound was originally written at MIT by Barry Vercoe in 1985, based on his earlier system called Music 11, which in its turn followed the MUSIC-N model initiated by Max Mathews at the Bell Labs.
Its development continued throughout
the 1990s and 2000s, led by John Fitch at the University of Bath.
The first documented version 5 release is version 5.01 on March 18, 2006.
Many developers have contributed to it, most notably Istvan Varga, Gabriel Maldonado, Robin Whittle, Richard Karpen, Iain McCurdy, Michael Gogins, Matt Ingalls, Steven Yi, Richard Boulanger, Victor Lazzarini and Joachim Heintz.
Developed over many years, it currently has nearly 1700 unit generators.
One of its greatest strengths is that it is completely modular and extensible by the user.
Csound is closely related to the underlying language for the Structured Audio extensions to MPEG-4, SAOL.
Csound code
Csound takes two specially formatted text files as input. The orchestra describes the nature of the instruments and the score describes notes and other parameters along a timeline. Csound processes the instructions in these files and renders an audio file or real-time audio stream as output.
The orchestra and score files may be unified into a single structured file using markup language tags (a CSD file with filename extension .csd). Here is a very simple example of a unified Csound data file which produces a wave file containing a one-second sine wave tone of 1 kHz at a sample rate of 96 kHz:
<CsoundSynthesizer>
<CsOptions>
csound -W -d -o tone.wav
</CsOptions>
<CsInstruments>
sr = 96000 ; Sample rate.
kr = 9600 ; Control signal rate.
ksmps = 10 ; Samples per control signal.
nchnls = 1 ; Number of output channels.
instr 1
a1 oscil p4, p5, 1 ; Oscillator: p4 and p5 are the arguments from the score, 1 is the table number.
out a1 ; Output.
endin
</CsInstruments>
<CsScore>
f1 0 8192 10 1 ; Table containing a sine wave. Built-in generator 10 produces a sum of sinusoids, here only one.
i1 0 1 20000 1000 ; Play one second of one kHz at amplitude 20000.
e
</CsScore>
</CsoundSynthesizer>
As with many other programming languages, writing long programs in Csound can be eased by using an integrated environment for editing, previewing, testing, and debugging. The one now officially supported is CsoundQt, and it has many features, such as automatic code insertion, integrated documentation browser, integrated widgets for graphically controlling parameters in realtime, plus a button for playing the code.
Csound 5
Version 5.01 was released on March 18, 2006 – 20 years after csound's first relea |
https://en.wikipedia.org/wiki/Graph%20reduction%20machine | A graph reduction machine is a special-purpose computer built to perform combinator calculations by graph reduction.
Examples include the SKIM ("S-K-I machine") computer, built at the University of Cambridge Computer Laboratory, the multiprocessor GRIP ("Graph Reduction In Parallel") computer, built at University College London, and the Reduceron, which was implemented on an FPGA with the single purpose of executing Haskell.
See also
SECD machine
References
Further reading
T. J. W. Clarke, P. Gladstone, C. MacLean, A. C. Norman: SKIM — The S, K, I Reduction Machine. LISP Conference, 1980: 128–135
External links
Reduction Machines, Parallel Functional Programming: An Introduction, Kevin Hammond
Applicative computing systems
Functional programming
University of Cambridge Computer Laboratory |
https://en.wikipedia.org/wiki/X86%20memory%20segmentation | x86 memory segmentation refers to the implementation of memory segmentation in the Intel x86 computer instruction set architecture. Segmentation was introduced on the Intel 8086 in 1978 as a way to allow programs to address more than 64 KB (65,536 bytes) of memory. The Intel 80286 introduced a second version of segmentation in 1982 that added support for virtual memory and memory protection. At this point the original mode was renamed to real mode, and the new version was named protected mode. The x86-64 architecture, introduced in 2003, has largely dropped support for segmentation in 64-bit mode.
In both real and protected modes, the system uses 16-bit segment registers to derive the actual memory address. In real mode, the registers CS, DS, SS, and ES point to the currently used program code segment (CS), the current data segment (DS), the current stack segment (SS), and one extra segment determined by the programmer (ES). The Intel 80386, introduced in 1985, adds two additional segment registers, FS and GS, with no specific uses defined by the hardware. The way in which the segment registers are used differs between the two modes.
The choice of segment is normally defaulted by the processor according to the function being executed. Instructions are always fetched from the code segment. Any stack push or pop or any data reference referring to the stack uses the stack segment. All other references to data use the data segment. The extra segment is the default destination for string operations (for example MOVS or CMPS). FS and GS have no hardware-assigned uses. The instruction format allows an optional segment prefix byte which can be used to override the default segment for selected instructions if desired.
Real mode
In real mode or V86 mode, the size of a segment can range from 1 byte up to 65,536 bytes (using 16-bit offsets).
The 16-bit segment selector in the segment register is interpreted as the most significant 16 bits of a linear 20-bit address, called a segment address, of which the remaining four least significant bits are all zeros. The segment address is always added to a 16-bit offset in the instruction to yield a linear address, which is the same as physical address in this mode. For instance, the segmented address 06EFh:1234h (here the suffix "h" means hexadecimal) has a segment selector of 06EFh, representing a segment address of 06EF0h, to which the offset is added, yielding the linear address 06EF0h + 1234h = 08124h.
Because of the way the segment address and offset are added, a single linear address can be mapped to up to 212 = 4096 distinct segment:offset pairs. For example, the linear address 08124h can have the segmented addresses 06EFh:1234h, 0812h:0004h, 0000h:8124h, etc.
This could be confusing to programmers accustomed to unique addressing schemes, but it can also be used to advantage, for example when addressing multiple nested data structures. While real mode segments are always 64 KB long, the prac |
https://en.wikipedia.org/wiki/Application | Application may refer to:
Mathematics and computing
Application software, computer software designed to help the user to perform specific tasks
Application layer, an abstraction layer that specifies protocols and interface methods used in a communications network
Function application, in mathematics and computer science
Processes and documents
Application for employment, a form or forms that an individual seeking employment must fill out
College application, the process by which prospective students apply for entry into a college or university
Patent application, a document filed at a patent office to support the grant of a patent
Other uses
Application (virtue), a characteristic encapsulated in diligence
Topical application, the spreading or putting of medication to body surfaces
See also
Apply |
https://en.wikipedia.org/wiki/Fixed-point%20combinator | In mathematics and computer science in general, a fixed point of a function is a value that is mapped to itself by the function.
In combinatory logic for computer science, a fixed-point combinator (or fixpoint combinator) is a higher-order function that returns some fixed point of its argument function, if one exists.
Formally, if the function f has one or more fixed points, then
and hence, by repeated application,
Y combinator
In the classical untyped lambda calculus, every function has a fixed point.
A particular implementation of fix is Curry's paradoxical combinator Y, represented by
In functional programming, the Y combinator can be used to formally define recursive functions in a programming language that does not support recursion.
This combinator may be used in implementing Curry's paradox. The heart of Curry's paradox is that untyped lambda calculus is unsound as a deductive system, and the Y combinator demonstrates this by allowing an anonymous expression to represent zero, or even many values. This is inconsistent in mathematical logic.
Applied to a function with one variable, the Y combinator usually does not terminate. More interesting results are obtained by applying the Y combinator to functions of two or more variables. The additional variables may be used as a counter, or index. The resulting function behaves like a while or a for loop in an imperative language.
Used in this way, the Y combinator implements simple recursion. In the lambda calculus, it is not possible to refer to the definition of a function inside its own body by name. Recursion though may be achieved by obtaining the same function passed in as an argument, and then using that argument to make the recursive call, instead of using the function's own name, as is done in languages which do support recursion natively. The Y combinator demonstrates this style of programming.
An example implementation of Y combinator in two languages is presented below.
# Y Combinator in Python
Y=lambda f: (lambda x: f(x(x)))(lambda x: f(x(x)))
Y(Y)
// Y Combinator in C++
int main() {
auto Y = [](auto f) {
auto f1 = [f](auto x) -> decltype(f) {
// A print statement may be inserted here,
// to observe that we get an infinite loop
// (at least until the stack overflows)
return f(x(x));
};
return f1(f1);
};
Y(Y);
}
Fixed-point combinator
The Y combinator is an implementation of a fixed-point combinator in lambda calculus. Fixed-point combinators may also be easily defined in other functional and imperative languages. The implementation in lambda calculus is more difficult due to limitations in lambda calculus.
The fixed-point combinator may be used in a number of different areas:
General mathematics
Untyped lambda calculus
Typed lambda calculus
Functional programming
Imperative programming
Fixed-point combinators may be applied to a range of different functions, but n |
https://en.wikipedia.org/wiki/Eurovision%20%28disambiguation%29 | The Eurovision Song Contest is an annual song competition.
Eurovision may also refer to:
Eurovision (network), a TV network part of the European Broadcasting Union, that organises the Eurovision Song Contest and other Eurovision events
"Euro-Vision", the 1980 Belgian entry to the Eurovision Song Contest
Eurovision Song Contest: The Story of Fire Saga, a 2020 comedy film inspired by the Eurovision Song Contest
The Eurovision Museum, a museum exhibition in Húsavík about the history of the contest.
See also
Eurosong (disambiguation) |
https://en.wikipedia.org/wiki/Dillo | Dillo is a minimalistic web browser particularly intended for older or slower computers and embedded systems. It supports only plain HTML/XHTML (with CSS rendering) and images over HTTP; scripting is ignored entirely. Current versions of Dillo can run on Linux, BSD, OS X, IRIX and Cygwin. Due to its small size, it is the browser of choice in several space-conscious Linux distributions. Released under the GNU GPL-3.0-or-later, Dillo is free software.
Chilean software engineer Jorge Arellano Cid conceived the Dillo project in late 1999, publishing the first version of Dillo in December of that year. His primary goal in creating Dillo was to democratize access to information. Arellano Cid believed that no one should have to buy a new computer or pay for broadband in order to enjoy the World Wide Web. To this end, he designed Dillo to be small, fast, and efficient, capable of performing well even on an Intel 80486 CPU with a dial-up Internet access.
Development
Dillo was originally written in the C programming language with the GTK+ GUI toolkit. The first versions were based on an earlier browser called Armadillo, hence the name. Dillo 2, written with both C and C++ components and the Fast Light Toolkit (FLTK), was released on October 14, 2008. Text antialiasing, support for character sets other than Latin-1, HTTP compression capability, and improved page rendering were all added. The move to FLTK from GTK+ also removed many of the project's dependencies and reduced Dillo's memory footprint by 50%.
In 2011, Dillo-3.x was released, using FLTK-1.3. According to the Changelog, this change was prompted in part by the lack of an official release of FLTK-2, which stopped Dillo-2's inclusion in lightweight distributions for which it would otherwise have been suitable.
Jorge Arellano Cid is still Dillo's lead developer today. Dillo is funded by private donations; efforts to obtain public grants and corporate sponsors have been unsuccessful. Lack of funding led to a slowdown in development in 2006, and a complete stop in 2007. The project restarted again in 2008 and two months later received a 115 € donation from DistroWatch.
Features
Features of Dillo include bookmarks, tabbed browsing, and support for JPEG, PNG (including alpha transparency), and GIF images. Partial support for CSS was introduced in release 2.1. Settings such as the default fonts, background color, downloads folder, and home page are customizable through configuration files. Cookies are supported but disabled by default due to privacy concerns. While most web browsers retain the web cache and history after the program is closed, Dillo automatically clears them to improve both privacy and performance.
A developer tool called the "bug meter" is provided in the lower-right corner. When clicked, it displays information about validation problems, such as unclosed tags, that Dillo found in the web page. Unlike most browsers, Dillo does not have a quirks mode to improve compatibility with we |
https://en.wikipedia.org/wiki/Ted%20Lewis | Ted Lewis may refer to:
Ted Lewis (baseball) (1872–1936), Welsh-born professional baseball player in Boston, university president
Ted Lewis (computer scientist) (born 1941), American computer scientist and mathematician, and professor at the Naval Postgraduate School
Ted Lewis (musician) (1890–1971), American bandleader, musician, entertainer, singer
Ted Lewis (voice actor) (born 1969), American voice actor
Ted Lewis (writer) (1940–1982), English crime novelist
Ted "Kid" Lewis (1893–1970), English world boxing champion
See also
Edward Lewis (disambiguation)
Theodore Lewis (disambiguation)
Duris Maxwell (born 1946), Canadian drummer who has used the alias Ted Lewis |
https://en.wikipedia.org/wiki/Sin%3A%20The%20Movie | Sin: The Movie is a Japanese cyberpunk action horror film original video animation released in 2000 by ADV Films, adapted from the game of the same title.
Cast
English cast
Colonel Blade - Markham Anderson
Jennifer Armack - Shelley Calene-Black
Jason Armack - Chris Patton
Elexis Sinclaire - Sian Taylor
Vincenzo Manchini - Andy McAvin
Kait Palmer - LaTeace Towns-Cuellar
Tim Perko - Vic Mignogna
Elyse Stewart - Danielle Kimball
Lorenzo Vitello - Ted Pfister
Dr. Daniel Greenwall - David Parker
Tina Vasant - Jocelyn Donegan
Skycity Announcer/Mutant Elyse - Hilary Haag
Blade's Father - Robert Vellani
Hardcorps Commander/Cop 3/SinTEK Executive - Jason Douglas
Cop 1/Dispatcher 1/SinTEK Executive - John Swasey
Cop 2/Dispatcher 2/Elyse's Dad - Lew Temple
Cop 4/SinTEK Executive/Reporter - Matt Kelley
Dispatcher 2/Elyse's Mom - Kelly Mansion
Dispatcher 4/Ensign - Christopher Bourque
Guard/Medic - Randy Sparks
Priest - Mike Kleinhenz
Release
Sin: The Movie was released on VHS and DVD in 2000 in both Japan and USA. The special edition DVD was released in 2003 with more extra features. In 2009, the film was re-released on DVD.
Further reading
External links
2000 anime OVAs
2000 horror films
2000 action films
Action anime and manga
Animated cyberpunk films
Anime and manga set in the United States
Japanese action horror films
Cyberpunk anime and manga
Cyberpunk films
Horror anime and manga
Japanese action films
Japanese horror films
ADV Films
OVAs based on video games
2000 films
Direct-to-video action films
Direct-to-video horror films
Japanese direct-to-video films
Anime films based on video games
Biopunk anime and manga
Films scored by Masamichi Amano |
https://en.wikipedia.org/wiki/List%20of%20number-one%20Billboard%20Latin%20Pop%20Airplay%20songs%20of%202007 | The Billboard Latin Pop Songs is a chart that ranks the best-performing Spanish-language Pop music singles of the United States. Published by Billboard magazine, the data are compiled by Nielsen SoundScan based collectively on each single's weekly airplay.
Chart history
See also
List of number-one Billboard Hot Latin Songs of 2007
References
United States Latin Pop Airplay
2007
2007 in Latin music |
https://en.wikipedia.org/wiki/14%20Hours%20%282005%20film%29 | 14 Hours is a 2005 medical emergency docudrama produced for the TNT Network and starring JoBeth Williams, Kris Kristofferson and Ricky Schroder. The film was set in Houston, Texas and filmed in Vancouver, Canada. Based on true-life events surrounding Tropical Storm Allison in 2001, the film was released internationally on DVD by Paramount Pictures. 14 Hours was produced through Cosmic Entertainment, which counts Kurt Russell, Goldie Hawn, Oliver Hudson and Kate Hudson as its principals, and sponsored by Johnson & Johnson. The Decades channel aired this movie in March 2017.
Plot
Cast
JoBeth Williams as Jeanette Makins
Kris Kristofferson as Chuck Whortle
Kirsten Robek as Nurse Lily
Kevin McNulty as Larry Dastych
Jason Schombing as Bronson
Rick Schroder as Dr. Foster
Kim Roberts as Helen
Karin Konoval as Dr. Estrada
Simone Bailly as Phoebe
Rick Dobran as Gary
Backstory
Houston native JoBeth Williams weathered her share of tropical storm and hurricane conditions as a child. Her mother worked as a dietician at Memorial-Herrmann (the Houston-area hospital where 14 Hours is set) for 18 years.
The premature baby in the movie is based in Zachary Jackson's struggle to survive not only prematurity but also the loss of power to his life-support equipment when he weighed around 2 lbs (1 kilogram). He is now a healthy teenager in the Houston Metropolitan area, and did a fundraiser to make Relief Boxes full of preemie essentials to victims of Hurricane Harvey and delivered them to Intensive Care Units.
The producers were inspired by the Reader's Digest article "BLACKOUT" by Peter Michelmore published in April 2002.
References
External links
2005 television films
2005 films
Films set in Houston
Films shot in Vancouver
Disaster films based on actual events
Medical-themed films
2005 action drama films
American action drama films
American disaster films
American films based on actual events
Paramount Pictures films
TNT Network original films
Films directed by Gregg Champion
American drama television films
2000s American films |
https://en.wikipedia.org/wiki/List%20of%20number-one%20Billboard%20Latin%20Pop%20Airplay%20songs%20of%202006 | The Billboard Latin Pop Songs is a chart that ranks the best-performing Spanish-language Pop music singles of the United States. Published by Billboard magazine, the data are compiled by Nielsen SoundScan based collectively on each single's weekly airplay.
Chart history
See also
List of number-one Billboard Hot Latin Songs of 2006
References
United States Latin Pop Airplay
2006
2006 in Latin music |
https://en.wikipedia.org/wiki/Aga%20Khan%20Academy%2C%20Hyderabad | Aga Khan Academy, Hyderabad is an international school in Hyderabad, India. It is located near Rajiv Gandhi International Airport and also Pahadi Shareef.
History
The Aga Khan Academies are a network of residential schools for talented students spanning from Africa and the Middle East, to South and Central Asia.
Admission is means-blind and based on merit. Financial aid is available to ensure access for accepted students regardless of financial circumstances. When complete, the network of Academies will form a global learning community of about 18 schools in 14 countries. They will eventually serve approximately 14,000 girls and boys of exceptional calibre, graduating 1,500 students annually.
The Aga Khan Academies are an agency of the Aga Khan Development Network (AKDN), which is chaired by His Highness the Aga Khan. The AKDN has a long history of involvement in education in countries of the developing world, with the first schools now under the AKDN umbrella having been founded in 1905 in India and Zanzibar. Currently, AKDN agencies operate more than 240 schools and educational programmes ranging from early childhood through to post-graduate education.
Establishment of the Aga Khan Academy, Hyderabad
Construction of the second Aga Khan Academy in Hyderabad began in 2006. The first intake of students was in August 2011 for the Junior School and 2012 for the Senior School, including the residential programme. The first class of the Senior School’s International Baccalaureate programme graduated in 2014.
The Academy's Professional Development Centre (PDC) began operating in July 2010, prior to the opening of the school. The first programme offered by the PDC was a series on Professional Learning for Educators. These are collaborative courses designed by the Aga Khan Academies with input from government and educational experts. Their aim is to improve the education of both students and teachers within the region.
Curriculum
Its curriculum is built on the framework of the International Baccalaureate (IB).
Admissions
Admission to the Aga Khan Academy, Hyderabad is based on merit , intelligence and talent of a child.
Faculty
Faculty members also have the opportunity to collaborate with colleagues across the globe and to teach abroad within the Aga Khan Academies network.
Facilities
Built on a 100-acre land near Rajiv Gandhi International Airport.
It is the second in a network of about 18 planned Academies offering education to students in countries across Africa, The Middle East, South and Central Asia. The campus is very huge and is purpose built.
The Commons Building houses the dining hall and an array of spaces for school activities. It is designed for major school functions, including music and drama performances, and public lectures.
Sports facilities are extensive and include: Swimming and diving pools,
Sports fields, for example for soccer, hockey and athletics,
Tennis courts,
Squash courts and
Gym room.
References
External link |
https://en.wikipedia.org/wiki/Shed%20Skin | Shed Skin is an experimental restricted-Python (3.8+) to C++ programming language compiler. It can translate pure, but implicitly statically typed Python programs into optimized C++. It can generate stand-alone programs or extension modules that can be imported and used in larger Python programs.
Shed Skin is an open source project with contributions from many people, however the main author is Mark Dufour. Work has been going into Shed Skin since 2005.
Features
Besides the typing restriction, programs cannot freely use the Python standard library, although about 20 common modules, such as random, itertools and re (regular expressions), are supported as of 2011. Also, not all Python features, such as nested functions and variable numbers of arguments, are supported. Many introspective dynamic parts of the language are unsupported. For example, functions like getattr, and hasattr are unsupported.
As of May 2011, Unicode is not supported.
As of June 2016 for a set of 75 non-trivial test programs (at over 25,000 lines of code in total), measurements show a typical speedup of 2-20 times over Psyco, and 2-200 times over CPython. Shed Skin is still in an early stage of development, so many other programs will not compile unmodified.
Shed Skin can be used to generate standalone executables which need only the C++ runtime libraries. It can also be used to generate CPython modules. This allows compiling parts of larger programs with Shed Skin, while running the other parts using regular CPython.
Another use has been to wrap C++ classes using Shed Skin to allow C++ classes to be used as Python classes.
The license of the Shed Skin source code is under two parts. The main compiler code is under the GNU General Public License (GPL). The supporting code that it uses as a run time library is under a BSD or MIT license depending on the module. This allows compiling both GPL and non-GPL programs.
Type inference
Shed Skin combines Ole Agesen's Cartesian Product Algorithm (CPA) with the data-polymorphic part of John Plevyak's Iterative Flow Analysis (IFA). Version 0.6 introduced scalability improvements which repeatedly analyze larger versions of a program (in addition to the mentioned techniques), until it is fully analyzed. This allows Shed Skin to do type inference on larger programs than previously. It starts with an empty callgraph, essentially, and slowly adds to it, until the whole call graph has been added. A graph has been published by the author, showing analysis times for 50 example programs, at a total of around 15,000 lines.
Modules
For version 0.9 the following 25 modules are largely supported. Several of these, such as os.path, were compiled to C++ using Shed Skin.
array
binascii
bisect
collections (defaultdict, deque)
ConfigParser (no SafeConfigParser)
copy
colorsys
csv (no Dialect, Sniffer)
datetime
fnmatch
getopt
glob
heapq
itertools (no starmap)
math
mmap
os
os.path
random
re
socket
string
struct (no S |
https://en.wikipedia.org/wiki/LocDB | LocDB is an expert-curated database that collects experimental annotations for the subcellular localization of proteins in Homo sapiens (human) and Arabidopsis thaliana (Weed). The database also contains predictions of subcellular localization from a variety of state-of-the-art prediction methods for all proteins with experimental information.
Proteins are the fundamental functional components of cells. They are responsible for transforming genetic information into physical reality. These macromolecules mediate gene regulation, enzymatic catalysis, cellular metabolism, DNA replication, and transport of nutrients, recognition, and transmission of signals. The interpretation of this wealth of data to elucidate protein function in post-genomic era is a fundamental challenge. To date, even for the most well-studied organisms such as yeast, about one-fourth of the proteins remain uncharacterized. A major obstacle in experimentally determining protein function is that the studies require enormous resources. Hence, the gap between the amount of sequences deposited in databases and the experimental characterization of the corresponding proteins is ever-growing. Bioinformatics plays a central role in bridging this sequence-function gap through the development of tools for faster and more effective prediction of protein function. This repository effectively fills the gap between experimental annotations and predictions and provides a bigger and more reliable dataset for the testing of new prediction methods.
See also
Protein targeting
Protein Subcellular localization prediction
References
Biological databases
Protein targeting
Protein classification |
https://en.wikipedia.org/wiki/Stuttgart-Rohr%20station | Rohr station is located the chainage of 16.7 km (from Stuttgart Hauptbahnhof via the old route) on the Stuttgart–Horb railway () and is a station in the network of the Stuttgart S-Bahn.
History
When the Royal Württemberg State Railways opened the Gäu Railway from Stuttgart to Freudenstadt in September 1879, many residents of Rohr saw only the drawbacks of the new system of transport. Some farmers had been dispossessed for the line and believed the railway would bring only noise and odours. But when industrialisation began in the neighbouring village of Vaihingen and commuters from Rohr took advantage of its station, people learned of rail's advantages.
In 1906, Rohr station opened for passenger services. The station building was a one-story brick building with a waiting-room and station services on the former platform 1, which served the line towards Böblingen.
The line to Echterdingen has branched off 600 metres south of the station since October 1920. In 1935 the station was renamed Rohr (b Stuttgart). A year later, on 1 October 1936 the community of Rohr was incorporation in the Vaihingen auf den Fildern. This led to a second name change to Vaihingen-Rohr. In 1942, Vaihingen was incorporated into Stuttgart and the name was changed to Stuttgart-Rohr.
From 1982, Deutsche Bundesbahn began to upgrade the Gäu Railway to four tracks between the junction with the Verbindungsbahn (the underground section of the Stuttgart S-Bahn) and the branch to Echterdingen. This expansion was completed in 1984, leading to the demolition of the station building. The two outer platforms were replaced by a central platform.
Operations
The station has an island platform, which has a passage down to Osterbronnstraße and is connected by an underpass to Egelhaafstraße. It is served by lines S 1, S 2 and S 3 of the Stuttgart S-Bahn.
Platform track 2 is served by S-Bahn trains towards Böblingen or Stuttgart Flughafen/Messe and track 3 is used by S-Bahn services to Stuttgart Hauptbahnhof. Tracks 1 and 4 are used by non-stopping trains and have no platforms.
Rohr station is classified by Deutsche Bahn as a category 4 station.
S-Bahn
Notes
References
Rohr
Railway stations in Germany opened in 1906
Rohr |
https://en.wikipedia.org/wiki/National%20Register%20of%20Electors | The National Register of Electors () is a continuously updated permanent database of eligible electors for federal elections in Canada maintained by Elections Canada. It was established in December 1996 when Bill C-63 was granted royal assent and the preliminary National Register of Electors was populated with data in April 1997 during the final Canada-wide enumeration. It replaced a system which required door-to-door enumeration of eligible electors for each electoral event. The database contains basic information about electors: name, address, sex, and date of birth. An elector may register or update their personal information between elections, or may request to be excluded from it per the Canada Elections Act.
Elections Canada has data sharing arrangements with federal, provincial, territorial, municipal, and other agencies throughout Canada to update the National Register of Electors and ensure its currency, and to enable other jurisdictions to update their respective databases with information from the National Register of Electors. Obtaining data from other parties, and sharing of data with those parties, must be consistent with the Canada Elections Act or the various elections legislation of the respective province or territory. Elections Canada has two-way data sharing arrangements with the electoral agencies of each province and territory except Saskatchewan and Yukon, from which it may obtain but to which it cannot send information.
In conjunction with the National Geographic Database, the National Register of Electors is used to create preliminary voters lists for each electoral district in Canada for each election, by-election, and referendum. Each candidate from each electoral district is given a voters list for that district, which is a subset of the data in the National Register of Electors whose addresses are within the boundaries of the district as defined in the National Geographic Database. That data may only be used for election purposes; any other use of that data subjects the user to penalties including fines, imprisonment, or both. The voter lists are updated by returning officers based on information received during an election campaign, ultimately resulting in final voters lists being distributed by election day.
Use of the National Register of Electors has allowed Elections Canada to avoid over $100 million in election-related expenditures up to the 2006 federal election.
Creation
The creation of a national permanent register of electors was first proposed in the 1930s, but serious consideration for such a project was not established until the 1980s. In 1989, the Government of Canada appointed the Royal Commission on Electoral Reform and Party Financing, which in 1991 "recommended that provincial lists be used for federal purposes". A working group was established in 1995, which in March 1996 submitted the report The Register of Electors Project: A Report on Research and feasibility to the chief electoral officer of |
https://en.wikipedia.org/wiki/La%20casa%20de%20al%20lado | La casa de al lado (The House Next Door) is an American Spanish-language black comedy telenovela produced by the United States-based television network Telemundo. This mystery is a remake of the Chilean telenovela La familia de al lado produced by TVN in 2010-2011 and is being adapted by the author of the original, José Ignacio Valenzuela making a story longer with many differences from the original.
Filming began in April 2011 and was completed in December 2011. From May 31, 2011, to January 23, 2012, Telemundo aired the serial on weeknights at 9pm/8c during the 2011–2012 season The version broadcast by Telemundo at 10pm contained an above average level of violence. As with most of its other telenovelas, the network broadcasts English subtitles as closed captions on CC3. In Pakistan, the show was broadcast on Urdu 1 retitled Ek Dhund Si Chayi Hai. In
In Nigeria, the telenovela aired on Televista. In Sub-Saharan Africa, it was broadcast on eAfrica. In Namibia, it aired on NBC3 in July 2019. It was also broadcast on Telemundo Africa.
Plot
This tale is a black comedy with an absurd body-count. It is a circus where people go to the hospital and to jail. The Condes, a wealthy and influential family, appear to have it all: money, power, and a close, beautiful family. They were recently rocked by a tragedy when Adolfo (David Chocarro), husband of the eldest daughter Ignacia Conde (Catherine Siachoque) apparently died by falling out a window in the family mansion. The other 2 siblings of Ignacia are Carola Conde (Ximena Duque) and Emilio Conde (Gabriel Valenzuela). Meanwhile, apparently Adolfo's twin, Leonardo, continues to live in the mansion, confined to a wheel chair. When Gonzalo Ibañez (Gabriel Porras) marries Ignacia 6 months later, he is compelled to unravel the mystery of what happened to Adolfo. Mysterious events begin to envelop the Conde family suggesting that Adolfo is alive and well.
Next door live Pilar Arismendi (Maritza Rodríguez) and her husband, Javier Ruiz (Miguel Varoni), with their two children. Behind the gloss of success and family felicity lurks a dark reality and secrets that threaten to devastate both the Ruiz and Conde families. Javier is a highly regarded and influential attorney, who, for years, is employed by the Condes. Javier's privileged position becomes threatened by Gonzalo, who is appointed Javier's business associate by his powerful father-in-law, Renato Conde (Daniel Lugo). Javier will do anything to protect to what he believes he is entitled. Romantic intrigue develops between the neighbors and further confounds the mysteries, the tension, the dangers, and the suspense that loom large in the novela. Pilar has a sister called Rebeca Arismendi (Karla Monroig).
It is revealed that Ignacia, Carola, and Emilio are not biological siblings, as their parents could not have children, and so they were adopted. Emilio marries Hilda (Sofia Lama) but they divorce after she gives birth to a child with problems and she |
https://en.wikipedia.org/wiki/Proteus%20%28programming%20language%29 | Proteus (PROcessor for TExt Easy to USe) is a fully functional, procedural programming language created in 1998 by Simone Zanella. Proteus incorporates many functions derived from several other
languages: C, BASIC, Assembly, Clipper/dBase;
it is especially versatile in dealing with strings, having hundreds of dedicated functions; this makes it one of the richest languages for text manipulation.
Proteus owes its name to a Greek god of the sea (Proteus), who took care of Neptune's crowd and gave responses; he was renowned for being able to transform himself, assuming different shapes. Transforming data from one form to another is the main usage of this language.
Introduction
Proteus was initially created as a multiplatform (DOS, Windows, Unix) system utility, to manipulate text and binary files and to create CGI scripts. The language was later focused on Windows, by
adding hundreds of specialized functions for: network and serial communication, database interrogation, system service creation, console applications, keyboard emulation, ISAPI scripting (for IIS).
Most of these additional functions are only available in the Windows flavour of the interpreter, even though a Linux
version is still available.
Proteus was designed to be practical (easy to use, efficient, complete), readable and consistent.
Its strongest points are:
powerful string manipulation;
comprehensibility of Proteus scripts;
availability of advanced data structures: arrays, queues (single or double), stacks, bit maps, sets, AVL trees.
The language can be extended by adding user functions written in Proteus or DLLs created in C/C++.
Language features
At first sight, Proteus may appear similar to Basic because of its straight syntax, but similarities are limited
to the surface:
Proteus has a fully functional, procedural approach;
variables are untyped, do not need to be declared, can be local or public and can be passed by value or by reference;
all the typical control structures are available (if-then-else; for-next; while-loop; repeat-until; switch-case);
new functions can be defined and used as native functions.
Data types supported by Proteus are only three: integer numbers, floating point numbers and strings.
Access to advanced data structures (files, arrays, queues, stacks, AVL trees, sets and so on) takes place by
using handles, i.e. integer numbers returned by item creation functions.
Type declaration is unnecessary: variable type is determined by the function applied – Proteus converts on the fly
every variable when needed and holds previous data renderings, to avoid performance degradation caused by
repeated conversions.
There is no need to add parenthesis in expressions to determine the evaluation order, because the language is fully functional (there are no operators).
Proteus includes hundreds of functions for:
accessing file system;
sorting data;
manipulating dates and strings;
interacting with the user (console functions)
calculating logical and mathematica |
https://en.wikipedia.org/wiki/Auren%20Hoffman | Auren Raphael Hoffman (born 1974) is an American entrepreneur, angel investor, author and CEO of SafeGraph, a firm that gathers location data from mobile devices and sells information about places and the movements of people.
Personal life
Hoffman is a son of Amalia Hoffman of Larchmont, New York, and Edward M. Hoffman of Montvale, New Jersey. Amalia Hoffman is an author and illustrator of children’s books. Edward M. Hoffman works in New York as a software engineer and software consultant to the financial industry. Hoffman graduated from the University of California, Berkeley with a degree in Industrial Engineering in 1996.
In 2011, Hoffman married an assistant U.S. Attorney, Hallie Alexandra Mitchell, who graduated from Princeton University, and received a Juris Doctor degree from Northwestern University School of Law. Federal judge Barry G. Silverman of the United States Court of Appeals for the Ninth Circuit in Phoenix, Arizona officiated the wedding which was held in Nashotah, Wisconsin.
Business
Hoffman founded Kyber Systems in his junior year at UC Berkeley, as a way to pay for school. Kyber was sold to Human Ingenuity in 1997.
Hoffman founded Bridgepath Inc. in 1998, which was acquired by Bullhorn, Inc. in October 2002.
In 2002 he sold the website GetRelevant to Lycos. He then became chair of the Stonebrick Group through 2006, which sponsored networking events in the San Francisco area such as the Silicon Forum. Hoffman's business style is sometimes referred to as a networker.
Hoffman is a speaker at events in the technology industry.
In 2006 Hoffman cofounded Rapleaf and served as its CEO until 2012, when he left the company to run a Rapleaf spinoff called LiveRamp after Rapleaf was acquired by email marketing company TowerData. On May 14, 2014 Acxiom announced that it had acquired Liveramp, for $310 Million. Gawker mentioned a controversy surrounding privacy practices at Rapleaf. Hoffman left LiveRamp a little more than a year after it was acquired. , Hoffman is chairman of Siftery, and was listed as CEO of a company called SafeGraph.
Writer
Hoffman was a contributor to the Huffington Post, often on political subjects, as well as Business Week and his own blog called Summation.
Hoffman is a Republican and a political contributor. Hoffman contributed to Council on Foreign Relations papers in 2004.
Controversy
In 2006, Wikipedia editors detected that Hoffman may have been editing his own Wikipedia entry, violating its guidelines. Silicon Valley media publicized the evidence, which Hoffman eventually confirmed to VentureBeat in 2007. Anonymous Wikipedia editors later edited out these references.
Hoffman has also been criticized for his personal and professional networking practices and presentation of his own reputation.
Between 2007-2013, Hoffman received significant backlash over the data collection practices and sale of individuals' personal information to advertisers by his company, RapLeaf. As a prolific blogger and public |
https://en.wikipedia.org/wiki/Ronald%20V.%20Schmidt | Ronald V. Schmidt (March 31, 1944 – September 22, 2022) was an American computer network engineer.
Schmidt was born in San Francisco, California. He graduated with B.S. (in 1966), M.S. (1968), and Ph.D. (1970) degrees in electrical engineering and computer science from the University of California, Berkeley. From 1970 to 1971 he was a postdoctoral research assistant at University College, London. He then joined Bell Laboratories in 1971.
He was hired by Xerox PARC to develop a version of Ethernet for optical fiber in 1980 called Fibernet II.
Schmidt co-founded SynOptics Communications in 1985 with Andrew K. Ludwick.
After its merger in 1994, he served on the board of directors of the resulting company Bay Networks starting in May 1996.
Schmidt was executive vice president and chief technical officer (CTO) of Bay Networks from 1994 to 1997.
In 1998 he became a vice president of the Bell Labs research facility at Silicon Valley.
He left Bell Labs in February 2000. He served on the board of directors of Silicon Image from April 1997 until April 2004.
Schmidt cofounded the Flintridge & Portola Valley Railroad with Peter Mosley in 1991.
Schmidt died on September 22, 2022, at his home in Portola Valley, California
See also
LattisNet, the product invented in 1985
References
American chief technology officers
2022 deaths
1944 births
UC Berkeley College of Engineering alumni
Scientists at PARC (company)
Members of the United States National Academy of Engineering
Scientists at Bell Labs |
https://en.wikipedia.org/wiki/Hofmeyriidae | Hofmeyriidae is a family of therocephalian therapsids. It includes the genus Ictidostoma.
References
External links
Hofmeyriidae in the Paleobiology Database
Eutherocephalians
Permian first appearances
Permian extinctions
Prehistoric therapsid families |
https://en.wikipedia.org/wiki/Why%20Not%3F%20with%20Shania%20Twain | Why Not? with Shania Twain is an American docuseries series starring Canadian country music singer/songwriter Shania Twain. It premiered on the Oprah Winfrey Network on May 8, 2011. The series is a look at Twain's career, including her upbringing, as well as the musical hiatus she underwent during the first decade of the 21st century.
Z
Content
The show covers details in the life and career of Shania Twain, a Canadian country music singer. Elements in the show's arc include her divorce from longtime husband and producer Robert John "Mutt" Lange, as well as the vocal cord issues which temporarily ended her ability to sing.
Critical reception
David Knowles of The Hollywood Reporter gave the show a mixed review, stating that it was "a sometimes compelling, sometimes turgid program that feels equal parts emotional rescue and public relations coup."
Episodes
References
External links
2010s American reality television series
2011 American television series debuts
2011 American television series endings
Oprah Winfrey Network original programming
English-language television shows
Shania Twain |
https://en.wikipedia.org/wiki/Andrew%20K.%20Ludwick | Andrew K. Ludwick is a co-founder of SynOptics and was the CEO and President of SynOptics Communications and CEO and President of Bay Networks from 1985-1996.
Before founding SynOptics in 1985, Ludwick worked as an executive assistant at Xerox Corporation. Within Xerox, he teamed up with Xerox PARC researcher Ronald V. Schmidt to promote the idea of commercializing Schmidt's invention of a fiber optic version of the ethernet computer networking system. Although they were rebuffed in their goal of turning this system into a Xerox product, Xerox instead allowed Ludwick and Schmidt to spin it off into a separate company (with equity held by Xerox in exchange for their intellectual property). The company, initially named Astra Communications, eventually became SynOptics.
References
American technology chief executives
Living people
Year of birth missing (living people) |
https://en.wikipedia.org/wiki/GNM | Games 'n' Music
Gaussian network model
Gerakan Nelajan Marhaenis
Germanisches Nationalmuseum
GNM (API)
German New Medicine (Germanische Neue Medizin) a pseudo scientific, anthroposophy based medical sham
Global News Morning, A Canadian television news programme. |
https://en.wikipedia.org/wiki/Jan%20van%20Leeuwen | Jan van Leeuwen (born 17 December 1946 in Waddinxveen) is a Dutch computer scientist and Emeritus professor of computer science at the Department of Information and Computing Sciences at Utrecht University.
Education and career
Van Leeuwen completed his undergraduate studies in mathematics at Utrecht University in 1967 and received a PhD in mathematics in 1972 from the same institution under the supervision of Dirk van Dalen. After postdoctoral studies at the University of California, Berkeley and faculty positions at SUNY at Buffalo and the Pennsylvania State University, he returned to Utrecht as a faculty member in 1977. He was head of his department from 1977 to 1983, and again from 1991 to 1994, and dean from 1994 to 2009. Jan van Leeuwen was one of the founders of Informatics Europe.
Research
Jan van Leeuwen contributed to many fields of theoretical computer science, notably to algorithm design and computational complexity theory, and to the philosophy of computing. Among his doctoral students are algorithms researcher and Utrecht faculty member Hans Bodlaender and notable game software developer and former fellow Utrecht faculty member, Mark Overmars. Van Leeuwen is well known as a former series editor of the Lecture Notes in Computer Science.
Awards and honors
Van Leeuwen is a member of the Royal Dutch Society of Sciences and Humanities since 1992, and in 2006 he was elected to the Academia Europaea. In 2008 he received an honorary doctorate from the RWTH Aachen. In 2013 he received the ACM Distinguished Service Award, together with Gerhard Goos and Juris Hartmanis.
Books
Jan van Leeuwen was the editor of the 2-volume Handbook of Theoretical Computer Science. In 2013, he and S. Barry Cooper published Alan Turing: His Work and Impact (Elsevier, ), a special edition of the collected works of Alan Turing. This book won the R.R. Hawkins Award 2013.
Family
His son, Erik Jan van Leeuwen, is also an academic computer scientist. He was a senior researcher at the Max-Planck-Institut für Informatik, and currently is an assistant professor and research scientist in the Department of Information and Computing Sciences at Utrecht University.
References
External links
Home page
1946 births
Living people
Dutch computer scientists
Theoretical computer scientists
Researchers in geometric algorithms
Utrecht University alumni
University at Buffalo faculty
Pennsylvania State University faculty
Academic staff of Utrecht University
Members of Academia Europaea
Officers of the Order of Orange-Nassau
People from Waddinxveen |
https://en.wikipedia.org/wiki/DataScene | DataScene is a scientific graphing, animation, data analysis, and real-time data monitoring software package. It was developed with the Common Language Infrastructure technology and the GDI+ graphics library. With the two Common Language Runtime engines - the .Net and Mono frameworks - DataScene runs on all major operating systems.
With DataScene, the user can plot 39 types 2D & 3D graphs (e.g., Area graph, Bar graph, Boxplot graph, Pie graph, Line graph, Histogram graph, Surface graph, Polar graph, Water Fall graph, etc.), manipulate, print, and export graphs to various formats (e.g., Bitmap, WMF/EMF, JPEG, PNG, GIF, TIFF, PostScript, and PDF), analyze data with different mathematical methods (fitting curves, calculating statics, FFT, etc.), create chart animations for presentations (e.g. with PowerPoint), classes, and web pages, and monitor and chart real-time data.
History
DataScene was first released (version 1.0) in March 2009 for the Windows platform and the .Net 2.0 framework. Since version 2.0, DataScene has been ported to the Mono framework 2.6 and all Linux and Unix/X11 operating systems.
Cyberwit offers free licensing for the Express edition of DataScene.
References
External links
Video tutorials
Animation software
Computer animation
Data analysis software
Data visualization software
Earth sciences graphics software
Educational math software
Financial charts
Graphics software
Plotting software
Mathematical software
Regression and curve fitting software
Science software
Graphics-related software for Linux
Science software for Linux
Science software for Windows |
https://en.wikipedia.org/wiki/The%20Butch%20Cassidy%20Sound%20System | The Butch Cassidy Sound System is an alias used by the UK's Michael Hunter who has composed music for the Grand Theft Auto computer games San Andreas and IV. His rendition of the song "Cissy Strut" featured in series 4, episode 14 of the BBC TV show Waterloo Road, and has been featured on a compilation album compiled by Belle & Sebastian. The song "The Putney" was featured in Babylon Central, a film written and directed by Eric Hilton of Thievery Corporation. Echo Tone Defeat, the follow-up album to the debut Butches Brew, was released in 2012.
He also records under the pseudonym Pablo.
References
External links
British reggae musical groups |
https://en.wikipedia.org/wiki/The%20Little%20Engine%20That%20Could%20%282011%20film%29 | The Little Engine That Could is a 2011 American computer-animated adventure film based on the 1930 story by Watty Piper.
Plot
In Dream Land, Little Engine is a shunter who dreams of becoming a Dream Hauler and bringing dreams to the Real World. She tries to pull boxcars for Big Locomotive, but ends up causing traffic for the other engines, and the Tower reminds her she is only supposed to pull one boxcar at a time due to her small size. Little Engine later gets encouragement from Rusty, an old and wise engine.
In the Real World, a boy named Richard is antagonized by two bullies, Scott and Stretch, who steal his grandfather's pocket watch. Richard flees to the park, where he encounters a train and takes shelter in it. Rusty, who is pulling the train, is unaware he is inside and returns to Dream Land with him. Richard's presence in Dream Land causes the tunnel to it to collapse, trapping him and the trains in Dream Land. The Tower sends some engines to start digging out the tunnel and is forced to demote Rusty to a track-cleaner, much to Little Engine's dismay. She then offers to get Richard back to the Real World and the Tower agrees, promising to give Rusty his job back afterwards.
While searching for the old tracks over Dream Mountain to the Real World, Little Engine and Richard are chased by the Evening Express, who cannot slow down to avoid hitting them. It knocks them down to the hills, but they manage to get back onto the tracks. There, they find the birthday present train, which had derailed when the tunnel collapsed. Little Engine decides to take the train to the tunnel herself and attempts to get the other engines to take the train on the old tracks, but the engines don't believe the tracks exist, so Little Engine, Richard, and the toys decide to go themselves.
Upon finding the tracks, they start up the mountain, and encounter an old, rickety bridge that partly collapses as they are crossing it. Richard almost falls off, but is saved by Little Engine and Ace the Jet Plane, and they finish crossing by using an old cargo hook pole as a makeshift rail for the bridge. Later that evening, Little Engine runs out of water due to a leak in her water tank, causing her to roll downhill until Richard applies her emergency brake.
Just then, a black engine appears and offers to take Little Engine's friends to the Real World. She agrees, but he then reveals himself as the Nightmare Train, an evil locomotive who can create nightmares and plans to use Richard to send nightmares to the Real World. In the Nightmare Train, Richard is confronted by hallucinations of the bullies, but is encouraged to stand up to them. Ace escapes and goes to help Little Engine after refilling her tank using water from a nearby water tower. Meanwhile, Richard falls off the Nightmare Train, and reunites with Little Engine. They chase down the Nightmare Train, retrieve the others, and continue up the mountain. Little Engine struggles as they near the top, but perseveres and |
https://en.wikipedia.org/wiki/Cybersoft | Cybersoft Technologies, Inc. is a software company that makes software for School Nutrition or Food Service departments in K-12 school districts in the United States. The company has its headquarters along Cypress Creek Parkway in Harris County, Houston, Texas.
The company's customers include West Virginia Department of Education, Houston Independent School District, Buffalo Public Schools, Oklahoma City Public Schools and Fortune 1000 corporations. Cybersoft is a Microsoft Gold Certified Partner.
History
Cybersoft was founded by Charlie Yalamanchili, an entrepreneur who also founded CNC Investments, a highly successful commercial real estate investment company that was launched in 1982. CNC has grown from a humble beginning into the third largest property management firm in Houston, Texas. CNC has assets valued in excess of $1.5 billion, employs over 900 people, and spans over 6 states including New Mexico, Arizona, Texas, Florida, Georgia, and Oklahoma.
Cybersoft invented a system, PrimeroEdge, formerly Primero Food Service Solutions, that serves as a pre-paid school cafeteria meal system, so children in cafeterias do not have to have cash on their person as they pay for their meals.
References
External links
Cybersoft Website
PrimeroEdge Website
Software companies based in Texas
Companies based in Harris County, Texas
Software companies established in 1998
Software companies of the United States |
https://en.wikipedia.org/wiki/The%20Comedy%20Awards | The Comedy Awards was an annual award ceremony run by the American television network Comedy Central, honoring the best of comedy. It was held twice, in 2011 and 2012. The 2011 ceremony took place on March 26 and aired on April 10 on CMT, Comedy Central, Logo TV, Nick at Nite, Spike, TV Land and VH1. It debuted on The Comedy Channel in Australia on May 22, 2011.
The Comedy Awards represented Comedy Central's second attempt at creating an annual awards show, after the Commie Awards, which ran once in 2003. Comedy Central had also hosted the American Comedy Awards in 2001, which was those awards' last successive year after having been founded in 1989.
Categories
The award categories consist of:
Film
Comedy Film
Animated Comedy Film
Comedy Actor - Film
Comedy Actress - Film
Comedy Screenplay
Comedy Director - Film
Television
Comedy Series
Comedy Actor - Television
Comedy Actress - Television
Late Night Comedy Series
Sketch Comedy/Alternative Comedy Series
Stand-Up Special
Animated Comedy Series
Comedy Writing - Television
Comedy Directing - Television
Viewers Choice
Breakthrough Performer
Best Viral Original
Special Awards
Johnny Carson Award for Comedic Excellence
Comedy Icon Award
2011 Comedy Awards
Nominations were announced on February 15, 2011. The awards aired on April 10 on Comedy Central and other Viacom-owned networks including Spike, CMT, VH1, LOGO and TV Land. The Comedy Award statuette was created by New York firm Society Awards.
Film
Comedy Icon Award
The inaugural Comedy Icon Award was presented to Eddie Murphy by Tracy Morgan.
Television
Johnny Carson Comedy Award
The inaugural Johnny Carson Comedy Award was presented to David Letterman by Bill Murray.
2012 Comedy Awards
The nominees were announced on March 6, 2012.
Film
Television
Johnny Carson Comedy Award
The Johnny Carson Comedy Award was presented to Don Rickles by Robert De Niro and Jon Stewart.
Other awards
Comedy Icon Award
The Stand-Up Icon Award was presented to Robin Williams by Patton Oswalt.
Club Comic
Ted Alexandro
Hannibal Buress
Pete Holmes
Anthony Jeselnik
Moshe Kasher
John Mulaney
Kumail Nanjiani
Chelsea Peretti
Amy Schumer
Rory Scovel
Stand-Up Tour
Dave Attell
Lewis Black
Louis C.K.
Kevin Hart
Jerry Seinfeld
Viewer's Choice
Zooey Deschanel
Josh Gad
Donald Glover
Melissa McCarthy
Jason Sudeikis
Best Viral Original
"Songify This - Winning - A Song by Charlie Sheen"
References
External links
The Comedy Awards - Official Website
Comedy Central
American comedy and humor awards
Awards established in 2011
2010s in comedy |
https://en.wikipedia.org/wiki/Keyspace%20%28distributed%20data%20store%29 | A keyspace (or key space) in a NoSQL data store is an object that holds together all column families of a design. It is the outermost grouping of the data in the data store. It resembles the schema concept in Relational database management systems. Generally, there is one keyspace per application.
Structure
A keyspace may contain column families or super columns. Each super column contains one or more column families, and each column family contains at least one column. The keyspace is the highest abstraction in a distributed data store. This is fundamental in preserving the structural heuristics in dynamic data retrieval. Multiple relay protocol algorithms are integrated within the simple framework.
Comparison with relational database systems
The keyspace has similar importance like a schema has in a database. In contrast to the schema, however, it does not stipulate any concrete structure, like it is known in the entity-relationship model used widely in the relational data models. For instance, the contents of the keyspace can be column families, each having different number of columns, or even different columns. So, the column families that somehow relate to the row concept in relational databases do not stipulate any fixed structure. The only point that is the same with a schema is that it also contains a number of "objects", which are tables in RDBMS systems and here column families or super columns.
So, in distributed data stores, the whole burden to handle rows that may even change from data-store update to update lies on the shoulders of the programmers.
Examples
As an example, we show a number of column families in a keyspace. The CompareWith keyword defines how the column comparison is made. In the example, the UTF-8 standard has been selected. Other ways of comparison exist, such as AsciiType, BytesType, LongType, TimeUUIDType.
<Keyspace Name="DeliciousClone">
<KeysCachedFraction>0.01</KeysCachedFraction>
<ColumnFamily CompareWith="UTF8Type" Name="Users"/>
<ColumnFamily CompareWith="UTF8Type" Name="Bookmarks"/>
<ColumnFamily CompareWith="UTF8Type" Name="Tags"/>
<ColumnFamily CompareWith="UTF8Type" Name="UserTags"/>
<ColumnFamily CompareWith="UTF8Type" CompareSubcolumnsWith="TimeUUIDType" ColumnType="Super" Name="UserBookmarks"/>
</Keyspace>
Another example shows a simplified Twitter clone data model:
<Keyspace Name="TwitterClone">
<KeysCachedFraction>0.01</KeysCachedFraction>
<ColumnFamily CompareWith="UTF8Type" Name="Users" />
<ColumnFamily CompareWith="UTF8Type" Name="UserAudits" />
<ColumnFamily CompareWith="UTF8Type" CompareSubcolumnsWith="TimeUUIDType" ColumnType="Super" Name="UserRelationships" />
<ColumnFamily CompareWith="UTF8Type" Name="Usernames" />
<ColumnFamily CompareWith="UTF8Type" Name="Statuses" />
<ColumnFamily CompareWith="UTF8Type" Name="StatusAudits" />
<ColumnFamily CompareWith="UTF8Type" CompareSubcolumnsWith="TimeUUIDType" ColumnType="Super" Name="StatusRelationships" />
</Keysp |
https://en.wikipedia.org/wiki/Logie%20Awards%20of%202011 | The 53rd Annual TV Week Logie Awards was held on Sunday 1 May 2011 at the Crown Palladium in Melbourne, and broadcast on the Nine Network. The ceremony was hosted by Shane Bourne, while the red carpet arrivals was hosted by Shelley Craft, Livinia Nixon, James Mathison and Jules Lund. Musical performers at the event were Katy Perry, Maroon 5 and Jessie J. It was the last Logies ceremony to date to have a host.
Winners and nominees
In the tables below, winners are listed first and highlighted in bold.
Gold Logie
Acting/Presenting
Most Popular Programs
Most Outstanding Programs
Performers
Katy Perry – "Firework"
Maroon 5 – "Never Gonna Leave This Bed"
Jessie J – "Price Tag"
Presenters
Catherine McClements
Karl Stefanovic
Peter Stefanovic
Sarah Murdoch
Jamie Durie
Shaun Micallef
Richard Roxburgh
Lisa McCune
Stephen Curry
Deborah Mailman
Shane Jacobson
David Stratton
Margaret Pomeranz
Hamish Blake
Andy Lee
Chris Lilley
Adam Hills
Roy Slaven
H.G. Nelson
André Rieu
In Memoriam
The In Memoriam segment was introduced by host Shane Bourne who spoke of the passing of cinematographer John Bowring ACS. Eddie Perfect and the comedy trio Tripod performed Paul Kelly's "Meet Me in the Middle of the Air" a cappella. The following deceased were honoured:
Geoff Raymond, news presenter
Sonia Humphrey, journalist
Michael Meagher, journalist
Victoria Longley, actress
Veronica Overton-Low, entertainer
Bert Shaw, choreographer
James Dibble, news presenter
Eric Walters, news presenter
Edward Bryans, news presenter
Dame Pat Evison, actress
Julie Ryles, entertainer
Michael Schildberger, journalist
Adriana Xenides, hostess
Esben Storm, producer
Gus Mercurio, actor
Malcolm Douglas, adventurer
Murray Nicoll, journalist
Paulene Terry-Beitz, actress
Blair Milan, actor
James Elliott, actor
Ted Dunn, creator Fredd Bear
Rex Heading OAM, producer
Norman Hetherington OAM, puppeteer
Dame Joan Sutherland OM, opera singer
References
External links
2011
2011 television awards
2011 in Australian television
2011 awards in Australia |
https://en.wikipedia.org/wiki/HMS%20Networks | HMS Networks AB is an international company in the field of Industrial Information and Communication Technology (Industrial ICT). HMS is headquartered in Halmstad, Sweden and is listed on the Nasdaq Nordic stock exchange, employing 700 people in 16 countries and with reported sales of 145 million Euro in 2020. HMS stands for "Hardware Meets Software" referring to the fact that HMS products allow industrial hardware to be connected to IoT software.
Products
HMS manufactures and markets industrial communication products that connect industrial devices to different industrial networks and IoT systems. HMS products act as translators between robots, control systems, motors, sensors, etc. and the different industrial networks that exists in the market (fieldbuses and Industrial Ethernet). HMS also offers a portfolio of wireless products as well as remote solutions for web-based control of field equipment such as PLCs, electric generators, machines, telecommunication base stations, building management systems and the likes.
HMS markets products under the following brands:
Anybus. Multi-network connectivity within fieldbus and industrial Ethernet. With Anybus, one can connect any industrial device to any industrial network. Wired or wireless.
Ixxat. Connectivity solutions for embedded control, energy and automotive testing. Ixxat products enable communication inside machines and between components in various industrial fields.
Ewon. Remote access and management of industrial equipment. With Ewon, one can monitor and control field equipment and machinery online.
Intesis. communication solutions for building automation.
Organization and history
HMS has operations in 16 countries: Sweden (Halmstad), Germany (Karlsruhe, Ravensburg, Wetzlar, Buchen), Belgium (Nivelles), Spain (Igualada, Barcelona), United States (Chicago, Boston), China (Beijing), Japan (Yokohama), The Netherlands (Hedel, Rotterdam), Italy (Milan, Brescia), France (Mulhouse), Romania (Sibiu), UK (Coventry, Manchester), Singapore, UAE (Dubai), South Korea (Seoul), India (Pune). In addition, distributors in 50 countries resell the HMS products on local markets.
HMS was founded in 1988 by Nicolas Hassbjer and has been deemed "Export Company of the Year" by the Swedish Trade Council.
Product development of Anybus products is handled by Business Unit Anybus in Halmstad, Sweden.
Product development of Ixxat products is handled by Business Unit Ixxat in Ravensburg, Germany.
Product development of Ewon products handled by Business Unit Ewon in Nivelles, Belgium.
Product development of Intesis products handled by Business Unit Intesis in Igualada, Spain.
Four Market Units handle local sales and support: MU Americas, MU Asia, MU Continental Europe and MU Northern Europe ROW.
Manufacturing takes place in Sweden, Latvia and China.
References
Companies established in 1988
Software companies of Sweden
Swedish brands
Companies based in Halland County
Companies listed on Nasdaq Stockholm |
https://en.wikipedia.org/wiki/IODD | The IODD (IO Device Description) describes sensors and actuators with an IO-Link communication interface. It contains information about the device’s identity, parameters, process data, diagnosis data, communication properties and the design of the user interface of engineering tools. The IODD comprises different data files: the main file and several optional language files are in XML-format and optional graphical files are in PNG-format (portable network graphics).
Structure
The IODD structure conforms to the specifications of the standard ISO 15745 “Industrial automation systems and integration – Open systems application integration framework”. The IODD unifies the device profile and the communication network profile in one data file.
According to the structure defined in ISO 15745, the IODD provides the objects DeviceIdentity and DeviceFunction for the device description. The DeviceIdentity object contains text with information for the user and identification numbers (IDs) to automatically identify sensors and actuators in the plant.
The IODD enables the vendor to describe variants of products, which are equal in their parameters, process and diagnosis data and communication but vary in their order number. In this way it is ensured that the high diversity of the mechanical characteristics, which characterize the sensors and actuators, will not result in an unnecessary high number of device descriptions and a high consumption of identification numbers. The DeviceFunction object is the recipient of any other information if these information do not belong to the communication profile. It contains the description of the device’s parameters, process data, diagnosis data and configuration of the user interface.
The embedded communication network profile can be easily replaced and hence the IODD can be easily used to describe sensors and actuators with different communication interfaces.
Language support
The textual data can be specified in multiple languages. In the actual device description only text identifiers are used. Separate text lists (for each supported language one is necessary) link the corresponding language-dependent text to the text identifier. Usually all of the text lists are included in the main file. For subsequent translation into other languages the text lists can be provided as separate files to leave the main file unchanged.
Standard definition
All parameters and diagnosis data, pre-defined by the IO-Link standard, are described in the file"IODD-StandardDefinitions[version].xml" with the same syntax used in the IODD. These default parameters and diagnosis data are not described but referenced in the IODD.
The IODD specification, the IODD guideline with examples and the IODD Checker are provided by the IO-Link Consortium. At present, the IODD version V1.0.1 is available, which describes devices based on the IO-Link specification V1.0 as well as devices based on the IO-Link specification V1.1 in V1.0 compatibility mode. In |
https://en.wikipedia.org/wiki/List%20of%20power%20stations%20in%20Indonesia | The following lists some of the larger power stations in Indonesia. Data are not included for a large number of small isolated plants (mostly diesel) in the Outer Islands. In total, the PLN operated over 5,000 plants across Indonesia in 2010 of which over 4,500 were small diesel plants outside of Java. For further details about existing capacity and operations of the electricity sector, see information about the state-owned Indonesian electricity company Perusahaan Listrik Negara.
Non-renewable
Thermal
Thermal power is the largest source of power in Indonesia. There are different types of thermal power plants based on the fuel used to generate the steam such as coal, gas, diesel etc. About 85% of electricity consumed in Indonesia is generated by thermal power plants.
Bituminous coal or lignite
Existing
Note: IPP means independent power producer
Proposed or under construction
Gas or liquid fuel
Renewable
Geothermal
Note: IPP means independent power producer
Hydroelectric
Note: IPP means independent power producer
Pumped-storage hydroelectric
Currently under construction or planned:
Wind
Solar
See also
Energy in Indonesia
List of largest power stations in the world
References
Large Scale Hydropower Plants in Indonesia by Indonesia Hydro Consult (http://www.arcgis.com/apps/OnePane/basicviewer/index.html?appid=65ed8bc862bd4af09c375d49f9d389d4)
Small Scale Hydropower Plants in Indonesia by Indonesia Hydro Consult (http://www.arcgis.com/apps/OnePane/basicviewer/index.html?appid=2dffb753a63142b0bf7075389414daae)
Indonesia
Power stations
Electric power in Indonesia |
https://en.wikipedia.org/wiki/MTV%20Music%20%28Italian%20TV%20channel%29 | MTV Music is an Italian pay television music channel operated by Paramount Networks EMEAA.
As the main MTV brand has deviated from its original purpose and increased competition from other music channels and online services, MTV launched a new music channel, MTV Music.
The first version of the channel had launched in the United Kingdom and Ireland on 1 February 2011 replacing MTV Shows. The Italian version of the new channel then channel launched on 1 March 2011, replacing MTV Plus.
It is expected that MTV may launch MTV Music channels in other regions under a new global strategy to simplify the branding used across territories.
The main MTV station had been sold to Sky Italia on August 1, 2015 in Italy (DTT only). It had no effect on MTV Music, as this TV station was not sold and continues to be a Paramount property.
Shows
Current programmes
100% Italian Songs - Italian music videos
100% Music - Italian and worldwide greatest music videos
Euro Top 20 - the most played European songs show
Hitlist Italia - official Italian chart
MTV New Generation - music videos for teens
MTV World Stage - live music show
New Zone - alternative and new music videos
Top 10 Dance - the most played dance songs show
Top 10 Hip Hop R&B - the most played hip hop and R&B songs show
Top 10 Hits - the most played pop songs show
Top 10 Italians - the most played Italian songs show
Top 10 Rock - the most played rock songs show
VH1 Simply the Best - music video show (only VH1
Past programmes
100% Top Songs - charts
10 of the Best - an hour-themed music show
3x1 - videography of an artist
America's Best Dance Crew - musical reality show
Behind the Music - backstage show
Classic 2Night - music video show
Fame - the American television cult series
MTVMUSIC.COM Chart - music chart supplied by mtvmusic.com
Pop 2Night - music video show
Rock 2Night - music video show
Storytellers - live music show
Sexy Videos - music videos for sex
Taking the Stage - musical reality show
The Official Top 20 - music chart show
Top Hits - music chart show
TRL The Battle - music chart show
Urban 2Night - music video show
Your MTV Chart - music video show
See also
MTV Europe
Viacom International Media Networks (Europe)
References
External links
MTV.it
MTV channels
Television channels in Italy
Television channels and stations established in 2011
Music organisations based in Italy |
https://en.wikipedia.org/wiki/Institute%20for%20Computer%20Sciences%2C%20Social%20Informatics%20and%20Telecommunications%20Engineering | The Institute for Computer Sciences, Social Informatics and Telecommunications Engineering (ICST) is a non-profit professional association dedicated to advancing technological innovation related to information and communication technologies. ICST has more than 30,000 members in Europe and worldwide.
ICST organizes over 50 annual scientific events worldwide – summits, conferences, workshops and symposia, and offers a publication portfolio of journals, books, proceedings and magazines together with advanced online tools – social networking portals, multimedia sharing and collaboration;
ICST is a member of the European Alliance for Innovation (EAI).
External links
ICST About page
List of events
Computer science-related professional associations
Non-profit organisations based in Belgium |
https://en.wikipedia.org/wiki/Energy%20and%20facility%20management%20software | Energy and facility management software is a term used to refer to an enterprise-wide platform for handling technical data related to buildings and stems from the merger of EMS (energy management software), CAFM (Computer Aided Facility Management) and EAS (Energy Accounting Software). As such it involves the gathering and processing or information that is required for maintaining acceptable indoor comfort level while minimizing energy use.
Purpose
An EFMS serves a dual purpose:
Tactical: On a day-to-day operational level an EFMS will help improve comfort level where required while minimizing energy consumption. Should comfort level not be an issue, the EFMS will focus processes and resources on reducing energy spending.
Strategic: On a mid-to-long term scope an EFMS will support the development strategy of the organization with information that will support managerial decisions such as systems, vendors or processes efficiencies, ratings and critical areas etc.
Method
Information Classes
To achieve its purpose an EFMS integrates several informational classes in a common processing environment, mainly:
Energy consumption information information commonly handled by an EMS and derived from online metering devices (such as Electric Energy meters and Gas meters).
System information such as HVAC systems settings, sensor readings etc. commonly resident in a BMS.
Assets Information, such as building size, floor number and area, cooling capacity of installed HVAC systems, maintenance logs etc. commonly found in a CAFM system.
Weather information commonly derived from internet weather feeds or locally installed sensors.
Occupancy / Use information such as room occupancy of a hotel or customers served at a retail store commonly found in an ERP.
Utility bills information commonly resident in an EAS (Energy Accounting Software).
Components
An EFMS should be consisted of at least the following modules:
Visualization / Dashboard Module which will present graphical or table illustrations of energy information (from EMS), system information (from BMS) and Billing information (from EAS).
Alarming Module which will create and manage alarms based on given threshold values and / or Faults Detection & Diagnosis detection methods.
Work Order Module which will create and manage notifications of alarms directed towards appropriate users. The Work Order Module will manage actions of users related to each fault along the Fault Cycle (birth, detection, diagnosis, action, evaluation).
Data Sources Module which will manage the connection to and synchronization with the various data sources such as energy management systems and metering devices, BMS, EAS, ERP etc.
Reporting Module which will manage the creation and distribution of energy and facility reports.
Processes
The processes performed in an EFMS fall under the categories of:
Entry Processes which may be tactical such as the automated synchronization with a BMS or ERP or ad hoc such as the manual entry of uti |
https://en.wikipedia.org/wiki/The%20Benthin%20Family | Familie Benthin is an East German film. It was released in 1950.
Plot
Theo and Gustav Benthin are two brothers who operate a smuggling network: Theo, a factory director in East Germany, illegally transfers goods to his brother on the other side of the border, and the latter sells them in West Germany. The two also employ another pair of brothers, Peter and Klaus Naumann. Theo is caught by the People's Police; Gustav cannot compete in the wild capitalist market without the cheap merchandise from the East and his business collapses. Peter Naumann moves to the Federal Republic, but there he finds only unemployment and is eventually to join the French Foreign Legion. Klaus remains in the East and finds a promising job as a steel worker.
Cast
Maly Delschaft - Annemarie Naumann
Charlotte Ander - Olga Benthin
Hans-Georg Rudolph - Theo Benthin
Werner Pledath - Gustav Benthin
Brigitte Conrad - Ursel Benthin
Harry Hindemith - Seidel
Karl-Heinz Deickert - Klaus Neumann
Ottokar Runze - Peter Naumann
Production
The Benthin Family was DEFA's first major "mission film", with a clear, state-directed political message, although pictures that presented narratives hostile to West Germany and to the West in general were already made, albeit with smaller budgets and less government attention.
Three directors - Slatan Dudow, Richard Groschopp and Kurt Maetzig - were instructed by Socialist Unity Party of Germany to work on the film. Later, none of them was willing to accept responsibility for the outcome.
Reception
East German cinema expert Joshua Feinstein wrote that The Benthin Family "...seems to have been an unmitigated disaster." The SED newspaper Neues Deutschland praised the film, noting that "its greatness lies in its realization of the greatness of our life today..." while contrasting them with "the other side... where the West German youth... are processed for service as mercenaries for the imperialists." At 1952, the censure demanded that a scene in which a drunk worker appeared be removed before the film was allowed to be re-screened, since it did not comply with "depicting independent, intelligent members of the proletariat".
The German Film Lexicon defined The Benthin Family as a "SED-commissioned agitation thriller with simplistic good-versus-evil plot... but interesting as a Cold War relic."
References
External links
Familie Benthin on DEFA Sternstunden.
1950 films
East German films
1950s German-language films
Films directed by Kurt Maetzig
Films directed by Richard Groschopp
Films directed by Slatan Dudow
German crime drama films
1950 crime drama films
German black-and-white films
1950s German films |
https://en.wikipedia.org/wiki/PSORTdb | PSORTdb is a database of protein subcellular localization (SCL) for bacteria and archaea. It is a member of the PSORT family of bioinformatics tools. The database consists of two datasets, ePSORTdb and cPSORTdb, which contain information determined through experimental validation and computational prediction, respectively. The ePSORTdb dataset is the largest curated collection of experimentally verified SCL data.
PSORTdb was initially developed in 2005 in order to contain protein subcellular localization predictions for bacteria. The computational predictions in the cPSORTdb dataset were generated by the PSORT tool PSORTb 2.0, the most accurate SCL predictor of the time.
The second and current version of PSORTdb was released in 2010. Entries in the database are automatically generated as newly sequenced prokaryotic genomes become available through NCBI. As of the second release, ePSORTdb contained over 12,000 entries for bacterial proteins and 800 entries for archaeal proteins; cPSORTdb contained SCL predictions for over 3,700,000 proteins in total. The ePSORTdb data is derived from a manual literature search (using PubMed) as well as Swiss-Prot annotations. The cPSORTdb predictions are generated using the updated PSORTb 3.0 tool.
PSORTdb can be accessed through a web interface or via BLAST. The entire database is also available for download under the GNU General Public License. Each term in the database is associated with an identifier from the Gene Ontology in order to allow integration with other bioinformatics resources.
As of 2014, PSORTdb is maintained through the laboratory of Fiona Brinkman at Simon Fraser University.
See also
Protein targeting
References
External links
http://db.psort.org/
Biological databases
Protein targeting
Post-translational modification |
https://en.wikipedia.org/wiki/Research%20Institute%20of%20Fragrance%20Materials | The Research Institute for Fragrance Materials, Inc. (RIFM) is the international scientific authority for the safe use of fragrance materials. RIFM generates, evaluates and distributes scientific data on the safety assessment of fragrance raw materials found in personal and household care products. Through extensive research, testing and constant monitoring of all scientific literature available, RIFM maintains its database as the most comprehensive source worldwide of physical-chemical, toxicological and eco-toxicological data associated with known fragrance and flavor materials. All of RIFM’s scientific findings are evaluated by an independent Expert Panel—an international group of dermatologists, pathologists, toxicologists, reproduction, respiratory and environmental scientists. The Expert Panel evaluates the safety of fragrance ingredients under conditions of intended use and publishes their results in peer-reviewed scientific journals. The decisions of the Expert Panel regarding restrictions of use are also published in the International Fragrance Association (IFRA) Standards.
External links
Perfumes
Cosmetic trade associations
Toxicology organizations
Research institutes |
https://en.wikipedia.org/wiki/JAUS%20Tool%20Set | The JAUS Tool Set (JTS) is a software engineering tool for the design of software services used in a distributed computing environment. JTS provides a Graphical User Interface (GUI) and supporting tools for the rapid design, documentation, and implementation of service interfaces that adhere to the Society of Automotive Engineers' standard AS5684A, the JAUS Service Interface Design Language (JSIDL). JTS is designed to support the modeling, analysis, implementation, and testing of the protocol for an entire distributed system.
Overview
The JAUS Tool Set (JTS) is a set of open source software specification and development tools accompanied by an open source software framework to develop Joint Architecture for Unmanned Systems (JAUS) designs and compliant interface implementations for simulations and control of robotic components per SAE-AS4 standards. JTS consists of the components:
GUI based Service Editor: The Service Editor (referred to as the GUI in this document) provides a user friendly interface with which a system designer can specify and analyze formal specifications of Components and Services defined using the JAUS Service Interface Definition Language (JSIDL).
Validator: A syntactic and semantic validator provides on-the-fly validation of specifications entered (or imported) by the user with respect to JSIDL syntax and semantics is integrated into the GUI.
Specification Repository: A repository (or database) that is integrated into the GUI that allows for the storage of and encourages the reuse of existing formal specifications.
C++ Code Generator: The Code Generator automatically generates C++ code that has a 1:1 mapping to the formal specifications. The generated code includes all aspects of the service, including the implementations of marshallers and unmarshallers for messages, and implementations of finite-state machines for protocol behavior that are effectively decoupled from application behavior.
Document Generator: The Document Generator automatically generates documentation for sets of Service Definitions. Documents may be generated in several formats.
Software Framework: The software framework implements the transport layer specification AS5669A, and provides the interfaces necessary to integrate the auto-generated C++ code with the transport layer implementation. Present transport options include UDP and TCP in wired or wireless networks, as well as serial connections. The transport layer itself is modular, and allows end-users to add additional support as needed.
Wireshark Plugin: The Wireshark plugin implements a plugin to the popular network protocol analyzer called Wireshark. This plugin allows for the live capture and offline analysis of JAUS message-based communication at runtime. A built-in repository facilitates easy reuse of service interfaces and implementations traffic across the wire.
The JAUS Tool Set can be downloaded from www.jaustoolset.org User documentation and community forum are also availabl |
https://en.wikipedia.org/wiki/Gulli.com | gulli.com was a German-language internet portal and board, founded in 1998 by Randolf Jorberg. Its themes were the Internet, IT security, cyberculture, file Sharing, internet privacy, information privacy and intellectual property.
The site was excluded from the Wayback Machine.
History
In the beginning the project was only available under steadily changing internet addresses due to problems with illegal contents, but grew into one of the largest German languaged online communities.
In February 2008 gulli.com was acquired by the Inqnet GmbH in Vienna and the parting team, Richard "Korrupt" Joos, Randolf "gulli" Jorberg and Axel "LexaT" Gönnemann published a book named gulli wars in August 2008, talking about the cyber war tales experienced. In July 2013 gulli.com was sold to Gamigo AG.
The board had more than 1 million registered users. It cooperated with companies and hackers concerning net security, such as PayPal in 2011.
Since 2018, the board is unavailable, with a placeholder website promising its return.
Literature
Richard Joos, Randolf Jorberg, Axel Gönnemann: gulli wars™. Books on Demand GmbH, 2008, .
Daniel Hofmann: Heimliche Riesen im Netz - Vergemeinschaftung um Sharehoster am Beispiel einer Online-Tauschbörse. GRIN, 2008,
External links
gulli.com - official Website
taz: „Hacker haben zocken gelernt“ – Bericht zur Kommerzialisierung und Kritik an Geschäftspraktiken von gulli.com (2002)
gulli über Cyberwar beim ZDF
References
Internet in Germany |
https://en.wikipedia.org/wiki/SmartCAM | SmartCAM is a suite of Computer-Aided Manufacturing (CAM) and CAD/CAM software applications that uses toolpath modeling to assist CNC machinists in creating computer-numerically controlled (CNC) programs that direct CNC machine tools.
The SmartCAM family of applications include systems in support of CNC milling, turning, mill/turning, Wire EDM and fabrication.
One of the pioneers of "stand-alone" CAM systems available for the personal computer, SmartCAM was initially developed in 1984 by Point Control Company in Eugene, Oregon, and after a series of corporate acquisitions from 1994 to 2001, in 2003 ownership and development has been conducted by SmartCAMcnc in Springfield, Oregon.
References
External links
SmartCAM/SmartCAMcnc website
Companies based in Oregon
Computer-aided manufacturing software
Technology companies of the United States |
https://en.wikipedia.org/wiki/Electronic%20Healthcare%20Network%20Accreditation%20Commission | The Electronic Healthcare Network Accreditation Commission (EHNAC) is a voluntary, self-governing standards development organization (SDO) in the United States established to develop standard criteria and accredit organizations that electronically exchange healthcare data. These entities include electronic health networks, payers, financial services firms, health information exchanges (HIEs), management service organizations and e-prescribing solution providers.
Overview
EHNAC cites its mission is to promote standards-based accreditation within the healthcare data exchange industry.
EHNAC was founded in 1993 and is a federally-recognized and tax-exempt, 501(c)(6) non-profit accrediting body with the end purpose of improving transactional quality, operational efficiency and data security in healthcare.
As an independent, self-governing SDO, EHNAC represents a diverse mix of healthcare stakeholders across the industry spectrum. Electronic health networks, payers, hospitals, physicians, consumer groups, financial services firms, security organizations and vendors are all working together to establish criteria for self-regulation.
By working with other industry stakeholders, EHNAC looks to provide accreditation services that promote standards, administrative simplification and open competition in the marketplace. Once full accreditation is achieved by an organization, the accreditation is granted for a period of two years, after which they may re-apply for continued accreditation.
EHNAC accredits organizations under the following accreditation programs:
ePAP – e-Prescribing Accreditation Program
DTAAP - Direct Trusted Agent Accreditation Program
FSAP EHN – Financial Services Accreditation Program for Electronic Health Networks
FSAP Lockbox – Financial Services Accreditation Program for Lockbox Services
HIEAP – Healthcare Information Exchange Accreditation Program
HNAP-70 – Healthcare Network Accreditation Plus Select SAS 70© Criteria Program
HNAP EHN – Healthcare Network Accreditation Program for Electronic Health Networks
HNAP Medical Biller – Healthcare Network Accreditation Program for Medical Billers
HNAP TPA – Healthcare Network Accreditation Program for TPAs
MSOAP – Management Service Organization Accreditation Program
OSAP – Outsourced Services Accreditation Program
Current criteria for all programs are available for public review on the organization’s website.
History
EHNAC grew out of the 1993 Workgroup for Electronic Data Interchange (WEDI) meeting, sponsored by the Network Architecture and Accreditation Technical Advisory Group. The healthcare transactions industry agreed there was a need for a self-governing body to develop standards for the industry, and the Association for Electronic Health Care Transactions (AFEHCT) championed the cause by sponsoring an Accreditation Workgroup.
More than thirty representatives from all facets of the healthcare transactions industry participated in a series of meetings and surveys |
https://en.wikipedia.org/wiki/GPN | GPN may refer to:
Garden Point Airport, on Melville Island, Australia
Global Pastors Network
Global production network
Green Party of the Netherlands
Taiap language
Gulaschprogrammiernacht, an annual 4-day congress of the Computer Chaos Club Karlsruhe |
https://en.wikipedia.org/wiki/Modular%20data%20center | A modular data center system is a portable method of deploying data center capacity. A modular data center can be placed anywhere data capacity is needed.
Modular data center systems consist of purpose-engineered modules and components to offer scalable data center capacity with multiple power and cooling options. Modules can be shipped to be added, integrated or retrofitted into an existing data center or combined into a system of modules. Modular data centers typically consist of standardized components.
Modular data centers are often marketed as converged infrastructure, promoting economies of scale and efficient energy usage, including considerations regarding the external environment. A module can be treated as a single unit for U.S. Federal Communications Commission compliance certification rather than all discrete systems.
Patents have been taken out on variations.
Types
Modular data centers typically come in two types of form factors. The more common type, referred to as containerized data centers or portable modular data centers, fits data center equipment (servers, storage and networking equipment) into a standard shipping container, which is then transported to a desired location. Containerized data centers typically come outfitted with their own cooling systems. Cisco makes an example of this type of data center, called the Cisco Containerized Data Center.
Another form of modular data center fits data center equipment into a facility composed of prefabricated components that can be quickly built on a site and added to as capacity is needed. For example, HP's version of this type of modular data center is constructed of sheet metal components that are formed into four data center halls linked by a central operating building. In 2012, Compass Datacenters, LLC filed and was later granted a patent for a "Truly modular building datacenter facility."
Examples
NDC Solutions
PCX Corporation
Dell EMC Modular Data Center
Google Modular Data Center
HP Performance Optimized Datacenter
IBM Portable Modular Data Center
Microsoft Azure Modular Datacenter
Sun Modular Datacenter
Internet Initiative Japan (IIJ) co-IZmo/I
References
External links
Modular Data Center
Data centers |
https://en.wikipedia.org/wiki/Parks%20and%20Recreation%20%28season%204%29 | The fourth season of Parks and Recreation originally aired in the United States on the NBC television network, and began on September 22, 2011, and ended on May 8, 2012. The season contained 22 episodes. It stars Amy Poehler, Rashida Jones, Aziz Ansari, Nick Offerman, Aubrey Plaza, Chris Pratt, Adam Scott, and Rob Lowe, with supporting performances from Jim O'Heir and Retta.
As with past seasons, it focuses on Leslie Knope (Amy Poehler) and her staff at the parks and recreation department of the fictional Indiana town of Pawnee. However, this season features an overarching story arc, beginning in the first episode and culminating in the finale, where Leslie runs for the city council of Pawnee.
Cast
Main
Amy Poehler as Leslie Knope, a mid-level bureaucrat with a strong love of her home town of Pawnee, who has not let politics dampen her sense of optimism; her ultimate goal is to become President of the United States. Poehler departed from the NBC sketch comedy series Saturday Night Live, where she was a cast member for nearly seven years, to star in Parks and Recreation. It was only after she was cast that Daniels and Schur established the general concept of the show and the script for the pilot was written.
Rashida Jones as Ann Perkins, a nurse and political outsider who gradually becomes more involved in Pawnee government through her friendship with Leslie. Jones was among the first to be cast by Daniels and Schur in 2008, when the series was still being considered as a spin-off to The Office, where Jones had played Jim Halpert's girlfriend Karen Filippelli, who formerly worked at the Stamford Branch but was soon transferred to the Scranton Branch in the 3rd season.
Aziz Ansari as Tom Haverford, Leslie's sarcastic and underachieving subordinate, who eventually begins to consider leaving his city hall job to pursue his own entrepreneurial interests. As with Jones, Daniels and Schur had intended to cast Ansari from the earliest stages of the development of Parks and Recreation.
Nick Offerman as Ron Swanson, the parks and recreation director who, as a libertarian, believes in as small a government as possible. As such, Ron strives to make his department as ineffective as possible, and favors hiring employees who do not care about their jobs or are poor at them. Nevertheless, Ron consistently demonstrates that he secretly cares deeply about his fellow co-workers.
Aubrey Plaza as April Ludgate, a cynical and uninterested parks department intern who eventually becomes the perfect assistant for Ron. The role was written specifically for Plaza; after meeting her, casting director Allison Jones told Schur, "I just met the weirdest girl I've ever met in my life. You have to meet her and put her on your show."
Chris Pratt as Andy Dwyer, a goofy and dim-witted but lovable slacker. Pratt was originally intended to be a guest star and the character Andy was initially meant to appear only in the first season, but the producers liked Pratt so much that |
https://en.wikipedia.org/wiki/Line%2010%20%28CPTM%29 | Line 10 (Turquoise) (), formerly Line D (Beige), is one of the seven lines operated by CPTM and one of the thirteen lines that make up the São Paulo Metro Rail Transport Network, in Brazil.
Stations
Trains
As of August 2023, most trains running at this line are part of the 8500 and 9500 Series, created by CAF and Hyundai Rotem, respectively, given the unification of the line with Line 7 - Ruby, by the 710 Service, inaugurated in 2021.
Initially, most trains running at this line were part of the 2100 Series (Originally called CAF 440). Imported from Spain, this model was projected to take long journeys; therefore, they now only run at the ABC Express, that works at peak-hours between Tamanduateí and Santo André stations. 2100's compositions have only six cars, as opposed of the eight-cars regular compositions.
See also
Santos-Jundiaí Railroad
Line 9 (CPTM)
Notes
References
External links
Official page of the CPTM
Secretaria dos Transportes Metropolitanos
Companhia Paulista de Trens Metropolitanos
CPTM 10 |
https://en.wikipedia.org/wiki/Line%2012%20%28CPTM%29 | Line 12 (Sapphire) (, formerly Line F (Purple), is one of the seven lines operated by CPTM and one of the thirteen lines that make up the Sao Paulo Metro Rail Transport Network, in Brazil.
Stations
Notes
References
External links
Official page of the CPTM
Secretaria dos Transportes Metropolitanos
Companhia Paulista de Trens Metropolitanos
CPTM 12 |
https://en.wikipedia.org/wiki/List%20of%20number-one%20Billboard%20Hot%20Tropical%20Songs%20of%202009 | The Billboard Tropical Songs is a chart that ranks the best-performing tropical songs of the United States. Published by Billboard magazine, the data are compiled by Nielsen Broadcast Data Systems based on each single's weekly airplay.
Chart history
See also
List of number-one Billboard Hot Latin Songs of 2009
List of number-one Billboard Hot Latin Pop Airplay of 2009
References
United States Tropical Songs
2009
2009 in Latin music |
https://en.wikipedia.org/wiki/GVN | GVN may refer to
Gazet van Antwerpen, a Belgian newspaper
Global value numbering
Global Virus Network
Global Volunteer Network
Godavari railway station, in India
Kuku Yalanji language
Government of Viet Nam, used of South Vietnam, 1955-1975 |
https://en.wikipedia.org/wiki/ITNOW | ITNOW (formerly The Computer Bulletin) is a bimonthly magazine aimed at IT professionals that is published on behalf of the British Computer Society (BCS) and sent to all its members. The magazine was started with the title The Computer Bulletin in London in 1957. It is published by Oxford University Press for the BCS and is sent to more than 70,000 IT professionals. The editor is Brian Runciman.
References
External links
ITNOW website
ITNOW information from the BCS
1957 establishments in the United Kingdom
Bi-monthly magazines published in the United Kingdom
Computer magazines published in the United Kingdom
British Computer Society
Magazines published in London
Magazines established in 1957
Oxford University Press
Professional and trade magazines |
https://en.wikipedia.org/wiki/Column%20%28data%20store%29 | A column of a distributed data store is a NoSQL object of the lowest level in a keyspace. It is a tuple (a key–value pair) consisting of three elements:
Unique name: Used to reference the column
Value: The content of the column. It can have different types, like AsciiType, LongType, TimeUUIDType, UTF8Type among others.
Timestamp: The system timestamp used to determine the valid content.
Usage
A column is used as a store for the value and has a timestamp that is used to differentiate the valid content from stale ones. According to the CAP theorem, distributed data stores cannot guarantee consistency, as availability and partition tolerance are more important issues. Therefore, the data store or the application programmer will use the timestamp to find out which of the stored values in the backup nodes are up-to-date.
Some data stores, like Riak, may use the more sophisticated vector clock instead of the timestamp to resolve stale information.
Differences from a relational database
In relational databases, a column is a part of a relational table that can be seen in each row of the table. This is not the case in distributed data stores, where the concept of a table only vaguely exists. A column can be part of a ColumnFamily that resembles at most a relational row, but it may appear in one row and not in the others. Also, the number of columns may change from row to row, and new updates to the data store model may also modify the column number. So, all the work of keeping up with changes relies on the application programmer.
Examples
Three definitions of columns in JSON-like notation are given below:
{
street: {name: "street", value: "1234 x street", timestamp: 123456789},
city: {name: "city", value: "san francisco", timestamp: 123456789},
zip: {name: "zip", value: "94107", timestamp: 123456789},
}
See also
Super column
References
NoSQL |
https://en.wikipedia.org/wiki/Standard%20column%20family | The standard column family is a NoSQL object that contains columns of related data. It is a tuple (pair) that consists of a key–value pair, where the key is mapped to a value that is a set of columns. In analogy with relational databases, a standard column family is as a "table", each key–value pair being a "row". Each column is a tuple (triplet) consisting of a column name, a value, and a timestamp. In a relational database table, this data would be grouped together within a table with other non-related data.
Standard column families are column containers sorted by their names can be referenced and sorted by their row key.
Benefits
Accessing the data in a distributed data store would be expensive (time-consuming), if it would be saved in form of a table. It would also be inefficient to read all column families that would make up a row in a relational table and put it together to form a row, as the data for it is distributed on a large number of nodes. Therefore, the user accesses only the related information required.
As an example, a relational table could consist of the columns UID, first name, surname, birthdate, gender, etc. In a distributed data store, the same table would be implemented by creating columns families for "UID, first name, surname", "birthdate, gender", etc. If one needs only the males that were born between 1950 and 1960, for a query in the relational database, all the table has to be read. In a distributed data store, it suffices to access only the second standard column family, as the rest of information is irrelevant.
Sorting and querying
There is no way to sort columns, nor to query an arbitrary query in distributed data stores. Columns are sorted when they are added to the column family. The way of sorting is defined by an attribute. For instance, this is done by the CompareWith attribute in Apache Cassandra that can have the following values:
AsciiType
BytesType
LexicalUUIDType
LongType
TimeUUIDType
UTF8Type
It is also possible to add some user-defined sorting attributes. Using this way of sorting makes the process extremely quick.
Standard column families vs. rows
Standard column families have a schema-less nature so that each of their "row"s can contain a different number of columns, and even different column names could be in each row. So, they are a very different concept than the rows in relational database management system (RDBMS)s. This is one of the reasons why the concept is not trivial for an experienced RDBMS expert.
Examples
In JSON-like notation, a column family definition would look as follows:
UserProfile = {
Cassandra = {emailAddress:"cassandra@apache.org", age:20},
TerryCho = {emailAddress:"terry.cho@apache.org", gender:"male"},
Cath = {emailAddress:"cath@apache.org", age:20, gender:"female", address:"Seoul"},
}
where "Cassandra", "TerryCho", "Cath" correspond to row keys; and "emailAddress", "age", "gender", "address" correspond to the column names.
See also
Column (d |
https://en.wikipedia.org/wiki/Google%20juice | Google juice may refer to
A colloquial name for the value afforded to incoming web links by PageRank, the Google search algorithm
Google Guice, an open source software framework for the Java platform |
https://en.wikipedia.org/wiki/Quantone | Quantone, formerly known as Decibel Music Systems, is a London-based music intelligence software company that provides rich, semantic music metadata to developers and media companies. Quantone uses technology derived from intelligence gathering services to allow for deeply connected data, storing information on not only artists and their recorded works, but also the relationships between them. In addition to album title, track titles, and the length of each track, Quantone compiles the producers, engineers, session musicians, copyright information, and more. In 2015 Quantone added music recommendations to their product range, announcing a collaboration with IBM's cognitive computing platform, Watson. Quantone also addresses special issues, such as multiple names and languages, as well as sympathetic treatment of classical music, world music and jazz.
History
Quantone was founded in 2010 by Gregory Kris, Adrian Corbett, and Evan Stein as Decibel Music Systems. A musicologist by training, Stein worked as a programmer for the New York County District Attorney’s office, designing intelligence-gathering systems for law enforcement. He then served as the Director of Application Development at Standard & Poor’s, developing large-scale databases for cross-functional use. In 2005, he combined his passion for music with his technical skills and began developing the preliminary architecture of the database. Decibel Music Systems Ltd was then incorporated in 2010 alongside partners Adrian Corbett and Gregory Kris. Kris resigned as CEO in 2013.
In 2011, it was one of MidemNet Lab's finalists. In 2014, they were a Top 20 finalist at the Webit Congress - Founders Games in Istanbul.
In 2015 Decibel signed a contract with IBM to develop a music recommendations system using Watson, IBM’s cognitive computing platform, widely acclaimed for winning the game-show Jeopardy! in 2011. In 2015 Stein, the CEO said of the collaboration “The Watson project will enable us to provide even more information based on people’s observations of the music and opinion”. In 2015 the company also changed its name to Quantone.
Product and clients
Quantone gathers music data through data-mining, web crawling, and manual input to produce a total of 100 fields of metadata for any given track. This database serves as the main product line for the company. The company has also worked closely with Colin Larkin, author of the Encyclopedia of Popular Music.
Customers include music sites, artist royalty collectors, record labels and independent music applications, such as Jugglit and EMI’s BlueNote App in collaboration with Groovebug.
Quantone released version 3 of their API in late 2014.
Quantone is in private ownership.
References
External links
Online music and lyrics databases
Mass media companies based in London
British companies established in 2010 |
https://en.wikipedia.org/wiki/Trolleybuses%20in%20Bournemouth | The Bournemouth trolleybus system once served the town of Bournemouth, then in Hampshire, but now in Dorset, England. Opened on , it gradually replaced the Bournemouth tramway network.
By the standards of the various now-defunct trolleybus systems in the United Kingdom, the Bournemouth system was a medium-sized one, with a total of 22 routes, and a maximum fleet of 104 trolleybuses. It was also the second largest trolleybus system in southern England, after the London system. It was closed on .
Notable features
The most notable feature of the Bournemouth system was probably the Christchurch trolleybus turntable, which is said to be one of only five such turntables ever to have been constructed worldwide. It is now a Grade II listed building. The turntable was manually operated and was in use from 19 June 1936 until the closure of the system.
Also notable was the style of bodywork employed on most of the Bournemouth's trolleybuses. Many featured two staircases and the traditional open rear platform was supplemented with a front passenger exit fitted with folding doors.
Preservation
Several of the former Bournemouth system trolleybuses are now preserved, in their distinctive yellow and maroon livery. Two are at the East Anglia Transport Museum (fleet numbers 282 and 286), and two Sunbeam MF2B trolleybuses plus one other (fleet numbers 99, 297 and 301) are at The Trolleybus Museum at Sandtoft. One is in private ownership in England. One is in the National Transport Museum of Ireland.
See also
History of Bournemouth
Transport in Bournemouth
List of trolleybus systems in the United Kingdom
References
Notes
Further reading
External links
Bournemouth trolleybus picture gallery
SCT'61 website – photos and descriptions of Bournemouth trolleybuses and early motorbuses
National Trolleybus Archive
British Trolleybus Society, based in Reading
National Trolleybus Association, based in London
History of Bournemouth
Bournemouth
Bournemouth
Transport in Bournemouth |
https://en.wikipedia.org/wiki/CDRoller | CDRoller is a utility for CD and DVD data recovery. It supports a wide set of CD and DVD formats, including HD DVD and Blu-ray. CDRoller has the ability to read CD and DVD with UDF File System written by Roxio and Ahead Nero software. It allows users to find the VOB files on mini DVD when recorded video cannot be played due to a failure of camcorder, or disc finalization was accidentally interrupted. The built-in "Split Video" converts the recovered VOB data into generic MPEG-2 files that can be played back in Windows Media Player. CDRoller can also extract the pictures (JPEG files) from 8 cm CD-R/CD-RW, created by Sony Mavica CD digital cameras.
File retrieval
The program also finds and retrieves lost pictures, video and other types of files from flash memory cards, such as SmartMedia, Memory Stick, CompactFlash and other flash memory drives.
DVD authoring
A built-in DVD authoring option allows user to make a new disc in the DVD-Video format. A new CD or DVD can be also compiled from recovered files and folders or an ISO image.
See also
List of data recovery software
List of ISO image software
References
Further reading
External links
Windows-only trialware
Data recovery software
2001 software
Optical disc authoring software |
https://en.wikipedia.org/wiki/Reentry%20Breakup%20Recorder | A Reentry Breakup Recorder (REBR) is a device that is designed to be placed aboard a spacecraft to record pertinent data when the spacecraft (intentionally) breaks up as it re-enters Earth's atmosphere.
The device records data regarding the thermal, acceleration, rotational and other stresses the vehicle is subject to. In the final stages it transmits the data back to a laboratory before it is destroyed when it hits the surface.
History
Two REBRs were launched in January 2011 on the Japanese Kounotori 2 transfer vehicle. One recorded the subsequent re-entry of that vehicle, and the other was placed aboard the Johannes Kepler ATV, which reentered Earth's atmosphere on 21 June 2011.
The Kounotori 2 vehicle re-entered on 30 March 2011. Its REBR successfully collected and returned its data; it survived the impact with the ocean and while floating continued to transmit. It took between 6 and 8 weeks to analyze the data.
The second unit was intended to collect data during the reentry of the Johannes Kepler ATV (ATV-2); however the device failed to make contact after reentry and consequently no data was retrieved.
Two other units were used successfully for Kounotori 3 for its reentry on September 14, 2012, and Edoardo Amaldi ATV (ATV-3) on October 3, 2012.
Predecessor technology: image documentation of reentry and breakup
Earlier data collection from reentry and breakup was mostly visual and spectrographic. A particularly well-documented case is seen in a reentry and breakup over the South Pacific—recorded by a large team of NASA and ESA space agency personnel with extensive photographic image and video data collection, at multiple spectrographic wavelengths—occurred in September 2008, following the first mission of the ESA cargo spacecraft—the Automated Transfer Vehicle Jules Verne—to the International Space Station (ISS) in March 2008.
On 5 September 2008, Jules Verne undocked from the ISS and maneuvered to an orbital position below the ISS. It remained in that orbit until the night of 29 September.
At 10:00:27 UTC, Jules Verne started its first de-orbit burn of 6 minutes, followed by a second burn of 15 minutes at 12:58:18 UTC. At 13:31 GMT, Jules Verne re-entered the atmosphere at an altitude of , and then completed its destructive re-entry as planned over the following 12 minutes,
depositing debris in the South Pacific Ocean southwest of Tahiti.
This was recorded with video and still photography at night by two aircraft flying over the South Pacific for purposes of data gathering.
The NASA documentary of the project is in the gallery, below.
Gallery
References
External links
Photo and diagram of the first REBRs, April 2011.
Atmospheric entry
Spacecraft communication
Spacecraft instruments
Articles containing video clips |
https://en.wikipedia.org/wiki/KHRV | KHRV (90.1 FM) is a radio station licensed to Hood River, Oregon. The station is owned by Oregon Public Broadcasting, and airs OPBs news and talk programming, consisting of syndicated programming from NPR, APM and PRI, as well as locally produced offerings.
FM Translator
KHRV programming is also heard on an FM translator on 94.3 MHz.
External links
opb.org
HRV
HRV
Hood River, Oregon |
https://en.wikipedia.org/wiki/Phospho.ELM | Phospho.ELM is a database storing the phosphorylation data extracted from the literature and the analyses.
References
External links
http://phospho.elm.eu.org
Biological databases
Post-translational modification
Phosphorus |
https://en.wikipedia.org/wiki/Action%20Pack | Action Pack may refer to:
Action Pack (TV programming block), a syndicated television programming block by Universal Television
Action Pack, a component of Ruby on Rails
Action Pack (TV series), a children's streaming series for Netflix |
https://en.wikipedia.org/wiki/Disney%20Second%20Screen | Disney Second Screen was an interactive application, released on a computer (via Flash) or iPad (as native app). This app provides onscreen film feature accessible download that provided additional content, and user can views a film released by the Walt Disney Studios Home Entertainment. The movie linked with the viewer's device through an audio cue, a manual sync, or with a visual sync indicator. As the film plays on a viewer's television, interactive elements such as trivia, photo galleries, and animated flipbooks appeared on the iPad or computer screen.
History
Disney Second Screen was released by Walt Disney Studios Home Entertainment in the Bambi Diamond Edition Blu-ray on March 1, 2011. The feature was included with the following home media releases:
Bambi Diamond Edition Blu-ray on March 1, 2011.
Tron: Legacy Blu-ray and DVD - April 5, 2011
The Lion King Diamond Edition Blu-ray - October 4, 2011
Pirates of the Caribbean: On Stranger Tides Blu-ray - October 18, 2011
Real Steel Blu-ray - January 24, 2012 Branded as Real Steel Second Screen.
Lady and the Tramp Diamond Edition Blu-ray on February 7, 2012.
John Carter Blu-ray - June 5, 2012.
The Avengers Blu-ray - September 25, 2012. Branded as Marvel Second Screen.
Oz the Great and Powerful Blu-ray - June 11, 2013.
Iron Man 3 Blu-ray - September 24, 2013. Branded as Marvel Second Screen.
The Little Mermaid Diamond Edition Blu-ray - October 1, 2013
As of 2 October 2016, Disney had ceased support for this feature and removed the website. As of 30 August 2020, the original website re-directs to technical support, including a FAQ stating that the feature is no longer supported.
Special Features
Special features for the Bambi Diamond Edition release include a Thumper flipbook, games, art galleries, videos, and trivia. The Tron: Legacy DVD and Blu-ray includes an interactive reel of images and a 3-D environment that can be explored using the touchscreen or the mouse. Similarly, the application on The Lion King Diamond Edition allows you to look at storyboards, concept art, and interactive games while the film plays. For the release of Pirates of the Caribbean: On Stranger Tides, Disney Second Screen allows you to look at concept art, time-lapse photography, and makeup tests. The Real Steel Second Screen includes stories and opinions from the filmmaker that expand the story. On the Lady and the Tramp Diamond Edition release, the Second Screen application includes storyboards, activities, and behind-the-scenes features. For Iron Man 3, the second screen app features the voice of actor Paul Bettany as JARVIS, who recorded more than 20 hours of original audio content specifically for the app.
See also
Second screen
References
Film and video technology
IOS software
Computer-related introductions in 2011
Second Screen |
https://en.wikipedia.org/wiki/National%20Strategy%20for%20Trusted%20Identities%20in%20Cyberspace | The National Strategy for Trusted Identities in Cyberspace (NSTIC) is a US government initiative announced in April 2011 to improve the privacy, security and convenience of sensitive online transactions through collaborative efforts with the private sector, advocacy groups, government agencies, and other organizations.
The strategy imagined an online environment where individuals and organizations can trust each other because they identify and authenticate their digital identities and the digital identities of organizations and devices. It was promoted to offer, but not mandate, stronger identification and authentication while protecting privacy by limiting the amount of information that individuals must disclose.
Description
The strategy was developed with input from private sector lobbyists, including organizations representing 18 business groups, 70 nonprofit and federal advisory groups, and comments and dialogue from the public.
The strategy had four guiding principles:
privacy-enhancing and voluntary
secure and resilient
interoperable
cost-effective and easy to use.
The NSTIC described a vision compared to an ecosystem where individuals, businesses, and other organizations enjoy greater trust and security as they conduct sensitive transactions online. Technologies, policies, and agreed upon standards would securely support transactions ranging from anonymous to fully authenticated and from low to high value in such an imagined world.
Implementation included three initiatives:
The Identity Ecosystem Steering Group (IDESG), the private sector-led organization developing the Identity Ecosystem Framework;
Funding pilot projects that NSTIC said embrace and advance guiding principles; and
The Federal Cloud Credential Exchange (FCCX), the U.S. federal government service for government agencies to accept third-party issued credentials approved under the FICAM scheme.
NSTIC was announced during the Presidency of Barack Obama near the end of his first term on April 15, 2011. A magazine article said individuals might validate their identities securely for sensitive transactions (such as banking or viewing health records) and let them stay anonymous when they are not (such as blogging or surfing the Web).
In January 2011 the U.S. Department of Commerce had established a National Program Office (NPO), led by the National Institute of Standards and Technology, to help implement NSTIC.
To coordinate implementation activities of federal agencies, the NPO works with the White House Cybersecurity Coordinator, originally Howard Schmidt and then after 2012 Michael Daniel.
Steering group
The NSTIC called a steering group led by the private sector to administer the development and adoption of its framework. This Identity Ecosystem Steering Group (IDESG) held a meeting in Chicago August 15–16, 2012. The meeting brought together 195 members in person and 315 members remotely. Additional plenary meetings were in Phoenix, Arizona, Santa Clara, Californ |
https://en.wikipedia.org/wiki/PDRS | PDRS may refer to:
Payload Deployment and Retrieval System
Probe Data Relay Subsystem |
https://en.wikipedia.org/wiki/Terremark | Terremark Worldwide, Inc., is of IBM, a provider of information technology services. Headquartered in Miami, Florida, the company had data centers in the United States, Europe and Latin America; it offered services which include managed hosting, colocation, disaster recovery, data storage, and cloud computing.
Terremark employed over 750 people at its Miami-Dade County headquarters.
History
In 1980 Manny Medina incorporated Terremark as a real estate company, constructing office buildings. During the dot-com era, an increasing number of his buildings were leased to computer data centers; over the years the company morphed into an information technology services company itself starting with the NAP of the Americas, a large data center and Internet exchange point that hosts one of the instances of the K-root of the Domain Name System.
On January 27, 2011, Verizon Communications announced it would buy Terremark Worldwide for $19 a share, in a deal valued at $1.4 billion. Medina received about $83 million from the Verizon acquisition. Verizon completed its acquisition of Terremark on April 12, 2011. Medina left the company at the time of the takeover and Terremark had two presidents in the first year after the acquisition. Currently three high ranking executives are running the business.
In October 2013, Secretary of Health and Human Services (HHS) Kathleen Sebelius revealed that Terremark, the web-hosting provider for HealthCare.gov, was the government contractor responsible for "outages that disrupted the website" when it was initially rolled out. A month later, HHS revealed that it did not renew its contract with Terremark, and instead awarded the contract for hosting HealthCare.gov to Hewlett-Packard.
In Jan 2016, Verizon confirmed the intention to divest its data center portfolio, with Equinix Inc. (EQIX) for a consideration of around $3.5 billion.
In May 2017, Verizon confirmed its divestiture of Terremark, selling to IBM.
References
Companies based in Miami
Verizon Communications
1980 establishments in Florida
Telecommunications companies established in 1980
Telecommunications companies of the United States
Telecommunications infrastructure
2011 mergers and acquisitions |
https://en.wikipedia.org/wiki/Open-shop%20scheduling | Open-shop scheduling or open-shop scheduling problem (OSSP) is an optimization problem in computer science and operations research. It is a variant of optimal job scheduling. In a general job-scheduling problem, we are given n jobs J1, J2, ..., Jn of varying processing times, which need to be scheduled on m machines with varying processing power, while trying to minimize the makespan - the total length of the schedule (that is, when all the jobs have finished processing). In the specific variant known as open-shop scheduling, each job consists of a set of operations O1, O2, ..., On which need to be processed in an arbitrary order. The problem was first studied by Teofilo F. Gonzalez and Sartaj Sahni in 1976.
In the standard three-field notation for optimal job-scheduling problems, the open-shop variant is denoted by O in the first field. For example, the problem denoted by "O3||" is a 3-machines job-shop problem with unit processing times, where the goal is to minimize the maximum completion time.
Definition
The input to the open-shop scheduling problem consists of a set of n jobs, another set of m workstations, and a two-dimensional table of the amount of time each job should spend at each workstation (possibly zero). Each job may be processed only at one workstation at a time, and each workstation can process only one job at a time. However, unlike the job-shop problem, the order in which the processing steps happen can vary freely. The goal is to assign a time for each job to be processed by each workstation, so that no two jobs are assigned to the same workstation at the same time, no job is assigned to two workstations at the same time, and every job is assigned to each workstation for the desired amount of time. The usual measure of quality of a solution is its makespan, the amount of time from the start of the schedule (the first assignment of a job to a workstation) to its end (the finishing time of the last job at the last workstation).
Computational complexity
The open-shop scheduling problem can be solved in polynomial time for instances that have only two workstations or only two jobs. It may also be solved in polynomial time when all nonzero processing times are equal: in this case the problem becomes equivalent to edge coloring a bipartite graph that has the jobs and workstations as its vertices, and that has an edge for every job-workstation pair that has a nonzero processing time. The color of an edge in the coloring corresponds to the segment of time at which a job-workstation pair is scheduled to be processed. Because the line graphs of bipartite graphs are perfect graphs, bipartite graphs may be edge-colored in polynomial time.
For three or more workstations, or three or more jobs, with varying processing times, open-shop scheduling is NP-hard.
Related problems
Job-shop scheduling is a similar problem but with a yet additional constraint the operations must be done in a specific order.
Flow-shop scheduling is a job-sh |
https://en.wikipedia.org/wiki/AidData | AidData is an Aid Transparency, Information Technology, Geocoding institute which was formed in March 23, 2009. Both its location and headquarters are in Williamsburg, Virginia.
The AidData website provides access to development finance activity records from most official aid donors.
The AidData portal provides access to development finance activities from 1945 to the present from 95 donor agencies.
In addition, the AidData program works on other projects that make it easier to access and analyze aid information, such as the World Bank Institute's Mapping for Results Initiative and the Development Loop application.
History
AidData was formed in 2009 as a partnership between Brigham Young University (BYU), the College of William and Mary, and Development Gateway. The organization was formed through the merger of two prior initiatives: Project-Level Aid (PLAID) and Accessible Information on Development Activities (AiDA). PLAID, conceived in 2003, was a joint effort between BYU and William and Mary to provide data on foreign aid. AiDA was established in 2001 by Development Gateway to serve as a registry of aid activities to improve aid transparency and coordination. The organization released their searchable data portal of one million past and present development finance activities from over 90 funding agencies.
In 2016, the members of the AidData partnership came to an agreement that AidData would function moving forward as a stand-alone development research and innovation lab at the College of William and Mary. AidData maintains strong working relationships with their co-founders Development Gateway and Brigham Young University, and these organizations continue to support and contribute to AidData's work, including as members of the AidData Center for Development Policy.
Information tools and resources
AidData's online resources include:
The AidData database, a collection of information on individual foreign aid projects financed by governments and aid agencies between 1945 and the present.
The website china.aiddata.org, an online platform that seeks to make information about Chinese development finance flows to Africa more accessible and usable.
The First Tranche, a blog focusing on information about development finance, and how it can be used to improve development practice and research.
Research, books, academic publications, working papers, and datasets related to aid effectiveness and aid allocation.
Maps, maps and information about geocoding aid activities.
Innovation, Information about other AidData projects in development including (crowdsourcing and dashboards).
Aid information in AidData database
AidData's main table database includes data from 96 donor agencies and multilateral organizations from 1945 to the present. Most of the aid activity records are republished with permission from the Creditor Reporting System (CRS), the central database for foreign aid compiled by the OECD's Development Assistance Committee (DAC), which |
https://en.wikipedia.org/wiki/Computer%20Modelling%20Group | Computer Modelling Group Ltd., abbreviated as CMG, is a software company that produces reservoir simulation software for the oil and gas industry. It is based in Calgary, Alberta, Canada with branch offices in Houston, Dubai, Bogota, Rio de Janeiro, London and Kuala Lumpur. The company is traded on the Toronto Stock Exchange under the symbol CMG.
The company offers three reservoir simulation applications. IMEX, a conventional black oil simulator used for primary, secondary and enhanced or improved oil recovery processes; GEM, an advanced Equation-of-State (EoS) compositional and unconventional simulator; and STARS a k-value thermal and advanced processes simulator. CMG also offers CMOST, a reservoir engineering tool that conducts automated history matching, sensitivity analysis and optimization of reservoir models. In addition, CMG has developed CoFlow, which is a unique production engineering software for wellbore and facility analysis and allows for smart coupling with reservoir models.
History
The company began in 1978 as an effort to develop a simulator by Khalid Aziz of the University of Calgary's Chemical Engineering department, with a research grant from the government of Alberta. CMG became known for its expertise in heavy oil, and has expanded this knowledge into all aspects of reservoir flow and advanced processes modelling. A commercial product was available by the late 1980s. For the first 19 years of the company's history it was a non-profit entity. In 1997, CMG became a public company when it was listed on the TSX. The company now claims over 570 clients in 58 countries.
In May 2018, CMG President and CEO Kenneth Dedeluk announced his retirement following the company. Ryan Schneider was appointed to succeed Dedeluk.
References
Companies listed on the Toronto Stock Exchange
Companies based in Calgary
Technology companies of Canada
Software companies of Canada
1978 establishments in Alberta
Canadian companies established in 1978
Software companies established in 1978 |
https://en.wikipedia.org/wiki/SmartBird | SmartBird is an autonomous ornithopter created by Festo's Bionic Learning Network with an emphasis on better aerodynamics and maneuverability. It is an ornithopter modeled on the herring gull. It has a mass of 450 grams and a wingspan of 1.96 meters. In April 2011 the SmartBird was unveiled at the Hanover Fair.
The natural wingbeat of a bird was emulated by using bionics technology to decipher bird flight. Based on the flight of a herring gull, Smartbird differs from previous flapping wing attempts in that it can take off, fly and land by itself. Its wings not only beat up and down, but deliberately twist. This is done by an active torsion mechanism, which provides both lift and propulsion.
Smartbird is constructed of polyurethane foam and carbon fiber and is powered by a 135 brushless motor running at 23 watts.
Lift and propulsion
Flight occurs in a manner very similar to that of real birds. The vertical motion of the wings is provided by an electric motor in the body of the bird. It is connected to two wheels that attach to rods in the wings in a manner similar to steam locomotives. Inside the wings are torsional servo motors that adjust the wings' angle of attack to provide forward motion. Directional control is provided by moving the tail and head.
References
External links
Unmanned aerial vehicles of Germany
Ornithopters |
https://en.wikipedia.org/wiki/Glan%20Pibwr%20Stream%20Section | Glan Pibwr Stream Section is a Site of Special Scientific Interest in Carmarthen & Dinefwr, Wales. Datasets for various species associated with this area, under a variety of designations, are available.
See also
List of Sites of Special Scientific Interest in Carmarthen & Dinefwr
References
Sites of Special Scientific Interest in Carmarthen & Dinefwr |
https://en.wikipedia.org/wiki/Phospho3D | Phospho3D is a database of 3D structures of phosphorylation sites derived from Phospho.ELM.
See also
Phospho.ELM
Protein structure
References
External links
http://www.phospho3d.org/.
Biological databases
Post-translational modification
Phosphorus |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.