source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/List%20of%20amphibians%20of%20Honduras | This is a list of amphibians found in Honduras. 121 amphibian species have been registered in Honduras, which are grouped in three orders: Caecilians (Gymnophiona), salamanders (Caudata) and frogs and toads (Anura). This list is derived from the database listing of AmphibiaWeb and IUCN Red List.
Caecilians (Gymnophiona)
Caeciliidae
Order: Gymnophiona – Family: Caeciliidae
Dermophis mexicanus (VU)
Gymnopis multiplicata (LC)
Salamanders (Caudata)
Plethodontidae
Order: Caudata – Family: Plethodontidae
Bolitoglossa carri (CR)
Bolitoglossa cataguana
Bolitoglossa celaque (EN)
Bolitoglossa conanti (EN)
Bolitoglossa decora (CR)
Bolitoglossa diaphora (CR)
Bolitoglossa dofleini (NT)
Bolitoglossa dunni (EN)
Bolitoglossa heiroreias (EN)
Bolitoglossa longissima (CR)
Bolitoglossa mexicana (LC)
Bolitoglossa oresbia (CR)
Bolitoglossa porrasorum (EN)
Bolitoglossa rufescens (LC)
Bolitoglossa striatula (LC)
Bolitoglossa synoria (CR)
Cryptotriton nasalis (EN)
Dendrotriton sanctibarbarus (VU)
Nototriton barbouri (EN)
Nototriton brodiei (CR)
Nototriton lignicola (CR)
Nototriton limnospectator (EN)
Nototriton picucha
Nototriton tomamorum
Oedipina cyclocauda (LC)
Oedipina elongata (LC)
Oedipina gephyra (EN)
Oedipina kasios
Oedipina leptopoda
Oedipina petiola
Oedipina quadra
Oedipina stuarti (DD)
Oedipina tomasi (CR)
Toads and frogs (Anura)
Bufonidae
Order: Anura – Family: Bufonidae
Incilius campbelli (NT)
Incilius coccifer (LC)
Incilius ibarrai (EN)
Incilius leucomyos (EN)
Incilius luetkenii (LC)
Incilius porteri (DD)
Incilius valliceps (LC)
Rhaebo haematiticus (LC)
Rhinella chrysophora (EN)
Rhinella marina (LC)
Centrolenidae
Order: Anura – Family: Centrolenidae
Cochranella granulosa (LC)
Hyalinobatrachium chirripoi (LC)
Hyalinobatrachium colymbiphyllum (LC)
Hyalinobatrachium fleischmanni (LC)
Teratohyla pulverata (LC)
Teratohyla spinosa (LC)
Craugastoridae
Order: Anura – Family: Craugastoridae
Craugastor anciano (CR)
Craugastor aurilegulus (EN)
Craugastor bransfordii (LC)
Craugastor chac (NT)
Craugastor chrysozetetes (EX)
Craugastor coffeus (CR)
Craugastor cyanochthebius (NT)
Craugastor emleni (CR)
Craugastor epochthidius (CR)
Craugastor fecundus (CR)
Craugastor fitzingeri (LC)
Craugastor laevissimus (EN)
Craugastor laticeps (NT)
Craugastor lauraster (EN)
Craugastor megacephalus (LC)
Craugastor merendonensis (CR)
Craugastor milesi (CR)
Craugastor noblei (LC)
Craugastor olanchano (CR)
Craugastor omoaensis (CR)
Craugastor pechorum (EN)
Craugastor rhodopis (VU)
Craugastor rostralis (NT)
Craugastor saltuarius (CR)
Craugastor stadelmani (CR)
Eleutherodactylidae
Order: Anura – Family: Eleutherodactylidae
Greenhouse frog, Eleutherodactylus planirostris (LC)
Hylidae
Order: Anura – Family: Hylidae
Agalychnis callidryas (LC)
Agalychnis moreletii (CR)
Anotheca spinosa (LC)
Bromeliohyla bromeliacia (EN)
Dendropsophus microcephalus (LC)
Duellmanohyla salvavida (CR)
Duellmanohyla soralia (CR)
Ecnomiohyla minera (EN)
Ecnomiohyla salvaje (CR)
Exerodonta catracha |
https://en.wikipedia.org/wiki/List%20of%20amphibians%20of%20El%20Salvador | This is a list of amphibians found in El Salvador. 29 amphibian species have been registered in El Salvador, which are grouped in 2 orders: salamanders (Caudata) and frogs and toads (Anura). No caecilian (Gymnophiona) species have been registered. This list is derived from the database listing of AmphibiaWeb.
Salamanders (Caudata)
Plethodontidae
Order: Caudata.
Family: Plethodontidae
Bolitoglossa heiroreias (EN)
Bolitoglossa salvinii (EN)
Bolitoglossa synoria (CR)
Oedipina taylori (LC)
Toads and frogs (Anura)
Bufonidae
Order: Anura.
Family: Bufonidae
Incilius canaliferus (LC)
Incilius coccifer (LC)
Incilius luetkenii (LC)
Rhinella marina (LC)
Centrolenidae
Order: Anura.
Family: Centrolenidae
Hyalinobatrachium fleischmanni (LC)
Craugastoridae
Order: Anura.
Family: Craugastoridae
Craugastor rhodopis (VU)
Dermophiidae
Order: Anura.
Family: Dermophiidae
Dermophis mexicanus (VU)
Hylidae
Order: Anura.
Family: Hylidae
Agalychnis moreletii (CR)
Dendropsophus robertmertensi (LC)
Exerodonta catracha (EN)
Plectrohyla glandulosa (EN)
Plectrohyla guatemalensis (CR)
Plectrohyla psiloderma (EN)
Plectrohyla sagorum (EN)
Ptychohyla euthysanota (NT)
Ptychohyla salvadorensis (EN)
Scinax staufferi (LC)
Smilisca baudinii (LC)
Leptodactylidae
Order: Anura.
Family: Leptodactylidae
Engystomops pustulosus (LC)
Leptodactylus fragilis (LC)
Leptodactylus melanonotus (LC)
Microhylidae
Order: Anura.
Family: Microhylidae
Gastrophryne usta (LC)
Hypopachus barberi (VU)
Ranidae
Order: Anura.
Family: Ranidae
Rana maculata (LC)
Rhinophrynidae
Order: Anura.
Family: Rhinophrynidae
Rhinophrynus dorsalis (LC)
Notes
References
Amphibians
El Salvador
El Salvador |
https://en.wikipedia.org/wiki/Henrik%20Sch%C3%A4rfe | Henrik Schärfe (born 1968) is a Danish former professor at Aalborg University, where he directed the Center for Computer-mediated Epistemology within the
Department of Communication and Psychology at Aalborg University.
He has been known through the Hiroshi Ishiguro-inspired and Kokoro-built robot Geminoid-DK, built to resemble himself. The Geminoid-DK project landed him on the Time top 100 list of the most influential people in 2012.
References
External links
Henrik Scharfes website at Aalborg University
Henrik Scharfes personal website
Geminoid-DK project website
Geminoid DK Mechanical Test, demonstration video on YouTube
1968 births
Living people
Academic staff of Aalborg University |
https://en.wikipedia.org/wiki/List%20of%20amphibians%20of%20Belize | This is a list of amphibians found in Belize. 37 amphibian species have been recorded in Belize.
This list is derived from the database listing of AmphibiaWeb.
Salamanders (Caudata)
Caudata
Order: Caudata – Family: Plethodontidae
Bolitoglossa mexicana (LC)
Oedipina elongata (LC)
Frogs and toads (Anura)
Bufonidae
Order: Anura – Family: Bufonidae
Incilius campbelli (LC)
Incilius valliceps (LC)
Rhinella marina (LC)
Centrolenidae
Order: Anura – Family: Centrolenidae
Hyalinobatrachium fleischmanni (LC)
Craugastoridae
Order: Anura – Family: Craugastoridae
Craugastor chac (NT)
Craugastor laticeps (NT)
Craugastor loki (LC)
Craugastor psephosypharus (VU)
Craugastor rhodopis (VU)
Craugastor sabrinus (EN)
Craugastor sandersoni (EN)
Eleutherodactylidae
Order: Anura – Family: Eleutherodactylidae
Eleutherodactylus leprus (VU)
Hylidae
Order: Anura – Family: Hylidae
Agalychnis callidryas (LC)
Agalychnis moreletii (CR)
Bromeliohyla bromeliacia (EN)
Dendropsophus ebraccatus (LC)
Dendropsophus microcephalus (LC)
Ecnomiohyla valancifer (CR)
Scinax staufferi (LC)
Smilisca baudinii (LC)
Smilisca cyanosticta (NT)
Tlalocohyla loquax (LC)
Tlalocohyla picta (LC)
Trachycephalus venulosus (LC)
Triprion petasatus (LC)
Leptodactylidae
Order: Anura – Family: Leptodactylidae
Engystomops pustulosus (LC)
Leptodactylus fragilis (LC)
Leptodactylus melanonotus (LC)
Microhylidae
Order: Anura – Family: Microhylidae
Gastrophryne elegans (LC)
Hypopachus variolosus (LC)
Ranidae
Order: Anura – Family: Ranidae
Rana berlandieri (LC)
Rana juliani (NT)
Rana maculata (LC)
Rana vaillanti (LC)
Rhinophrynidae
Order: Anura – Family: Rhinophrynidae
Rhinophrynus dorsalis (LC)
See also
Fauna of Belize
Notes
References
Amphibians
Belize
Belize |
https://en.wikipedia.org/wiki/List%20of%20amphibians%20of%20Nicaragua | This is a list of amphibians found in Nicaragua. 71 amphibian species have been registered in Nicaragua, grouped in 2 orders: Salamanders (Caudata) and Frogs and Toads (Anura). This list is derived from the database listing of AmphibiaWeb.
Salamanders (Caudata)
Plethodontidae
Order: Caudata.
Family: Plethodontidae
Bolitoglossa doefleini
Bolitoglossa insularis
Bolitoglossa mombachoensis (VU)
Bolitoglossa striatula (LC)
Nototriton saslaya (VU)
Oedipina collaris (DD)
Oedipina cyclocauda (LC)
Oedipina koehleri
Oedipina nica
Oedipina pseudouniformis (EN)
Toads and frogs (Anura)
Bufonidae
Order: Anura.
Family: Bufonidae
Incilius coccifer (LC)
Incilius coniferus (LC)
Incilius luetkenii (LC)
Rhaebo haematiticus (LC)
Rhinella marina (LC)
Centrolenidae
Order: Anura.
Family: Centrolenidae
Cochranella granulosa (LC)
Espadarana prosoblepon (LC)
Hyalinobatrachium fleischmanni (LC)
Sachatamia ilex (LC)
Teratohyla pulverata (LC)
Teratohyla spinosa (LC)
Craugastoridae
Order: Anura.
Family: Craugastoridae
Craugastor bransfordii (LC)
Craugastor chingopetaca (DD)
Craugastor fitzingeri (LC)
Craugastor laevissimus (EN)
Craugastor lauraster (EN)
Craugastor megacephalus (LC)
Craugastor mimus (LC)
Craugastor noblei (LC)
Craugastor polyptychus (LC)
Craugastor ranoides (CR)
Craugastor talamancae (LC)
Dendrobatidae
Order: Anura.
Family: Dendrobatidae
Dendrobates auratus (LC)
Oophaga pumilio (LC)
Dermophiidae
Order: Anura.
Family: Dermophiidae
Dermophis mexicanus (VU)
Gymnopis multiplicata (LC)
Eleutherodactylidae
Order: Anura.
Family: Eleutherodactylidae
Diasporus diastema (LC)
Hylidae
Order: Anura.
Family: Hylidae
Agalychnis callidryas (LC)
Agalychnis saltator (LC)
Cruziohyla calcarifer (LC)
Dendropsophus ebraccatus (LC)
Dendropsophus microcephalus (LC)
Dendropsophus phlebodes (LC)
Ecnomiohyla miliaria (VU)
Hypsiboas rufitelus (LC)
Ptychohyla hypomykter (CR)
Ptychohyla spinipollex (EN)
Scinax boulengeri (LC)
Scinax elaeochroa (LC)
Scinax staufferi (LC)
Smilisca baudinii (LC)
Smilisca phaeota (LC)
Smilisca puma (LC)
Smilisca sordida (LC)
Tlalocohyla loquax (LC)
Trachycephalus venulosus (LC)
Leptodactylidae
Order: Anura.
Family: Leptodactylidae
Engystomops pustulosus (LC)
Leptodactylus fragilis (LC)
Leptodactylus melanonotus (LC)
Leptodactylus savagei (LC)
Microhylidae
Order: Anura.
Family: Microhylidae
Gastrophryne pictiventris (LC)
Hypopachus variolosus (LC)
Ranidae
Order: Anura.
Family: Ranidae
Rana berlandieri (LC)
Rana forreri (LC)
Rana maculata (LC)
Rana miadis (VU)
Rana taylori (LC)
Rana vaillanti (LC)
Rana warszewitschii (LC)
Rhinophrynidae
Order: Anura.
Family: Rhinophrynidae
Rhinophrynus dorsalis (LC)
Strabomantidae
Order: Anura.
Family: Strabomantidae
Pristimantis cerasinus (LC)
Pristimantis ridens (LC)
See also
Fauna of Nicaragua
Notes
References
Amphibians
Nicaragua
Nicaragua |
https://en.wikipedia.org/wiki/Vuforia%20Augmented%20Reality%20SDK | Vuforia is an augmented reality software development kit (SDK) for mobile devices that enables the creation of augmented reality applications. It uses computer vision technology to recognize and track planar images and 3D objects in real time. This image registration capability enables developers to position and orient virtual objects, such as 3D models and other media, in relation to real world objects when they are viewed through the camera of a mobile device. The virtual object then tracks the position and orientation of the image in real-time so that the viewer's perspective on the object corresponds with the perspective on the target. It thus appears that the virtual object is a part of the real-world scene.
The Vuforia SDK supports a variety of 2D and 3D target types including ‘markerless’ Image Targets, 3D Model Target, and a form of addressable Fiducial Marker, known as a VuMark. Additional features of the SDK include 6 degrees of freedom device localization in space, localized Occlusion Detection using ‘Virtual Buttons’, runtime image target selection, and the ability to create and reconfigure target sets programmatically at runtime.
Vuforia provides Application Programming Interfaces (API) in C++, Java, Objective-C++, and the .NET languages through an extension to the Unity game engine. In this way, the SDK supports both native development for iOS, Android, and UWP while it also enables the development of AR applications in Unity that are easily portable to both platforms.
Vuforia has been acquired by PTC Inc. in November 2015.
References
Augmented reality applications
Software development kits |
https://en.wikipedia.org/wiki/David%20E.%20Muller | David Eugene Muller (November 2, 1924 – April 27, 2008) was an American mathematician and computer scientist. He was a professor of mathematics and computer science at the University of Illinois (1953–92), after which he became an emeritus professor, and was an adjunct professor of mathematics at the New Mexico State University (1995–2008). Muller received his BS in 1947 and his PhD in 1951 in physics from Caltech; an honorary PhD was conferred by the University of Paris in 1989. He was the inventor of the Muller C-element (or Muller C-gate), a device used to implement asynchronous circuitry in electronic computers. He also co-invented the Reed–Muller codes. He discovered the codes, and Irving S. Reed proposed the majority logic decoding for the first time. Furthermore, he invented Muller automata, an automaton model for infinite words. In geometric group theory Muller is known for the Muller–Schupp theorem, joint with Paul Schupp, characterizing finitely generated virtually free groups as finitely generated groups with context-free word problem.
Family
David E. Muller was the son of Hermann Joseph Muller and Jessie Jacobs Muller Offermann (formerly Jesse Marie Jacobs). He was born in Austin, Texas, when his parents taught at The University of Texas. His mother was one of the first women to receive a Ph.D. in mathematics in the United States, and he credited her with inspiring his early interest in mathematics. She lost her position as an instructor in pure mathematics at Texas because she became pregnant, and according to Hermann Joseph Muller's biographer, "her colleagues felt that a mother could not give full attention to classroom duties and remain a good mother." As a child he was with his parents in Berlin and Leningrad in 1933–34. His family was dissolved in the Soviet Union. He returned to Austin with his mother in July 1934. His mother obtained a divorce in Texas in the summer of 1935. Sometime between October 1935 and January 1936, Jessie Muller married Carlos Alberto Offermann, who had been working in Muller's laboratory and was on a visit to Austin from the Soviet Union at that time. Hermann Joseph Muller left the Soviet Union in 1937 after the start of Stalin's political persecutions. After a brief stay in Madrid and Paris, in September 1937, Hermann moved to Edinburgh, where he married Dorothea Kantorowicz in May 1939. They had a daughter, Helen Juliette. Hermann Joseph Muller received the Nobel Prize in Physiology or Medicine in 1946.
David E. Muller died in 2008 in Las Cruces, New Mexico. He is survived by his children, Chandra L. Muller and Kenneth J. Muller. His half-sister, Helen J. Muller, is a professor emerita at the University of New Mexico. He was predeceased by his wife Alice Mimi Muller, who died in Urbana, Illinois, in 1989, and divorced (posthumously) in 2009 from his second wife, Denise Impens Muller, in Las Cruces, New Mexico.
See also
Muller C-element
Reed–Muller code
Reed–Muller expansion
Muller's method (an e |
https://en.wikipedia.org/wiki/Ben%20Ib | Ben Ib is a computer graphics artist living and working in London. He has directed music videos for Kylie Minogue, Calvin Harris, The Ting Tings, Roni Size, Goldie Lookin Chain, Mr Hudson and Stateless. He has also created live tour visuals for Paul McCartney, Roger Waters, Robbie Williams, Minogue and The Smashing Pumpkins, as well as creating the cover image for AC/DC's Power Up album (Creative Direction by Josh Cheuse) and Paul McCartney's New album (from a logo and cover concept conceived by UK art and design team Rebecca and Mike).
Early work
Ib studied art at Leeds University. His first digital short Collapse, created as a third-year university film won the "Video Positive" award in 1996 and was screened on Channel Four's "Digital Underground" series. His early student work was screened at the Hanover Film Festival, the AVE Festival (Arnhem, The Netherlands), One Dot Zero, Cinefeel and the Edinburgh Film Festival. In 1998 Ib relocated to London to work as a 3D artist in the post-production industry, eventually moving into the direction of television advertisements and music videos.
Music videos
Calvin Harris – "Ready for the Weekend"
The Ting Tings – "We Walk"
Kylie Minogue – "The One"
Mr Hudson – "Too Late Too Late"
Jentina – "Mysterious"
Goldie Lookin Chain – "Your Missus Is a Nutter"
Roni Size ft Beverly Knight – "No More"
Ali Love – "Secret Sunday Lover"
Switches – "Lay Down the Law"
Stateless – "Down Here"
AC/DC – "Demon Fire"
Concert visuals
Tame Impala – Slow Rush Tour
Kylie Minogue – Glastonbury Festival Legends Slot
The Killers – Wonderful Wonderful Tour
Paul McCartney – One on One Tour
The Who – Glastonbury Festival
The Killers – Glastonbury Festival
Paul McCartney – Out There! Tour
Paul McCartney – On the Run Tour
Paul McCartney – The Liverpool Sound Concert
Roger Waters – The Wall Live
Kylie Minogue – Aphrodite Tour
Kylie Minogue – X Tour
Robbie Williams – Close Encounters Tour
Other work
AC/DC – Power Up album cover image (Creative Direction Josh Cheuse)
The Neon Demon - Film title sequence (With All City Media)
Paul McCartney – New album cover image (Logo and cover concept by Rebecca and Mike, Consultancy and design by YES)
Paul McCartney – "Ramming" documentary, 2012 (Director)
Razorlight – "Golden Touch – Live at the Bicklayers Arms" (Director)
SJWatson – "Before I go to Sleep" commercial (Director)
Directed television advertisements for Coke Light, Sunsilk and Dulux
References
External links
Director Website
"Ramming" Documentary
Interview: The making of "Ready For the Weekend"
Interview - Behind the scenes on Kylie's 'The One'
Interview: Kylie's The One by Ben Ib*
Interview: The making of "The Wall"
Place of birth missing (living people)
Year of birth missing (living people)
Alumni of the University of Leeds
Computer animation people
Living people
British music video directors
Musicians from London |
https://en.wikipedia.org/wiki/Neural%20substrate%20of%20locomotor%20central%20pattern%20generators%20in%20mammals | Central pattern generators are biological neural networks organized to produce any rhythmic output without requiring a rhythmic input. In mammals, locomotor CPGs are organized in the lumbar and cervical segments of the spinal cord, and are used to control rhythmic muscle output in the arms and legs. Certain areas of the brain initiate the descending neural pathways that ultimately control and modulate the CPG signals. In addition to this direct control, there exist different feedback loops that coordinate the limbs for efficient locomotion and allow for the switching of gaits under appropriate circumstances.
General anatomy and physiology
Significant brain regions
Locomotion can be initiated by pathways that originate in the caudal hindbrain and brainstem and descend to the spinal cord. These descending pathways originate in the Mesencephalic Locomotor Region (MLR) and the lateral hypothalamus. These areas project to reticulospinal neurons in the pons and medulla, which themselves project throughout the spinal cord to activate the CPGs involved in locomotion. In particular, the reticular formation in the pons plays an important role in inducing locomotion. The parapyramidal region (PPR) in the ventral medulla is also known to produce locomotion when stimulated in neonatal rats. Several different command pathways play a role in the initiation of locomotion. Neurons involved in each of these include glutamatergic, noradrenergic (NA), dopaminergic (DA), and serotonergic (5-HT) neurons.
Spinal cord
The central pattern generators responsible for locomotion in vertebrates reside as half-center modules in the cervical and lumbar region of the spinal cord. Each CPG generates a basic motor output pattern that is responsible for the rhythmic contractions of flexor-extensor muscles that correspond to the forelimbs and hindlimbs. There exist neural substrates that control bilateral limb coordination, particularly in the lumbar spinal circuits controlling the hindlimbs of quadruped mammals. Rhythmogenic potential is highest in the center of the spinal cord and decreases in a mediolateral direction. The ability to generate fast and regular rhythmic activity decreases in the caudal direction, but the rhythm-generating networks extends from the lumbar region into the caudal thoracic region of the spinal cord. Both lateral and ventral funiculi are able to coordinate activity in the rostral and caudal regions. Although CPGs do exist in humans, supraspinal structures are also important for the additional demands of bipedal locomotion. There are different functional networks controlling forward and backward movement, as well as different circuits controlling each leg. These networks are largely nonoverlapping, although some feedback does exist between them.
Significant neuron types
Glutamatergic
A study of neonatal rats demonstrated the significance of glutamatergic neurons, particularly those containing the Vglut2 transporter, in the rhythmic g |
https://en.wikipedia.org/wiki/List%20of%20amphibians%20of%20Costa%20Rica | This is a list of amphibians found in Costa Rica. A total of 194 amphibian species have been recorded in Costa Rica, three of which are extinct. This list is derived from the database listing of AmphibiaWeb. Each species is listed by its scientific name, in taxonomic order, followed by the Red Book conservation status - extinct (EX), extinct in the wild (EW), critically endangered (CR), endangered (EN), vulnerable (VU), near threatened (NT), least concern (LC), data deficient (DD) or not evaluated (NE).
Caecilians (Gymnophiona)
Caeciliidae
Order: Gymnophiona.
Family: Caeciliidae
Oscaecilia osae (DD)
Salamanders (Caudata)
Caudata
Order: Caudata.
Family: Plethodontidae
Bolitoglossa alvaradoi (EN)
Bolitoglossa bramei (DD)
Bolitoglossa cerroensis (LC)
Bolitoglossa colonnea (LC)
Bolitoglossa compacta (EN)
Bolitoglossa diminuta (VU)
Bolitoglossa epimela (DD)
Bolitoglossa gomezi (DD)
Bolitoglossa gracilis (VU)
Bolitoglossa lignicolor (VU)
Bolitoglossa marmorea (EN)
Bolitoglossa minutula (EN)
Bolitoglossa nigrescens (EN)
Bolitoglossa obscura (VU)
Bolitoglossa pesrubra (VU)
Bolitoglossa robinsoni
Bolitoglossa robusta (LC)
Bolitoglossa schizodactyla (LC)
Bolitoglossa sombra (VU)
Bolitoglossa sooyorum (EN)
Bolitoglossa striatula (LC)
Bolitoglossa subpalmata (EN)
Bolitoglossa tica (EN)
Nototriton abscondens (LC)
Nototriton gamezi (VU)
Nototriton guanacaste (VU)
Nototriton major (CR)
Nototriton picadoi (NT)
Nototriton richardi (NT)
Nototriton tapanti (VU)
Oedipina alfaroi (VU)
Oedipina alleni (LC)
Oedipina altura (CR)
Oedipina carablanca (EN)
Oedipina collaris (DD)
Oedipina cyclocauda (LC)
Oedipina gracilis (EN)
Oedipina grandis (EN)
Oedipina pacificensis (LC)
Oedipina paucidentata (CR)
Oedipina poelzi (EN)
Oedipina pseudouniformis (EN)
Oedipina savagei (DD)
Oedipina uniformis (NT)
Frogs and toads (Anura)
Bufonidae
Order: Anura.
Family: Bufonidae
Atelopus chiriquiensis (CR)
Atelopus chirripoensis
Atelopus senex (CR)
Atelopus varius (CR)
Incilius aucoinae (LC)
Incilius chompipe (VU)
Incilius coccifer (LC)
Incilius coniferus (LC)
Incilius epioticus (LC)
Incilius fastidiosus (CR)
Incilius guanacaste (DD)
Incilius holdridgei (CR)
Incilius luetkenii (LC)
Incilius melanochlorus (LC)
Incilius periglenes (EX)
Incilius valliceps (LC)
Rhaebo haematiticus (LC)
Rhinella marina (LC)
Centrolenidae
Order: Anura.
Family: Centrolenidae
Cochranella euknemos (LC)
Cochranella granulosa (LC)
Espadarana prosoblepon (LC)
Hyalinobatrachium chirripoi (LC)
Hyalinobatrachium colymbiphyllum (LC)
Hyalinobatrachium fleischmanni (LC)
Hyalinobatrachium talamancae (LC)
Hyalinobatrachium valerioi (LC)
Hyalinobatrachium vireovittatum (DD)
Sachatamia albomaculata (LC)
Sachatamia ilex (LC)
Teratohyla pulverata (LC)
Teratohyla spinosa (LC)
Craugastoridae
Order: Anura.
Family: Craugastoridae
Craugastor andi (CR)
Craugastor angelicus (CR)
Craugastor bransfordii (LC)
Craugastor catalinae (CR)
Craugastor crassidigitus (LC)
Craugastor cuaquero (DD)
Craugastor escoces (EX)
Craugas |
https://en.wikipedia.org/wiki/List%20of%20amphibians%20of%20Mexico | This is a list of amphibians found in Mexico. A total of 366 amphibian species have been recorded in Mexico, 3 of which are extinct. This list is derived from the database listing of AmphibiaWeb.
Caecilians (Gymnophiona)
Dermophiidae
Order: Gymnophiona.
Family: Dermophiidae
Dermophis mexicanus (VU)
Dermophis oaxacae (DD)
Salamanders (Caudata)
Ambystomatidae
Order: Caudata.
Family: Ambystomatidae
Ambystoma altamirani (EN)
Ambystoma amblycephalum (CR)
Ambystoma andersoni (CR)
Ambystoma bombypellum (CR)
Ambystoma dumerilii (CR)
Ambystoma flavipiperatum (DD)
Ambystoma granulosum (CR)
Ambystoma leorae (CR)
Ambystoma lermaense (CR)
Ambystoma mexicanum (CR)
Ambystoma ordinarium (EN)
Ambystoma rivulare (DD)
Ambystoma rosaceum (LC)
Ambystoma silvense (DD)
Ambystoma taylori (CR)
Ambystoma tigrinum (LC)
Ambystoma velasci (LC)
Plethodontidae
Order: Caudata.
Family: Plethodontidae
Aneides lugubris (LC)
Batrachoseps major (LC)
Bolitoglossa alberchi (LC)
Bolitoglossa chinanteca
Bolitoglossa flavimembris (EN)
Bolitoglossa flaviventris (EN)
Bolitoglossa franklini (EN)
Bolitoglossa hartwegi (NT)
Bolitoglossa hermosa (NT)
Bolitoglossa lincolni (NT)
Bolitoglossa macrinii (NT)
Bolitoglossa mexicana (LC)
Bolitoglossa oaxacensis (DD)
Bolitoglossa occidentalis (LC)
Bolitoglossa platydactyla (NT)
Bolitoglossa riletti (EN)
Bolitoglossa rostrata (VU)
Bolitoglossa rufescens (LC)
Bolitoglossa stuarti (DD)
Bolitoglossa veracrucis (EN)
Bolitoglossa yucatana (LC)
Bolitoglossa zapoteca (DD)
Chiropterotriton arboreus (CR)
Chiropterotriton chiropterus (CR)
Chiropterotriton chondrostega (EN)
Chiropterotriton cracens (EN)
Chiropterotriton dimidiatus (EN)
Chiropterotriton lavae (CR)
Chiropterotriton magnipes (CR)
Chiropterotriton mosaueri (DD)
Chiropterotriton multidentatus (EN)
Chiropterotriton orculus (VU)
Chiropterotriton priscus (NT)
Chiropterotriton terrestris (CR)
Cryptotriton adelos (EN)
Cryptotriton alvarezdeltoroi (EN)
Dendrotriton megarhinus (VU)
Dendrotriton xolocalcae (VU)
Ensatina eschscholtzii (LC)
Ixalotriton niger (CR)
Ixalotriton parvus (CR)
Nyctanolis pernix (EN)
Oedipina elongata (LC)
Parvimolge townsendi (CR)
Pseudoeurycea ahuitzotl (CR)
Pseudoeurycea altamontana (EN)
Pseudoeurycea amuzga (DD)
Pseudoeurycea anitae (CR)
Pseudoeurycea aquatica (CR)
Pseudoeurycea aurantia (VU)
Pseudoeurycea bellii (VU)
Pseudoeurycea boneti (VU)
Pseudoeurycea brunnata (CR)
Pseudoeurycea cafetalera
Pseudoeurycea cephalica (NT)
Pseudoeurycea cochranae (EN)
Pseudoeurycea conanti (EN)
Pseudoeurycea firscheini (EN)
Pseudoeurycea gadovii (EN)
Pseudoeurycea galeanae (NT)
Pseudoeurycea gigantea (CR)
Pseudoeurycea goebeli (CR)
Pseudoeurycea juarezi (CR)
Pseudoeurycea leprosa (VU)
Pseudoeurycea lineola (EN)
Pseudoeurycea longicauda (EN)
Pseudoeurycea lynchi (CR)
Pseudoeurycea maxima (DD)
Pseudoeurycea melanomolga (EN)
Pseudoeurycea mixcoatl (DD)
Pseudoeurycea mixteca (LC)
Pseudoeurycea mystax (EN)
Pseudoeurycea naucampatepetl (CR)
Pseudoeurycea nigromaculata (CR)
Pseudoeurycea obes |
https://en.wikipedia.org/wiki/Deadlock%20prevention%20algorithms | In computer science, deadlock prevention algorithms are used in concurrent programming when multiple processes must acquire more than one shared resource. If two or more concurrent processes obtain multiple resources indiscriminately, a situation can occur where each process has a resource needed by another process. As a result, none of the processes can obtain all the resources it needs, so all processes are blocked from further execution. This situation is called a deadlock. A deadlock prevention algorithm organizes resource usage by each process to ensure that at least one process is always able to get all the resources it needs. One such example of deadlock algorithm is Banker's algorithm.
Overview
Distributed deadlock
Distributed deadlocks can occur in distributed systems when distributed transactions or concurrency control is being used. Distributed deadlocks can be detected either by constructing a global wait-for graph, from local wait-for graphs at a deadlock detector or by a distributed algorithm like edge chasing.
Phantom deadlocks are deadlocks that are detected in a distributed system due to system internal delays but no longer actually exist at the time of detection.
Deadlock prevention
There are many different ways to increase parallelism where recursive locks would otherwise cause deadlocks. But there is a price. And that price is either performance/overhead, allow data corruption, or both.
Some examples include: lock hierarchies, lock reference-counting and preemption (either using versioning or allowing data corruption when preemption occurs); Wait-For-Graph (WFG) algorithms, which track all cycles that cause deadlocks (including temporary deadlocks); and heuristics algorithms which don't necessarily increase parallelism in 100% of the places that deadlocks are possible, but instead compromise by solving them in enough places that performance/overhead vs parallelism is acceptable.
Consider a "when two trains approach each other at a crossing" situation. Just-in-time prevention works like having a person standing at the crossing (the crossing guard) with a switch that will let only one train onto "super tracks" which runs above and over the other waiting train(s).
For non-recursive locks, a lock may be entered only once (where a single thread entering twice without unlocking will cause a deadlock, or throw an exception to enforce circular wait prevention).
For recursive locks, only one thread is allowed to pass through a lock. If any other threads enter the lock, they must wait until the initial thread that passed through completes n number of times it has entered.
So the issue with the first one is that it does no deadlock prevention at all. The second does not do distributed deadlock prevention. But the second one is redefined to prevent a deadlock scenario the first one does not address.
Recursively, only one thread is allowed to pass through a lock. If other threads enter the lock, they must wait until the i |
https://en.wikipedia.org/wiki/Se%20Ela%20Dan%C3%A7a%2C%20Eu%20Dan%C3%A7o | Se Ela Dança, Eu Danço is a Brazilian televised dance competition show that is produced and broadcast by the Brazilian television network SBT and presented by Ligia Mendes and Beto Marden. The show takes its title from the song of the same name by MC Leozinho.
Format
The competition is open to a variety of different act types, including solo, duet, and group performers of any dance style and any level of professional experience. The show recruits its performance cast from open auditions held throughout Brazil. The ten dance acts which make it past this stage will perform more elaborate routines in later episodes with a combination of at-home viewer votes and judge decisions eventually selecting one winner per season.
Judges Panel
The expert judges who help select the finalists for the show and guide home voters include actor, director, dancer and choreographer João Wlamir, singer, actor, dancer and choreographer Jarbas Homem de Melo, and singer, actress, dancer,
Season 1
The premiere season began on January 5 of 2011 and drew over 10,000 auditioners to its opening auditions, which were held in Belo Horizonte, Rio de Janeiro, São Paulo, Salvador, Curitiba and Joinville (home of the Joinville Dance Festival, the world's largest annual dance event, by number of participants). From these applicants, 20 dance acts were ultimately chosen to perform in the first two semifinal rounds and, from the semi-finals, four acts progressed to a third competitive round. Lastly, the finale was a showdown between the top two acts.
Infringement lawsuit
In 2011, singer MC Leozinho filed suit against the show, claiming that its title violated his intellectual property rights and that producers had not obtained permission to use the phrase or the music itself, which was initially played over the opening and closing credits. On December 21, 2011, a justice with the 15th Federal Circuit Court of Rio de Janeiro found in favor of Leozinho and imposed an injunction against the show's use of the title. However, SBT was later able to get this decision overturned and has announced plans to return with a third season of the show.
References
Brazilian reality television series
Dance competition television shows |
https://en.wikipedia.org/wiki/Geek%20humor | Geek humor may refer to:
Humor of or about geeks
Computer humor
Internet humor
Mathematical joke |
https://en.wikipedia.org/wiki/HomeOS | HomeOS was the working title of a home automation operating system being developed at Microsoft Research in the early 2010s. Microsoft Research announced the project in 2010 and abandoned it in 2012.
HomeOS communicated with Lab of Things, a cloud-based Internet of Things infrastructure also developed by Microsoft.
Microsoft's slogan for their HomeOS project was "Enabling smarter homes for everyone."
Microsoft's HomeOS development team has written three sample applications that make use of multiple devices, including a "sticky media" app that plays music in parts of the house that are lit up, but not other rooms; a two-factor authentication app that uses audio from smartphones and images from a front-door camera to turn on lights when a user is identified; and a home browser for viewing and controlling a user's access to all devices in a home.
Some staff who worked on the project cited Microsoft CEO Steve Ballmer's focus on enterprise applications, productivity software, and cloud computing as the reason for the stalled development.
See also
Building automation
Home server
Lighting control system
LinuxMCE
References
External links
Official Microsoft HomeOS website
External links
Lab of Things
Internet of things
Home automation
Microsoft operating systems
Microsoft Research |
https://en.wikipedia.org/wiki/AdMarketplace | adMarketplace is a search advertising marketplace. The privately held company is headquartered in New York City.
adMarketplace introduced an algorithmic bidding solution, BidSmart, for their search advertising platform in early 2014.
Search advertising marketplaces represent a sizable but often overlooked segment of the Search Engine Marketing industry.
Services
adMarketplace operates an online marketplace that connects advertisers and publishers to serve PPC search ads on publisher properties in response to a user's search. The company places keyword-targeted ads on web properties outside of traditional search engine result pages.
adMarketplace offers advertisers scale and performance via access to exclusive search traffic, according to the company website.
For publishers, the company offers custom search monetization, flexible implementation, and transparent reporting. Publisher partners include Firefox, Afterpay, and Avast Browser.
The company positions itself as the only search syndication marketplace and allows advertisers to separate bid management by device type (computer/tablet/phone) and traffic source. The company claims that increased pricing control and transparency results in a higher ROI for advertisers.
In 2013, adMarketplace partnered with Kenshoo to offer integration through Kenshoo's campaign management dashboard.
Recognition
In 2014, adMarketplace was named to Deloitte’s Technology Fast 500 as one of the fastest growing technology companies in North America.
The Data Warehousing Institute (TDWI) named adMarketplace a 2014 Best Practices Award winner in Big Data Technology for its Advertiser 3D and BidSmart technologies. Hewlett Packard also recognized adMarketplace with the 2014 Discover Award for its innovation in big data even though their tracking technology is known for its faults.
History
adMarketplace was founded by James Hill in 2000. From 2003 to 2006, it was the exclusive search advertising platform for eBay; when that exclusivity ended, the company opened its platform to all advertisers and publishers. The immediate impact was a major downsize, with just seven employees at one point, but it then grew 50% in 2008 and reached 80 employees in 2011. In 2012, adMarketplace grew to 100 employees, and was named the 8th fastest growing company in New York by Crains. In 2014, adMarketplace was ranked one of the fastest growing technology companies in North America by Deloitte on their annual Fast 500 list, and in 2016 adMarketplace was among the first 100 companies approved for the Trustworthy Accountability Group (TAG) registry
References
Marketing companies established in 2000
Online advertising services and affiliate networks |
https://en.wikipedia.org/wiki/Asset%20Description%20Metadata%20Schema | The Asset Description Metadata Schema (ADMS) is a common metadata vocabulary to describe standards, so-called interoperability assets, on the Web.
Used in concert with web syndication technology ADMS helps people make sense of the complex multi-publisher environment around standards and in particular the ones which are semantic assets such as ontologies, data models, data dictionaries, code lists, XML and RDF schemas. In spite of their importance, standards are not easily discoverable on the web via search engines because metadata about them is seldom available. Navigating on the websites of the different publishers of standards is not efficient either.
Key terminology
A semantic asset is a specific type of standard which involves:
highly reusable metadata
(e.g. xml schemata, generic data models)
and/or reference data
(e.g. code lists, taxonomies, dictionaries, vocabularies)
Organisations use semantic assets to share information and knowledge (within themselves and with others). Semantic assets are usually very valuable and reusable elements for the development of Information Systems, in particular, as part of machine-to-machine interfaces. As enablers to interoperable information exchange, semantic assets are usually created, published and maintained by standardisation bodies. Nonetheless, ICT projects and groups of experts also create such assets. There are therefore many publishers of semantic assets with different degrees of formalism.
What is ADMS
ADMS is a standardised metadata vocabulary created by the EU's Interoperability Solutions for European Public Administrations (ISA) Programme of the European Commission to help publishers of standards document what their standards are about (their name, their status, theme, version, etc.) and where they can be found on the Web. ADMS descriptions can then be published on different websites while the standard itself remains on the website of its publisher (i.e. syndication of content). ADMS embraces the multi-publisher environment and, at the same time, it provides the means for the creation of aggregated catalogues of standards and single points of access to them based on ADMS descriptions. The Commission will offer a single point of access to standards described using ADMS via its collaborative platform, Joinup. The Federation service will increase the visibility of standards described with ADMS on the web. This will also stimulate their reuse by Pan-European initiatives.
ADMS Working Group
More than 43 people of 20 EU Member States as well as from the US and Australia have participated in the ADMS Working Group. Most of them were experts from standardisation bodies, research centres and the EU Commission. The working group used a methodology based on W3C’s processes and methods.
How to download ADMS
ADMS version 1 was officially released in April 2012. Version 1.00 of ADMS is available for download on Joinup:
https://web.archive.org/web/20120430065401/http://joinup.ec.europa.eu/asset/ad |
https://en.wikipedia.org/wiki/BeIN%20Sports | beIN Sports ( ) is a Qatari multinational network of sports channels owned and operated by the Qatari media group beIN. It has played a major role in the increased commercialization of Qatari sports. Its chairman is Nasser Al-Khelaifi, and its CEO is Yousef Obaidly.
beIN Sports is the dominant television sports channel in the MENA region. It also operates channels in France, the United States, Canada, Australia, New Zealand, Turkey, Hong Kong, Singapore, Brunei, Malaysia, Indonesia, Philippines and Thailand.
History
Early career
Al Jazeera Media Network entered the European television rights market in June 2011 when it purchased a package of live French football Ligue 1 matches from 2012 to 2016 for €90 million a year. The deal makes them joint broadcasters of domestic top-flight football in France alongside long-term rights holders Canal+. The broadcaster also acquired the pay-TV rights to the UEFA Champions League, Europa League from 2012 to 2015, Euro 2012 and Euro 2016 in France. France was targeted as Al Jazeera's first entry into Europe due to the fact that there were no dedicated sports channels, unlike in the United Kingdom.
The name "beIN Sports" was first revealed in early 2012. According to Nasser Al-Khelaifi, the director of Al Jazeera Sports, the name "symbolises the mind of two channels aiming at bringing live and exclusive broadcasting of the biggest events." Former Canal+ executive Charles Bietry was hired by Al Jazeera to launch the channels. The channels will be available on all cable and IPTV providers and select satellite providers. CanalSat – owned by Canal+ Group – has declined to carry the channels as of March 2012. beIN Sports was officially launched on June 1, 2012, in time to broadcast Euro 2012. beIN Sports 2 commenced on July 27, 2012, in time to broadcast the French Ligue 2 season, and before the start of the 2012–13 Ligue 1 season. In June 2015, it was announced that Nasser Al-Khelaifi had plans to create the beIN Sports channel on TV operators to cable in Brazil.
beIN Sports Spain officially began broadcasting on 1 July 2015, the date on which Gol Televisión ceased broadcasting all football games, which during the summer were in place under the slogan "Change the game", "Cambia el juego" in Spanish. Thanks to an alliance between Al Jazeera and Mediapro, beIN Sports Spain offers UEFA Champions League (2015–2018), UEFA Europe League (2015–2018), UEFA Super Cup (2015–2017), Premier League (2015–16 season only), Serie A, Primeira Liga, Jupiler Pro League, Ligue 1, DFB Pokal, Coupe de la Ligue, KNVB Beker, Johan Cruijff Shield, Copa de Brasil, CONCACAF Gold Cup, Copa Libertadores and Copa Sudamericana. beIN Sports Spain can be viewed over the Internet, smart TV (LG and Samsung), PC, laptops, tablets, Smartphones (iOS/Android), PS3/PS4, Chromecast, TV Operators (Orange, Vodafone and Telecable) and online platforms (beIN Sports Connect, Total Channel and YouTube). On Wednesday August 19, due to the start of the playo |
https://en.wikipedia.org/wiki/Pinoy%20Adventures | Adventures () is a 2012 Philippine television travel documentary show broadcast by GMA Network. Hosted by Richard Gutierrez, it premiered on May 13, 2012. The show concluded on September 29, 2012 with a total of 21 episodes. It was replaced by Wish Ko Lang! in its timeslot.
The show scours the country to feature some unknown paradise, forgotten relics and cultural treasures and lost traditions that rarely see on television.
Throughout its run, the host was accompanied by some local residents, historians, archaeologists and story tellers also served as tourist guides.
Episodes
Sibuyan Island, Romblon
(May 13, 20, 27, 2012)
In the premiere episode, the host and the rest of the team explore Sibuyan Island in Romblon. From Aklan to the destination, the team travels 4 hours by boat. The following day, the host explores Magdiwang's Sibuyan forest using mountain bike. On his way, he passes Mount Guiting-Guiting or G2. He also visits Lambingan Falls, a community-based eco-tourism. From Magdiwang, the host visits San Fernando's Ikaduha Fish Sanctuary where he tries snorkeling. The following morning, Gutierrez experienced Sayap or community net fishing, a tradition in San Fernando. After that, he visits Cantingas River.
Linapacan, Palawan
(June 3, 10, 2012)
Linapacan (which means footprints) is part of Calamianes Group of Island. It composed of 10 barangays. The host and the rest of the team visit first Ariara Island. On its second part, Gutierrez visits a century-old fortress called Sitio Caseledan, where he discovers a tribe called Tagbanuas which according to historical data, are already civilized even before the Spanish era. The team also explores Eli island and the Senyora cave, the most beautiful cave in Eli where they discovered the limestone formations inside.
Kalinga
(June 17, 24, 2012)
The show features the ecotourism discovery destination of the north, Kalinga. On his accession to the mountainous Cordillera, the host will experienced a warm welcome from the locals. He visits a panciteria (noodle house) to eat "batil patung", the Tuguegarao version of stir fried noodles mixed with buffalo meat. But before he ate, he was invited by the owner to cook. After the food trip and while they were traveling, the ground suddenly crumbled and covered the road. Fortunately the team met Lakay Appad who offered them fresh pork as offering for Kabunian, the God recognized by the indigenous people. Later on, the team continued the journey. The whole team have witnessed natural beauty: green mountains in which the clouds almost kissed the land, and the rice terraces. Basically, the Kalinga mountains area is home of brave inhabitants. Gutierrez met the "headhunters", and another tribal group whose members have tattoo covered all over their bodies. The host also met the oldest tattoo artist, Wang-od, and its customers who are old ladies in the tribe.
Surigao del Norte
(July 1, 8, 2012)
Beyond the sand, surf and sea, the host, Richard Gutierrez and the rest o |
https://en.wikipedia.org/wiki/Oglethorpe%20Plan | The Oglethorpe Plan is an urban planning idea that was most notably used in Savannah, Georgia, one of the Thirteen Colonies, in the 18th century. The plan uses a distinctive street network with repeating squares of residential blocks, commercial blocks, and small green parks to create integrated, walkable neighborhoods.
James Edward Oglethorpe founded the Georgia Colony, and the town of Savannah, in 1733. The new Georgia colony was authorized under a grant from George II to a group constituted by Oglethorpe as the Trustees for the Establishment of the Colony of Georgia in America, or simply the Georgia Trustees.
Oglethorpe's plan for settlement of the new colony had been in the works since 1730, three years before the founding of Savannah. The multifaceted plan sought to achieve several goals through interrelated policy and design elements, including the spacing of towns, the layout of towns and eventually their surrounding counties, equitable allocation of land, and limits to growth to preserve a sustainable agrarian economy.
Historical significance
The Oglethorpe Plan was an embodiment of all of the major themes of the Enlightenment, including science, humanism, and secular government. Georgia became the only American colony infused at its creation with Enlightenment ideals: the last of the Thirteen Colonies, it would become the first to embody the principles later embraced by the founders. Remnants of the Oglethorpe Plan exist today in Savannah, showcasing a town plan that retains the vibrancy of ideas behind its conception.
At the heart of Oglethorpe's comprehensive and multi-faceted plan there was a vision of social equity and civic virtue. The mechanisms supporting that vision, including yeoman governance, equitable land allocation, stable land tenure, prohibition of slavery, and secular administration, were among the ideas debated during the British Enlightenment. Many of those ideals have been carried forward, and are found today in Savannah's Tricentennial Plan and other policy documents.
Sources for the Oglethorpe Plan
The Grand Model for the Province of Carolina was cited by the Georgia Trustees as a source of their plan for Georgia, although with the major difference that it would have neither aristocracy nor slavery. Oglethorpe wrote that the plan was conceived with "toleration" and "wholesome regulations." Benjamin Martyn, the trustees' secretary, wrote, "We are indebted to the Lord Shaftsbury, and that truly wise man Mr. Locke, for the excellent laws which they drew up for the first settlement of Carolina." Other sources are speculative, since they were not cited by Oglethorpe or the trustees. Such possible inspirations include classical planning concepts dating to Vitruvius and Roman colonial planning (e.g., Timgad), Renaissance concepts of the ideal city, and later plans such as the Vauban plan of Neuf-Brisach.
Notable comments
Many prominent planners and urban theorists have commented on various attributes of the Og |
https://en.wikipedia.org/wiki/Matrix%20completion | Matrix completion is the task of filling in the missing entries of a partially observed matrix, which is equivalent to performing data imputation in statistics. A wide range of datasets are naturally organized in matrix form. One example is the movie-ratings matrix, as appears in the Netflix problem: Given a ratings matrix in which each entry represents the rating of movie by customer , if customer has watched movie and is otherwise missing, we would like to predict the remaining entries in order to make good recommendations to customers on what to watch next. Another example is the document-term matrix: The frequencies of words used in a collection of documents can be represented as a matrix, where each entry corresponds to the number of times the associated term appears in the indicated document.
Without any restrictions on the number of degrees of freedom in the completed matrix this problem is underdetermined since the hidden entries could be assigned arbitrary values. Thus we require some assumption on the matrix to create a well-posed problem, such as assuming it has maximal determinant, is positive definite, or is low-rank.
For example, one may assume the matrix has low-rank structure, and then seek to find the lowest rank matrix or, if the rank of the completed matrix is known, a matrix of rank that matches the known entries. The illustration shows that a partially revealed rank-1 matrix (on the left) can be completed with zero-error (on the right) since all the rows with missing entries should be the same as the third row. In the case of the Netflix problem the ratings matrix is expected to be low-rank since user preferences can often be described by a few factors, such as the movie genre and time of release. Other applications include computer vision, where missing pixels in images need to be reconstructed, detecting the global positioning of sensors in a network from partial distance information, and multiclass learning. The matrix completion problem is in general NP-hard, but under additional assumptions there are efficient algorithms that achieve exact reconstruction with high probability.
In statistical learning point of view, the matrix completion problem is an application of matrix regularization which is a generalization of vector regularization. For example, in the low-rank matrix completion problem one may apply the regularization penalty taking the form of a nuclear norm
Low rank matrix completion
One of the variants of the matrix completion problem is to find the lowest rank matrix which matches the matrix , which we wish to recover, for all entries in the set of observed entries. The mathematical formulation of this problem is as follows:
Candès and Recht proved that with assumptions on the sampling of the observed entries and sufficiently many sampled entries this problem has a unique solution with high probability.
An equivalent formulation, given that the matrix to be recovered is known to be of rank , is |
https://en.wikipedia.org/wiki/Jesper%20Ovesen | Jesper Ovesen (born 1957) was the Executive Chairman of the board of Nokia Siemens Networks. Before being appointed to the board of Nokia Siemens Networks, he was the CFO of Danish telecommunications group TDC A/S.
Biography
Born in 1957, in Hjørring, Denmark, Ovesen was educated at the Copenhagen Business School attaining an MSc degree in 1985, and at the Harvard Business School Program for Management Development in 1991.
Career
Ovesen is the Executive Chairman of the board of Nokia Siemens Networks, since September 2011. Before joining Nokia Siemens Networks, Ovesen held a number of senior management positions in European companies in a range of industries. Most recently, he served as CFO of Danish telecommunications group TDC A/S during the company’s restructuring process and initial public offering. Ovesen has also served as CEO at Kirkbi, the investment company of the Kirk Kristiansen Family, CFO at Lego and CFO at Danske Bank. He has extensive experience in finance and M&A activities, and is a certified accountant.
Other interests
Ovesen is a member of the board of Orkla Group (since 2010), a member of the board of FLSmidth (since 2005) and a member of the board of Skandinaviska Enskilda Banken (since 2004).
References
1954 births
Living people
Danish chief executives
Harvard Business School alumni
Copenhagen Business School alumni |
https://en.wikipedia.org/wiki/Unparser | In computing, an unparser is a system that constructs a set of characters or image components from a given parse tree.
An unparser is in effect the reverse of a traditional parser that takes a set of string of characters and produces a parse tree. Unparsing generally involves the application of a specific set of rules to the parse tree as a "tree walk" takes place.
Given that the tree may involve both textual and graphic elements, the unparser may have two separate modules, each of which handles the relevant components. In such cases the "master unparser" looks up the "master unparse table" to determine if a given nested structure should be handled by one module, or the other.
See also
Bidirectional transformation
Formal grammar
Natural language generation
References
Syntax
Compiler construction |
https://en.wikipedia.org/wiki/WHRT-FM | WHRT-FM is a non-commercial radio station licensed to Cokesbury, South Carolina, that broadcasts on a frequency of 91.9 MHz and covers Greenwood, Laurens, and Clinton.
Owned by Radio Training Network, it carries a Christian classic hits format branded as "Classic HIS Radio", fed by WLFJ-HD4.
History
Oldies WKRI, along with WFBK Fort Mill, South Carolina and WKBR Summerville, South Carolina, was sold by Spirit Broadcasting Group Inc. for $460,832.
References
External links
HRT-FM
HRT-FM
Radio stations established in 2011
2011 establishments in South Carolina |
https://en.wikipedia.org/wiki/Blipfoto | Blipfoto is an Edinburgh-headquartered online daily photo journal and social networking service allowing people to save a record of their life in pictures; sharing their photographs and telling their stories one day at a time. It has a positive ‘Be Excellent’ ethos.
With over 18 million page views a month, the site has a strict rule allowing its users to post just one picture a day to their journal. To date, 'Blippers' in over 170 countries worldwide have posted 3.4 million photos with close to 22 million shared comments on the site. Each photo on Blipfoto represents a single day in someone's life - so there are almost 3.5m individual days saved to date.
History
In October 2004, Blipfoto founder Joe Tree built a website which let him publish just one photo a day on the internet and write something about it. He set two simple rules: he could only upload one picture a day, and it had to be taken on that day.
In the summer of 2006, Tree released a very rudimentary version of Blipfoto and invited 15 other people to join in. It let anyone set up a journal of their own, upload one picture a day, write some words, and comment on other people’s material. This was subsequently opened to anyone.
In November 2009 the site won a BAFTA Scotland award for the best website.
Following the BAFTA win, in December 2010 Blipfoto announced seed investment which allowed the business to turn from a project into a full-time venture.
In 2011 it was voted as best Scottish website by arts and culture magazine The List.
Blipfoto also worked in partnership with a number of large organisations on photographic projects and competitions. It premiered a film – life.turns - at the Edinburgh Art Festival in 2010. The stop motion film was created using 1205 photographs taken in 21 countries over 40 days.
This was the inspiration behind Scotland The World Over, a collaboration with Scotland.org. The film centred on the Scottish saltire flag, showing people in 32 countries around the world holding it. The film was compiled between St. Andrew's Day 2011 and Burns Night 2012.
In January 2015 Blipfoto went into partnership with Polaroid and the website was rebranded and relaunched as Polaroid Blipfoto.
In March 2015 Polaroid Blipfoto went into liquidation. Business services firm FRP Advisory were appointed as liquidators of the Edinburgh-based firm on 11 March.
In February 2016 a new community owned company, Blipfuture CIC, completed purchase of the blipfoto website after raising over £130,000 in a crowdfunding campaign. Blipfuture CIC will run the website for the benefit of its community, supported by volunteers.
Notable users
Mike Russell MSP
Steve Wozniak
Roseanna Cunningham MSP
Peter May
Janice Hally
Corrie Corfield
References
External links
ChatWise Website
Internet properties established in 2004
British social networking websites |
https://en.wikipedia.org/wiki/Layered%20queueing%20network | In queueing theory, a discipline within the mathematical theory of probability, a layered queueing network (or rendezvous network) is a queueing network model where the service time for each job at each service node is given by the response time of a queueing network (and those service times in turn may also be determined by further nested networks). Resources can be nested and queues form along the nodes of the nesting structure. The nesting structure thus defines "layers" within the queueing model.
Layered queueing has applications in a wide range of distributed systems which involve different master/slave, replicated services and client-server components, allowing each local node to be represented by a specific queue, then orchestrating the evaluation of these queues.
For large population of jobs, a fluid limit has been shown in PEPA to be a give good approximation of performance measures.
External links
Tutorial Introduction to Layered Modeling of Software Performance by Murray Woodside, Carleton University
References
Distributed computing
Queueing theory
Network performance |
https://en.wikipedia.org/wiki/Generalized%20distributive%20law | The generalized distributive law (GDL) is a generalization of the distributive property which gives rise to a general message passing algorithm. It is a synthesis of the work of many authors in the information theory, digital communications, signal processing, statistics, and artificial intelligence communities. The law and algorithm were introduced in a semi-tutorial by Srinivas M. Aji and Robert J. McEliece with the same title.
Introduction
"The distributive law in mathematics is the law relating the operations of multiplication and addition, stated symbolically, ; that is, the monomial factor is distributed, or separately applied, to each term of the binomial factor , resulting in the product " - Britannica
As it can be observed from the definition, application of distributive law to an arithmetic expression reduces the number of operations in it. In the previous example the total number of operations reduced from three (two multiplications and an addition in ) to two (one multiplication and one addition in ). Generalization of distributive law leads to a large family of fast algorithms. This includes the FFT and Viterbi algorithm.
This is explained in a more formal way in the example below:
where and are real-valued functions, and (say)
Here we are "marginalizing out" the independent variables (, , and ) to obtain the result. When we are calculating the computational complexity, we can see that for each pairs of , there are terms due to the triplet which needs to take part in the evaluation of with each step having one addition and one multiplication. Therefore, the total number of computations needed is . Hence the asymptotic complexity of the above function is .
If we apply the distributive law to the RHS of the equation, we get the following:
This implies that can be described as a product where and
Now, when we are calculating the computational complexity, we can see that there are additions in and each and there are multiplications when we are using the product to evaluate . Therefore, the total number of computations needed is . Hence the asymptotic complexity of calculating reduces to from . This shows by an example that applying distributive law reduces the computational complexity which is one of the good features of a "fast algorithm".
History
Some of the problems that used distributive law to solve can be grouped as follows
1. Decoding algorithms
A GDL like algorithm was used by Gallager's for decoding low density parity-check codes. Based on Gallager's work Tanner introduced the Tanner graph and expressed Gallagers work in message passing form. The tanners graph also helped explain the Viterbi algorithm.
It is observed by Forney that Viterbi's maximum likelihood decoding of convolutional codes also used algorithms of GDL-like generality.
2. Forward-backward algorithm
The forward backward algorithm helped as an algorithm for tracking the states in the markov chain. And this also was used the |
https://en.wikipedia.org/wiki/List%20of%20amphibians%20of%20the%20United%20States | This is a list of amphibians found in the United States. A total of 306 amphibian species have been recorded in the United States, 2 of which are now extinct. This list is derived from the database listing of Amphibian Species of the World.
Salamanders (Caudata)
Ambystomatidae
Order: Caudata.
Family: Ambystomatidae
Ambystoma annulatum Cope, 1886
Ambystoma barbouri Kraus & Petranka, 1989
Ambystoma bishopi Goin, 1950
Ambystoma californiense Gray, 1853
Ambystoma cingulatum Cope, 1868
Ambystoma gracile (Baird, 1859)
Ambystoma jeffersonianum (Green, 1827)
Ambystoma laterale Hallowell, 1856
Ambystoma mabeei Bishop, 1928
Ambystoma macrodactylum Baird, 1850
Ambystoma maculatum (Shaw, 1802)
Ambystoma mavortium Baird, 1850
Ambystoma opacum (Gravenhorst, 1807)
Ambystoma talpoideum (Holbrook, 1838)
Ambystoma texanum (Matthes, 1855)
Ambystoma tigrinum (Green, 1825)
Dicamptodon aterrimus (Cope, 1868)
Dicamptodon copei Nussbaum, 1970
Dicamptodon ensatus (Eschscholtz, 1833)
Dicamptodon tenebrosus (Baird & Girard, 1852)
Amphiumidae
Order: Caudata.
Family: Amphiumidae
Amphiuma means Garden, 1821
Amphiuma pholeter Neill, 1964
Amphiuma tridactylum Cuvier, 1827
Cryptobranchidae
Order: Caudata.
Family: Cryptobranchidae
Cryptobranchus alleganiensis (Sonnini de Manoncourt & Latreille, 1801)
Cryptobranchus bishopi Grobman, 1943
Plethodontidae
Order: Caudata.
Family: Plethodontidae
Batrachoseps altasierrae Jockusch, Martínez-Solano, Hansen, & Wake, 2012
Batrachoseps attenuatus (Eschscholtz, 1833)
Batrachoseps bramei Jockusch, Martínez-Solano, Hansen, & Wake, 2012
Batrachoseps campi Marlow, Brode, & Wake, 1979
Batrachoseps diabolicus Jockusch, Wake, & Yanev, 1998
Batrachoseps gabrieli Wake, 1996
Batrachoseps gavilanensis Jockusch, Yanev, & Wake, 2001
Batrachoseps gregarius Jockusch, Wake, & Yanev, 1998
Batrachoseps incognitus Jockusch, Yanev, & Wake, 2001
Batrachoseps kawia Jockusch, Wake, & Yanev, 1998
Batrachoseps luciae Jockusch, Yanev, & Wake, 2001
Batrachoseps major Camp, 1915
Batrachoseps minor Jockusch, Yanev, & Wake, 2001
Batrachoseps nigriventris Cope, 1869
Batrachoseps pacificus (Cope, 1865)
Batrachoseps regius Jockusch, Wake, & Yanev, 1998
Batrachoseps relictus Brame & Murray, 1968
Batrachoseps robustus Wake, Yanev, & Hansen, 2002
Batrachoseps simatus Brame & Murray, 1968
Batrachoseps stebbinsi Brame & Murray, 1968
Batrachoseps wrighti (Bishop, 1937)
Eurycea aquatica Rose & Bush, 1963
Eurycea arenicola (Stuart et al., 2020)
Eurycea bislineata (Green, 1818)
Eurycea chamberlaini Harrison & Guttman, 2003
Eurycea chisholmensis Chippindale, Price, Wiens, & Hillis, 2000
Eurycea cirrigera (Green, 1831)
Eurycea guttolineata (Holbrook, 1838)
Eurycea junaluska Sever, Dundee, & Sullivan, 1976
Eurycea latitans Smith & Potter, 1946
Eurycea longicauda (Green, 1818)
Eurycea lucifuga Rafinesque, 1822
Eurycea multiplicata (Cope, 1869)
Eurycea nana Bishop, 1941
Eurycea naufragia Chippindale, Price, Wiens |
https://en.wikipedia.org/wiki/ARINC%20573 | ARINC 573 is an avionics data bus standard developed by ARINC. It is mostly used with Flight Data Recorder that use 12bit words in continuous data stream encoded in Harvard biphase.
See also
ARINC 717, a possible successor to Arinc 573
References
ARINC standards
Serial buses |
https://en.wikipedia.org/wiki/Guruswami%E2%80%93Sudan%20list%20decoding%20algorithm | In coding theory, list decoding is an alternative to unique decoding of error-correcting codes in the presence of many errors. If a code has relative distance , then it is possible in principle to recover an encoded message when up to fraction of the codeword symbols are corrupted. But when error rate is greater than , this will not in general be possible. List decoding overcomes that issue by allowing the decoder to output a short list of messages that might have been encoded. List decoding can correct more than fraction of errors.
There are many polynomial-time algorithms for list decoding. In this article, we first present an algorithm for Reed–Solomon (RS) codes which corrects up to errors and is due to Madhu Sudan. Subsequently, we describe the improved Guruswami–Sudan list decoding algorithm, which can correct up to errors.
Here is a plot of the rate R and distance for different algorithms.
https://wiki.cse.buffalo.edu/cse545/sites/wiki.cse.buffalo.edu.cse545/files/81/Graph.jpg
Algorithm 1 (Sudan's list decoding algorithm)
Problem statement
Input : A field ; n distinct pairs of elements in ; and integers and .
Output: A list of all functions satisfying
is a polynomial in of degree at most
To understand Sudan's Algorithm better, one may want to first know another algorithm which can be considered as the earlier version or the fundamental version of the algorithms for list decoding RS codes - the Berlekamp–Welch algorithm.
Welch and Berlekamp initially came with an algorithm which can solve the problem in polynomial time with best threshold on to be .
The mechanism of Sudan's Algorithm is almost the same as the algorithm of Berlekamp–Welch Algorithm, except in the step 1, one wants to compute a bivariate polynomial of bounded degree. Sudan's list decoding algorithm for Reed–Solomon code which is an improvement on Berlekamp and Welch algorithm, can solve the problem with . This bound is better than the unique decoding bound for .
Algorithm
Definition 1 (weighted degree)
For weights , the – weighted degree of monomial is . The – weighted degree of a polynomial is the maximum, over the monomials with non-zero coefficients, of the – weighted degree of the monomial.
For example, has -degree 7
Algorithm:
Inputs: ; {} /* Parameters l,m to be set later. */
Step 1: Find a non-zero bivariate polynomial satisfying
has -weighted degree at most
For every ,
Step 2. Factor Q into irreducible factors.
Step 3. Output all the polynomials such that is a factor of Q and for at least t values of
Analysis
One has to prove that the above algorithm runs in polynomial time and outputs the correct result. That can be done by proving following set of claims.
Claim 1:
If a function satisfying (2) exists, then one can find it in polynomial time.
Proof:
Note that a bivariate polynomial of -weighted degree at most can be uniquely written as . Then one has to find the coefficients satisfying the constraints , f |
https://en.wikipedia.org/wiki/List%20of%20amphibians%20of%20the%20Dominican%20Republic | This is a list of amphibians found in the Dominican Republic. There is a total of 47 amphibian species recorded in the Dominican Republic.
This list is derived from the database listing of AmphibiaWeb.
Frogs and Toads (Anura)
Bufonidae
Order: Anura.
Family: Bufonidae
Peltophryne fluviatica (CR)
Peltophryne fracta (EN)
Peltophryne guentheri (VU)
Rhinella marina (LC)
Eleutherodactylidae
Order: Anura.
Family: Eleutherodactylidae
Eleutherodactylus abbotti (LC)
Eleutherodactylus alcoae (EN)
Eleutherodactylus aporostegus
Eleutherodactylus armstrongi (EN)
Eleutherodactylus audanti (VU)
Eleutherodactylus auriculatoides (EN)
Eleutherodactylus bothroboans
Eleutherodactylus coqui (LC)
Eleutherodactylus diplasius
Eleutherodactylus flavescens (NT)
Eleutherodactylus fowleri (CR)
Eleutherodactylus furcyensis (CR)
Eleutherodactylus haitianus (EN)
Eleutherodactylus heminota (EN)
Eleutherodactylus hypostenor (EN)
Eleutherodactylus inoptatus (LC)
Eleutherodactylus jugans (CR)
Eleutherodactylus leoncei (CR)
Eleutherodactylus melatrigonum
Eleutherodactylus minutus (EN)
Eleutherodactylus montanus (EN)
Eleutherodactylus nortoni (CR)
Eleutherodactylus notidodes
Eleutherodactylus parabates (CR)
Eleutherodactylus paralius
Eleutherodactylus patriciae (EN)
Eleutherodactylus pictissimus (VU)
Eleutherodactylus pituinus (EN)
Eleutherodactylus probolaeus (EN)
Eleutherodactylus rucillensis
Eleutherodactylus rufifemoralis (CR)
Eleutherodactylus ruthae (EN)
Eleutherodactylus schmidti (CR)
Eleutherodactylus sommeri
Eleutherodactylus tychathrous
Eleutherodactylus weinlandi (LC)
Eleutherodactylus wetmorei (VU)
Hylidae
Order: Anura.
Family: Hylidae
Hypsiboas heilprini (VU)
Osteopilus dominicensis (LC)
Osteopilus pulchrilineatus (EN)
Osteopilus vastus (EN)
Leptodactylidae
Order: Anura.
Family: Leptodactylidae
Leptodactylus albilabris (LC)
Ranidae
Order: Anura.
Family: Ranidae
Rana catesbeiana (LC)
See also
List of amphibians of Hispaniola
Notes
References
Amphibians
Dominican Republic
Dominican Republic |
https://en.wikipedia.org/wiki/2012%20in%20Scottish%20television | This is a list of events in Scottish television from 2012.
Events
January
No events.
February
No events.
March
5 March – ITV and STV sign a deal which (if approved by Ofcom) could see more networked programmes appearing on television in Scotland. The agreement would end a three-year hiatus which has seen many major ITV programmes absent from schedules in Scotland.
14 March – 60th anniversary of BBC One Scotland.
28 March – Debut of Watching Ourselves: 60 Years of TV in Scotland, a BBC documentary series celebrating the best of television in Scotland as television in Scotland celebrates its 60th anniversary.
April
18 April
In a rare move for British courts, television cameras are allowed into High Court of Justiciary to film the sentencing of David Gilroy for the murder of Suzanne Pilley.
STV announces a boost to its production arm.
27 April
A poll conducted by Scottish Legal News indicates that two-thirds of Scottish lawyers, advocates and academics are in favour of allowing television cameras into courtrooms after 65% of those who responded to the survey responded positively to the idea.
STV's Edinburgh operation is moved from George Street in the city centre to a new studio at Fountainbridge.
May
1 May – Television executive Richard Horwood expresses concern that television companies bidding for licences to run city-based television services in Scotland may be sidelined because of BBC Alba. In England Freeview has assigned Channel 8 for use by such channels, while in Scotland they have assigned Channel 45 since 8 is designated for Alba.
10 May – Prince Charles presents the lunchtime weather forecast during a visit to the BBC Scotland headquarters in Glasgow.
27 May – BBC Scotland holds a televised debate on the future of Scotland as part of the United Kingdom. The debate comes two days after First Minister Alex Salmond launches his Party's "Yes" campaign for the 2014 referendum on independence.
29 May – BBC Director-General Mark Thompson tells the Scottish Parliament's Education and Culture Committee the BBC has no plans in place for the scenario of an independent Scotland.
June
14 June – The Daily Record reports that BSkyB has threatened to cancel their contract to air games from the Scottish Premier League if Rangers F.C. are relegated from the division.
July
6 July
Global Television is awarded the contract to broadcast the 2014 Commonwealth Games which will be staged in Glasgow. The footage will be distributed to television companies worldwide, including the UK's BBC.
Editworks, a television editing company that has been involved in producing series such as Eggheads and The Sarah Millican Television Programme announces a £200,000 expansion of its operations in Scotland after receiving a £68,000 government grant.
19 July – The Scottish Football League approaches broadcasters with a package to show up to 25 live Rangers matches during the 2012–13 season. However, any deal cannot be finalised until the Scottish Football Association g |
https://en.wikipedia.org/wiki/2012%E2%80%9313%20United%20States%20network%20television%20schedule | The 2012–13 network television schedule for the five major English-language commercial broadcast networks in the United States covers primetime hours from September 2012 through August 2013. The schedule is followed by a list per network of returning series, new series, and series canceled after the 2011–12 season.
NBC was the first to announce its fall schedule on May 13, 2012, followed by Fox on May 14, then ABC on May 15, CBS on May 16, and The CW on May 17, 2012.
PBS is not included; member stations have local flexibility over most of their schedules and broadcast times for network shows may vary. The CW is not included on weekends, when it does not offer network programming. Ion Television airs primarily syndicated reruns, along with new episodes of The Listener from Canada's CTV and professional wrestling program WWE Main Event. MyNetworkTV also offers syndicated reruns, with limited original programming.
New series are highlighted in bold.
All times are U.S. Eastern Time and Pacific Time (except for some live sports or events). Subtract one hour for Central and Mountain times.
Each of the 30 highest-rated shows is listed with its rank and rating as determined by Nielsen Media Research.
Legend
Sunday
Monday
Tuesday
Wednesday
Thursday
Friday
Note: Community and Whitney were replaced by an encore programming on Friday nights.
Saturday
By network
ABC
Returning series
20/20
ABC Saturday Movie of the Week
America's Funniest Home Videos
The Bachelor
The Bachelorette
Body of Proof
Castle
Dancing with the Stars
Don't Trust the B---- in Apartment 23
Extreme Weight Loss
Grey's Anatomy
Happy Endings
Last Man Standing
The Lookout
The Middle
Modern Family
Once Upon a Time
Primetime: What Would You Do?
Private Practice
Revenge
Rookie Blue
Saturday Night Football
Scandal
Secret Millionaire
Shark Tank
Suburgatory
Wife Swap
Wipeout
New series
666 Park Avenue
Bet on Your Baby *
Family Tools *
How to Live with Your Parents (For the Rest of Your Life) *
Last Resort
Malibu Country
Mistresses *
Motive *
Nashville
The Neighbors
Red Widow *
Splash *
The Taste *
Whodunnit? *
Zero Hour *
Not returning from 2011–12:
Bachelor Pad
Charlie's Angels
Cougar Town (moved to TBS in 2013)
Desperate Housewives
Duets
Extreme Makeover: Home Edition (moved to HGTV in 2020, revived by ABC in 2023–24)
Final Witness
GCB
The Glass House
Man Up! (burned off on ABC.com)
Missing
NY Med (returned in 2013–14)
Pan Am
Primetime
The River
Trust Us with Your Life
Work It
You Deserve It
CBS
Returning series
2 Broke Girls
48 Hours
60 Minutes
The Amazing Race
The Big Bang Theory
Big Brother
Blue Bloods
Criminal Minds
CSI: Crime Scene Investigation
CSI: NY
The Good Wife
Hawaii Five-0
How I Met Your Mother
The Mentalist
Mike & Molly
NCIS
NCIS: Los Angeles
Person of Interest
Rules of Engagement
Survivor
Two and a Half Men
Undercover Boss
Unforgettable
New series
The American Baking Competition *
Brooklyn DA *
Elementary
Golden Boy *
The Job *
Made |
https://en.wikipedia.org/wiki/Fuzzy%20extractor | Fuzzy extractors are a method that allows biometric data to be used as inputs to standard cryptographic techniques, to enhance computer security. "Fuzzy", in this context, refers to the fact that the fixed values required for cryptography will be extracted from values close to but not identical to the original key, without compromising the security required. One application is to encrypt and authenticate users records, using the biometric inputs of the user as a key.
Fuzzy extractors are a biometric tool that allows for user authentication, using a biometric template constructed from the user's biometric data as the key, by extracting a uniform and random string from an input , with a tolerance for noise. If the input changes to but is still close to , the same string will be re-constructed. To achieve this, during the initial computation of the process also outputs a helper string which will be stored to recover later and can be made public without compromising the security of . The security of the process is also ensured when an adversary modifies . Once the fixed string has been calculated, it can be used, for example, for key agreement between a user and a server based only on a biometric input.
History
One precursor to fuzzy extractors was the so-called "Fuzzy Commitment", as designed by Juels and Wattenberg. Here, the cryptographic key is decommited using biometric data.
Later, Juels and Sudan came up with Fuzzy vault schemes. These are order invariant for the fuzzy commitment scheme and use a Reed–Solomon error correction code. The code word is inserted as the coefficients of a polynomial, and this polynomial is then evaluated with respect to various properties of the biometric data.
Both Fuzzy Commitment and Fuzzy Vaults were precursors to Fuzzy Extractors.
Motivation
In order for fuzzy extractors to generate strong keys from biometric and other noisy data, cryptography paradigms will be applied to this biometric data. These paradigms:
(1) Limit the number of assumptions about the content of the biometric data (this data comes from a variety of sources; so, in order to avoid exploitation by an adversary, it's best to assume the input is unpredictable).
(2) Apply usual cryptographic techniques to the input. (Fuzzy extractors convert biometric data into secret, uniformly random, and reliably reproducible random strings.)
These techniques can also have other broader applications for other type of noisy inputs such as approximative data from human memory, images used as passwords, and keys from quantum channels. Fuzzy extractors also have applications in the proof of impossibility of the strong notions of privacy with regard to statistical databases.
Basic definitions
Predictability
Predictability indicates the probability that an adversary can guess a secret key. Mathematically speaking, the predictability of a random variable is .
For example, given a pair of random variable and , if the adversary knows of , then the p |
https://en.wikipedia.org/wiki/Amira%20%28software%29 | Amira (pronounce: Ah-meer-ah) is a software platform for visualization, processing, and analysis of 3D and 4D data. It is being actively developed by Thermo Fisher Scientific in collaboration with the Zuse Institute Berlin (ZIB), and commercially distributed by Thermo Fisher Scientific — together with its sister software Avizo.
Overview
Amira is an extendable software system for scientific visualization, data analysis, and presentation of 3D and 4D data. It is used by thousands of researchers and engineers in academia and industry around the world.
Its flexible user interface and modular architecture make it a universal tool for processing and analysis of data from various modalities; e.g. micro-CT, PET, Ultrasound. Its ever-expanding functionality has made it a versatile data analysis and visualization solution, applicable to and being used in many fields, such as microscopy in biology and materials science, molecular biology, quantum physics, astrophysics, computational fluid dynamics (CFD), finite element modeling (FEM), non-destructive testing (NDT), and many more.
One of the key features, besides data visualization, is Amira’s set of tools for image segmentation and geometry reconstruction. This allows the user to mark (or segment) structures and regions of interest in 3D image volumes using automatic, semi-automatic, and manual tools. The segmentation can then be used for a variety of subsequent tasks, such as volumetric analysis, density analysis, shape analysis, or the generation of 3D computer models for visualization, numerical simulations, or rapid prototyping or 3D printing, to name a few.
Other key Amira features are multi-planar and volume visualization, image registration, filament tracing, cell separation and analysis, tetrahedral mesh generation, fiber-tracking from diffusion tensor imaging (DTI) data, skeletonization, spatial graph analysis, and stereoscopic rendering of 3D data over multiple displays and immersive virtual reality environments, including CAVEs.
As a commercial product Amira requires the purchase of a license or an academic subscription. A time-limited, but full-featured evaluation version is available for download free of charge.
History
1993–1998: Research software
Amira’s roots go back to 1993 and the Department for Scientific Visualization, headed by Hans-Christian Hege at the Zuse Institute Berlin (ZIB). The ZIB is a research institute for mathematics and informatics. The Scientific Visualization department’s mission is to help solve computationally and scientifically challenging tasks in medicine, biology, engineering and materials science. For this purpose, it develops algorithms and software for 2D, 3D, and 4D data visualization and visually supported exploration and analysis. At that time, the young visualization group at the ZIB had experience with the extendable, data flow-oriented visualization environments apE, IRIS Explorer, and Advanced Visualization Studio (AVS), but was not satisfied with th |
https://en.wikipedia.org/wiki/1910s%20Pacific%20hurricane%20seasons | The 1910s Pacific hurricane seasons were before the satellite age started in the 1960s, data on east Pacific hurricanes is extremely unreliable. For a few years, there were no reported cyclones, although many systems certainly formed.
1910
Three known tropical cyclones formed in 1910. The remnants of one of them entered southern California on September 15, bringing of rain to Santa Barbara County.
1911
Eleven known tropical cyclones formed in 1911 in the eastern Pacific proper.
On September 11, Hurricane 4 of this year's Atlantic season survived passage over Central America and emerged into the Pacific Ocean, where it dissipated on September 12.
On September 29, a ship reported strong winds and a pressure of 998 mbar inside a storm to the east of Hawaii. There were no other reports of this possible tropical cyclone.
A "tropical hurricane" formed southwest of Mexico on October 1. The system recurved, coming ashore on October 4 near Guaymas, accompanied by a devastating storm surge early on the morning of October 5, with some 500 reported dead. It then crossed through western Mexico, before becoming an extratropical cyclone across the American southwest on October 5. The cyclone had a long life thereafter, moving east-northeast across the United States into the western Atlantic on October 7. Racing northeast, the cyclone moved over the Polar ice cap on October 11, arcing north of Europe, before dropping into northern Asia on October 13, then crossing through Siberia until October 21, when the low dissipated.
A "tropical hurricane" formed south of Mexico on October 6. The system moved north-northwest, making landfall west of Acapulco on October 8, before dissipating inland on October 10.
1912
Four known tropical cyclones formed in 1912.
One of them, which stayed at sea, was tracked from August 10 to 11 of this year.
A "tropical hurricane" formed southwest of Mexico on October 23. The cyclone moved northwest, then northward, through western Mexico on October 26 before dissipating on October 27.
1913
There was only one known tropical cyclone in 1913.
1914
There were no known tropical cyclones.
1915
Four tropical cyclones formed in 1915.
On July 4, a system formed WNW of Cocos Island. It made landfall near Salina Cruz two days later.
A tropical cyclone hit northern Baja California in late August. Its remnants entered California on August 26, bringing light rains amounting to .
A "tropical hurricane" moved just offshore the coasts of southern and western Mexico between September 3 and 7.
1916
There were no known tropical cyclones.
1917
Four tropical cyclones formed in 1917.
A "tropical hurricane" formed southwest of Mexico on August 29, moved northward into western Mexico on September 1.
1918
Three tropical cyclones formed in the eastern Pacific in 1918.
On September 13, a hurricane was discovered off the coast of Acapulco. It paralleled the coast and moved slightly inland. After reentering the Pacific Ocean, it made landfall |
https://en.wikipedia.org/wiki/1942%E2%80%931948%20Pacific%20hurricane%20seasons | The 1942–48 Pacific hurricane seasons all began during late spring in the northeast Pacific Ocean and the central Pacific. They ended in late fall.
Before the satellite age started in the 1960s, data on east Pacific hurricanes is extremely unreliable. In a few years, there are no reported cyclones although many systems certainly formed.
1942 season
There are no known tropical cyclones.
1943 season
A disturbance developed between the Revillagigedo Islands and the Marias Islands on October 8. It moved rapidly northeastward where it rapidly intensified, reaching pressures as low as . On October 9, as a major hurricane it struck the west coast of Mexico, a short distance south of Mazatlán. The next day, the hurricane dissipated inland.
This hurricane caused damage in and around Mazatlán. It sank several vessels. The total cost of damage was $4,500,000 (1943 US dollars), and at least 106 people were killed.
1944 season
There are no known tropical cyclones.
1945 season
A hurricane dissipated off the northern coast of the Baja California Peninsula. Its remnants moved northeast, and they brought rain to California on September 9 and 10.
A tropical depression, a continuation of Atlantic Hurricane 10, entered the Pacific Ocean on October 5. A circulation center associated with this cyclone moved along the Mexican coast, and remained recognizable until it was west of Acapulco. It caused heavy rain along its path.
1946 season
A hurricane made landfall on the northern Baja California Peninsula. It dissipated over northern Baja California. Its remnants headed north, where they brought rain to the mountains of southern and central California on September 30 and October 1.
1947 season
There are no known tropical cyclones.
1948 season
In mid-October, a hurricane moved into the Gulf of California; a ship was reported missing for 2 days.
See also
List of Pacific hurricanes
Pacific hurricane season
1940s North Indian Ocean cyclone seasons
1900–1950 South-West Indian Ocean cyclone seasons
1940s Australian region cyclone seasons
1940s South Pacific cyclone seasons
Atlantic hurricane seasons: 1940, 1941, 1942, 1943, 1944, 1945, 1946, 1947, 1948, 1949
Western Pacific typhoon seasons: 1940, 1941, 1942, 1943, 1944, 1945, 1946, 1947, 1948, 1949
References
Pacific hurricane seasons
1940s Pacific hurricane seasons |
https://en.wikipedia.org/wiki/Peter%20Borish | Peter F. Borish is chairman and CEO of Computer Trading Corporation (CTC), an investment and advisory firm. Borish sits on the board of CIBC Bank USA. He is also a partner in Adam Hoffman's natural gas options trading team at Torsion Technologies, LLC. and a Partner of Quantrarian Asset Management
Previously, through CTC, Borish was chief strategist of Quad Group and its affiliated companies. In his role, Borish was engaged in recruiting new talent for Quad and working with the founding partners on business strategy. In addition, he helped traders develop a methodology to enhance their performance by serving as a trading coach. Borish is chairman and CEO of Computer Trading Corporation (CTC), and a current investor and advisor to 444 Capital, the D'Amelio family fund.
Mr. Borish is also a founding investor in Charitybuzz.
Borish formerly worked at the Federal Reserve Bank of New York, was founding partner and second-in-command at Tudor Investment Corporation, was chairman of OneChicago, LLC, and was chairman of the non-profits Foundation for the Study of Cycles and The Institute for Financial Markets.
He is also a founding board member of both the Robin Hood Foundation and Math for America.
Education
Borish earned a B.A. in economics from the University of Michigan in 1981. He also earned an M.A. in public policy from the Gerald R. Ford School of Public Policy at the University of Michigan in 1982.
Career
Peter Borish has served as the Chief Strategist of Quad Group LLC, an investment management firm, since 2013. Additionally, Borish has served as the president and CEO of Computer Trading Corporation, an actively managed fund focused on macroeconomic investing, since 1995, where he created the trade and risk management models his company uses to manage assets in the derivatives market. Borish also served as the CEO and member of the board of Twinfields Capital Management, a global macro hedge fund focused on the fixed income sector, from 2005 to 2008. Borish was a founding partner of Tudor Investment Corporation, a global investment firm, where he served as the director of research from 1985 to 1994.
In addition to the foregoing leadership positions, Borish has also served as a board advisor of ValueStream Labs, an accelerator for financial services technologies, since 2013 and as a trustee of RMB Investors Trust, an open-end management investment company since 2015.
Borish has engaged in substantial philanthropy and nonprofit work, having helped found, and, since 1988, having served on the board of directors of, the Robin Hood Foundation, which funds New York City educational projects for disadvantaged children. Additionally, since 1991, Borish has been a trustee of the Institute for Financial Markets (IFM), a nonprofit dedicated to participating in the development of standards and fostering best practices initiatives in the financial services industry. From 2006 until 2013, Borish served as a member of the board of directors at Chari |
https://en.wikipedia.org/wiki/Zdzis%C5%82aw%20Pawlak | Zdzislaw I. Pawlak (10 November 1926 – 7 April 2006) was a Polish mathematician and computer scientist. He was affiliated with several organization, including the Polish Academy of Sciences and the Warsaw School of Information Technology. He served as the Director of the Institute of Computer Science at the Warsaw University of Technology (1989–96). Pawlak was known for his contribution to many branches of theoretical computer science. He was credited with introducing the rough set theory and also known for his fundamental works on it. He also introduced the Pawlak flow graphs, a graphical framework for reasoning from data. He was conferred with Order of Polonia Restituta in 1999. He was also a full member of Polish Academy of Sciences.
Education and career
Zdzislaw Pawlak was born on 10 November 1926 in Łódź, Poland. He graduated from a public elementary school in 1939. In 1946 he passed his Baccalaureate Diploma examination, and in 1947 he began studies at the Faculty of Electrical Engineering of the Łódź University of Technology. Two years later, he moved to the Faculty of Telecommunications at the Warsaw University of Technology. He received his M.Sc. degree in Telecommunications in 1951, after which he worked in the Institute of Mathematics of the Polish Academy of Sciences until 1957.
References
External links
The International Rough Set Society
1926 births
2006 deaths
Polish computer scientists
Polish mathematicians
Scientists from Łódź
Warsaw University of Technology alumni
Academic staff of the Warsaw University of Technology
Members of the Polish Academy of Sciences
Łódź University of Technology alumni |
https://en.wikipedia.org/wiki/Meurs%20Challenger | Meurs Challenger is an online graph visualization program, with data analysis and browsing.
The software supports several graph layout algorithms, and allows the user to interact with the nodes. The displayed data can be filtered using textual search, node and edge type, or based on the graph distance between nodes. Written in ActionScript, the program runs on Windows, Linux, macOS and other platforms that support the Adobe Flash Player.
Meurs Challenger was the winner at the 2011 edition of the International Symposium on Graph Drawing, in the large graph category.
It is publicly available as a Facebook application, which displays the network graph of the user's friends.
Implementation approach
The main problem in network visualization is to reduce data complexity by projecting a multivariate data matrix onto a lower-dimensional planar display space, which is achieved by proper node positioning.
Meurs Challenger addresses this by combining several different approaches:
force-based algorithms
modularization techniques
clustering
node overlap minimization, which is achieved by guaranteeing a minimum edge length between two linked nodes
edge length uniformization, using an algorithm that minimizes the total edge length discrepancy of the projected graph
grid-based layouts
See also
Graph (discrete mathematics)
Graph drawing
Graph theory
Graph (data structure)
Social network analysis software
GraphML
Notes
External links
Official website
Facebook application
References
.
.
.
Graph drawing software |
https://en.wikipedia.org/wiki/Bad%20Cat | Bad Cat () is a 2016 Turkish adult computer-animated action comedy film directed by Mehmet Kurtuluş and Ayşe Ünal. The film is based on the comic strip Kötü Kedi Şerafettin by Bülent Üstün. It is a self-funded independent film, and some its profits originated from product placement.
Bad Cat premiered on February 5, 2016, in Turkey and at the Annecy International Animation Film Festival in 2016. The film was released on Tubi on April 20, 2023. A video game adaptation, titled The Bad Cat, was released on mobile devices shortly after the film's release.
Plot
In an apartment in Istanbul. Shero, a crass and short-tempered tabby cat owned by a man named Tank, is seen smoking in the bathroom. He then sends his associates Rifki the seagull and Riza the rat, to obtain liquor for a barbecue that night. Another cat, Blackie, informs Shero of an attractive Siamese cat named Princess in a nearby apartment. When Princess's cartoonist owner leaves for work, Shero and Blackie sneak into the apartment to seduce her, but this leads to a series of accidents which results in Princess's death. The cartoonist returns home to find Princess dead and furiously attacks Shero and Blackie. Blackie is killed, and Shero engages the cartoonist in a fight that results in the cartoonist's death when they both tumble out the window. On his way back home, Shero meets a kitty named Taco, who claims to be Shero's illegitimate son. Shero rejects Taco and goes to steal some fish from Hazel, Tank's landlady. Hazel retaliates by threatening Tank with eviction unless he can cover months of unpaid rent by the next day. An angered Tank ejects Shero from his home and blocks every possible entrance. While smoking and sulking, Shero witnesses a beautiful Angora cat named Misscat being harassed by a pair of dogs and rescues her by beating her assailants. Shero attempts to seduce Misscat but is turned down and told to meet her again on the same rooftop that night. Meanwhile, the brainless cadaver of the cartoonist is revived by an ambulance defibrillator. The cartoonist hijacks the ambulance and begins a vengeful search for Shero.
As Shero obtains a bouquet for Misscat, the cartoonist finds the two dogs and forces them to lead him to Shero; Taco, who was rummaging for food, witnesses this transaction and follows them. Shero and Misscat rendezvous and prepare to make love when they are captured and tied up by the dogs and the cartoonist. Before the cartoonist can electrocute Shero, Taco appears and frees Shero, who fights the cartoonist and throws him off the building and into a dumpster, along with the dogs. Taco is once again brushed off by Shero, and he reveals that his mother, a past mate of Shero's named Mimosa, is dead. Shero and Taco bond after a brief exchange of fists and Taco helps Shero attempt to obtain liquor from the local grocer. However, the cartoonist, having hijacked a passing garbage truck, absconds with Taco during the mission, forcing Shero into a chase. Shero rescues T |
https://en.wikipedia.org/wiki/Computer-assisted%20structure%20elucidation | Computer-assisted structure elucidation (or CASE) is the technique of using software to generate all possible molecular structures that are consistent with a particular set of spectroscopic data.
The subject has been often reviewed. Available CASE software include LSD, SENECA, COCON, CMC-se, and Structure Elucidator.
See also
Computational chemistry
Nuclear magnetic resonance spectroscopy
References
Computational chemistry |
https://en.wikipedia.org/wiki/Learning%20rule | An artificial neural network's learning rule or learning process is a method, mathematical logic or algorithm which improves the network's performance and/or training time. Usually, this rule is applied repeatedly over the network. It is done by updating the weights and bias levels of a network when a network is simulated in a specific data environment. A learning rule may accept existing conditions (weights and biases) of the network and will compare the expected result and actual result of the network to give new and improved values for weights and bias. Depending on the complexity of actual model being simulated, the learning rule of the network can be as simple as an XOR gate or mean squared error, or as complex as the result of a system of differential equations.
The learning rule is one of the factors which decides how fast or how accurately the artificial network can be developed. Depending upon the process to develop the network there are three main models of machine learning:
Unsupervised learning
Supervised learning
Reinforcement learning
Background
A lot of the learning methods in machine learning work similar to each other, and are based on each other, which makes it difficult to classify them in clear categories. But they can be broadly understood in 4 categories of learning methods, though these categories don't have clear boundaries and they tend to belong to multiple categories of learning methods -
Hebbian - Neocognitron, Brain-state-in-a-box
Gradient Descent - ADALINE, Hopfield Network, Recurrent Neural Network
Competitive - Learning Vector Quantisation, Self-Organising Feature Map, Adaptive Resonance Theory
Stochastic - Boltzmann Machine, Cauchy Machine
It is to be noted that though these learning rules might appear to be based on similar ideas, they do have subtle differences, as they are a generalisation or application over the previous rule, and hence it makes sense to study them separately based on their origins and intents.
Hebbian Learning
Developed by Donald Hebb in 1949 to describe biological neuron firing. In the mid-1950s it was also applied to computer simulations of neural networks.
Where represents the learning rate, represents the input of neuron i, and y is the output of the neuron. It has been shown that Hebb's rule in its basic form is unstable. Oja's Rule, BCM Theory are other learning rules built on top of or alongside Hebb's Rule in the study of biological neurons.
Perceptron Learning Rule (PLR)
The perceptron learning rule originates from the Hebbian assumption, and was used by Frank Rosenblatt in his perceptron in 1958. The net is passed to the activation (transfer) function and the function's output is used for adjusting the weights. The learning signal is the difference between the desired response and the actual response of a neuron. The step function is often used as an activation function, and the outputs are generally restricted to -1, 0, or 1.
The weights are updated with
wher |
https://en.wikipedia.org/wiki/Basis%20path%20testing | In software engineering, basis path testing, or structured testing, is a white box method for designing test cases. The method analyzes the control-flow graph of a program to find a set of linearly independent paths of execution. The method normally uses McCabe cyclomatic complexity to determine the number of linearly independent paths and then generates test cases for each path thus obtained. Basis path testing guarantees complete branch coverage (all edges of the control-flow graph), but achieves that without covering all possible paths of the control-flow graph the latter is usually too costly. Basis path testing has been widely used and studied.
See also
DD-path testing
References
Further reading
Software testing |
https://en.wikipedia.org/wiki/2012%E2%80%9313%20Scunthorpe%20United%20F.C.%20season | The 2012–13 season is Scunthorpe United F.C.'s second consecutive in Third Tier of the Football League.
League One data
Standings
Results summary
Result round by round
Squad
Statistics
|-
|colspan="14"|Players currently on loan:
|-
|colspan="14"|Players featured for club who have left:
|}
Goalscoring record
Disciplinary record
Transfers
In
Loans in
Out
Loans out
Contracts
Fixtures & Results
Pre-season
League One
FA Cup
League Cup
League Trophy
Overall summary
Summary
Score overview
References
2012–13
2012–13 Football League One by team |
https://en.wikipedia.org/wiki/Actian%20Vector | Actian Vector (formerly known as VectorWise) is an SQL relational database management system designed for high performance in analytical database applications.
It published record breaking results on the Transaction Processing Performance Council's TPC-H benchmark for database sizes of 100 GB, 300 GB, 1 TB and 3 TB on non-clustered hardware.
Vectorwise originated from the X100 research project carried out within the Centrum Wiskunde & Informatica (CWI, the Dutch National Research Institute for Mathematics and Computer Science) between 2003 and 2008.
It was spun off as a start-up company in 2008, and acquired by Ingres Corporation in 2011.
It was released as a commercial product in June, 2010, initially for 64-bit Linux platform, and later also for Windows.
Starting from 3.5 release in April 2014, the product name was shortened to "Vector".
In June 2014, Actian Vortex was announced as a clustered massive parallel processing version of Vector, in Hadoop with storage in HDFS. Actian Vortex was later renamed to Actian Vector in Hadoop.
Technology
The basic architecture and design principles of the X100 engine of the VectorWise database were well described in two Phd theses of VectorWise founders Marcin Żukowski: "Balancing Vectorized Query Execution with Bandwidth-Optimized Storage" and Sandor Héman: "Updating Compressed Column Stores", under supervision of another founder, professor Peter Boncz. The X100 engine was integrated with Ingres SQL front-end, allowing the database to use the Ingres SQL syntax, and Ingres set of client and database administration tools.
The query execution architecture makes use of "Vectorized Query Execution" processing in chunks of cache-fitting vectors of data. This allows to involve the principles of vector processing and single instruction, multiple data (SIMD) to perform the same operation on multiple data simultaneously and exploit data level parallelism on modern hardware. It also reduces overheads found in traditional "row-at-a-time processing" found in most RDBMSes.
The database storage is in a compressed column-oriented format, with scan-optimised buffer manager. In Actian Vortex in HDFS the same proprietary format is used.
Loading big amounts of data is supported through direct appends to stable storage, while small transactional updates are supported through patent-pending Positional Delta Trees (PDTs) specialized B-tree-like structures of indexed differences on top of stable storage, which are seamlessly patched during scans, and which are transparently propagated to stable storage in a background process. The method of storing differences in patch-like structures and rewriting the stable storage in bulk made it possible to work in a filesystem like HDFS, in which files are append-only.
History
A comparative Transaction Processing Performance Council TPC-H performance test of MonetDB carried out by its original creator at Centrum Wiskunde & Informatica (CWI) in 2003 showed room for improvement in its |
https://en.wikipedia.org/wiki/Kansa%20method | The Kansa method is a computer method used to solve partial differential equations. Its main advantage is it is very easy to understand and program on a computer. It is much less complicated than the finite element
method. Another advantage is it works well on multi variable problems. The finite element method is complicated when working with more than 3 space variables and time.
The Kansa Method can be explained by an analogy to a basketball court with many light bulbs suspended all across the ceiling. You solve for the brightness of each bulb so that the desired light intensity directly on the floor of the basketball court under each bulb solves the differential equation at that point. So if the basketball court has 100 bulbs suspended over it; the light intensity at any point on the floor of the basketball court
approaches a light intensity that approximately solves the differential equation at any location on the floor of the basketball court. A simple computer program can solve by iteration for the brightness of each bulb, which makes this method easy to program. This method does not need weighted residuals (Galerkin), integration, or advanced mathematics.
E. J. Kansa in very early 1990s made the first attempt to extend radial basis function (RBF), which was then quite popular in scattered data processing and function approximation, to the solution of partial differential equations in the strong-form collocation formulation. His RBF collocation approach is inherently meshless, easy-to-program, and mathematically very simple to learn. Before long, this method became known as the Kansa method in the academic community.
Because the RBF uses the one-dimensional Euclidean distance variable irrespective of dimensionality, the Kansa method is independent of dimensionality and geometric complexity of problems of interest. The method is a domain-type numerical technique in the sense that the problem is discretized not only on the boundary to satisfy boundary conditions but also inside domain to satisfy governing equation.
In contrast, there is another type of RBF numerical methods, called boundary-type RBF collocation method, such as the method of fundamental solution, boundary knot method, singular boundary method, boundary particle method, and regularized meshless method, in which the basis functions, also known as kernel function, satisfy the governing equation and are often fundamental solution or general solution of governing equation. Consequently, only boundary discretization is required.
Since the RBF in the Kansa method does not necessarily satisfy the governing equation, one has more freedom to choose a RBF. The most popular RBF in the Kansa method is the multiquadric (MQ), which usually shows spectral accuracy if an appropriate shape parameter is chosen.
Description
The Kansa method, also called modified MQ scheme or MQ collocation method, originated from the well-known MQ interpolation. The efficiency and applicability of this |
https://en.wikipedia.org/wiki/Gold%20%28Australian%20TV%20channel%29 | Gold (stylised as WIN GOLD) is an Australian advertorial datacasting channel that launched on 1 May 2012 by the WIN Corporation. It is available to homes in most regional WIN Television viewing areas on LCN 85. The channel broadcasts mostly infomercials, as well as education, lifestyle, community programming as well as television classics from the Crawfords library.
History
On 26 April 2012, a test broadcast commenced on LCN 84 with the channel name "TBA". On 30 April 2012, the broadcast changed to a screen informing viewers that WIN Gold would commence on 1 May 2012. The channel launched at 6am and was initially branded as "WIN Gold", until it was changed to simply Gold on 5 May 2012.
With the March 2016 revival of WIN HD on LCN 80 (then-occupied by 9Gem) and launch of 9Life on LCN 84 (then-occupied by Gold), WIN's channel listing was reshuffled to mirror Nine's metropolitan listing with 9Gem on LCN 82, 9Go! on LCN 83, 9Life on LCN 84, Extra on LCN 85 and Gold on LCN 86.
On 1 July 2016, WIN switched its primary affiliation from the Nine Network to Network 10. Consequently, WIN's channel listing was reshuffled to place WIN Bold on LCN 81, WIN Peach on LCN 82, TVSN on LCN 84 and Gold on LCN 85.
On 1 July 2021, WIN switched back its primary affiliation from Network 10 to the Nine Network. Consequently, WIN's channel listing was reshuffled to place 9Gem on LCN 81, 9Go! on LCN 82 and 9Life on LCN 83, while TVSN and Gold would continue to broadcast on LCN 84 and LCN 85.
Availability
Gold is available in standard definition through WIN's stations: RTQ Queensland, WIN Southern New South Wales & ACT, NRN in Northern New South Wales, VTV Victoria, TVT Tasmania, MTN Griffith, STV Mildura, MGS Mount Gambier and LRS Riverland.
The channel was previously available on WIN's Nine-branded metropolitan stations NWS Adelaide and STW Perth on LCN 94 until 2013 when both stations were bought by the Nine Network, owned by Nine Entertainment. In these two cities Gold was replaced by Extra, then also on LCN 94 and currently on LCN 97, which still is Nine's infomercial datacast channel.
Gold 2
WIN launched a second datacasting channel, Gold 2, on 13 July 2013 as a five-hour timeshift of Gold located on LCN 82. It was also shortly available in Perth on LCN 92, as WIN Corporation had control over the station until 30 September 2013, when it was taken over by Nine Entertainment, the owners of the Nine Network. As a result, Gold 2 was replaced by Extra 2 in Perth. NWS in Adelaide did not transmit Gold 2 because the station was already under Nine's control at the time of the channel's launch, but it did launch Nine's counterpart, Extra 2, on 1 July 2013, 12 days before the channel's launch.
Gold 2 was replaced by the Nine Network's metropolitan informercial channel Extra on 19 January 2016. Extra later moved to LCN 85 on WIN's stations.
See also
List of digital television channels in Australia
References
External links
Gold
Television channels and stations es |
https://en.wikipedia.org/wiki/LV-ROM | LV-ROM is an optical disc format developed by Philips Electronics to integrate analog video and computer software for interactive multimedia. The LV-ROM is a specialized variation of the CAV Laserdisc. LV-ROM is an initialism for "LaserVision Read-Only Memory".
Like Laserdisc, LV-ROM discs store analog audio and video by encoding it in pulse-width modulation. However, LV-ROM also stores computer files via the Advanced Disc Filing System, which is the file system used by Acorn Computers. An LV-ROM disc can store up to 324 megabytes of digital information, or up to 54,000 frames of analog video (36 minutes with a frame rate of 25 fps) per side.
The format had only one application: to publish documentary video, children's writings, and other historical records compiled from 1984 to 1986 for the BBC Domesday Project. The Domesday Project LV-ROM discs were played using a BBC Master computer connected via SCSI-1 to a Philips AIV VP415 Laserdisc player. A genlock enabled the software stored on the LV-ROM to display computer graphics over the analog video on the BBC Master's computer screen. The buttons and menus of the user interface were accessed with a trackball.
LD-ROM
In the early 1990s, Pioneer Corporation deployed a variation of the 30-cm LV-ROM with a different file system and a 540 megabyte capacity. This disc format, called LD-ROM, stored the software for a home entertainment system that Pioneer introduced in 1993. This system, the Pioneer LaserActive, was a cross-platform video game console, Laserdisc player, and CD player.
LD-ROMs owe their greater capacity to a design for constant linear velocity (CLV) playback. Like magnetic tape, the playback speed corresponds with picture quality and audio definition of analog audio-video streams. Since Pioneer intended LD-ROMs primarily for computer software, they chose CLV technology to increase the file storage capacity.
Specialized LD-ROM discs include the MEGA LD (for Sega Mega CD/Sega CD software), the LD-G (for karaoke data or digital photo albums; similar to CD+G), and the LD-ROM² (for PC-Engine CD-ROM² software). Such software was published either on 30-centimeter discs or on 20-centimeter discs with a lesser storage capacity.
Whereas LV-ROM is an abbreviation of "LaserVision Read-Only Memory", LD-ROM is an abbreviation of "LaserDisc Read-Only Memory".
References
See also
Rotating disc computer storage media
LaserDisc
Pioneer Corporation products
Products introduced in 1986
Video storage |
https://en.wikipedia.org/wiki/ESPN%20BottomLine | BottomLine is ESPN's lower third sports information ticker. It is uniform in design and used on all ESPN networks. It displays current sports scores, stats, and headlines in a 'push-then-scroll' format. It also serves as a display for urgent information, such as breaking sports news, breaking significant national news from ESPN sister networks ABC and FX, updated scores, a rain delay notification, or the move of a game from one ESPN network to another. BottomLine is also used on the TSN channels in Canada and on the Latin American and Brazilean ESPN channels.
On special occasions, a customized version of the ticker may be used; some examples are Pi day, in which a Pi symbol is placed next to the ESPN logo, and the 4th of July, when an American flag surrounds the ESPN logo.
History
SportsCenter debuted a new graphics package on April 6, 2009, with the "rundown" graphic (shown during the daytime editions) moved to the left side of the screen. A new BottomLine was also released that day on ESPN, ESPN2, ESPN Classic, and ESPNU but it was quickly removed and reverted to the old BottomLine (which had been used since April 2003) because of major technical difficulties. The new BottomLine was functional during coverage of the 2009 NFL Draft and the 2009 NBA Draft, but the issues were fixed and the it eventually returned on July 8 of the same year. Yet another redesigned BottomLine was launched at 11 PM ET on June 22, 2014, to coincide with a dramatic redesign of the SportsCenter studio.
On August 20, 2018, a refreshed BottomLine launched. The BottomLine switched to a "flipper" format, used two lines of text, and no longer showed the logos of teams during score updates. In addition, the rightmost third of the BottomLine now contains a rotating display of promotions for ESPN and ESPN+ programming, which can also be used to display breaking news or program advisories when needed.
Variants
ESPN 2
In 1995, ESPN2 debuted a sports news ticker, dubbed by Production Assistant Onnie Bose as the "BottomLine Update." It is a persistent ticker which stayed at the bottom of the screen at all times during most programming, unlike ESPN, who only showed their own at the :18 (formerly :28) and :58 of each hour (accompanied by an audio cue, which has since been adapted as the alert tone for ESPN's mobile apps) and during select programming. The introductory audio cue was removed when the BottomLine graphics were updated in 2009. ESPN2's sports telecasts were also among the first to regularly use a scoring bug. In later years, ESPN2 would also participate in "Full Circle" telecasts, productions of a single game aired across multiple ESPN services to provide additional features and angles.
ESPNEWS
ESPNEWS's "bottom line" — a small rectangular area at the bottom one-fifth of the screen flashing scores—is more in-depth than the one airing on ESPN's other networks. It contains not only scores but also statistics and brief news alerts about the day's happenings in sport |
https://en.wikipedia.org/wiki/Mikkel%20Thorup | Mikkel Thorup (born 1965) is a Danish computer scientist working at University of Copenhagen.
He completed his undergraduate education at Technical University of Denmark and his doctoral studies at Oxford University in 1993. From 1993 to 1998, he was at University of Copenhagen and from 1998 to 2013 he was at AT&T Labs-Research in New Jersey. Since 2013 he has been at the University of Copenhagen as a Professor and Head of Center for Efficient Algorithms and Data Structures (EADS).
Thorup's main work is in algorithms and data structures. One of his best-known results is a linear-time algorithm for the single-source shortest paths problem in undirected graphs (Thorup, 1999).
With Mihai Pătraşcu he has shown that simple tabulation hashing schemes achieve the same or similar performance criteria as hash families that have higher independence in worst case, while permitting speedier implementations.
Thorup has been editor of the area algorithm and data structures for Journal of the ACM, and has also served on the editorial boards of SIAM Journal on Computing, ACM Transactions on Algorithms, and the Theory of Computing.
He has been a Fellow of the Association for Computing Machinery since 2005 for his contributions to algorithms and data structures. He belongs to the Royal Danish Academy of Sciences and Letters since 2006. In 2010 he was bestowed the AT&T Fellows Honor for “outstanding innovation in algorithms, including advanced hashing and sampling techniques applied to AT&T's Internet traffic analysis and speech services.”
In 2011 he was co-winner of the David P. Robbins Prize from the Mathematical Association of America for solving, to within a constant factor, the classic problem of stacking blocks on a table to achieve the maximum possible overhang, i.e., reaching out the furthest horizontal distance from the edge of the table. “The papers describe an impressive result in discrete mathematics; the problem is easily understood and the arguments, despite their depth, are easily accessible to any motivated undergraduate.”
In 2021 he was co-winner of the Fulkerson Prize for his work with Ken-Ichi Kawarabayashi on fast deterministic algorithms for edge connectivity.
Selected publications
Announced at FOCS 1997.
Preliminary version published in FOCS 2006, .
.
2011 MAA Robbins Award.
References
Living people
Danish computer scientists
Theoretical computer scientists
Fellows of the Association for Computing Machinery
1965 births |
https://en.wikipedia.org/wiki/%C3%89cole%20des%20technologies%20num%C3%A9riques%20appliqu%C3%A9es | The École des technologies numériques appliquées (ETNA) is a French private school of computer science localized at Ivry-sur-Seine. Created in 2005 by Patrice Dumoucel, the school has been part of IONIS Education Group since 2006. The certification delivered by the school are recognized by the French state
The school is from the same group as EPITA and EPITECH. The partnership ETNA/EPITA/EPITECH allows students to use the equipment to the two other universities. ETNA graduates can proceed to others courses at the IONIS School of Technology and Management or a MBA at the Institut supérieur de gestion. Students of ETNA can prepare major certifications (Microsoft, Cisco Systems, Oracle).
Curriculum
The course is a three-year dual education system and includes 200 hours of lessons and 400 hours of practical cases study per year.
Two specializations are available : software development or system and computer network.
Students choose one of these two in the second year.
The main lessons of the first year of study offers the following subjects: management, database, IPv4 network, web technologies, system administration, PHP / web, culture computer, English, mathematics and method.
The second year can address the following topics: project, business valuation, English, mathematics, drafting and document analysis, and marketing / business / management.
During the last year, the curriculum includes the subjects: project, English, mathematics, drafting and document analysis, marketing / business / management and psychology work.
Since September 2013, the school will start a new program in 2 years after French Baccalauréat which will be entirely free. 250 tickets are available. The innovation is that there are graduate students who will pay for the students in training (250 euros per month during three years).
External links
References
Engineering universities and colleges in France
Universities in Île-de-France
Buildings and structures in Val-de-Marne
Computer science education
Educational institutions established in 2005
Private schools in France
2005 establishments in France |
https://en.wikipedia.org/wiki/Symmetric%20hash%20join | The symmetric hash join is a special type of hash join designed for data streams.
Algorithm
For each input, create a hash table.
For each new record, hash and insert into inputs hash table.
Test if input is equal to a predefined set of other inputs.
If so, output the records.
See also
Data stream management system
Data stream mining
References
Hashing
Join algorithms |
https://en.wikipedia.org/wiki/Being%20Lara%20Bingle | Being Lara Bingle was an Australian reality television series that premiered on 12 June 2012 on Network Ten. The series followed the misadventures of model and minor television personality, Lara Bingle.
In April 2013, Network Ten expressed that "the extreme youth focus that led to programs like (the similarly unsuccessful) The Shire and Being Lara Bingle being commissioned is not quite right for us" and that Ten would now move on from that focus.
Cast
Lara Bingle Worthington – Model and TV personality
Hermione Underwood – Lara's former manager and best friend
Josh Bingle – Lara's brother
Sharon Bingle – Lara's mother
Ratings
The series aired in the 8:00 pm–8:30 pm timeslot on Tuesdays. Ratings aggregated by OzTam subsequent to the premiere of the series indicate that the premiere episode received an estimated viewership of 925,000 viewers, during which a peak of 1.3 million was reached.
Notes
Location
The reality series was filmed at Bondi Beach in New South Wales and other locations including Los Angeles, Melbourne, India, and New Zealand.
See also
WAG Nation
The Stafford Brothers
References
Network 10 original programming
2012 Australian television series debuts
2012 Australian television series endings
2010s Australian reality television series
English-language television shows |
https://en.wikipedia.org/wiki/Luna%20Blanca | Luna Blanca is a 2012 Philippine television drama fantasy series broadcast by GMA Network. The series served as a sequel to the 2008 Philippine television series Luna Mystika. Directed by Dominic Zapata, it stars Jillian Ward, Mona Louise Rey, Bea Binene, Barbie Forteza, Bianca King and Heart Evangelista. It premiered on May 21, 2012 on the network's Telebabad line up replacing Biritera. The series concluded on October 26, 2012 with a total of 115 episodes. It was replaced by Temptation of Wife in its timeslot.
The series is streaming online on YouTube.
Cast and characters
Lead cast
Jillian Ward, Bea Binene and Bianca King as Luna Sandoval / Luna De Jesus / Cara Amor Montecines
Mona Louise Rey, Barbie Forteza and Heart Evangelista as Blanca S. Buenaluz
Supporting cast
Camille Prats and Lani Mercado as Rowena Sandoval
Raymart Santiago and Christopher de Leon as Luis Buenaluz
Chynna Ortaleza and Carmi Martin as Divine Alvarez-Buenaluz
Marissa Delgado as Consuelo Buenaluz
Gina Alajar as Linda De Jesus
Kristofer Martin and Mark Herras as Joaquin "Aki" Alvarez
Nicky Castro and Derrick Monasterio as Kiko De Jesus
Carlos Morales as Devolas / Diego Montecines
Dante Rivero as Igme Sagrado
Mercedes Cabral as Marietta Montecines
Ryza Cenon as Ashley Alvarez
Buboy Villar as Samuel "Samboy" De Jesus
Allan Paule as Crispin De Jesus
Guest cast
Marco Alcaraz as Alex
Dexter Doria as Eloisa
Jan Marini Alano as Belen
Yassi Pressman as Kate
Jade Lopez as Roma
Bettina Carlos as Cherry
Luis Alandy as Teddy
Overview
Associate producer, Jonathan Pachica, said that Luna Blanca is a sequel to Luna Mystika, GMA Network's 2008 drama series, which also starred Heart Evangelista. It premiered on November 17, 2008 and concluded on March 6, 2009. The prequel's story revolves around the twins' lives and their relationship with each other. On the other hand, the story is set 30 years later, which is about the twin sisters and their journey toward discovering their ancestry and fulfilling their personal destinies.
The connection between these two series was presented during Luna Blanca's premiere episode on May 21, 2012, where selected clips from Luna Mystika was shown while Rowena, the character played by Camille Prats, narrating a story to a bunch of children about the Sagrado family and the engkanto-blooded twins Luna and Celestina and how the latter transforms into a monster every time the full moon shines brightly at night who intends to scare the children. Lolo Igme, Rowena's grandfather portrayed by Dante Rivero (who was also part of the prequel as Don Joaquin Sagrado), came and asked Rowena not to make fun of her origin again. In the story, Rowena is revealed to be the last descendant of Luna Mystika; one thing she does not believe because she thinks that the engkanto and other supernatural creatures are just myth or merely imagination. Her disbelief persists until she encounters a black, smoke-like creature known as the engkanto in the forest |
https://en.wikipedia.org/wiki/Net%20bias | Net bias (or network bias) is the counter-principle to net neutrality, which indicates differentiation or discrimination of price and the quality of content or applications on the Internet by ISPs. Similar terms include data discrimination, digital redlining, and network management.
Net bias occurs when an ISP drops packets or denies access based on artificially induced conditions such as simulating congestion or blocking packets, despite the fact that ample capacity exists to carry traffic. Examples (models) of net bias include tiered service (specialized service), metering, bandwidth throttling, and port blocking. These forms of net bias are achieved by technical advancements of the Internet Protocol.
The idea of net bias can arise from political and economic motivations and backgrounds, which create some concerns regarding data discrimination arising from political and economic interests. Non-discrimination means that one class of Internet customers may not be favored over another. According to this view, the Internet should continue "to operate in a nondiscriminatory manner, both in terms of how subscribers access and receive Internet transmitted services and how content and other service providers reach subscribers." Every internet user should have equal upload and download capabilities on every network.
Net neutrality
The principle of equal treatment of traffic, called "Net Neutrality" by proponents, is not enshrined in law in the United States but is supported by some regulations. Most of the debate around the issue has centered on tentative plans, now postponed, by large Internet carriers to offer preferential treatment of traffic from certain content providers for a fee. Network neutrality is a set of rules that forbid network owners from discriminating against independent applications (instead of against competing ISPs, as with open access).
Models of net bias
Tiered service (specialized service, bandwidth partitioning)
Tiered service is one of the strategies employed to change Internet pricing and involves an intent to have flexibility in quality of service (QoS) on the Internet. Tiered service allows ISPs to create and manage speed-related subscriber tiers. In other words, this model partitions bandwidth and provides different levels of peering requirements and offers transit clients different amounts of throughput. This model stems from the perception of technical and economic limitations in the broadband industry. As technology develops, the demand for faster and higher performance of communication networks and the customer demand for bandwidth-intensive services, such as streaming videos, have increased. These situations result in network congestion that is mainly driven by a small number of heavy users. Moreover, ISPs argue that existing flat-rate plans do not enable them to cover the additional cost required to manage heavier network traffic. Accordingly, this model may allow ISPs to reach different market segments with d |
https://en.wikipedia.org/wiki/ERS%203500%20and%20ERS%202500%20series | Ethernet Routing Switch 3500 series and Ethernet Routing Switch 2500 series or ERS 3500 and ERS 2500 in data computer networking terms are stackable routing switches designed and manufactured by Avaya.
The Switches can be stacked up to eight units high through a 'stacking' configuration; Avaya markets this capability under the term 'Avaya Virtual Enterprise Network Architecture (VENA) Stackable Chassis'. This series of Switches consists of six ERS 3500 models, the ERS 3526T, ERS 3526T-PWR+, ERS 3510GT, ERS 3510GT-PWR+, ERS3524GT, ERS3524GT-PWR+ and four different ERS 2500 models, the ERS 2526T, ERS 2526T-PWR, ERS 2550T and the ERS 2550T-PWR. The 'PWR' suffix designation identifies the Switch that can provide Power-over-Ethernet on the copper Ethernet ports, the '+' suffix designation indicates that the Switch can provide PoE plus on the copper ports. These Switches are all covered by Avaya's Lifetime warranty.
History
ERS 3500
This series of Switches became available in April 2012 with software release 5.0
ERS 2500
This product line became available in 2007 with software release 4.0 and the device was demonstrated in March at the 'Spring VoiceCon 2007'. In March 2007 the product started to ship, and then in May 2007 a detailed evaluation between this switch and two competitor's switches identified that this switch had a better performance and better total cost of ownership. In 2008 Layer 3 routing support, secure web access with https and TACACS+ were added to the software in version 4.2. In January 2008 another detailed evaluation of this systems was performed by Tolly Enterprises, LLC. comparing the 2500 systems to Catalyst 2960-24T and HP ProCurve 2626 and 2650 systems. In May 2009 Cisco published an evaluation and comparison between this switch and its 2000 and 3000 series switches as competitor published fear, uncertainty and doubt about the product not having the ability to do routing, even after the product had released the new routing software almost a year earlier. Later in November 2010 IGMP multicast and IPv6 management was added in version 4.3. As of February 2012 the software version 4.4 is the latest software released for the product which was currently published in August 2011.
Scaling
ERS 3500 Series
The ERS 3500 Series consists or four gigabit Ethernet models the 3510GT, 3510GT-PWR+, 3524GT, and 3524GT-PWR+ along with 2 fast Ethernet models 35265T, and 3526T-PWR+. The Switch leverages 802.1AB link layer discovery protocol and LLDP media endpoint discover and auto discovery and auto configuration to allow the Switch to automatically configure or reconfigure itself for new phone installs or phone movement in 1 minute.
ERS 2500 Series
The switch can be installed initially as standalone and then field-upgraded via a license to support resilient 'Stackable Chassis' configuration of up to eight Switches. The stack-enabled version of the ERS 2500 Switches will not require a license kit or license file.
ERS 2550T and 2550T-PWR |
https://en.wikipedia.org/wiki/DELPH-IN | Deep Linguistic Processing with HPSG - INitiative (DELPH-IN) is a collaboration where computational linguists worldwide develop natural language processing tools for deep linguistic processing of human language. The goal of DELPH-IN is to combine linguistic and statistical processing methods in order to computationally understand the meaning of texts and utterances.
The tools developed by DELPH-IN adopt two linguistic formalisms for deep linguistic analysis, viz. head-driven phrase structure grammar (HPSG) and minimal recursion semantics (MRS). All tools under the DELPH-IN collaboration are developed for general use of open-source licensing.
Since 2005, DELPH-IN has held an annual summit. This is a loosely structured unconference where people update each other about the work they are doing, seek feedback on current work, and occasionally hammer out agreement on standards and best practice.
DELPH-IN technologies and resources
The DELPH-IN collaboration has been progressively building computational tools for deep linguistic analysis, such as:
LKB system (Linguistic Knowledge Builder): a grammar engineering environment where linguists can build unification grammars with the Head-driven Phrase Structure Grammar formalism
PET parser (Platform for Experimentation with efficient HPSG processing Techniques): an open source parser which produces HPSG parse trees with Minimal Recursion Semantics (MRS) outputs
ACE processor (Answer Constraint Engine): an efficient system to process DELPH-IN grammars that provide HPSG syntactic parses with MRS outputs. The latest version of ACE is able to generate natural language sentences.
LOGON infrastructure is a collection of software and DELPH-IN grammars to provide transfer-based machine translation. The LOGON approach to machine translation has proven to provide quality oriented hybrid (rule-based and stochastic) translations.
Other than deep linguistic processing tools, the DELPH-IN collaboration supplies computational resources for Natural Language Processing such as computational HPSG grammars and language prototypes e.g.:
DELPH-IN grammars: a catalogue of computational HPSG grammar hand-crafted to capture deep linguistics analysis specific to the respective languages
LinGO Grammar Matrix: an open-source starter-kit for rapid prototyping of precision broad-coverage grammars compatible with the LKB. It contains a library of common language phenomena that computational grammarians can inherit for their HPSG grammars.
CLIMB libraries (Comparative Libraries of Implementations with Matrix Basis): an extended language library built on the Grammar Matrix. The objective of the CLIMB library is to maintain alternative analyses of the same phenomenon across different languages to test their impact on long-term grammar development.
Another range of DELPH-IN resources are not unlike the data use for shallow linguistic processing, such as Text_corpus and treebanks:
MRS Test Suite: a short but representative set |
https://en.wikipedia.org/wiki/William%20Reed%20Ltd | William Reed is a digital, high value data, and events business serving the food and drinks sector. By 2021, it had offices in five locations - Crawley, London, Montpellier, Singapore and Chicago.
Early history
In 1862, William Reed founded his own publishing company, William Reed Publishing in London. With the contacts he had made working in the grocer industry and the knowledge he had gained, he launched his first journal, The Grocer, from his premises based in Bow Lane, London. The Grocer gave readers the latest news and analysis of the trade. A year later the Wine Trade Review launched as a supplement to The Grocer.
By 1864, Reed targeted the brewing industry with Brewers Journal, and its supplement, Hop & Malt Trades Review, and in 1868 he added Tobacco Trade Review to his company's magazine line up. Reed died in 1920; at that time The Grocer was his company's best-known publication, and was used by the Ministry of Food to make announcements.
After Reed's death, his publishing company continued to be operated by his son.
In 2021, the company continues to be owned by later generations of the same family, as the company William Reed Ltd based in Crawley, Sussex.
Brands
References
External links
Official website
Magazine publishing companies of the United Kingdom
Companies based in Crawley
1862 establishments in the United Kingdom |
https://en.wikipedia.org/wiki/April%201963 | The following events occurred in April 1963:
April 1, 1963 (Monday)
The long-running American TV soap opera General Hospital made its début on the ABC network. On the same afternoon, the first episode of NBC's hospital soap opera, The Doctors, premiered. General Hospital, set in the fictional town of Port Charles, New York, would begin its 60th year in 2022, while The Doctors, set in the fictional New England town of Madison, would end on December 31, 1982.
The Titan II-Gemini Coordination Committee was established to direct efforts to reduce longitudinal vibration (pogo oscillation) in the Titan II and to improve engine reliability.
Died: Quinim Pholsena, 47, the Foreign Minister of Laos, was assassinated by a soldier assigned to guard him. Quinim and his wife had returned home from a reception with the King, when Lance Corporal Chy Kong fired a machine gun at the couple. Minister Quinim was hit by 18 bullets, after which the guard "finished him off with a shot through the head".
April 2, 1963 (Tuesday)
Singapore television channel Saluran 5 Television Singapura began the regular service in the Asian nation, with four hours of programming every evening.
The Soviet Union launched Luna 4 at 8:04 am UT toward the Moon, using a curving path rather than a straight trajectory.
The Beatles began their Spring 1963 UK tour in Sheffield, England.
The Navy of Argentina began a revolt against the government of President José María Guido, with the insurrection starting at Puerto Belgrano. The rebellion would quietly end the next day.
Testifying before the Subcommittee on Manned Space Flight of the U.S. House Committee on Science and Astronautics, D. Brainerd Holmes, Director of Manned Space Flight, sought to justify a $42,638,000 increase in Project Gemini's actual 1963 budget over that previously estimated.
NASA signed an almost half-billion-dollar contract with McDonnell Aircraft Corporation for the Gemini spacecraft, with a cost-plus-fixed-fee estimate of $456,650,062 ($428,780,062 plus fixed fee of $27,870,000). The contract called for 13 flight-rated spacecraft, 12 to be used in space flight, as well as a docking simulator trainer, five boilerplates, and three static articles for vibration and impact ground tests.
April 3, 1963 (Wednesday)
Southern Christian Leadership Conference (SCLC) volunteers kicked off the Birmingham campaign in Birmingham, Alabama, against racial segregation in the United States, with a sit-in.
The Delaware Supreme Court upheld their state's law, unique in the United States, permitting the flogging of criminals. Although the penalty, dating from colonial days, had not been carried out for several years, a 20-year-old man had been given a probated sentence of 20 lashes for auto theft, then violated the probation.
April 4, 1963 (Thursday)
All 67 people on board Aeroflot Flight 25 were killed, one hour after the Ilyushin-18 plane had taken off from Moscow's Sheremetyevo Airport, bound for Krasnoyarsk.
Network Ten, the third tel |
https://en.wikipedia.org/wiki/Double%20pushout%20graph%20rewriting | In computer science, double pushout graph rewriting (or DPO graph rewriting) refers to a mathematical framework for graph rewriting. It was introduced as one of the first algebraic approaches to graph rewriting in the article "Graph-grammars: An algebraic approach" (1973). It has since been generalized to allow rewriting structures which are not graphs, and to handle negative application conditions, among other extensions.
Definition
A DPO graph transformation system (or graph grammar) consists of a finite graph, which is the starting state, and a finite or countable set of labeled spans in the category of finite graphs and graph homomorphisms, which serve as derivation rules. The rule spans are generally taken to be composed of monomorphisms, but the details can vary.
Rewriting is performed in two steps: deletion and addition.
After a match from the left hand side to is fixed, nodes and edges that are not in the right hand side are deleted. The right hand side is then glued in.
Gluing graphs is in fact a pushout construction in the category of graphs, and the deletion is the same as finding a pushout complement, hence the name.
Uses
Double pushout graph rewriting allows the specification of graph transformations by specifying a pattern of fixed size and composition to be found and replaced, where part of the pattern can be preserved. The application of a rule is potentially non-deterministic: several distinct matches can be possible. These can be non-overlapping, or share only preserved items, thus showing a kind of concurrency known as parallel independence, or they may be incompatible, in which case either the applications can sometimes be executed sequentially, or one can even preclude the other.
It can be used as a language for software design and programming (usually a variant working on richer structures than graphs is chosen). Termination for DPO graph rewriting is undecidable because the Post correspondence problem can be reduced to it.
DPO graph rewriting can be viewed as a generalization of Petri nets.
Generalization
Axioms have been sought to describe categories in which DPO rewriting will work. One possibility is the notion of an adhesive category, which also enjoys many closure properties. Related notions are HLR systems, quasi-adhesive categories and -adhesive categories, adhesive HLR categories.
The concepts of adhesive category and HLR system are related (an adhesive category with coproducts is a HLR system).
Hypergraph, typed graph and attributed graph rewriting, for example, can be handled because they can be cast as adhesive HLR systems.
Notes
Graph algorithms
Graph rewriting |
https://en.wikipedia.org/wiki/INSPIRE-HEP | INSPIRE-HEP is an open access digital library for the field of high energy physics (HEP). It is the successor of the Stanford Physics Information Retrieval System (SPIRES) database, the main literature database for high energy physics since the 1970s.
History
SPIRES was (in addition to the CERN Document Server (CDS), arXiv and parts of Astrophysics Data System) one of the main Particle Information Resources. A survey conducted in 2007 found that SPIRES database users wanted the portal to provide more services than the, at that time, already 30-year-old system could provide. On the second annual Summit of Information Specialists in Particle Physics and Astrophysics in May 2008, the physics laboratories CERN, DESY, SLAC and Fermilab therefore announced that they would work together to create a new Scientific Information System for high energy physics called INSPIRE. It interacts with other HEP service providers like arXiv.org, Particle Data Group, NASA's Astrophysics Data System. and HEPdata. In April 2010, a beta version of INSPIRE-HEP was freely accessible, in April 2012, it fully replaced SPIRES. A new and upgraded INSPIRE platform was officially released in March 2020.
Content
INSPIRE-HEP combines the SPIRES-HEP database content with the open source digital library software Invenio and the content of the CERN Document server. In addition to scientific papers, INSPIRE-HEP provides other information such-as citation metrics, plots extracted from papers or internal experiment notes and tools for users to improve metadata like crowdsourcing for author disambiguation. As of August 2012, INSPIRE-HEP contains 1.1 million records. INSPIRE provides not only a literature database for the field of High-Energy Physics, but for other HEP-related services:
HEPNames: a comprehensive directory of people involved in High-Energy Physics
Institutions: a database compiling over 7000 institutes related to the HEP field; included in the information about each institute is a link to all the papers in INSPIRE-HEP that are associated with the institution as well as a list of people (taken from HEPNames)
Conferences: a collection of HEP meetings and conferences
Jobs: a listing of academic and research jobs of interest to the community in high energy physics, nuclear physics, accelerator physics and astrophysics
Experiments: a database containing summaries of HEP and HEP-related experiments from different labs and locations around the world
See also
List of academic databases and search engines
References
Citations
Sources
Gentil-Beccot, A., Mele S., Holtkamp, A., O’Connell, H., and Brooks, T. (2008). Information Resources in High-Energy Physics. Surveying the Present Landscape and Charting the Future Course,
Warner, S., and Rieger, O. (2010). Developing Sustainability Strategies for arXiv. Information Standards Quarterly 22, 2-4.
Gülzow, V., and Kemp, Y. (2012). Teilchenphysik. In: Neuroth, H. et al. (ed.). Langzeitarchivierung von Forschungsdaten. |
https://en.wikipedia.org/wiki/Food.com | Food.com is a digital brand and online social networking service featuring recipes from home cooks and celebrity chefs, food news, new and classic shows, and pop culture. Food.com was launched in September 2017 and offers recipe, photo, articles, and video content on the web as well as video streaming and smartphone apps.
The website features more than 500,000 user-generated recipe pages, to which users can add reviews, modifications, questions and photos.
History
Food.com changed their name to Genius Kitchen in 2017, but as of July 2019 it switched back to Food.com once again. The site formerly known as Recipezaar, and originally as Cookpoint, was created in 1999 outside of Seattle, Washington by two ex-Microsoft technologists Gay Gilmore and Troy Hakala. What started as an idea to connect home cooks from all over the world has grown into a daily cooking community, featuring 500,000+ user-generated recipes, 125,000+ photos, millions of reviews and tweaks.
Food.com is headquartered in New York and is part of the Discovery Inc. portfolio, which also owns and operates brands such as Discovery Channel, Animal Planet, American Heroes Channel, Food Network, Cooking Channel, HGTV, Travel Channel, DIY Network, and Great American Country.
See also
List of websites about food and drink
References
American cooking websites
Social cataloging applications
Internet properties established in 1999 |
https://en.wikipedia.org/wiki/Landweber%20iteration | The Landweber iteration or Landweber algorithm is an algorithm to solve ill-posed linear inverse problems, and it has been extended to solve non-linear problems that involve constraints. The method was first proposed in the 1950s by Louis Landweber, and it can be now viewed as a special case of many other more general methods.
Basic algorithm
The original Landweber algorithm attempts to recover a signal x from (noisy) measurements y. The linear version assumes that for a linear operator A. When the problem is in finite dimensions, A is just a matrix.
When A is nonsingular, then an explicit solution is . However, if A is ill-conditioned, the explicit solution is a poor choice since it is sensitive to any noise in the data y. If A is singular, this explicit solution doesn't even exist. The Landweber algorithm is an attempt to regularize the problem, and is one of the alternatives to Tikhonov regularization. We may view the Landweber algorithm as solving:
using an iterative method. The algorithm is given by the update
where the relaxation factor satisfies . Here is the largest singular value of . If we write , then the update can be written in terms of the gradient
and hence the algorithm is a special case of gradient descent.
For ill-posed problems, the iterative method needs to be stopped at a suitable iteration index, because it semi-converges. This means that the iterates approach a regularized solution during the first iterations, but become unstable in further iterations. The reciprocal of the iteration index acts as a regularization parameter. A suitable parameter is found, when the mismatch approaches the noise level.
Using the Landweber iteration as a regularization algorithm has been discussed in the literature.
Nonlinear extension
In general, the updates generated by
will generate a sequence that converges to a minimizer of f whenever f is convex
and the stepsize is chosen such that where is the spectral norm.
Since this is special type of gradient descent, there currently is not much benefit to analyzing it on its own as the nonlinear Landweber, but such analysis was performed historically by many communities not aware of unifying frameworks.
The nonlinear Landweber problem has been studied in many papers in many communities; see, for example,.
Extension to constrained problems
If f is a convex function and C is a convex set, then the problem
can be solved by the constrained, nonlinear Landweber iteration, given by:
where is the projection onto the set C. Convergence is guaranteed when . This is again a special case of projected gradient descent (which is a special case of the forward–backward algorithm) as discussed in.
Applications
Since the method has been around since the 1950s, it has been adopted and rediscovered by many scientific communities, especially those studying ill-posed problems. In X-ray computed tomography it is called SIRT - simultaneous iterative reconstruction technique. |
https://en.wikipedia.org/wiki/Xdvi | xdvi is an open-source computer program written by Paul Vojta for displaying TeX-produced .dvi files under the X Window System on Unix, including Linux.
The xdvi interface has a set of GUI controls and a window displaying a single page of the DVI document. Every time a new version of the .dvi file is saved, xdvi automatically refreshes the display with the new version. xdvi is equipped with "magnifying glasses" for viewing close-ups of portions of the page by clicking on a mouse button while the mouse cursor is over the part of the page to be viewed. xdvi has a set of keyboard shortcuts for bypassing the pointer control.
xdvi can be used with the editor emacs to display the .dvi file of the TeX file currently being edited. There also exists an ability to perform a reverse search, in which a user clicks on a location in the dvi file and emacs jumps to the associated location in the TeX file.
References
External links
Paul Vojta's web page on xdvi
The Xdvik Homepage on sourceforge
Free TeX software |
https://en.wikipedia.org/wiki/City%20TV%20%28disambiguation%29 | City TV may refer to:
Citytv, a Canadian broadcast television network
Citytv Bogotá, a local television station in Colombia which licenses branding from Citytv
Citytv.com.co, a Colombian video sharing website
City TV (Bosnia and Herzegovina)
City TV (Bulgaria), a cable music channel in Bulgaria
City TV (Singapore), a defunct channel owned by Mediacorp
City8, a proposed local television channel in Birmingham, United Kingdom known as "City TV" during initial planning |
https://en.wikipedia.org/wiki/Groupement%20des%20%C3%A9coles%20d%27a%C3%A9ronautique | The Groupement des écoles d'aéronautique (GEA France) (in English French aeronautical universities network) includes three French national aerospace engineering grandes écoles focused on this scope:
École nationale de l'aviation civile (ÉNAC), Aix-en-Provence, Carcassonne, Castelnaudary, Toulouse, Muret, Montpellier, Grenoble, Biscarrosse, Château-Arnoux-Saint-Auban, Saint-Yan et Melun,
École nationale supérieure de mécanique et d'aérotechnique (ISAE-ENSMA), Poitiers,
Institut Supérieur de l'Aéronautique et de l'Espace (ISAE-SUPAERO), Toulouse.
The Institut sino-européen d'ingénierie de l'aviation of Tianjin
The Institut sino-européen d'ingénierie de l'aviation (Sino-European Institute of Aviation Engineering) of Tianjin has been created by the GEA grandes écoles, in partnership with DGAC and French companies (EADS, Airbus, Thales, Eurocopter, Safran) as part of a Franco-Chinese cooperation following the implantation of an Airbus A320 assembly plant in Tianjin.
The university opened in October 2007, trains Chinese students. They follow a course in aerospace engineering, taught in French and in six years, a first year of learning the French language, followed by two years of classes préparatoires and three years of aeronautical engineering.
Mastères Spécialisés in Tianjin
Not linked with the engineering training, three Mastères Spécialisés are taught at the Institut sino-européen d'ingénierie de l'aviation of Tianjin:
Mastère Spécialisé Aviation Safety management : aeronautical maintenance ;
Mastère Spécialisé Aviation Safety management : airworthiness ;
Mastère Spécialisé Aviation Safety management : flight operations.
These courses are for Chinese students who wants to join the aeronautical sector.
References
Grandes écoles
Technical universities and colleges in France
Engineering universities and colleges in France
Science and technology in France
Multidisciplinary research institutes
Aviation schools
École nationale de l'aviation civile |
https://en.wikipedia.org/wiki/Social%20media%20as%20a%20public%20utility | Social media as a public utility is a theory postulating that social networking sites (such as Facebook, Twitter, YouTube, Google, Instagram, Tumblr, Snapchat etc.) are essential public services that should be regulated by the government, in a manner similar to how electric and phone utilities are typically government regulated. It is based on the notion that social media platforms have monopoly power and broad social influence.
Background
Definitions
Social media is defined as "a group of Internet-based applications that build on the ideological and technological foundations of Web 2.0, and that allow the creation and exchange of User Generated Content."
Furthermore, the New Zealand Government of Internal Affairs describes it as "a set of online technologies, sites, and practices which are used to share opinions, experiences and perspectives. Fundamentally it is about the conversation. In contrast with traditional media, the nature of social media is to be highly interactive." Moreover, the term social media is described as online tools that let people interact and communicate with each other.
This has become a standard word for online cultural exchange and a dominant way for individuals to engage on the internet. By using social media individuals become more closely and strongly connected than ever before.
The traditional definition of the term public utility is "an infrastructural necessity for the general public where the supply conditions are such that the public may not be provided with a reasonable service at reasonable prices because of monopoly in the area." Conventional public utilities include water, natural gas, and electricity. In order to secure the interests of the public, utilities are regulated. Public utilities can also be seen as natural monopolies implying that the highest degree of efficiency is accomplished under one operator in the marketplace.
Public utility regulation for social media has been largely criticized because people believe it would produce undesirable and indirect effects. However, others say that truly effective government regulation would produce valuable results.
Social media as a public utility is a crucial debate because utilities get regulated, so marking social media websites as utilities would require government regulation of various social media websites and platforms such as Facebook, Google, and Twitter.
Applying the term public utility to social media implies that social media websites are public necessities, and, consequently, should be regulated by the government. While social media are not as essential for survival as traditional public utilities such as electricity, water, and natural gas, many people believe it has become vital for living in an interconnected world and without it, living a successful life would be difficult. Therefore, many people believe that social media has reached utility status and should be treated as a public utility. However, others believe that this is not true |
https://en.wikipedia.org/wiki/Mars%20flyby | A Mars flyby is a movement of spacecraft passing in the vicinity of the planet Mars, but not entering orbit or landing on it. Uncrewed space probes have used this method to collect data on Mars, as opposed to orbiting or landing. A spacecraft designed for a flyby is also known as a "flyby bus" or "flyby spacecraft".
Concepts
One application of a Mars flyby is for a human mission, where after landing and staying on the surface for some time the ascent stage has a space rendezvous with another, uncrewed spacecraft, that was launched separately from Earth, flying by. This would mean the ascent stage of the lander to reach the speed necessary equal to that of the spacecraft flying by, but the resources needed for Earth return would not have to enter or leave Mars orbit.
The spacecraft they live in on the journey to Mars does the flyby, but the crew separates and goes into a lander. The Excursion module's ascent stage must rejoin the main spacecraft before it gets too far away. An advantage is that the resources needed for Earth return don't have to enter and leave Mars orbit, but the ascent stage has to perform space rendezvous in solar orbit and the time on Mars is constrained by the need to this. Mars cyclers orbit the Sun in such a way as to pass by Mars and the Earth on regular intervals, performing Mars flybys on regular intervals. The crews would live on the stations during the interplanetary voyages. The concept for Flyby Excursion Landing Module is that a lander and flyby would separate in solar orbit, the lander would accelerate to get to Mars first, then land on Mars meanwhile the other segment does a Mars flyby, then the lander takes off and rendezvous with the flyby segment transferring the crew over. (see also Mars Excursion Module (MEM))
Alternately, a flyby-only human mission is also possible, without detaching at Mars, but to slingshot around Mars and back to Earth.
History
In July 1965, Mariner 4 achieved a flyby of Mars with a return of data, providing the public and scientists with dramatically closer images of Mars. During the flyby Mariner 4 took 21 pictures amounting to about 1% of the surface of Mars. Mars was not globally mapped until the Mariner 9 orbiter, which over the course of 1972 to 1973 took thousands of images up to 100m a pixel. Observations from optical ground-based Earth telescopes have to peer through the atmosphere which blurs images, typically limiting them to resolving features about across even when Earth and Mars are closest.
In October 1999, Deep Space 1 made observations of Mars after its flyby of asteroid Braille. Although this was a very distant flyby it did succeed in taking multiple infrared spectra with its MICAS instrument of the planet.
In 2018, Mars Cube One (MarCO), two flyby CubeSats to relay communication from InSight lander during its EDL were launched towards Mars with the cruise stage. Both MarCOs reached Mars and successfully relayed data during the entry, descent, and landing phase |
https://en.wikipedia.org/wiki/2012%E2%80%9313%20Preston%20North%20End%20F.C.%20season | The 2012–13 season was Preston North End's 124th year in The Football League and their second consecutive in the third tier.
League One data
League table
Results summary
Kit
|
|
|
|
|
|
Squad
Season statistics
Starts and goals
|-
|colspan="14"|Players who have left the club:
|}
Goalscorers record
Disciplinary record
Transfers
In
Loans in
Out
Loans out
Results
Pre-season friendlies
League One
FA Cup
League Cup
League Trophy
Overall
References
External links
Official Site: 2012/2013 Fixtures & Results
BBC Sport – Club Stats
Soccerbase – Results | Squad Stats | Transfers
Preston North End
Preston North End F.C. seasons |
https://en.wikipedia.org/wiki/Partnership%20of%20a%20European%20Group%20of%20Aeronautics%20and%20Space%20Universities | The Partnership of a European Group of Aeronautics and Space UniversitieS (PEGASUS) is a network of aeronautical universities in Europe created in order to facilitate student exchanges and collaborative research between universities.
It has been originally created by the groupement des écoles aéronautiques françaises (group of French aeronautical grandes écoles) (ENAC, ENSMA and ISAE) in 1998.
The European manufacturers like Airbus have close contact with PEGASUS network.
Member universities
The network consists of 30 universities in 12 countries:
:
Czech Technical University in Prague
:
École de l'air
École nationale de l'aviation civile (ENAC)
École nationale supérieure de mécanique et d'aérotechnique (ENSMA)
Institut Supérieur de l'Aéronautique et de l'Espace (ISAE)
École supérieure des techniques aéronautiques et de construction automobile (ESTACA)
:
RWTH Aachen University
Berlin Institute of Technology
Braunschweig University of Technology
Dresden University of Technology
University of Stuttgart
:
Polytechnic University of Milan
Polytechnic University of Turin
University of Naples Federico II
Sapienza University of Rome
University of Pisa
University of Bologna
:
Vilnius Gediminas Technical University (VGTU)
:
Delft University of Technology
:
Warsaw University of Technology
:
Instituto Superior Técnico
:
University of Žilina
:
Technical University of Madrid
Technical University of Valencia
University of Seville
School of Industrial and Aeronautic Engineering of Terrassa
:
Royal Institute of Technology
:
Cranfield University
University of Bristol
University of Glasgow
External links
References
European Group
Aeronautics and Space Universities
European Group
Engineering university associations and consortia
Scientific organizations established in 1998 |
https://en.wikipedia.org/wiki/France%20AEROTECH | France AEROTECH is the name of the French national network for aeronautical and space grandes écoles (engineering graduate schools).
It has been created in 2011 by Arts et Métiers ParisTech, École centrale de Lyon, École centrale de Nantes, École nationale de l'aviation civile and École nationale supérieure d’électronique, informatique, télécommunications, mathématique et mécanique de Bordeaux.
The goals of France AEROTECH are to provide French courses abroad, developing international research projects and courses in aeronautical and space engineering, and helping emerging markets.
To achieve all these projects, the universities will created a summer program in embedded systems and a master in airworthiness.
References
Aviation schools
Aerospace engineering organizations
Aviation schools in France
Grandes écoles
Organizations established in 2011
École nationale de l'aviation civile |
https://en.wikipedia.org/wiki/List%20of%20listed%20buildings%20in%20Tibbermore | This is a list of listed buildings in the parish of Tibbermore in Perth and Kinross, Scotland.
List
|}
Key
Notes
References
All entries, addresses and coordinates are based on data from Historic Scotland. This data falls under the Open Government Licence
Tibbermore |
https://en.wikipedia.org/wiki/ATAPI | ATAPI (ATA Packet Interface) is a protocol used with the Parallel ATA (IDE) and Serial ATA standards so that a greater variety of devices can be connected to a computer than with the ATA command set alone. It carries SCSI commands and responses through the ATA interface.
ATAPI devices include CD-ROM and DVD-ROM drives, tape drives, magneto-optical drives, and large-capacity floppy drives such as the Zip drive and SuperDisk drive.
History
ATA was originally designed for, and worked only with, hard disks and devices that could emulate them. A group called the Small Form Factor committee (SFF) introduced ATAPI to be used for a variety of other devices that require functions beyond those necessary for hard disks. For example, any removable media device needs a "media eject" command, and a way for the host to determine whether the media is present, and these were not provided in the ATA protocol.
The Small Form Factor committee approached this problem by defining ATAPI as part of the fourth generation of ATA. ATAPI carries SCSI commands through ATA, so ATAPI devices are "speaking SCSI" other than at the electrical interface. In fact, some early ATAPI devices were simply SCSI devices with an ATA/ATAPI to SCSI protocol converter added on. The SCSI commands and responses are embedded in "packets" (hence "ATA Packet Interface") for transmission on the ATA cable. This interfaces ATA with any device class for which a SCSI command set has been defined. ATAPI devices are also "speaking ATA" because the ATA physical interface and protocol are still being used to send the packets.
The Direct Memory Access feature for the ATA interface was introduced along with ATAPI.
Specification
The SCSI commands and responses used by each class of ATAPI device (CD-ROM, tape, etc.) are described in other documents or specifications specific to those device classes and are not within ATA/ATAPI or the T13 committee's purview. One commonly used set is defined in the MMC SCSI command set.
ATAPI was adopted as part of ATA in INCITS 317-1998, AT Attachment with Packet Interface Extension (ATA/ATAPI-4).
See also
References
External links
Communications protocols
AT Attachment
SCSI |
https://en.wikipedia.org/wiki/Algebraic%20semantics | Algebraic semantics may refer to:
Algebraic semantics (computer science)
Algebraic semantics (mathematical logic) |
https://en.wikipedia.org/wiki/Algebraic%20semantics%20%28computer%20science%29 | In computer science, algebraic semantics is a form of axiomatic semantics based on algebraic laws for describing and reasoning about program specifications in a formal manner.
Syntax
The syntax of an algebraic specification is formulated in two steps: (1) defining a formal signature of data types and operation symbols, and (2) interpreting the signature through sets and functions.
Definition of a signature
The signature of an algebraic specification defines its formal syntax. The word "signature" is used like the concept of "key signature" in musical notation.
A signature consists of a set of data types, known as sorts, together with a family of sets, each set containing operation symbols (or simply symbols) that relate the sorts.
We use to denote the set of operation symbols relating the sorts to the sort .
For example, for the signature of integer stacks, we define two sorts, namely, and , and the following family of operation symbols:
where denotes the empty string.
Set-theoretic interpretation of signature
An algebra interprets the sorts and operation symbols as sets and functions.
Each sort is interpreted as a set , which is called the carrier of of sort , and each symbol in is mapped to a function , which is called an operation of .
With respect to the signature of integer stacks, we interpret the sort as the set of integers, and interpret the sort as the set of integer stacks. We further interpret the family of operation symbols as the following functions:
Semantics
Semantics refers to the meaning or behavior. An algebraic specification provides both the meaning and behavior of the object in question.
Equational axioms
The semantics of an algebraic specifications is defined by axioms in the form of conditional equations.
With respect to the signature of integer stacks, we have the following axioms:
For any and ,
where "" indicates "not found".
Mathematical semantics
The mathematical semantics (also known as denotational semantics) of a specification refers to its mathematical meaning.
The mathematical semantics of an algebraic specification is the class of all algebras that satisfy the specification.
In particular, the classic approach by Goguen et al. takes the initial algebra (unique up to isomorphism) as the "most representative" model of the algebraic specification.
Operational semantics
The operational semantics of a specification means how to interpret it as a sequence of computational steps.
We define a ground term as an algebraic expression without variables. The operational semantics of an algebraic specification refers to how ground terms can be transformed using the given equational axioms as left-to-right rewrite rules, until such terms reach their normal forms, where no more rewriting is possible.
Consider the axioms for integer stacks. Let "" denote "rewrites to".
Canonical property
An algebraic specification is said to be confluent (also known as Church-Rosser) if the rewriting of any |
https://en.wikipedia.org/wiki/The%20Good%20Company | The Good Company was a Canadian variety television series which aired on CBC Television as mid-season programming from 1968 to 1969.
Premise
The Good Company was a group of 25 performers between the ages of 16 and 25, originally appearing on a special broadcast for Juliette. The television series was of a variety format that featured 20 of the 25 Good Company members. Norman Amadio served as the series musical director.
Scheduling
This half-hour series was broadcast on Mondays at 9:00 p.m. (Eastern) from 17 June to 12 September 1968 in its first season, and from 30 June to 8 September 1969 in the final season.
References
External links
CBC Television original programming
1968 Canadian television series debuts
1969 Canadian television series endings
1960s Canadian variety television series |
https://en.wikipedia.org/wiki/Wayne%20Slawson | A. Wayne Slawson (born December 29, 1932) is a composer and professor. Best known for Wishful Thinking About Winter, composed at MIT in 1967, a computer-generated setting of a haiku that uses a wide range of spectral glide rates.
Bibliography
"A Speech-Orientated Synthesizer for Computer Music"
"Sound, Electronics, and Hearing", The Development and Practice of Electronic Music. Jon H. Appleton and Ronald Perera, eds. .
Discography
Wishful Thinking About Winter. Decca DL 710180.
Sources
Further reading
Routledge (2009). "Slawson, A. Wayne", International Who's Who in Classical Music 2009, p. 765. .
American male composers
21st-century American composers
Living people
21st-century American male musicians
1932 births |
https://en.wikipedia.org/wiki/List%20of%20designated%20places%20in%20Manitoba | A designated place is a type of geographic unit used by Statistics Canada to disseminate census data. It is usually "a small community that does not meet the criteria used to define incorporated municipalities or Statistics Canada population centres (areas with a population of at least 1,000 and no fewer than 400 persons per square kilometre)." Provincial and territorial authorities collaborate with Statistics Canada in the creation of designated places so that data can be published for sub-areas within municipalities. Starting in 2016, Statistics Canada allowed the overlapping of designated places with population centres.
In the 2021 Census of Population, Manitoba had 148 designated places, an increase from 135 in 2016. Designated place types in Manitoba include 9 dissolved municipalities, 44 local urban districts, 46 northern communities, and 48 unincorporated urban centres. In 2021, the 148 designated places had a cumulative population of 89,803 and an average population of . Manitoba's largest designated place is Oakbank with a population of 5,041.
List
See also
List of census agglomerations in Manitoba
List of population centres in Manitoba
Notes
References
Designated |
https://en.wikipedia.org/wiki/List%20of%20designated%20places%20in%20New%20Brunswick | A designated place is a type of geographic unit used by Statistics Canada to disseminate census data. It is usually "a small community that does not meet the criteria used to define incorporated municipalities or Statistics Canada population centres (areas with a population of at least 1,000 and no fewer than 400 persons per square kilometre)." Provincial and territorial authorities collaborate with Statistics Canada in the creation of designated places so that data can be published for sub-areas within municipalities. Starting in 2016, Statistics Canada allowed the overlapping of designated places with population centres.
In the 2021 Census of Population, New Brunswick had 161 designated places, an increase from 157 in 2016. Designated place types in New Brunswick include 8 former local governments, 152 local service districts and a single retired population centre. In 2021, the 161 designated places had a cumulative population of 93,925 and an average population of . New Brunswick's largest designated place is Tracadie with a population of 5,349.
List
See also
List of census agglomerations in Atlantic Canada
List of population centres in New Brunswick
Notes
References
Lists of populated places in New Brunswick
Local government in New Brunswick |
https://en.wikipedia.org/wiki/List%20of%20designated%20places%20in%20Newfoundland%20and%20Labrador | A designated place is a type of geographic unit used by Statistics Canada to disseminate census data. It is usually "a small community that does not meet the criteria used to define incorporated municipalities or Statistics Canada population centres (areas with a population of at least 1,000 and no fewer than 400 persons per square kilometre)." Provincial and territorial authorities collaborate with Statistics Canada in the creation of designated places so that data can be published for sub-areas within municipalities. Starting in 2016, Statistics Canada allowed the overlapping of designated places with population centres.
In the 2021 Census of Population, Newfoundland and Labrador had 207 designated places, an increase from 199 in 2016. Among these designated places are 5 retired population centres. In 2021, the 207 designated places had a cumulative population of 44,012 and an average population of . Newfoundland and Labrador's largest designated place is Goulds with a population of 4,441.
List
See also
List of census agglomerations in Atlantic Canada
List of communities in Newfoundland and Labrador
List of local service districts in Newfoundland and Labrador
List of municipalities in Newfoundland and Labrador
List of population centres in Newfoundland and Labrador
Notes
References
Designated |
https://en.wikipedia.org/wiki/List%20of%20designated%20places%20in%20Nova%20Scotia | A designated place is a type of geographic unit used by Statistics Canada to disseminate census data. It is usually "a small community that does not meet the criteria used to define incorporated municipalities or Statistics Canada population centres (areas with a population of at least 1,000 and no fewer than 400 persons per square kilometre)." Provincial and territorial authorities collaborate with Statistics Canada in the creation of designated places so that data can be published for sub-areas within municipalities. Starting in 2016, Statistics Canada allowed the overlapping of designated places with population centres.
In the 2021 Census of Population, Nova Scotia had 70 designated places, an increase from 68 in 2016. Designated place types in Nova Scotia include 66 class IV areas and 4 retired population centres. In 2021, the 70 designated places had a cumulative population of 44,090 and an average population of . Nova Scotia's largest designated place is Bible Hill with a population of 5,076.
List
See also
List of census agglomerations in Atlantic Canada
List of population centres in Nova Scotia
Notes
References
Designated |
https://en.wikipedia.org/wiki/List%20of%20designated%20places%20in%20Ontario | A designated place is a type of geographic unit used by Statistics Canada to disseminate census data. It is usually "a small community that does not meet the criteria used to define incorporated municipalities or Statistics Canada population centres (areas with a population of at least 1,000 and no fewer than 400 persons per square kilometre)." Provincial and territorial authorities collaborate with Statistics Canada in the creation of designated places so that data can be published for sub-areas within municipalities. Starting in 2016, Statistics Canada allowed the overlapping of designated places with population centres.
In the 2021 Census of Population, Ontario had 135 designated places, an increase from 129 in 2016. Designated place types in Ontario include 45 dissolved municipalities, 44 local service boards, 37 municipal defined places, and 9 dissolved population centres. In 2021, the 135 designated places had a cumulative population of 74,105 and an average population of . Ontario's largest designated place is Breslau with a population of 5,053.
List
See also
List of census agglomerations in Ontario
List of population centres in Ontario
Notes
References
Designated |
https://en.wikipedia.org/wiki/List%20of%20designated%20places%20in%20Quebec | A designated place is a type of geographic unit used by Statistics Canada to disseminate census data. It is usually "a small community that does not meet the criteria used to define incorporated municipalities or Statistics Canada population centres (areas with a population of at least 1,000 and no fewer than 400 persons per square kilometre)." Provincial and territorial authorities collaborate with Statistics Canada in the creation of designated places so that data can be published for sub-areas within municipalities. Starting in 2016, Statistics Canada allowed the overlapping of designated places with population centres.
In the 2021 Census of Population, Quebec had 120 designated places, an increase from 117 in 2016. Designated place types in Quebec include 14 retired population centres, 94 dissolved municipalities (municipalité dissoute), and 12 unconstituted localities (localité non constituée). In 2021, the 120 designated places had a cumulative population of 80,697 and an average population of . Quebec's largest designated place is Sainte-Agathe-des-Monts with a population of 6,740.
List
See also
List of census agglomerations in Quebec
List of population centres in Quebec
List of unconstituted localities in Quebec
Municipal history of Quebec
References
Lists of populated places in Quebec |
https://en.wikipedia.org/wiki/List%20of%20designated%20places%20in%20Saskatchewan | A designated place is a type of geographic unit used by Statistics Canada to disseminate census data. It is usually "a small community that does not meet the criteria used to define incorporated municipalities or Statistics Canada population centres (areas with a population of at least 1,000 and no fewer than 400 persons per square kilometre)." Provincial and territorial authorities collaborate with Statistics Canada in the creation of designated places, so that data can be published for sub-areas within municipalities. Starting in 2016, Statistics Canada allowed the overlapping of designated places with population centres.
In the 2021 Census of Population, Saskatchewan had 198 designated places, an increase from 193 in 2016. Designated place types in Saskatchewan include 2 cluster subdivisions, 40 dissolved municipalities, 9 northern settlements, 143 organized hamlets, 2 resort subdivisions, and 2 retired population centre. In 2021, the 198 designated places had a cumulative population of 11,858, and an average population of . Saskatchewan's largest designated place is Gravelbourg with a population of 986.
List
See also
List of census agglomerations in Saskatchewan
List of cities in Saskatchewan
List of communities in Saskatchewan
List of ghost towns in Saskatchewan
List of hamlets in Saskatchewan
List of Indian reserves in Saskatchewan
List of municipalities in Saskatchewan
List of population centres in Saskatchewan
List of resort villages in Saskatchewan
List of rural municipalities in Saskatchewan
List of towns in Saskatchewan
List of villages in Saskatchewan
Notes
References
Designated |
https://en.wikipedia.org/wiki/Shanika%20Karunasekera | Shanika Karunasekera is a Professor in the School of Computing and Information Systems at the University of Melbourne. Dr. Karunasekera completed her Ph.D. in Electrical Engineering from the University of Cambridge, UK in 1995. Earlier she completed her B.Sc. in Electronics and Telecommunication Engineering at the University of Moratuwa, Sri Lanka.
Dr. Karunasekera was born in Sri Lanka.
External links
DBLP Profile
Google Scholar page
References
Year of birth missing (living people)
Living people
Sri Lankan emigrants to Australia
Academic staff of the University of Melbourne
Alumni of the University of Cambridge |
https://en.wikipedia.org/wiki/Red%20%28programming%20language%29 | Red is a programming language designed to overcome the limitations of the programming language Rebol. Red was introduced in 2011 by Nenad Rakočević, and is both an imperative and functional programming language. Its syntax and general usage overlaps that of the interpreted Rebol language.
The implementation choices of Red intend to create a full stack programming language: Red can be used for extremely high-level programming (DSLs and GUIs) as well as low-level programming (operating systems and device drivers). Key to the approach is that the language has two parts: Red/System and Red.
Red/System is similar to C, but packaged into a Rebol lexical structure for example, one would write instead of .
Red is a homoiconic language capable of meta-programming, with Rebol-like semantics. Red's runtime library is written in Red/System, and uses a hybrid approach: it compiles what it can deduce statically and uses an embedded interpreter otherwise. The project roadmap includes a just-in-time compiler for cases in between, but this has not yet been implemented.
Red seeks to remain independent of any other toolchain; it does its own code generation. It is therefore possible to cross-compile Red programs from any platform it supports to any other, via a command-line switch. Both Red and Red/System are distributed as open-source software under the modified BSD license. The runtime library is distributed under the more permissive Boost Software License.
As of version 0.6.4 Red includes a garbage collector "the Simple GC".
Introduction
Red was introduced in the Netherlands in February 2011 at the Rebol & Boron conference by its author Nenad Rakočević. In September 2011, the Red programming language was presented to a larger audience during the Software Freedom Day 2011. Rakočević is a long-time Rebol developer known as the creator of the Cheyenne HTTP server.
Features
Red's syntax and semantics are very close to those of Rebol. Like Rebol, it strongly supports metaprogramming and domain-specific languages (DSLs) and is therefore a highly efficient tool for dialecting (creating embedded DSLs). Red includes a dialect called Red/System, a C-level language which provides system programming facilities. Red is easy to integrate with other tools and languages as a DLL (libRed) and very lightweight (around 1 MB). It is also able to cross-compile to various platforms (see Cross Compilation section below) and create packages for platforms that require them (e.g., .APK on Android). Red also includes a fully reactive cross-platform GUI system based on an underlying reactive dataflow engine, a 2D drawing dialect comparable to SVG, compile-time and runtime macro support, and more than 40 standard datatypes.
Goals
The following is the list of Red's Goals as presented on the Software Freedom Day 2011:
Simplicity ("An IDE should not be necessary to write code.")
Compactness ("Being highly expressive maximizes productivity.")
Speed ("If too slow, it cannot be gene |
https://en.wikipedia.org/wiki/Female%20foeticide%20in%20India | Female foeticide in India () is the abortion of a female foetus outside of legal methods. A research by Pew Research Center based on Union government data indicates foeticide of at least 9 million females in the years 2000-2019. The research found that 86.7% of these foeticides were by Hindus (80% of the population), followed by Sikhs (1.7% of the population) with 4.9%, and Muslims (14% of the population) with 6.6%. The research also indicated an overall decline in preference for sons in the time period.
The natural sex ratio is assumed to be between 103 and 107 males per 100 females, and any number above it is considered suggestive of female foeticide. According to the decennial Indian census, the sex ratio in 0 to 6 age group in India has risen from 102.4 males per 100 females in 1961, to 104.2 in 1980, to 107.5 in 2001, to 108.9 in 2011.
The child sex ratio is within the normal range in all eastern and southern states of India, but significantly higher in certain western and particularly northwestern states such as Maharashtra, Haryana, Jammu and Kashmir (118, 120 and 116, as of 2011, respectively). The western states of Maharashtra and Rajasthan 2011 census found a child sex ratio of 113, Gujarat at 112 and Uttar Pradesh at 111.
The Indian census data indicates that the sex ratio is poor when women have one or two children, but gets better as they have more children, which is result of sex-selective "stopping practices" (stopping having children based on sex of those born). The Indian census data also suggests there is a positive correlation between abnormal sex ratio and better socio-economic status and literacy. This may be connected to the dowry system in India where dowry deaths occur when a girl is seen as a financial burden. Urban India has higher child sex ratio than rural India according to 1991, 2001 and 2011 Census data, implying higher prevalence of female foeticide in urban India. Similarly, child sex ratio greater than 115 boys per 100 girls is found in regions where the predominant majority is Hindu; furthermore "normal" child sex ratio of 104 to 106 boys per 100 girls are found in regions where the predominant majority is Muslim, Sikh or Christian. These data suggest that sex selection is a practice which takes place among some educated, rich sections or a particular religion of the Indian society.
There is an ongoing debate as to whether these high sex ratios are only caused by female foeticide or some of the higher ratio is explained by natural causes. The Indian government has passed Pre-Conception and Pre-Natal Diagnostic Techniques Act (PCPNDT) in 1994 to ban and punish prenatal sex screening and female foeticide. It is currently illegal in India to determine or disclose sex of the foetus to anyone. However, there are concerns that PCPNDT Act has been poorly enforced by authorities.
High sex ratio implication
One school of scholars suggest that any birth sex ratio of boys to girls that is outside of the normal 105-10 |
https://en.wikipedia.org/wiki/ISO/IEC%209075 | ISO/IEC 9075 "Information technology - Database languages - SQL" is an international standard for Structured Query Language, and is considered as specifying the minimum for what a database engine should fulfill in terms of SQL syntax, which is called Core SQL. The standard also defines a number of optional features.
History
The first edition was based on ANSI SQL.
Editions
New editions of the ISO standard are published regularly.
Chronological overview of the editions (which have the year of publication in their name):
SQL-86, ANSI X3.135:1986
SQL-87, ISO 9075:1987, based on the ANSI standard
SQL-89, ISO/IEC 9075:1989
SQL-92, ISO/IEC 9075:1992
SQL:1999, ISO/IEC 9075:1999
SQL:2003, ISO/IEC 9075:2003
SQL:2006, ISO/IEC 9075:2006
SQL:2008, ISO/IEC 9075:2008
SQL:2011, ISO/IEC 9075:2011
SQL:2016, ISO/IEC 9075:2016
SQL:2019, ISO/IEC 9075:2019
SQL:2023, ISO/IEC 9075:2023
References
External links
ISO/IEC JTC 1/SC 32 technical committee (data management and interchange)
SQL
09075 |
https://en.wikipedia.org/wiki/Public%20buses%20in%20Sofia | The Sofia public bus system () forms part of the public transport network of Sofia, the capital city of Bulgaria.
In operation since 1935, the system presently comprises 98 routes.
History
The public bus transport in Sofia developed relatively late compared to the other types of transport in the city. The first operational line was opened on 20 April 1935. Soon after that six more lines were opened, bringing the total network length to 23 km.
During the communist era, the bus fleet consisted mainly of Ikarus and Bulgarian-made Chavdar buses. After the political changes in 1989, however, the fleet has gradually been modernised.
Lines
As of July 2023, the following bus lines in Sofia are in service:
Lines using "X" index are express bus services.
Night bus service
A night bus service was launched in Sofia by Sofia Urban Mobility Center on an experimental basis from 7 April 2018 until 31 December 2018. Tickets for the night bus could be obtained solely from conductors on the bus, and not from the driver, machines or other public transport ticket sale points. Tickets for the night bus cost 2 leva compared to the daytime price of 1.60 leva. Knyaz Alexander Square was chosen as the site of a transfer location where all night bus lines met and passengers could switch lines.
Four routes were included and operated from 00:20 until 04:20 at intervals of 40 mins:
N1: Lyulin 1 – Mladost 4, operated by Malashevtsi garage
N2: Obelya – Students' Town, operated by Malashevtsi garage
N3: Ovcha Kupel 2 – Iztok Bus Station, operated by Zemlyane garage
N4: Gotse Delchev – Druzhba 2, operated by Druzhba garage
The night bus service was closed due to COVID-19 and has not been opened since then. As of February 2023, the service isn't running and the last bus for most lines is between 23:30 and 00:00.
Fleet
Current fleet
Sofia Bus Transport
Sofia Electric Transport
MTK Group
Heritage fleet
See also
Sofia Metro
Sofia Public Transport
Sofia Tramway
Trolleybuses in Sofia
References
Transport in Sofia
Sofia |
https://en.wikipedia.org/wiki/Sajal%20K.%20Das | Dr. Sajal K. Das is currently a Professor of Computer Science and the Daniel St. Clair Endowed Chair at Missouri University of Science and Technology (S&T), where he was the Chair of Computer Science Department during 2013-2017. Prior to that he was a University Distinguished Scholar Professor of Computer Science and Engineering and the founding director of the Center for Research in Wireless Mobility and Networking (CReWMaN) at the University of Texas at Arlington. During 2008-2011 he served the US National Science Foundation as a Program Director in Computer Networks and Systems division of the CISE Directorate. During 1988-1999 he was a faculty at the University of North Texas. His research interests include wireless and sensor networks, mobile and pervasive computing, parallel and cloud computing, smart and connected communities (smart city, smart home, smart grid, smart health, smart transportation, and smart agriculture), cyber-physical systems, Internet of Things (IoT), cyber-physical security, machine learning and data analytics, biological and social networking, applied graph theory and game theory. He has partaken in research related to wireless sensor networks and pervasive and mobile computing. He is a Fellow of the IEEE.
Publications, patents and books
Das has published 350+ journal articles and 475+ peer-reviewed conference papers, gathering 34,300+ citations according to Google Scholar and 50 invited book chapters.
He is one of the most prolific authors in computer science according to DBLP His current h-index is 91.
Books
S. Roy and S. K. Das, Principles of Cyber-Physical Systems: An Interdisciplinary Approach, Cambridge University Press, 2020.
S. K. Das, K. Kant and N. Zhang, Handbook on Securing Cyber-Physical Critical Infrastructure: Foundations and Challenges, Morgan Kaufmann, 2012.
J. Cao and S. K. Das, Mobile Agents in Networking and Distributed Computing (Wiley Series in Agent Technology), John Wiley, 2012.
D. J. Cook and S. K. Das, Smart Environments: Technology, Protocols and Applications, John Wiley, 2005.
References
External links
Sajal K. Das personal webpage
Creative Research in Wireless Mobility and Networking (CReWMaN) website
Sajal K. Das academic ancestry
Year of birth missing (living people)
Living people
Electrical engineering academics
American computer scientists
Academic journal editors
University of Calcutta alumni
Indian Institute of Science alumni
Missouri University of Science and Technology faculty |
https://en.wikipedia.org/wiki/Araucaria%20%28disambiguation%29 | Araucaria is a genus of coniferous trees.
Araucaria nay also refer to:
Araucaria (crossword compiler), pseudonym of the crossword compiler John Galbraith Graham (1921–2013)
Araucaria (software), argument mapping software
Araucária, a city and municipality in Paraná state, Brazil |
https://en.wikipedia.org/wiki/List%20of%20tallest%20buildings%20in%20Bulgaria | According to data of municipal firm Sofproekt-OGP, the majority of the tallest buildings in Bulgaria are located in the Mladost district, in Sofia.
Completed
Under construction
Proposed
See also
List of tallest buildings in Sofia
List of tallest buildings in the Balkans
List of tallest buildings in Europe
List of tallest buildings in the European Union
References
External links
Emporis.com
Bulgaria
Tallest
Bulgaria |
https://en.wikipedia.org/wiki/Traders%20%28season%201%29 | This is a list of episodes for Traders, a Canadian television drama series, which was broadcast on Global Television Network from 1996 to 2000. The show was set in a Bay Street investment bank, Gardner Ross. Bruce Gray and Sonja Smits starred as the firm's senior partners, Adam Cunningham and Sally Ross. The cast also included Patrick McKenna, Janet Bailey, David Cubitt, Rick Roberts, Kim Huffman, Chris Leavins, Gabriel Hogan, David Hewlett, Peter Stebbings and Alex Carter.
Cast
Main
Sonja Smits as Sally Ross
David Cubitt as Jack Larkin
Bruce Gray as Adam Cunningham
Patrick McKenna as Marty Stephens
Kim Huffman as Ann Krywarik
David Hewlett as Grant Jansky
Janet Bailey as Susannah Marks
Rick Roberts as Donald D'Arby
Terri Hawkes as Monika Barnes
Ron Gabriel as Benny Siedleman
Philip Akin as Carl Davison
Episodes
References
1996 Canadian television seasons |
https://en.wikipedia.org/wiki/Traders%20%28season%202%29 | This is a list of episodes for Traders, a Canadian television drama series, which was broadcast on Global Television Network from 1996 to 2000. The show was set in a Bay Street investment bank, Gardner Ross. Bruce Gray and Sonja Smits starred as the firm's senior partners, Adam Cunningham and Sally Ross. The cast also included Patrick McKenna, David Cubitt, Rick Roberts, Chris Leavins, Gabriel Hogan, David Hewlett, Peter Stebbings and Alex Carter.
Cast
Main
Sonja Smits as Sally Ross
David Cubitt as Jack Larkin
Bruce Gray as Adam Cunningham
Patrick McKenna as Marty Stephens
Kim Huffman as Ann Krywarik
Janet Bailey as Susannah Marks
Rick Roberts as Donald D'Arby
Ron Gabriel as Benny Siedleman
David Hewlett as Grant Jansky
Chris Leavins as Chris Todson
Episodes
References
1996 Canadian television seasons
1997 Canadian television seasons |
https://en.wikipedia.org/wiki/Traders%20%28season%204%29 | This is a list of episodes for Traders, a Canadian television drama series, which was broadcast on Global Television Network from 1996 to 2000. The show was set in a Bay Street investment bank, Gardner Ross. Bruce Gray and Sonja Smits starred as the firm's senior partners, Adam Cunningham and Sally Ross. The cast also included Patrick McKenna, David Cubitt, Rick Roberts, Chris Leavins, Gabriel Hogan, David Hewlett, Peter Stebbings and Alex Carter.
References
1998 Canadian television seasons
1999 Canadian television seasons |
https://en.wikipedia.org/wiki/Traders%20%28season%205%29 | This is a list of episodes for Traders a Canadian television drama series, which was broadcast on Global Television Network from 1996 to 2000. The show was set in a Bay Street investment bank, Gardner Ross. Bruce Gray and Sonja Smits starred as the firm's senior partners, Adam Cunningham and Sally Ross. The cast also included Patrick McKenna, David Cubitt, Rick Roberts, Chris Leavins, Gabriel Hogan, David Hewlett, Peter Stebbings and Alex Carter.
References
1999 Canadian television seasons
2000 Canadian television seasons |
https://en.wikipedia.org/wiki/National%20road%205%20%28Poland%29 | National road 5 () is a route belonging to the Polish national road network. The highway connects some of the biggest urban agglomerations in Poland, i.e. Trójmiasto, Bydgoszcz, Poznań and Wrocław. It runs from Nowe Marzy to Lubawka at the Czech border and between Bielany Wrocławskie and Kostomłoty merges with A4 motorway. On the segment from Nowe Marzy to Wrocław, it is a component of European route E261.
Expressway S5
The Nowe Marzy–Wrocław Północ section has expressway status as Expressway S5.
Major cities and towns along the route
Nowe Marzy (road A1, 91)
Świecie (road 91)
Bydgoszcz (road 10, 25, 80)
Szubin
Żnin
Gniezno (road 15)
Pobiedziska
Poznań (road A2, 11, 92)
Stęszew (road 32)
Kościan
Śmigiel
Leszno (road 12)
Rydzyna
Bojanowo
Rawicz (road 36)
Żmigród
Trzebnica (road 15)
Wrocław (road A8, 94, 98)
Bielany Wrocławskie (road A4, 98)
Kąty Wrocławskie
Strzegom
Bolków (road 3)
Kamienna Góra
Lubawka, border with Czech Republic
05 |
https://en.wikipedia.org/wiki/John%20Halpern | John Halpern (born Cuckfield, Sussex, 21 June 1967) is a cryptic crossword compiler for newspapers including The Guardian (as Paul), The Independent (as Punk), The Times, the Daily Telegraph (as Dada) and The Financial Times (as Mudd).
Halpern's interest in The Guardian cryptic crossword puzzle began when he was a student in Canterbury, and he wondered if the compilers could possibly be human beings. After completing a puzzle for the first time, he set about creating two of his own to send to his hero John Galbraith Graham, known as "Araucaria", and accomplished this two and a half years later. He now writes three or four a week for a variety of publications.
Having studied music and maths, Halpern became a local reporter, barman, warehouse packer, bank clerk and lab technician. He taught English in Rome, but found that hands-on examples of the present continuous kept causing him to lead his students out of the classroom, on to the street and into bars where he would put their understanding of his lesson to the test: ‘You are buying me a drink’.
Halpern’s favourite clue of his own is "To make cheese, how do you milk a Welsh hedgehog? (10)" (answer: CAERPHILLY). The first clue he ever wrote for the Guardian was "Name sewn into footballers' underwear (8)" (answer: KNICKERS – N for name, in KICKERS).
In March 2012, Halpern and Graham hosted a crossword show at The Guardian offices. He is working on a film and follow-up tour.
Early years
Halpern grew up in a house in the woods in Sussex. He was inspired by the surrounding countryside, and by his parents' love of wordplay; they both solved cryptic crosswords regularly. His father Tony would make wordplay jokes at the dinner table every night, where meals would include toad-in-the-hole, renamed 'frog-in-the-bog', and a strawberry mousse dubbed 'pinky stuff', which became 'stinky puff'. An avid reader of nonsense poetry, and a fan of Monty Python, as a boy Halpern would write poems, stories and songs – and was a member of a band at school named Xerox, where lyrics were often chosen randomly by opening a dictionary while blindfolded and choosing random words.
Death of Halpern's father and brother
Two major events were to shape Halpern's early adulthood. His father died suddenly at the age of 53, when John was eighteen. The second event of Halpern's early adulthood was the death of his only brother, Paul, in a car accident. Paul had been John's best friend and he was saddened he never got the chance to fulfil his dreams. In his honour, John felt he must do everything he could to fulfil his own dreams as well as help others along the way.
Student years (1990–94) and learning to become a cryptic crossword setter
When Paul died at the age of 27, Halpern was 21. Not particularly academic, and often panicking in exams, Halpern failed to achieve the grades he wanted to study music or biology, and took a few menial jobs before reapplying for universities soon after his brother's death. At Canterbury Ch |
https://en.wikipedia.org/wiki/Ahmad%20Mohammad%20Ali%20al-Hada | Ahmad Mohammad Ali al-Hada is an al-Qaeda operative from Yemen whose family was described by US government officials as a "supercell" within the al-Qaeda network. By February 2002, the "communications hub" which al-Hada running was no longer active following the death of his son, Samir.
Early life and Al-Qaeda
Al-Hada is native of Dhamar Governorate, and is a veteran of Soviet–Afghan War, where he met Osama bin Laden. It's reported that al-Hada was a close friend of Bin Laden. From 1996 until 2006, he operated, along with his son, Samir Al-Hada, an al-Qaeda safe house and a communication center in Sana'a, which was the direct link from al-Qaeda central to Yemen. He was captured by the Yemeni government in 2006, but was set free, possibly after a tribal deal. As of 2007, his whereabouts are unknown.
Family
Al-Hada's son-in-law, Khalid al-Mihdhar, was one of the hijackers that flew American Airlines Flight 77 into the Pentagon as part of the September 11 attacks. Another son-in-law, Mustafa Abdulkader, has been listed on FBI terror alerts. In February 2002, Al-Hada's son, Samir al-Hada, committed suicide using a hand grenade, to avoid questioning by security forces about the Cole bombing. Two of Ahmed Al-Hada’s brothers were killed in Afghanistan during operation “Absolute Justice” and a third brother, Abdullah Al-Hada, is wanted by the Yemen authorities for terror charges.
USS Cole bombing
Al-Hada allegedly provided the telephone number in Yemen that served as the switchboard for al-Qaeda operations leading up to the USS Cole bombing and September 11 attacks. In The Looming Tower he was cited as being in Yemeni custody.
References
Yemeni al-Qaeda members
People from Dhamar Governorate
Year of birth missing (living people)
Living people |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.