source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/ShaBLAMM%21%20NiTro-VLB | The ShaBLAMM! NiTro-VLB was a computer system that used a QED R4600 microprocessor implemented on a VESA Local Bus peripheral card and designed to function when connected to a host computer system using an Intel i486. The NiTro-VLB conformed to the ARC standard, and was produced and marketed by ShaBLAMM! Computer as an "upgrade" card for accelerating Windows NT.
Characteristics
The NiTro-VLB is notable for various unique characteristics among personal computer accessories. For example, although the system was marketed as an "upgrade" for computers already using a 486 processor, the NiTro-VLB was in fact of an entirely different architecture (specifically, the MIPS architecture) from the IA32-based 486. Further, as a "parasitic" or "symbiotic" coprocessor, the NiTro-VLB was designed to co-opt the host 486 processor from running, and used four megabytes of the host 486 motherboard's system memory as a DMA buffer (although the NiTro-VLB required its own separate DRAM main memory, in addition to any memory installed on the host 486 motherboard).
This is a type of "parasite"/"host" upgrade card configuration, in which an entire motherboard and processor are implemented on an expansion card designed to connect to a host motherboard's expansion slot. Such configurations are rare among computer systems designed to run Microsoft Windows.
Specifications and benchmarks
The NiTro-VLB's QED R4600 processor, running at 100 MHz, was rated at 73.8 SPECint92 and 63 SPECfp92 (which are similar figures to the first-generation Pentium running at 66 MHz). Faster and costlier versions were designed to run at 133 MHz or 150 MHz.
Sales
Initially, the NiTro-VLB system was priced at $1,095 for a 100 MHz card with no main memory, $1,995 for a 100 MHz card with 16 MB of main memory and a copy of Windows NT, and $2,595 for a 150 MHz card.
See also
Jazz (computer)
MIPS Magnum
DeskStation Tyne
External links
A BYTE magazine article detailing the ShaBlamm! Nitro-VLB
Computer workstations
Advanced RISC Computing |
https://en.wikipedia.org/wiki/Hybrid%20computer | Hybrid computers are computers that exhibit features of analog computers and digital computers. The digital component normally serves as the controller and provides logical and numerical operations, while the analog component often serves as a solver of differential equations and other mathematically complex problems.
History
The first desktop hybrid computing system was the Hycomp 250, released by Packard Bell in 1961. Another early example was the HYDAC 2400, an integrated hybrid computer released by EAI in 1963. In the 1980s, Marconi Space and Defense Systems Limited (under Peggy Hodges) developed their "Starglow Hybrid Computer", which consisted of three EAI 8812 analog computers linked to an EAI 8100 digital computer, the latter also being linked to an SEL 3200 digital computer. Late in the 20th century, hybrids dwindled with the increasing capabilities of digital computers including digital signal processors.
In general, analog computers are extraordinarily fast, since they are able to solve most mathematically complex equations at the rate at which a signal traverses the circuit, which is generally an appreciable fraction of the speed of light. On the other hand, the precision of analog computers is not good; they are limited to three, or at most, four digits of precision.
Digital computers can be built to take the solution of equations to almost unlimited precision, but quite slowly compared to analog computers. Generally, complex mathematical equations are approximated using iterative methods which take huge numbers of iterations, depending on how good the initial "guess" at the final value is and how much precision is desired. (This initial guess is known as the numerical "seed".) For many real-time operations in the 20th century, such digital calculations were too slow to be of much use (e.g., for very high frequency phased array radars or for weather calculations), but the precision of an analog computer is insufficient.
Hybrid computers can be used to obtain a very good but relatively imprecise 'seed' value, using an analog computer front-end, which is then fed into a digital computer iterative process to achieve the final desired degree of precision. With a three or four digit, highly accurate numerical seed, the total digital computation time to reach the desired precision is dramatically reduced, since many fewer iterations are required. One of the main technical problems to be overcome in hybrid computers is minimizing digital-computer noise in analog computing elements and grounding systems.
Consider that the nervous system in animals is a form of hybrid computer. Signals pass across the synapses from one nerve cell to the next as discrete (digital) packets of chemicals, which are then summed within the nerve cell in an analog fashion by building an electro-chemical potential until its threshold is reached, whereupon it discharges and sends out a series of digital packets to the next nerve cell. The advantages are a |
https://en.wikipedia.org/wiki/Rail%20yard | A rail yard, railway yard, railroad yard (US) or simply yard, is a series of tracks in a rail network for storing, sorting, or loading and unloading rail vehicles and locomotives. Yards have many tracks in parallel for keeping rolling stock or unused locomotives stored off the main line, so that they do not obstruct the flow of traffic. Cars or wagons are moved around by specially designed yard switcher locomotives (US) or shunter locomotives (UK), a type of locomotive. Cars or wagons in a yard may be sorted by numerous categories, including railway company, loaded or unloaded, destination, car type, or whether they need repairs. Yards are normally built where there is a need to store rail vehicles while they are not being loaded or unloaded, or are waiting to be assembled into trains. Large yards may have a tower to control operations.
Many yards are located at strategic points on a main line. Main-line yards are often composed of an up yard and a down yard, linked to the associated direction of travel. There are different types of yards, and different parts within a yard, depending on how they are built.
Freight yards
For freight cars, the overall yard layout is typically designed around a principal switching (US term) or shunting (UK) technique:
A flat yard has no hump, and relies on locomotives for all car movements.
A gravity yard is built on a natural slope and relies less on locomotives; generally locomotives will control a consist being sorted from uphill of the cars about to be sorted. They are decoupled and let to accelerate into the classification equipment lower down.
A hump yard has a constructed hill, over which freight cars are shoved by yard locomotives, and then gravity is used to propel the cars to various sorting tracks;
Sorting yard basics
In the case of all classification or sorting yards, human intelligence plays a primary role in setting a strategy for the switching operations; the fewer times coupling operations need to be made and the less distance traveled, the faster the operation, the better the strategy and the sooner the newly configured consist can be joined to its outbound train.
Switching yards, staging yards, or shunting yards are typically graded to be flat yards, where switch engines manually shuffle and maneuver cars from (a) train arrival tracks, to (b) to consist breakdown track, to (c) an consist assembly track, thence to (d) departure tracks of the yard.
A large sub-group of such yards are known as staging yards, which are yards serving an end destination that is also a collection yard starting car groups for departure. These seemingly incompatible tasks are because the operating or road company and its locomotive drops off empties and picks up full cars waiting departure which have been spotted and assembled by local switch engines. The long haul carrier makes the round trip with a minimal turn around time, and the local switch engine transfers empties to the loading yard when the industries |
https://en.wikipedia.org/wiki/Automated%20planning%20and%20scheduling | Automated planning and scheduling, sometimes denoted as simply AI planning, is a branch of artificial intelligence that concerns the realization of strategies or action sequences, typically for execution by intelligent agents, autonomous robots and unmanned vehicles. Unlike classical control and classification problems, the solutions are complex and must be discovered and optimized in multidimensional space. Planning is also related to decision theory.
In known environments with available models, planning can be done offline. Solutions can be found and evaluated prior to execution. In dynamically unknown environments, the strategy often needs to be revised online. Models and policies must be adapted. Solutions usually resort to iterative trial and error processes commonly seen in artificial intelligence. These include dynamic programming, reinforcement learning and combinatorial optimization. Languages used to describe planning and scheduling are often called action languages.
Overview
Given a description of the possible initial states of the world, a description of the desired goals, and a description of a set of possible actions, the planning problem is to synthesize a plan that is guaranteed (when applied to any of the initial states) to generate a state which contains the desired goals (such a state is called a goal state).
The difficulty of planning is dependent on the simplifying assumptions employed. Several classes of planning problems can be identified depending on the properties the problems have in several dimensions.
Are the actions deterministic or non-deterministic? For nondeterministic actions, are the associated probabilities available?
Are the state variables discrete or continuous? If they are discrete, do they have only a finite number of possible values?
Can the current state be observed unambiguously? There can be full observability and partial observability.
How many initial states are there, finite or arbitrarily many?
Do actions have a duration?
Can several actions be taken concurrently, or is only one action possible at a time?
Is the objective of a plan to reach a designated goal state, or to maximize a reward function?
Is there only one agent or are there several agents? Are the agents cooperative or selfish? Do all of the agents construct their own plans separately, or are the plans constructed centrally for all agents?
The simplest possible planning problem, known as the Classical Planning Problem, is determined by:
a unique known initial state,
durationless actions,
deterministic actions,
which can be taken only one at a time,
and a single agent.
Since the initial state is known unambiguously, and all actions are deterministic, the state of the world after any sequence of actions can be accurately predicted, and the question of observability is irrelevant for classical planning.
Further, plans can be defined as sequences of actions, because it is always known in advance which actions will be neede |
https://en.wikipedia.org/wiki/Teen%20Choice%20Awards | The Teen Choice Awards were an annual awards show that aired on the Fox television network between 1999 and 2019. The awards honored the year's biggest achievements in music, film, sports, television, fashion, social media, and more, voted by viewers living in the United States, aged 13 and over, through various social media sites; primarily Instagram, Twitter, Snapchat, and YouTube.
The awards show has been on an indefinite hiatus since the 2019 edition.
History
Executive producers, Bob Bain and Michael Burg, came together to create an award show geared toward a teen demographic, somewhat older than that of the Nickelodeon Kids' Choice Awards, but similar to that of MTV. The format of the show has remained the same over the years, awarding the achievements of those in the entertainment and athletic industries with non-traditional categories fixed into the ceremony.
Ballots were once used in teen-oriented magazines, where readers were to purchase and tear out their ballot. Votes could also be cast online through Fox.com. In 2008, Fox and the show's producers created Teenchoiceawards.com as the official website for the Teen Choice Awards. In 2009, the number of votes cast was in excess of 83 million. Votes are now cast online through Twitter, FOX.com, and the FOX NOW app. In 2016, more than 37 million votes were cast.
Since the ceremony's inception, the show has given out genuine custom-made surfboards to individual winners. The surfboard was chosen as the award because it represents the freedom of the summer vacation for teens. In 2009, Hugh Jackman, upon winning his first one, said that he was no longer the only Australian without a surfboard.
Ceremonies
Venues
The show was held at the Barker Hangar at Santa Monica Airport for its first two shows in 1999 and 2000. From 2001 to 2013, it was held at the Universal Amphitheatre (later known as Gibson Amphitheatre) in Universal City, California. With the demolition of the amphitheater in 2013, the show moved to a new location. Then after the remodeled Pauley Pavilion at UCLA in Westwood, Los Angeles was flooded by a broken 30" water pipe on July 29, 2014, the show was moved to the Shrine Auditorium in Los Angeles. The 2015 and 2017 ceremonies were held at The Galen Center (USC), and the 2016 and 2018 ceremonies were held at the refurbished Forum in Inglewood. The 2019 ceremony was held at an outdoor set in Hermosa Beach, California.
Special awards
Extraordinary Achievement
2000: Serena Williams and Venus Williams
2001: Sarah Michelle Gellar
2002: Reese Witherspoon
Courage Award
2004: Bethany Hamilton
2006: Jason McElwain
Ultimate Choice Award
2004: Mike Myers
2007: Justin Timberlake
2009: Britney Spears
2011: Taylor Swift
2012: The Twilight Saga
2013: Ashton Kutcher
2014: Selena Gomez
2017: Miley Cyrus
Visionary Award
2005: Gwen Stefani
2017: Bruno Mars
Acuvue Inspire Award
2011: Demi Lovato
2012: Miranda Cosgrove
2013: Nick Jonas
Candie's Style Icon
2013: Miley |
https://en.wikipedia.org/wiki/Name%20resolution | Name resolution can refer to any process that further identifies an object or entity from an associated, not-necessarily-unique alphanumeric name:
In computer systems, it refers to the retrieval of the underlying numeric values corresponding to computer hostnames, account user names, group names, and other named entities;
In programming languages, it refers to the resolution of the tokens within program expressions to the intended program components
In semantics and text extraction, it refers to the determination of the specific person, actor, or object a particular use of a name refers to. |
https://en.wikipedia.org/wiki/Bernard%20M.%20Oliver | Bernard M. Oliver (May 17, 1916 – November 23, 1995), also known as Barney Oliver, was a scientist who made contributions in many fields, including radar, television, and computers. He was the founder and director of Hewlett-Packard (HP) laboratories until his retirement in 1981. He is also a recognized pioneer in the search for extraterrestrial intelligence (SETI). Oliver was president of the Institute of Electrical and Electronics Engineers in 1965. In 1986, Oliver was a National Medal of Science recipient for Engineering Science and on February 11, 2004 it was announced that Oliver had been inducted into the National Inventors Hall of Fame.
Oliver was elected to the National Academy of Sciences in 1973, received the National Medal of Science in 1986, and was inducted into the National Inventors Hall of Fame in 2004. The asteroid (2177) Oliver is named after him.
Early years
Worked at Bell Labs.
HP Labs
Founded HP Labs and worked there four decades.
Scientific contributions
Developed pulse-code modulation (PCM) with John R. Pierce and Claude Shannon
Headed the HP calculators development team
Chairs, foundations, and awards
In 2004 he was inducted into The National Inventors Hall of Fame.
In 1997 the SETI Institute established a newly endowed position, the Bernard M. Oliver Chair.
Bernard Oliver Memorial Fund
National Medal of Science, List of National Medal of Science winners, Engineering 1986
Oliver Observing Station, observatory of the Monterey Institute for Research in Astronomy
IEEE Lamme Medal (1977)
See also
2177 Oliver (an asteroid named for Bernard M. Oliver)
SETI
References
External links
HP news release
Oliver, Bernard M., 1916-. (1986). Oral history interview with Bernard More Oliver. Charles Babbage Institute. Retrieved from the University of Minnesota Digital Conservancy, http://hdl.handle.net/11299/107590.
SETI Institute biography
Bernard Oliver Memorial Fund
American computer scientists
20th-century American engineers
1916 births
1995 deaths
National Medal of Science laureates
Hewlett-Packard people
Scientists at Bell Labs
IEEE Lamme Medal recipients
20th-century American inventors
Silicon Valley people
American electrical engineers |
https://en.wikipedia.org/wiki/Barbara%20Liskov | Barbara Liskov (born November 7, 1939 as Barbara Jane Huberman) is an American computer scientist who has made pioneering contributions to programming languages and distributed computing. Her notable work includes the introduction of abstract data types and the accompanying principle of data abstraction, along with the Liskov substitution principle, which applies these ideas to object-oriented programming, subtyping, and inheritance. Her work was recognized with the 2008 Turing Award, the highest distinction in computer science.
Liskov is one of the earliest women to have been granted a doctorate in computer science in the United States, and the second woman to receive the Turing award. She is currently an Institute Professor and Ford Professor of Engineering at the Massachusetts Institute of Technology.
Early life and education
Liskov was born November 7, 1939, in Los Angeles, California, to a Jewish family, the eldest of Jane (née Dickhoff) and Moses Huberman's four children. She earned her bachelor's degree in mathematics with a minor in physics at the University of California, Berkeley in 1961. At Berkeley, she had only one other female classmate in her major. She applied to graduate mathematics programs at Berkeley and Princeton. At the time Princeton was not accepting female students in mathematics. She was accepted at Berkeley but instead moved to Boston and began working at Mitre Corporation, where she became interested in computers and programming. She worked at Mitre for one year before taking a programming job at Harvard working on language translation.
She then decided to go back to school and applied again to Berkeley, but also to Stanford and Harvard. In March 1968 she became one of the first women in the United States to be awarded a Ph.D. from a computer science department when she was awarded her degree from Stanford University. At Stanford, she worked with John McCarthy and was supported to work in artificial intelligence. The topic of her Ph.D. thesis was a computer program to play chess endgames for which she developed the important killer heuristic.
Career
After graduating from Stanford, Liskov returned to Mitre to work as research staff.
Liskov has led many significant projects, including the Venus operating system, a small, low-cost timesharing system; the design and implementation of CLU; Argus, the first high-level language to support implementation of distributed programs and to demonstrate the technique of promise pipelining; and Thor, an object-oriented database system. With Jeannette Wing, she developed a particular definition of subtyping, commonly known as the Liskov substitution principle. She leads the Programming Methodology Group at MIT, with a current research focus in Byzantine fault tolerance and distributed computing. She was on the inaugural Engineering and Computer Science jury for the Infosys Prize in 2009.
Recognition and awards
Liskov is a member of the National Academy of Engineering, the Natio |
https://en.wikipedia.org/wiki/Catriona%20Rowntree | Catriona Rowntree (born 19 July 1971) is an Australian television presenter.
Rowntree is a long standing presenter on the Nine Network's Getaway program.
Career
Rowntree studied journalism at Macleay College in Sydney, after working as a researcher with Business Review Weekly, 2GB and Prime Television. In 1991, she moved to FM radio as a newsreader and music and lifestyle program host, first in community radio and then with the ABC youth station Triple J, for which she presented until 1996.
In 1992, Rowntree was hired as a researcher for the Nine Network children's series Wonder World!, graduating to the position of reporter the following year, and host in 1994. In that same year, whilst still working at Triple J, she also became the host of a Nine Network children's show called What's Up Doc?. Rowntree went on to become the show's writer/producer.
In 1996, Rowntree became a reporter on Getaway, a popular Nine Network travel series. While retaining this position, she has also made appearances on other Nine programs. She also appeared on Nine's Sydney New Year's Eve telecast alongside Richard Wilkins. In 2006 she wrote a travel book, Catriona's Australia: My Favourite Aussie Locations, published by HarperCollins. In 2009 and 2010, Catriona Rowntree was appointed as MC at the Pas de Deux in Paradise production by The Australian Ballet at Qualia on Hamilton Island.
Personal life
In 2007, Rowntree became engaged to farmer James Pettit, and the couple married on Saturday 5 April 2008 in the chapel of the latter's old school, Geelong Grammar School.
After announcing she was pregnant on 24 February 2009, Catriona gave birth to her first child, son Andrew John Rowntree Pettit, on 5 August 2009.
In September 2010, Rowntree announced that she was again pregnant. Her second son, Charles Stephen Rowntree Pettit, was born on 11 March 2011.
Bibliography
Contributor
References
External links
1971 births
Living people
Television personalities from Sydney
Australian women television presenters
Australian women radio presenters
Triple J announcers |
https://en.wikipedia.org/wiki/DNS%20spoofing | DNS spoofing, also referred to as DNS cache poisoning, is a form of computer security hacking in which corrupt Domain Name System data is introduced into the DNS resolver's cache, causing the name server to return an incorrect result record, e.g. an IP address. This results in traffic being diverted to any computer that the attacker chooses.
Overview of the Domain Name System
A Domain Name System server translates a human-readable domain name (such as example.com) into a numerical IP address that is used to route communications between nodes. Normally if the server does not know a requested translation it will ask another server, and the process continues recursively. To increase performance, a server will typically remember (cache) these translations for a certain amount of time. This means if it receives another request for the same translation, it can reply without needing to ask any other servers, until that cache expires.
When a DNS server has received a false translation and caches it for performance optimization, it is considered poisoned, and it supplies the false data to clients. If a DNS server is poisoned, it may return an incorrect IP address, diverting traffic to another computer (often an attacker's).
Cache poisoning attacks
Normally, a networked computer uses a DNS server provided by an Internet service provider (ISP) or the computer user's organization. DNS servers are used in an organization's network to improve resolution response performance by caching previously obtained query results. Poisoning attacks on a single DNS server can affect the users serviced directly by the compromised server or those serviced indirectly by its downstream server(s) if applicable.
To perform a cache poisoning attack, the attacker exploits flaws in the DNS software. A server should correctly validate DNS responses to ensure that they are from an authoritative source (for example by using DNSSEC); otherwise the server might end up caching the incorrect entries locally and serve them to other users that make the same request.
This attack can be used to redirect users from a website to another site of the attacker's choosing. For example, an attacker spoofs the IP address DNS entries for a target website on a given DNS server and replaces them with the IP address of a server under their control. The attacker then creates files on the server under their control with names matching those on the target server. These files usually contain malicious content, such as computer worms or viruses. A user whose computer has referenced the poisoned DNS server gets tricked into accepting content coming from a non-authentic server and unknowingly downloads the malicious content. This technique can also be used for phishing attacks, where a fake version of a genuine website is created to gather personal details such as bank and credit/debit card details.
Variants
In the following variants, the entries for the server would be poisoned and redirected to the |
https://en.wikipedia.org/wiki/Opsware | Opsware, Inc. was a software company based in Sunnyvale, California, that offered products for server and network device provisioning, configuration, and management targeted toward enterprise customers. Opsware had offices in New York City, Redmond, Washington, Cary, North Carolina, and an engineering office in Cluj, Romania.
In July 2007, HP announced that it had agreed to acquire Opsware for $1.65 billion in cash ($14.25 per share). The acquisition closed on September 21, 2007.
HP subsequently split into HP Inc. and Hewlett Packard Enterprise (HPE). The latter included Opsware's products and services and, in 2017, the HPE Software business group spin-merged with Micro Focus.
History
The company that was formerly known as Loudcloud was founded on September 9, 1999 (i.e., 9/9/99) by Marc Andreessen, Ben Horowitz, Tim Howes, and In Sik Rhee as a managed services provider. The company was one of the first to offer software as a service computing with an Infrastructure as a Service model. According to Wired, Loudcloud was one of the first vendors to talk about cloud computing and Software as a Service.
In June 2000, Loudcloud raised $120 million, in what was at the time the largest second round of funding. This was shortly followed by a $100 million raise by one of its competitors, Totality Corporation (at the time known as MimEcom).
After selling the operations side of the business to EDS in the summer of 2002, Loudcloud became Opsware and went to market as a technology company, offering the software that had been developed internally to support customer systems via automated server life-cycle management. In 2004, Opsware acquired asset management systems provider Tangram Enterprise Solutions, and in February 2005 acquired network device configuration management vendor Rendition Networks. In July 2006 Opsware acquired CreekPath for its Data Center Automation (DCA) product offering to add provisioning of storage components. In April 2007 Opsware acquired Seattle-based iConclude and its run-book automation software in order to integrate datacenter management from end-to-end.
In July 2007, HP announced that it had agreed to acquire Opsware for $1.65 billion in cash ($14.25 per share), sixteen times revenues. It was HP's third largest acquisition at the time behind Compaq and Mercury Interactive. HP marketed Opsware products and software as a service solutions as part of the HP Software Division.
In 2015, HP's Software division was spun off to become part of Hewlett-Packard Enterprise. Two years later in 2017, HP Software merged with UK-based Micro Focus in a spin-merge. All former Opsware tools are now grouped under the Micro Focus Hybrid Cloud Management suite.
Products
Opsware had three main systems that it marketed. The Server Automation System (SAS) was designed to provide provisioning, policy enforcement, compliance reporting, and patching of Windows, Unix and Linux servers across thousands of servers. It is now sold as HP Server |
https://en.wikipedia.org/wiki/MULTI-S01 | In cryptography, MULTI-S01 (pronounced multi-ess-zero-one), is an encryption algorithm based on a pseudorandom number generator (PRNG). MULTI-S01 is an encryption scheme preserving both confidentiality and data integrity. The scheme defines a pair of algorithms; the encryption, the corresponding decryption with verification. Coupling with an efficient keystream generator, such as Panama, MUGI, and RC4, the algorithm efficiently encrypts a message in the manner of a single path process, i.e. online algorithm. The decryption function cannot be used in such manner for keeping whole resultant data until successful verification.
The keysize of MULTI-S01 is determined by which keystream generator to use. MULTI-S01 takes a security parameter which determines the upperbound probability of successful forgery.
Since the calculation consists of addition and multiplication over the finite field, the algorithm is more suited to hardware implementation, although software implementation is still feasible.
MULTI-S01 with the PRNG Panama was among the cryptographic techniques recommended for Japanese government use by CRYPTREC in 2003, however, has been dropped to "candidate" by CRYPTREC revision in 2013. It has also been submitted to ISO/IEC 18033 Part 4 which defines stream-cipher standards.
The security of MULTI-S01 is based on that of underlying PRNG. If a secure PRNG is used, then the security of MULTI-S01 with respect to confidentiality and data integrity has been proven. As for the data integrity, the security proof is basically the same as one for Carter–Wegman MAC scheme, which is proven to be information-theoretically secure.
References
Soichi Furuya, Kouichi Sakurai, Single-path Authenticated-encryption Scheme Based on Universal Hashing, in Selected Areas in Cryptography, 9th Annual Workshop, SAC 2002, St. John's, Newfoundland, Canada, Aug. 2002, Revised Papers, ed. K. Nyberg and H. Heys, pp. 94–109, Lecture Notes in Computer Science vol. 2595, Springer-Verlag, 2002.
Soichi Furuya, Dai Watanabe, Yoichi Seto, Kazuo Takaragi, Integrity-Aware Mode of Stream Cipher, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol. E85-A no. 1, pp. 58–65, 2002.
External links
MULTI-S01 home page
Stream ciphers
Finite fields |
https://en.wikipedia.org/wiki/Turbo%20button | On IBM PC compatible computers, the turbo button selects one of two run states: the default "turbo" speed or a reduced speed closer to the Intel 8086 CPU. It was relatively common on computers using the Intel 80286, Intel 80386 and Intel 80486 processors, from the mid 1980s to mid 1990s. The name is inspired by turbocharger, a device which increases an engine's power and efficiency. When pressed, the "turbo" button is intended to let a computer run at the highest speed for which it had been designed.
Purpose
With the introduction of CPUs which ran faster than the original 4.77 MHz Intel 8088 used in the IBM Personal Computer, programs which relied on the CPU's frequency for timing were executing faster than intended. Games in particular were often rendered unplayable, due to the reduced time allowed to react to the faster game events. To restore compatibility, the "turbo" button was added. Disengaging turbo mode slows the system down to a state compatible with original 8086/8088 chips.
Switching
On most systems, turbo mode was with the button pushed in, but since the button could often be wired either way, on some systems it was the opposite. The turbo button could be linked to a turbo LED or two-digit segmented display on the system case, although in some cases, the indicated frequency (in MHz) was not a measure of the actual processor clocks, but the two "fast" and "slow" display options set by jumpers on the motherboard.
Some systems also supported keyboard combinations -- and -- for switching turbo mode on and off, such as the Packard Bell 486ES 3x3 (the 4x4 and MT models had a dedicated Turbo button). With all the 486ES models—those with and without a turbo button—the power light would show green in normal (“Turbo”) mode, and orange in Slow mode. ITT Xtra used -- to toggle.
Some keyboards had a turbo button as well, located near right Shift. Unlike the turbo button that was common on computer cases, the turbo button on the keyboards did not control the clock rate of the CPU; rather, it controlled the keyboard repeat rate.
Turbo display
The turbo display is used to display the current frequency (MHz) speed of the CPU, this is usually done by a two or three-digit digital LED display. The displayed speed can vary depending on the CPU's frequency, and the settings of the computer, however, it is not measuring the frequency of the CPU, it displays preset numbers when turbo is turned on or off, and these numbers can be changed with two (or three) banks of jumpers on the back of the display, each bank changing each digit, as their purpose is to connect LED's in the display to (or disconnect from) power. The layout of the banks can vary.
Use
The feature was relatively common on systems running 286 to 486 CPUs,
and less common on Pentium era computers. The frequency displays largely disappeared or were reprogrammed to display "HI"/"LO", "99", or were replaced with a three-digit display when CPU speeds reached 100 MHz, since most systems |
https://en.wikipedia.org/wiki/Classifier | Classifier may refer to:
Classifier (linguistics), or measure word, especially in East Asian languages
Classifier handshape, in sign languages
Classifier (UML), in software engineering
Classification rule, in statistical classification, e.g.:
Hierarchical classifier
Linear classifier
Deductive classifier
Subobject classifier, in category theory
An air classifier or similar machine for sorting materials
Classifier (machine learning)
See also
Finite-state machine#Classifiers
Classification (disambiguation)
Classified (disambiguation) |
https://en.wikipedia.org/wiki/Macintosh%20Guide | Macintosh Guide, also referred to as Apple Guide, was Apple Computer's online help and documentation system, added to the classic Mac OS in System 7.5 and intended to work alongside Balloon Help. In addition to hypertext, indexing and searching of the text, Macintosh Guide also offered a system for teaching users how to accomplish tasks in an interactive manner. However, the process of creating guides was more complicated than non-interactive help and few developers took full advantage of its power. Apple enhanced the help system with HTML-based help in Mac OS 8.5 which worked in conjunction with Macintosh Guide providing links to Macintosh Guide sequences. Macintosh Guide was not carried over into Mac OS X, which uses an HTML-based help system.
Macintosh Guide made use of the AppleEvent Object Model (AEOM), allowing the system to examine the state of the application as it ran, and change the help in response. Help content was created in individual steps, and each step could have assigned to it conditions to determine if the step should be skipped, or if the step was needed. For instance, if the user had already completed several steps of an operation and needed help to complete it, Macintosh Guide could "see" where they were, and skip forward to the proper section of the documentation. Additionally AEOM allowed Macintosh Guide to drive the interface, completing tasks for the user if they clicked on the "Do it for me" buttons (or hypertext).
A distinctive feature of the system was support for Coaching. Using the AEOM, Macintosh Guide could find UI elements on the screen, and circle them using a "red marker" effect to draw the user's eye to it.
Macintosh Guide was also somewhat integrated with Balloon Help, optionally adding hypertext to balloons that would open the right portion of the documentation based on what object the user was currently pointing at with the mouse.
Classic Mac OS
Online help
Apple Inc. services |
https://en.wikipedia.org/wiki/Mixed-data%20sampling | Econometric models involving data sampled at different frequencies are of general interest. Mixed-data sampling (MIDAS) is an econometric regression developed by Eric Ghysels with several co-authors. There is now a substantial literature on MIDAS regressions and their applications, including Ghysels, Santa-Clara and Valkanov (2006), Ghysels, Sinko and Valkanov, Andreou, Ghysels and Kourtellos (2010) and Andreou, Ghysels and Kourtellos (2013).
MIDAS Regressions
A MIDAS regression is a direct forecasting tool which can relate future low-frequency data with current and lagged high-frequency indicators, and yield different forecasting models for each forecast horizon. It can flexibly deal with data sampled at different frequencies and provide a direct forecast of the low-frequency variable. It incorporates each individual high-frequency data in the regression, which solves the problems of losing potentially useful information and including mis-specification.
A simple regression example has the independent variable appearing at a higher frequency than the dependent variable:
where y is the dependent variable, x is the regressor, m denotes the frequency – for instance if y is yearly is quarterly – is the disturbance and is a lag distribution, for instance the Beta function or the Almon Lag. For example .
The regression models can be viewed in some cases as substitutes for the Kalman filter when applied in the context of mixed frequency data. Bai, Ghysels and Wright (2013) examine the relationship between MIDAS regressions and Kalman filter state space models applied to mixed frequency data. In general, the latter involves a system of equations, whereas, in contrast, MIDAS
regressions involve a (reduced form) single equation. As a consequence, MIDAS regressions might be less efficient, but also less prone to specification errors. In cases where the MIDAS regression is only an approximation, the approximation errors tend to be small.
Machine Learning MIDAS Regressions
The MIDAS can also be used for machine learning time series and panel data nowcasting.The machine learning MIDAS regressions involve Legendre polynomials. High-dimensional mixed frequency time series regressions involve certain data structures that once taken into account should improve the performance of unrestricted estimators in small samples. These structures are represented by groups covering lagged dependent variables and groups of lags for a single (high-frequency) covariate. To that end, the machine learning MIDAS approach exploits the sparse-group LASSO (sg-LASSO) regularization that accommodates conveniently such structures. The attractive feature of the sg-LASSO estimator is that it allows us to combine effectively the approximately sparse and dense signals.
Software packages
Several software packages feature MIDAS regressions and related econometric methods. These include:
MIDAS Matlab Toolbox
midasr, R package
midasml, R package for High-Dimensional Mixed Frequ |
https://en.wikipedia.org/wiki/Xmouse | Xmouse is a system of mouse control in computer operating systems used instead of the standard selection behavior. The xmouse system automatically selects objects or activates windows after hovering the mouse over the object for a certain period of time.
Description and comparison
Xmouse is a system of mouse control used instead of the standard system of selection on computers (most notably Windows and X11, where it is an option). The behavior is similar to mouse control in X Windows. Where normal Windows and X11 mouse control uses single-click for selection and double-click to open/edit/etc, the xmouse system automatically selects objects after hovering the mouse over the object for a certain period of time (often one second). Hovering over a window makes it the active window. The context function, previously activated by double-clicking, is activated by single-clicking; double-clicking is made redundant by this system and is ignored. Operation of menus, text selection, and other features remain unchanged.
Availability
On Microsoft Windows, an Xmouse Control Panel applet was available as part of the Windows 95 PowerToys, used to configure focusing windows in the user interface by hovering. On newer Windows versions, the behavior can be configured using Tweak UI or directly from the Windows Registry. The setting is also built into Windows Vista and Windows 7 in the Ease of Access Center as "Activate a window by hovering over it with the mouse", however preventing the activated window from moving to foreground can be done by using the relevant SystemParametersInfo system calls in Windows' USER component, or by configuring the registry.
Reception
Proponents of the xmouse system claim it has many advantages over the regular system of selection. Most notably, it requires much less effort on the part of the user to use the computer, and can be considerably faster once users have adjusted to the non-standard interface.
The two main disadvantages are the selection speed and being the non-standard. Firstly, if the activated window is also configured to be drawn into foreground there must be a minimum time for the cursor to hover over a window before it is selected, or else all touched windows would be immediately in foreground and cover other windows. This lag time reduces the maximum speed that xmouse can be used at, and could lead to annoying pauses. Secondly, as it is rarely used in the world, people who get used to the xmouse system might find it hard to adjust to using other computers, and vice versa.
References
External links
X-Mouse Button Control
X-Mouse Controls
Pointing devices |
https://en.wikipedia.org/wiki/SKY%20PerfecTV%21 | is a direct broadcast satellite (DBS) service that provides satellite television, audio programming and interactive television services to households in Japan, owned by parent company SKY Perfect JSAT Corporation.
SKY PerfecTV! is also a direct broadcast satellite (DBS) service. While SKY PerfecTV! Premium Service use DVB-S and DVB-S2, SKY PerfecTV! Basic Service use ISDB-S.
See also
References
External links
Direct broadcast satellite services
Television networks in Japan
Television channels and stations established in 1994
Entertainment companies of Japan |
https://en.wikipedia.org/wiki/WPEP | WPEP ( AM) was an AM radio station licensed to Taunton, Massachusetts. WPEP's format had been full-service, offering local news and talk programming, as well as music and nationally syndicated talk. The station was last owned by the Anastos Media Group.
History
1940s
In late , Silver City Broadcasting Corp., owned by businessman John McGregor, applied for and was granted a construction permit for an AM broadcast station in Taunton. The station's callsign was originally to be WTRN, however the callsign was changed to WPEP before the station officially signed on the air December 22, 1949. When WPEP signed on, its studio was located atop the Roseland Ballroom, north of downtown Taunton. The original format is believed to have been all local programming. WPEP was a daytime-only station from to . This meant that WPEP was required to cease transmitting from sunset to sunrise. WPEP's transmitter site was 760 County Street in Taunton, Massachusetts.
1970s
On November 27, 1970, WPEP received pre-sunrise authority, allowing it to sign on at with a power of , which could be upped to the full kilowatt at sunrise (during months when sunrise occurs later than ). News Director at the time was John P. Shaw.
1980s
Daytime-only status lasted until September 1, 1986 when WPEP was granted nighttime authorization, which allowed WPEP to transmit of power.
1990s
WPEP was sold in by Silver City Broadcasting to J. Keating Willcox's Willow Farm Broadcasting.
2000s
This would be the final calendar decade of WPEP's existence. WPEP was sold to Anastos Media Group in . Paul Giammarco was named general manager in until he left for WSAR in . After Giammarco left, staffer A.J. Nicholson was promoted to general manager.
In , WPEP added the Boston Red Sox Radio Network and carried the team's first World Series victory heard on radio. It was an affiliate in as well but station management had changed that March and didn't air games. A May 5, 2005 article in the Taunton Daily Gazette said that the station was in jeopardy because WNSH in Beverly, Massachusetts got approval from the Federal Communications Commission (FCC) to increase their daytime power. WNSH was owned by former WPEP owner J. Keating Wilcox. When Wilcox sold WPEP to Anastos Media, there was an informal agreement that Anastos Media would turn in the station's license to allow WNSH (on the same frequency) to up their power, contingent on the power increase being granted by the FCC. The city's mayor and U.S. Representative filed objections; however, the station's general manager at the time publicly dismissed the possibility the station may go dark. On December 5, 2005, Anastos Media filed a renewal of the WPEP license. The renewal was granted by the FCC on March 28, 2006. WPEP's license was turned in to the FCC on October 18, 2007.
Auxiliary licenses
KRN297: a Remote pickup unit (RPU) on /.
WLI832: a Studio-transmitter link (STL) on .
Status
Station license deleted.
See also
Taunton, Massachusetts
Refe |
https://en.wikipedia.org/wiki/Blitz%20Research | Blitz Research Ltd is an Auckland, New Zealandbased company which currently produces three BASIC based programming languages. Founded in 2000 by Mark Sibly, the company's first product was the now obsolete Blitz BASIC 2D, a PC version of the Amiga Blitz Basic. It was released the same year as the company's foundation. In 2001, Blitz3D was released. This allowed programmers to create 3D games and applications in Blitz Basic using DirectX.
In 2003, Blitz Basic 2D was rendered obsolete by the more recent BlitzPlus. BlitzPlus built on the foundations of Blitz Basic 2D and also allowed programmers to create true Microsoft Windows programs as well as games.
In December 2004, Blitz Research released the BlitzMax programming language for Mac OS X, Windows, and Linux. Unlike all the other Blitz programming languages, BlitzMax can use either OpenGL or DirectX.
In 2011, Blitz Research released the programing language Monkey along with Monkey X, a game engine producing C++, C#, Java, JavaScript, and ActionScript code, among other languages. In May 2015 Monkey 2 was announced.
Blitz Research also produced the Maplet modelling tool, which is now no longer supported.
References
External links
Blitz Research subsite on itch.io (BlitzPlus, Blitz 3D, Monkey X, Monkey 2)
Monkey X subsite (open source)
Monkey 2 subsite
blitz-research (Mark Sibly) on GitHub (BlitzPlus, BlitzMax, Blitz3D, Monkey, BlitzMax, Blitz3D for MSVC-CE 2017)
Blitz Research website (archived 3 June 2017)
Monkey X website (archived 15 July 2017)
BASIC programming language
Software companies of New Zealand |
https://en.wikipedia.org/wiki/Digital%20terrestrial%20television%20in%20the%20United%20Kingdom | Digital terrestrial television in the United Kingdom encompasses over 100 television, radio and interactive services broadcast via the United Kingdom's terrestrial television network and receivable with a standard television set. The majority of digital terrestrial television (DTT) services, including the five former analogue channels, are broadcast free-to-air, and a further selection of encrypted pay TV services (such as Racing TV) are also available.
Freeview is the only DTT service since Top Up TV closed in 2013. BT TV services are carried via IPTV signals.
The digital broadcasting technology adopted in the UK is the DVB-T system (Digital Video Broadcasting – Terrestrial) carrying compressed digital audio, video and other data in a combined transport stream, using modulation. A total of eight national and one local 'multiplexes' are broadcast in the UK, guaranteed to reach over 90% of the country. Three of the multiplexes, carrying the free public service channels operated by the BBC, ITV, Channel 4, S4C and Channel 5, are guaranteed wider coverage still, reaching 98.5% of the country including areas dependent on low-power local relays.
In the UK, the switchover from analogue to digital TV started on 17 October 2007 and was completed on 24 October 2012. Each group of regional transmitters had its analogue broadcasts switched off at a certain point between those dates.
Receiving and recording
Digital Terrestrial Television is commonly received by means of a compatible set-top box or integrated digital television (IDTV), connected to an appropriate receiving antenna. In most cases, reception is possible using aerials originally used for analogue television.
Transmissions may be recorded in many ways – such as via the connection of a set-top-box to an existing 'analogue' video or DVD recorder, or by the use of newer models of such recorders which have built-in digital tuners. However, the most common option is by the use of set-top-boxes which incorporate a hard disk drive, and allow the recording of the digital signal directly to disk, for later replay. Recording on such boxes, known as Personal Video Recorders or PVRs, is more convenient, as programmes may be easily selected for recording from an on-screen programme guide, with no need to specify explicit start and end times for recordings, and no need to program more than one piece of equipment.
Many television services which incorporate DTT channels in their service offering – e.g. Top Up TV, BT TV, and TalkTalk Plus TV, offer set top boxes with such a recording facility. Non-subscription DTT PVRs are also available and are often sold under the 'Freeview+' banner (formerly Freeview Playback.)
There also exist a variety of solutions to enable the viewing and recording of DTT programmes on personal computers, with various TV cards or USB tuners available for use with a variety of software packages, including MythTV and Windows Media Center. Most cards or tuners include their own softwa |
https://en.wikipedia.org/wiki/GPT | GPT may refer to:
Computing
Generative pre-trained transformer, a type of artificial intelligence language model
ChatGPT, a chatbot developed by OpenAI, based on generative pre-trained transformer technology
GUID Partition Table, a disk partitioning standard
Biology
Alanine transaminase or glutamate pyruvate transaminase
Goniopora toxin
UDP-N-acetylglucosamine—undecaprenyl-phosphate N-acetylglucosaminephosphotransferase
Companies
GEC Plessey Telecommunications, a defunct British telecommunications manufacturer
GPT Group, an Australian property investment company
Other uses
Gulfport–Biloxi International Airport, in Mississippi
General-purpose technology, in economics
Generalized probabilistic theory, a framework to describe the features of physical theories
Grounded practical theory, a social science theory |
https://en.wikipedia.org/wiki/KYFQ | KYFQ (91.7 MHz) is a non-commercial FM radio station licensed to Tacoma, Washington, and serving the Seattle-Tacoma radio market. The station is owned by Bible Broadcasting Network, Inc. It airs a Christian talk and teaching radio format.
National religious leaders heard on KYFQ include Chuck Swindoll, Adrian Rogers and Joni Eareckson Tada. Some news and programming is provided by the Salem Radio Network (SRN).
History
Tacoma School District
In 1949, the station first signed on as KTOY. It was owned by the Tacoma School District and had its studios at its vocational school, which became Bates Technical College in 1991. During the day it was operated by Bates broadcasting students studying under former KJR DJ Lee Perkins. It was powered at 3,500 watts, enough to cover Tacoma and adjacent communities but not the larger Seattle radio market.
From 1978 to 1984, KTOY aired educational programs during the day, with Top 40 hits in the afternoon and evening. Starting at midnight on Friday and lasting until 6:00 p.m. Sunday, KTOY broadcast hip hop music and urban contemporary under the slogan "Giving You The Music of Tomorrow, Today." During 1983-1984, the late night hip-hop program's slogan was "R&B's best in the Pacific Northwest." By 1985, the urban format was no longer the entire weekend.
In the 1980s, the power was increased to 7,900 watts. The station changed its call sign to KTPS-FM for Tacoma Park Schools, in 1986. Then in 1992, the call letters were switched to KBTC for Bates Technical College. The station only played hip-hop and urban music on Sunday for two hours in the form of a top 20 countdown.
Public Radio Capital
KBTC was sold to Public Radio Capital, which then leased the frequency to the University of Washington's college station, 90.3 KEXP. KEXP wanted to extend its signal into the South Sound. So it simulcast its regular alternative rock programming on 91.7, changing its call letters to KXOT.
On November 3, 2005, KEXP announced it was terminating operation on KXOT at the end of the calendar year due to a financial crunch. However, KEXP continued to simulcast on KXOT into 2006 while Public Radio Capital decided what to do with 91.7. On May 24, 2006, NPR network affiliate 94.9 KUOW-FM announced it signed a new lease with PRC. KXOT returned to the air, run by KUOW-FM, but airing alternate programming as KUOW-2, in August 2006.
On May 15, 2012, PRC announced that it would drop its KUOW-2 programming on 91.7 on June 29. However, this was delayed until July 2. The station went silent at midnight on that day, as the station was awaiting a new programming provider.
On January 7, 2013, the station returned to the air, from a new transmitter site on Gold Mountain, coupled with an increase in power to 23,000 watts. The station aired the audio from Washington State's public affairs government television channel TVW.
Bible Broadcasting Network
The Bible Broadcasting Network announced on February 4, 2015, that it would purch |
https://en.wikipedia.org/wiki/30th%20Daytime%20Emmy%20Awards | The 30th Daytime Emmy Awards ceremony, commemorating excellence in American daytime programming from 2002, was held on May 16, 2003 at Radio City Music Hall in New York City. Hosted by Wayne Brady, it was televised in the United States by ABC.
Creative Arts Emmy Awards were presented on May 10, 2003.
Nominations and winners
The following is a partial list of nominees, with winners in bold:
Outstanding Drama Series
As the World Turns
The Bold and the Beautiful
Port Charles
The Young and the Restless
Outstanding Lead Actor in a Drama Series
Grant Aleksander (Phillip Spaulding, Guiding Light)
Maurice Benard (Sonny Corinthos, General Hospital)
Doug Davidson (Paul Williams, The Young and the Restless)
Anthony Geary (Luke Spencer, General Hospital)
Ricky Paull Goldin (Gus Aitoro, Guiding Light)
Thorsten Kaye (Ian Thornhart, Port Charles)
Outstanding Lead Actress in a Drama Series
Eileen Davidson (Ashley Abbott Carlton, The Young and the Restless)
Susan Flannery (Stephanie Forrester, The Bold and the Beautiful)
Nancy Lee Grahn (Alexis Davis, General Hospital)
Michelle Stafford (Phyllis Summers Abbott, The Young and the Restless)
Kim Zimmer (Reva Shayne Lewis, Guiding Light)
Outstanding Supporting Actor in a Drama Series
Josh Duhamel (Leo du Pres, All My Children)
Benjamin Hendrickson (Hal Munson, As the World Turns)
Christian LeBlanc (Michael Baldwin, The Young and the Restless)
Ron Raines (Alan Spaulding, Guiding Light)
Paul Anthony Stewart (Danny Santos, Guiding Light)
Outstanding Supporting Actress in a Drama Series
Rebecca Budig (Greenlee Smythe, All My Children)
Robin Christopher (Skye Chandler, General Hospital)
Linda Dano (Rae Cummings, One Life to Live)
Vanessa Marcil (Brenda Barrett, General Hospital)
Cady McClain (Rosanna Cabot Montgomery, As the World Turns)
Kelly Monaco (Livvie Locke/Tess Ramsey, Port Charles)
Outstanding Younger Actor in a Drama Series
Chad Brannon (Zander Smith, General Hospital)
David Lago (Raul Guittierez, The Young and the Restless)
Kyle Lowder (Brady Black, Days of Our Lives)
Aiden Turner (Aidan Devane, All My Children)
Jordi Vilasuso (Tony Santos, Guiding Light)
Outstanding Younger Actress in a Drama Series
Jennifer Finnigan (Bridget Forrester, The Bold and the Beautiful)
Adrienne Frantz (Amber Moore, The Bold and the Beautiful)
Lindsey McKeon (Marah Lewis, Guiding Light)
Erin Hershey Presley (Alison Barrington, Port Charles)
Alicia Leigh Willis (Courtney Matthews, General Hospital)
Outstanding Drama Series Writing Team
All My Children
As the World Turns
The Bold and the Beautiful
General Hospital
Guiding Light
Passions
The Young and the Restless
Outstanding Drama Series Directing Team
All My Children
As the World Turns
Days of Our Lives
Passions
Outstanding Game/Audience Participation Show
Hollywood Squares
Jeopardy!
The Price is Right
Wheel of Fortune
Win Ben Stein's Money
Outstanding Game Show Host
Tom Bergeron, Hollywood Squares
Bob Barker, The Price is Right
Donny Osmond, Pyramid
Pat Sajak, Wheel of |
https://en.wikipedia.org/wiki/HardBall%21 | HardBall! is a baseball video game published by Accolade. Initially released for the Commodore 64 in 1985, it was ported to other computers over the next several years. A Sega Genesis cartridge was published in 1991. HardBall! was followed by sequels HardBall II, HardBall III, HardBall IV, HardBall 5, and HardBall 6.
Gameplay
Play is controlled with a joystick or arrow keys and an action button. One of the four cardinal directions is used to choose the pitch, and again to aim it towards low, high, inside (towards batter), or outside (away from batter). The same directions are used to aim the swing when batting. When fielding after a hit, the defensive player closest to the ball will flash to show it is the one currently under control. The four directions are then used to throw to one of the four bases.
Hardball! was one of the first baseball video games to incorporate the perspective from the pitcher's mound, similar to MLB broadcasts. There are also managerial options available. The player has a selection of pitchers to choose from. Each team member has his own statistics that affect his performance, and can be rearranged as desired. Prior to HardBall!s release, there were managerial baseball games available, such as MicroLeague Baseball but HardBall! was the first to integrate that aspect with the arcade control of the game action itself.
Reception
Hardball! was a commercial blockbuster. The Commodore 64 topped the UK sales chart in March 1986. It went on to become Accolade's best-selling Commodore game as of late 1987, and by 1989 had surpassed 500,000 units sold.
Info rated Hardball! four-plus stars out of five, stating that it "is easily the best baseball simulation we have seen to date for the 64/128" and praising its graphics. ANALOG Computing praised the Atari 8-bit version's gameplay, graphic, and animation, only criticizing the computer opponent's low difficulty level. The magazine concluded that the game "is in a league of its own, above all other Atari sports games—simulations included".
In an overview of statistics-oriented baseball games, Computer Gaming World stated that Hardball "would probably be disappointing to anyone other than an avid arcade fan". Compute!'s Apple Applications stated that the Apple II and Macintosh versions had "almost everything you could want from a baseball simulation", with good support for playing as manager, player, or statistician and "exceptionally clear and precise graphics". The magazine concluded that "Hardballs realism is outstanding—at a level unmatched by other baseball software to date". The game was reviewed in 1988 in Dragon #132 by Hartley, Patricia, and Kirk Lesser in "The Role of Computers" column. The reviewers gave the game 5 out of 5 stars. MegaTech gave the genesis version a score of 75% writing: "A decent baseball game which doesn’t have enough novel or interesting features to make it appeal to anyone other then real fans of the sport."
Entertainment Weekly picked the game as |
https://en.wikipedia.org/wiki/Shibboleth%20%28software%29 | Shibboleth is a single sign-on log-in system for computer networks and the Internet. It allows people to sign in using just one identity to various systems run by federations of different organizations or institutions. The federations are often universities or public service organizations.
The Shibboleth Internet2 middleware initiative created an architecture and open-source implementation for identity management and federated identity-based authentication and authorization (or access control) infrastructure based on Security Assertion Markup Language (SAML). Federated identity allows the sharing of information about users from one security domain to the other organizations in a federation. This allows for cross-domain single sign-on and removes the need for content providers to maintain usernames and passwords. Identity providers (IdPs) supply user information, while service providers (SPs) consume this information and give access to secure content.
History
The Shibboleth project grew out of Internet2. Today, the project is managed by the Shibboleth Consortium. Two of the most popular software components managed by the Shibboleth Consortium are the Shibboleth Identity Provider and the Shibboleth Service Provider, both of which are implementations of SAML.
The project was named after an identifying passphrase used in the Bible (Judges ) because Ephraimites were not able to pronounce "sh".
The Shibboleth project was started in 2000 to facilitate the sharing of resources between organizations with incompatible authentication and authorization infrastructures. Architectural work was performed for over a year prior to any software development. After development and testing, Shibboleth IdP 1.0 was released in July 2003. This was followed by the release of Shibboleth IdP 1.3 in August 2005.
Version 2.0 of the Shibboleth software was a major upgrade released in March 2008. It included both IdP and SP components, but, more importantly, Shibboleth 2.0 supported SAML 2.0.
The Shibboleth and SAML protocols were developed during the same timeframe. From the beginning, Shibboleth was based on SAML, but, where SAML was found lacking, Shibboleth improvised, and the Shibboleth developers implemented features that compensated for missing features in SAML 1.1. Some of these features were later incorporated into SAML 2.0, and, in that sense, Shibboleth contributed to the evolution of the SAML protocol.
Perhaps the most important contributed feature was the legacy Shibboleth AuthnRequest protocol. Since the SAML 1.1 protocol was inherently an IdP-first protocol, Shibboleth invented a simple HTTP-based authentication request protocol that turned SAML 1.1 into an SP-first protocol. This protocol was first implemented in Shibboleth IdP 1.0 and later refined in Shibboleth IdP 1.3.
Building on that early work, the Liberty Alliance introduced a fully expanded AuthnRequest protocol into the Liberty Identity Federation Framework. Eventually, Liberty ID-FF 1.2 was co |
https://en.wikipedia.org/wiki/TerraLib | TerraLib is an open-source geographic information system (GIS) software library. It extends object-relational database management systems (DBMS) to handle spatiotemporal data types.
Using TerraLib, the TerraView open-source GIS was developed, which provides functions for data conversion, visualization, exploratory spatial data analysis, spatial statistical modelling and spatial and non-spatial queries.
Another application is TerraAmazon, Brazil's national database for monitoring deforestation in the Amazon Rainforest. It handles more than 2 million complex polygons and 60 GB of remote sensing images.
Design and development
The library supports different DBMS, including MySQL, PostgreSQL, and Oracle. Its vector data model is upwards compliant with Open Geospatial Consortium (OGC) standards. TerraLib supports the development of geographical applications using spatial databases.
The design goal for TerraLib is to support large-scale applications using socioeconomic and environmental data. It handles spatiotemporal data types (events, moving objects, cell spaces, modifiable objects) and allows spatial, temporal and attribute queries on the database. TerraLib supports dynamic modelling in generalized cell spaces and has a dynamic link with the R programming language for statistical analysis. It handles large image data sets. TerraLib is implemented as a library of C++ classes and functions, written in ANSI-C++, and has programming interfaces in Java and Visual Basic.
TerraLib has a core development team based in Brazil. The team includes the Image Processing Division of Brazil's National Institute for Space Research (INPE), and the Computer Graphics Technology Group of the Pontifical Catholic University of Rio de Janeiro (PUC-Rio). TerraLib is licensed as open-source according to the GNU Lesser General Public License (LGPL).
TerraView
TerraView is a GIS application built on the TerraLib GIS library. TerraView handles vector data (polygons, lines, points) and raster data (grids and images), both of them stored in a relational or geo-relational database, including ACCESS, PostgreSQL, MySQL and Oracle Spatial. TerraView has a visualization interface that allows attribute and spatial queries on object in geographical database. The interface allows different views on the database, producing thematic maps with different types of legends.
TerraView is able to manage raster data in geographical database and allows the visualization and manipulation of raster data together with vector data. Raster data can be shared in different formats such as GeoTIFF, TIFF, JPEG, RAW, ASCII-Grid or ASCIISpring.
TerraView supports vector operations including intersection and buffer maps. It also has statistical analysis functions: local and global autocorrelation indexes, semivariograms, and regionalisation.
TerraView is free software distributed under the GPL license and is available on the Internet.
TerraAmazon
TerraAmazon is a free GIS software developed by Br |
https://en.wikipedia.org/wiki/Michael%20I.%20Jordan | Michael Irwin Jordan (born February 25, 1956) is an American scientist, professor at the University of California, Berkeley and researcher in machine learning, statistics, and artificial intelligence.
Jordan was elected a member of the National Academy of Engineering in 2010 for contributions to the foundations and applications of machine learning.
He is one of the leading figures in machine learning, and in 2016 Science reported him as the world's most influential computer scientist.
In 2022, Jordan won the inaugural World Laureates Association Prize in Computer Science or Mathematics, "for fundamental contributions to the foundations of machine learning and its application."
Education
Jordan received his BS magna cum laude in Psychology in 1978 from the Louisiana State University, his MS in Mathematics in 1980 from Arizona State University and his PhD in Cognitive Science in 1985 from the University of California, San Diego. At the University of California, San Diego, Jordan was a student of David Rumelhart and a member of the Parallel Distributed Processing (PDP) Group in the 1980s.
Career and research
Jordan is the Pehong Chen Distinguished Professor at the University of California, Berkeley, where his appointment is split across EECS and Statistics. He was a professor at the Department of Brain and Cognitive Sciences at MIT from 1988 to 1998.
In the 1980s Jordan started developing recurrent neural networks as a cognitive model. In recent years, his work is less driven from a cognitive perspective and more from the background of traditional statistics.
Jordan popularised Bayesian networks in the machine learning community and is known for pointing out links between machine learning and statistics. He was also prominent in the formalisation of variational methods for approximate inference and the popularisation of the expectation–maximization algorithm in machine learning.
Resignation from Machine Learning
In 2001, Jordan and others resigned from the editorial board of the journal Machine Learning. In a public letter, they argued for less restrictive access and pledged support for a new open access journal, the Journal of Machine Learning Research, which was created by Leslie Kaelbling to support the evolution of the field of machine learning.
Honors and awards
Jordan has received numerous awards, including a best student paper award (with X. Nguyen and M. Wainwright) at the International Conference on Machine Learning (ICML 2004), a best paper award (with R. Jacobs) at the American Control Conference (ACC 1991), the ACM-AAAI Allen Newell Award, the IEEE Neural Networks Pioneer Award, and an NSF Presidential Young Investigator Award. In 2002 he was named an AAAI Fellow "for significant contributions to reasoning under uncertainty, machine learning, and human motor control." In 2004 he was named an IMS Fellow "for contributions to graphical models and machine learning." In 2005 he was named an IEEE Fellow "for contributions to proba |
https://en.wikipedia.org/wiki/DBT%20Online%20Inc. | DBT Online Inc., formerly known as Database Technologies, is a data mining company founded by Roy Brubaker and Hank Asher in 1992 in Las Vegas, Nevada, USA. It is today a subsidiary of US data aggregation group, ChoicePoint.
DBT Online was formed as a public holding company by the merger of Database Technologies and Patlex in 1996.
DBT Online bought Asher out for US$147 million in 1999. This followed the FBI and the Drug Enforcement Administration suspending their contracts with DBT Online following revelations that Asher had been involved but not charged with drug dealing in the Bahamas. The agencies were also concerned that DBT Online could potentially monitor targets of investigations.
Asher blamed the ouster on fellow company director Kenneth Langone.
In early 2000 soon after Hank Asher's departure, DBT won a $4 million contract with the state of Florida that would mire it in the Florida Election Controversy in the 2000 US presidential elections.
DBT competes with Seisint, a company founded by Asher on his departure from Database Technologies. Seisint was sold to LexisNexis in 2004 for $775 million.
References
External links
When maverick cyber-pioneer Hank Asher invented MATRIX, Vanity Fair, December 2004, loaded 14 March 2007
State contracts with company founded by man linked to smuggling, Naples Daily News, 3 August 2003, loaded 2 April 200
Companies based in Spring Valley, Nevada |
https://en.wikipedia.org/wiki/Multiuser%20DOS | Multiuser DOS is a real-time multi-user multi-tasking operating system for IBM PC-compatible microcomputers.
An evolution of the older Concurrent CP/M-86, Concurrent DOS and Concurrent DOS 386 operating systems, it was originally developed by Digital Research and acquired and further developed by Novell in 1991. Its ancestry lies in the earlier Digital Research 8-bit operating systems CP/M and MP/M, and the 16-bit single-tasking CP/M-86 which evolved from CP/M.
When Novell abandoned Multiuser DOS in 1992, the three master value-added resellers (VARs) DataPac Australasia, Concurrent Controls and Intelligent Micro Software were allowed to take over and continued independent development into Datapac Multiuser DOS and System Manager, CCI Multiuser DOS, and IMS Multiuser DOS and REAL/32.
The FlexOS line, which evolved from Concurrent DOS 286 and Concurrent DOS 68K, was sold off to Integrated Systems, Inc. (ISI) in July 1994.
Concurrent CP/M-86
The initial version of CP/M-86 1.0 (with BDOS 2.x) was adapted and became available to the IBM PC in 1982. It was commercially unsuccessful as IBM's PC DOS 1.0 offered much the same facilities for a considerably lower price. Neither PC DOS nor CP/M-86 could fully exploit the power and capabilities of the new 16-bit machine.
It was soon supplemented by an implementation of CP/M's multitasking 'big brother', MP/M-86 2.0, since September 1981. This turned a PC into a multiuser machine capable of supporting multiple concurrent users using dumb terminals attached by serial ports. The environment presented to each user made it seem as if they had the entire computer to themselves. Since terminals cost a fraction of the then-substantial price of a complete PC, this offered considerable cost savings, as well as facilitating multi-user applications such as accounts or stock control in a time when PC networks were rare, very expensive and difficult to implement.
CP/M-86 1.1 (with BDOS 2.2) and MP/M-86 2.1 were merged to create Concurrent CP/M-86 3.0 (also known as CCP/M-86) with BDOS 3.0 in late 1982. Kathryn Strutynski, the project manager for CP/M-86, was also the project manager for Concurrent CP/M-86. One of its designers was Francis "Frank" R. Holsworth. Initially, this was a single-user operating system supporting true multi-tasking of up to four (in its default configuration) CP/M-86 compatible programs. Like its predecessors it could be configured for multi-processor support (see e.g. Concurrent CP/M-86/80) and also added "virtual screens" letting an operator switch between the interactions of multiple programs. Later versions supported dumb terminals and so could be deployed as multiuser systems. Concurrent CP/M-86 3.1 (BDOS 3.1) shipped on 21 February 1984.
Adaptations
Concurrent CP/M-86 with Windows
In February 1984 Digital Research also offered a version of Concurrent CP/M-86 with windowing capabilities named Concurrent CP/M with Windows for the IBM Personal Computer and Personal Computer XT.
Concurr |
https://en.wikipedia.org/wiki/LRS | LRS may refer to:
Science and technology
Lactated Ringer's solution, used for intravenous administration
Learning Record Store, a data store system
Linear recursive sequence, a recurrence relation used in mathematics
Linear reference system, a method of spatial referencing along a line
Limited Rate Support, a Wi-Fi mode; see IEEE 802.11g-2003
Organisations
Levi, Ray & Shoup, a business consulting firm
(Lithuanian Russian Union), a political party in Lithuania
Liverpool Reform Synagogue, a Reform Jewish synagogue in Liverpool, England
London River Services, a division of Transport for London
Long-range surveillance, a unit of the United States Army
Other uses
, a Venezuelan broadcasting law
Leros Municipal Airport (IATA code), on an island of Greece
Location Referencing System, used for state-owned roads in Pennsylvania, US
LRS (TV station) |
https://en.wikipedia.org/wiki/Convergence%20%28evolutionary%20computing%29 | Convergence within the field of computer science, is a phenomenon in evolutionary computation. It causes evolution to halt because precisely every individual in the population is identical.
Full convergence might be seen in genetic algorithms (a type of evolutionary computation) using only crossover (a way of combining individuals to make new offspring). Premature convergence is when a population has converged to a single solution, but that solution is not as high of quality as expected, i.e. the population has gotten 'stuck'. However, convergence is not necessarily a negative thing, because populations often stabilise after a time, in the sense that the best programs all have a common ancestor and their behaviour is very similar (or identical) both to each other and to that of high fitness programs from the previous generations. Often the term convergence is loosely used. Convergence can be avoided with a variety of diversity-generating techniques.
References
External links
Foundations of Genetic Programming
Evolutionary computation |
https://en.wikipedia.org/wiki/Defining%20length | In genetic algorithms and genetic programming defining length L(H) is the maximum distance between two defining symbols (that is symbols that have a fixed value as opposed to symbols that can take any value, commonly denoted as # or *) in schema H. In tree GP schemata, L(H) is the number of links in the minimum tree fragment including all the non-= symbols within a schema H.
Example
Schemata "00##0", "1###1", "01###", and "##0##" have defining lengths of 4, 4, 1, and 0, respectively. Lengths are computed by determining the last fixed position and subtracting from it the first fixed position.
In genetic algorithms as the defining length of a solution increases so does the susceptibility of the solution to disruption due to mutation or cross-over.
References
Genetic algorithms |
https://en.wikipedia.org/wiki/C.%20J.%20van%20Rijsbergen | C. J. "Keith" van Rijsbergen FREng (Cornelis Joost van Rijsbergen; born 1943) is a professor of computer science at the University of Glasgow, where he founded the Glasgow Information Retrieval Group. He is one of the founders of modern Information Retrieval and the author of the seminal monograph Information Retrieval and of the textbook The Geometry of Information Retrieval.
He was born in Rotterdam, and educated in the Netherlands, Indonesia, Namibia and Australia.
His first degree is in mathematics from the University of Western Australia, and in 1972 he completed a
PhD in computer science at the University of Cambridge. He spent three years lecturing in information retrieval and artificial intelligence at Monash University before returning to Cambridge to hold a Royal Society Information Research Fellowship.
In 1980 he was appointed to the chair of computer science at University College Dublin; from there he moved in 1986 to Glasgow University. He chaired the Scientific Board of the Information Retrieval Facility from 2007 to 2012.
Awards and honors
In 2003 he was inducted as a Fellow of the Association for Computing Machinery. In 2004 he was awarded the Tony Kent Strix award.
In 2004 he was appointed a Fellow of the Royal Academy of Engineering. In 2006, he was awarded the Gerard Salton Award for Quantum haystacks. In 2009, he was made an honorary professor at the University of Edinburgh.
See also
F1 score
References
External links
C. J. "Keith" van Rijsbergen - The University of Glasgow
Glasgow Information Retrieval Group
Information Retrieval book - C. J. van Rijsbergen 1979
Information Retrieval Facility
Interviewed by Alan Macfarlane 15 July 2009 (video)
1943 births
Living people
Dutch computer scientists
Fellows of the Association for Computing Machinery
Scientists from Rotterdam
University of Western Australia alumni
Information retrieval researchers |
https://en.wikipedia.org/wiki/Training%2C%20validation%2C%20and%20test%20data%20sets | In machine learning, a common task is the study and construction of algorithms that can learn from and make predictions on data. Such algorithms function by making data-driven predictions or decisions, through building a mathematical model from input data. These input data used to build the model are usually divided into multiple data sets. In particular, three data sets are commonly used in different stages of the creation of the model: training, validation, and test sets.
The model is initially fit on a training data set, which is a set of examples used to fit the parameters (e.g. weights of connections between neurons in artificial neural networks) of the model. The model (e.g. a naive Bayes classifier) is trained on the training data set using a supervised learning method, for example using optimization methods such as gradient descent or stochastic gradient descent. In practice, the training data set often consists of pairs of an input vector (or scalar) and the corresponding output vector (or scalar), where the answer key is commonly denoted as the target (or label). The current model is run with the training data set and produces a result, which is then compared with the target, for each input vector in the training data set. Based on the result of the comparison and the specific learning algorithm being used, the parameters of the model are adjusted. The model fitting can include both variable selection and parameter estimation.
Successively, the fitted model is used to predict the responses for the observations in a second data set called the validation data set. The validation data set provides an unbiased evaluation of a model fit on the training data set while tuning the model's hyperparameters (e.g. the number of hidden units—layers and layer widths—in a neural network). Validation datasets can be used for regularization by early stopping (stopping training when the error on the validation data set increases, as this is a sign of over-fitting to the training data set).
This simple procedure is complicated in practice by the fact that the validation dataset's error may fluctuate during training, producing multiple local minima. This complication has led to the creation of many ad-hoc rules for deciding when over-fitting has truly begun.
Finally, the test data set is a data set used to provide an unbiased evaluation of a final model fit on the training data set. If the data in the test data set has never been used in training (for example in cross-validation), the test data set is also called a holdout data set. The term "validation set" is sometimes used instead of "test set" in some literature (e.g., if the original data set was partitioned into only two subsets, the test set might be referred to as the validation set).
Deciding the sizes and strategies for data set division in training, test and validation sets is very dependent on the problem and data available.
Training data set
A training data set is a data set of examples |
https://en.wikipedia.org/wiki/AlaskaOne | AlaskaOne (or Alaska One) was a Public Broadcasting Service (PBS) member network of public television stations based in Fairbanks, Alaska from 1995 to 2012. It served communities in Alaska outside Anchorage. It was operated by the University of Alaska Fairbanks.
It comprised five stations:
KUAC-TV channel 9 (Fairbanks)
KTOO-TV channel 3 (Juneau)
KMXT-LP channel 9 (Kodiak)
KYUK-LD channel 15 (Bethel)
KIAL-LP/KUCB-LP channel 8 Unalaska (licensed station operated by KUCB radio) (Licensed in Dutch Harbor)
KUAC-TV was the flagship station. The other four stations were locally owned, and occasionally broke off from the main AlaskaOne feed to air local programming. KUAC's massive translator network in the Alaska Interior aired the full network schedule.
KYUK-TV originally aired on full-power channel 4 in Bethel, but reportedly ceased operation and had its license deleted by the FCC on March 20, 2009. According to KYUK's website, in 2004 its signal was moved to low-power K15AV. However, it renamed the low-powered TV station as KYUK-LP (now KYUK-LD).
KUAC-TV signed on in 1971 as the first public television station in Alaska. KYUK followed in 1972, with KTOO coming online in 1978. The three stations merged into the AlaskaOne network in 1995.
Some AlaskaOne programs were also seen on Alaska's omnibus network, the Alaska Rural Communications Service, which is partially owned by AlaskaOne.
The organization also operates a radio network, which uses material from National Public Radio, American Public Media, Public Radio International, the Alaska Public Radio Network, and CoastAlaska.
In November 2011, AlaskaOne's corporate entity, Alaska Public Broadcasting Service, voted to transfer the network's operations from KUAC-TV to KAKM effective July 1, 2012. Claiming that this arrangement would do financial harm to KUAC, UAF announced on December 8 that KUAC-TV would leave AlaskaOne and revert to being a separate station at that time. On July 1, KUAC-TV officially relaunched as a separate station, while KTOO-TV and KYUK merged with KAKM to form Alaska Public Television.
Stations
KUCB-LP, channel 8, is a low-powered station operating at 10 watts. Further information about the station is unavailable.
References
External links
AlaskaOne
KUAC-TV
KTOO-TV
KMXT
KYUK
YouTubeInaugural broadcast of KUAC-TV on December 22, 1971, including introductory comments from University of Alaska president William Ransom Wood
1995 establishments in Alaska
2012 disestablishments in Alaska
PBS member networks
Television channels and stations disestablished in 2012
Television channels and stations established in 1995
Television stations in Alaska
Defunct mass media in Alaska
Defunct television stations in the United States |
https://en.wikipedia.org/wiki/Mating%20pool | A mating pool is a concept used in evolutionary computation, which refers to a family of algorithms used to solve optimization and search problems.
The mating pool is formed by candidate solutions that the selection operators deem to have the highest fitness in the current population. Solutions that are included in the mating pool are referred to as parents. Individual solutions can be repeatedly included in the mating pool, with individuals of higher fitness values having a higher chance of being included multiple times. Crossover operators are then applied to the parents, resulting in recombination of genes recognized as superior. Lastly, random changes in the genes are introduced through mutation operators, increasing the genetic variation in the gene pool. Those two operators improve the chance of creating new, superior solutions. A new generation of solutions is thereby created, the children, who will constitute the next population. Depending on the selection method, the total number of parents in the mating pool can be different to the size of the initial population, resulting in a new population that’s smaller. To continue the algorithm with an equally sized population, random individuals from the old populations can be chosen and added to the new population.
At this point, the fitness value of the new solutions is evaluated. If the termination conditions are fulfilled, processes come to an end. Otherwise, they are repeated.
The repetition of the steps result in candidate solutions that evolve towards the most optimal solution over time. The genes will become increasingly uniform towards the most optimal gene, a process called convergence. If 95% of the population share the same version of a gene, the gene has converged. When all the individual fitness values have reached the value of the best individual, i.e. all the genes have converged, population convergence is achieved.
Mating pool creation
Several methods can be applied to create a mating pool. All of these processes involve the selective breeding of a particular number of individuals within a population. There are multiple criteria that can be employed to determine which individuals make it into the mating pool and which are left behind. The selection methods can be split into three general types: fitness proportionate selection, ordinal based selection and threshold based selection.
Fitness proportionate selection
In the case of fitness proportionate selection, random individuals are selected to enter the pool. However, the ones with a higher level of fitness are more likely to be picked and therefore have a greater chance of passing on their features to the next generation.
One of the techniques used in this type of parental selection is the roulette wheel selection. This approach divides a hypothetical circular wheel into different slots, the size of which is equal to the fitness values of each potential candidate. Afterwards, the wheel is rotated and a fixed point dete |
https://en.wikipedia.org/wiki/Parity%20benchmark | Parity problems are widely used as benchmark problems in genetic programming but inherited from the artificial neural network community. Parity is calculated by summing all the binary inputs and reporting if the sum is odd or even. This is considered difficult because:
a very simple artificial neural network cannot solve it, and
all inputs need to be considered and a change to any one of them changes the answer.
References
Foundations of Genetic Programming
Genetic programming |
https://en.wikipedia.org/wiki/Premature%20convergence | In evolutionary algorithms (EA), the term of premature convergence means that a population for an optimization problem converged too early, resulting in being suboptimal. In this context, the parental solutions, through the aid of genetic operators, are not able to generate offspring that are superior to, or outperform, their parents. Premature convergence is a common problem found in evolutionary algorithms in general and genetic algorithms in particular, as it leads to a loss, or convergence of, a large number of alleles, subsequently making it very difficult to search for a specific gene in which the alleles were present. An allele is considered lost if, in a population, a gene is present, where all individuals are sharing the same value for that particular gene. An allele is, as defined by De Jong, considered to be a converged allele, when 95% of a population share the same value for a certain gene (see also convergence).
Strategies for preventing premature convergence
Strategies to regain genetic variation can be:
a mating strategy called incest prevention,
uniform crossover,
favored replacement of similar individuals (preselection or crowding),
segmentation of individuals of similar fitness (fitness sharing),
increasing population size.
The genetic variation can also be regained by mutation though this process is highly random.
One way to reduce the risk of premature convergence is to use structured populations instead of the commonly used panmictic ones, see below.
Identification of the occurrence of premature convergence
It is hard to determine when premature convergence has occurred, and it is equally hard to predict its presence in the future. One measure is to use the difference between the average and maximum fitness values, as used by Patnaik & Srinivas, to then vary the crossover and mutation probabilities. Population diversity is another measure which has been extensively used in studies to measure premature convergence. However, although it has been widely accepted that a decrease in the population diversity directly leads to premature convergence, there have been little studies done on the analysis of population diversity. In other words, by using the term population diversity, the argument for a study in preventing premature convergence lacks robustness, unless specified what their definition of population diversity is.
Causes for premature convergence
There are a number of presumed or hypothesized causes for the occurrence of premature convergence.
Self-adaptive mutations
Rechenberg introduced the idea of self-adaptation of mutation distributions in evolution strategies. According to Rechenberg, the control parameters for these mutation distributions evolved internally through self-adaptation, rather than predetermination. He called it the 1/5-success rule of evolution strategies (1 + 1)-ES: The step size control parameter would be increased by some factor if the relative frequency of positive mutations through a |
https://en.wikipedia.org/wiki/Pranksta%20Rap | "Pranksta Rap" is the ninth episode of the sixteenth season of the American animated television series The Simpsons. It originally aired on the Fox network in the United States on February 13, 2005. It guest stars 50 Cent as himself, and Dana Gould as Barney Fife. Boots Riley of the rap group The Coup provided the score, although he did not write any lyrics.
Plot
After Santa's Little Helper swallows the TV remote while Homer watches the TV, he ends up changing the channel every time he barks. While the dog escapes and Homer chases him, Bart sees a commercial about a rap concert held by a hip hop artist named "Alcatraaaz". He asks for Homer's permission, he nonchalantly agrees when Bart says he will pay for the ticket himself. However, as he tries to leave for the concert, Marge is infuriated and forbids him from going; and Homer is forced to agree with her, to the point of singing a rap song with Marge about Bart's immaturity, much to his distress.
Since Bart paid for the ticket, he sneaks out of his bedroom window to attend the concert. During the concert, Alcatraaaz drops his microphone, which lands in Bart's hands, he therefore challenges him to a rap battle. Bart does an impromptu energetic rap, winning the battle, and gets a ride home from the concert with Alcatraaaz in his limo, meeting 50 Cent on the way. After being dropped off at home, he overhears Marge and Homer who are angry at him for disobeying them and going to the concert. To avoid his punishment, he fakes being kidnapped, writing a ransom note, and goes on the run. Homer and Marge are devastated and the next day, the "kidnapping" is covered by the media. Chief Wiggum vows to solve the case, but is made fun of by everyone due to his reputation as a bad cop. When Bart meets Milhouse and explains that he needs a place to stay until the heat dies down, Milhouse lets him squat at his dad Kirk's apartment.
As a joke, Bart calls the Simpson house impersonating the kidnapper, which is being recorded by Wiggum. When he hears how sad Marge is without him, Bart talks to her as himself and tries to reassure her, but is forced to cut the call short when the popcorn he is using begins to explode and Kirk arrives home. Wiggum, determined to redeem himself, listens to the recording and manages to isolate the noise of the popcorn, which he recognizes as his favorite brand Chinty-Pop. He, Lou and Eddie go to the Kwik-E-Mart to ask Apu about who buys Chintzy-Pop, to which he responds that there are only two people cheap enough to buy it: Kirk and Wiggum. After this they arrest Kirk at his house for the "kidnapping", and Wiggum is subsequently promoted to police commissioner. After seeing how badly Milhouse has been affected by his father's arrest, Bart confesses his hoax to Wiggum, who convinces him to keep it secret by showing him that Kirk is far better off in prison, due to having both regular meals and the admiration of numerous women as a result of being a convicted felon.
Lisa figures out |
https://en.wikipedia.org/wiki/Media%20Control%20Interface | The Media Control Interface — MCI for short — is a high-level API developed by Microsoft and IBM for controlling multimedia peripherals connected to a Microsoft Windows or OS/2 computer, such as CD-ROM players and audio controllers.
MCI makes it very simple to write a program which can play a wide variety of media files and even to record sound by just passing commands as strings. It uses relations described in Windows registries or in the [MCI] section of the file . One advantage of this API is that MCI commands can be transmitted both from the programming language and from the scripting language (open script, lingo aso). Example of such commands are or .
, the MCI interface has been phased out in favor of the DirectX APIs first released in 1995.
MCI Devices
The Media Control Interface consists of 7 parts:
cdaudio
digitalvideo
overlay
sequencer
vcr
videodisc
waveaudio
Each of these so-called MCI devices (e.g. CD-ROM or VCD player) can play a certain type of files, e.g. plays files, plays CD-DA tracks among others. Other MCI devices have also been made available over time.
Playing media through the MCI interface
To play a type of media, it needs to be initialized correctly using MCI commands. These commands are subdivided into categories:
System Commands
Required Commands
Basic Commands
Extended Commands
A full list of MCI commands can be found at Microsoft's MSDN Library.
References
External links
Microsoft MCI Reference - MSDN Library
Microsoft application programming interfaces |
https://en.wikipedia.org/wiki/Comparison%20of%20command%20shells | A command shell is a command-line interface to interact with and manipulate a computer's operating system.
General characteristics
Interactive features
Background execution
Background execution allows a shell to run a command without user interaction in the terminal, freeing the command line for additional work with the shell. POSIX shells and other Unix shells allow background execution by using the & character at the end of command. In PowerShell, the Start-Process or Start-Job cmdlets can be used.
Completions
Completion features assist the user in typing commands at the command line, by looking for and suggesting matching words for incomplete ones. Completion is generally requested by pressing the completion key (often the key).
Command name completion is the completion of the name of a command. In most shells, a command can be a program in the command path (usually $PATH), a builtin command, a function or alias.
Path completion is the completion of the path to a file, relative or absolute.
Wildcard completion is a generalization of path completion, where an expression matches any number of files, using any supported syntax for file matching.
Variable completion is the completion of the name of a variable name (environment variable or shell variable).
Bash, zsh, and fish have completion for all variable names. PowerShell has completions for environment variable names, shell variable names and — from within user-defined functions — parameter names.
Command argument completion is the completion of a specific command's arguments. There are two types of arguments, named and positional: Named arguments, often called options, are identified by their name or letter preceding a value, whereas positional arguments consist only of the value. Some shells allow completion of argument names, but few support completing values.
Bash, zsh and fish offer parameter name completion through a definition external to the command, distributed in a separate completion definition file. For command parameter name/value completions, these shells assume path/filename completion if no completion is defined for the command. Completion can be set up to suggest completions by calling a shell function. The fish shell additionally supports parsing of man pages to extract parameter information that can be used to improve completions/suggestions. In PowerShell, all types of commands (cmdlets, functions, script files) inherently expose data about the names, types and valid value ranges/lists for each argument. This metadata is used by PowerShell to automatically support argument name and value completion for built-in commands/functions, user-defined commands/functions as well as for script files. Individual cmdlets can also define dynamic completion of argument values where the completion values are computed dynamically on the running system.
Command history
Users of a shell may find themselves typing something similar to what they have typed before. Support for |
https://en.wikipedia.org/wiki/WOXY.com | WOXY.com was a modern rock internet radio station based in Oxford, Ohio, and later Austin, Texas. WOXY.com relied mainly on its own website to reach its listeners. WOXY.com programming at one time was also available at lala.com and WVXU HD Radio.
Originally transmitted solely from WOXY (FM) at 97.7 FM in Oxford, Ohio, the station went by the 97X moniker as well as the tag line "the future of rock and roll." In 2004, WOXY became one of the first commercial radio stations in the United States to completely transition from terrestrial FM radio to broadcasting solely as an Internet radio station at WOXY.com. The station moved its studios from Cincinnati, Ohio, to Austin in 2009. In 2010, due to financial challenges, the station ended its online feed. On November 23, 2011, the station's remaining WOXY.com website and discussion forums were taken offline by owner Future Sounds.
97X (1983–2004)
The birth of 97X
In 1981 the station was purchased by Doug and Linda Balogh for $375,000. Soon after the station adopted the moniker "97X." Based on feedback from focus groups of college students, the station switched to a modern rock format in September 1983, reportedly the sixth modern rock station in the country. The station benefited from a large youthful audience at adjacent Miami University as well as listeners in urban and suburban areas of Cincinnati and Dayton, but the majority of its broadcast area was rural.
WOXY's tagline, "97X, Bam! The future of rock and roll," was quoted by Dustin Hoffman's character Raymond Babbitt in the 1988 film Rain Man.
In 1988, Cincinnati magazine named 97X the best "cutting edge" radio station in the Cincinnati area. WOXY placed in the Rolling Stone reader's poll "best radio station" category four times between 1990 and 1995. Rolling Stone also recognized WOXY as one of ten "stations that don't suck" in 1998 and one of four "last great independent" radio stations in 2003.
Webcast (1998–2010)
In 1998, WOXY began to experiment with webcasts, and listeners tuned in from around the world; the Internet listenership continued to grow. The station continued to broadcast online while building a website with message boards and information to create a community of modern rock. The station was also one of a number of stations offered in the Internet radio section of iTunes.
End of FM broadcast
In January 2004, the Baloghs sold the license to 97.7 FM to Dallas, Texas-based First Broadcasting Investment Partners for $5.6 million but retained the station's music library and 97X brand with the intention of continuing broadcasting as internet-only WOXY.com. 97X ended its terrestrial broadcasting on 97.7 FM on May 13, 2004.
The future of "The Future of Rock and Roll" was to be on the Internet, broadcasting exclusively from the WOXY.com website. The staff committed to staying with the WOXY.com venture worked feverishly over the following five months to secure funding and advertisers for what was at the time an unheard of bu |
https://en.wikipedia.org/wiki/Database%20state | Database state may refer to:
Database state, in database technology the set of stored data. Entering, modifying, or deleting information changes the database state. *Actual data stored in a particular moment in time.
See also State transition system and Finite-state machine models.
A state that practices Mass surveillance. |
https://en.wikipedia.org/wiki/Caudate | Caudate (Latin for "tail") may refer to:
Caudate nucleus
Caudate leaf shape
Caudate lobe of liver
Cauda equina
A salamander (which is any member of the order Caudata) |
https://en.wikipedia.org/wiki/Canal%20Once%20%28Mexico%29 | Once (Eleven; formerly Once TV México and Canal Once) is a Mexican educational broadcast television network owned by National Polytechnic Institute. The network's flagship station is XEIPN-TDT channel 11 in Mexico City. It broadcasts across Mexico through nearly 40 TV transmitters and is required carriage on all Mexican cable and satellite providers. The network also operates an international feed which is available in the United States and Venezuela via satellite from DirecTV and CANTV, via online from VEMOX, VIVOplay and also on various cable outlets, on "Latino" or "Spanish" tiers. Most of its programs are also webcast through the Internet, though its programming is not the same as the actual broadcasters or satellite signal.
History
The network began broadcasting on March 2, 1959, when its flagship station became the first non-profit educational and cultural television station in Mexico, owned and operated by a Mexican institution of higher education. The television channel was conceived by Alejo Peralta y Díaz, the director of the Instituto Politécnico Nacional between 1956 and 1959, and supported by his successor Eugenio Méndez Docurro, as well as Secretary of Communications and Transportation Walter Cross Buchanan and Jaime Torres Bodet, Secretary of Public Education. Its first broadcast was a mathematics class transmitted from a small television studio located at the Casco de Santo Tomás, in the northern part of Mexico City.
In 1969, Canal Once was the first Mexico City TV station to relocate its transmitter to Cerro del Chiquihuite, in order to improve its signal. It would later be joined on the mountain by most of Mexico City's other television stations as well as several radio broadcasters. Around this time, Canal Once converted to color. By the 1980s, it already had four of its own studios.
In the 1990s and 2000s, Once TV (as the network had been renamed in 1997) embarked on a two-pronged expansion strategy. The IPN built transmitters in cities such as Cuernavaca and Tijuana in the late 1990s, and in the 2000s and early 2010s, it expanded to build in the states of Sinaloa, Durango and Chihuahua. It also allied with state networks, such as those of Guerrero, Nayarit and Quintana Roo, providing them with Once TV programs. The launch of the Organismo Promotor de Medios Audiovisuales, now the Sistema Público de Radiodifusión del Estado Mexicano (SPR), in 2010 marked the beginning of a second expansion, which finally brought Once TV to such large cities as Guadalajara, Monterrey and Puebla. The SPR operates 26 transmitters to the IPN's 13, and all of them (with the exception of Mexico City) carry Canal Once as one of their subchannels.
In 2013, Once TV México returned to its original name of Canal Once as part of a branding refresh.
In 2015, the IPN launched Once Niños, a subchannel of Canal Once featuring children's programming, which is available on all Canal Once transmitters operated by the IPN as well as on all Mexican cable sys |
https://en.wikipedia.org/wiki/Chemical%20file%20format | A chemical file format is a type of data file which is used specifically for depicting molecular data. One of the most widely used is the chemical table file format, which is similar to Structure Data Format (SDF) files. They are text files that represent multiple chemical structure records and associated data fields. The XYZ file format is a simple format that usually gives the number of atoms in the first line, a comment on the second, followed by a number of lines with atomic symbols (or atomic numbers) and cartesian coordinates. The Protein Data Bank Format is commonly used for proteins but is also used for other types of molecules. There are many other types which are detailed below. Various software systems are available to convert from one format to another.
Distinguishing formats
Chemical information is usually provided as files or streams and many formats have been created, with varying degrees of documentation. The format is indicated in three ways:(see )
file extension (usually 3 letters). This is widely used, but fragile as common suffixes such as .mol and .dat are used by many systems, including non-chemical ones.
self-describing files where the format information is included in the file. Examples are CIF and CML.
chemical/MIME type added by a chemically-aware server.
Chemical Markup Language
Chemical Markup Language (CML) is an open standard for representing molecular and other chemical data. The open source project includes XML Schema, source code for parsing and working with CML data, and an active community. The articles Tools for Working with Chemical Markup Language and XML for Chemistry and Biosciences discusses CML in more detail. CML data files are accepted by many tools, including JChemPaint, Jmol, XDrawChem and MarvinView.
Protein Data Bank Format
The Protein Data Bank Format is commonly used for proteins but it can be used for other types of molecules as well. It was originally designed as, and continues to be, a fixed-column-width format and thus officially has a built-in maximum number of atoms, of residues, and of chains; this resulted in splitting very large structures such as ribosomes into multiple files. However, many tools can read files that exceed those limits. For example, the E. coli 70S ribosome was represented as 4 PDB files in 2009: 3I1M, 3I1N, 3I1O and 3I1P. In 2014 they were consolidated into a single file, 4V6C.
Some PDB files contain an optional section describing atom connectivity as well as position. Because these files are sometimes used to describe macromolecular assemblies or molecules represented in explicit solvent, they can grow very large and are often compressed. Some tools, such as Jmol and KiNG, can read PDB files in gzipped format. The wwPDB maintains the specifications of the PDB file format and its XML alternative, PDBML. There was a fairly major change in PDB format specification (to version 3.0) in August 2007, and a remediation of many file problems in the existing database. |
https://en.wikipedia.org/wiki/Adam%20Shand%20%28manager%29 | Adam Shand is a New Zealand visual effects operations manager and advocate of community wireless networks.
Career
Shand founded Personal Telco in November 2000 which subsequently grew into one of the largest community wireless projects in the United States.
He is one of the original members of the Shmoo Group and the primary author of the Wireless Commons Manifesto.
In 2003 he moved back home to Wellington, New Zealand to work as a senior systems administrator, and later became the operations manager, for Weta Digital.
Visual effects
The company produced visual effects for the films:
2011 The Adventures of Tintin (systems manager: Weta Digital)
2009 Avatar (systems manager: Weta Digital)
2009 The Lovely Bones (systems manager: Weta Digital)
2009 District 9 (systems manager: Weta Digital – uncredited)
2008 The Day the Earth Stood Still (lead systems engineer: Weta Digital)
2008 The Chronicles of Narnia: Prince Caspian (code operations manager: Weta Digital)
2008 Jumper (code operations manager: Weta Digital)
2007 The Water Horse (digital operations manager: weta digital)
2007 30 Days of Night (code operations manager)
2007 Fantastic 4: Rise of the Silver Surfer (code operations manager)
2007 Bridge to Terabithia (digital operations manager: weta digital)
2006 Eragon (digital operations manager: weta digital)
2006 X-Men: The Last Stand (digital operations manager: weta digital)
2005 King Kong (digital operations manager)
2004 I, Robot (systems administrator: Weta Digital)
2004 Van Helsing (senior systems administrator: Weta Digital – uncredited)
2003 The Lord of the Rings: The Return of the King (systems administrator: Weta Digital)
References
External links
http://adam.nz/
http://www.personaltelco.net/
Living people
Year of birth missing (living people)
New Zealand mass media people
New Zealand film people
People from Wellington City |
https://en.wikipedia.org/wiki/Shadow%20Copy | Shadow Copy (also known as Volume Snapshot Service, Volume Shadow Copy Service or VSS) is a technology included in Microsoft Windows that can create backup copies or snapshots of computer files or volumes, even when they are in use. It is implemented as a Windows service called the Volume Shadow Copy service. A software VSS provider service is also included as part of Windows to be used by Windows applications. Shadow Copy technology requires either the Windows NTFS or ReFS filesystems in order to create and store shadow copies. Shadow Copies can be created on local and external (removable or network) volumes by any Windows component that uses this technology, such as when creating a scheduled Windows Backup or automatic System Restore point.
Overview
VSS operates at the block level of volumes.
A snapshot is a read-only point-in-time copy of the volume. Snapshots allow the creation of consistent backups of a volume, ensuring that the contents do not change and are not locked while the backup is being made.
The core component of shadow copy is the Volume Shadow Copy service, which initiates and oversees the snapshot creation process. The components that perform all the necessary data transfer are called providers. While Windows comes with a default System Provider, software and hardware vendors can create their own software or hardware providers and register them with Volume Shadow Copy service. Each provider has a maximum of 10 seconds' time to complete the snapshot generation.
Other components that are involved in the snapshot creation process are writers. The aim of Shadow Copy is to create consistent reliable snapshots. But sometimes, this cannot simply be achieved by completing all pending file change operations. Sometimes, it is necessary to complete a series of inter-related changes to several related files. For example, when a database application transfers a piece of data from one file to another, it needs to delete it from the source file and create it in the destination file. Hence, a snapshot must not be between the first deletion and the subsequent creation, or else it is worthless; it must either be before the deletion or after the creation. Enforcing this semantic consistency is the duty of writers. Each writer is application-specific and has 60 seconds to establish a backup-safe state before providers start snapshot creation. If the Volume Shadow Copy service does not receive acknowledgement of success from the corresponding writers within this time-frame, it fails the operation.
By default, snapshots are temporary; they do not survive a reboot. The ability to create persistent snapshots was added in Windows Server 2003 onward. However, Windows 8 removed the GUI portion necessary to browse them. ()
Windows software and services that support VSS include Windows Failover Cluster, Windows Server Backup, Hyper-V, Virtual Server, Active Directory, SQL Server, Exchange Server and SharePoint.
The end result is similar to a versioni |
https://en.wikipedia.org/wiki/Long-range%20dependence | Long-range dependence (LRD), also called long memory or long-range persistence, is a phenomenon that may arise in the analysis of spatial or time series data. It relates to the rate of decay of statistical dependence of two points with increasing time interval or spatial distance between the points. A phenomenon is usually considered to have long-range dependence if the dependence decays more slowly than an exponential decay, typically a power-like decay. LRD is often related to self-similar processes or fields. LRD has been used in various fields such as internet traffic modelling, econometrics, hydrology, linguistics and the earth sciences. Different mathematical definitions of LRD are used for different contexts and purposes.
Short-range dependence versus long-range dependence
One way of characterising long-range and short-range dependent stationary process is in terms of their autocovariance functions. For a short-range dependent process, the coupling between values at different times decreases rapidly as the time difference increases. Either the autocovariance drops to zero after a certain time-lag, or it eventually has an exponential decay. In the case of LRD, there is much stronger coupling. The decay of the autocovariance function is power-like and so is slower than exponential.
A second way of characterizing long- and short-range dependence is in terms of the variance of partial sum of consecutive values. For short-range dependence, the variance grows typically proportionally to the number of terms. As for LRD, the variance of the partial sum increases more rapidly which is often a power function with the exponent greater than 1. A way of examining this behavior uses the rescaled range. This aspect of long-range dependence is important in the design of dams on rivers for water resources, where the summations correspond to the total inflow to the dam over an extended period.
The above two ways are mathematically related to each other, but they are not the only ways to define LRD. In the case where the autocovariance of the process does not exist (heavy tails), one has to find other ways to define what LRD means, and this is often done with the help of self-similar processes.
The Hurst parameter H is a measure of the extent of long-range dependence in a time series (while it has another meaning in the context of self-similar processes). H takes on values from 0 to 1. A value of 0.5 indicates the absence of long-range dependence. The closer H is to 1, the greater the degree of persistence or long-range dependence. H less than 0.5 corresponds to anti-persistency, which as the opposite of LRD indicates strong negative correlation so that the process fluctuates violently.
Estimation of the Hurst Parameter
Slowly decaying variances, LRD, and a spectral density obeying a power-law are different manifestations of the property of the underlying covariance of a stationary process X. Therefore, it is possible to approach the problem of est |
https://en.wikipedia.org/wiki/Netsky | Netsky may refer to
Netsky (computer worm)
Hankus Netsky, American klezmer musician
Netsky (musician) (born 1989), stage name of Boris Daenen, Belgian musician
Netsky (album), the musician's self-titled album |
https://en.wikipedia.org/wiki/ADSI | ADSI may refer to:
Superintendent (police), Acting Detective Superintendent
Active Directory Service Interfaces, a technology introduced by Microsoft in the Windows 2000 Operating System
Analog Display Services Interface, application used by many screen-based analog telephones to work with optional calling services
American Defense Systems, Inc., provider of transparent and opaque armor, architectural hardening and security products |
https://en.wikipedia.org/wiki/ARC%20%28file%20format%29 | ARC is a lossless data compression and archival format by System Enhancement Associates (SEA). The file format and the program were both called ARC. The format is known as the subject of controversy in the 1980s, part of important debates over what would later be known as open formats.
ARC was extremely popular during the early days of the dial-up BBS. ARC was convenient as it combined the functions of the SQ program to compress files and the LU program to create .LBR archives of multiple files. The format was later replaced by the ZIP format, which offered better compression ratios and the ability to retain directory structures through the compression/decompression process.
The .arc filename extension is often used for several unrelated file archive-like file types. For example, the Internet Archive used its own ARC format to store multiple web resources into a single file. The FreeArc archiver also uses a .arc extension, but uses a completely different file format. Nintendo uses an unrelated "ARC" format for resources, such as MIDI, voice samples, or text, in GameCube and Wii games. Several unofficial extractors exist for this type of ARC file.
History
In 1985, Thom Henderson of System Enhancement Associates wrote a program called ARC, based on earlier programs such as ar, that not only grouped files into a single archive file but also compressed them to save disk space, a feature of great importance on early personal computers, where space was very limited and modem transmission speeds were very slow. The archive files produced by ARC had file names ending in ".ARC" and were thus sometimes called "arc files".
The source code for ARC was released by SEA in 1986 and subsequently ported to Unix and Atari ST in 1987 by Howard Chu. This more portable codebase was subsequently ported to other platforms, including VAX/VMS and IBM System/370 mainframes. Howard's work was also the first to disprove the prevalent belief that Lempel-Ziv encoded files could not be further compressed. Additional compression could be achieved by using Huffman coding on the LZW data, and Howard's version of ARC was the first program to demonstrate this property. This hybrid technique was later used in several other compression schemes by Phil Katz and others.
Later, Phil Katz developed his own shareware utilities, PKARC and PKXARC, to create archive files and extract their contents. These files worked with the archive file format used by ARC and were significantly faster than ARC on the IBM-PC platform due to selective assembly-language coding. Unlike SEA, which combined archive creation and archive file extraction in a single program, Katz divided these functions between two separate utilities, reducing the amount of memory needed to run them. PKARC also allowed the creation of self-extracting archives, which could unpack themselves without requiring an external file extraction utility.
Following the System Enhancement Associates, Inc. vs PKWARE Inc. and Phillip W. |
https://en.wikipedia.org/wiki/Simile%20%28computer%20virus%29 | Win32/Simile (also known as Etap and MetaPHOR) is a metamorphic computer virus written in assembly language for Microsoft Windows. The virus was released in its most recent version in early March 2002. It was written by the virus writer "Mental Driller". Some of his previous viruses, such as Win95/Drill (which used the TUAREG polymorphic engine), have proved very challenging to detect.
When the virus is first executed, it checks the current date. If the host file (the file that is infected with the virus) imports the file User32.dll, then on the 17th of March, June, September, or December, a message is displayed. Depending on the version of the virus, the case of each letter in the text is altered randomly. On 14 May (the anniversary of Israeli independence day), a message saying "Free Palestine!" will be displayed if the system locale is set to Hebrew.
The virus then rebuilds itself. This metamorphic process is very complex and accounts for around 90% of the virus' code. After the rebuild, the virus searches for executable files in folders on all fixed and remote drives. Files will not be infected if they are located in a subfolder more than three levels deep, or if the folder name begins with the letter W. For each file that is found, there is a 50 percent chance that it will be ignored. Files will not be infected if they begin with F, PA, SC, DR, NO, or if the letter V appears anywhere in the file name. Due to the way in which the name matching is done, file names that contain certain other characters are also not infected, although this part is not deliberate. The virus contains checks to avoid infecting "goat" or "bait" files (files that are created by anti-virus programs). The infection process uses the structure of the host, as well as random factors, to control the placement of the virus body and the decryptor.
See also
Metamorphic code
ZMist
Self-modifying code
Strange loop
Polymorphic code
Timeline of computer viruses and worms
References
External links
Analysis by Symantec Security Response (archive)
/virus:Win32/Simile.gen
Windows file viruses
Assembly language software
Hacking in the 2000s
Anti-Zionism |
https://en.wikipedia.org/wiki/Engadget | Engadget ( ) is a multilingual technology blog network with daily coverage of gadgets and consumer electronics. Engadget manages ten blogs, four of which are written in English and six have international versions with independent editorial staff. It has been operated by Yahoo! Inc. since September 2021.
History
Engadget was founded by former Gizmodo technology weblog editor and co-founder Peter Rojas. Engadget was the largest blog in Weblogs, Inc., a blog network with over 75 weblogs, including Autoblog and Joystiq, which formerly included Hackaday. Weblogs Inc. was purchased by AOL in 2005.
Launched in March 2004, Engadget is updated multiple times a day with articles on gadgets and consumer electronics. It also posts rumors about the technological world, frequently offers opinion within its stories, and produces the weekly Engadget Podcast that covers tech and gadget news stories that happened during the week.
On December 30, 2009, Engadget released its first mobile app for the iPhone and iPod Touch.
Overnight, on July 15, 2013, Tim Stevens stepped down as the editor-in-chief, placing gdgts''' Marc Perton as the interim executive editor. In November 2013, a major redesign was launched that merged gdgts' features into Engadget, such as the database of devices and aggregated reviews. The changes aimed to turn Engadget into a more extensive consumer electronics resource, similarly to CNET and Consumer Reports, aimed towards "the early adopter in all of us".
Michael Gorman was the editor-in-chief, alongside Christopher Trout as executive editor.
On December 2, 2015, Engadget introduced another redesign, as well as a new editorial direction with a focus on broader topics influenced by technology; Gorman explained that "the core Engadget audience—people who are very much involved in the industry—pay attention to it closely, but the new editorial direction is really meant to make it approachable for folks outside of that realm."
Controversies
William Shatner and Twitter verification
On June 21, 2014, actor William Shatner raised an issue with several Engadget editorial staff and their "verification" status on Twitter. This began when the site's social media editor, John Colucci tweeted a celebration of the site hitting over 1 million Twitter followers. Besides Colucci, Shatner also targeted several junior members of the staff for being "nobodies", unlike some of his actor colleagues who did not bear such distinction. Shatner claimed Colucci and the team were bullying him when giving a text interview to Mashable. Over a month later, Shatner continued to discuss the issue on his Tumblr page, to which Engadget replied by defending its team and discussing the controversy surrounding the social media verification.
The Verge
In early 2011, eight of the most prominent editorials and technology staff members left AOL to build a new gadget site with the CEO Jim Bankoff at SB Nation''. On leaving, Joshua Topolsky, former editor-in-chief, is quoted |
https://en.wikipedia.org/wiki/International%20Centre%20for%20Diffraction%20Data | The International Centre for Diffraction Data (ICDD) maintains a database of powder diffraction patterns, the Powder Diffraction File (PDF), including the d-spacings (related to angle of diffraction) and relative intensities of observable diffraction peaks. Patterns may be experimentally determined, or computed based on crystal structure and Bragg's law. It is most often used to identify substances based on x-ray diffraction data, and is designed for use with a diffractometer. The PDF contains more than a million unique material data sets. Each data set contains diffraction, crystallographic and bibliographic data, as well as experimental, instrument and sampling conditions, and select physical properties in a common standardized format.
The organization was founded in 1941 as the Joint Committee on Powder Diffraction Standards (JCPDS). In 1978, the name of the organization was changed to the current name to highlight the global commitment of this scientific endeavor.
The ICDD is a nonprofit scientific organization working in the field of X-ray analysis and materials characterization. The ICDD produces materials databases, characterization tools, and educational materials, as well as organizing and supporting global workshops, clinics and conferences.
Products and services of the ICDD include the paid subscription based Powder Diffraction File databases (PDF-2, PDF-4+, PDF-4+/Web , PDF-4/Minerals, PDF-4/Organics, PDF-4/Axiom, and ICDD Server Edition), educational workshops, clinics, and symposia. The ICDD is a sponsor of the Denver X-ray Conference (DXC) and the Pharmaceutical Powder X-ray Diffraction Symposium (PPXRD). The ICDD also publishes the journals Advances in X-ray Analysis and Powder Diffraction.
In 2019, Materials Data, also known as MDI, merged with ICDD. Materials Data creates JADE software used to collect, analyze, and simulate XRD data and solve issues in an array of materials science projects.
In 2020, the ICDD and the Cambridge Crystallographic Data Centre (CCDC) announced a data partnership. The CCDC curates and maintains the Cambridge Structural Database (CSD).
See also
Powder diffraction
Crystallography
External links
History, contents & use of the PDF
Materials Data
Advances in X-ray Analysis—Technical articles on x-ray methods and analyses
Powder Diffraction Journal—quarterly journal published by the JCPDS-International Centre for Diffraction Data through the Cambridge University Press
Denver X-ray Conference—World's largest X-ray conference on the latest advancements in XRD and XRF
PPXRD-16 —Pharmaceutical Powder X-ray Diffraction Symposium
Crystallography organizations
Diffraction
Optics institutions
Organizations established in 1941 |
https://en.wikipedia.org/wiki/The%20Bod%20Squad | The Bod Squad is a series of short public service announcements broadcast on Saturday mornings on the ABC television network, from 1974 through 1988. These thirty-second and one-minute segments promoted healthy nutrition and personal hygiene through humorous animation and catchy music with clever lyrics. The shorts were written by Lynn Ahrens and animated by DePatie–Freleng Enterprises.
The segments generally appeared at half-hour intervals, interspersed with regular commercials, between Saturday morning cartoon programs. While many were not labeled as such, the first four segments ended with an announcement, "Another nutritional message from the ABC Television Network", and accompanying stock animation identifying the series as The ABC Bod Squad. The same original segments produced in the 1970s repeated every Saturday morning for several years, so that many if not most American TV-watching children during that period are familiar with them. Throughout the 1970s and 1980s ABC broadcast several other series of educational public service cartoon spots as well, including Time for Timer and, perhaps the most famous of all, Schoolhouse Rock.
Episodes
Yuk Mouth: Yuk Mouth (Scatman Crothers) doesn't brush his teeth and eats junk food, causing him to get a cavity.
The Munchies: encourages children to do other things instead of letting "the Munchies" make them eat more.
Quickfast: suggesting pre-made or leftover foods for breakfast, or easily prepared foods such as toast, for children who don't have much time to eat breakfast.
Nutty Gritty: Scatman Crothers sings about making a "Nutty Gritty" snack with nuts and raisins.
Three more Bod Squad shorts were produced in 1977:
Chopper: The Chopper, a Fonzie lookalike, reminds you to exercise your teeth with healthy food.
Make A Saturday: about using healthy foods such as bananas and yogurt to make a "Saturday", which is like a sundae.
Don't Drown Your Food: Louis the Lifeguard (Arnold Stang) rescues a drowning potato and encourages children not to overuse condiments, such as gravy, ketchup and salad dressing, and learn to enjoy the natural flavors of vegetables, eggs, etc.
References
American Broadcasting Company original programming
Interstitial television shows
Public service announcements of the United States
Television series segments |
https://en.wikipedia.org/wiki/Extender | Extender may refer to:
DOS extender, a technology for bypassing the limitations of the DOS operating systems family
Extender (ink), a transparent material added to printing inks
KC-10 Extender, an air-to-air tanker aircraft
Meat extenders
Media extender
Seafood extender or Surimi
Tele extender, a secondary lens for SLR cameras
Quickdraw or extender, a piece of climbing equipment used by rock and ice climbers to allow the climbing rope to run freely through bolt anchors or other protection while leading
Extender (set theory)
MG Extender, a pickup truck vehicle built by SAIC Motor and sold in Thailand
See also
Ascender (typography)
Descender |
https://en.wikipedia.org/wiki/Time%20for%20Timer | Time for Timer is a series of seven short public service announcements broadcast on Saturday mornings on the ABC television network starting in 1975. The animated spots feature Timer, a tiny cartoon character who represents the sense of time in the human body. Timer was in charge of when a person felt it was time to eat, time to sleep, etc. He carried a large pocket watch inside of him that set off an alarm whenever something was about to happen.
Usually wearing a bow tie and top hat, Timer looks like a little yellow meatball with a face and has long slender arms and legs. Timer has limited magical powers, such as teleportation, which he uses to exit his host's body from time to time. A wisecracker as well as a song-and-dance man, Timer promotes healthy eating and personal hygiene for children using clever songs and animation.
The series was produced by the cartoon studio DePatie-Freleng Enterprises. Timer first appears in the 1973 ABC Afterschool Special "The Incredible, Indelible, Magical, Physical Mystery Trip", where he was voiced by Len Maxwell. Except for this 1973 portrayal, Timer's voice was provided by actor Lennie Weinrib. Timer also appears in the 1974 ABC Afterschool Special "The Magical Mystery Trip Through Little Red's Head". In "Physical Mystery Trip", he works inside the body of a man named Uncle Carl; in "Little Red", he works inside a teenaged Red Riding Hood.
Time for Timer ran concurrently and interchangeably until 1992 with ABC's other educational spots, primarily The Bod Squad and Schoolhouse Rock!. They generally appeared during cartoon programs at the end of commercial breaks. The shorts included a Consultant credit for Dr. Roslyn B. Alfin-Slater, UCLA School of Public Health.
Episodes
"I Hanker Fer a Hunk O Cheese" - Timer, recast as a cowboy with a thick Western accent, suggests "wagon wheels", sandwiches made with cheese slices and crackers, as an easy and nutritious snack. When Timer prepares one on a kitchen counter, he rolls it down the counter on its edge and exclaims, "Look! A wagon wheel!"
"Take Care of Yourself" - Timer shows how to brush teeth to protect them from cavities.
"You Are What You Eat" - Roving reporter Timer is at the digestive system to provide a simplified explanation of nutrients and how the body uses them.
"Have A Carrot" - Timer, channeling W. C. Fields, assembles some nutritious in-between meal snacks like carrot sticks for a boy. At the end of the short, Timer literally changes the boy into a banana as a gag.
"Eat Some Kind of Breakfast" - Timer shows that if people don't have time for breakfast, their stomach will be empty and angry; leftovers and other premade foods for breakfast is better than none at all.
"Sunshine on a Stick" - Timer suggests making ice pops with fruit juice, an ice tray, and toothpicks.
"Don't Knock It Till You Try" - Timer suggests trying new foods by eating a smorgasbord of smidgens of different foods.
References
External links
Bio of Dr. Roslyn B. Al |
https://en.wikipedia.org/wiki/Ballistic%20stroke | In handwriting research, the concept of stroke is used in various ways. In engineering and computer science, there is a tendency to use the term stroke for a single connected component of ink (in Off-line handwriting recognition) or a complete pen-down trace (in on-line handwriting recognition). Thus, such stroke may be a complete character or a part of a character. However, in this definition, a complete word written as connected cursive script should also be called a stroke. This is in conflict with the suggested unitary nature of stroke as a relatively simple shape.
In the research field of handwriting motor control, the term ballistic stroke is used. It is defined as the trajectory segment between two consecutive minima in the absolute velocity of the pen tip. The time delay between the cortical brain command and a muscle contraction is so large that the 100 millisecond ballistic strokes need to be planned in advance by the brain, as feedback by hand-eye coordination requires a much slower movement than is the case in the normal handwriting process.
See also
Graphonomics
Penmanship |
https://en.wikipedia.org/wiki/FOT | Fot or FOT may refer to:
Arts and entertainment
The Fall of Troy (band), an American rock band
Fallout Tactics: Brotherhood of Steel, a computer game
False or True, a British television programme
Science and technology
Fast optical transient
Flight operations team
Frequency of optimum transmission
The Fot1 family of Fusarium oxysporum transposable elements
Transport
Fo Tan station, in Hong Kong
Fort railway station, in Sri Lanka
Rohnerville Airport, in California, United States
FOT, free on truck, an historic form of international commercial term or Incoterm
Forster (Wallis Island) Airport, IATA airport code "FOT"
Other uses
Fot, 11th-century Swedish runemaster
Fót, a town in Pest county, Hungary
Feast of Tabernacles, part of the Jewish religious festival of Sukkot
Festival of Trees
Fotki, a photo sharing web-site
Future-oriented therapy, a form of psychotherapy |
https://en.wikipedia.org/wiki/Mouseover | In computing, a mouseover, mouse hover or hover box is a graphical control element that is activated when the user moves or hovers the pointer over a trigger area, usually with a mouse, but also possible with a digital pen. Mouseover control elements are common in web browsers. For example, hovering over a hyperlink triggers the mouseover control element to display a URL on the status bar. Site designers can define their own mouseover events using JavaScript or Cascading Style Sheets.
Mouseover events are frequently used in web design and graphical user interface programming.
It is also known as rollover, which refers to a button created by a web developer or web designer, found within a web page, used to provide interactivity between the user and the page itself. The term rollover in this regard originates from the visual process of "rolling the mouse cursor over the button" causing the button to react (usually visually, by replacing the button's source image with another image), and sometimes resulting in a change in the web page itself. The part of the term 'roll' is probably referring to older mice which had a mechanical assembly consisting of a hard rubber ball housed in the base of the mouse (which rolls) contrary to the modern optical mouse, which has no rolling parts.
Rollovers can be done by imagery, text or buttons. The user only requires two images/buttons (with the possible addition of "alt" text to these images) to perform this interactive action. Rollover imagery can be done either by a program with a built-in tool or script coding. The user will have to pick a first image and select an alternate secondary image. A mouse action will have to be set to either "click on" or "mouse over" in order for the rollover to be triggered. When the mouseover moves on the image, the alt image/secondary image will appear but will not stay – when the user "mouses out" by moving the mouse away from the image, the original source image will reappear.
Tooltip
A special usage of mouseover event is a tooltip which shows a short description of the object under the pointer. The tooltip appears only after the mouse or stylus is held over the object for a certain amount of time.
On images, these may be produced using the HTML title attribute.
Examples
<!-- Direct usage is not recommended. It does not conform with web standards. -->
<img id="myImage" src="/images/myImage.jpg" onMouseOver="alert('your message');">
// JavaScript code without any framework
<ref>var myImg = document.getElementById('myImage');</ref>
function myMessage() {
alert('your message');
}
if (myImg.addEventListener) { //addEventListener is the standard method to add events to objects.
myImg.addEventListener('mouseover', myMessage, false);
}
else if (myImg.attachEvent) { //For Internet Explorer
myImg.attachEvent('onmouseover', myMessage);
}
else { //For other browsers
myImg.onmouseover = myMessage;
}
// jQuery example. It degrades well if JavaScript is disabl |
https://en.wikipedia.org/wiki/Command%20button | "Command button" may refer to:
A graphical button that appears in a computer user interface, allowing a user to trigger an event
Keyboard buttons (generally)
The "command" key on Apple keyboards (a modifier key with a "⌘" symbol printed on it)
See also
Push-button |
https://en.wikipedia.org/wiki/Phalanx%20%28comics%29 | The Phalanx are a fictional cybernetic species appearing in American comic books published by Marvel Comics. They have come in conflict with the X-Men as well as other groups on several occasions. They form a hive mind, linking each member by a telepathic system.
Publication history
The Phalanx were co-created by writer Scott Lobdell and artist Joe Madureira but owe much in concept and appearance to the original Technarchy (by writer Chris Claremont and artist Bill Sienkiewicz). Although appearing in prototype variations in earlier issues, the Phalanx first appeared in their full form in Uncanny X-Men #312 (May 1994).
Fictional biography
Origins
While their true origins are still unclear, the Phalanx were thought to be formed when organic lifeforms are infected with the Technarchy's techno-organic transmode virus, but, in fact, they are actually an artificial intelligence that operates on a galactic scale, and they have total control of a host galaxy. The Phalanx were apparently created by the Titans, singularities of consciousness so vast and dense, that they have caved in on their own combined intelligence to form black holes - realms that exist outside normal spacetime and where the Phalanx dwell. The Titans are also singular intellects and not a collective or a group. A single black hole is a Titan intelligence, up to five black holes confined to a galactic cluster or a dense collection of stacked galaxies becomes a Stronghold, warring factions seeking to actively destroy or absorb other Strongholds in order to achieve a Dominion status which is when 10 or more of these incomprehensible cosmologically-scaled beings act in unison to control a particular sector or sectors of space in both the area and epochs of time, becoming galaxy-spanning, interconnected tears in the fabric of existence. The only primal threats to them are Galactus and the Phoenix.
The Phalanx have existed for 100,000 life cycles and have the collective knowledge of previous generations. They are infected with a Techno-Organic Virus which they use to create semi-autonamous viral mechanisms capable exploration and exploitation of any plane of reality, be it physical in the likes of the Technarchy who classify existing societies and either remove or repurpose them, magical or other forms in the likes of the Astral Technarchy. The Phalanx may even be a higher evolution of the Technarchy or be multiple Technarchies that are unaware of each other's existence. What is known is that their ultimate goal is to consume lesser societies and manage the energy needed for that kind of assimilation as a way to continue to expand and increase the Dominion's intelligence. They are extremely advanced and based on the Kardashev scale, they are considered a Type III civilization, and although the Kree's Black Judges were able to capture some of them, to study their hive-mind to see if they could weaponize them and use them against rival empires, they were forced to deemed them a failure du |
https://en.wikipedia.org/wiki/WBKI%20%28TV%29 | WBKI (channel 58) is a television station licensed to Salem, Indiana, United States, serving the Louisville, Kentucky, area as a dual affiliate of The CW and MyNetworkTV. It is the only full-power Louisville-area station licensed to the Indiana side of the market. WBKI is owned by Block Communications alongside Fox affiliate WDRB (channel 41). Both stations share studios on West Muhammad Ali Boulevard (near US 150) in downtown Louisville, while WBKI's transmitter is located in rural northeastern Floyd County, Indiana (northeast of Floyds Knobs). Despite Salem being WBKI's city of license, the station maintains no physical presence there.
Block formerly operated a CW affiliate with the WBKI-TV call sign on channel 34, licensed to Campbellsville, Kentucky, under a local marketing agreement (LMA) with owner LM Communications, LLC. Following the sale of channel 34's spectrum in the Federal Communications Commission (FCC)'s incentive auction, the Campbellsville station ceased broadcasting on October 25, 2017 (with its license canceled on October 31); its channels are now broadcast solely through channel 58 on that station's license.
History
The station first signed on the air on March 16, 1994, as WFTE, with the call letters being an abbreviation of its channel number. Branded on-air as "Big 58," it originally operated as an independent station. It was originally licensed to Salem, Indiana businessman Don Martin Jr. Martin sold the license in 1993 to another Salem businessman, Tom Ledford, who worked with WDRB to program the station under one of the earliest local marketing agreements in existence. WFTE also aired the police procedural series NYPD Blue during the 1994–95 season as ABC affiliate WHAS-TV (channel 11) declined to carry the program, as many ABC affiliates in the Southern United States did when it premiered, but would later cede to viewer and advertiser pressure to carry it when the show gained traction in the national ratings.
The station became a charter affiliate of the United Paramount Network (UPN), when the network launched on January 16, 1995. Block Communications purchased the station outright in 2001, creating the first television duopoly in the Louisville market; that year, the station was rebranded as "Great 58," becoming one of the few full-time UPN affiliates not to incorporate any network branding during its tenure with the network.
On January 24, 2006, CBS Corporation and the Warner Bros. unit of Time Warner announced that the two companies would shut down UPN and The WB, and combine the networks' respective programming to create a new "fifth" network called The CW. On March 1, 2006, WB affiliate WBKI-TV (channel 34) signed an agreement to become Louisville's CW affiliate, becoming among the first stations outside the charter Tribune Broadcasting and CBS Television Stations groups to sign affiliation deals with the network.
On February 22, 2006, News Corporation announced the launch of MyNetworkTV, a new "sixth" network |
https://en.wikipedia.org/wiki/Google%20Scholar | Google Scholar is a freely accessible web search engine that indexes the full text or metadata of scholarly literature across an array of publishing formats and disciplines. Released in beta in November 2004, the Google Scholar index includes peer-reviewed online academic journals and books, conference papers, theses and dissertations, preprints, abstracts, technical reports, and other scholarly literature, including court opinions and patents.
Google Scholar uses a web crawler, or web robot, to identify files for inclusion in the search results. For content to be indexed in Google Scholar, it must meet certain specified criteria. An earlier statistical estimate published in PLOS One using a mark and recapture method estimated approximately 79–90% coverage of all articles published in English with an estimate of 100 million. This estimate also determined how many documents were freely available on the internet. Google Scholar has been criticized for not vetting journals and for including predatory journals in its index.
The University of Michigan Library and other libraries whose collections Google scanned for Google Books and Google Scholar retained copies of the scans and have used them to create the HathiTrust Digital Library.
History
Google Scholar arose out of a discussion between Alex Verstak and Anurag Acharya, both of whom were then working on building Google's main web index. Their goal was to "make the world's problem solvers 10% more efficient" by allowing easier and more accurate access to scientific knowledge. This goal is reflected in the Google Scholar's advertising slogan "Stand on the shoulders of giants", which was taken from an idea attributed to Bernard of Chartres, quoted by Isaac Newton, and is a nod to the scholars who have contributed to their fields over the centuries, providing the foundation for new intellectual achievements. One of the original sources for the texts in Google Scholar is the University of Michigan's print collection.
Scholar has gained a range of features over time. In 2006, a citation importing feature was implemented supporting bibliography managers, such as RefWorks, RefMan, EndNote, and BibTeX. In 2007, Acharya announced that Google Scholar had started a program to digitize and host journal articles in agreement with their publishers, an effort separate from Google Books, whose scans of older journals do not include the metadata required for identifying specific articles in specific issues. In 2011, Google removed Scholar from the toolbars on its search pages, making it both less easily accessible and less discoverable for users not already aware of its existence. Around this period, sites with similar features such as CiteSeer, Scirus, and Microsoft Windows Live Academic search were developed. Some of these are now defunct; in 2016, Microsoft launched a new competitor, Microsoft Academic.
A major enhancement was rolled out in 2012, with the possibility for individual scholars to create perso |
https://en.wikipedia.org/wiki/Generic%20Security%20Services%20Application%20Program%20Interface | The Generic Security Service Application Program Interface (GSSAPI, also GSS-API) is an application programming interface for programs to access security services.
The GSSAPI is an IETF standard that addresses the problem of many similar but incompatible security services in use .
Operation
The GSSAPI, by itself, does not provide any security. Instead, security-service vendors provide GSSAPI implementations - usually in the form of libraries installed with their security software. These libraries present a GSSAPI-compatible interface to application writers who can write their application to use only the vendor-independent GSSAPI.
If the security implementation ever needs replacing, the application need not be rewritten.
The definitive feature of GSSAPI applications is the exchange of opaque messages (tokens) which hide the implementation detail from the higher-level application.
The client and server sides of the application are written to convey the tokens given to them by
their respective GSSAPI implementations.
GSSAPI tokens can usually travel over an insecure network as the mechanisms provide inherent message security.
After the exchange of some number of tokens, the GSSAPI implementations at both ends inform their local application that a security context is established.
Once a security context is established, sensitive application messages can be wrapped (encrypted) by the GSSAPI for secure communication between client and server.
Typical protections guaranteed by GSSAPI wrapping include confidentiality (secrecy) and integrity (authenticity). The GSSAPI can also provide local guarantees about the identity of the remote user or remote host.
The GSSAPI describes about 45 procedure calls. Significant ones include:
GSS_Acquire_cred Obtains the user's identity proof, often a secret cryptographic key
GSS_Import_name Converts a username or hostname into a form that identifies a security entity
GSS_Init_sec_context Generates a client token to send to the server, usually a challenge
GSS_Accept_sec_context Processes a token from GSS_Init_sec_context and can generate a response token to return
GSS_Wrap Converts application data into a secure message token (typically encrypted)
GSS_Unwrap Converts a secure message token back into application data
The GSSAPI is standardized for the C (RFC 2744) language. Java implements the GSSAPI
as JGSS,
the Java Generic Security Services Application Program Interface.
Some limitations of GSSAPI are:
standardizing only authentication, rather not authorization too;
assuming a client–server architecture.
Anticipating new security mechanisms, the GSSAPI includes a negotiating pseudo mechanism, SPNEGO, that can discover and use new mechanisms not present when the original application was built.
Relationship to Kerberos
The dominant GSSAPI mechanism implementation in use is Kerberos.
Unlike the GSSAPI, the Kerberos API has not been standardized
and various existing implementations use incompatible APIs. |
https://en.wikipedia.org/wiki/Truth%20or%20Doubt | is a Japanese quiz television game show that aired on Nippon Television Network. It debuted on April 3, 2004, and last aired on March 29, 2005.
Shosuke Tanihara is the presenter of this programme. Every time, there are four or five celebrities as game players. The players tell their own stories which are true, but sometimes there would be made-up stories. There are two types of game cards; one is blue-coloured "TRUE CARD (トゥルーカード)" and the other is red-coloured "DOUBT CARD (ダウトカード)." When the players tell true stories, they use "TRUE CARDs," and when they are not true, players use "DOUBT CARDs." For each confession, other players guess that the story is true or made-up. If they think the story is not true, they point out, and it is truly false, he/she can reduce one card, but if the player wrongly point out, the card will be added as the penalty. Finally, when the player can eliminate all the cards, he/she will be the winner. The player who is good at conversation tactics usually wins the game. The programme's name is a Wasei-eigo pun on "coming out (カミングアウト)," in the sense of revealing secrets.
Problems
Revealers sometimes tell crime-like stories. When those stories are true, other players get greatly surprised. If it is genuine crime, TV watchers also get astonished, and the statements can become social problems as celebrities' scandals.
See also
Japanese television programs
External links
NTV Program Catalogue - Formats (PDF)
Nippon Television Network - TRUTH or DOUBT (Coming Doubt) (in Japanese)
Japanese game shows
Nippon TV original programming
2004 Japanese television series debuts
2005 Japanese television series endings |
https://en.wikipedia.org/wiki/Proper%20orthogonal%20decomposition | The proper orthogonal decomposition is a numerical method that enables a reduction in the complexity of computer intensive simulations such as computational fluid dynamics and structural analysis (like crash simulations). Typically in fluid dynamics and turbulences analysis, it is used to replace the Navier–Stokes equations by simpler models to solve.
It belongs to a class of algorithms called model order reduction (or in short model reduction). What it essentially does is to train a model based on simulation data. To this extent, it can be associated with the field of machine learning.
POD and PCA
The main use of POD is to decompose a physical field (like pressure, temperature in fluid dynamics or stress and deformation in structural analysis), depending on the different variables that influence its physical behaviors. As its name hints, it's operating an Orthogonal Decomposition along with the Principal Components of the field. As such it is assimilated with the principal component analysis from Pearson in the field of statistics, or the singular value decomposition in linear algebra because it refers to eigenvalues and eigenvectors of a physical field. In those domains, it is associated with the research of Karhunen and Loève, and their Karhunen–Loève theorem.
Mathematical expression
The first idea behind the Proper Orthogonal Decomposition (POD), as it was originally formulated in the domain of fluid dynamics to analyze turbulences, is to decompose a random vector field u(x, t) into a set of deterministic spatial functions Φk(x) modulated by random time coefficients ak(t) so that:
The first step is to sample the vector field over a period of time in what we call snapshots (as display in the image of the POD snapshots). This snapshot method is averaging the samples over the space dimension n, and correlating them with each other along the time samples p:
with n spatial elements, and p time samples
The next step is to compute the covariance matrix C
We then compute the eigenvalues and eigenvectors of C and we order them from the largest eigenvalue to the smallest.
We obtain n eigenvalues λ1,...,λn and a set of n eigenvectors arranged as columns in an n × n matrix Φ:
References
External links
MIT: http://web.mit.edu/6.242/www/images/lec6_6242_2004.pdf
Stanford University - Charbel Farhat & David Amsallem https://web.stanford.edu/group/frg/course_work/CME345/CA-CME345-Ch4.pdf
Weiss, Julien: A Tutorial on the Proper Orthogonal Decomposition. In: 2019 AIAA Aviation Forum. 17–21 June 2019, Dallas, Texas, United States.
French course from CNRS https://www.math.u-bordeaux.fr/~mbergman/PDF/OuvrageSynthese/OCET06.pdf
Applications of the Proper Orthogonal Decomposition Method http://www.cerfacs.fr/~cfdbib/repository/WN_CFD_07_97.pdf
Continuum mechanics
Numerical differential equations
Partial differential equations
Structural analysis
Computational electromagnetics |
https://en.wikipedia.org/wiki/AMULET%20%28processor%29 | AMULET is a series of microprocessors implementing the ARM processor architecture. Developed by the Advanced Processor Technologies group at the Department of Computer Science at the University of Manchester (formerly the AMULET and PAL groups based at the same institution), AMULET is unique amongst ARM implementations in being an asynchronous microprocessor, not making use of a square wave clock signal for data synchronization and movement.
List of AMULET microprocessors
AMULET1 — Designed in 1990 and first fabricated in 1993. Its estimated performance is approximately 70% of that of a comparably-sized synchronous ARM6 running at 20 MHz.
AMULET2 — A re-implementation of AMULET1 first fabricated in 1996. Features on-chip memory that can be used either as processor cache or mapped RAM. The APT group estimates AMULET2 to have a similar power dissipation/performance ratio as ARM8. One very notable feature due to the asynchronous design is the drop of power dissipation to 3 μW when not in use (assuming the on-board timer, which handles DRAM refresh, is also inactive).
AMULET3 — This was a redesigned architecture aiming at higher performance than the previous AMULET processors whilst retaining low power dissipation. Fabricated in 2000, it supported the ARM level 4 instruction set compatibility, alongside support for Thumb mode (i.e. ARM9TM). Performance and power dissipation were approximately the same as an ARM9 fabricated on the same technology. AMULET3 was employed in a commercial prototype DECT device because of its inherent low electromagnetic interference characteristics. This did not go into manufacture for non-technical reasons.
See also
ARM Architecture
References
External links
ARM Ltd.
APT Group
ARM processors
Department of Computer Science, University of Manchester |
https://en.wikipedia.org/wiki/Micronet%20800 | Micronet 800 was an information provider (IP) on Prestel, aimed at the 1980s personal computer market. It was an online magazine that gave subscribers computer related news, reviews, general subject articles and downloadable telesoftware.
Users would log onto the Prestel network (which was usually a local call) and then access the Micronet 800 home page by entering *800# (hence the name) on their modem or computer. Most Micronet 800 members would have their default main index page set to page 800 automatically.
History
The name Micronet 800 derives from its home page, 800, on the BT Prestel videotext service.
Micronet 800 derived from the earlier development in 1980 and 1981 of 'Electronic Insight' by Bob Denton. Electronic Insight was a Prestel-based feature-and-price-comparison site listing computers, calculators and other electronic and IT products, whose main page was on page 800 of Prestel. Electronic Insight was acquired by Telemap Group, a part of EMAP, East Midland (note, not Midlands) Allied Press, in 1982 on the recommendation of Richard Hease, a number of whose computer magazines EMAP had just bought. Telemap had been formed in 1981 to explore the opportunities of British Telecom's Prestel videotext service. It had been looking at the horticultural market that EMAP served with a number of magazine titles, notably providing a 'Closed User Group' purchasing network for garden centre businesses, complementing EMAP's printed 'Garden Trade News' magazine. But horticulturalists and IT proved not to be a natural marriage, and the service had insufficient users to make it viable.
Richard Hease, in 1982 Chairman of EMAP's Computer & Business Press which had acquired Electronic Insight, organised a pitch to the Telemap Group by David Babsky of a projected interactive online computer magazine to replace the existing content of Electronic Insight. Babsky showed a 'dummy issue' of the intended online magazine, programmed in Integer BASIC on an Apple II computer. Hease suggested that there be several different 'areas' of the magazine, with titles such as MicroNews, MicroNet (for those interested in networking), etc., and Babsky proposed that the entire project be called 'Micronet 800' to ensure that it could be easily found by anyone using Prestel, as its page number would be part of its name. Hease and Denton negotiated with BT Prestel for a special relationship that would rank it alongside the Nottingham Building Society's plans for its Homelink as the two key thrusts for Prestel.
Hease negotiated with then telecoms minister John Butcher a £25 subsidy for Micronet subscribers to have their homes equipped free with a telephone jack-socket for the relevant modem.
The Telemap editorial staff was first based at 8 Herbal Hill, Clerkenwell, London (after the preliminary discussions and presentation at EMAP's offices in Hatton Garden), and the technical staff in an EMAP building in Peterborough. In 1986 the technical staff moved down to the Lon |
https://en.wikipedia.org/wiki/HomeRF | HomeRF was a wireless networking specification for home devices. It was developed in 1998 by the Home Radio Frequency Working Group, a consortium of mobile wireless companies that included Proxim Wireless, Intel, Siemens AG, Motorola, Philips and more than 100 other companies.
The group was disbanded in January 2003, after other wireless networks became accessible to home users and Microsoft began including support for them in its Windows operating systems. As a result, HomeRF fell into obsolescence.
Description
Initially called Shared Wireless Access Protocol (SWAP) and later just HomeRF, this open specification allowed PCs, peripherals, cordless phones and other consumer devices to share and communicate voice and data in and around the home without the complication and expense of running new wires. HomeRF combined several wireless technologies in the 2.4 GHz ISM band, including IEEE 802.11 FH (the frequency-hopping version of wireless data networking) and DECT (the most prevalent digital cordless telephony standard in the world) to meet the unique home networking requirements for security, quality of service (QoS) and interference immunity—issues that still plagued Wi-Fi (802.11b and g).
HomeRF used frequency hopping spread spectrum (FHSS) in the 2.4 GHz frequency band and in theory could achieve a maximum of 10 Mbit/s throughput; its nodes could travel within a 50-meter range of a wireless access point while remaining connected to the personal area network (PAN). Several standards and working groups focused on wireless networking technology in radio frequency (RF). Other standards include the popular IEEE 802.11 family, IEEE 802.16, and Bluetooth.
Proxim Wireless was the only supplier of HomeRF chipsets, and since Proxim also made end products, other manufacturers complained that they had to buy components from their competitor. The fact that our group didn't address that conflict led to the eventual downfall of HomeRF, which occurred during an economic recession when companies already struggled to justify duplicate engineering and marketing efforts - for HomeRF, 802.11 and Bluetooth. The fact that HomeRF was developed by a consortium and not an official standards body also put it at a disadvantage against Wi-Fi and its IEEE 802.11 standard.
AT&T joined the group because HomeRF was designed for high-speed broadband services and the need to support PCs, phones, stereos and televisions; but last-mile deployment occurred more slowly than expected and with slower speeds. So it was natural that the home networking market focused more on multi-PC households sharing Internet connections for email and browsing than on integrating phone and entertainment services into a broadband service bundle. As a result, the original promoter companies gradually started pulling out of the group rather than supporting multiple standards. They included IBM, Hewlett-Packard, Compaq, Microsoft, and lastly Intel. That left only companies like Motorola, National S |
https://en.wikipedia.org/wiki/MKC%20Networks | MKC Networks was a privately owned supplier of VoIP (Voice over IP) equipment and software components headquartered in Ottawa, Ontario, Canada. It designed and sold a family of SIP-based products including advanced SIP Enterprise Application Servers and scalable communication platforms.
MKC Networks bought certain SIP intellectual property in 2003 from a company called Mitel Knowledge. Mitel Knowledge was created to hold the intellectual property of Mitel Networks. Through some internal exploratory R&D work, it evolved into a supplier of SIP-based equipment.
The intellectual property of Mitel Networks was returned to that company's ownership in 2003.
MKC Networks was acquired by NewHeights Software on September 1, 2006. In 2007, NewHeights was acquired by CounterPath Corporation.
References
External links
CounterPath
VoIP companies of Canada
Companies based in Ottawa
Defunct networking companies
Year of establishment missing
Defunct VoIP companies
Defunct computer companies of Canada |
https://en.wikipedia.org/wiki/TDK | is a Japanese multinational electronics corporation that manufactures electronic components and recording and data-storage media. Its motto is "Contribute to culture and industry through creativity".
"TDK" is an initialism of the original Japanese name of the company: Tokyo Denki Kagaku Kōgyō K.K. (Tokyo Electric Chemical Industry Co., Ltd.). The company is listed on the Tokyo Stock Exchange and is a constituent of the Nikkei 225 and TOPIX indices.
History
TDK was founded by Kenzo Saito in Tokyo, Japan, on 7 December 1935 to manufacture the iron-based magnetic material ferrite, which had been recently invented by Yogoro Kato and Takeshi Takei. In 1952 and 1957, they began to produce magnetic tape, with compact cassette tapes following in 1966. TDK manufactured an extensive portfolio of magnetic and optical media, including several formats of videotape and blank CD-R and recordable DVD discs until the recording business was sold to Imation in 2007.
TDK produced five million ferrite cores through 1945 that were primarily used to reduce the volume and weight of radio receivers used by the Imperial Japanese military.
Operations in the US began in 1965 with a New York City office, and European operations began in 1970 with an office in Frankfurt, West Germany.
In 1980, TDK developed a multilayering technology to create chip capacitors and inductors used in personal computers, laptops, smartphones and other electronic devices.
In 1986, TDK acquired SAE Magnetics and introduced high-density recording heads.
In the 1990s, TDK's Mass Storage Division included brushless DC spindle motors, magnetoresistance (MR) heads and thin-film heads.
Since 1997, TDK has gradually withdrawn from the production of compact cassettes. First with the MA-X and AR ("Acoustic Response"), then the AD ("Acoustic Dynamic") and SA-X line in 2001 and 2002 respectively, then the MA ("Metal Alloy") line in 2004. The SA ("Super Avilyn") and D ("Dynamic") lines were withdrawn in 2011. Industry trends see the company moving into new forms of media. In 2004 TDK was the first media manufacturer to join the companies developing BD post-DVD technology.
TDK operated a semiconductor division in California for about a decade, but divested it in 2005.
The company dabbled into the video game business in the late 1990s and early 2000s, by operating TDK Mediactive in the U.S. and Europe, and TDK Core in Japan.
In late 2007, Imation acquired marketing and sales operations for TDK brand recording media, including flash media, optical media, magnetic tape, and accessories, for $300 million. This also included a license to use the "TDK Life on Record" brand on data storage and audio products for 25 years. In September 2015, Imation announced that it had agreed to relinquish this license and would cease selling TDK-branded products by the end of the year.
Since the 2000s, TDK has focussed on the development, manufacture and sales of electronic components, HDD heads and suspension, and powe |
https://en.wikipedia.org/wiki/Online%20hotel%20reservations | Online hotel reservations are a popular method for booking hotel rooms. Travellers can book rooms on a computer by using online security to protect their privacy and financial information and by using several online travel agents to compare prices and facilities at different hotels.
Prior to the Internet, travellers could write, telephone the hotel directly, or use a travel agent to make a reservation. Nowadays, online travel agents have pictures of hotels and rooms, information on prices and deals, and even information on local resorts. Many also allow reviews of the traveler to be recorded with the online travel agent.
Online hotel reservations are also helpful for making last minute travel arrangements. Hotels may drop the price of a room if some rooms are still available. There are several websites that specialize in searches for deals on rooms.
Connections to air travel
Large hotel chains typically have direct connections to the airline national distribution systems (GDS) (Sabre, Galileo, Amadeus, and Worldspan). These in turn provide hotel information directly to the hundreds of thousands of travel agents that align themselves with one of these systems. Individual hotels and small hotel chains often cannot afford the expense of these direct connections and turn to other companies to provide the connections.
Large-scale travel sites
Several large online travel sites are, in effect, travel agencies. These sites send the hotels' information and rates downstream to literally thousands of online travel sites, most of which act as travel agents. They can then receive commission payments from the hotels for any business booked on their websites.
Individual hotel websites
An increasing number of hotels are building their own websites to allow them to market their hotels directly to consumers. Non-franchise chain hotels require a "booking engine" application to be attached to their website to permit people to book rooms in real time. One advantage of booking with the hotel directly is the use of the hotel's full cancellation policy as well as not needing a deposit in most situations.
The online booking engine applications are supported by Content management system(CMS).
Database systems
To improve the likelihood of filling rooms, hotels tend to use several of the above systems. The content on many hotel reservation systems is becoming increasingly similar as more hotels sign up to all the sites. Companies thus have to either rely on specially negotiated rates with the hotels and hotel chains or trust in the influence of search engine rankings to draw in customers.
See also
Travel technology
References
Travel technology |
https://en.wikipedia.org/wiki/Channel%201 | Channel One or channel 1 may refer to:
Television networks and channels
Channel One (Albania) - Albania
10 Bold, an Australian television channel formerly known as One - Australia
Channel 1 (Bangladeshi TV channel) - Bangladeshi
BNT 1 - Bulgaria
One (Canadian TV channel) - Canada
Canal 1 - Colombia
Dubai One, Middle East and North Africa - Dubai
TF1, French flagship television channel from TF1 Group - France
Das Erste, German flagship channel from ARD - Germany
One (German TV channel) - Germany
Channel 1 (Iran) - Iran
RTÉ One, Irish flagship television channel from RTÉ - Ireland
Channel 1 (Israel) - Israel
Rai 1, Italian flagship television channel from Rai -Italy
One (Maltese TV channel) - Malta
Azteca Uno, a television network in Mexico using virtual channel 1 - Mexico
C1 Television - Mongolia
NPO 1, Dutch flagship television channel from the Nederlandse Publieke Omroep -Netherlands
Channel 1 (North American TV), a defunct channel last occupying the spectrum between 44-50MHz
Channel One Russia - Russia
Soviet TV Channel 1, a defunct flagship television channel from the All-Soviet State Television and Radio Broadcasting Company - USSR
Channel 1 (Syrian TV channel) - Syria
Channel One (British and Irish TV channel), a defunct channel in the UK - UK
BBC One, British flagship television channel from the BBC - UK
NY1, a channel in New York - USA
Other uses
Channel One (band), an Irish rock band
Channel One Studios, a recording studios in Kingston, Jamaica
"Channel One", two techno releases by Juan Atkins
Channel One News, a school television program in the United States
See also
Channel 1 branded TV stations in the United States
Channel 1 virtual TV stations in the United States
TV1 (disambiguation), includes TV One and TVOne
1TV (disambiguation)
01 |
https://en.wikipedia.org/wiki/Education%20in%20North%20Korea | Education in North Korea is universal and state-funded schooling by the government. As of 2021, UNESCO Institute for Statistics does not report any data for North Korea's literacy rates. Some children go through one year of kindergarten, four years of primary education, six years of secondary education, and then on to university. The North Korean state claims its national literacy rate for citizens aged 15 and older is 100 percent.
In 1988, the United Nations Educational, Scientific, and Cultural Organization (UNESCO) reported that North Korea had 35,000 preprimary, 60,000 primary, 111,000 secondary, 23,000 college and university, and 4,000 other postsecondary teachers.
History
Formal education has played a central role in the social and cultural development of both traditional Korea and contemporary North Korea. During the Joseon Dynasty, the royal court established a system of schools that taught Confucian subjects in the provinces as well as in four central secondary schools in the capital. There was no state-supported system of primary education.
During the 15th century, state-supported schools declined in quality and were supplanted in importance by private academies, the seowon, centers of a Neo-Confucian revival in the 16th century. Higher education was provided by the Seonggyungwan, the Confucian national university, in Seoul. Its enrollment was limited to 200 students who had passed the lower civil-service examinations and were preparing for the highest examinations.
The late 19th and early 20th centuries saw major educational changes. The seewan were abolished by the central government. Christian missionaries established modern schools that taught Western curricula. Among them was the first school for women, Ehwa Woman's University, established by American Methodist missionaries as a primary school in Seoul in 1886. During the last years of the dynasty, as many as 3,000 private schools that taught modern subjects to both sexes were founded by missionaries and others.
After Japan annexed Korea in 1910, the colonial regime established an educational system with two goals: to give Koreans a minimal education designed to train them for roles in a modern economy and make them loyal subjects of the Japanese emperor; and to provide a higher quality education for Japanese expatriates who had settled in large numbers on the Korean Peninsula.
The Japanese invested more resources in the latter, and opportunities for Koreans were severely limited. A state university modeled on Tokyo Imperial University was established in Seoul in 1923, but the number of Koreans allowed to study there never exceeded 40 percent of its enrollment; the rest of its students were Japanese. Private universities, including those established by missionaries such as Sungsil College in Pyongyang and Chosun Christian College in Seoul, provided other opportunities for Koreans desiring higher education.
After the establishment of North Korea, an education system modeled |
https://en.wikipedia.org/wiki/United%20Kingdom%20Hydrographic%20Office | The United Kingdom Hydrographic Office (UKHO) is the UK's agency for providing hydrographic and marine geospatial data to mariners and maritime organisations across the world. The UKHO is a trading fund of the Ministry of Defence (MoD) and is located in Taunton, Somerset, with a workforce of approximately 900 staff.
The UKHO is responsible for operational support to the Royal Navy and other defence customers. Supplying defence and the commercial shipping industry, they help ensure Safety of Life at Sea (SOLAS), protect the marine environment and support the efficiency of global trade. Together with other national hydrographic offices and the International Hydrographic Organization (IHO), the UKHO works to set and raise global standards of hydrography, cartography and navigation.
The UKHO also produces a commercial portfolio of ADMIRALTY Maritime Data Solutions, providing SOLAS-compliant charts, publications and digital services for ships trading internationally.
History
Establishment and early operation
The Admiralty's first Hydrographer was Alexander Dalrymple, appointed in 1795 on the order of King George III and the existing charts were brought together and catalogued. The first chart Dalrymple published as Hydrographer to the Admiralty (of Quiberon Bay in Brittany) did not appear until 1800. He also issued Sailing Directions and Notices to Mariners (NMs).
Dalrymple was succeeded on his death in 1808 by Captain Thomas Hurd, under whose stewardship the department was given permission to sell charts to the public in 1821.
In 1819, Captain Hurd entered into a bi-lateral agreement with Denmark to exchange charts and publications covering areas of mutual interest. This is thought to be the earliest formal arrangement for the mutual supply of information between the British and any foreign Hydrographic Office. Hurd developed the specialism of Royal Navy hydrographic surveyors. Rear-Admiral Sir W. Edward Parry was appointed Hydrographer in 1823 after his second expedition to discover a Northwest Passage. In 1825 some 736 charts and coastal views were being offered for sale by the Hydrographic Office.
Explorations
In 1828 Captain Parry and the Royal Society organised a scientific voyage to the South Atlantic, in collaboration with the Hydrographers of France and Spain, using .
In 1829, at the age of 55, Rear-Admiral Sir Francis Beaufort became Hydrographer. During his time as Hydrographer, he developed the eponymous Scale, saw the introduction of official tide tables in 1833 and instigated various surveys and expeditions. Several of these were by , including one to Tierra del Fuego and Patagonia in 1826. In 1831 Captain Beaufort informed Captain FitzRoy that he had found a savant for the latter's surveying voyage to South America, Charles Darwin. After completing extensive surveys in South America he returned to Falmouth, Cornwall via New Zealand and Australia in 1836. By the time of Beaufort's retirement in 1855, the Chart Catalogue listed |
https://en.wikipedia.org/wiki/TDS%20Metrocom | TDS Metrocom is TDS Telecom's local phone business, providing customers with phone, data, and Internet services in a five-state area in the midwestern United States. Its central office is located at 3416 University Ave in Madison, Wisconsin. Unlike Telecom, Metrocom used a deal brokered by Tommy Thompson to allow for local phone service competition on AT&T's lines in exchange for long distance plan selling rights over landline. They are no longer offering this service to new residential subscribers, but continue to maintain existing contracts, new features, or new locations on existing accounts.
Current residential status
TDS Metrocom is currently in maintenance mode, where they are allowed to maintain existing telephone and Internet installations but not add any new telephone or Internet accounts. Business accounts are still available.
External links
TDS Metrocom Webpage
Companies based in Madison, Wisconsin
Internet service providers of the United States |
https://en.wikipedia.org/wiki/Telecommunications%20forecasting | All telecommunications service providers perform forecasting calculations to assist them in planning their networks. Accurate forecasting helps operators to make key investment decisions relating to product development and introduction, advertising, pricing etc., well in advance of product launch, which helps to ensure that the company will make a profit on a new venture and that capital is invested wisely.
Why is forecasting used?
Forecasting can be conducted for many purposes, so it is important that the reason for performing the calculation is clearly defined and understood. Some common reasons for forecasting include:
Planning and Budgeting – Using forecast data can help network planners decide how much equipment to purchase and where to place it to ensure optimum management of traffic loads.
Evaluation – Forecasting can help management decide if decisions that have been made will be to the advantage or detriment of the company.
Verification – As new forecast data becomes available it is necessary to check whether new forecasts confirm the outcomes predicted by the old forecasts.
Knowing the purpose of the forecast will help to answer additional questions such as the following:
What is being forecast? – events, trends, variables, technology
Level of focus – focus on a single product or a whole line, focus on a single company or the entire industry
How often is forecasting conducted? – daily, weekly, monthly, annually
Do the methods used reflect the decisions needed to be taken by management?
What are the resources available to make decisions? – lead-time, staff, relevant data, budget, etc.
What are the types of errors that could occur and what will they cost the company?
Factors influencing forecasting
When forecasting it is important to understand which factors may influence the calculation, and to what extent. A list of some common factors can be seen below:
Technology
subscriber access – fibre, wireless, wired, cellular, TDMA, CDMA, handsets
application – telephony, PBXs, ISDN, videoconferencing, LANs, teleconferencing, internetworking, WANs
technology – broadband, narrowband, carriers, fibre to the curb, DSL
Economics
Global Economics – Economic climate, predictions, estimates, economic factors, interest rates, prime rate, growth, management's outlook, investors' confidence, politics
Sectoral Economics – trends in industry, investors’ outlook, telecommunications, emerging technologies growth rate, recessions, and slowdowns
Macroeconomics – inflation, GDP, exports, monetary exchange rates, imports, government deficit, economic health
Demographics
Measurement of number of people in regions – how many were born, are living and died within a time period
The way people live – health, fertility, marriage rates, ageing rate, conception, mortality
Data preparation
Before forecasting is performed, the data being used must be "prepared". If the data contains errors, then the forecast result will be equally flawed. It is therefore vital th |
https://en.wikipedia.org/wiki/Limited%20availability | When customers of a public switched telephone network make telephone calls, they utilize a telecommunications network called a switched-circuit network. In a switched-circuit network, devices known as switches are used to connect the calling party to the called party. Each switch has a number of inlets and outlets, and by connecting a specific inlet to the correct outlet, each switch helps to complete an end-to-end circuit between users. This method is used in, for example graded multiple banks of selectors.
In a modern circuit-switched network, switches can connect any inlet to any outlet; this is known as full availability.
References
Kennedy I., Lost Call Theory, Lecture Notes, ELEN5007: Teletraffic Engineering, School of Electrical and Information Engineering, University of the Witwatersrand, 2005.
Akimaru H., Kawashima K., Teletraffic: Theory and Applications, Springer-Verlag London, 2nd Ed., 1999, p 6.
Farr R.E., Telecommunications Traffic, Tariffs and Costs: An Introduction For Managers, Peter Peregrinus, 1988, p 90.
Notes
Telephone exchanges |
https://en.wikipedia.org/wiki/Network%20performance | Network performance refers to measures of service quality of a network as seen by the customer.
There are many different ways to measure the performance of a network, as each network is different in nature and design. Performance can also be modeled and simulated instead of measured; one example of this is using state transition diagrams to model queuing performance or to use a Network Simulator.
Performance measures
The following measures are often considered important:
Bandwidth commonly measured in bits/second is the maximum rate that information can be transferred
Throughput is the actual rate that information is transferred
Latency the delay between the sender and the receiver decoding it, this is mainly a function of the signals travel time, and processing time at any nodes the information traverses
Jitter variation in packet delay at the receiver of the information
Error rate the number of corrupted bits expressed as a percentage or fraction of the total sent
Bandwidth
The available channel bandwidth and achievable signal-to-noise ratio determine the maximum possible throughput. It is not generally possible to send more data than dictated by the Shannon-Hartley Theorem.
Throughput
Throughput is the number of messages successfully delivered per unit time. Throughput is controlled by available bandwidth, as well as the available signal-to-noise ratio and hardware limitations. Throughput for the purpose of this article will be understood to be measured from the arrival of the first bit of data at the receiver, to decouple the concept of throughput from the concept of latency. For discussions of this type, the terms 'throughput' and 'bandwidth' are often used interchangeably.
The Time Window is the period over which the throughput is measured. The choice of an appropriate time window will often dominate calculations of throughput, and whether latency is taken into account or not will determine whether the latency affects the throughput or not.
Latency
The speed of light imposes a minimum propagation time on all electromagnetic signals. It is not possible to reduce the latency below
where s is the distance and cm is the speed of light in the medium (roughly 200,000 km/s for most fiber or electrical media, depending on their velocity factor). This approximately means an additional millisecond round-trip delay (RTT) per 100 km (or 62 miles) of distance between hosts.
Other delays also occur in intermediate nodes. In packet switched networks delays can occur due to queueing.
Jitter
Jitter is the undesired deviation from true periodicity of an assumed periodic signal in electronics and telecommunications, often in relation to a reference clock source. Jitter may be observed in characteristics such as the frequency of successive pulses, the signal amplitude, or phase of periodic signals. Jitter is a significant, and usually undesired, factor in the design of almost all communications links (e.g., USB, PCI-e, SATA, OC-48). In clock |
https://en.wikipedia.org/wiki/Air%20Livonia | Air Livonia was a small airline based at Pärnu Airport in Estonia providing scheduled and charter flights.
Code data
ICAO Code: LIV
Callsign: LIVONIA
Services
Air Livonia operated the following scheduled services (at February 2005):
Pärnu to Kihnu, Ruhnu and Kuressaare.
Fleet
The Air Livonia fleet includes the following aircraft:
Antonov An-28
Antonov An-2
External links
Defunct airlines of Estonia
Airlines established in 1999
Airlines disestablished in 2006
2006 disestablishments in Estonia
1999 establishments in Estonia |
https://en.wikipedia.org/wiki/Breakpoint%20%28disambiguation%29 | A breakpoint is an execution stop point in the code of a computer program.
Breakpoint or break point may also refer to:
BCR (gene), the gene that encodes the breakpoint cluster region protein
Break point, in tennis
Break Point, a 2002 novel by Rosie Rushton
Break Point (film), a 2015 U.S. comedy film
Breakpoint (demoparty), a German demoscene party
Breakpoint (meteorology), a location referred to by meteorologists when issuing watches, warnings, or advisories for specific areas
Breakpoint (novel) a 2007 novel by Richard A. Clarke
Breakpoint ("The Shield"), a 2003 episode of the television show The Shield
Breakpoint, an indicator of a microbial organism's susceptibility or resistance to a particular antimicrobial; see Minimum inhibitory concentration
"Breakpoint", a song by Megadeth on the 1995 album Hidden Treasures
See also
Break Point (disambiguation)
Breaking point (disambiguation)
Point Break, a 1991 action film
Tom Clancy's Ghost Recon Breakpoint, a 2019 online video game by Ubisoft |
https://en.wikipedia.org/wiki/%C3%89cole%20nationale%20sup%C3%A9rieure%20d%27informatique%20pour%20l%27industrie%20et%20l%27entreprise | The École nationale supérieure d'informatique pour l'industrie et l'entreprise (ENSIIE) (National School of Computer Science for Industry and Business), formerly known as Institut d'informatique d'entreprise, is a French public specialising in computer science and applied mathematics.
Students can be admitted to ENSIIE through the selective Concours Mines-Télécom examination, after a strong competition during two years of undergraduate studies in classes préparatoires aux grandes écoles. The selection was done on the Concours Centrale-Supélec examination before 2015. Students can also be admitted through parallel admissions, coming from various IUT as well as multiplie faculties all around France, along with a number of international students through partnerships.
The school belongs to prestigious groups of institutions such as Institut Mines-Télécom, or University of Paris-Saclay (associate member).
The ENSIIE Engineering School was created by the Conservatoire National des Arts et Métiers in 1968.
Initially located in Paris, it is now in Évry (France).
In 2020, the ENSIIE benefits from a network of over 4000 Alumni, engineer who have graduated from the school under any major or type of training.
Academic studies
The admission to Institut d'Informatique d'Entreprise is made through a selective entrance examination, and requires at least two years of preparation (in Classes Préparatoires), or for non-CPGE admissions, highly selective processes including an interview. Each year, around 130~150 new students are admitted.
Courses last 3 years, and the final year can be done in a foreign university, such as the University of Manchester (UK), Oxford University (UK), Aston University (UK), Université de Sherbrooke (Canada).
Some of these collaborations will enable the student to obtain both the ENSIIE degree and the master's degree of the host university.
There also exist multiple partnerships with other international universities that do not involve a double degree in which the students can take a part of. The full list can be found on the official website.
The studies are divided into three major components:
Computer Science: Programming, Databases, Multimedia, Artificial Intelligence, Computer Networks, Hardware, Robotics, Cybersecurity, Video Game Design, Virtual Reality...
Mathematics: Data Science, Operational Research, Formal Methods, Finance, Probabilities, ...
Economics & Management: Management, Entrepreneurship
Some Humanities topics are added: Languages (students have to successfully pass the TOEIC before the end of their studies), Epistemology, ...
A considerable amount of time (11 months during the whole studies) is spent working in companies or research laboratories, corresponding to 3 internships: 2 months at the end of the 1st year, 3 months at the end of the 2nd year, and 6 months at the end of the 3rd year.
The ENSIIE also offers a dual education system, where students enrolled, generally admitted through IUT and par |
https://en.wikipedia.org/wiki/Matrix%20representation | Matrix representation is a method used by a computer language to store matrices of more than one dimension in memory.
Fortran and C use different schemes for their native arrays. Fortran uses "Column Major", in which all the elements for a given column are stored contiguously in memory. C uses "Row Major", which stores all the elements for a given row contiguously in memory.
LAPACK defines various matrix representations in memory. There is also Sparse matrix representation and Morton-order matrix representation.
According to the documentation, in LAPACK the unitary matrix representation is optimized. Some languages such as Java store matrices using Iliffe vectors. These are particularly useful for storing irregular matrices. Matrices are of primary importance in linear algebra.
Basic mathematical operations
An m × n (read as m by n) order matrix is a set of numbers arranged in m rows and n columns. Matrices of the same order can be added by adding the corresponding elements. Two matrices can be multiplied, the condition being that the number of columns of the first matrix is equal to the number of rows of the second matrix. Hence, if an m × n matrix is multiplied with an n × r matrix, then the resultant matrix will be of the order m × r.
Operations like row operations or column operations can be performed on a matrix, using which we can obtain the inverse of a matrix. The inverse may be obtained by determining the adjoint as well. rows and columns are the different classes of matrices
In 3D graphics
The choice of representation for 4×4 matrices commonly used in 3D graphics affects the implementation of matrix/vector operations in systems with packed SIMD instructions:
Row major
With row-major matrix order, it is easy to transform vectors using dot product operations, since the coefficients of each component are sequential in memory. Consequently, this layout may be desirable if a processor supports dot product operations natively. It is also possible to efficiently use a '3×4' affine transformation matrix without padding or awkward permutes.
Column major
With column-major order, a "matrix × vector" multiply can be implemented with vectorized multiply-add operations, if the vector's components are broadcast to each SIMD lane. It is also easy to access the basis vectors represented by a transformation matrix as individual column vectors, as these are contiguous in memory.
See also
Row- and column-major order
Sparse matrix
Skyline matrix
Locality of reference
References
External links
a description of sparse matrices in R.
Matrices
Arrays |
https://en.wikipedia.org/wiki/Rebecca%20Peters | Rebecca Peters is a political advocate for gun control who served as Director of the International Action Network on Small Arms (IANSA) from 2002 to 2010. , Peters was listed on the IANSA board of directors.
Background
Rebecca Peters studied law.
As chair of the Australian National Coalition for Gun Control at the time of the Port Arthur massacre in 1996, Peters contributed to the introduction of stricter gun control in Australia, working on the homogenization of gun laws across Australia's 6 states and 2 territories, the ban on semiautomatic rifles and shotguns, and a year-long buyback that destroyed nearly 700,000 weapons. In a televised debate with Ian McNiven, vice-president of the Firearms Owners Association, the latter declared that guns were necessary for men to defend women against the invasion of Indonesians in Australia, to which she replied that domestic violence was probably a much bigger issue. Thinking his microphone was off, he muttered back «I tell you what, if I was married to Rebecca Peters I'd probably commit domestic violence too», thus exemplifying the gender issue in the gun politics arena.
She worked for the Open Society Institute, a private foundation funded by George Soros. From 2002 to 2010, Rebecca Peters served as Director of the International Action Network on Small Arms (IANSA).
In 2014, she moved to Guatemala to lobby in favor of stricter gun control policies, and to fundraise for the Transitions Foundation of Guatemala, a foundation specialized in helping disabled victims of gun violence.
She has been criticized by the National Rifle Association of America which claims that Peters "is the voice and face of hatred of gun owners and Second Amendment freedoms."
Recognitions
1996: Australian Human Rights Medal for her contribution to researching, educating and lobbying for gun law reforms in Australia.
2007: Officer of the Order of Australia for distinguished service to the community as an advocate and campaigner for gun control.
See also
Gun politics in Australia
Gun politics in the United States
Small arms proliferation issues
References
External links
IANSA - official web site
Interview following U.S. Massacre at Newtown, Connecticut
Living people
Australian activists
Gun control advocates
Year of birth missing (living people)
Officers of the Order of Australia |
https://en.wikipedia.org/wiki/Qatgani | The Qatgani or Qataghani is a horse breed from the former Qataghan province of Afghanistan. It is one of twelve Afghan horse breeds reported to the DAD-IS database of livestock breeds.
The Uzbek mounted raiders of the warlord Abdul Rashid Dostum, who in early 2001 harried the Taliban forces in the Darya Suf valley of north-east Afghanistan, rode Qatgani horses.
References
Horse breeds
Horse breeds originating in Afghanistan |
https://en.wikipedia.org/wiki/Chgrp | The (from change group) command may be used by unprivileged users on various operating systems to change the group associated with a file system object (such as a computer file, directory, or link) to one of which they are a member. A file system object has 3 sets of access permissions, one set for the owner, one set for the group and one set for others. Changing the group of an object could be used to change which users can write to a file.
History
The command was originally developed as part of the Unix operating system by AT&T Bell Laboratories.
It is also available in the Plan 9 and Inferno operating systems and in most Unix-like systems.
The command has also been ported to the IBM i operating system.
Syntax
chgrp [options] group FSO
The group parameter specifies the new group with which the files or directories should be associated. It may either be a symbolic name or an identifier.
The FSO specifies one or more file system objects, which may be the result of a glob expression like .
Frequently implemented options
recurse through subdirectories.
verbosely output names of objects changed. Most useful when is a list.
force or forge ahead with other objects even if an error is encountered.
Example
$ ls -l *.conf
-rw-rw-r-- 1 gbeeker wheel 3545 Nov 04 2011 prog.conf
-rw-rw-r-- 1 gbeeker wheel 3545 Nov 04 2011 prox.conf
$ chgrp staff *.conf
$ ls -l *.conf
-rw-rw-r-- 1 gbeeker staff 3545 Nov 04 2011 prog.conf
-rw-rw-r-- 1 gbeeker staff 3545 Nov 04 2011 prox.conf
The above command changes the group associated with file prog.conf from to (provided the executing user is a member of that group). This could be used to allow members of staff to modify the configuration for programs and .
See also
chmod
chown
Group identifier (Unix)
List of Unix commands
id (Unix)
References
External links
Operating system security
Standard Unix programs
Unix SUS2008 utilities
Plan 9 commands
Inferno (operating system) commands
IBM i Qshell commands
de:Unix-Kommandos#Benutzer- und Rechteverwaltung |
https://en.wikipedia.org/wiki/College%20GameDay%20%28football%20TV%20program%29 | College GameDay (branded as ESPN College GameDay built by The Home Depot for sponsorship reasons) is a pre-game show broadcast by ESPN as part of the network's coverage of college football, broadcast on Saturday mornings during the college football season. In its current form, the program is typically broadcast from the campus of the team hosting a featured game being played that day and features news and analysis of the day's upcoming games.
It first aired in 1987 with Tim Brando as host and Lee Corso and Beano Cook as commentators, giving an overview of college football games. Karie Ross soon became the first female to join the broadcast. The show underwent a radical transformation beginning in 1993, and began incorporating live broadcasts. Today, the only original cast member remaining is Lee Corso, whose appearances have been pre-scripted since suffering a stroke in 2009. Rece Davis serves as host and Kirk Herbstreit is Corso's counterpart. Desmond Howard was added to the cast of the show in 2008. Craig James served as an analyst from 1990 to 1995. Erin Andrews joined the GameDay crew as a co-host and contributor in 2010, replaced in 2012 by Samantha Ponder (and in 2017 by Maria Taylor after Ponder left to become host of Sunday NFL Countdown that same year). In 2015, Rece Davis (also host of the college basketball version of GameDay) replaced Chris Fowler as host of the show. In 2010, the program was expanded from two to three hours, with the opening hour broadcast on ESPNU until 2013.
The show is known for its prediction segment that appears at the end of each broadcast. Typically there are five predictors: Corso, Herbstreit, Howard, Pat McAfee, and an invited guest, usually a celebrity, prominent athlete, or radio personality associated with the host school for that week. The show always concludes with Corso's prediction for the host school's game, after which he dons the mascot's headgear of the team he predicts to win the game, usually to the ire or excitement of local fans. As of October 21, 2023, Corso is 270–135 in his headgear picks. His first headgear pick occurred on October 5, 1996, when he correctly picked the Ohio State Buckeyes over the Penn State Nittany Lions. In 2018, Corso made his first NFL headgear pick when, as a guest on Sunday NFL Countdown, he correctly picked the New Orleans Saints to win their Week 9 game at home against the Los Angeles Rams. Corso made his 400th headgear pick on September 16, 2023 for the Colorado/Colorado State rivalry game, he put on the headgear for Colorado.
As of November 4, 2023, Ohio State – Penn State and Alabama – LSU is the most featured matchup, appearing 12 times on College Gameday. Alabama – Georgia and Florida – Tennessee have been featured 9 times. Alabama – Auburn, Florida – Florida State, Florida State – Miami, Michigan – Ohio State, Army – Navy, and Oklahoma – Texas currently sit at 8.
Crew/Staff
ESPN laid off a large number of on-air staff, including College GameDay hosts |
https://en.wikipedia.org/wiki/Low-Frequency%20Array%20%28LOFAR%29 | The Low-Frequency Array, or LOFAR, is a large radio telescope, with an antenna network located mainly in the Netherlands, and spreading across 7 other European countries as of 2019. Originally designed and built by ASTRON, the Netherlands Institute for Radio Astronomy, it was first opened by Queen Beatrix of The Netherlands in 2010, and has since been operated on behalf of the International LOFAR Telescope (ILT) partnership by ASTRON.
LOFAR consists of a vast array of omnidirectional radio antennas using a modern concept, in which the signals from the separate antennas are not connected directly electrically to act as a single large antenna, as they are in most array antennas. Instead, the LOFAR dipole antennas (of two types) are distributed in stations, within which the antenna signals can be partly combined in analogue electronics, then digitised, then combined again across the full station. This step-wise approach provides great flexibility in setting and rapidly changing the directional sensitivity on the sky of an antenna station. The data from all stations are then transported over fiber to a central digital processor, and combined in software to emulate a conventional radio telescope dish with a resolving power corresponding to the greatest distance between the antenna stations across Europe. LOFAR is thus an interferometric array, using about 20,000 small antennas concentrated in 52 stations since 2019. 38 of these stations are distributed across the Netherlands, built with regional and national funding. The six stations in Germany, three in Poland, and one each in France, Great Britain, Ireland, Latvia, and Sweden, with various national, regional, and local funding and ownership. Italy officially joined the International LOFAR Telescope (ILT) in 2018; construction at the INAF observatory site in Medicina, near Bologna, is planned as soon as upgraded (so-called LOFAR2.0) hardware becomes available. Further stations in other European countries are in various stages of planning. The total effective collecting area is approximately 300,000 square meters, depending on frequency and antenna configuration. Until 2014, data processing was performed by a Blue Gene/P supercomputer situated in the Netherlands at the University of Groningen. Since 2014 LOFAR uses a GPU-based correlator and beamformer, COBALT, for that task. LOFAR is also a technology and science pathfinder for the Square Kilometre Array.
Technical information
LOFAR was conceived as an innovative effort to force a breakthrough in sensitivity for astronomical observations at radio-frequencies below 250 MHz. Astronomical radio interferometers usually consist either of arrays of parabolic dishes (e.g. the One-Mile Telescope or the Very Large Array), arrays of one-dimensional antennas (e.g. the Molonglo Observatory Synthesis Telescope) or two-dimensional arrays of omnidirectional antennas (e.g. Antony Hewish's Interplanetary Scintillation Array).
LOFAR combines aspects of many of th |
https://en.wikipedia.org/wiki/Static%20variable | In computer programming, a static variable is a variable that has been allocated "statically", meaning that its lifetime (or "extent") is the entire run of the program. This is in contrast to shorter-lived automatic variables, whose storage is stack allocated and deallocated on the call stack; and in contrast to objects, whose storage is dynamically allocated and deallocated in heap memory.
Variable lifetime is contrasted with scope (where a variable can be used): "global" and "local" refer to scope, not lifetime, but scope often implies lifetime. In many languages, global variables are always static, but in some languages they are dynamic, while local variables are generally automatic, but may be static.
In general, is the allocation of memory at compile time, before the associated program is executed, unlike dynamic memory allocation or automatic memory allocation where memory is allocated as required at run time.
History
Static variables date at least to ALGOL 60 (1960), where they are known as own variables:
This definition is subtly different from a static variable: it only specifies behavior, and hence lifetime, not storage: an own variable can be allocated when a function is first called, for instance, rather than at program load time.
The use of the word static to refer to these variables dates at least to BCPL (1966), and has been popularized by the C programming language, which was heavily influenced by BCPL. The BCPL definition reads:
Note that BCPL defined a "dynamic data item" for what is now called an automatic variable (local, stack-allocated), not for heap-allocated objects, which is the current use of the term dynamic allocation.
The static keyword is used in C and related languages both for static variables and other concepts.
Addressing
The absolute address addressing mode can only be used with static variables, because those are the only kinds of variables whose location is known by the compiler at compile time. When the program (executable or library) is loaded into memory, static variables are stored in the data segment of the program's address space (if initialized), or the BSS segment (if uninitialized), and are stored in corresponding sections of object files prior to loading.
Scope
In terms of scope and extent, static variables have extent the entire run of the program, but may have more limited scope. A basic distinction is between a static global variable, which has global scope and thus is in context throughout the program, and a static local variable, which has local scope. A static local variable is different from a local variable as a static local variable is initialized only once no matter how many times the function in which it resides is called and its value is retained and accessible through many calls to the function in which it is declared, e.g. to be used as a count variable. A static variable may also have module scope or some variant, such as internal linkage in C, which is a form of file scope |
https://en.wikipedia.org/wiki/Heinrich%20Gustav%20Hotho | Heinrich Gustav Hotho (Berlin, May 22, 1802 – Berlin, December 25, 1873) was a German historian of art and Right Hegelian. He is famous for being the compiler and editor of Hegel's posthumous work Vorlesungen über die Ästhetik ("Lectures on Aesthetics").
Biography
During boyhood he was affected for two years with blindness consequent on an attack of measles. But recovering his sight he studied so hard as to take his degree at Berlin in 1826. A year of travel spent in visiting Paris, London and the Low Countries determined his vocation.
He came home delighted with the treasures which he had seen, worked laboriously for a higher examination and passed as "docent" in aesthetics and art history. In 1829 he was made professor at the university of Berlin. In 1833 GF Waagen accepted him as assistant in the museum of the Prussian capital; and in 1858 he was promoted to the directorship of the Berlin print-room.
During a long and busy life, in which his time was divided between literature and official duties, Hotho's ambition had always been to master the history of the schools of Germany and the Netherlands. Accordingly what he published was generally confined to those countries. In 1842-1843 he gave to the world his account of German and Flemish painting. From 1853 to 1858 he revised and published anew a part of this work, which he called "The school of Hubert van Eyck, with his German precursors and contemporaries."
His attempt later on to write a history of Christian painting overtasked his strength, and remained unfinished. Hotho is important in the history of aesthetics as having developed Hegel's theories; but he was deficient in knowledge of Italian painting.
References
1802 births
1873 deaths
German art historians
German male non-fiction writers
Academic staff of the Humboldt University of Berlin
Hegelian philosophers
19th-century German philosophers |
https://en.wikipedia.org/wiki/Klumpke%20paralysis | Klumpke's paralysis is a variety of partial palsy of the lower roots of the brachial plexus. The brachial plexus is a network of spinal nerves that originates in the back of the neck, extends through the axilla (armpit), and gives rise to nerves to the upper limb. The paralytic condition is named after Augusta Déjerine-Klumpke.
Signs and symptoms
Symptoms can range from minor to severe and can be obvious or subtle. The right arm and hand are more likely to be affected than the left. Symptoms include atrophy of the arm or hand, claw hand, constant crying (due to pain), intrinsic minus hand deformity, paralysis of intrinsic hand muscles, and C8/T1 Dermatome distribution numbness. Involvement of T1 may result in Horner's syndrome, with ptosis, and miosis. Weakness or lack of ability to use specific muscles of the shoulder or arm. It can be contrasted to Erb-Duchenne's palsy, which affects C5 and C6.
Cause
Klumpke's paralysis is a form of paralysis involving the muscles of the forearm and hand, resulting from a brachial plexus injury in which the eighth cervical (C8) and first thoracic (T1) nerves are injured either before or after they have joined to form the lower trunk. The subsequent paralysis affects, principally, the intrinsic muscles of the hand (notably the interossei, thenar and hypothenar muscles) and the flexors of the wrist and fingers (notably flexor carpi ulnaris and ulnar half of the flexor digitorum profundus). The classic presentation of Klumpke's palsy is the “claw hand” where the forearm is supinated, the wrist extended and the fingers flexed. If Horner syndrome is present, there is miosis (constriction of the pupils) in the affected eye.
The injury can result from difficulties in childbirth. The most common aetiological mechanism is caused by a traumatic vaginal delivery. The risk is greater when the mother is small or when the infant is of large weight. Risk of injury to the lower brachial plexus results from traction on an abducted arm, as with an infant being pulled from the birth canal by an extended arm above the head or with someone catching themselves by a branch as they fall from a tree. Lower brachial plexus injuries should be distinguished from upper brachial plexus injuries, which can also result from birth trauma but give a different syndrome of weakness known as Erb's palsy.
Other trauma, such as motorcycle accidents, that have similar spinal cord injuries to C8 and T1, also show the same symptoms of Klumpke's paralysis.
Diagnosis
Electromyography and nerve conduction velocity testing can help to diagnose the location and severity of the lesion. Otherwise, the diagnosis is one made clinically after a thorough neurologic exam.
Treatment
Treatment effectiveness varies depending on the initial severity of the injury. Physiotherapy is used to increase strength of muscle and improve muscle functions. Electrical modalities such as electric nerve stimulation can also be used.
Occupational therapy to provide exercises |
https://en.wikipedia.org/wiki/280%20Philia | Philia (minor planet designation: 280 Philia) is a fairly large Main belt asteroid. It was discovered by Johann Palisa on 29 October 1888 at the Vienna Observatory.
Sparse data collected during a 1987 study indicated this asteroid has a rotation period of approximately 64 hours, which is much longer than can be continually observed from one site. During 2010−2011, an international collaboration to study the asteroid collected 9,037 photometric data points over 38 sessions. The resulting light curve analysis displays a rotation period of with a brightness variation of in magnitude.
References
External links
Background asteroids
Philia
Philia
18881029 |
https://en.wikipedia.org/wiki/THE%20multiprogramming%20system | The THE multiprogramming system or THE OS was a computer operating system designed by a team led by Edsger W. Dijkstra, described in monographs in 1965-66 and published in 1968.
Dijkstra never named the system; "THE" is simply the abbreviation of "Technische Hogeschool Eindhoven", then the name (in Dutch) of the Eindhoven University of Technology of the Netherlands. The THE system was primarily a batch system that supported multitasking; it was not designed as a multi-user operating system. It was much like the SDS 940, but "the set of processes in the THE system was static".
The THE system apparently introduced the first forms of software-based paged virtual memory (the Electrologica X8 did not support hardware-based memory management), freeing programs from being forced to use physical locations on the drum memory. It did this by using a modified ALGOL compiler (the only programming language supported by Dijkstra's system) to "automatically generate calls to system routines, which made sure the requested information was in memory, swapping if necessary". Paged virtual memory was also used for buffering input/output (I/O) device data, and for a significant portion of the operating system code, and nearly all the ALGOL 60 compiler. In this system, semaphores were used as a programming construct for the first time.
Design
The design of the THE multiprogramming system is significant for its use of a layered structure, in which "higher" layers depend on "lower" layers only:
Layer 0 was responsible for the multiprogramming aspects of the operating system. It decided which process was allocated to the central processing unit (CPU), and accounted for processes that were blocked on semaphores. It dealt with interrupts and performed the context switches when a process change was needed. This is the lowest level. In modern terms, this was the scheduler.
Layer 1 was concerned with allocating memory to processes. In modern terms, this was the pager.
Layer 2 dealt with communication between the operating system and the system console.
Layer 3 managed all I/O between the devices attached to the computer. This included buffering information from the various devices.
Layer 4 consisted of user programs. There were 5 processes: in total, they handled the compiling, executing, and printing of user programs. When finished, they passed control back to the schedule queue, which was priority-based, favoring recently started processes and ones that blocked because of I/O.
Layer 5 was the user; as Dijkstra notes, "not implemented by us".
The constraint that higher layers can only depend on lower layers was imposed by the designers in order to make reasoning about the system (using quasi-formal methods) more tractable, and also to facilitate building and testing the system incrementally. The layers were implemented in order, layer 0 first, with thorough testing of the abstractions provided by each layer in turn. This division of the kernel into layers was simil |
https://en.wikipedia.org/wiki/Michael%20Calce | Michael Calce (born 1984, also known as MafiaBoy) is a security expert and former computer hacker from Île Bizard, Quebec, who launched a series of highly publicized denial-of-service attacks in February 2000 against large commercial websites, including Yahoo!, Fifa.com, Amazon.com, Dell, Inc., E*TRADE, eBay, and CNN. He also launched a series of failed simultaneous attacks against nine of the thirteen root name servers.
Early life
Calce was born in the West Island area of Montreal, Quebec. When he was five, his parents separated and he lived with his mother after she had won a lengthy battle for primary custody. Every second weekend he would stay at his father's condo in Montreal proper. He felt isolated from his friends back home and troubled by the separation of his parents, so his father purchased him his own computer at the age of six. It instantly had a hold on him: "I can remember sitting and listening to it beep, gurgle and churn as it processed commands. I remember how the screen lit up in front of my face. There was something intoxicating about the idea of dictating everything the computer did, down to the smallest of functions. The computer gave me, a six-year-old, a sense of control and command. Nothing else in my world operated that way."
Project Rivolta
On February 7, 2000, Calce targeted Yahoo! with a project he named Rivolta, meaning "rebellion" in Italian. Rivolta was a DDoS (distributed-denial-of-service) attack in which servers become overloaded with different types of communications to the point where they become unresponsive to commands. At the time, Yahoo! was a multibillion-dollar web company and the top search engine. Mafiaboy's Rivolta managed to shut down Yahoo! for almost an hour. Calce's goal was, according to him, to establish dominance for himself and TNT, his cybergroup, in the cyberworld. Buy.com was targeted in a similar attack afterwards that has been attributed to Calce. Calce claims he was not responsible and that a different hacker performed the DDOS as a challenge to coax him into targeting other websites. Calce responded to this in turn by bringing down eBay, CNN, Amazon, and Dell via DDoS over the next week.
In a 2011 interview, Calce claimed that the attacks had been launched unwittingly, after inputting known addresses in a security tool he had downloaded from a repository on the now defunct file-sharing platform Hotline, developed by Hotline Communications. Calce left for school, forgetting the application which continued the attacks during most of the day. Upon coming home Calce says that he found his computer crashed, and restarted it unaware of what had gone on during the day. Calce claimed that when he overheard the news and recognized the companies mentioned being those he had inputted earlier in the day, he "started to understand what might have happened".
Aftermath
The U.S. Federal Bureau of Investigation and the Royal Canadian Mounted Police first noticed Calce when he started claiming in IR |
https://en.wikipedia.org/wiki/Rodrigues%27%20rotation%20formula | In the theory of three-dimensional rotation, Rodrigues' rotation formula, named after Olinde Rodrigues, is an efficient algorithm for rotating a vector in space, given an axis and angle of rotation. By extension, this can be used to transform all three basis vectors to compute a rotation matrix in , the group of all rotation matrices, from an axis–angle representation. In terms of Lie theory, the Rodrigues' formula provides an algorithm to compute the exponential map from the Lie algebra to its Lie group .
This formula is variously credited to Leonhard Euler, Olinde Rodrigues, or a combination of the two. A detailed historical analysis in 1989 concluded that the formula should be attributed to Euler, and recommended calling it "Euler's finite rotation formula." This proposal has received notable support, but some others have viewed the formula as just one of many variations of the Euler–Rodrigues formula, thereby crediting both.
Statement
If is a vector in and is a unit vector describing an axis of rotation about which rotates by an angle according to the right hand rule, the Rodrigues formula for the rotated vector is
The intuition of the above formula is that the first term scales the vector down, while the second skews it (via vector addition) toward the new rotational position. The third term re-adds the height (relative to ) that was lost by the first term.
An alternative statement is to write the axis vector as a cross product of any two nonzero vectors and which define the plane of rotation, and the sense of the angle is measured away from and towards . Letting denote the angle between these vectors, the two angles and are not necessarily equal, but they are measured in the same sense. Then the unit axis vector can be written
This form may be more useful when two vectors defining a plane are involved. An example in physics is the Thomas precession which includes the rotation given by Rodrigues' formula, in terms of two non-collinear boost velocities, and the axis of rotation is perpendicular to their plane.
Derivation
Let be a unit vector defining a rotation axis, and let be any vector to rotate about by angle (right hand rule, anticlockwise in the figure), producing the rotated vector .
Using the dot and cross products, the vector can be decomposed into components parallel and perpendicular to the axis ,
where the component parallel to is called the vector projection of on ,
,
and the component perpendicular to is called the vector rejection of from :
,
where the last equality follows from the vector triple product formula: . Finally, the vector is a copy of rotated 90° around . Thus the three vectors form a right-handed orthogonal basis of , with the last two vectors of equal length.
Under the rotation, the component parallel to the axis will not change magnitude nor direction:
while the perpendicular component will retain its magnitude but rotate its direction in the perpendicular plane spa |
https://en.wikipedia.org/wiki/Ultima%3A%20Escape%20from%20Mt.%20Drash | Ultima: Escape from Mt. Drash is a role-playing video game published for the VIC-20 home computer by Sierra On-Line in 1983.
Gameplay and plot
In the game, creatures called "garrintrots" have imprisoned the player in Mt. Drash, and the player's task is to escape the dungeons.
The game itself is a very simple series of three-dimensional randomly generated dungeons, and the idea is to destroy all monsters that stand in way and exit to the next level. There is a time limit as well. The game doesn't employ custom graphics, but rather uses the VIC-20's standard set of graphical characters to draw the game scene.
The game was also notable for its soundtrack; using the 4-voice sound capabilities of the MOS Technology VIC video chip in the VIC-20 to provide background music. Very few games written for the VIC-20 featured such a background soundtrack that would become commonplace in games for the Commodore 64, Nintendo Entertainment System, etc.
The source code was written in VIC-BASIC, with assembly language routines for faster animation of graphics and to handle the background music. Unlike most of the more popular VIC-20 games, it wasn't published as a ROM cartridge but rather on cassette tape. Due to the complexity of the source code and the unusual (by VIC-20 standards) length of the game, as well as the fact that unlike a cartridge game all of it had to fit in RAM, an 8k or 16k RAM memory expansion cartridge was required to be installed in the VIC-20 before running the game, further limiting the target audience.
Copy protection consisted of the RUN-STOP and RESTORE keys on the VIC-20 keyboard being disabled (to prevent "breaking in" to the BASIC code), as well as the original cassette being recorded and mastered in a way which made duplicating on a dual-cassette deck troublesome.
The game itself doesn't tie in to the Ultima series in too many ways. Both have a fantasy setting, Mt. Drash is the name of a dungeon in Ultima I, and the name "garrintrots" is an obvious pun on Richard Garriot's surname; but there the similarity ends.
Development
The game was written by Keith Zabalaoui for Sierra On-Line in 1983. Sierra, which had published Ultima II, named the game an Ultima to improve its sales. Richard Garriott gave permission to the company and Zabalaoui—a friend who had worked on previous games for him—to do so. Sierra was skeptical of the game's appeal given the declining VIC-20 market and need for memory expansion, and only manufactured the few thousand copies needed to meet contractual requirements, with one advertisement in the July 1983 Compute! describing it as "A real-time, fantastic adventure" and part of the SierraVenture series. Sierra even denied the game ever existed, until Zabalaoui confirmed it actually was finished and was shipped to retailers. Further proof can be found in the Sierra On-Line Consumer Price List for First Quarter 1984 where the game is listed at $19.95 with a stock number of 40245202. Approximately 3000 units wer |
https://en.wikipedia.org/wiki/Admin | Admin may refer to:
An abbreviated form of the words Administration or administrator, particularly in computing contexts
Admin, son of Arni, a minor biblical figure
See also |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.