source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/Sony%20Cyber-shot%20DSC-F717 | The Sony Cybershot DSC-F717 is a bridge digital camera, introduced by Sony in September 2002.
Overview
F717 features the same 5.0 megapixel CCD sensor and 38–190 mm equiv. Carl Zeiss Vario-Sonnar lens as its predecessor, the 2001 DSC-F707. Major changes / improvements over the F707 include:
Analog focus ring can now double as a zoom ring
Addition of a "P" mode, ISO 800 option, and (with constraints) 1/2000 shutter speed
Better Noise Reduction Algorithm; NR automatically applies for slower than 1/30 shots
More natural color rendition (in particular, less "red overshoot")
Quick Review: The last photo can be reviewed by holding on the shutter button after the photo is taken.
USB 2.0 for faster file transfer to a PC or a printer
Supports Memory Stick Pro with capacity of 256MB and up (original Memory Stick has a maximum capacity of 128MB per side)
F717 retained all distinctive features from F707, such as:
Swivel body design: the lens can be rotated from 36 degrees down to 77 degrees up.
Hologram AF Assist: projects a laser grid to help acquire AF lock in low-light environments.
NightShot and NightFraming: In these modes, infrared cut-off filter is temporarily lifted away from CCD, enabling IR detection, which practically allows the camera to "see in the dark". Two infrared LEDs provide short-range active IR illumination in both Night modes. In NightShot mode, Aperture and shutter parameters are forced to "auto", because of potential "see through clothing" concerns.
LCD/EVF switchable via a hard switch on the back
The F717 was succeeded by DSC-F828 in August 2003.
Defective batches
Some very early production units may experience inaccurate focus with Laser Hologram on. Sony admitted the problem as a minor design flaw, and offered free examination and repair service. Serial numbers of potentially affected units were also announced. According to Sony, it is fixable by correcting a wrong parameter with Sony factory adjustment software. The fix was only performed at Sony service centers.
Around 2004–05, many F717 users reported CCD-related defects. It was later confirmed that many Sony CCDs made from late 2002 to early 2004 suffer from a large-scale manufacturing defect. Interestingly, the aforementioned first-run units seem to be immune to this failure, as they used CCDs built from old production techniques. As a remedy, Sony offered free CCD replacements for affected units till 2007, and in some countries, till 2010. This recall would cover units with expired warranty.
References
DP Review
F717
Bridge digital cameras
Digital cameras with CCD image sensor
Cameras introduced in 2002 |
https://en.wikipedia.org/wiki/List%20of%20The%20Strip%20episodes | The Strip is an Australian television show which aired from 4 September 2008 to 27 November 2008 on the Nine Network. The series was cancelled in November 2008, due to disappointing ratings. The series took much inspiration from CSI: Miami with its aerial shots of beaches and sparkling surf, and was filmed on location on the Gold Coast, Queensland.
Cast
Aaron Jeffery - Detective Jack Cross
Vanessa Gray - Detective Frances "Frankie" Tully
Simone McAullay - Plain Clothes Constable Jessica Mackay
Bob Morley - Plain Clothes Constable Tony Moretti
Frankie J. Holden - Inspector Max Nelson
List of episodes
References
External links
The Strip Official Website
Lists of Australian drama television series episodes
2008 Australian television seasons |
https://en.wikipedia.org/wiki/Counting%20points%20on%20elliptic%20curves | An important aspect in the study of elliptic curves is devising effective ways of counting points on the curve. There have been several approaches to do so, and the algorithms devised have proved to be useful tools in the study of various fields such as number theory, and more recently in cryptography and Digital Signature Authentication (See elliptic curve cryptography and elliptic curve DSA). While in number theory they have important consequences in the solving of Diophantine equations, with respect to cryptography, they enable us to make effective use of the difficulty of the discrete logarithm problem (DLP) for the group , of elliptic curves over a finite field , where q = pk and p is a prime. The DLP, as it has come to be known, is a widely used approach to public key cryptography, and the difficulty in solving this problem determines the level of security of the cryptosystem. This article covers algorithms to count points on elliptic curves over fields of large characteristic, in particular p > 3. For curves over fields of small characteristic more efficient algorithms based on p-adic methods exist.
Approaches to counting points on elliptic curves
There are several approaches to the problem. Beginning with the naive approach, we trace the developments up to Schoof's definitive work on the subject, while also listing the improvements to Schoof's algorithm made by Elkies (1990) and Atkin (1992).
Several algorithms make use of the fact that groups of the form are subject to an important theorem due to Hasse, that bounds the number of points to be considered. Hasse's theorem states that if E is an elliptic curve over the finite field , then the cardinality of satisfies
Naive approach
The naive approach to counting points, which is the least sophisticated, involves running through all the elements of the field and testing which ones satisfy the Weierstrass form of the elliptic curve
Example
Let E be the curve y2 = x3 + x + 1 over . To count points on E, we make a
list of the possible values of x, then of the quadratic residues of x mod 5 (for lookup purpose only), then of x3 + x + 1 mod 5, then of y of x3 + x + 1 mod 5. This yields the points on E.
E.g. the last row is computed as follows: If you insert in the equation x3 + x + 1 mod 5 you get as result (3rd column). This result can be achieved if (Quadratic residues can be looked up in the 2nd column). So the points for the last row are .
Therefore, has cardinality of 9: the 8 points listed before and the point at infinity.
This algorithm requires running time O(q), because all the values of must be considered.
Baby-step giant-step
An improvement in running time is obtained using a different approach: we pick an element by selecting random values of until is a square in and then computing the square root of this value in order to get .
Hasse's theorem tells us that lies in the interval . Thus, by Lagrange's theorem, finding a unique lying in this interval and satis |
https://en.wikipedia.org/wiki/Aeolochroma%20metarhodata | Aeolochroma metarhodata, the tea-tree emerald, is a moth of the family Geometridae first described by Francis Walker in 1863. It is found in the Australian states of Queensland, New South Wales, and Victoria.
The larvae feed on Leptospermum polygalifolium.
References
Moths described in 1863
Pseudoterpnini
Moths of Australia |
https://en.wikipedia.org/wiki/3M%20%28disambiguation%29 | 3M is an American multinational conglomerate corporation.
3M may also refer to:
3M computer
3-M syndrome, or dolichospondylic dysplasia, gloomy face syndrome, le Merrer syndrome
Myasishchev 3M, Soviet bomber, NATO reporting name Bison-B
Military Mapping Maidens, U.S. women mapmakers during World War II
3-metre springboard
The IATA code for Silver Airways
See also
Triple M (disambiguation)
MMM (disambiguation)
M3 (disambiguation) |
https://en.wikipedia.org/wiki/CITIC%20Guoan%20Information%20Industry | CITIC Guoan Information Industry Co., Ltd. is a Chinese publicly traded company in the computer network infrastructure and information service industries. It includes the construction and operation of cable television networks and satellite information networks, the network system integration, software development and value-added telecommunications services. It was founded in 1997 by its parent company, state-owned enterprise CITIC Guoan Group (now mostly owned by private capitals). It was listed on the Shenzhen Stock Exchange at the same year.
CITIC Guoan Information Industry is a constituent of SZSE 100 Index (blue chip of Shenzhen Stock Exchange) and pan-China index CSI 300 Index (top 300 companies of the two exchanges of the mainland China), as well as its sub-index CSI 200 Index (101st to 300th companies of the two exchanges of the mainland China).
References
External links
Companies listed on the Shenzhen Stock Exchange
Government-owned companies of China
Companies based in Beijing
Chinese companies established in 1997
Networking companies
CITIC Group
Privatization in China |
https://en.wikipedia.org/wiki/Terascale | In computing, terascale may refer to
Intel Tera-Scale
AMD TeraScale (microarchitecture)
See also petascale computing. |
https://en.wikipedia.org/wiki/Scribe%20%28log%20server%29 | Scribe was a server for aggregating log data streamed in real-time from many servers. It was designed to be scalable, extensible without client-side modification, and robust to failure of the network or any specific machine.
Scribe was developed at Facebook and released in 2008 as open source.
Scribe servers are arranged in a directed graph, with each server knowing only about the next server in the graph. This network topology allows for adding extra layers of fan-in as a system grows, and batching messages before sending them between datacenters, without having any code that explicitly needs to understand datacenter topology, only a simple configuration.
Scribe was designed to consider reliability but to not require heavyweight protocols and expansive disk usage. Scribe spools data to disk on any node to handle intermittent connectivity node failure, but doesn't sync a log file for every message. This creates a possibility of a small amount of data loss in the event of a crash or catastrophic hardware failure. However, this degree of reliability is often suitable for most Facebook use cases.
See also
Apache Flume
Fluentd: Log Everything in JSON
Enabling Facebook’s Log Infrastructure with Fluentd
Notes and references
External links
Open Source - Facebook Developers
The real value of Scribe for open source
Scribe project on GitHub
Free software
Facebook software
2008 software |
https://en.wikipedia.org/wiki/Datang%20Youxia%20Zhuan | Datang Youxia Zhuan is a wuxia novel by Liang Yusheng first published as a serial between 1 January 1963 and 14 June 1964 in the Hong Kong newspaper Ta Kung Pao. The first part of a trilogy, the novel is followed by Longfeng Baochai Yuan and Huijian Xinmo.
Plot
The novel is set in China during the Tianbao era (742–756) of the Tang dynasty. Emperor Xuanzong appoints Yang Guozhong as chancellor because his cousin, Yang Yuhuan, is the emperor's favourite concubine. Nepotism and corruption become widespread in the Tang government as Yang Guozhong and his relatives and supporters dominate the political scene. Meanwhile, An Lushan wins the emperor's trust through flattery and gets promoted to military governor of Fanyang. He covertly builds up his forces in preparation for a rebellion against the Tang government.
In the wulin (martial artists' community), Dou Lingkan and Wang Botong compete fiercely for the position of chief of the wulin. Dou Lingkan and his brothers have the support of Duan Guizhang, a renowned swordsman who is also Dou's brother-in-law. On the other hand, Wang Botong forms a secret alliance with An Lushan, recruits many followers, and sends his children to be trained by martial arts experts.
Duan Guizhang maintains a close friendship with Shi Yiru, a former bureaucrat. Their wives give birth to a boy, Duan Keye, and a girl, Shi Ruomei, respectively. When An Lushan sends his men to bring Duan Guizhang to meet him, Duan is not in at the time, so Shi Yiru goes in his place and ends up being detained by An Lushan. After Duan Guizhang finds out, he brings along Tie Mole, Dou Lingkan's godson, to An Lushan's base to rescue Shi Yiru. They fail in their mission; Shi Yiru is killed while Duan Guizhang sustains serious injuries. Luckily for them, they are saved by Nan Jiyun and Huangfu Song.
Kongkong'er, one of Wang Botong's followers, kidnaps the baby Duan Keye and uses him as a hostage to force Duan Guizhang to withdraw his support for Dou Lingkan. Eventually, Dou Lingkan is killed by Wang Yanyu, Wang Botong's daughter, in a fight and the Dous are massacred by the Wangs. With Nan Jiyun's help, Tie Mole escapes and vows to avenge his godfather. Duan Guizhang then sends Tie Mole to learn martial arts from Bu Anqi, a reclusive master.
Seven years later, after Tie Mole has achieved a high level of mastery in martial arts, he returns to the wulin and finds himself caught up in the chaos of a rebellion started by An Lushan. He embarks on a series of adventures, undermining the rebels by capturing Wang Botong's stronghold, and exposing the truth behind a 20-year-old mystery and helping to clear Huangfu Song's name. At the same time, he gets entangled in a love triangle with Wang Yanyu, whom he has fallen in love with even though she killed his godfather; and Han Zhifen, another maiden he meets on his adventures.
At one point, Tie Mole saves Emperor Xuanzong and flees with him after the capital cities Luoyang and Chang'an fall to the rebels. |
https://en.wikipedia.org/wiki/GoldED | GoldED was a popular message editor for FidoNet-compatible computer networks.
In 1998, Odinn Sørensen released the source code of GoldED and Goldware Utilities 3.x under GNU General Public License version 2, and the Goldware Library under GNU Library General Public License version 2. A permission has also been given to link that all with software conforming with the Open Source Definition.
The code of one of the libraries used by GoldED and GoldED+, CXL, has been licensed by Sørensen from its author, Mike Smedley. Since then the copyright has been taken over by “Innovative Data Concepts”, which, as Sørensen suspected in 1998, has disappeared. This was one of the reasons for removing the goldedplus package from Debian repositories in 2006.
By 1999, all the developers of GoldED left FidoNet.
GoldED+
The development still continued in a stylecode-related fork maintained by Alexander S. Aganichev (ASA) called “GoldED-asa”. When the file names of “GoldED-asa” didn’t fit in the MS-DOS length limit anymore, the fork has been renamed to “GoldED+”.
By 2007 GoldED+ was the most popular cross-platform message editor in Russian-speaking FidoNet.
Actually, the development has been moved to GoldED+ at GitHub
See also
References
FidoNet software
C++ software
Cross-platform software |
https://en.wikipedia.org/wiki/Vision | Vision, Visions, or The Vision may refer to:
Perception
Optical perception
Visual perception, the sense of sight
Visual system, the physical mechanism of eyesight
Computer vision, a field dealing with how computers can be made to gain understanding from digital images or videos
Machine vision, technology for imaging-based automatic inspection
Perception of the future
Foresight (psychology), in business, the ability to envisage future market trends and plan accordingly
Goal, a desired result
Vision statement, a declaration of objectives to guide decision-making
Other perceptions
Vision (spirituality), a supernatural experience that conveys a revelation
Hallucination, a perception of something that does not exist
Arts and media
Events
Visions (convention), a science fiction event
Vision Festival, a New York City art festival
Film and television
The Vision (film), 1998 British television movie
Vision (2009 film), German film
Vision (2018 film), Japanese-French film
Visions (2015 film), American thriller film
Visions (2023 film), French psychological thriller film
Visions (1976 TV series), a 1976–80 anthology series on PBS
Vision (Marvel Cinematic Universe), a film character that debuted in 2015, based on the original Marvel Comics character
"The Vision", episode of Alcoa Presents: One Step Beyond
"The Vision", episode of The Amazing World of Gumball
Star Wars: Visions, a 2022–present anthology series on Disney+
VisionTV, Canadian TV channel
BT Vision, British digital TV service
Literature
Comics
Vision (Marvel Comics), a Marvel Comics superhero character that debuted in 1968
Vision (Jonas), a Marvel Comics character that first appeared in Young Avengers in 2005
Vision (Timely Comics), a Timely Comics character that debuted in 1940
Other literature
Vision (magazine), an Emirati magazine
The Vision (magazine), an Indian spiritual magazine
A Vision, a 1925 nonfiction book by W. B. Yeats
The Vision (novel), a 1977 novel by Dean Koontz
York Vision, a student newspaper
Visions (book), a 1997 science book by Michio Kaku
Music
Albums
Vision (Alpha Blondy album)
Vision (Frank Duval album)
Vision (No Fun at All EP), by No Fun at All
The Vision (WayV EP), 2019
Visions (Atreyu album)
Visions (Dennis Brown album)
Visions (Clearlight album), 1978
Visions (Paul Field album)
Visions (Gladys Knight & the Pips album), 1983
Visions (Bunky Green album), 1978
Visions (Grant Green album), 1971
Visions (Grimes album), 2012
Visions (Haken album), 2011
Visions (Jakatta album)
Visions (Libera album), 2005
Vision (Shankar album), 1983
Visions (Stratovarius album), 1997
Visions (Sun Ra album), 1978
Vision, an album by Luminous
Visions, an album by Disasteradio
Songs
"Vision" (McCoy Tyner song), a 1969 jazz instrumental
"Vision", a song by Dreamcatcher from their 2022 EP Apocalypse: Follow Us
"Vision", a song by Gotthard from their 1998 album Open
"Vision", a song by Peter Hammill from his 1971 album Fool's |
https://en.wikipedia.org/wiki/Metadata%20standard | A metadata standard is a requirement which is intended to establish a common understanding of the meaning or semantics of the data, to ensure correct and proper use and interpretation of the data by its owners and users. To achieve this common understanding, a number of characteristics, or attributes of the data have to be defined, also known as metadata.
Metadata
Metadata is often defined as data about data. It is “structured information that describes, explains, locates, or otherwise makes it easier to retrieve, use or manage an information resource”, especially in a distributed network environment like for example the internet or an organization. A good example of metadata is the cataloging system found in libraries, which records for example the author, title, subject, and location on the shelf of a resource. Another is software system knowledge extraction of software objects such as data flows, control flows, call maps, architectures, business rules, business terms, and database schemas.
Metadata is usually categorized in three types:
Descriptive metadata describes an information resource for identification and retrieval through elements such as title, author, and abstract.
Structural metadata documents relationships within and among objects through elements such as links to other components (e.g., how pages are put together to form chapters).
Administrative metadata helps to manage information resources through elements such as version number, archiving date, and other technical information for purposes of file management, rights management and preservation.
Available metadata standards
Metadata elements grouped into sets designed for a specific purpose, e.g., for a specific domain or a particular type of information resource, are called metadata schemas. For every element the name and the semantics (the meaning of the element) are specified. Content rules (how content must be formulated), representation rules (e.g., capitalization rules), and allowed element values (e.g., from a controlled vocabulary) can be specified optionally. Some schemas also specify in which syntax the elements must be encoded, in contrast to syntax independent schemas. Many current schemas use Standard Generalized Markup Language (SGML) or XML to specify their syntax. Metadata schemas that are developed and maintained by standard organizations (such as ISO) or organizations that have taken on such responsibility (such as the Dublin Core Metadata Initiative) are called metadata standards.
Many different metadata schemas are being developed as standards across disciplines, such as library science, education, archiving, e-commerce, and arts. In the table below, an overview of available metadata standards is given.
Sources:
See also
Data dictionary
Metadata
Metamodeling
Metadata registry
BioSharing - registry of standards in the life sciences
References
Records management |
https://en.wikipedia.org/wiki/Somatosensory%20system | In physiology, the somatosensory system is the network of neural structures in the brain and body that produce the perception of touch (haptic perception), as well as temperature (thermoception), body position (proprioception), and pain. It is a subset of the sensory nervous system, which also represents visual, auditory, olfactory, and gustatory stimuli.
Somatosensation begins when mechano- and thermosensitive structures in the skin or internal organs sense physical stimuli such as pressure on the skin (see mechanotransduction, nociception). Activation of these structures, or receptors, leads to activation of peripheral sensory neurons that convey signals to the spinal cord as patterns of action potentials. Sensory information is then processed locally in the spinal cord to drive reflexes, and is also conveyed to the brain for conscious perception of touch and proprioception. Note, somatosensory information from the face and head enters the brain through peripheral sensory neurons in the cranial nerves, such as the trigeminal nerve.
The neural pathways that go to the brain are structured such that information about the location of the physical stimulus is preserved. In this way, neighboring neurons in the somatosensory cerebral cortex in the brain represent nearby locations on the skin or in the body, creating a map, also called a cortical homunculus.
System overview
Sensory receptors
The four mechanoreceptors in the skin each respond to different stimuli for short or long periods.
Merkel cell nerve endings are found in the basal epidermis and hair follicles; they react to low vibrations (5–15 Hz) and deep static touch such as shapes and edges. Due to having a small receptive field (extremely detailed information), they are used in areas like fingertips the most; they are not covered (shelled) and thus respond to pressures over long periods.
Tactile corpuscles react to moderate vibration (10–50 Hz) and light touch. They are located in the dermal papillae; due to their reactivity, they are primarily located in fingertips and lips. They respond in quick action potentials, unlike Merkel nerve endings. They are responsible for the ability to read Braille and feel gentle stimuli.
Pacinian corpuscles determine gross touch and distinguish rough and soft substances. They react in quick action potentials, especially to vibrations around 250 Hz (even up to centimeters away). They are the most sensitive to vibrations and have large receptor fields. Pacinian corpuscles react only to sudden stimuli so pressures like clothes that are always compressing their shape are quickly ignored. They have also been implicated in detecting the location of touch sensations on handheld tools.
Bulbous corpuscles react slowly and respond to sustained skin stretch. They are responsible for the feeling of object slippage and play a major role in the kinesthetic sense and control of finger position and movement. Merkel and bulbous cells - slow-response - are myelinate |
https://en.wikipedia.org/wiki/Plug%20computer | A plug computer is an external device, often configured for use in the home or office as a compact computer. The name is derived from the small configuration of such devices; they are often enclosed in an AC power plug or AC adapter.
Description
Plug computers consist of a high-performance, low-power system-on-a-chip processor, with several I/O hardware ports (USB ports, Ethernet connectors, etc.). Most versions do not have provisions for connecting a display and are best suited as running media servers, back-up services, or file sharing and remote access functions; thus acting as a bridge between in-home protocols (such as Digital Living Network Alliance (DLNA) and Server Message Block (SMB)) and cloud-based services. There are, however, plug computer offerings that have analog VGA monitor and/or HDMI connectors, which, along with multiple USB ports, permit the use of a display, keyboard, and mouse, thus making them full-fledged, low-power alternatives to desktop and laptop computers. They typically run any of a number of Linux distributions.
Plug computers typically consume little power and are inexpensive.
History
A number of other devices of this type began to appear at the 2009 Consumer Electronics Show.
On January 6, 2009 CTERA Networks launched a device called CloudPlug that provides online backup at local disk speeds and overlays a file sharing service. The device also transforms any external USB hard drive into a network-attached storage device.
On January 7, 2009, Cloud Engines unveiled Pogoplug network access server.
On January 8, 2009, Axentra announced availability of their HipServ platform.
On February 23, 2009, Marvell Technology Group announced its plans to build a mini-industry around plug computers.
On August 19, 2009, CodeLathe announced availability of their TonidoPlug network access server.
On November 13, 2009 QuadAxis launched its plug computing device product line and development platform, featuring the QuadPlug and QuadPC and running QuadMix, a modified Linux.
On January 5, 2010, Iomega announced their iConnect network access server.
On January 7, 2010 Pbxnsip launched its plug computing device the sipJack running pbxnsip: an IP Communications platform.
See also
Classes of computers
Computer appliance
CuBox, a plug computer
GuruPlug, a plug computer
DreamPlug, a plug computer
FreedomBox, an operating system
Personal web server
Print server
Raspberry Pi, a single-board computer
SheevaPlug, a plug computer
Stick PC, a computer attached to and powered by a USB or HDMI plug
References
External links
Cloud computing
Classes of computers
Cloud clients
Home servers
Server appliance |
https://en.wikipedia.org/wiki/Velvet%20assembler | Velvet is an algorithm package that has been designed to deal with de novo genome assembly and short read sequencing alignments. This is achieved through the manipulation of de Bruijn graphs for genomic sequence assembly via the removal of errors and the simplification of repeated regions. Velvet has also been implemented in commercial packages, such as Sequencher, Geneious, MacVector and BioNumerics.
Introduction
The development of next-generation sequencers (NGS) allowed for increased cost effectiveness on very short read sequencing. The manipulation of de Bruijn graphs as a method for alignment became more realistic but further developments were needed to address issues with errors and repeats. This led to the development of Velvet by Daniel Zerbino and Ewan Birney at the European Bioinformatics Institute in the United Kingdom.
Velvet works by efficiently manipulating de Bruijn graphs through simplification and compression, without the loss of graph information, by converging non-intersecting paths into single nodes. It eliminates errors and resolves repeats by first using an error correction algorithm that merges sequences together. Repeats are then removed from the sequence via the repeat solver that separates paths which share local overlaps.
The combination of short reads and read pairs allows Velvet to resolve small repeats and produce contigs of reasonable length. This application of Velvet can produce contigs with a N50 length of 50 kb on paired-end prokaryotic data and a 3 kb length for regions of mammalian data.
Algorithm
As already mentioned Velvet uses the de Bruijn graph to assemble short reads. More specifically Velvet represents each different k-mer obtained from the reads by a unique node on the graph. Two nodes are connected if its k-mers have a k-1 overlap. In other words, an arc from node A to node B exists if the last k-1 characters of the k-mer, represented by A, are the first k-1 characters of the k-mer represented by B. The following figure shows an example of a de Bruijn graph generated with Velvet:
The same process is simultaneously done with the reverse complement of all the k-mers to take into account the overlaps between the reads of opposite strands.
A number of optimizations can be done over the graph which includes simplification and error removal.
Simplification
An easy way to save memory costs is to merge nodes that do not affect the path generated in the graph, i.e., whenever a node A has only one outgoing arc that points to node B, with only one ingoing arc, the nodes can be merged. It is possible to represent both nodes as one, merging them and all their information together. The next figure illustrates this process in the simplification of the initial example.
Error removal
Errors in the graph can be caused by the sequencing process or it could simply be that the biological sample contains some errors (for example polymorphisms).
Velvet recognizes three kinds of errors: tips; bubbles; and erroneo |
https://en.wikipedia.org/wiki/Altor | Altor may refer to:
Altor (given name)
Altor Equity Partners, a firm
Altor Networks, cybersecurity business |
https://en.wikipedia.org/wiki/Data%20Privacy%20Day | Data Privacy Day (known in Europe as Data Protection Day) is an international event that occurs every year on 28 January. The purpose of Data Privacy Day is to raise awareness and promote privacy and data protection best practices. It is currently observed in the United States, Canada, Nigeria, Israel and 47 European countries.
Data Privacy Day's educational initiative originally focused on raising awareness among businesses as well as users about the importance of protecting the privacy of their personal information online, particularly in the context of social networking. The educational focus has expanded over the years to include families, consumers and businesses. In addition to its educational initiative, Data Privacy Day promotes events and activities that stimulate the development of technology tools that promote individual control over personally identifiable information; encourage compliance with privacy laws and regulations; and create dialogues among stakeholders interested in advancing data protection and privacy. The international celebration offers many opportunities for collaboration among governments, industry, academia, nonprofits, privacy professionals and educators.
The Convention for the Protection of Individuals with regard to Automatic Processing of Personal Data was opened for signature by the Council of Europe on 28 January 1981. This convention is currently in the process of being updated in order to reflect new legal challenges caused by technological development. The Convention on Cybercrime is also protecting the integrity of data systems and thus of privacy in cyberspace. Privacy including data protection is also protected by Article 8 of the European Convention on Human Rights.
The day was initiated by the Council of Europe to be first held in 2007 as the European Data Protection Day.
Two years later, on 26 January 2009, the United States House of Representatives passed House Resolution HR 31 by a vote of 402–0, declaring 28 January National Data Privacy Day. On 28 January 2009, the Senate passed Senate Resolution 25 also recognizing 28 January 2009 as National Data Privacy Day. The United States Senate also recognized Data Privacy Day in 2010 and 2011.
Participating organizations
A few of the participating organizations for the 28 January 2016 Data Privacy and Protection day include: Anti-Phishing Working Group, Carnegie Mellon University, Cyber Data-Risk Managers, EDUCAUSE, Georgetown University, Federal Trade Commission (FTC), Federal Communications Commission (FCC), Federal Bureau of Investigation (FBI), Identity Theft Council, the Privacy Commissioner of Canada, New York State Attorney General Office, the UK Information Commissioner, and Data Security Council of India.
See also
Information privacy
References
External links
Stay Safe Online website Archived (28 January 2012). National Cyber Security Alliance
Convention 108 of data protection
Information privacy
International observances
January observ |
https://en.wikipedia.org/wiki/Moralzarzal | Moralzarzal is a town in Spain. It is located in the Sierra de Guadarrama, in the Community of Madrid. It had a population of 11,318 in 2008.
Public Transport
Moralzarzal has a big bus network. The bus lines going through Moralzarzal are the following:
670: Collado Villalba (Hospital)
671: Madrid (Moncloa)
672: Madrid (Moncloa) - Cerceda (by Mataelpino)
672A: Madrid (Moncloa) - Cerceda
720: Colmenar Viejo - Collado Villalba
876: Collado Villalba - Cerceda - Madrid (Plaza de Castilla)
Night bus line 603: Moralzarzal - Villalba - Madrid (Moncloa)
References
External links
The official site of the city
Municipalities in the Community of Madrid |
https://en.wikipedia.org/wiki/Norton%20Insight | Norton Insight whitelists files based on reputation. Norton-branded antivirus software then leverages the data to skip known files during virus scans. Symantec claims quicker scans and more accurate detection with the use of the technology.
Development
Insight was codenamed Mr. Clean. Its initial aim was to help users determine what programs from the Internet are safe to install. Mr. Clean would provide a risk assessment to discern between safe and malicious files. However, its goal was later changed to making virus scans more efficient; instead of scanning every file, known files are skipped, cutting scanning times.
Basic introduction & usage
Norton Community Watch, a voluntary and anonymous service, allows a user's Norton product to forward information to Symantec servers. Among the data collected are the processes running and their SHA256 values. A reappearing hash value and its corresponding file are whitelisted, and Norton Insight checks the processes on a user's computer against the whitelist. Matching processes are excluded from scanning.
When a process is "trusted", it has been deemed safe and excluded from risk scanning. There are two trust levels; "standard" and "high". The third option is to disable Norton Insight. In standard trust, processes appearing in the majority of participants' computers are deemed safe. High trust, in addition, excludes digitally signed files from scanning.
Tamper protection
Norton analyzes the NTFS file system upon startup, and if unaccounted changes are found, trust values of the processes on the system are revoked.
In the case of a mistake, a revocation mechanism was implemented, where clients receive a list of revoked SHA256 values via LiveUpdate. If the client has a file matching a SHA256 and is currently trusting that file, all trust is revoked, and the file is once again scanned.
Norton File Insight was a feature released in Norton 2010 products.
Norton file/download insight
The Norton Download Insight feature, provides insight of the files that you download and install in your computer. While the File Insight give you the reputation information, and locates the file on your computer, as well a feature that copies the information to the users clipboard.
It supports the Norton Download Insight Feature, and assizes a reputation about the file.
The File Insight window provides the following information:
The file type and the file name
The date on which file was installed
The date on which file was last used
The lineage details of the file
The actions that the file performs on your system
The level at which the file uses the resources of your computer
The performance impact that it has
The stability of the file for the specific operating system
The version of the file
Who developed the file?
Issues
Upon release the Download Insight program would erroneously flags a downloaded file as having no Digital Signature and no version number and therefore a potential threat.
Reception
The Tech |
https://en.wikipedia.org/wiki/Sathajhan%20Sarachandran | A Tamil Canadian computer-science student, Sarhajhan 'Sarachandran', is a member of the Tamil Tigers who pleaded guilty to trying to purchase anti-aircraft missiles for the militant group. He was convicted of supporting terrorism.
American Nadarasa Yogarasa was alleged to have helped Sarachandran concoct the plan, after Sarachandran contacted an FBI informant in Brooklyn, New York, about purchasing weapons for the Tigers. The informant sent him e-mails suggesting he had ten 9K38 Igla missiles and 500 AK-47s for $900,000, and suggested that the pair meet him in a New York warehouse. Two other Canadians, Sahilal Sabaratnam and Thiruthanikan Thanigasalam, accompanied the pair, who traveled claiming they were attending a bachelor party in the state.
A student at the University of Windsor, Sarachandran claimed to have been in direct contact with leader Velupillai Prabhakaran and had lately been speaking to intelligence chief Pottu Amman.
On January 26, 2009, he pleaded guilty, and two days later his co-defendants Sahilal Sabaratnam and Thiruthanikan Thanigasalam also pleaded guilty.
In January 2010, Sarachandran was sentenced to 26 years in prison.
References
Canadian people of Sri Lankan Tamil descent
Liberation Tigers of Tamil Eelam members
Living people
Year of birth missing (living people) |
https://en.wikipedia.org/wiki/Jungle%20Disk | Jungle Disk is both the name of an online backup software service and a privately held data security company. It was one of the first backup services to use cloud storage and Amazon S3. In 2009 after being acquired by Rackspace the service added Rackspace Cloud Files. The name is a word association as the Amazon rainforest is a Jungle and Disk is a common shorthand for a hard disk drive.
Backup service overview
Jungle Disk backup is a monthly subscription software service that supports laptops, desktops, and servers for Microsoft Windows, macOS, and Linux operating systems. Data is backed up to an online disk using either a continuous backup (aka. sync) or scheduled to back up of selected files, folders, or a everything on a system. Data can be accessed from the software client, a web browser, or mobile devices running Android or iOS. It also provides a WebDAV server for integration with other applications. Customers can protect their data using AES-256 encryption with their own key so even Jungle Disk employees cannot access any records. Each subscription includes 10 gigabytes of storage with pay-as-you-go for additional data.
History
Jungle Disk was founded in Atlanta by Dave Wright in 2006. On October 22, 2008, Jungle Disk entered into an agreement to be acquired by Rackspace Hosting, Inc. Rackspace purchased Jungle Disk in order to expand their cloud hosting services. After the acquisition integration Dave left Rackspace to found SolidFire and then Jungle Disk was relocated to San Antonio in 2010. The pace of development slowed down as Rackspace focused on its Cloud infrastructure software platform which became OpenStack. In 2013, Rackspace revived Jungle Disk customer support going from ticket only service to include phone, chat and ticketing. On January 5, 2016, Jungle Disk spun out of Rackspace US, Inc. and is now a privately held company headquartered in San Antonio, TX.
On December 5, 2017, Jungle Disk announced it acquired SafetyNet, the first backup for QuickBooks Online, from Jobber.
In May 2022, it acquired online backup company ElephantDrive.
Criticism
The Jungle Disk client software did not receive an update from 2012-2014 and then while part of the Cloud Office portfolio a new version was released in December 2015.
On June 3, 2011, Colin Percival, owner of Tarsnap (a competitor of Jungle Disk), identified two potential weaknesses in Jungle Disk's security:
The lack of a Message Authentication Code means that file corruption (accidental or deliberate) or arbitrary file content insertions will not be detected if the attacker can bypass Amazon or Rackspace security and directly modify data in S3 or Cloud Files.
The use of MD5 as a Key derivation function makes it computationally feasible to perform a brute-force attack on a Jungle Disk password.
See also
List of online backup services
Comparison of online backup services
References
External links
Jungle Disk Blog
Review in PC Magazine
Review in Macworld Magazine
|
https://en.wikipedia.org/wiki/Windows%201.0x | Windows 1.0 is the first major release of Microsoft Windows, a family of graphical operating systems for personal computers developed by Microsoft. It was first released to manufacturing in the United States on November 20, 1985, while the European version was released as Windows 1.02 in May 1986.
Its development began after the Microsoft co-founder and spearhead of Windows 1.0, Bill Gates, saw a demonstration of a similar software suite, Visi On, at COMDEX in 1982. The operating environment was showcased to the public in November 1983, although it ended up being released two years later. Windows 1.0 runs on MS-DOS, as a 16-bit shell program known as MS-DOS Executive, and it provides an environment which can run graphical programs designed for Windows, as well as existing MS-DOS software. It introduced multitasking and the use of the mouse, and various built-in programs such as Calculator, Paint, and Notepad. The operating environment does not allow its windows to overlap, and instead, the windows are tiled. Windows 1.0 also contains four releases, which contain minor updates to the system.
The system received lukewarm reviews; critics raised concerns about not fulfilling expectations, its compatibility with very little software, and its performance issues, while it has also received positive responses to Microsoft's early presentations and support from a number of hardware- and software-makers. Its last release was 1.04, and it was succeeded by Windows 2.0, which was released in December 1987. Microsoft ended its support for Windows 1.0 on December 31, 2001, making it the longest-supported out of all versions of Windows.
Development history
Microsoft showed its desire to develop a graphical user interface (GUI) as early as 1981. The development of Windows began after Bill Gates, co-founder of Microsoft and the lead developer of Windows, saw a demonstration at COMDEX 1982 of VisiCorp's Visi On, a GUI software suite for IBM PC compatible computers. A year later, Microsoft learned that Apple's own GUI software—also bit-mapped, and based in part on research from Xerox PARC—was much more advanced; Microsoft decided they needed to differentiate their own offering. In August 1983, Gates recruited Scott A. McGregor, one of the key developers behind PARC's original windowing system, to be the developer team lead for Windows 1.0.
Microsoft first demonstrated a window manager to the press in September 1983. The demonstration featured a user interface similar to Multiplan and other contemporary Microsoft applications with a command bar in the bottom of the screen. It also showed multiple application windows in both overlapping and tiled arrangements. This user interface concept was soon reworked to only support tiled windows and to change the Multiplan-like command bar into a menu bar under each window's title bar. The redesigned environment ultimately had its public debut at Fall COMDEX 1983 in November 1983. Initially requiring 192 KB of RAM and two |
https://en.wikipedia.org/wiki/Windows%20NT | Windows NT is a proprietary graphical operating system produced by Microsoft, the first version of which was released on July 27, 1993. It is a processor-independent, multiprocessing and multi-user operating system.
The first version of Windows NT was Windows NT 3.1 and was produced for workstations and server computers. It was a commercially focused operating system intended to complement consumer versions of Windows that were based on MS-DOS (including Windows 1.0 through Windows 3.1x). Gradually, the Windows NT family was expanded into Microsoft's general-purpose operating system product line for all personal computers, deprecating the Windows 9x family.
"NT" was formerly expanded to "New Technology" but no longer carries any specific meaning. Starting with Windows 2000, "NT" was removed from the product name and is only included in the product version string along with several low-level places within the system. In fact, NT was a trademark of Northern Telecom (later Nortel) at the time, which Microsoft was forced to acknowledge on the product packaging.
NT was the first purely 32-bit version of Windows, whereas its consumer-oriented counterparts, Windows 3.1x and Windows 9x, were 16-bit/32-bit hybrids. It is a multi-architecture operating system. Initially, it supported several instruction set architectures, including IA-32, MIPS, and DEC Alpha; support for PowerPC, Itanium, x64, and ARM were added later. The latest versions support x86 (including IA-32 and x64) and ARM. Major features of the Windows NT family include Windows shell, Windows API, Native API, Active Directory, Group Policy, Hardware Abstraction Layer, NTFS, BitLocker, Windows Store, Windows Update, and Hyper-V.
Versions of Windows NT are installed using Windows Setup, which, starting with Windows Vista, uses the Windows Preinstallation Environment, which is a lightweight version of Windows NT made for deployment of the operating system.
Naming
It has been suggested that Dave Cutler intended the initialism "WNT" as a play on VMS, incrementing each letter by one. However, the project was originally intended as a follow-on to OS/2 and was referred to as "NT OS/2" before receiving the Windows brand. One of the original NT developers, Mark Lucovsky, states that the name was taken from the original target processor—the Intel i860, code-named N10 ("N-Ten"). A 1998 question-and-answer (Q&A) session with Bill Gates revealed that the letters were previously expanded to "New Technology" but no longer carry any specific meaning. The letters were dropped from the names of releases from Windows 2000 and later, though Microsoft described that product as being "Built on NT Technology".
Major features
One of the main purposes of NT is hardware and software portability. Various versions of NT family operating systems have been released for a variety of processor architectures, initially IA-32, MIPS, and DEC Alpha, with PowerPC, Itanium, x86-64 and ARM supported in later releases. An initia |
https://en.wikipedia.org/wiki/Windows%202.0x | Windows 2.0 is a major release of Microsoft Windows, a family of graphical operating systems for personal computers developed by Microsoft. It was released to manufacturing on December 9, 1987, as a successor to Windows 1.0.
The product includes two different variants, a base edition for 8086 real mode, and Windows/386, an enhanced edition for i386 protected mode. Windows 2.0 differs from its predecessor by allowing users to overlap and resize application windows, while the operating environment also introduced desktop icons, keyboard shortcuts, and support for 16-color VGA graphics. It also introduced Microsoft Word and Excel.
Noted as an improvement of its predecessor, Microsoft Windows gained more sales and popularity after the release of the operating environment, although it is also considered to be the incarnation that remained a work in progress. Due to the introduction of overlapping windows, Apple Inc. had filed a lawsuit against Microsoft in March 1988 after accusing them of violating copyrights Apple held, although in the end, the judge ruled in favor of Microsoft. The operating environment was succeeded by Windows 2.1 in May 1988, while Microsoft ended its support on December 31, 2001.
Release versions
The operating environment came in two different variants with different names and CPU support. The basic edition supported the 8086 mode of the 80386 microprocessor. Despite its configuration, the variant was fully operational on an 8088 or 8086 processor, although the high memory area would not be available on an 8086-class processor; however, expanded memory could still be used. IBM's PS/2 Model 25, which had an option to ship with a "DOS 4.00 and Windows kit" for educational markets, shipped Windows with 8086 hardware. The basic edition would be later renamed to Windows/286 with the release of Windows 2.1 in 1988.
The other variant, named Windows/386, was available as early as September 1987, pre-dating the release of Windows 2.0 in December 1987. It was much more advanced than its other sibling. It introduced a protected mode kernel, above which the GUI and applications run as a virtual 8086 mode task. The variant had fully preemptive multitasking, and allowed several MS-DOS programs to run in parallel in "virtual 8086" CPU mode, rather than always suspending background applications. With the exception of a few kilobytes of overhead, each DOS application could use any available low memory before Windows was started. Windows/386 also provided EMS emulation, using the memory management features of the i386 to make RAM beyond 640k behave like the banked memory previously only supplied by add-in cards and used by popular DOS applications. There was no support for disk-based virtual memory, so multiple DOS programs had to fit inside the available physical memory. Users could run more applications on the 386 version.
Neither of these versions worked with DOS memory managers like CEMM or QEMM or with DOS extenders, which have their o |
https://en.wikipedia.org/wiki/MS-DOS | MS-DOS ( ; acronym for Microsoft Disk Operating System, also known as Microsoft DOS) is an operating system for x86-based personal computers mostly developed by Microsoft. Collectively, MS-DOS, its rebranding as IBM PC DOS, and a few operating systems attempting to be compatible with MS-DOS, are sometimes referred to as "DOS" (which is also the generic acronym for disk operating system). MS-DOS was the main operating system for IBM PC compatibles during the 1980s, from which point it was gradually superseded by operating systems offering a graphical user interface (GUI), in various generations of the graphical Microsoft Windows operating system.
IBM licensed and re-released it in 1981 as PC DOS 1.0 for use in its PCs. Although MS-DOS and PC DOS were initially developed in parallel by Microsoft and IBM, the two products diverged after twelve years, in 1993, with recognizable differences in compatibility, syntax, and capabilities.
Beginning in 1988 with DR-DOS, several competing products were released for the x86 platform, and MS-DOS went through eight versions, until development ceased in 2000. Initially, MS-DOS was targeted at Intel 8086 processors running on computer hardware using floppy disks to store and access not only the operating system, but application software and user data as well. Progressive version releases delivered support for other mass storage media in ever greater sizes and formats, along with added feature support for newer processors and rapidly evolving computer architectures. Ultimately, it was the key product in Microsoft's development from a programming language company to a diverse software development firm, providing the company with essential revenue and marketing resources. It was also the underlying basic operating system on which early versions of Windows ran as a GUI.
History
MS-DOS was a renamed form of 86-DOS owned by Seattle Computer Products, written by Tim Paterson. Development of 86-DOS took only six weeks, as it was basically a clone of Digital Research's CP/M (for 8080/Z80 processors), ported to run on 8086 processors and with two notable differences compared to CP/M: an improved disk sector buffering logic, and the introduction of FAT12 instead of the CP/M filesystem. This first version was shipped in August 1980. Microsoft, which needed an operating system for the IBM Personal Computer, hired Tim Paterson in May 1981 and bought 86-DOS 1.10 for in July of the same year. Microsoft kept the version number, but renamed it MS-DOS. They also licensed MS-DOS 1.10/1.14 to IBM, which, in August 1981, offered it as PC DOS 1.0 as one of three operating systems for the IBM 5150 or the IBM PC.
Within a year, Microsoft licensed MS-DOS to over 70 other companies. It was designed to be an OS that could run on any 8086-family computer. Each computer would have its own distinct hardware and its own version of MS-DOS, similar to the situation that existed for CP/M, and with MS-DOS emulating the same solution as CP/M t |
https://en.wikipedia.org/wiki/Behavior%20tree | Behavior trees are a formal, graphical modelling language used primarily in systems and software engineering. Behavior trees employ a well-defined notation to unambiguously represent the hundreds or even thousands of natural language requirements that are typically used to express the stakeholder needs for a large-scale software-integrated system.
Overview
The amount of detail in the large number of natural language requirements for a large-scale system causes short-term memory overload and may create a barrier that prevents anyone from gaining a deep, accurate and holistic understanding of the system needs. Also, because of the use of natural language, there are likely to be many ambiguities, aliases, inconsistencies, redundancies and incompleteness problems associated with the requirements information. This adds further to the uncertainty and complexity. Generally, at best, a few people understand parts of the system or situation well, but no one has other than a superficial understanding of the whole – that is, the detailed integrated behavior of the system.
The behavior tree representation, (with the help of the composition tree representation that resolves alias and other vocabulary problems with large sets of requirements) allows people to avoid short-term memory overload and produce a deep, accurate, holistic representation of system needs that can be understood by all stakeholders because it strictly uses the vocabulary of the original requirements. Because the behavior tree notation uses a formal semantics, for any given example, it already is, or can be made executable.
Behavior tree forms
Single and composite or integrated behavior tree forms are both important in the application of behavior trees in systems and software engineering.
Requirement behavior trees: Initially, individual requirement behavior trees (RBTs) are used to capture all the fragments of behavior in each individual natural language requirement by a process of rigorous, intent-preserving and vocabulary-preserving translation. The translation process can uncover a range of defects in original natural language requirements.
Integrated behavior trees: Because a set of requirements imply the integrated behavior of a system, all the individual requirement behavior trees can be composed to construct an integrated behavior tree (IBT) that provides a single holistic view of the emergent integrated behavior of the system. This enables the building of the integrated behavior of a system out of its requirements. An analogy to help describe this process is the transition from a randomly arranged set of jigsaw puzzle pieces to putting each of the pieces in its appropriate place. When we do this, we see each piece of information in its intended context and we see the pieces of information as a whole and the emergent properties of the whole.
Having all the requirements converted to behavior trees (RBTs) is similar to having all the pieces for a jigsaw puzzle randomly spre |
https://en.wikipedia.org/wiki/Eric%20Millikin | Eric Millikin is an American artist and activist based in Detroit, Michigan. He is known for his pioneering work in artificial intelligence art, augmented and virtual reality art, conceptual art, Internet art, performance art, poetry, post-Internet art, video art, and webcomics. His work is often controversial, with political, romantic, occult, horror and black comedy themes. Awards for Millikin's artwork include the Pulitzer Prize.
Together, Millikin and Casey Sorrow created and popularized the international animal rights holiday World Monkey Day.
Early life and education
Millikin is a descendent of Mary Eastey, who was executed for witchcraft during the Salem Witch Trials.
He began drawing horror art by age one-and-a-half, and by second grade, he was making teachers profane birthday cards showing his school burning down. Millikin began posting comics and art on the internet using CompuServe in the early 1980s, and began publishing on the World Wide Web in the early 1990s.
Millikin attended art school at Michigan State University in their Honors College. He paid his way through school by working in the school's human anatomy lab as an embalmer and dissectionist of human cadavers. While at art school, Millikin was homeless and lived in a car. He earned a Master of Fine Arts at Virginia Commonwealth University School of the Arts in 2021. Millikin teaches in the Department of Kinetic Imaging at Virginia Commonwealth University School of the Arts.
Notable artworks
Millikin's art often includes self-portraits as well as portraits of celebrities and political figures. His work often incorporates mixed media and found objects, such as packages of candy, paper currency, and spiders. Millikin's works range from those made almost completely of text (including calligraphy, typography, anagrams, ambigrams, free verse, and cut-up technique poetry) to those that are optical illusions or completely abstract.
The Birth of a Vampire Nation: A 2019 artificial intelligence horror film created with AI trained on the films The Birth of a Nation and Nosferatu: A Symphony of Horror , and videos of human blood cells and stars. The soundtrack is composed with AI trained on human heartbeats and radio waves from outer space. The film "explores the use of fear in racial and gender politics as well as in popular media."
CHARYBDIS-3: A spiraling video of infinite duration, created with artificial intelligence and facial recognition trained on endangered plants and animals, and projected on to a waterfall. The project's name comes from the sea monster Charybdis from Greek mythology. The endangered species referenced in the video are species whose fates have been profoundly impacted by global climate change.
Danger Beasts: Since 2016, Millikin has created the Danger Beast series of street art portraits of endangered animals created out of endangered plants, including a portrait of Harambe the gorilla made from Venus flytraps.
Made of Money, a series of portraits of |
https://en.wikipedia.org/wiki/Harry%20Shum | Heung-Yeung "Harry" Shum (; born October 1966) is a Chinese computer scientist. He was a doctoral student of Raj Reddy. He was the Executive Vice President of Artificial Intelligence & Research at Microsoft. He is known for his research on computer vision and computer graphics, and for the development of the search engine Bing.
Early life and education
Shum was born and grew up in Nanjing, China. He earned his bachelor's degree from Southeast University, Nanjing, China, and a master's degree from Hong Kong University. He studied at Carnegie Mellon University and earned a Ph.D. in robotics from its School of Computer Science in 1996.
Career
In 1996, Shum joined Microsoft Research in Redmond. He then moved to Microsoft Research China (later renamed Microsoft Research Asia) when it was founded in 1998. In 2004, he became the Managing Director of Microsoft Research Asia.
In 2006, he was promoted to Distinguished Engineer of Microsoft Corporation. In 2007, he became Corporate Vice President of Bing Product Development at Microsoft. In 2013, he took on the responsibilities as Microsoft's Executive Vice President, Technology & Research including oversight of Microsoft Research. Since 2016, he has been Microsoft's Executive Vice President for the AI & Research Group, leading the overall strategy and R&D efforts in AI while continuing oversight of Microsoft Research.
In November 2019, it was reported by Mary Jo Foley in ZDNet that Shum was leaving Microsoft on 1 February 2020. In March 2020, Shum was re-appointed as an adjunct professor at Tsinghua University's Institute for Advanced Study where he co-leads the computer vision and computer graphics PhD program.
in March 2023, Shum was appointed as the Council Chairman of Hong Kong University of Science and Technology.
Research and awards
Shum has published over 200 papers at international conferences and journals. Most of them are focused on computer graphics and computer vision. He is a pioneer and proponent of research on interactive computer vision. He has published many important interactive computer vision papers on ACM SIGGRAPH. He was also active in Image-based modeling and rendering, which is an important field in realistic computer graphics. In recent years, since he worked on Bing he has been active in web search and data mining research.
Shum was named IEEE Fellow by Institute of Electrical and Electronics Engineers in 2006. In 2007, he was recognized as ACM Fellow by Association for Computing Machinery.
In 2017, he was elected a foreign associate of the US National Academy of Engineering (NAE), for contributions to computer vision and computer graphics, and for leadership in industrial research and product development. He received the Honorary Fellowship from the University of Hong Kong in 2017.
In 2018 he was elected an International Fellow of the Royal Academy of Engineering in the UK.
See also
List of International Fellows of the Royal Academy of Engineering
References
Extern |
https://en.wikipedia.org/wiki/Networking%20cable | Networking cable is a piece of networking hardware used to connect one network device to other network devices or to connect two or more computers to share devices such as printers or scanners. Different types of network cables, such as coaxial cable, optical fiber cable, and twisted pair cables, are used depending on the network's topology, protocol, and size. The devices can be separated by a few meters (e.g. via Ethernet) or nearly unlimited distances (e.g. via the interconnections of the Internet).
While wireless networks are more easily deployed when total throughput is not an issue, most permanent larger computer networks utilize cables to transfer signals from one point to another.
There are several technologies used for network connections. Patch cables are used for short distances in offices and wiring closets. Electrical connections using twisted pair or coaxial cable are used within a building. Optical fiber cable is used for long distances or for applications requiring high bandwidth or electrical isolation. Many installations use structured cabling practices to improve reliability and maintainability. In some home and industrial applications power lines are used as network cabling.
Twisted pair
Twisted pair cabling is a form of wiring in which pairs of wires (the forward and return conductors of a single circuit) are twisted together for the purposes of canceling out electromagnetic interference (EMI) from other wire pairs and from external sources. This type of cable is used for home and corporate Ethernet networks. Twisted pair cabling is used in short patch cables and in the longer runs in structured cabling.
There are two types of twisted pair cables: shielded and unshielded.
Ethernet crossover cable
An Ethernet crossover cable is a type of twisted pair Ethernet cable used to connect computing devices together directly that would normally be connected via a network switch, Ethernet hub or router, such as directly connecting two personal computers via their network adapters. Most current Ethernet devices support Auto MDI-X, so it does not matter whether crossover or straight cables are used.
Fiber optic cable
An optical fiber cable consists of a center glass core surrounded by several layers of protective material. The outer insulating jacket is made of Teflon or PVC to prevent interference. It is expensive but has higher bandwidth and can transmit data over longer distances. There are two major types of optical fiber cables: shorter-range multi-mode fiber and long-range single-mode fiber.
Coaxial cable
Coaxial cables form a transmission line and confine the electromagnetic wave to an area inside the cable between the center conductor and the shield. The transmission of energy in the line occurs totally through the dielectric inside the cable between the conductors. Coaxial lines can therefore be bent and twisted (subject to limits) without negative effects, and they can be strapped to conductive supports without induc |
https://en.wikipedia.org/wiki/Carex%20sheldonii | Carex sheldonii is a species of sedge known by the common name Sheldon's sedge.
Description
Carex sheldonii produces triangular stems up to a meter tall from a network of rhizomes. The narrow, hairy leaves attach to the stems by reddish purple sheaths. The inflorescence is a solid, narrow cluster of flowers up to 50 centimeters long, holding up to 100 developing fruits.
Distribution and habitat
This sedge is native to the Western United States, where it grows in wet areas such as lakeshores and moist meadows.
References
External links
Jepson Manual Treatment - Carex sheldonii
USDA Plants Profile: Carex sheldonii
Carex sheldonii - Photo gallery
sheldonii
Flora of the Western United States
Flora of California
Flora of Nevada
Flora of Oregon
Flora of the Sierra Nevada (United States)
Plants described in 1915
Flora without expected TNC conservation status |
https://en.wikipedia.org/wiki/K-Lite%20Codec%20Pack | The K-Lite Codec Pack is a collection of audio and video codecs for Microsoft Windows DirectShow that enables an operating system and its software to play various audio and video formats generally not supported by the operating system itself. The K-Lite Codec Pack also includes several related tools, including Media Player Classic Home Cinema (MPC-HC), Media Info Lite, and Codec Tweak Tool.
K-Lite adds Video for Windows (VFW) codecs and DirectShow filters to the system, so that DirectShow/VFW based players like MPC, Winamp, and Windows Media Player will use them automatically.
Editions
There are four editions of the K-Lite Codec Pack, all free of charge.
Basic: The Basic edition is the smallest version and enables a Microsoft Windows computer to play the contents of AVI, Matroska (MKV), MP4, Ogg, Flash Video (FLV) and WebM files, etc. It only consists of LAV Filters (for video demultiplexing and audio and video decoding), DirectVobSub (for subtitle decoding), Codec Tweak Tool, Icaros ThumbnailProvider and Icaros PropertyHandler. Basic is the only edition that includes neither MPC-HC nor MediaInfo Lite.
Standard: The Standard edition includes all features of the Basic edition plus MPC Video Renderer, MediaInfo Lite and MPC-HC. This package is recommended for normal users.
Full: The Full edition includes all features of the Standard edition plus madVR, DC-Bass Source Mod and Plugin for 3D video decoding (H.264 MVC)
Mega: The Mega edition includes all features of the Full edition plus a few ACM/VFW codecs (e.g. x264VFW and Lagarith), ffdshow, GraphStudioNext, VobSubStrip and FourCC Changer.
After version 1.56 BS.Player is removed, unlike some editions of K-Lite in the past.
After version 10.0.0, 64-bit codecs are integrated into the regular editions. Prior to this version there was a 64-bit edition designed specifically for 64-bit OSes.
After version 11.3.0, the 32-bit and 64-bit versions of LAV Filters share their settings, and an option to install only 64-bit codecs was added (visible only in Expert install mode).
After version 13.7.5, a user can remove installed components by deselecting them while running an updater. This also makes it possible to switch to a smaller variant of the codec pack without uninstalling first.
After version 15.3.5 MPC Video Renderer is added.
After version 15.9.0 Haali Media Splitter is removed.
After version 17.0.0 AC3Filter is removed, because it is obsolete and only a tiny portion of people use it. The options to use ffdshow for decoding is removed as well. However, after installation a user can still use them for decoding by enable them manually with Codec Tweak Tool. Moreover, the ffdshow processing filters are still kept, and new options to load them in all compatible DirectShow players are added.
Compatibility
K-Lite Codec Packs are compatible with Windows Server 2003 and later.
The last version that is compatible with Windows Vista is version 16.7.6.
The last version that is compatible with Wind |
https://en.wikipedia.org/wiki/Villa%20Dulce | Villa Dulce (English: Sweet Village) is a Chilean animated series created by Beatriz Buttazzoni and Francisco Bobadilla of Empatía Productions in 2004 and broadcast in Canal 13 network. Villa Dulce was a historical series in Chile because it was the first animated TV program made in the country since Condorito's shorts in the 80s.
Since its debut on March 6, 2004 the show has broadcast 26 episodes and 2 specials and was a strong influence for the creation of others Chilean animation series after Villa Dulce success, like Clarita, Diego y Glot, Pulentos and El Ojo del Gato.
Settings
Villa Dulce idea was planned by Beatriz Buttazzoni and Francisco Bobadilla around 2003, inspired by his own experiences in the original town that they live, Villa Dulce in Viña del Mar (also two scriptwriters of the series lives there) but instead of use the same place, they created a fictional town called "Villa Dulce" who resembles Santiago de Chile. This community is governed by a mayor called Tuscan Epifanio and where 13 children between 8 and 11 years and some adults lives.
Villa Dulce stands out to portray the situations that the children of 11 years old experiment in the country, including situations that the creators of Villa Dulce call "kiddie black humor", this is, as how they imagines the reality according to the glance of the children with situations like the end of the world, reality shows, the UFOs, and others issues. In addition Villa Dulce includes some characters who represent generally the stereotypes of the Chilean society like the high-class (cuicos), low class (flaites) and tweens.
The series has been heavily compared with the American animated series South Park, Francisco Bobadilla has denied the similarities:
See also
2004 in television
References
2000s animated television series
2004 Chilean television series debuts
2006 Chilean television series endings
Chilean animated television series
Chilean children's animated comedy television series
Animated television series about children
Flash television shows |
https://en.wikipedia.org/wiki/Yarowsky%20algorithm | In computational linguistics the Yarowsky algorithm is an unsupervised learning algorithm for word sense disambiguation that uses the "one sense per collocation" and the "one sense per discourse" properties of human languages for word sense disambiguation. From observation, words tend to exhibit only one sense in most given discourse and in a given collocation.
Application
The algorithm starts with a large, untagged corpus, in which it identifies examples of the given polysemous word, and stores all the relevant sentences as lines. For instance, Yarowsky uses the word "plant" in his 1995 paper to demonstrate the algorithm. If it is assumed that there are two possible senses of the word, the next step is to identify a small number of seed collocations representative of each sense, give each sense a label (i.e. sense A and B), then assign the appropriate label to all training examples containing the seed collocations. In this case, the words "life" and "manufacturing" are chosen as initial seed collocations for senses A and B respectively. The residual examples (85%–98% according to Yarowsky) remain untagged.
The algorithm should initially choose seed collocations representative that will distinguish sense A and B accurately and productively. This can be done by selecting seed words from a dictionary’s entry for that sense. The collocations tend to have stronger effect if they are adjacent to the target word, the effect weakens with distance. According to the criteria given in Yarowsky (1993), seed words that appear in the most reliable collocational relationships with the target word will be selected. The effect is much stronger for words in a predicate-argument relationship than for arbitrary associations at the same distance to the target word, and is much stronger for collocations with content words than with function words. Having said this, a collocation word can have several collocational relationships with the target word throughout the corpus. This could give the word different rankings or even different classifications. Alternatively, it can be done by identifying a single defining collocate for each class, and using for seeds only those contexts containing one of these defining words. A publicly available database WordNet can be used as an automatic source for such defining terms. In addition, words that occur near the target word in great frequency can be selected as seed collocations representative. This approach is not fully automatic, a human judge must decide which word will be selected for each target word’s sense, the outputs will be reliable indicators of the senses.
A decision list algorithm is then used to identify other reliable collocations. This training algorithm calculates the probability Pr(Sense | Collocation), and the decision list is ranked by the log-likelihood ratio:
A smoothing algorithm will then be used to avoid 0 values. The decision-list algorithm resolves many problems in a large set of non-independent |
https://en.wikipedia.org/wiki/Escenas%20de%20Matrimonio | Escenas de Matrimonio was a series broadcast by the Spanish television network, Telecinco, produced by Alba Adriatica. It premiered on 1 August 2007, featuring the lives of various couples who live in the same building dealing with similar problems in their daily lives.
Predecessors
TVE (2002–2004)
The idea of the show actually began in 2002 as a number of separate sketches on La 1's Noche de Fiesta, led by José Luis Moreno. His nephews Alberto and Laura Caballero were responsible for directing and scripting this mini-comedy, which soon becomes one of the most popular sketches on the show.
In this first incarnation, the actors who gave life to the characters were Marisa Porcel (Pepa), Pepe Ruiz (Avelino) Silvia Gambino (Marina) and Alfredo Cernuda (Roberto). The characters of the young couple were less defined and did not even have names at this stage, and were interpreted by Manuel Belmonte and Ruth Arteaga. In the next season they would be replaced by Rosana Manso and Javier Coromina, and occasionally Martin Czehmester.
Antena 3 (2004)
Once Noche de Fiesta ended in June 2004, some of the cast played the same characters in Antena 3's La sopa boba, which was broadcast until the end of 2004. The roles were played by Marisa Porcel (Pepa), Pepe Ruiz (Avelino) Silvia Gambino (Marina) and Alfredo Cernuda (Roberto).
Theater (2003–2006)
Given the great success of the idea, the sketch took the stage, and between 2003 and 2006, tours were conducted throughout Spain, under the title Matrimoniadas: Hasta que la muerte los separe. In 2005 and 2006, the role of Roberto was played by Santiago Urrialde and the young couple was played by Paloma Figueroa and Mario Barbero along with Pepe Ruiz, Marisa Porcel and Silvia Gambino in the roles of Avelino, Pepa and Marina respectively.
Finally the show reached the Teatro La Latina in Madrid, and played between April and November 2005 with the following cast: Marisa Porcel Pepe Ruiz, Silvia Gambino, Alfredo Cernuda, Rosana Manso and Martin Czehmester.
Telecinco: Escenas de Matrimonio (2007–2011)
Beginnings
On 1 August 2007 the original idea was revived on Telecinco as the series Escenas de Matrimonio, enjoying great success and following the same pattern of independent sketches, but with the inclusion of fresh cast members such as David Venancio Muro in the role of Roberto, Soledad Mallol as Marina as a middle-aged couple and Miren Ibarguren st Sonia and Daniel Muriel as Miguel, a young couple.
Besides the main characters, this series also features Ramon (Ruben Sanz) the attractive best friend Miguel (Daniel Muriel), who Sonia (Miren Ibarguren) cannot stand, Berta (Marta Poveda), the best friend of Sonia (Miren Ibarguren), a married woman with children who goes from one man to another, including Ramon (Ruben Sanz), Paco (Jesus Caba), the building's doorman. They were joined by Desislava (Emilia Uutinen), the beautiful assistant of Pepa (Marisa Porcel) and Avelino (Pepe Ruiz).
There were also occasional cha |
https://en.wikipedia.org/wiki/Datapipe | Datapipe was a provider of managed hosting services and data centers for information technology services and cloud computing with data centers in Somerset, New Jersey, San Jose, California, the United Kingdom, and China. The company was founded in 1998 and is headquartered in Jersey City, New Jersey. Since 2011, more data centers have been added, including in Ashburn, Virginia, Moscow, and Singapore.
History
In 1998, Robb Allen founded Datapipe with three employees. Originally based in Hoboken, NJ, the company started out providing both website design and hosting services. The company soundly weathered the dot.com bust, posting double digit growth every quarter. As the company grew, it focused on providing managed hosting services and began to expand its office space and data center facilities in the U.S., Europe, and Asia. Today the company claims to provide services to over 1000 clients, in industries including healthcare, pharmaceuticals, finance, SaaS, advertising, retail, media, and entertainment.
On September 11, 2017, Rackspace announced its intention to acquire Datapipe. The acquisition was completed on November 17, 2017.
Services
Under the umbrella of Datapipe Managed Cloud, the company offers managed services for Amazon Web Services including Elastic Compute Cloud (EC2), CloudFront, S3, and Relational Database Service (RDS). Datapipe established partnerships with technology companies. Datapipe provides application management, hosting, professional services and security services for mid- to large-sized organizations. These services include monitoring, diagnostics, and problem resolution; enabling of software as a service to independent software vendors; custom application management, and remote infrastructure management.
The company is a member of the PCI Security Standards Council, a Microsoft Gold Certified Partner, and an EPA Green Power Partner. Datapipe’s San Jose and Somerset One Data Centers complete an annual SAS 70 Type II (Statement on Auditing Standards No. 70) Audit.
In August 2007, Datapipe announced that it opened offices in Shanghai, China. This followed the opening of its Hong Kong office in December 2005.
In September 2007, Datapipe relocated its corporate headquarters to 10 Exchange Place, Jersey City, NJ.
In July 2008, Datapipe announced that it received $75 million in combined credit and equity financing led by Goldman Sachs. The company said it plans to use the money to support future growth and data center expansions.
In October 2009, Datapipe added more data center capacity in central New Jersey.
In April 2010, Datapipe announced that their Somerset data center would run on 100 percent renewable electricity, by purchasing Green-e Energy certified Renewable Energy Certificates through Constellation NewEnergy’s NewMix Wind energy program. The company touts energy conservation measures and powers its London data center on alternative energy.
On November 17, 2010, Datapipe announced Datapipe Managed Cloud for |
https://en.wikipedia.org/wiki/Netcracker%20Technology | Netcracker Technology Corp., a wholly owned subsidiary of NEC Corporation, is a provider of business support system (BSS), operations support systems (OSS) and software-defined networking (SDN) and network functions virtualization (NFV) solutions. The company also offers professional services (including planning and consulting, operations and maintenance, and support), as well as managed services.
Headquartered in Waltham, Massachusetts, Netcracker maintains operations and development facilities across the globe.
History
Netcracker Technology was co-founded in 1993 by Dr. Michael Feinberg, currently Netcracker's Chief Technology Officer and Bonnie Ward, the company's Vice President of Corporate Initiatives. In 2008, after 15 years of independent growth, the company was acquired by NEC Corporation. Netcracker then became a wholly owned subsidiary of NEC.
In 2010, Netcracker initiated a large-scale expansion whereby NEC consolidated its Telecom Operations and Management Solutions (TOMS) software and services business under Netcracker.
In February 2015, NEC and Netcracker launched a joint business brand.
Acquisitions
In 2002 Netcracker expanded its operations into Moscow, Russia, whereby they acquired Moscow City Telephone Network and integration company AVD.
2011 Subex's activation business.
2012 Convergys Corporation's Information Management (IM) business was acquired. The acquisition was completed in May and following the acquisition, the unit was integrated into Netcracker.
2016 CoralTree Systems.
Legal allegations
In 2015, Netcracker agreed to a $11.4 million settlement to resolve allegations under the False Claims Act that the company has hired individuals without appropriate clearances to work on a Defense Information Systems Agency (DISA) contract.
Products and services
Netcracker's products focus on Business Support Systems (BSS), Operations Support Systems (OSS) and Software-Defined Networking (SDN) and Network Functions Virtualization (NFV) technologies for Communications Service Providers worldwide.
The Netcracker 12 suite was launched in May 2017. The suite covers seven product domains, including Digital Customer Enablement; Digital Business Enablement; Digital Operations Enablement; Digital & Cloud Infrastructure; Cloud Platform; Advanced Analytics; and Business, Operations & Infrastructure Agility Layers offerings.
The portfolio also covers five services domains, including Business & Operational Consulting; End-to-End Turnkey Delivery; Agile Development & DevOps; Cloud Enablements; and Support & Maintenance, Managed Services & End-to-End Outsourcing services.
Its offerings operate within the realms of operations support systems, business support systems, customer experience management, DevOps, microservices, billing and revenue management, AI, the Internet of Things, big data analytics, software-defined networking, network functions virtualization, and more. The Netcracker 12 suite is specifically designed to hel |
https://en.wikipedia.org/wiki/Livermore%20loops | Livermore loops (also known as the Livermore Fortran kernels or LFK) is a benchmark for parallel computers. It was created by Francis H. McMahon from scientific source code run on computers at Lawrence Livermore National Laboratory. It consists of 24 do loops, some of which can be vectorized, and some of which cannot.
The benchmark was published in 1986 in Livermore fortran kernels: A computer test of numerical performance range.
The Livermore loops were originally written in Fortran, but have since been ported to many programming languages.
Each loop carries out a different mathematical kernel
.
Those kernels
are:
hydrodynamics fragment
incomplete Cholesky conjugate gradient
inner product
banded linear systems solution
tridiagonal linear systems solution
general linear recurrence equations
equation of state fragment
alternating direction implicit integration
integrate predictors
difference predictors
first sum
first difference
2-D particle in a cell
1-D particle in a cell
casual Fortran
Monte Carlo search
implicit conditional computation
2-D explicit hydrodynamics fragment
general linear recurrence equations
discrete ordinates transport
matrix-matrix transport
Planckian distribution
2-D implicit hydrodynamics fragment
location of a first array minimum.
References
External links
Livermore Loops, Fortran version
Livermore Loops, C version
Parallel computing
Supercomputer benchmarks |
https://en.wikipedia.org/wiki/List%20of%20songs%20in%20SingStar%20games%20%28PlayStation%203%29 | SingStar is a competitive music video game series, developed by London Studio and published by Sony Computer Entertainment for the PlayStation 2 and PlayStation 3 video game consoles. SingStar allows 1–2 people to sing karaoke via microphone peripherals in time with on-screen music. The first game in the series, SingStar, was released in Europe and Oceania in 2004. , over seventy titles in the SingStar series have been released PAL region territories, in addition to a small number of releases in North America.
The main difference between each SingStar title is the game's track list. Each edition of the game includes up to thirty songs on disc, with PlayStation 3 versions of the game allowing additional songs to be purchased from an online service. Players can remove a game disc from the console during gameplay and insert a new disc, giving them access to a new selection of songs. Most SingStar titles are loosely based upon musical genres, such as rock or pop music (SingStar Rocks! and SingStar Pop respectively). SingStar games are sometimes localised for release in different regions, with customised track lists to suit foreign markets and territories. The first artist-specific SingStar game (SingStar Die Toten Hosen) was released in Germany in 2007, with ABBA, Queen, Take That, Mecano and Vasco Rossi receiving similar releases in subsequent years.
PlayStation 3
The following tables list songs available on SingStar titles released for the PlayStation 3 video game console. Country of released is indicated by two-letter country codes. With the exception of localised titles, all games released in PAL territories have identical track lists to the UK version of the game. For titles which were localised for multiple markets, songs are either indicated as present ("Yes") or absent ("No") in the track list for each localised version.
SingStar
SingStar ABBA
SingStar Chartbreaker
SingStar Chart Hits
This is an Australian and New Zealand only game.
SingStar Dance
SingStar Guitar
SingStar Hits
SingStar Made In Germany
SingStar Mallorca Party
SingStar Mecano
SingStar Morangos com Açucar
SingStar Motown
SingStar Polskie Hity
SingStar Pop Edition
SingStar Queen
SingStar Take That
SingStar Vasco
SingStar Vol. 2
SingStar Vol. 3: Party Edition
SingStar The Wiggles
SingStar Ultimate Party
Note: This game was also released for the PlayStation 4.
See also
List of songs in SingStar games (PlayStation 2)
References
External links
SingStar catalogues:
Australia
Denmark
Germany
Spain
Finland
France
Italy
Norway
Portugal
Sweden
United Kingdom
United States
PlayStation 3 games
SingStar
Lists of songs in music video games |
https://en.wikipedia.org/wiki/All%20Things%20Considered%20%28disambiguation%29 | All Things Considered is a news program on the American network National Public Radio.
All Things Considered may also refer to:
All Things Considered (BBC radio show), a religious affairs program on BBC Radio Wales
"All Things Considered" (song), a song by Yankee Grey
"All Things Considered", a song by The Mighty Mighty Bosstones from Pay Attention, 2000
All Things Considered, a book of essays by G. K. Chesterton (published 1908)
All Things Considered, an English title of the 1963 film À tout prendre |
https://en.wikipedia.org/wiki/Kineo%20CAM | Kineo Computer Aided Motion ("Kineo CAM") was a computer software company based in Toulouse, France, that was awarded the European ICT Prize in 2007 in Hannover, Germany, for KineoWorks, its automatic motion planning, path planning and pathfinding technology. It was acquired by Siemens Digital Industries Software in 2012.
KineoWorks is a core software component dedicated to motion planning that enables automatic motion of any mechanical system or virtual artifact in a 3D environment, ensuring collision avoidance and respecting kinematic constraints.
Kineo Collision Detector (KCD) is a collision detection software library with an object-oriented API. It is included in KineoWorks and exists also as a standalone library. It works with a hierarchical architecture of heterogeneous data types based on composite design pattern and is especially suited for large 3D models.
The Kineo CAM main market is PLM, DMU and CADCAM systems, robotics and coordinate-measuring machines (CMM).
History
Incorporated in December 2000, Kineo CAM benefited from a 15-year research legacy from the LAAS and CNRS.
The company was acquired by Siemens Digital Industries Software on October 8, 2012.
Awards
2000: Winner of the national contest of innovation from French Ministry of Research and Technology
2005: Kineo CAM receives IEEE and IFR Innovation Award for Outstanding Achievements in Commercializing Innovative Robot and Automation Technology
2006: Awarded by Daratech the title of emerging technology at the DaratechSUMMIT2006 with eight other innovative American companies
2007: Innovation ICT Prize from the European Commission and the European Council of Applied Sciences, Technologies and Engineering
2007: Innovation and International award from Regional council of Midi-Pyrénées
External links
LAAS-CNRS
French companies established in 2000
French companies disestablished in 2012
Software companies established in 2000
Software companies disestablished in 2012
Defunct software companies of France
Companies based in Toulouse
2012 mergers and acquisitions |
https://en.wikipedia.org/wiki/Transam%C3%A9rica%20Pop | Transamérica Pop was a Brazilian radio network owned by . The network was directed to a young audience and has programming that highlights the musical genres pop, rock and hip hop.
It was created in 1990 at the start of the satellite transmissions of Transamérica. The Transamérica Pop network expanded to fourteen stations in Brazil (cities: São Paulo, Rio de Janeiro, Salvador, Brasília, Curitiba, Recife, Balneário Camboriú and Montes Claros).
On July 22, 2019, Transamérica confirmed the beginning of the unification of the carriers Transamérica Hits and Transamérica Pop, returning to the way of working before the division into carriers. Transamerica also confirmed that the new music programming would be composed of rock and pop hits (national and international), aiming to reach and attract the public between 25 and 49 years old. On August 5, work on the new Transamerica Network officially began. All broadcasters ceased to use the nomenclature Transamerica Pop definitively.
References
Official Website (in Portuguese)
Radio stations in Brazil
Radio stations established in 1990
Radio stations disestablished in 2019
Defunct mass media in Brazil |
https://en.wikipedia.org/wiki/Power%20Shift%20Network | Power Shift Network is a North American non-profit organization made up of a network of youth-led social and environmental justice organizations working together to build the youth clean energy and climate movement. It runs campaigns in the United States and Canada to build grassroots power and advocate for tangible changes on climate change and social justice at local, state, national and international levels in North America. The organization changed its name from Energy Action Coalition in July 2016 in order to reflect its new leadership and it shift from a coalition to a network structure. The Power Shift Network's members, which include other non-profit organizations and student groups focused on environmental justice, social justice, and climate change, focus their organizing and campaigns on campuses, communities, corporate practices, and politics. The Power Shift Network is part of the Global Youth Climate Movement.
The Power Shift Network was founded (as Energy Action Coalition) in June 2004 at a meeting of representatives from almost 20 environmental groups in Washington, D.C. The founding of the organization was a result of the coordination of many local and national environmental networks in a day of action on April 1, 2004, called Fossil Fools Day which advocated for reducing dependence for energy on fossil fuels, with more than 125 registered actions around the U.S.
Structure
The Power Shift Network is a growing network of student and youth-led environmental, climate, and social justice partner organizations. The network has six full-time staff and an office in Washington, D.C.
The following organizations are a few of the 91 (as of February 2020) members of the network:
350.org
Chesapeake Climate Action Network
Earth Guardians
Global Zero
Zero Hour
Grand Aspirations
Sierra Student Coalition
Green For All
Organize Florida Education Fund
Groundswell
iMatter
National Wildlife Federation EcoLeaders
North American Students of Cooperation (NASCO)
Oil Change International
Rainforest Action Network
Real Food Challenge
Sierra Student Coalition
Future Coalition
SustainUS
Care About Climate
Campaign For America
Our Climate Voices
Our Climate
United States Student Association (USSA)
Campaigns and events
Fossil Fools Day
The first Fossil Fools Day on April 1, 2004, was not a project of the Energy Action Coalition, but with over 125 actions coordinated by numerous organizations, it precipitated the formation of the coalition the following June. The day of action featured demonstrations promoting renewable energy and protesting President George W. Bush's energy plan.
The second Fossil Fools Day on April 1, 2005, promoted in the United States and Canada by the Energy Action Coalition included more than 300 actions in Canada and the U.S., and actions in England, Nigeria and Panama. One example of the a student organized event was as a bike ride organized by Middlebury College students and included students from Green Mountain College and |
https://en.wikipedia.org/wiki/GroupLens%20Research | GroupLens Research is a human–computer interaction research lab in the Department of Computer Science and Engineering at the University of Minnesota, Twin Cities specializing in recommender systems and online communities. GroupLens also works with mobile and ubiquitous technologies, digital libraries, and local geographic information systems.
The GroupLens lab was one of the first to study automated recommender systems with the construction of the "GroupLens" recommender, a Usenet article recommendation engine, and MovieLens, a popular movie recommendation site used to study recommendation engines, tagging systems, and user interfaces. The lab has also gained notability for its members' work studying open content communities such as Cyclopath, a geo-wiki that was used in the Twin Cities to help plan the regional cycling system.
History
Formation
In 1992, John Riedl and Paul Resnick attended the
CSCW conference
together. After they heard keynote speaker Shumpei Kumon talk
about his vision for an information economy, they began working on a collaborative filtering
system for Usenet news. The system collected ratings from Usenet readers and used those ratings to predict how much other readers would like an article before they read it. This recommendation engine was one of the first automated collaborative filtering systems in which algorithms were used to automatically form predictions based on historical patterns of ratings. The overall system was called the "GroupLens" recommender, and the servers that collected the ratings and performed the computation were called the "Better Bit Bureau". This name was later dropped after a request from the Better Business Bureau. "GroupLens" is now used as a name both for this recommender system, and for the research lab at the University of Minnesota.
A feasibility test was done between MIT and
the University of Minnesota and a research paper was published including
the algorithm, the system design, and the results of the feasibility
study, in the CSCW conference of 1994.
In 1993, Riedl and Resnick invited Joseph Konstan to join the
team. Together, they decided to create a higher-performance
implementation of the algorithms to support larger-scale deployments.
In summer 1995 the team gathered
Bradley Miller, David Maltz,
Jon Herlocker, and Mark Claypool for "Hack Week" to create
the new implementation, and to plan the next round of experiments.
In the Spring of 1996, the first workshop on
collaborative filtering was put together by Resnick and
Hal Varian at the University of California, Berkeley.
There, researchers from projects around the US
that were studying similar systems came together to share ideas and
experience.
Net Perceptions
In the summer of 1996, David Gardiner, a former Ph.D. student of Riedl's, introduced John Riedl to Steven Snyder. Snyder had been an early employee at Microsoft, but left Microsoft to come to Minnesota to do a Ph.D. in Psychology. He realized the commercial pot |
https://en.wikipedia.org/wiki/DOS | DOS (, ) is a family of disk-based operating systems for IBM PC compatible computers. The DOS family primarily consists of IBM PC DOS and a rebranded version, Microsoft's MS-DOS, both of which were introduced in 1981. Later compatible systems from other manufacturers include DR-DOS (1988), ROM-DOS (1989), PTS-DOS (1993), and FreeDOS (1998). MS-DOS dominated the IBM PC compatible market between 1981 and 1995.
Although the name has come to be identified specifically with this particular family of operating systems, DOS is a platform-independent acronym for disk operating system, whose use predates the IBM PC. Dozens of other operating systems also use the acronym, beginning with the mainframe DOS/360 from 1966. Others include Apple DOS, Apple ProDOS, Atari DOS, Commodore DOS, TRSDOS, and AmigaDOS.
History
Origins
IBM PC DOS (and the separately sold MS-DOS) and its predecessor, 86-DOS, ran on Intel 8086 16-bit processors. It was developed to be similar to Digital Research's CP/M—the dominant disk operating system for 8-bit Intel 8080 and Zilog Z80 microcomputers—in order to simplify porting CP/M applications to MS-DOS.
When IBM introduced the IBM PC, built with the Intel 8088 microprocessor, they needed an operating system. Chairman John Opel had a conversation with fellow United Way National Board Executive Committee member Mary Maxwell Gates, who referred Opel to her son Bill Gates for help with an 8088-compatible build of CP/M. IBM was then sent to Digital Research, and a meeting was set up. However, initial negotiations for the use of CP/M broke down: Digital Research wished to sell CP/M on a royalty basis, while IBM sought a single license, and to change the name to "PC DOS". Digital Research founder Gary Kildall refused, and IBM withdrew.
IBM again approached Bill Gates. Gates in turn approached Seattle Computer Products. There, programmer Tim Paterson had developed a variant of CP/M-80, intended as an internal product for testing SCP's new 16-bit Intel 8086 CPU card for the S-100 bus. The system was initially named QDOS (Quick and Dirty Operating System), before being made commercially available as 86-DOS. Microsoft purchased 86-DOS, allegedly for . This became Microsoft Disk Operating System, MS-DOS, introduced in 1981.
Within a year Microsoft licensed MS-DOS to over 70 other companies, which supplied the operating system for their own hardware, sometimes under their own names. Microsoft later required the use of the MS-DOS name, with the exception of the IBM variant. IBM continued to develop their version, PC DOS, for the IBM PC. Digital Research became aware that an operating system similar to CP/M was being sold by IBM (under the same name that IBM insisted upon for CP/M), and threatened legal action. IBM responded by offering an agreement: they would give PC consumers a choice of PC DOS or CP/M-86, Kildall's 8086 version. Side-by-side, CP/M cost more than PC DOS, and sales were low. CP/M faded, with MS-DOS and PC DOS becoming th |
https://en.wikipedia.org/wiki/Geoffrey%20C.%20Bowker | Geoffrey C. Bowker is Professor of Informatics at the University of California, Irvine. He moved to UCI at the start of 2012, having held the positions of Professor and Senior Scholar in Cyberscholarship at the University of Pittsburgh School of Information. Prior to that, Bowker was Executive Director and Regis and Dianne McKenna Professor at the Center for Science, Technology and Society at Santa Clara University. Previously, Bowker was chair of the Department of Communication at the University of California - San Diego and has held appointments at the
University of Illinois at Urbana-Champaign.
With his late partner Susan Leigh Star, he has devoted much of his career to examining the values embedded within sociotechnical infrastructures such as databases, visualization strategies, and science and engineering standards. "To classify is human," as it says in their mutual work, meaning that it's a human instinct to classify things.
With Helen Nissenbaum, he founded the NSF funded Values in Design network to bring together scholars examining these issues across broader sites of study and across disciplines.
Selected works
Sorting Things Out: Classification and its Consequences, MIT Press, 1999. (co-authored with Susan Leigh Star).
Memory Practices in the Sciences, MIT Press, 2005.
Understanding Infrastructure: Dynamics, Tensions, and Design, 2007.
References
External links
Homepage
EVOKE Lab
Year of birth missing (living people)
Living people
University of California, Irvine faculty |
https://en.wikipedia.org/wiki/Livescribe | Livescribe is a paper-based computing platform that consists of a digital pen, digital paper, software applications, and developer tools.
Central to the Livescribe platform is the smartpen, a ballpoint pen with an embedded computer and digital audio recorder. When used with Anoto digital paper, it records what it writes for later uploading to a computer, and synchronizes those notes with any audio it has recorded. This allows users to replay portions of a recording by tapping on the notes they were taking at the time the recording was made. It is also possible to select which portion of a recording to replay by clicking on the relevant portion of a page on-screen, once it has been synced to the Livescribe Desktop software.
Jim Marggraff, inventor of the LeapFrog FLY Pentop computer and creator of the LeapPad Learning System, left Leapfrog in 2005 to form Livescribe.
In November 2015, Livescribe announced its acquisition by Anoto for $15m.
The smartpen
A Livescribe smartpen is about the size and weight of a large pen (5/8" x 6 1/8"), and is equipped with a removable ball-point ink cartridge, a microphone to record audio, a speaker for playback, a small OLED display, an infra-red camera, and internal flash memory that captures handwritten notes, audio and drawings.
The user can choose to record audio in addition to the handwritten text. Recorded audio is kept indexed with the handwritten text—tapping on a written word starts playback of the recorded audio from that part of the recording.
The smartpen allows the installation of as many applications as there is memory, and ships with several applications. If tapped on the correct images, it can function as a calculator, for example, or can translate words (the translator software as shipped includes only 21 words in a small selection of languages - as of September 2010 there are no public plans to make a full version of this translator available ).
Livescribe has made four versions of its smartpen: Pulse, Echo, Sky Wi-Fi (or Livescribe Wi-Fi), and Livescribe 3. The pens can store about 100 hours of audio per gigabyte.
The Pulse smartpen, released in March 2008, is available with either 1, 2 or 4 Gigabytes of flash storage. It requires a special USB cradle and uses a 2.5mm headphone jack.
The Echo smartpen, released in July 2010, comes with either 2GB, 4GB or 8 GB of memory. Compared to the Pulse smartpen, it is less round in shape and uses more standardized connection ports. The Echo integrates with the Desktop software via a standard micro USB cable and can connect to headphones with a more common 3.5-millimeter jack.
In October 2012, Livescribe announced the Sky Wi-Fi smartpen, which uses Wi-Fi to transfer the notes and audio to Evernote without using the proprietary Livescribe Desktop software. In the European Union, this product is sold as the "Livescribe Wi-Fi smartpen" due to a trademark dispute with BSkyB.
In November 2013, the Livescribe 3 was released. This uses Bluetooth Low |
https://en.wikipedia.org/wiki/Random-access%20memory | Random-access memory (RAM; ) is a form of electronic computer memory that can be read and changed in any order, typically used to store working data and machine code. A random-access memory device allows data items to be read or written in almost the same amount of time irrespective of the physical location of data inside the memory, in contrast with other direct-access data storage media (such as hard disks, CD-RWs, DVD-RWs and the older magnetic tapes and drum memory), where the time required to read and write data items varies significantly depending on their physical locations on the recording medium, due to mechanical limitations such as media rotation speeds and arm movement.
RAM contains multiplexing and demultiplexing circuitry, to connect the data lines to the addressed storage for reading or writing the entry. Usually more than one bit of storage is accessed by the same address, and RAM devices often have multiple data lines and are said to be "8-bit" or "16-bit", etc. devices.
In today's technology, random-access memory takes the form of integrated circuit (IC) chips with MOS (metal–oxide–semiconductor) memory cells. RAM is normally associated with volatile types of memory where stored information is lost if power is removed. The two main types of volatile random-access semiconductor memory are static random-access memory (SRAM) and dynamic random-access memory (DRAM).
Non-volatile RAM has also been developed
and other types of non-volatile memories allow random access for read operations, but either do not allow write operations or have other kinds of limitations on them. These include most types of ROM and a type of flash memory called NOR-Flash.
Use of semiconductor RAM dated back to 1965, when IBM introduced the monolithic (single-chip) 16-bit SP95 SRAM chip for their System/360 Model 95 computer, and Toshiba used discrete DRAM memory cells for its 180-bit Toscal BC-1411 electronic calculator, both based on bipolar transistors. While it offered higher speeds than magnetic-core memory, bipolar DRAM could not compete with the lower price of the then-dominant magnetic-core memory.
MOS memory, based on MOS transistors, was developed in the late 1960s, and was the basis for all early commercial semiconductor memory. The first commercial DRAM IC chip, the 1K Intel 1103, was introduced in October 1970.
Synchronous dynamic random-access memory (SDRAM) later debuted with the Samsung KM48SL2000 chip in 1992.
History
Early computers used relays, mechanical counters or delay lines for main memory functions. Ultrasonic delay lines were serial devices which could only reproduce data in the order it was written. Drum memory could be expanded at relatively low cost but efficient retrieval of memory items required knowledge of the physical layout of the drum to optimize speed. Latches built out of vacuum tube triodes, and later, out of discrete transistors, were used for smaller and faster memories such as registers. Such registers were re |
https://en.wikipedia.org/wiki/List%20of%20file-sharing%20programs%20for%20Linux%20and%20BSD | A list of file sharing programs for use on computers running Linux, BSD or other Unix-like operating systems, categorised according to the different filesharing networks or protocols they access.
BitTorrent
BitTorrent
Deluge
KTorrent
Miro
Opera
Tixati
Transmission
Tribler - Tribler uses a modified form of the BitTorrent protocol; it is anonymous and decentralized (and so does not require a tracker or indexing service to discover content).
Vuze
Direct Connect & Advanced Direct Connect
LinuxDC++
eDonkey & Kad
aMule
EDonkey 2000 (inactive)
MLDonkey
Freenet
GNUnet
Gnunet
Gnutella
Phex
gtk-gnutella
Limewire
IRC with DCC or XDCC
HexChat
Soulseek
Nicotine Plus - external
Multiple Filesharing Protocols/Networks
Apollon (inactive): Ares, FastTrack, Gnutella, OpenFT
FrostWire: BitTorrent, Gnutella
giFT (inactive): Ares, FastTrack, Gnutella, OpenFT
LimeWire: BitTorrent, Gnutella
Lphant - external: BitTorrent, eDonkey, Kad
MLdonkey: BitTorrent, DirectConnect, eDonkey, FastTrack, Kad, Overnet
File sharing software |
https://en.wikipedia.org/wiki/Message%20Session%20Relay%20Protocol | In computer networking, the Message Session Relay Protocol (MSRP) is a protocol for transmitting a series of related instant messages in the context of a communications session. An application instantiates the session with the Session Description Protocol (SDP) over Session Initiation Protocol (SIP) or other rendezvous methods.
The MSRP protocol is defined in RFC 4975. MSRP messages can also be transmitted by using intermediaries peers, by using the relay extensions defined in RFC 4976.
MSRP is used in the RCS context, especially for the instant messaging, file transfer and photo sharing features.
Protocol design
MSRP syntax is similar to other IETF text based protocols such as SIP, HTTP and RTSP.
MSRP requires a reliable transport layer, like TCP. Each message is either a request or a response and uses URIs; a message contains headers and a body that can carry any type of data, including binary information.
The first 2 headers must be To-Path and From-Path and the last must be Content-Type; this significantly reduces the complexity of parsers. Messages must also end with 7 dash ('-') characters, followed by a transaction identifier which appears in the first line; these are followed by a continuation flag, which is a single character and end of line (CRLF). This last line at the end of messages makes it rather simple to find and detect the message boundaries.
An MSRP URI has a scheme (which is "msrp" or "msrps"), authority, as defined by RFC 3986, which holds the IP/domain name and possibly the port, an optional session identifier, the transport and additional optional parameters. For example:
msrp://atlanta.example.com:7654/jshA7weztas;tcp
msrp is the scheme
atlanta.example.com:7654 is the authority
jshA7weztas is the session identifier
tcp is the transport
Usage in SIP
MSRP can be used within a SIP session:
to do instant messaging in a one-to-one or one-to-many mode
to do an attachment file transfer
to do some photo sharing (e.g., Image Share) based on prior exchange of capabilities between the user endpoints
MSRP session is set up through SIP's offer-answer model. The SDP m-line media type is message and the protocol is either TCP/MSRP for MSRP over TCP and TCP/TLS/MSRP for MSRP over secure TLS. Furthermore, the MSRP URI is specified in a path attribute.
A full SDP example, as provided by the RFC:
v=0
o=alice 2890844526 2890844527 IN IP4 alice.example.com
s= -
c=IN IP4 alice.example.com
t=0 0
m=message 7394 TCP/MSRP *
a=accept-types:text/plain
a=path:msrp://alice.example.com:7394/2s93i9ek2a;tcp
The address and port are contained in the c- and m-lines, but also in the path attribute on an a-line. Generally, other media types use the c-line and m-line to describe the address and port, but the MSRP RFC 4975 section 8.1 says the path attribute is the authoritative source for MSRP.
See also
SIP for Instant Messaging and Presence Leveraging Extensions (SIMPLE)
Session Initiation Protocol (SIP)
IP Multimedia Subsys |
https://en.wikipedia.org/wiki/Ecpod.com | ECPod.com was a Chinese-language social network, created in 2007 by a group of young entrepreneurs in Hong Kong. ECPod was also a community portal for people to share videos.
History
ECPod was first launched in June 2007 as a language learning website. ECPod stood for "English Chinese Podcast", where members could post home videos of themselves teaching English and Chinese.
Growth
At the early stage, ECPod was paying a rate of US$1.20 or RMB10 per video clip for members to upload their videos. The response was overwhelming and after just 2 months, ECPod had to stop paying for videos due to budget constraints. However, membership swelled to 5,000 by August 2007 and members continued to upload home-made videos for no pay as the community grew.
By December 2007, membership stood at 20,000 and members started to experience a slowdown in server response time when using the website. This was due to lack of bandwidth for users outside of Hong Kong. The founders of ECPod started to look for potential investors in early 2008 and managed to attract private angel investors in Hong Kong. ECPod received its first investment of US$150,000 in March 2008.
Updates
From April 2008 to May 2008, ECPod ran a member survey to gauge interest in features needed to redevelop the website beyond a language learning portal. With the survey results and the investment money, ECPod contracted a team of 5 developers and designers from VHost Network to start the development of ECPod phase II.
The beta version of the new, phase II ECPod site was released on 16 October 2008.
Further reading
References
External links
Official Site
Chinese social networking websites |
https://en.wikipedia.org/wiki/History%20of%20compiler%20construction | In computing, a compiler is a computer program that transforms source code written in a programming language or computer language (the source language), into another computer language (the target language, often having a binary form known as object code or machine code). The most common reason for transforming source code is to create an executable program.
Any program written in a high-level programming language must be translated to object code before it can be executed, so all programmers using such a language use a compiler or an interpreter. Thus, compilers are very important to programmers. Improvements to a compiler may lead to a large number of improved features in executable programs.
The Production Quality Compiler-Compiler, in the late 1970s, introduced the principles of compiler organization that are still widely used today (e.g., a front-end handling syntax and semantics and a back-end generating machine code).
First compilers
Software for early computers was primarily written in assembly language, and before that directly in machine code. It is usually more productive for a programmer to use a high-level language, and programs written in a high-level language can be reused on different kinds of computers. Even so, it took a while for compilers to become established, because they generated code that did not perform as well as hand-written assembler, they were daunting development projects in their own right, and the very limited memory capacity of early computers created many technical problems for practical compiler implementations.
Between 1942 and 1945, Konrad Zuse developed ("plan calculus"), the first high-level language for a computer, for which he envisioned a ("plan assembly device"), which would automatically translate the mathematical formulation of a program into machine-readable punched film stock. However, the first actual compiler for the language was implemented only decades later.
Between 1949 and 1951, Heinz Rutishauser proposed Superplan, a high-level language and automatic translator. His ideas were later refined by Friedrich L. Bauer and Klaus Samelson.
The first practical compiler was written by Corrado Böhm in 1951 for his PhD thesis, one of the first computer science doctorates awarded anywhere in the world.
The first implemented compiler was written by Grace Hopper, who also coined the term "compiler", referring to her A-0 system which functioned as a loader or linker, not the modern notion of a compiler. The first Autocode and compiler in the modern sense were developed by Alick Glennie in 1952 at the University of Manchester for the Mark 1 computer. The FORTRAN team led by John W. Backus at IBM introduced the first commercially available compiler, in 1957, which took 18 person-years to create.
The first ALGOL 58 compiler was completed by the end of 1958 by Friedrich L. Bauer, Hermann Bottenbruch, Heinz Rutishauser, and Klaus Samelson for the Z22 computer. Bauer et al. had been working on compiler |
https://en.wikipedia.org/wiki/List%20of%20barangays%20in%20Valenzuela | This is a list of barangays in Valenzuela in the Philippines based on 2015 census data of the Philippine Statistics Authority.
List of barangays
Alternate names of barangays
Canumay West is the political name for the barangay but it is sometimes called Canumay.
Gen. T. de Leon is sometimes spelled as Hen. T. de Leon ("Hen." being Heneral, the Filipino equivalent for Gen. or General), and sometimes abbreviated as GTDL.
Karuhatan is sometimes spelled as Caruhatan.
Marulas is sometimes called BBB or simply BB. Balintawak Beer Brewery (BBB) used to be located in Marulas before it was acquired by San Miguel Corporation to form San Miguel Polo Beer Brewery.
Paso de Blas is sometimes called Tollgate because of Paso de Blas Exit (also known as Malinta Exit and Valenzuela Exit) at Km. 15 of North Luzon Expressway.
Veinte Reales is sometimes spelled as Viente Reales or Veintereales, with i and e interchanged, without affecting its pronunciation.
Gallery
See also
List of populated places in Metro Manila
External links
References
Valenzuela, Metro Manila
Valenzuela
Valenzuela |
https://en.wikipedia.org/wiki/Marconi%20Myriad | The Marconi Myriad was an early computer designed by the Marconi Company in the 1960s.
Myriad was a 24-bit machine largely built using integrated circuits from Ferranti which were packaged in small "TO-5" type cans. The architecture was "conventional", and was developed largely by the in-house Marconi team that designed similar, but physically larger computers based on SB345 discrete surface-barrier transistors. These machines were used successfully by the Royal Radar Establishment (RRE) and the Road Research Laboratory in the UK. In Sweden they were used by the Government in their "Fur Hat" defence system and in the Air Force where two computers were used for the meteorological service from the late 1960s to early 1990s. They also provided flight data for UK military air traffic control for 15 years. In Australia, two Myriads were used as part of each of the AF/TPS-802 "HUBCAP" air-defence systems from 1967–97. The Myriads were used in a coupled mode with one providing a radar data extractor and data quantiser role, and the other driving display overlays and tactical display information on radar and tactical screens.
The Myriad 1 computer was mounted in a small desk format and weighed . Eight bit paper tape was (somewhat) standard input (the software could handle data input in either the ASCII or the rather idiosyncratic KDF9 character codes) – but a high speed 1000-characters per second electrostatic reader made by Facit was capable of projecting paper tape across a room in spectacular fashion. A high-speed printer was provided. The major machine cycle time was around 800 nanoseconds, with inner cycles around 200 nanoseconds.
Most early programming was performed in very amenable and complete assembly code. Some use was also made of a subset of Coral 66 known as Mini-Coral. The 24-bit architecture provided a logical and flexible address/data environment but the 15-bit address limited the memory size to 32K 24-bit words. The operating system allowed multiple programs to run concurrently but most systems were coded "on the bare metal". Addressing allowed easy integration of external computing and display equipment. An embedded parallel bus allowed two Myriads and some peripheral expansion devices to be directly addressed. For example, in the "Hubcap" configuration, two 16k Myriads shared a 32k 4-wire core memory "backing store" and could save, retrieve or share information at high speed.
In 1964, a Myriad prototype was displayed at a major computer show in London. To catch the public's attention, it was decided to deploy a model HO railroad layout containing numbered (1–10) rolling stock. The public were invited to enter the order in which they wanted to see the train assembled. Immediately Myriad developed a strategy for shunting trucks around the tracks to assemble the train correctly.
Myriad production started in 1965.
Myriad II was demonstrated for the first time at the 1966 exhibition in Munich.
Myriad III was announced in 1970.
The |
https://en.wikipedia.org/wiki/World%20Bank%20residual%20model | The World Bank residual model, in economics, refers to a widely used model by economists to measure illicit financial flows. The data sources for this analysis are the large-scale macroeconomic databases maintained by the International Monetary Fund and the World Bank.
In order to estimate illicit financial flows, this method measures a country's source of funds (inflows of capital) against its recorded use (outflows and/or expenditures of capital). Source of funds includes increases in net external indebtedness of the public sector and the net inflow of foreign direct investment. Use of funds includes the current account deficit that is financed by the capital account flows and additions to central bank reserves. An excess source of funds over the recorded use (or expenditures) points to a loss of unaccounted-for capital, and, as such, indicates illicit financial outflow.
World Bank
International finance |
https://en.wikipedia.org/wiki/Ewa%20Siemaszko | Ewa Siemaszko is a Polish writer, publicist and lecturer; collector of oral accounts and historical data regarding the Massacres of Poles in Volhynia. An engineer by profession with Master's in technological studies from the Warsaw University of Life Sciences, Siemaszko worked in public health education and also as a school teacher following graduation. She is a daughter of writer Władysław Siemaszko with whom she collaborates and shares strong interest in Polish World War II history.
From 1990 Ewa Siemaszko collected and prepared documents regarding the ethnic cleansing that took place in Volhynia during the Second World War. She is the co-author of a 1992 exhibition at the Warsaw Museum of Independence regarding the atrocities committed by the NKVD in and around the Polish Kresy region in 1941; and, an exhibit "Wolyn or our ancestors" organised in 2002 at the Dom Polonii in Warsaw. She also collaborates with the Society of Volyn and Polissia at the Polish Institute of National Remembrance.
For her contribution to the monograph Ludobójstwo dokonane przez nacjonalistów ukraińskich na ludności polskiej Wołynia 1939-1945 (Genocide committed by Ukrainian Nationalists in Volhynia 1939–1945) written together with her father Władysław, she received the Józef Mackiewicz Literary Prize and medal in 2002.
Selected publications
Ewa Siemaszko with Władysław Siemaszko, Ludobójstwo dokonane przez nacjonalistów ukraińskich na ludności polskiej Wołynia 1939-1945, (Genocide committed by the Ukrainian Nationalists against the Polish inhabitants of Volyn) Warsaw, 2000, length: 1433 pages, illustrated, . Preface by Prof. dr Ryszard Szawłowski.
Ewa Siemaszko, Wołyń naszych przodków Śladami życia - czas zagłady, 2008
Ewa Siemaszko, The July 1943 genocidal operations of the OUN-UPA in Volhynia
Ukrainian responses
According to Ukrainian historian Yaroslav Tsaruk (Ярослав Царук), who commented on data collected by Siemaszkos, the number of ethnic Poles given by them, in some of the villages he is familiar with, does not correspond with his Ukrainian research. According to Tsaruk, Siemaszkos included in the number of Polish citizens also those who emigrated before the commencement of hostilities according to him, and included population points which were not administrative units, thus enlarging the number of Polish victims of ethnic cleansing while minimizing the Ukrainian casualties. Tsaruk claims that although according to Siemaszkos 1,915 Poles died in the hands of Ukrainian Nationalists in the area of Volodymyr, according to him – only 430. Siemaszkos in their own monograph replied to this kind of criticism by stating that claims made by Tsaruk are based on statements made by Ukrainian villagers half a century after the war ended, therefore the discrepancies in what is being said by the locals can be "explained by psychological defense mechanisms".
Another Ukrainian historian, Ihor Ilyushin, echoed Tsaruk's observations and questioned whether Siemaszkos' a |
https://en.wikipedia.org/wiki/Tivi%20%28disambiguation%29 | Tivi is a village and municipality in the Ordubad Rayon of Nakhchivan, Azerbaijan.
Tivi may also refer to:
Tiv people or Tivi, an ethnic nation in West Africa
, a Finnish computer magazine published by Alma Media
People with the given name
Tivi Etok, a Canadian Inuit artist
See also
TV
Tiwi (disambiguation) |
https://en.wikipedia.org/wiki/Northern%20Lights%20Library%20Network | Northern Lights Library Network (NLLN) is the largest (geographically) of seven multi-county, multitype library cooperative systems in the state of Minnesota. NLLN serves all types of libraries found in the 23 counties of Northwest and West Central Minnesota. The organization has over 300 member libraries including public libraries, school libraries, academic libraries (private and public), and special libraries. Northern Lights Library Network is established in Minnesota statute and receives funding from the Minnesota legislature via the Office of State Library Services within the Minnesota Department of Education. NLLN offices are located in Moorhead, Minnesota.
Governance
The organization is governed by an eleven-member governing board. Seven citizen board members are appointed by the 4 regional public library systems in the NLLN region; 4 members are library workers representing academic, public, school, and special libraries and are selected by their peers. The board meets six times each year.
Continuing Education
Northern Lights Library Network provides a variety of continuing education opportunities for library staff, advocates, and trustees. One example is the organization's sponsorship of the annual "Spotlight on Books," conference now in its 21st year. The conference provides an opportunity for librarians and educators to learn about children's literature and to meet local and national authors.
External links
Northern Lights Library Network (NLLN)
Library consortia in Minnesota |
https://en.wikipedia.org/wiki/Data%20Protection%20Act | Data Protection Act may refer to:
Data Protection Act, 2012 (Ghana)
Data Protection Act 2018 (United Kingdom)
The now-superseded Data Protection Act 1998 and Data Protection Act 1984 (United Kingdom) |
https://en.wikipedia.org/wiki/Fiber%20media%20converter | A fiber media converter is a simple networking device that makes it possible to connect two dissimilar media types such as twisted pair with fiber optic cabling. They were introduced to the industry in the 1990s, and are important in interconnecting fiber optic cabling-based systems with existing copper-based structured cabling systems. They are also used in metropolitan area network (MAN) access and data transport services to enterprise customers.
Media conversion types
Fiber media converters support many different data communication protocols including Ethernet, Fast Ethernet, Gigabit Ethernet, T1/E1/J1, DS3/E3, as well as multiple cabling types such as coax, twisted pair, multi-mode and single-mode fiber optics. Media converter types range from small standalone devices and PC card converters to high port-density chassis systems that offer many advanced features for network management.
On some devices, Simple Network Management Protocol (SNMP) enables proactive management of link status, monitoring chassis environmental statistics and sending traps to network managers in the event of a fiber break or even link loss on the copper port.
Fiber media converters can connect different local area network (LAN) media, modifying duplex and speed settings. Switching media converters can connect different speed network segments. For example, existing half-duplex hubs can be connected to 100BASE-TX Fast Ethernet network segments over 100BASE-FX fiber.
When expanding the reach of the LAN to span multiple locations, media converters are useful in connecting multiple LANs to form one large campus area network that spans over a limited geographic area. As premises networks are primarily copper-based, media converters can extend the reach of the LAN over single-mode fiber up to 160 kilometers with 1550 nm optics.
Wavelength-division multiplexing (WDM) technology in the LAN is especially beneficial in situations where fiber is in limited supply or expensive to provision. As well as conventional dual strand fiber converters, with separate receive and transmit ports, there are also single-strand fiber converters, which can extend full-duplex data transmission up to 120 kilometers over one optical fiber.
Other benefits of media conversion include providing a gradual migration path from copper to fiber. Fiber connections can greatly extend the reach and reduce electromagnetic interference.
Also fiber media converters pose as an alternative solution for switches not supporting fiber; ordinary switches can use fiber media converters to connect to a fiber network.
Converter types
Simple converters – when the speed and duplex settings on both media is identical – consist of two pairs of transmitters/receivers, each with their medium-dependent interfaces (when no data recoding is necessary) or their media-independent interfaces joined together back-to-back in a dual-simplex fashion. They can transport either half-duplex or full-duplex traffic but both sides mu |
https://en.wikipedia.org/wiki/Hitachi%20Data%20Systems | Hitachi Data Systems (HDS) was a provider of modular mid-range and high-end computer data storage systems, software and services. Its operations are now a part of Hitachi Vantara.
It was a wholly owned subsidiary of Hitachi Ltd. and part of the Hitachi Information Systems & Telecommunications Division. In 2017 its operations were merged with Pentaho and Hitachi Insight Group to form Hitachi Vantara.
In 2010, Hitachi Data Systems sold through direct and indirect channels in more than 170 countries and regions. Its customers included over half of the Fortune 100 companies at the time.
History
Origin as Itel
Itel was an equipment leasing company founded in 1967 by Peter Redfield and Gary Friedman, initially focusing on leasing IBM mainframes. Through creative financial arrangements and investments, Itel was able to lease IBM mainframes to customers at costs below what customers would have paid, making them second to IBM itself in revenues.
A joint venture between National Semiconductor and Hitachi formed in 1977 was contracted by Itel to manufacture IBM-compatible mainframes branded as Advanced Systems. After initial success shipping 200 such systems and netting profits of $73 million, Itel increased their investments and personnel to market their Advanced Systems brand. When Itel requested lower prices in order to compete with IBM, Charlie Sporck, CEO of National Semiconductor, persuaded Itel to commit to long-term contracts with National Semiconductor and Hitachi.
National Semiconductor takes over Advanced Systems
Thereafter, news leaked that IBM was releasing a new technologically superior line of computers, and customers responded by holding back purchases, causing Itel's inventory to build up drastically. Hitachi agreed to Itel's request to cut back on shipment, but National Semiconductor was adamant in persisting with what the industry termed as National's blackmailing of Itel. In 1979, Redfield was forced to resign as CEO, and National Semiconductor took over Itel Advanced Systems, including its sales and marketing team.
National renamed the division to National Advanced Systems (NAS), assembling and selling IBM-compatibles where the central processing unit (CPU) was imported from Hitachi. National and Hitachi often depended on IBM's gradual and restrained roll-out of newer models to feed on IBM's technology and market share thereby allowing NAS occasional successes.
NAS began shipping its AS/9000 DPC Plug Compatible mainframes in late 1981. IBM, however, had invested and obtained success in semiconductor technologies which enabled them to build powerful computers at lower costs. Meanwhile, the mainframe market was in decline as mini- and microcomputers, and the UNIX operating system gained popularity. Mainframe makers such as Sperry, Honeywell, Burroughs, NCR and Control Data were gradually being forced out of the mainframe market. Both NAS and Amdahl (the other IBM plug compatible mainframe maker), faced technological and sales pr |
https://en.wikipedia.org/wiki/R%C3%A1dio%20Record | Rádio Record is a Brazilian radio station based in São Paulo, Brazil. It is part of the Grupo Record and operates in the frequency 1000 kHz AM. It has programming dedicated to sports, news, and popular programs.
History
Rádio Record was founded in 1928 by Álvaro Liberato de Macedo, with the name of Rádio Sociedade Record, and passed to Paulo Machado de Carvalho in 1931.
In 1932, it became famous thanks to the covering of transmission of the Constitutionalist Revolution of 1932.
After that, the Rádio Record started to transmit music shows with famous artists and singers. Its leadership in 30 years passed to be shared with the Rádio Nacional.
At the end of the 80s on Rádio Record sold to the businessman Edir Macedo.
See also
Rede Record
External links
Radio stations in Brazil
Radio stations established in 1928
Mass media in São Paulo
Grupo Record |
https://en.wikipedia.org/wiki/Ground%20Zero%20%28TV%20program%29 | Ground Zero was a late night Australian music television program on Network Ten that featured music videos and live appearances. The program was written and produced by James Mark Anthony who also negotiated sponsorship with major brands that allowed the program to be produced free of charge to Network Ten. The program aired from 1997 to 2001 and was initially directed by Bernie Zelvis and was hosted by Jade Gatt (who was dropped from the show in controversial circumstances).Ugly Phil and Jackie O (radio hosts) replaced Jade Gatt, Ugly Phil and Jackie O.
By 1999 the program was no longer filmed in a studio and was instead shot on various locations across Sydney and Melbourne. With the structural change also came a change of host with Nick Benett, Fiona Horne and Rod Cuddihy presenting the show during 1999 and 2000. Damian Harland was editor 1999 & 2000.
James Mark Anthony sold the program/format to Becker Entertainment in 2001 and the program folded not long after due to falling sponsorship.
The program/format outlasted many music formats on Australian television due to its popularity and was the recipient of an ARIA Award for sales of over 35,000 units for the Ground Zero compilation music CD.
The program was highly successful with the format also introduced by James Mark Anthony into New Zealand on TV2, and is remembered as being one of the early television programs in Australia to feature an internet presence encouraging interactive contributions from viewers.
References
External links
Ground Zero website at The Internet Archive
Ground Zero on IMDB
Network 10 original programming
Australian music television series
1997 Australian television series debuts
2001 Australian television series endings |
https://en.wikipedia.org/wiki/FleetBroadband | FleetBroadband is maritime satellite internet, telephony, SMS texting, and ISDN network for ocean-going vessels using portable domed terminal antennas.
These antennas, and corresponding indoor controllers, are used to connect phones and laptop computers from sailing vessels to the Internet. All antennas require line-of-sight (LOS) to one of three geosynchronous orbit satellites, thus allowing the terminal to be used on land as well.
Details
The FleetBroadband network was developed by Inmarsat and is composed of three geosynchronous orbiting satellites known as I-4s that allow contiguous global coverage, except for the poles. FleetBroadband systems installed on vessels may travel from ocean to ocean without human interaction. Line-of-sight to the I-4 satellites is required for connectivity, which can be achieved even in rough rolling seas. Since the FleetBroadband network uses the L band, it is more resistant to rain fade than VSAT or C Band systems.
The FleetBroadband service was modeled after terrestrial Internet services where IP (Internet Protocol)-based traffic dominated over ISDN and other earlier communication protocols.
Terminals
There are three-terminal antenna types available: The FB150 antenna (291 × 275 mm), commercially launched in 2009, is capable of 150 kbit/s, the FB250 antenna (329 × 276 mm) is capable of 284 kbit/s, the FB500 antenna (605 × 630 mm) capable of up to 432 kbit/s. The latter two commercially launched in 2007. Current manufacturers of FleetBroadband systems include Thrane & Thrane (Sailor Systems), Wideye (Skipper), KVH, and JRC.
See also
SES Broadband for Maritime
Stratos Global Corporation, makers of AmosConnect
References
External links
Inmarsat FleetBroadband website
Satellite telephony
Satellite Internet access
Maritime communication |
https://en.wikipedia.org/wiki/Computing%20Community%20Consortium | The Computing Community Consortium (CCC) is a programmatic committee of the Computing Research Association. Its stated mission is "...to catalyze the computing research community and enable the pursuit of innovative, high-impact research".
The CCC conducts activities that strengthen the research community, articulate compelling research visions, and align those visions with pressing national and global challenges. The CCC communicates the importance of those visions to policymakers, government and industry stakeholders, the public, and the research community itself.
History
In March 2006, the National Science Foundation (NSF) issued a solicitation indicating its desire to establish a Computing Community Consortium. In October of that year, CRA responded to the solicitation, submitting a proposal that was backed by explicit letters of support from 132 Ph.D.-granting academic programs, 16 leading corporations, 7 major national laboratories and research centers, and five professional societies in the field. Pursuant to positive external peer review, the CCC was established in late 2006 through a cooperative agreement between NSF and CRA.
An interim CCC Council was appointed by the proposal team in December 2006. Following an open recruitment process, Ed Lazowska (University of Washington) was selected as Chair of the CCC Council in March 2007. The membership of the inaugural CCC Council was selected through a transparent process and announced in June 2007. The first public activity of the CCC was a set of five plenary talks at the Federated Computing Research Conference (FCRC 2007) that month.
Early on, CCC Council member Susan Graham assumed the role of Vice Chair. Andrew Bernat, CRA's Executive Director, served the CCC in the role of staff Director until Erwin Gianchandani was recruited as full-time staff Director in April 2010. Ann Drobnis took over as Director in March 2013.
Current Structure
Today, the CCC Council has 20 members on 3-year staggered terms, representing the diverse nature of the computing research field. Liz Bradley serves as chair and Dan Lopresti serves as vice-chair.
The CCC operates as a programmatic committee of CRA under CRA's bylaws: its membership only slightly overlaps the CRA's board of directors; it has significant autonomy, and it has a great deal of synergistic mutual benefit with CRA. The CCC Council meets three times every calendar year, including at least one meeting in Washington, D.C., and has biweekly conference calls between these meetings. Also, the CCC leadership has biweekly conference calls with the leadership of NSF's Directorate for Computer and Information Science and Engineering (CISE).
The CCC is broadly inclusive, and any computing researcher who wishes to become involved is encouraged to do so. For example, each winter, the CCC issues a call for nominations for Council members effective the following July.
References
Research organizations in the United States
Computer science organizations |
https://en.wikipedia.org/wiki/CycleNetXChange | CycleNetXChange provides a standard format with which to exchange cycle path data, together with information about the quality of routes; This enables computerised transport systems to provide cycle routes.
This UK National Cycle Path network schema (CycleNetXChange) defines an exchange format for an exchange of cycle path data together with information relevant to cycling about the quality of routes; . It is a component of the UK national transport information infrastructure and is based on a number of other UK and ISO standards.
The format allows cycle path data to be collected by different communities and exchanged to provide cycle Journey planners and other navigation products.
The CycleNetXChange schema is in draft and is intended to become a UK national de facto standard sponsored by the UK Department of Transport. CycleNet is based on the Ordnance Survey DNF (Digital National Framework) for referencing objects and the ITN (Integrated Transport Network) schema and can be used in conjunction with road and map data that conforms to the DNF.
The standard has been developed by Transport Direct to enable the delivery with Cycling England of as the National Cycle Journey Planner element of the Transport Direct Portal.
Working party
The following people contributed to the development of the standard:
Kevin Bossley: Wherefromhere
Colin Henderson: Ordnance Survey
David Kirton: Camden Consultancy Services
Peter Miller: ITO World
Nick Knowles: Kizoom
Simon Nuttall: CycleStreets
Richard Shaw: WS Atkins
Jonathan Shewell Cooper: Atos Origin
Shane Snow, Department for Transport
See also
NaPTAN
GovTalk
TransXChange
References
External links
Transport Direct
Cycle Journey Planner
Cycling in the United Kingdom
National Cycle Network |
https://en.wikipedia.org/wiki/Ahti%20Heinla | Ahti Heinla (born 2 May 1972) is an Estonian computer programmer and businessman. He is one of the developers of Skype.
He was also an organizer of Let's Do It 2008, a civic action with 50,000 volunteers participating in cleaning up the countryside of Estonia in one day.
He was a recipient of the 2008 Estonian Volunteer of the Year national award.
He has been a member of the board at the nature protection NGO Estonian Fund for Nature since 2006.
Heinla speaks Estonian, English and Spanish.
In 2013 and 2014, he participated on NASA Centennial Challenge as team leader for Team Kuukulgur.
Heinla and Janus Friis founded Starship Technologies in 2014, to develop small self-driving delivery robots. He is the CEO and CTO.
References
1972 births
Living people
Estonian computer programmers
Estonian businesspeople
Skype people
Recipients of the Order of the White Star, 5th Class |
https://en.wikipedia.org/wiki/Cairo%20Metro%20Line%202 | Cairo Metro Line 2 is the second line of the Cairo Metro in Cairo, Egypt.
History
Cairo's metro network was greatly expanded in the mid-1990s with the building of Line 2 (red), from Shoubra-El-Kheima to Cairo University, with an extension to Giza.
It is the first line in history to have a tunnel going under the Nile.
The tunnel under the Nile is in internal diameter and was constructed using two Herenknecht bentonite slurry shield TBMs, which are in diameter. Extending with 20 stations, it is sometimes called the "Japanese-Built Line". It is mostly in bored tunnel, with two exceptions: a short section at the northern end approaching Shubra El-Kheima which is elevated, and a section just south of this by cut-and-cover. The main difference between Lines 1 and 2 is that Line 1 uses an overhead line while Line 2 uses the third-rail system. The construction of the line was finished in October 2000 and was later extended to El Mounib. The communication for line 2 was provided by Alcatel in 2005.
Total project cost was 761 million euros.
After the 2011 Egyptian revolution, the station "Mubarak" has been renamed and is now called "Al-Shohadaa" (Arabic for "martyrs").
October 1996 Shobra - Mubarak (now:"Al-Shohadaa"),
Sept 1998: Mubarak (now:"Al-Shohadaa") - Sadat,
April 19, 1999: Sadat - Cairo University, (including crossing of the Nile)
October 8, 2000: Cairo University - Giza Suburban
January 17, 2005: Omm el Misryeen - Monib
Connections
To other Metro lines
Line 2 connects to Line 1 at Shohadaa and Sadat Stations, and with Line 3 at Attaba Station.
To other forms of transit
Because the line often run parallelly with the railway, a few stations are near to the train stations, including:
Shohadaa Station is immediately next to Ramses Station, providing access to Egyptian National Railways long-haul and short-haul domestic passenger service.
Shubra El-Kheima station is next to the train station of the same name.
Giza train station is located next to Um Al Masriyeen station.
Cairo Transport Authority buses and private microbus services are also nearby.
Access to Cairo International Airport is expected via transfer to Line 3 upon completion of Phase 4 in early 2020.
See also
List of Cairo Metro stations
References
Cairo Metro
Railway lines opened in 1996 |
https://en.wikipedia.org/wiki/FortMP | FortMP is a software package for solving large-scale optimization problems. It solves linear programming problems, quadratic programming problems and mixed integer programming problems (both linear and quadratic). Its robustness has been explored and published in the Mathematical Programming journal.
FortMP is available as a standalone executable that accepts input in MPS format and as a library with interfaces in C and Fortran. It is also supported in the AMPL modeling system.
The main algorithms implemented in FortMP are the primal and dual simplex algorithms using sparse matrices. These are supplemented for large problems and quadratic programming problems by interior point methods. Mixed integer programming problems are solved using branch and bound algorithm.
References
External links
FortMP Overview
FortMP home page
OptiRisk Systems home page
Mathematical optimization software |
https://en.wikipedia.org/wiki/SweClockers.com | SweClockers.com is a Swedish online magazine about computers and computer hardware, founded in 1999, with about 270,000 unique visitors per week and 200,000 registered users, as of August 2017. The website has one of Sweden's largests forums which is focused on computer hardware, software, modding and overclocking. Folding@SweClockers.com is the most successful Nordic team in the distributed computing project Folding@Home and has its own forum on the website.
References
External links
Online magazines
Internet forums
Swedish websites
Magazines established in 1999
Computer magazines published in Sweden
Swedish-language magazines
1999 establishments in Sweden |
https://en.wikipedia.org/wiki/Peter%20Ishkhans | Peter Ishkhans is a former Beverly Hills, California-based stylist and salon owner who went on to host Style Network's Peter Perfect. In 2009, Peter Perfect was nominated for a Daytime Emmy as outstanding lifestyle show, while Ishkhans was nominated for outstanding lifestyle host.
References
Living people
British television personalities
British hairdressers
British expatriates in the United States
Year of birth missing (living people) |
https://en.wikipedia.org/wiki/Ben%20%26%20Izzy | Ben & Izzy () is a Jordanian three-dimensional, computer animated children's television series. It was produced by Jordan's rising educational and CGI animation company Rubicon. This series follows the adventures and developing friendship of two pre-teenaged boys known as Ben and Izzy, who are from the United States and Jordan respectively, as well as a desert genie known as Yasmine, who takes the form of a young girl closely resembling the age of the boys.
Despite the fact the series was produced in Jordan, it was primarily released in English for international purposes before its official Arabic dub in 2008. The series was created primarily to entertain, but it was also created as an educative experience about certain aspects of Arab history, and how it affected Western culture, which is also the forming of the bond between the Western Ben and the Eastern/Arab Izzy. This in turn represents a comprehensible and possible union of Western and Eastern/Arab cultures, in spite of the current prejudice views of each culture in the other. There are currently 13 episodes created, although 26 were originally planned.
Story
The three of them soon realize that with their respective talents combined, they become the dream team, preserving history and saving the world!
Episode guide
Season 1
Ben, Izzy and Yasmine get to know each other and explore many countries in the Middle East, looking for precious artifacts that were lost in time. Thanks to her genie powers, Yasmine whisks the boys to different times and lands to beat Clutchford Wells, whose sole interest is to sell the artifacts with no regard to how it would alter world history.
(2010)
Characters
Designed by Yazan Khalifeh:
Ben: an 11-year-old American sports fan
Izzy: an 11-year-old Arab Jordanian boy who loves technology
Yasmine: a young genie with amazing powers
Prof. Jake Martin: Ben's grandfather and feisty archeologist
Prof. Omar Aziz: Izzy's spry grandfather, a scholar and a wiry man
Clutchford Wells: a greedy millionaire seeking nothing but material gain
Roxanne: Wells's mute assistant
Voices
English
Lucy Liu - Yasmine
Arabic
Hisham Hamadeh - Wells
Rania Fahed
References
External links
(Archive)
Rubicon Animation Studios' website
Jordanian animated television series
Jordanian children's television series
2006 Jordanian television series debuts
2000s Jordanian television series
2000s animated television series
Animated television series about children
Children's animated television series
Children's education television series
Computer-animated television series
Television series by MGM Television |
https://en.wikipedia.org/wiki/Distributed%20European%20Infrastructure%20for%20Supercomputing%20Applications | The Distributed European Infrastructure for Supercomputing Applications (DEISA) was a European Union supercomputer project. A consortium of eleven national supercomputing centres from seven European countries promoted pan-European research on European high-performance computing systems. By extending the European collaborative environment in the area of supercomputing, DEISA followed suggestions of the European Strategy Forum on Research Infrastructures.
History
The DEISA project started as DEISA1 in 2002 developing and supporting a pan-European distributed high performance computing infrastructure. The initial project was funded by the European Commission in the sixth of the Framework Programmes for Research and Technological Development (FP6) from 2004 through 2008. The funding continued for the follow-up project DEISA2 in the Seventh Framework Programme (FP7) through 2011.
The DEISA infrastructure coupled eleven national supercomputing centres with a dedicated (mostly 10 Gbit/s) network connection provided by GÉANT2 on the European level and the national research and education networks (NRENs).
Consortium
There were 11 principal partners and four associate partners.
Principal partners were:
Max Planck Gesellschaft, Germany
Bavarian Academy of Sciences and Humanities, Germany
Barcelona Supercomputing Center, Spain
CINECA, Italy
CSC, Scientific Computing Ltd, Finland
European Centre for Medium-Range Weather Forecasts, United Kingdom
Jülich Research Centre, Germany
(CNRS), France
Stichting Academisch Rekencentrum Amsterdam, Netherlands
Edinburgh Parallel Computing Centre, United Kingdom
High Performance Computing Center Stuttgart (HLRS), University of Stuttgart, Germany
Associate partners were:
CEA, Computing Complex, Bruyères-le-Châtel, France
JSCC, Joint Supercomputer Center of the Russian Academy of Sciences, Moscow
Swiss National Supercomputing Centre (CSCS), Manno, Switzerland
The Royal Institute of Technologies - Center for Parallel Computers, (KTH), Stockholm, Sweden
In 2011 services were taken over by the Partnership for Advanced Computing in Europe.
DEISA Benchmark Suite
DEISA produced a benchmark suite to help computer scientists assess the performance of parallel supercomputer systems. The benchmark comprises a number of real applications codes taken from a wide range of scientific disciplines. A structured framework allows compilation, execution and analysis to be configured and carried out via standard input files.
The codes were chosen as representative of the scientific projects performed on the DEISA supercomputers. The codes and associated datasets were selected for benchmarking systems with peak performances ranging up to hundreds of teraflops, machines which are more powerful than a desktop personal computer by factors of tens of thousands.
The suite contained codes relevant to astrophysics, fluid dynamics, climate modelling, biosciences, materials science, fusion power and fundamental particle physic |
https://en.wikipedia.org/wiki/Shutdown%20Day | Shutdown Day was an Internet campaign active between 2007 and 2009 which promoted the idea of a holiday when people would go without a computer for the entire day. The benefits attributed to not using a computer for 24 hours range from electricity savings to getting back in touch with friends and nature.
Establishment
Founders
Denis Bystrov and Nikolay Kudrevatykh were the co-founders of Shutdown Day; Bystrov originally conceived the idea of Shutdown Day, and the co-founders developed the concept in 2007, while living in Canada. Michael Taylor, an original partner in the idea of shutting down one's computer down for a day, said:
Purpose and goals
Shutdown Day is a global Internet experiment whose purpose is to get people to think about how their lives have changed with the increasing use of the home computer, and whether or not any good things are being lost because of this. The concept of the Shutdown Day project is to simply shutdown one's computer for one whole day each year, and become involved in other activities: outdoors, nature, sports, fun stuff with friends and family, just to remind yourself that there is a real world beyond the computer screen.
History
Shutdown Day started in early 2007, when Denis Bystrov realized that he spent too much time with his computer and wanted to spend more time with his family. Bystrov teamed up with his friends Nikolay Kudrevatykh, Michael Taylor (former trade floor occupant in stock markets in London, England) and David Bridle (part-time film maker from Cardiff, Wales), to present a challenge on the Internet, through the website shutdownday.org, challenging people to avoid their computers for 24 hours. The idea was simple:
What began as an innocent question, gathered an Internet chain reaction following, which drew millions of viewers from across the world. Here is a summary of the results from the Shutdown Day 2007 campaign:
The Shutdown Day website received more than 1.6 million visitors in the first month of the campaign.
More than 65,000 people participated in the campaign by actually shutting down their computers for 24 hours on the 24th of March, 2007.
The Shutdown Day promotional clip was broadcast on YouTube and received more than 1.1 million hits.
450,000 visitors signed up for country locater on Shutdown Day website.
The idea of Shutdown Day featured on more than 200,000 online forums discussions, television interviews, and popular media. Services that covered Shutdown Day included Globe and Mail, CNN, Fox News, and TV5.
Later in 2007, as Bystrov was discussing the future of Shutdown Day with another friend, Ashutosh Rajekar, also a victim of excessive technology use, he realized that both had some interesting ideas to share regarding the future direction of Shutdown Day. Eventually, Denis, Nikolay and Ashutosh decided to team up to register as a non-profit organization in the province of Quebec.
In 2008, Shutdown Day was held on May 3. The message to turn off computers and en |
https://en.wikipedia.org/wiki/Stanley%20Zdonik | Stanley Zdonik ( ) is a computer scientist specializing in database management systems. He is a tenured professor of computer science at Brown University. Zdonik has lived in the Boston area his entire life. After completing two bachelor’s and two master's degrees at MIT, he then earned a PhD in database management under Michael Hammer.
In the mid-seventies, Zdonik worked on the Prophet data management system for pharmacologists at Bolt Beranek and Newman Inc. After becoming a professor at Brown University during the early 1980s, Zdonik became a leading researcher in object-oriented databases. He has over one hundred peer-reviewed papers in the database field and was named an ACM Fellow in 2006. He has been involved in the development of several notable database projects with other researchers, including Michael Stonebraker and Sam Madden. These projects include the Aurora and Borealis stream processing engines, the C-Store column store database, and the H-Store parallel, main memory OLTP system. He has also served as a member of the VLDB Board of Trustees and has been the general chair for several major database conferences.
Outside of academia, Zdonik is a co-founder for both the StreamBase and Vertica companies, as well as being a technical advisor for Attivio. Episode 2035 of Car Talk (approximately 35m) refers to his stint as an instructor in novice automobile maintenance.
Education
Zdonik has received a number of non-honorary degrees during his career, all from MIT.
Ph.D., Computer Science, June 1983. Massachusetts Institute of Technology
M.S., Computer Science, 1980. Massachusetts Institute of Technology
M.S., Electrical Engineering, 1980. Massachusetts Institute of Technology
B.S., Computer Science, 1970. Massachusetts Institute of Technology
B.S., Electrical Engineering, 1970. Massachusetts Institute of Technology
References
External links
Personal web page
Brown Database Group home page
Living people
American computer scientists
Fellows of the Association for Computing Machinery
Database researchers
MIT School of Engineering alumni
Brown University faculty
Year of birth missing (living people) |
https://en.wikipedia.org/wiki/List%20of%20Lie%20to%20Me%20episodes | Lie to Me is an American crime drama television series that premiered on the Fox network on January 21, 2009. The series follows Dr. Cal Lightman (Tim Roth) and his colleagues at The Lightman Group, as they solve crimes using applied psychology by interpreting microexpressions (through the Facial Action Coding System) and body language.
On May 11, 2011, Fox canceled Lie to Me after three seasons.
Series overview
{| class="wikitable plainrowheaders" style="text-align:center;"
|-
! colspan="2" rowspan="2" |Season
! rowspan="2" |Episodes
! colspan="2" |Originally aired
|-
! First aired
! Last aired
|-
| bgcolor="143658" |
| 1
| 13
| January 21, 2009
| May 13, 2009
|-
| bgcolor="6A9F9F" |
| 2
| 22
| September 28, 2009
| September 13, 2010
|-
| bgcolor="006600" |
| 3
| 13
| October 4, 2010
| January 31, 2011
|-
|}
Episodes
Season 1 (2009)
Season 2 (2009–10)
Season 3 (2010–11)
References
External links
Lie to Me episodes information at film.com
List of Lie to Me episodes at TVGuide.com
Lists of American crime drama television series episodes |
https://en.wikipedia.org/wiki/RIVR%20Media | RIVR Media is an American-based TV production company, specializing in reality and documentary programming. RIVR is responsible for Fixer to Fabulous, Whale Wars, Trading Spaces, Escaping Polygamy, Fat Guys in the Woods, Renovation Realities, Going RV, Friday Night Impossible with Jerry Rice, Great American Heroes featuring Trace Adkins, Run My Renovation, and much more. It provides programming for cable networks, including A&E, HGTV, DIY Network, GAC, Lifetime Movie Network, MTV, Fine Living, Discovery Channel, Travel Channel, Weather Channel, History Channel, ESPN, Animal Planet, Game Show Network, TLC, Nickelodeon, Food Network, Court TV and TNN.
RIVR's production credits include documentaries, reality series, sitcoms, travel series, sports entertainment, and post-production services.
RIVR Media is owned by partners Dee Haslam and Lori Golden-Stryer, and is located in Knoxville, Tennessee. Both Haslam and Stryer are Executive Producers for the company. Lori Golden-Stryer is CEO. She and HGTV co-founder, Bob Baskerville, are partners and co-owners of RIVR Studios, newly-renovated facilities in Knoxville, available to rent for shoots. After 20 years at RIVR, Rob Lundgren retired in 2019.
Company history
RIVR Media originally derives from Bagwell Communications, run by Ross Bagwell Sr. and Ross Bagwell Jr., a Knoxville Tennessee-based advertising agency. In 1985 Bagwell Communications formed a company named 'Cinetel Productions' and engaged with the cable network The Nashville Network (TNN) to produce 415 episodes of I-40 Paradise.
Over the next ten years, Cinetel developed programs for A&E, the History Channel, the Discovery Channel, The Learning Channel, Travel Channel, Nickelodeon, and The Nashville Network. In 1994 Cinetel was sold to Scripps Howard, a national media company looking to launch HGTV. In 1998, Cinetel was renamed Scripps Productions. After the acquisition, the Bagwells formed a new company, Bagwell Entertainment LLC / Ross Television Productions, and continued producing programs for a variety of cable networks, including HGTV.
In 1999, Dee Haslam and business partner Rob Lundgren assumed control of Bagwell Entertainment renaming the company RIVR Media. In 2000 RIVR established RIVR Media Interactive—now RIVR Digital, which focuses on short form video production and marketing. In 2002 RIVR established RIVR Media Studios, a subsidiary focused on for-hire production and post-production services.
List of shows produced
Trading Spaces on TLC
Whale Wars on Animal Planet
Renovation Realities on DIY
Fat Guys in the Woods on The Weather Channel
Fixer to Fabulous on HGTV
Friday Night Impossible with Jerry Rice on GAC
Escaping Polygamy on Lifetime Movie Network
Great American Heroes featuring Trace Adkins on GAC
Going RV on GAC
Warehouse Warriors on DIY
Run My Renovation on DIY
All Star Kitchen Makeover on the Food Network
America's Castles on A&E
America's Riverboat Casinos on the Travel Channel
An Evening with Lo |
https://en.wikipedia.org/wiki/Network%20of%20Conservation%20Educators%20and%20Practitioners | The Network of Conservation Educators and Practitioners (NCEP) is a project developed by the Center for Biodiversity and Conservation (CBC) of the American Museum of Natural History (AMNH) and its partners around the world. NCEP is a global initiative, currently active in Bolivia, Laos, Madagascar, Mexico, Myanmar, Peru, Rwanda, the United States, the Solomon Islands, and Vietnam.
Goals
The project's stated goals are to:
Develop and disseminate open educational resources on managing and sustaining biological and cultural diversity;
Foster an active approach to teaching and learning that models the realities of professional practice; and
Create global opportunities for communication and interaction among conservation educators and practitioners.
Teaching modules
One of the project’s tangible products is a series of multi-component open educational resources, or modules, for teachers.
Each module includes a Synthesis document that brings together key concepts, applications, and literature for a topic, as well as an easily modified visual Presentation, and a practical Exercise for laboratory or field use. Exercise solutions and teaching notes are also provided for the instructor, as are learning goals and student assessment questions. In addition, interdisciplinary Case Studies integrate key concepts and questions that span the topics of more than one module. The modules are flexible and adaptable resources for professors and trainers in the field of biodiversity conservation and are tailored to the context where they will be used in terms of language and examples. They model the richly interconnected, interdisciplinary, and rapidly evolving nature of the field of conservation biology, and focus on developing the skills needed to decide when, how, and why a tool is the best choice for a particular conservation application. At present, more than 100 complete or partial modules are available for use and testing in several languages (English, Spanish, French, and Lao), and this number is expected to continue to grow. Modules are distributed free of cost to the users, and are available in printed form, on CD-ROM, and in electronic form via the Internet (http://ncep.amnh.org).
Workshops
Individual educators at any location with Internet access may participate by simply downloading and using NCEP materials free of charge. However, in several countries, the CBC and its local partners are following a more intensive implementation strategy, with workshops and training events that bring educators and conservation practitioners together for a variety of purposes. In some cases, workshops are held to review and adapt existing modules to the context of a particular country. In other cases, workshops facilitate the production of new modules, or present new modules for discussion and evaluation by faculty peers. Finally, some workshops are focused on how modules can be used, and in particular, on how the principles of active teaching and learning emb |
https://en.wikipedia.org/wiki/South%20Australian%20Research%20and%20Development%20Institute | The South Australian Research and Development Institute (SARDI) is the principal research institute of the Government of South Australia, with a network of research centres, laboratories and field sites both in metropolitan Adelaide and throughout South Australia. SARDI is part of Primary Industries and Regions SA.
Head Office
The SARDI Head Office is located in the Waite Research Precinct, along with CSIRO, the University of Adelaide's Waite Campus, and others, in the Adelaide suburb of Urrbrae, South Australia.
Metropolitan sites
Plant Research Centre
The Plant Research Centre is located in the Waite Research Precinct, along with CSIRO, the University of Adelaide's Waite Campus, and other research and educational establishments, in the Adelaide suburb of Urrbrae, South Australia.
Plant Research Centre research capabilities:
Climate Applications and Adaptation
Entomology and Plant Pathology
Field Crops and New Variety Agronomy
Molecular Diagnostics and Root Disease Centre
Viticulture
Feed and Forage
Food Safety and Innovation
Plant & Soil Health
Water Resources & Irrigated Crops
North Arm Store, Gillman
Located in the suburb of Gillman, South Australia.
Is the main mooring of the Research Vessel Ngerin which provides Aquatic Sciences Research Support
South Australian Aquatic Sciences Centre (SAASC)
The SAASC is located in the beachside suburb of West Beach, South Australia.
Research capabilities:
Aquaculture
Oceanography
Fisheries
Inland Waters & Catchment Ecology
Marine Ecosystems
Animal Health and Biosecurity
Country sites
Clare Crop Improvement Centre
Located in the town of Clare, South Australia.
Research capabilities:
Field Crops
Lenswood Agricultural Centre
Located in the town of Lenswood, South Australia.
Research capabilities:
Plant & Soil Health
Loxton Research Centre
Located in the town of Loxton, South Australia.
Research capabilities:
..............................................................................
Sustainable Systems
Water Resources & Irrigated Crops
Minnipa Research Centre
The Minnipa Research Centre is located in the town of Minnipa, South Australia.
Research capabilities:
Farming Systems
Mount Gambier Aquatic Sciences
Located in the city of Mount Gambier, South Australia.
Research capabilities:
Wild Fisheries
Nuriootpa Research Centre
Located in the town of Nuriootpa, South Australia.
Research capabilities:
Viticulture
Port Lincoln Marine Science Centre (LMSC)
The LMSC is located on Boston Bay in the city of Port Lincoln, South Australia.
Research capabilities:
Aquaculture
Marine Ecosystesm
Fisheries
Port Lincoln Crop Improvement Centre
Located in the city of Port Lincoln, South Australia.
Research capabilities:
Crop Improvement
Roseworthy Campus
Located in the JS Davies Building on the Roseworthy Campus, co-located with University of Adelaide#Roseworthy, outside the town of Roseworthy, South Australia.
Research capabilities:
Marine Biosecurity
Farming |
https://en.wikipedia.org/wiki/Range%20minimum%20query | In computer science, a range minimum query (RMQ) solves the problem of finding the minimal value in a sub-array of an array of comparable objects. Range minimum queries have several use cases in computer science, such as the lowest common ancestor problem and the longest common prefix problem (LCP).
Definition
Given an array of objects taken from a totally ordered set, such as integers, the range minimum query (with ) returns the position of the minimal element in the specified sub-array .
For example, when , then the answer to the range minimum query for the sub-array is , as .
Algorithms
Naive solution
In a typical setting, the array is static, i.e., elements are not inserted or deleted during a series of queries, and the queries to be answered on-line (i.e., the whole set of queries are not known in advance to the algorithm). In this case a suitable preprocessing of the array into a data structure ensures faster query answering. A naive solution is to precompute all possible queries, i.e. the minimum of all sub-arrays of , and store these in an array such that ; then a range min query can be solved in constant time by array lookup in . There are possible queries for a length- array, and the answers to these can be computed in time by dynamic programming.
Solution using constant time after linearithmic space an time pre-computation
As in the solution above, answering queries in constant time will be achieved by pre-computing results. However, the array will store pre-computed range minimum queries not for every range , but only for ranges whose size is a power of two. There are such queries for each start position , so the size of the dynamic programming table is . The value of is the index of the minimum of the range . Filling the table takes time , with the indices of minima using the following recurrence
If , then ;
else, .
After this pre-computing step, a query can now be answered in constant time by splitting it into two separate queries: one is the pre-computed query with range from to the largest memoized value smaller than . The other is the query of an interval of the same length that has as its right boundary. These intervals may overlap, but since we are trying to compute the minimum rather than, for example, the sum of the numbers in the array, this does not matter. The overall result can thus be obtained, after the linearithmic time pre-computing, in constant time: the two queries can be answered in constant time and the only thing left to do is to choose the smaller of the two results.
Solution using logarithmic query time after linear time and space pre-computation
This solution does pre-computation in time. Its data structures use space and its data structures can be used to answer queries in logarithmic time. The array is first conceptually divided into blocks of size . Then the minimum for each block can be computed in time overall and the minima are stored in a new array.
RMQs can now be answ |
https://en.wikipedia.org/wiki/Evidence-based%20scheduling | Evidence-based scheduling is a software estimation approach created by Joel Spolsky, a commentator on software engineering principles. Evidence-based Scheduling is based on at least two core ideas: including all time spent, and using a Monte Carlo completion date prediction method. Evidence-based scheduling is an example of an evidence-based practice.
Including all time spent
One of the core ideas of evidence-based scheduling, that adds to the normal estimation practices, is the idea of including all time spent, regardless of relevance.
Most people, when estimating, measure the time they actually spend on a project – classic Time Accounting categories such as cited in McConnell's Software Project Survival Guide do not allow for accounting for non-project activities. While McConnell goes on to include less obvious activities such as holidays, sick days and project support, he and most others identify such as activities to be separately recorded.
However, recording and attempting to budget for secondary activities often leads to political pressure to drop such activities. In practice, people find themselves unable to avoid them and compensate by working overtime. Similarly, as Spolsky points out, your bosses' stories about his fishing trips, or model helicopter, are both a time-sink and politically dangerous to put on a time-reporting system.
The key insight in evidence-based scheduling is that the only thing which needs measuring is the actual delivery of tasks. Over time, it is assumed that all other distractions will average out. For the purposes of estimation, variations due to interruption will show up as inaccuracies in estimation and will be compensated for by statistical analysis. The reasons for anomalies may come out if the organisation wishes to dig deeper into why people have irregular estimates.
The appeal of this idea is simplicity – the amount of evidence to be created is simply the elapsed time between completing tasks and, another vital point, time spent debugging is applied back to the original task.
Monte Carlo method
Another core idea is the use of the Monte Carlo method to predict project completion dates. This method evaluates how reliable previous estimates have been. Instead of a single completion date, the method results in multiple possible completion dates, each with an associated probability of being correct.
References
Software engineering costs
Evidence-based practices |
https://en.wikipedia.org/wiki/Randall%20M.%20Fort | Randall M. Fort (born July 4, 1956, Richmond, Indiana) is currently Director of Programs Security, Cyberdomain Team, Raytheon Corporation. He was formerly the Assistant Secretary of State for Intelligence and Research in the United States Department of State from November 2006 through January 2009, as part of the Bush administration.
After high school, Fort attended George Washington University (1974–1978), graduating with a Bachelor of Arts degree. He also attended the University of Cincinnati and Ohio State University, where he studied Japanese.
During his time in college, beginning in 1976, Fort worked for Rep. Bill Gradison (R – Ohio 1), including work on Gradison's campaign for reelection in 1976 and 1978. After his graduation, he continued working for Gradison as a legislative aide, and as district representative in Gradison's district office in Cincinnati.
In 1980, Fort was named a Henry Luce Scholar for 1980–81. As such, he spent 1980–81 working as a research assistant for a member of the Diet of Japan.
Fort returned to the United States in 1982, taking a job as assistant director at the President's Foreign Intelligence Advisory Board (PFIAB). He was subsequently promoted to deputy executive director, before leaving PFIAB in 1987.
In 1987, Fort became special assistant to the Secretary for National Security, as well as director of the Office of Intelligence Support at the United States Department of the Treasury. He held both posts until the end of the Reagan administration.
Fort joined the Bureau of Intelligence and Research of the United States Department of State in 1989, as Deputy Assistant Secretary for Functional Analysis and Research, a post he held for the rest of the presidency of George H. W. Bush.
With the arrival of the Clinton administration, in 1993, Fort departed government for the private sector, taking a position as Director of Special Projects at TRW in two of its Space and Defense operating groups. In 1996, he moved to Goldman Sachs to become its Director of Global Security (he was in charge of firm-wide security), and then as chief of staff to the President and co-Chief Operating Officer of the firm.
In 2006, Fort rejoined the government, becoming Assistant Secretary of State for Intelligence and Research. His term ended with the ending of the presidency of George W. Bush in 2009.
References
Raytheon Profile
State Department Biography
1956 births
George Washington University alumni
Goldman Sachs people
Living people
United States Assistant Secretaries of State
University of Cincinnati alumni
Ohio State University alumni
United States Department of the Treasury officials
Assistant Secretaries of State for Intelligence and Research
People from Richmond, Indiana
American chief operating officers |
https://en.wikipedia.org/wiki/Zircon%20%28disambiguation%29 | Zircon is a mineral and gemstone.
Zircon may also refer to:
Science and technology
Zircon (microkernel), the microkernel of the operating system Google Fuchsia
Cubic zirconia, a synthetic diamond substitute, sometimes mistakenly referred to as "zircon"
Military
Zircon (satellite), a British signals intelligence satellite
Zircon affair, an incident surrounding the British signals intelligence satellite
USS Zircon, a US Navy vessel
3M22 Zircon, Russian hypersonic anti-ship cruise missile
Other uses
Zircon (composer), American electronic musician Andrew Aversa
Zircon, a character of the Sailor Moon manga series
Zircon, multiple fictional characters from the animated children's television show Steven Universe
Zircon, a character in Land of the Lustrous. |
https://en.wikipedia.org/wiki/Transportation%20in%20Montreal | Transportation in Montreal is a developed transport infrastructure network in the city of Montreal in Canada, which includes well-developed air, road, rail, and maritime links to the rest of Canada, as well as the United States and the rest of the world. Local public transport includes a metro system, buses, ferry services and cycling infrastructure.
Montreal is one of the transportation hubs for eastern Canada and most of Quebec. The city has two international airports, Dorval Airport for passenger flights and Mirabel for cargo. Rail transportation includes intercity trains operated from Montreal Central Station to Quebec City, Ottawa, Toronto and New York City as well as commuter trains. Public transit in Greater Montreal is operated by several public transit providers. Montreal is subject traffic congestion, particularly the Island of Montreal which is a hub for the Autoroutes of Quebec. Montreal is known for being one of the most bicycle-friendly cities in the world, with an extensive bikeway network and cycling mobility.
Air
Montreal has two international airports, one for passenger flights only, and the other for cargo. Montréal-Pierre Elliott Trudeau International Airport (also known as Dorval Airport) in the City of Dorval serves all commercial passenger traffic and is the headquarters for Air Canada and Air Transat. To the north of the city is Montréal-Mirabel International Airport in Mirabel, which was envisioned as Montreal's primary airport but which now serves cargo flights along with MEDEVACs and general aviation, as well as some passenger services. In 2016, Montreal-Trudeau was the third busiest airport in Canada by both passenger traffic and by aircraft movements, behind Toronto Pearson and Vancouver. In 2016, the airport handled 15.6 million passengers and 225,203 aircraft movements. With 61% of its passengers being on non-domestic flights, it has the largest percentage of international flights of any Canadian airport. Trudeau Airport is served by 40 carriers to over 100 destinations worldwide. Airlines servicing Trudeau offer flights to Africa, Asia, Central America, the Caribbean, Europe, the United States, Mexico and other destinations within Canada. Trudeau Airport is home to the largest duty-free shop in North America.
Other airports in the Montreal area serve military and civilian use. Plattsburgh International Airport in the United States—closer to Montreal's southern suburbs than Trudeau—also serves the area.
Public transportation to Montréal-Pierre Elliott Trudeau International Airport is provided by the Société de transport de Montréal's bus line 747. A new electric light rail system, the Réseau express métropolitain (REM), is currently in planning and will connect the airport with Montreal's downtown core upon completion, intended for 2027.
Rail Transportation
Intercity passenger service
VIA Rail, which is headquartered in Montreal, provides rail service to other cities in Canada, particularly to Quebec City, |
https://en.wikipedia.org/wiki/Information%20scientist | The term information scientist developed in the latter part of the twentieth century to describe an individual, usually with a relevant subject degree (such as one in Information and Computer Science - CIS) or high level of subject knowledge, providing focused information to scientific and technical research staff in industry. It is a role quite distinct from and complementary to that of a librarian. Developments in end-user searching, together with some convergence between the roles of librarian and information scientist, have led to a diminution in its use in this context, and the term information officer or information professional (information specialist) are also now used.
The term was, and is, also used for an individual carrying out research in information science.
Brian C. Vickery mentions that the Institute of Information Scientists (IIS) was established in London during 1958 and lists the criteria put forward by this institute "Criteria for Information Science" (appendix 1) as well as his own "Areas of study in information science" (appendix 2). The IIS merged with the Library Association in 2002 to form the Chartered Institute of Library and Information Professionals (CILIP).
Examples
Marcia Bates
David Blair (information technologist)
Samuel C. Bradford
Michael Buckland
John M. Carroll
Blaise Cronin
Emilia Currás
Eugene Garfield
Paul B. Kantor
Frederick Wilfrid Lancaster
Calvin Mooers
Robert Saxton Taylor
Brian Campbell Vickery
Thomas D. Wilson
See also
Computer scientist
Documentalist
Information history
Information science
Library and information scientist
Library scholar
References
Vickery, B. & Vickery, A. (1987) Information Science in theory and practice (London: Bowker-Saur, pp. 361–369)
Ellis, David and Merete Haugan. (1997) "Modelling the information seeking patterns of engineers and research scientists in an industrial environment" (Journal of Documentation, Volume 53(4): pp. 384–403)
Vickery, Brian Campbell (1988) "Essays presented to B. C. Vickery" (Journal of Documentation, Volume 44, pp. 199–283)
External links
"Pioneers" of Information Science scrapbook: https://web.archive.org/web/20140201230801/http://faculty.libsci.sc.edu/bob/ISP/scrapbook.htm
scientists information
.
Information science
da:Informationsforsker |
https://en.wikipedia.org/wiki/SQL%3A2006 | SQL:2006 or ISO/IEC 9075:2006 standard is a revision part 14 (ISO/IEC 9075-14:2006) of the ISO standard for the SQL database query language. It is not a revision of the complete SQL standard.
New features
There are extensions to part 14 (ISO/IEC 9075-14:2006). This part defines ways in which SQL can be used in conjunction with XML. It defines ways of importing and storing XML data in an SQL database, manipulating it within the database and publishing both XML and conventional SQL-data in XML form. In addition, it enables applications to integrate into their SQL code the use of XQuery, the XML Query Language published by the World Wide Web Consortium (W3C), to concurrently access ordinary SQL-data and XML documents.
The next revision is SQL:2008
See also
SQL
ISO standards |
https://en.wikipedia.org/wiki/UMC%20%28computer%29 | UMC (Uniwersalna Maszyna Cyfrowa - Polish for Universal Digital Machine) is a family of computers produced by Elwro from 1962.
It consisted of vacuum-tube based UMC-1 and transistor-based UMC-10 (1964). UMC computers operated using negabinary (-2 base) numeral system invented by prof. Zdzisław Pawlak.
References
Early computers |
https://en.wikipedia.org/wiki/String%20of%20Pearls%20%28Indian%20Ocean%29 | The String of Pearls is a geopolitical hypothesis proposed by United States political researchers in 2004. The term refers to the network of Chinese military and commercial facilities and relationships along its sea lines of communication, which extend from the Chinese mainland to Port Sudan in the Horn of Africa. The sea lines run through several major maritime choke points such as the Strait of Mandeb, the Strait of Malacca, the Strait of Hormuz, and the Lombok Strait as well as other strategic maritime centres in Pakistan, Sri Lanka, Bangladesh, the Maldives, and Somalia.
Many commentators in India believe this plan, together with the China–Pakistan Economic Corridor and other parts of China's Belt and Road Initiative under Chinese Communist Party general secretary Xi Jinping, is a threat to India's national security. Such a system would encircle India and threaten its power projection, trade, and potentially territorial integrity. Furthermore, China's support for India's traditional enemy of Pakistan and its Gwadar Port is viewed as a threat, compounded by fears that China may develop an overseas naval military base in Gwadar, which could allow China to conduct expeditionary warfare in the Indian Ocean Region. From the east, the deep-water port of Kyaukpyu is also viewed with a similar concern. The first comprehensive academic analyses of Chinese plan and its security implications for New Delhi was undertaken in February 2008 by an active-duty Indian naval officer. Antedating China's anti-piracy naval deployment in the Indian Ocean beginning in December 2008, and the ensuing acquisition of its first overseas military base in Djibouti in August 2017, his analysis predicting China's "permanent military presence" in the Indian Ocean is viewed by Indian policymakers as prescient. Accordingly, India has since been making moves of various types to counter the threat.
The term as a geopolitical concept was first used in an internal US Department of Defense report, "Energy Futures in Asia" in 2005. The term is also widely used in India's geopolitical and foreign policy narratives to highlight India's concerns over massive Chinese Belt and Road Initiative projects across southern Asia. According to the EUISS, the formation of Quadrilateral Security Dialogue (consisting of United States, India, Australia and Japan) is a direct result of China's assertive foreign and security policy in the Indo-Pacific region.
The emergence of the String of Pearls is indicative of China's growing geopolitical influence through concerted efforts to increase access to ports and airfields, expand and modernise military forces, and foster stronger diplomatic relationships with trading partners. The Chinese government insists that China's burgeoning naval strategy is entirely peaceful and is only for the protection of regional trade interests. Chinese Communist Party general secretaries Hu Jintao and Xi Jinping have both asserted that China will never seek hegemony i |
https://en.wikipedia.org/wiki/Grammar%20systems%20theory | Grammar systems theory is a field of theoretical computer science that studies systems of finite collections of formal grammars generating a formal language. Each grammar works on a string, a so-called sequential form that represents an environment. Grammar systems can thus be used as a formalization of decentralized or distributed systems of agents in artificial intelligence.
Let be a simple reactive agent moving on the table and trying not to fall down from the table with two reactions, t for turning and ƒ for moving forward. The set of possible behaviors of can then be described as formal language
where ƒ can be done maximally k times and t can be done maximally ℓ times considering the dimensions of the table.
Let be a which generates language . The behavior of is then described by this grammar. Suppose the has a subsumption architecture; each component of this architecture can be then represented as a formal grammar, too, and the final behavior of the agent is then described by this system of grammars.
The schema on the right describes such a system of grammars which shares a common string representing an environment. The shared sequential form is sequentially rewritten by each grammar, which can represent either a component or generally an agent.
If grammars communicate together and work on a shared sequential form, it is called a Cooperating Distributed (DC) grammar system. Shared sequential form is a similar concept to the blackboard approach in AI, which is inspired by an idea of experts solving some problem together while they share their proposals and ideas on a shared blackboard.
Each grammar in a grammar system can also work on its own string and communicate with other grammars in a system by sending their sequential forms on request. Such a grammar system is then called a Parallel Communicating (PC) grammar system.
PC and DC are inspired by distributed AI. If there is no communication between grammars, the system is close to the decentralized approaches in AI. These kinds of grammar systems are sometimes called colonies or Eco-Grammar systems, depending (besides others) on whether the environment is changing on its own (Eco-Grammar system) or not (colonies).
See also
Artificial life
Agent-based model
Distributed artificial intelligence
Multi-agent system
References
Formal languages
Theoretical computer science
Combinatorics on words
Artificial intelligence
Formal sciences |
https://en.wikipedia.org/wiki/Kiberpipa | Cyberpipe () was a hackerspace in Ljubljana, Slovenia, established in 2001 as a part of the K6/4 Institute. After a breakup with the parent organization and moving to a different location in 2013 it ceased most operations in 2015.
The hackerspace operated as a cultural centre, computer laboratory and Internet café (with free wireless access) at Kersnikova 4, Ljubljana. Kiberpipa engaged primarily in open source programming, electronic art and the recycling of computer devices. Between 2005 and 2013 it also hosted a small living computer museum.
The mostly volunteer team in the hackerspace organised workshops, lectures, and entertainment and information events, with around 150 events yearly at the height of its activity.
In 2013, the Student Organization of University of Ljubljana, the owner of the building where Kiberpipa originally operated, decided to re-purpose the building as a restaurant and a parking garage. After failing to negotiate a new position within the organization, Kiberpipa team opted to continue operating independently of the Student Organization and moved to a new location. In the same year, the Student Organization opened its own hackerspace Rampa.
In 2014, Kiberpipa re-opened at a new location at Gosposvetska 2 using volunteer work and donations. It continued to organize lectures and open source software-related events at the new location until closure in 2015. In 2015 a web server malfunction also resulted in the loss of the Kiberpipa website and archived content.
As of December 2022, there is a re-newed effort to revive Cyberpipe with monthly gatherings.
Partnerships and events
Kiberpipa co-operated with other organizations in Slovenia, e.g. the Slo-Tech and 3delavnica teams, regional multimedia centres (including Ljudmila - Ljubljana Digital Media Lab, KIBLA Multimedia Centre) and organizations abroad (Mama New Media Centre in Zagreb, HackLab in Pula for example).
Kiberpipa organised the bi-annual HAIP Festival (Hack/Act/Interact/Progress Festival).
Kiberpipa was a member of the m3c Multimedia Centres Network of Slovenia.
References
External links
Kiberpipa entry at hackerspaces.org
Hackerspaces
Cultural centers
New media art
Cultural venues in Ljubljana
Organizations based in Slovenia
Organizations established in 2001
Cultural organizations based in Ljubljana
2001 establishments in Slovenia |
https://en.wikipedia.org/wiki/Kernel%20%28operating%20system%29 | The kernel is a computer program at the core of a computer's operating system and generally has complete control over everything in the system. Kernel is also responsible for preventing and mitigating conflicts between different processes It is the portion of the operating system code that is always resident in memory and facilitates interactions between hardware and software components. A full kernel controls all hardware resources (e.g. I/O, memory, cryptography) via device drivers, arbitrates conflicts between processes concerning such resources, and optimizes the utilization of common resources e.g. CPU & cache usage, file systems, and network sockets. On most systems, the kernel is one of the first programs loaded on startup (after the bootloader). It handles the rest of startup as well as memory, peripherals, and input/output (I/O) requests from software, translating them into data-processing instructions for the central processing unit.
The critical code of the kernel is usually loaded into a separate area of memory, which is protected from access by application software or other less critical parts of the operating system. The kernel performs its tasks, such as running processes, managing hardware devices such as the hard disk, and handling interrupts, in this protected kernel space. In contrast, application programs such as browsers, word processors, or audio or video players use a separate area of memory, user space. This separation prevents user data and kernel data from interfering with each other and causing instability and slowness, as well as preventing malfunctioning applications from affecting other applications or crashing the entire operating system. Even in systems where the kernel is included in application address spaces, memory protection is used to prevent unauthorized applications from modifying the kernel.
The kernel's interface is a low-level abstraction layer. When a process requests a service from the kernel, it must invoke a system call, usually through a wrapper function.
There are different kernel architecture designs. Monolithic kernels run entirely in a single address space with the CPU executing in supervisor mode, mainly for speed. Microkernels run most but not all of their services in user space, like user processes do, mainly for resilience and modularity. MINIX 3 is a notable example of microkernel design. Instead, the Linux kernel is monolithic, although it is also modular, for it can insert and remove loadable kernel modules at runtime.
This central component of a computer system is responsible for executing programs. The kernel takes responsibility for deciding at any time which of the many running programs should be allocated to the processor or processors.
Random-access memory
Random-access memory (RAM) is used to store both program instructions and data. Typically, both need to be present in memory in order for a program to execute. Often multiple programs will want access to memory, frequently d |
https://en.wikipedia.org/wiki/Unix-like | A Unix-like (sometimes referred to as UN*X or *nix) operating system is one that behaves in a manner similar to a Unix system, although not necessarily conforming to or being certified to any version of the Single UNIX Specification. A Unix-like application is one that behaves like the corresponding Unix command or shell. Although there are general philosophies for Unix design, there is no technical standard defining the term, and opinions can differ about the degree to which a particular operating system or application is Unix-like.
Some well-known examples of Unix-like operating systems include Linux and BSD. These systems are often used on servers, as well as on personal computers and other devices. Many popular applications, such as the Apache web server and the Bash shell, are also designed to be used on Unix-like systems.
One of the key features of Unix-like systems is their ability to support multiple users and processes simultaneously. This allows users to run multiple programs at the same time, and to share resources such as memory and disk space. This is in contrast to many older operating systems, which were designed to only support a single user or process at a time. Another important feature of Unix-like systems is their modularity. This means that the operating system is made up of many small, interchangeable components that can be added or removed as needed. This makes it easy to customize the operating system to suit the needs of different users or environments.
Definition
The Open Group owns the UNIX trademark and administers the Single UNIX Specification, with the "UNIX" name being used as a certification mark. They do not approve of the construction "Unix-like", and consider it a misuse of their trademark. Their guidelines require "UNIX" to be presented in uppercase or otherwise distinguished from the surrounding text, strongly encourage using it as a branding adjective for a generic word such as "system", and discourage its use in hyphenated phrases.
Other parties frequently treat "Unix" as a genericized trademark. Some add a wildcard character to the name to make an abbreviation like "Un*x" or "*nix", since Unix-like systems often have Unix-like names such as AIX, A/UX, HP-UX, IRIX, Linux, Minix, Ultrix, Xenix, and XNU. These patterns do not literally match many system names, but are still generally recognized to refer to any UNIX system, descendant, or work-alike, even those with completely dissimilar names such as Darwin/macOS, illumos/Solaris or FreeBSD.
In 2007, Wayne R. Gray sued to dispute the status of UNIX as a trademark, but lost his case, and lost again on appeal, with the court upholding the trademark and its ownership.
History
"Unix-like" systems started to appear in the late 1970s and early 1980s. Many proprietary versions, such as Idris (1978), UNOS (1982), Coherent (1983), and UniFlex (1985), aimed to provide businesses with the functionality available to academic users of UNIX.
When AT&T allowed |
https://en.wikipedia.org/wiki/Linux%20kernel | The Linux kernel is a free and open-source, monolithic, modular, multitasking, Unix-like operating system kernel. It was originally written in 1991 by Linus Torvalds for his i386-based PC, and it was soon adopted as the kernel for the GNU operating system, which was written to be a free (libre) replacement for Unix.
Linux is provided under the GNU General Public License version 2 only, but it contains files under other compatible licenses. Since the late 1990s, it has been included as part of a large number of operating system distributions, many of which are commonly also called Linux.
Linux is deployed on a wide variety of computing systems, such as embedded devices, mobile devices (including its use in the Android operating system), personal computers, servers, mainframes, and supercomputers. It can be tailored for specific architectures and for several usage scenarios using a family of simple commands (that is, without the need of manually editing its source code before compilation); privileged users can also fine-tune kernel parameters at runtime. Most of the Linux kernel code is written using the GNU extensions of GCC to the standard C programming language and with the use of architecture-specific instructions (ISA) in limited parts of the kernel. This produces a highly optimized executable (vmlinux) with respect to utilization of memory space and task execution times.
Day-to-day development discussions take place on the Linux kernel mailing list (LKML). Changes are tracked using the version control system git, which was originally authored by Torvalds as a free software replacement for BitKeeper.
History
In April 1991, Linus Torvalds, at the time a 21-year-old computer science student at the University of Helsinki, Finland, started working on some simple ideas for an operating system inspired by UNIX, for a personal computer. He started with a task switcher in Intel 80386 assembly language and a terminal driver. On 25 August 1991, Torvalds posted the following to comp.os.minix, a newsgroup on Usenet:
On 17 September 1991, Torvalds prepared version 0.01 of Linux and put on the "ftp.funet.fi" – FTP server of the Finnish University and Research Network (FUNET). It was not even executable since its code still needed Minix to compile and to test it.
On 5 October 1991, Torvalds announced the first "official" version of Linux, version 0.02. At this point, Linux was able to run Bash, GCC, and some other GNU utilities:
After that, despite the limited functionality of the early versions, Linux rapidly gained developers and users. Many people contributed code to the project, including some developers from the MINIX community. At the time, the GNU Project had created many of the components required for its free UNIX replacement, the GNU operating system, but its own kernel, GNU Hurd, was incomplete. For this reason, it soon adopted the Linux kernel as well. The Berkeley Software Distribution had not yet freed itself from legal encumbrances an |
https://en.wikipedia.org/wiki/Unix | Unix (, ; trademarked as UNIX) is a family of multitasking, multi-user computer operating systems that derive from the original AT&T Unix, whose development started in 1969 at the Bell Labs research center by Ken Thompson, Dennis Ritchie, and others.
Initially intended for use inside the Bell System, AT&T licensed Unix to outside parties in the late 1970s, leading to a variety of both academic and commercial Unix variants from vendors including University of California, Berkeley (BSD), Microsoft (Xenix), Sun Microsystems (SunOS/Solaris), HP/HPE (HP-UX), and IBM (AIX). In the early 1990s, AT&T sold its rights in Unix to Novell, which then sold the UNIX trademark to The Open Group, an industry consortium founded in 1996. The Open Group allows the use of the mark for certified operating systems that comply with the Single UNIX Specification (SUS).
Unix systems are characterized by a modular design that is sometimes called the "Unix philosophy". According to this philosophy, the operating system should provide a set of simple tools, each of which performs a limited, well-defined function. A unified and inode-based filesystem and an inter-process communication mechanism known as "pipes" serve as the main means of communication, and a shell scripting and command language (the Unix shell) is used to combine the tools to perform complex workflows.
Unix distinguishes itself from its predecessors as the first portable operating system: almost the entire operating system is written in the C programming language, which allows Unix to operate on numerous platforms.
Overview
Unix was originally meant to be a convenient platform for programmers developing software to be run on it and on other systems, rather than for non-programmers. The system grew larger as the operating system started spreading in academic circles, and as users added their own tools to the system and shared them with colleagues.
At first, Unix was not designed to be portable or for multi-tasking. Later, Unix gradually gained portability, multi-tasking and multi-user capabilities in a time-sharing configuration. Unix systems are characterized by various concepts: the use of plain text for storing data; a hierarchical file system; treating devices and certain types of inter-process communication (IPC) as files; and the use of a large number of software tools, small programs that can be strung together through a command-line interpreter using pipes, as opposed to using a single monolithic program that includes all of the same functionality. These concepts are collectively known as the "Unix philosophy". Brian Kernighan and Rob Pike summarize this in The Unix Programming Environment as "the idea that the power of a system comes more from the relationships among programs than from the programs themselves".
By the early 1980s, users began seeing Unix as a potential universal operating system, suitable for computers of all sizes. The Unix environment and the client–server program model were |
https://en.wikipedia.org/wiki/Mac%20operating%20systems | Two major families of Mac operating systems were developed by Apple Inc.
In 1984, Apple debuted the operating system that is now known as the "Classic" Mac OS with its release of the original Macintosh System Software. The system, rebranded "Mac OS" in 1997, was pre-installed on every Macintosh until 2002 and offered on Macintosh clones for a short time in the 1990s. Noted for its ease of use, it was also criticized for its lack of modern technologies compared to its competitors.
The current Mac operating system is macOS, originally named "Mac OS X" until 2012 and then "OS X" until 2016. Developed between 1997 and 2001 after Apple's purchase of NeXT, Mac OS X brought an entirely new architecture based on NeXTSTEP, a Unix system, that eliminated many of the technical challenges that the classic Mac OS faced. The current macOS is pre-installed with every Mac and receives a major update annually. It is the basis of Apple's current system software for its other devices – iOS, iPadOS, watchOS, and tvOS.
Prior to the introduction of Mac OS X, Apple experimented with several other concepts, releasing different products designed to bring the Macintosh interface or applications to Unix-like systems or vice versa, A/UX, MAE, and MkLinux. Apple's effort to expand upon and develop a replacement for its classic Mac OS in the 1990s led to a few cancelled projects, code named Star Trek, Taligent, and Copland.
Although they have different architectures, Mac operating systems share a common set of GUI principles, including a menu bar across the top of the screen; the Finder shell, featuring a desktop metaphor that represents files and applications using icons and relates concepts like directories and file deletion to real-world objects like folders and a trash can; and overlapping windows for multitasking.
Classic Mac OS
The "classic" Mac OS is the original Macintosh operating system that was introduced in 1984 alongside the first Macintosh and remained in primary use on Macs until the introduction of Mac OS X in 2001.
Apple released the original Macintosh on January 24, 1984; its early system software was partially based on the Lisa OS and the Xerox PARC Alto computer, which former Apple CEO Steve Jobs previewed. It was originally named "System Software", or simply "System"; Apple rebranded it as "Mac OS" in 1996 due in part to its Macintosh clone program that ended a year later.
Classic Mac OS is characterized by its monolithic design. Initial versions of the System Software run one application at a time. System 5 introduced cooperative multitasking. System 7 supports 32-bit memory addressing and virtual memory, allowing larger programs. Later updates to the System 7 enable the transition to the PowerPC architecture. The system was considered user-friendly, but its architectural limitations were critiqued, such as limited memory management, lack of protected memory and access controls, and susceptibility to conflicts among extensions.
Releases
Nine |
https://en.wikipedia.org/wiki/Generating%20Availability%20Data%20System | The Generating Availability Data System (GADS) is a database produced by the North American Electric Reliability Corporation (NERC). It includes annual summary reports comprising the statistics for power stations in the United States and Canada.
GADS is the main source of power station outage data in North America. This reporting system, initiated by the electric utility industry in 1982, expands and extends the data collection procedures begun by the industry in 1963. NERC GADS is recognized today as a valuable source of reliability, availability, and maintainability (RAM) information.
This information, collected for both total unit and major equipment groups, is used by analysts industry-wide in numerous applications. GADS maintains complete operating histories on more than 5,800 generating units representing 71% of the installed generating capacity of the United States and Canada. GADS is a mandatory industry program for conventional generating units 50 MW and larger starting January 1, 2012 and 20 MW and larger starting January 1, 2013. GADS remains open to all non-required participants in the Regional Entities (shown in Figure I-2 of the NERC GADS DRI) and any other organization (domestic or international) that operate electric generating facilities who is willing to follow the GADS mandatory requirements as presented in the document Final GADSTF Recommendations Report dated July 20, 2011.
GADS data consists of three data types:
Design – equipment descriptions such as manufacturers, number of boiler feedwater pumps, steam turbine MW rating, etc.
Performance – summaries of generation produced, fuels units, start ups, etc.
Event – description of equipment failures such as when the event started/ended, type of outage (forced, maintenance, planned), etc.
One example of such detail is that in its data pertaining to forced outages and unplanned unit failures, it makes the fine distinction between immediate, delayed, and postponed outages.
An important statistic calculated from the raw GADS data is the Equivalent Forced Outage Rate (EFOR), which is the hours of unit failure (unplanned outage hours and equivalent unplanned derated hours) given as a percentage of the total hours of the availability of that unit (unplanned outage, unplanned derated, and service hours).
Recently, in response to the deregulated energy markets, the Equivalent Forced Outage Rate – Demand (EFORd) has taken on greater importance:
The probability that a unit will not meet its demand periods for generating requirements.
Best measure of reliability for all loading types (base, cycling, peaking, etc.)
Best measure of reliability for all unit types (fossil, nuclear, gas turbines, diesels, etc.)
For demand period measures and not for the full 24-hour clock.
Industry Development of GADS
Before any data element was included in GADS, an industry committee to determine its applicability to utility operation and RAM analyses scrutinized it. A series of industry meeti |
https://en.wikipedia.org/wiki/Nighthawks%20%28TV%20series%29 | Nighthawks was an Irish television series broadcast on Network 2 (now known as RTÉ Two). Shay Healy presented. It was part of the major re-brand of RTÉ Two as Network 2 in 1988.
The programme, which began broadcasting in the late 1980s, was a three times-weekly, late-night series. Nighthawks was produced for its first two seasons by David Blake-Knox. In its third season the series producer was Anne Enright, later to become a Booker Prize-winning novelist. In its final season, it was produced by Briain Mac Lochlainn. The Irish Film and Television Awards-nominated director Charlie McCarthy and producers David McKenna and Philip Kampf also worked on the programme. The show's signature tune was composed by Ronan Johnston. It also featured several contributory sketches from Nuala Kelly, Joe Taylor, and Orla McGovern.
An early star of the series was Irish comedian Kevin McAleer, who specialised in rambling but amusing monologues to camera. The Irish actor/comedian-turned British television presenter Graham Norton also appeared on Nighthawks early in his career.
Nighthawks was produced by RTÉ Raidió Teilifís Éireann. It was broadcast three nights per week. The regular soap opera was originally written by David Blake-Knox, and started off as a two-hander between "Hay Healy",and Tanya (the comic creation of Joanne McAteer) They were later joined by burly Russian character Boris, played by Stanley Townsend. Many stand-ups, comedy actors and comedy writers wrote for the show but, from the second season, the late Gerry McNamara was the chief writer and script editor. Morgan Jones, Joe Taylor and Ann Marie Hourihane were some of the regular "company" actors. Hourihane also wrote a number of sketches and presented a weekly film review. Nighthawks was devised by David Blake Knox. John Comiskey created the shooting "grammar" of the series, and Shay Healy introduced the "4" Minute" Interview.
In 1992, Brian Mac Lochlainn won a Jacob's Award for his production of Nighthawks.
In December 2012 a one-off special called Nighthawks Rehashed was aired on RTÉ. The documentary took a look at the unique show that mixed comedy and current affairs with a compilation of vintage interviews from the series.
References
External links
Nighthawks Rehashed
1988 Irish television series debuts
1992 Irish television series endings
1980s Irish television series
1990s Irish television series
Irish comedy television shows
RTÉ original programming |
https://en.wikipedia.org/wiki/BSD%20checksum | The BSD checksum algorithm was a commonly used, legacy checksum algorithm. It has been implemented in old BSD and is also available through the sum command line utility.
This algorithm is useless from a security perspective, and is weaker than the CRC-32 cksum for error detection.
Computation of the BSD checksum
Below is the relevant part of the GNU sum source code (GPL licensed). It computes a 16-bit checksum by adding up all bytes (8-bit words) of the input data stream. In order to avoid many of the weaknesses of simply adding the data, the checksum accumulator is circular rotated to the right by one bit at each step before the new char is added.
int bsdChecksumFromFile(FILE *fp) /* The file handle for input data */
{
int checksum = 0; /* The checksum mod 2^16. */
for (int ch = getc(fp); ch != EOF; ch = getc(fp)) {
checksum = (checksum >> 1) + ((checksum & 1) << 15);
checksum += ch;
checksum &= 0xffff; /* Keep it within bounds. */
}
return checksum;
}
Description of the algorithm
As mentioned above, this algorithm computes a checksum by segmenting the data and adding it to an accumulator that is circular right shifted between each summation. To keep the accumulator within return value bounds, bit-masking with 1's is done.
Example: Calculating a 4-bit checksum using 4-bit sized segments (big-endian)
Input: 101110001110 -> three segments: 1011, 1000, 1110.
Iteration 1:
segment: 1011 checksum: 0000 bitmask: 1111
a) Apply circular shift to the checksum:
0000 -> 0000
b) Add checksum and segment together, apply bitmask onto the obtained result:
0000 + 1011 = 1011 -> 1011 & 1111 = 1011
Iteration 2:
segment: 1000 checksum: 1011 bitmask: 1111
a) Apply circular shift to the checksum:
1011 -> 1101
b) Add checksum and segment together, apply bitmask onto the obtained result:
1101 + 1000 = 10101 -> 10101 & 1111 = 0101
Iteration 3:
segment: 1110 checksum: 0101 bitmask: 1111
a) Apply circular shift to the checksum:
0101 -> 1010
b) Add checksum and segment together, apply bitmask onto the obtained result:
1010 + 1110 = 11000 -> 11000 & 1111 = 1000
Final checksum: 1000
References
Sources
official FreeBSD sum source code
official GNU sum manual page
GNU sum source code
Checksum algorithms |
https://en.wikipedia.org/wiki/SYSV%20checksum | The SYSV checksum algorithm was a commonly used, legacy checksum algorithm.
It has been implemented in UNIX System V and is also available through the sum command line utility.
This algorithm is useless on a security perspective, and is weaker than the CRC-32 cksum for error detection.
Description of the algorithm
The main part of this algorithm is simply adding up all bytes in a 32-bit sum. As a result, this algorithm has the characteristics of a simple sum:
re-arranging the same bytes in another order (e.g. moving text from one place to another place) does not change the checksum.
increasing one byte and decreasing another byte by the same amount does not change the checksum.
adding or removing zero bytes does not change the checksum.
As a result, many common changes to text data are not detected by this method.
The FreeBSD pseudocode for this algorithm is:
s = sum of all bytes;
r = s % 2^16 + (s % 2^32) / 2^16;
cksum = (r % 2^16) + r / 2^16;
The last part folds the value into 16 bits.
References
Sources
official GNU sum manual page
GNU sum source code
Checksum algorithms |
https://en.wikipedia.org/wiki/Secret%20Intelligence%20Branch | The Secret Intelligence Branch of the United States' Office of Strategic Services was a wartime foreign intelligence service responsible for the collection of human intelligence from a network of field stations in Asia, Europe, and the Middle East.
The branch was established in 1942. Its first head was David K. E. Bruce. He was succeeded in 1943 by the business executive and international relations expert, Whitney Shepardson.
With the post-war abolition of the OSS, in October 1945, the Secret Intelligence branch became part of the Strategic Services Unit of the Department of War. The unit was ultimately incorporated into the Central Intelligence Agency, created in 1947.
References
Office of Strategic Services
Human intelligence (information gathering)
1942 establishments in the United States
Organizations established in 1942 |
https://en.wikipedia.org/wiki/James%20Drake%20%28engineer%29 | Sir James Drake (27 July 1907 – 1 February 1989) was a chartered civil engineer who is regarded as the pioneer of the national motorway network in the United Kingdom. As the county surveyor and bridgemaster of Lancashire County Council from 1945 to 1972 he led teams that designed the first stretch of motorway opened to the public, the Preston By-pass (now the M6 from Junctions 29 to 32) on 5 December 1958. There then followed numerous contracts to extend the motorway in the north west of England, which, thanks to his role, probably still has the greatest density of motorways in the country. He was appointed a CBE in 1962 for his services as County Surveyor and Bridgemaster of Lancashire County Council and in 1973 he was knighted in recognition of his role as head of the North West Road Construction Unit and the Lancashire Sub-Unit, organisations that further extended his initial work.
Early life
Drake was born in Burnley, Lancashire, and was educated at Accrington Grammar School and the Victoria University of Manchester where he graduated in 1927 with a BSc in Civil Engineering, with first-class honours. He passed the professional exams of the Institution of Civil Engineers in April 1931, and was accepted as an associate in 1933 and as a full member in 1943. He married Kathleen Shaw in 1937 and they had two daughters.
Early work
His working life was spent in the north west of England, and, but for the first three years of his career when he worked for Stockport County Borough Council (1927–1930), he was based entirely in Lancashire. He spent seven years at Bootle County Borough Council (1930–37) and from there moved to Blackpool County Borough Council (1937–45), initially as Deputy Engineer and Surveyor and latterly as Borough Engineer and Surveyor. In the early part of his career he worked on the design of a wide range of municipal engineering schemes. These included a sports stadium and cycle track; an eighteen-hole golf course; municipal offices; housing estates; libraries; schools; sea defences; an 18-mile sewerage system; a 7-mile ring road; and the construction of Britain's first multi-storey car park with integrated bus station.
In 1937 Drake travelled to Germany with the German Road Delegation to view autobahn construction. In the late 1930s and even during the Second World War many new road schemes were planned for the United Kingdom. The County Surveyors' Society and the Institution of Highway Engineers published reports that outlined the needs for and the benefits of a new high capacity highway network. During the Second World War, Winston Churchill had proposals drawn up to improve transport infrastructure. During this time Drake became a strong advocate of motorways for access, speed, safety and commerce. He went on to pursue his ideas locally, nationally and internationally.
Birth of the motorway network
In 1945 he was appointed the County Surveyor and Bridgemaster of Lancashire County Council, a post he would hold until |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.