source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/Pepephone | Pepephone is a Spanish mobile virtual network operator (MVNO), operated by Pepemobile. It was launched in March 2007, using the Vodafone Spain network. In February 2015, Pepephone migrated to the Movistar network.
See also
Mobile virtual network operator
References
External links
Companies based in the Community of Madrid
Spanish companies established in 2007
Mobile phone companies of Spain
Mobile virtual network operators |
https://en.wikipedia.org/wiki/Credal%20network | Credal networks are probabilistic graphical models based on imprecise probability. Credal networks can be regarded as an extension of Bayesian networks, where credal sets replace probability mass functions in the specification of the local models for the network variables given their parents. As a Bayesian network defines a joint probability mass function over its variables, a credal network defines a joint credal set. The way this credal set is defined depends on the particular notion of independence for imprecise probability adopted. Most of the research on credal networks focused on the case of strong independence. Given strong independence the joint credal set associated to a credal network is called its strong extension. Let denote a collection of categorical variables and . If is, for each , a conditional credal set over , then the strong extension of a credal network is defined as follows:
where denote the convex hull.
Inference
Inference on a credal network is intended as the computation of the bounds of an expectation with respect to its strong extensions. When computing the bounds of a conditional event, inference is called updating. Say that the queried variable and the observed variables are , the lower bound to be evaluated is:
Being a generalization of the same problem for Bayesian networks, updating with credal networks is a NP-hard task. Yet a number of algorithm have been specified.
See also
Imprecise probability
Credal set
Bayesian network
References
Cozman, F.G., 2000. Credal networks. Artificial intelligence, 120(2), pp. 199–233.
Bayesian inference |
https://en.wikipedia.org/wiki/List%20of%20Home%20and%20Away%20characters%20%282013%29 | Home and Away is an Australian television soap opera. It was first broadcast on the Seven Network on 17 January 1988. The following is a list of characters that first appeared or will appear in 2013, by order of first appearance. All characters are introduced by the soap's executive producer, Lucy Addario. The 26th season of Home and Away began airing from 21 January 2013. The first introduction of the year was Zac MacGuire then followed by Courtney Freeman, Maddy Osborne, Spencer Harrington and Rosie Prichard who all made their debuts in the same month. Chris Harrington and Ricky Sharpe arrived in April. Josh, Andy Barrett and Hannah Wilson debuted in August, while Zac's family – Ethan, Evelyn and Oscar MacGuire – began appearing from September, as did Nate Cooper. Jade Montgomery and Matt Page arrived in October, while Phoebe Nicholson debuted in November.
Zac MacGuire
Zac MacGuire, played by Charlie Clausen, made his first screen appearance on 22 January 2013. The character and casting was announced on 13 January 2013. A TV Week reporter noted that the role marked something of a return to acting for Clausen. The actor commented "I'm very excited to join the cast of Home and Away. I found out I got the role on my birthday and I couldn't think of a better gift. It's a fantastic opportunity for any actor and I've been made to feel really welcome by the cast, crew and production team. I'm looking forward to 2013 and beyond." Zac is a prison education officer who encounters Casey Braxton (Lincoln Younes) when he breaks up a brawl. Clausen revealed that Zac has been asked to keep an eye on Casey by Natalie Davison (Catherine Mack). The actor stated that Zac is "a good guy", who began working in the prison system after spending time inside when he was younger.
Courtney Freeman
Courtney Freeman, played by Joshua Brennan, made his first screen appearance on 22 January 2013. The character and casting was announced on 14 January 2013. Courtney is an inmate at Crestview Correctional Centre, which Casey Braxton (Lincoln Younes) has to attend for his part in a failed robbery. Casey's efforts to try to keep to himself fail when Courtney notices him and they have a "run-in". Younes described Courtney as being a "stereotypical prison bully." When Casey is placed in the prison kitchens, Courtney asks him to keep an eye on some food delivery that contain drugs. When Casey stands up to Courtney and refuses, he is left "battered and bruised" by the encounter.
Courtney takes a dislike to Casey and begins to make his stay difficult. He orders Casey to help with drug smuggling and attacks him when he refuses. When Jamie Sharpe (Hugo Johnstone-Burt) arrives at the facility, Courtney learns of the Braxton's animosity with the Sharpe family. He uses his gang to intimidate Jamie into attacking Casey. Zac MacGuire (Charlie Clausen) breaks up the fight. When Casey learns Courtney has asked Jamie to run drugs for him, Casey begs Jamie to say no and stand up for himself |
https://en.wikipedia.org/wiki/A-Line%20%28Hamilton%29 | The A-Line is a proposed rapid transit line running along James Street in downtown and Upper James Street on the escarpment in Hamilton, Ontario. It is part of Hamilton's proposed BLAST network, involving four other rapid transit corridors. It is identified by Metrolinx in its regional transportation plan The Big Move as a project to be completed by 2023. The route is currently served by Hamilton Street Railway's Route 20 A-Line Express bus.
History
During planning, both bus rapid transit (BRT) and light rail transit (LRT) were considered for the corridor. On May 26, 2015, the Government of Ontario announced the B-Line LRT would be constructed between McMaster University and Queenston Circle, as well as a short LRT segment of the A-Line to provide a direct connection to West Harbour GO Station from King Street.
On February 2, 2017, the province removed the A-Line LRT spur from the B-Line construction scope. In its stead, the province proposed advancing the planning and environmental assessment of a BRT along the entire A-Line corridor, from Hamilton's waterfront to Hamilton Airport.
On March 8, 2018, Metrolinx released the 2041 Regional Transportation Plan (2041 RTP) for the Greater Toronto and Hamilton Area (GTHA), superseding the previous RTP completed ten years earlier (The Big Move). The 2041 RTP recommends removing the waterfront portion of the corridor and constructing a BRT from West Harbour GO to Rymal Road and a "Priority Bus" from Rymal Road to Hamilton Airport.
On July 19, 2021, the federal, provincial, and municipal governments announced funding for upgrades to the A-Line corridor. The proposed works include construction of five queue jump lines and of sidewalks, implementation of transit signal priority measures at select intersections, and improvements to approximately 19 transit stops along the corridor. Construction of dedicated BRT lanes were not included in the funding announcement.
References
External links
Hamilton Rapid Transit
BCA Consultation boards
Transport in Hamilton, Ontario
Passenger rail transport in Hamilton, Ontario
Proposed public transport in the Greater Toronto Area
Light rail in Canada
The Big Move projects |
https://en.wikipedia.org/wiki/Mary%20Tsingou | Mary Tsingou (married name: Mary Tsingou-Menzel; born October 14, 1928) is an American physicist and mathematician of Greek descent. She was one of the first programmers on the MANIAC computer at Los Alamos National Laboratory and is best known for having coded the celebrated computer experiment with Enrico Fermi, John Pasta, and Stanislaw Ulam which became an inspiration for the fields of chaos theory and scientific computing and was a turning point in soliton theory.
Life
Mary Tsingou was born in Milwaukee, Wisconsin, her Greek parents having moved to the US from Bulgaria. In the aftermath of the Great Depression, the family left the US to spend several years in Bulgaria. In 1940, they returned to the US, where Tsingou attended high school and college. She graduated in mathematics and education in 1951 from the University of Wisconsin. She then studied at the University of Michigan, receiving a master's degree in mathematics in 1955. In 1958, she married Joseph Menzel.
Career
Tsingou joined the T1 division of the Los Alamos National Laboratory, then transferred to the T7, where she became one of the first programmers on the MANIAC. Besides working on weapons, the group also studied fundamental physics. Following Fermi's suggestion to analyze numerically the predictions of a statistical model of solids, Tsingou came up with an algorithm to simulate the relaxation of energy in a model crystal, which she implemented on the MANIAC. The analysis became known in the computational physics community as the Fermi–Pasta–Ulam–Tsingou problem (FPUT), and Tsingou's contributions have since been recognised. The result was an important stepping stone for chaos theory.
After Fermi's death, James L. Tuck and Tsingou-Menzel repeated the original FPU results and provided strong indication that the nonlinear FPU problem might be integrable.
Tsingou-Menzel continued her computational career at Los Alamos. She was an early expert on Fortran. In the 1980s, she worked on calculations in the Star Wars program. She retired in 1991.
Recognition
In 2008, an article published in Physics Today called to rename the FPU problem to the FPUT problem to give her proper credit for her contribution. Subsequent publications referencing the FPUT problem reflect this change. In 2020, National Security Science magazine, published by Los Alamos National Laboratory, featured an article on Tsingou that included her commentary and historical reflections on the FPUT problem. The article was titled "We thank Miss Mary Tsingou" in reference to the acknowledgement that appeared on the title page of the original FPUT technical report from 1955.
Publications
Joseph J. Devaney, Albert G. Petschek, Mary Tsingou Menzel. On the Production of Heavy Uranium Isotopes in a Very High Density Fast Neutron Flux (accessed Dec. 2012). Los Alamos Scientific Laboratory of the University of California, 1958; 17 pages.
See also
Kathleen Antonelli
Jean Bartik
Adele Goldstine
Mary Ann Mansigh
Marly |
https://en.wikipedia.org/wiki/Tensor%20Contraction%20Engine | The Tensor Contraction Engine (TCE) is a compiler for a domain-specific language that allows chemists to specify the computation in a high-level Mathematica-style language. It transforms tensor summation expressions to low-level code (C/Fortran) for specific hardware being mindful of memory availability, communication costs, loop fusion and ordering, etc. It is used primarily in computational chemistry.
References
TCE Homepage
Synthesis of High-Performance Parallel Programs for a Class of Ab Initio Quantum Chemistry Models
Computational chemistry
tensors |
https://en.wikipedia.org/wiki/Barry%20O%27Sullivan%20%28disambiguation%29 | Barry O'Sullivan is an Australian politician.
Barry O'Sullivan may also refer to:
Barry O'Sullivan (Professor), working in Artificial Intelligence
Barry O'Sullivan (baseball), in 1968 College World Series
Barry O'Sullivan, character in Journey to the Seventh Planet
See also
Barry Sullivan (disambiguation) |
https://en.wikipedia.org/wiki/Simple%20Ocean%20Data%20Assimilation | The Simple Ocean Data Assimilation (SODA) analysis is an oceanic reanalysis data set consisting of gridded state variables for the global ocean, as well as several derived fields. SODA was developed in the 1990s as a collaborative project between the Department of Atmospheric and Oceanic Science at the University of Maryland and the Department of Oceanography at Texas A&M University with the goal of providing an improved estimate of ocean state from those based solely on observations or numerical simulations. Since its first release there have been several updates, the most recent of which extends from 1958 to 2008, as well as a “beta release” of a long-term reanalysis for 1871–2008.
Initial release
Initially released in 2000, SODA included data from the 1994 World Ocean Atlas (WOA-94) such as MBT, XBT, CTD and station data; hydrography, SST, and altimeter measured sea level; as well as data from NODC, NCEP, and TOGA-TAO. The spatial extend of the first release was more limited than subsequent releases, extending from 62°S to 62°N, and covering the time period from January 1950 through December 1995.
Current release
The latest release of SODA (SODA 2.1.6) covers the time period from January 1958 to December 2008. As part of the data assimilation scheme, the system ingests a wide variety of observations including hydrographic profiles, ocean station data, moored temperature and salinity measurements, surface temperature and salinity observations from a variety of instruments (e.g., MBT, XBT, CTD), sea surface temperature (SST) from nighttime infrared observations from satellites, and satellite based sea level altimetry. Additionally, the numerical model used for forecasts is driven by surface winds from the European Center for Medium-Range Weather Forecasts ERA-40 reanalysis data set during the period between 1958 and 2001, and from the QuickSCAT scatterometer for 2002–2008. The state variable forecasts used in the assimilation are calculated using a general circulation model based on Parallel Ocean Program numerics with an average horizontal resolution of 0.25°x0.4°, and 40 vertical layers, which have 10-meter vertical resolution near the surface. Starting with version 1.4.2, the ocean model is run using a displaced pole grid configuration, allowing for the representation of Arctic Ocean processes. The data assimilation method used is based on a sequential analysis with a 10-day update cycle.
The reanalysis data is packaged into monthly means from January 1958 to December 2008 (although five-day means are also available) and stored in NetCDF format. Standard state variables were calculated including temperature, salinity, zonal and meridional velocities, and sea level, as well as several derived fields such as heat content. Finalized data was remapped from the displaced pole grid to a uniform horizontal grid with 0.5°x0.5° horizontal resolution and 40 vertical layers with 10-meter vertical resolution near the surface.
In addition to the 61-ye |
https://en.wikipedia.org/wiki/Church%20%28programming%20language%29 | Church refers to both a family of LISP-like probabilistic programming languages for specifying arbitrary probabilistic programs, as well as a set of algorithms for performing probabilistic inference in the generative models those programs define. Church was originally developed at MIT, primarily in the computational cognitive science group, run by Joshua Tenenbaum. Several different inference algorithms and concrete languages are in existence, including Bher, MIT-Church, Cosh, Venture, and Anglican.
References
Nondeterministic programming languages
Probabilistic software |
https://en.wikipedia.org/wiki/Prokofiev%20%28crater%29 | Prokofiev is a crater near the north pole of the planet Mercury, named after the Russian composer Sergei Prokofiev. Data from the MESSENGER spacecraft indicates that it contains water ice and organic compounds. Although other craters in Mercury's north polar region are also believed to contain ice, Prokofiev is the largest of them, with probable surface ice along the southern crater floor that is in perpetual darkness.
References
Impact craters on Mercury
Sergei Prokofiev |
https://en.wikipedia.org/wiki/Isql | In database computing, various utilities for accessing SQL-based databases use variants of the isql moniker - often with an implication of running interactive SQL. They include:
isql, a Sybase client
isql, a unixODBC program
iSQL, an Altibase utility
iSQL*Plus, a web-based interface to Oracle's SQL*Plus
ISQL, Informix SQL - an Informix tool
ISQL, InterBase SQL command utility
ISQL, a command-line interface for Microsoft SQL Server |
https://en.wikipedia.org/wiki/Philip%20J.%20Hanlon | Philip James Hanlon (born April 10, 1955) is an American mathematician, computer scientist, and academic administrator, who served as the 18th president of Dartmouth College, his alma mater, from June 2013 until June 2023. Previously, he served as the 13th provost and executive vice president for academic affairs of the University of Michigan from 2010 to 2013.
Early life
Hanlon was born and raised in Gouverneur, New York. He attended Dartmouth College, graduating Phi Beta Kappa with a Bachelor of Arts in 1977. While an undergraduate, he was a member of Alpha Delta, the fraternity that was a partial inspiration for the 1978 film Animal House. He earned a doctorate at the California Institute of Technology in 1981. His doctoral dissertation Applications of the Quaternions to the Study of Imaginary Quadratic Ring Class Groups was supervised by Olga Taussky-Todd.
Career
After completing his postdoctoral work at the Massachusetts Institute of Technology, Hanlon joined the faculty of the University of Michigan in 1986. He moved from associate professor to full professor in 1990. He was the Donald J. Lewis Professor of Mathematics. He was the associate dean for planning and finance for the University of Michigan College of Literature, Science, and the Arts from 2001 to 2004 and the vice provost from 2004 to 2010. In 2010, he was appointed as the provost of the University of Michigan. In June 2013 he became the 18th president of Dartmouth College. On January 25, 2022, Hanlon announced he would be stepping down as president in June 2023.
See also
Wheelock Succession
References
External links
Dartmouth College alumni
Dartmouth College
Presidents of Dartmouth College
University of Michigan faculty
Combinatorialists
Living people
People from Gouverneur, New York
1955 births
Sloan Research Fellows
California Institute of Technology alumni |
https://en.wikipedia.org/wiki/Universal%20portfolio%20algorithm | The universal portfolio algorithm is a portfolio selection algorithm from the field of machine learning and information theory. The algorithm learns adaptively from historical data and maximizes the log-optimal growth rate in the long run. It was introduced by the late Stanford University information theorist Thomas M. Cover.
The algorithm rebalances the portfolio at the beginning of each trading period. At the beginning of the first trading period it starts with a naive diversification. In the following trading periods the portfolio composition depends on the historical total return of all possible constant-rebalanced portfolios.
References
Machine learning
Algorithmic trading
Portfolio theories |
https://en.wikipedia.org/wiki/A%20Dead%20Horse | A Dead Horse is the fourth album by The Golden Palominos, released on January 1, 1989, by Celluloid Records.
Track listing
Personnel
Musicians
Jeff Bova – keyboards, programming
Aïyb Dieng – percussion
Anton Fier – drums, additional production
Robert Kidney – guitar
Amanda Kramer – vocals
Bill Laswell – bass violon
Chuck Leavell – Keyboards
Larry Saltzman – guitar
Nicky Skopelitis – guitar
Mick Taylor – guitar
Bernie Worrell – Hammond organ
Production and additional personnel
Oz Fritz – engineering, mixing, recording
William Garrett – recording
John Herman – recording
Steve Klatz – drum technician
Robert Longo – design, photography
Christiane Mathan – design
Robert Musso – recording
Frank W. Ockenfels– photography
Steve Rinkoff – mixing, recording
References
External links
1989 albums
Celluloid Records albums
The Golden Palominos albums
Albums produced by Anton Fier |
https://en.wikipedia.org/wiki/Guindy%20railway%20station | Guindy railway station is one of the railway stations of the Chennai Beach–Chengalpattu section of the Chennai Suburban Railway Network. It serves the neighbourhood of Guindy, a suburb of Chennai. It is located at about 14 km from Chennai Beach terminus and is situated at NH 45 in Anna Salai, with an elevation of 12 m above sea level.
History
With the completion of track-lying work of the Chennai Beach–Tambaram section of the Chennai Suburban Railway Network in March 1931, which began in 1928, the suburban services were started on 11 May 1931 between Beach and Tambaram, and the tracks were electrified on 15 November 1931, with the first MG EMU services running on 1.5 kV DC. The section was converted to 25 kV AC traction on 15 January 1967.
Gallery
See also
Chennai Suburban Railway
Railway stations in Chennai
References
External links
Guindy railway station on IndiaRailInfo.com
Local Train timings from/to Guindy
Railway stations in India opened in 1931
Stations of Chennai Suburban Railway
Railway stations in Chennai |
https://en.wikipedia.org/wiki/Dino%20Time | Dino Time (known as Back to the Jurassic in the US) is a 2012 computer-animated fantasy comedy adventure film produced by CJ Entertainment and distributed by Clarius Entertainment. The film was released on November 30, 2012 in South Korea.
The English dub was released on June 2, 2015 with the English dub voices led by Melanie Griffith, Jane Lynch, William Baldwin, Stephen Baldwin, and Rob Schneider.
Plot
Ernie Fitzpatrick (Pamela Adlon) is a daredevil boy who lives in Terra Dino with his best friend Max Santiago (Yuri Lowenthal) and his sister Julia (Tara Strong) who likes to tattle on him. Ernie and Julia live with their overprotective mother Sue (Jane Lynch), who has been chosen as the mother of the year. Ernie is told to go to the store after school to keep an eye on it, but he disobeys orders and goes with Max to the Terra Dino Museum to sneak into a forbidden area still under construction to see the bones of the ferocious Sarcosuchus. Julia follows them there and uses a quarter that Ernie gave her to set off the alarm. Julia is able to escape while Ernie and Max get caught by the guards, and Sue grounds Ernie for three weeks. Ernie disobeys orders once more by sneaking out of the house.
Ernie goes to Max's house to see if his father Dr. Santiago (Fred Tatasciore) has had any success with activating a time machine he built four years ago. While Ernie and Max admire the time machine, Julia, who followed Ernie, reveals herself and attempts to call Sue. When Ernie and Max try to stop her, the former ends up spilling soda on the time machine's control panel, activating it and sending the kids back in time 65 million years ago, to the time of the dinosaurs.
Upon exiting the time machine, the kids meet a friendly Tyrannosaurus named Tyra (Melanie Griffith) who runs an orphanage for dinosaurs without parents. Among the orphans is a hyperactive dinosaur (Rob Schneider) who quickly befriends the kids. Tyra decides to take the kids in as her own, but the other dinosaurs do not think that the kids can protect them from the evil Sarcosuchus Brothers, Sarco (William Baldwin) and Surly (Stephen Baldwin). The brothers reside in the lower valley, and because their lair is sinking into the tar pits ever so slowly, they plan to kill Tyra so they can move into and take over the upper valley. The brothers' three bird henchmen Morris (Nolan North), Borace (Tom Kenny) and Horace (John DiMaggio) find out about Tyra's "newborn babies", and because they mistake the time machine for a real egg, the brothers decide to have their henchmen steal it so they can lure Tyra to their lair and kill her. Back in the present, Sue and Dr. Santiago discover their kids' disappearances and learn that Tyra's real egg has switched places with the time machine.
Ernie, wanting to explore the environment before they leave, hides the power key of the time machine in his pocket and tells a lie that it's missing. The kids sneak away from Tyra early in the morning to "look" for the pow |
https://en.wikipedia.org/wiki/Ninjago%3A%20Skybound | Skybound is the sixth season of the computer-animated television series Ninjago: Masters of Spinjitzu (titled Ninjago from the eleventh season onward). The series was created by Michael Hegner and Tommy Andreasen. The season aired from 24 March to 15 July 2016, following the fifth season titled Possession. It is succeeded by the television special Day of the Departed.
The sixth season introduces the Djinn pirate Nadakhan and his crew of sky pirates as the main antagonists of the season. It follows the storyline of Nadakhan tricking each of the ninja characters by granting them three wishes and trapping their souls until only Jay and Nya are remaining. In the season finale, the entire events of the season are reversed when Jay makes his final wish.
Voice cast
Main
Jillian Michaels as Lloyd Garmadon, the Green Ninja
Vincent Tong as Kai, the red ninja and Elemental Master of Fire
Michael Adamthwaite as Jay, the blue ninja and Elemental Master of Lightning
Brent Miller as Zane, the white/titanium ninja and Elemental Master of Ice
Kirby Morrow as Cole, the black ninja and Elemental Master of Earth
Kelly Metzger as Nya, the Elemental Master of Water and Kai's sister
Paul Dobson as Sensei Wu, the wise teacher of the ninja
Kathleen Barr as Misako
Scott McNeil as Nadakhan
Supporting
Jennifer Hayward as P.I.X.A.L. a female nindroid
Paul Dobson as Flintlocke
Vincent Tong as Doubloon
Nicole Oliver as Dogshank
Ian James Corlett as Clancee
Michael Adamthwaite as Squiffy
Brian Dobson as Bucko
Ian James Corlett as Monkey Wretch
Scott McNeil as Clouse
Brent Miller as Echo Zane
Heather Doerksen as Skylor
Alan Marriott as Captain Soto
Production
Animation
The animation for the sixth season was produced at Wil Film ApS in Denmark.
Direction
The episodes for the sixth season were directed by Jens Møller, Michael Helmuth Hansen, and Peter Hausner.
Music
The season was accompanied by the release of a remixed version of The Weekend Whip, the show's official theme song, which is performed by The Fold. The remixed song is titled The Pirate Whip.
Release
A video clip providing a first look at the season was shown at the Lego Ninjago panel at San Diego Comic-Con in 2015, which was later released online on the Lego YouTube channel. The Lego Group teased the storyline for the season on 5 November 2015 with the release of the first official poster that depicted the character Jay battling against the season's antagonists, Nadakhan and his crew of sky pirates. An official trailer for the season was released on the Lego YouTube channel on 7 January 2016. The season premiered on Cartoon Network on 24 March 2016. The rest of the season was released throughout June and July 2016, with the season finale titled The Way Back being released on 15 July of the same year.
Plot
Clouse (who is now a ghost escaped from the Cursed Realm) finds the Teapot of Tyrahn and frees the evil Djinn or Genie Nadakhan. He grants Clouse three wishes, traps him inside the teapot, and then s |
https://en.wikipedia.org/wiki/Chennai%20Park%20railway%20station | Chennai Park railway station (or just Park station) is one of the railway stations in Chennai, India, on the Chennai Beach–Chengelpet section of the Chennai Suburban Railway Network. It serves the neighbourhood of Park Town, a suburb of Chennai. It is located at about 3 km from Chennai Beach terminus and is situated on Poonamallee High Road, across Chennai Central railway station. It has an elevation of 7 m above sea level.
History
The station lies in the Chennai Beach–Tambaram section of the Chennai Suburban Railway Network, the first suburban section of the city. With the completion of track-lying work in March 1931, which began in 1928, the suburban services were started on 11 May 1931 between Beach and Tambaram, and was electrified on 15 November 1931, with the first MG EMU services running on 1.5 kV DC. The section was converted to 25 kV AC traction on 15 January 1967.
Traffic
As of 2012, the station handles about 440,000 passengers a day.
See also
Chennai Suburban Railway
Railway stations in Chennai
References
External links
Chennai Park railway station on IndiaRailInfo.com
Local Train timings from/to Chennai Park
Railway stations in India opened in 1931
Stations of Chennai Suburban Railway
Railway stations in Chennai |
https://en.wikipedia.org/wiki/Twine%20%28device%29 | Twine is a stand-alone device that uses sensors to detect parts of its environment and that connects to a Wi-Fi network to communicate. Rules loaded into the Twine can test for sensor conditions and, based on logic, send messages through email or SMS, make an HTTP request, or light a LED. It can act as a data logger.
The device was created by Supermechanical in the US from funding raised on Kickstarter. Their original goal was for $35,000 yet they raised $556,541 from 3,966 backers on January 3, 2012. The product successfully shipped in November 2012. As of April 5, 2016, Supermechanical no longer manufactures Twine.
References
External links
Kickstarter-funded products
Home automation
Measuring instruments |
https://en.wikipedia.org/wiki/Segundamano | Segundamano is the core brand of the classifieds advertising company Grupo Anuntis-Segundamano. It is a network of local online classifieds in Spain and all Latin America, similar to Craigslist in the US. Segundamano has some 40 years of history, from its origins as a paper weekly magazine in Spain to its current localized websites in Spain, Mexico, Colombia and Argentina.
History
Segundamano was founded as a free weekly magazine of classified ads in 1978. It was acquired by the Canadian company Trader Classified Media in 1998.
In 2004, Anuntis and Segundamano merged to create the first classifieds company in the Spanish-speaking world: Grupo Anuntis-Segundamano.
The Norwegian Schibsted became main shareholder of Grupo Anuntis-Segundamano in 2006, buying 76% of the company. Schibsted also owns other classified ad websites, which are known in Spain and Latin America as InfoJobs, Coches.net, balçao.com.br or fotocasa.es.
In 2008, Grupo Anuntis-Segundamano decided to stop publishing the paper magazine Segundamano, after 30 years on newsstands, making itself a 100% online media company.
In 2013, Schibsted bought out the other shareholder Primeramá, to become the sole shareholder.
In 2015, the Spanish activities were rebranded to VIBBO. The Mexican activities continue using the Segundamano brand.
References
External links
Vibbo main website
Segundamano website (Mexico)
Grupo Anuntis-Segundamano
Schibsted official website
Online marketplaces of Spain
Online advertising services and affiliate networks |
https://en.wikipedia.org/wiki/Zug%20Stadtbahn | The Zug Stadtbahn () is an S-Bahn-style commuter rail network centred on Zug, Switzerland.
Opened on 12 December 2004, the network forms part of the Central Switzerland S-Bahn project (), which also includes the Lucerne S-Bahn ().
Lines
, the network consisted of the following lines:
Baar–Zug–Cham–Rotkreuz–(Luzern) (also of the Lucerne S-Bahn)
Baar Lindenpark–Zug–Walchwil–Arth-Goldau–(Erstfeld)
Reconstruction of the railway line on the east side of Lake Zug led to the suspension of the S2 between and beginning on June 9, 2019. S2 services from will operate to . S2 service was suspended altogether on 9 April 2020.
Rolling stock
The trains acquired by the SBB-CFF-FFS to operate the S1 services on the Zug Stadtbahn are SBB-CFF-FFS RABe 523 class electric multiple units. However, when the S1 was opened in 2004, there were not enough of these trains available to provide a full service, so they were supplemented by a (New Commuter Train) (NPZ), consisting of an SBB-CFF-FFS RBDe 560 hauling a B (second class car) owned by Thurbo as a (intermediate car) and an NPZ Bt as a (control car/cab car/driving trailer).
Additionally, Basel Regional S-Bahn trains were used to operate some services in 2008.
Since December 2008, all Zug Stadtbahn services have been operated by a fleet of twelve RABe 523s.
See also
Transport in Zug
References
External links
SBB-CFF-FFS – official site
S-Bahn in Switzerland
Stadtbahn |
https://en.wikipedia.org/wiki/Young-ja | Young-ja, also spelled Yeong-ja, is a Korean feminine given name. According to South Korean government data, it was the most popular name for baby girls born in 1940. Its meaning depends on the hanja used to write it.
Hanja and meaning
There are 34 hanja with the reading "young" on the South Korean government's list of hanja which may be used in given names. The syllable "ja" is generally written using a hanja literally meaning "child" (; ). In Japan, where this character is read ko, it was originally used as suffix for the names of girls in the aristocracy. The practice of adding -ko to girls' names spread to the lower classes following the 1868 Meiji Restoration. Names containing this character, such as Soon-ja and Jeong-ja, became popular when Korea was under Japanese rule from 1910 to 1945, but declined in popularity afterwards. By 1950 there were no names ending in "ja" in the top ten. Some ways of writing the name Young-ja in hanja include:
, first hanja meaning "flower petals" (). The same characters are also used to write the Japanese feminine given names Eiko and Hideko, among others.
, first hanja meaning "flourishing" (). The same characters are also used to write the Japanese feminine given names Eiko and Saeko, among others.
People
People with this name include:
Young-ja Lee (born 1936), South Korean music educator and composer
Jung Hye-sun (born Jung Young-ja, 1942), South Korean actress
Kim Young-ja (born 1949), South Korean volleyball player
Young-ja Cho (born 1951), South Korean sculptor
Lee Young-ja (handballer) (born 1964), South Korean team handball player and Olympic medalist
Yang Young-ja (born 1964), South Korean table tennis player
Lee Young-ja (comedian) (born 1968), South Korean comedian
Park Yeong-ja (born 1975), South Korean rower
Chang Yeong-ja, South Korean financier, one of the principals in the 1982 Lee–Chang scandal
Fictional characters with this name include:
Yeong-ja, the titular character of the 1975 South Korean film Yeong-ja's Heydays
See also
List of Korean given names
References
Korean feminine given names
Feminine given names |
https://en.wikipedia.org/wiki/Soon-ja | Soon-ja, also spelled Sun-ja, is a Korean female given name. According to South Korean government data it was the seventh-most popular name for baby girls in 1940. The same characters correspond to a number of Japanese female given names, including the on'yomi reading Junko and the kun'yomi readings Ayako, Masako, Michiko, Nobuko, and Yoshiko. It is one of a number of Japanese-style names ending in "ja", like Young-ja and Jeong-ja, that were popular when Korea was under Japanese rule, but declined in popularity afterwards. By 1950 there were no names ending in "ja" in the top ten.
People with this name include:
Soon Ja Du (born 1940), South Korean-born American convenience store owner
Jeong Sun-ja (born 1947), South Korean diver
Kim Sun-ja (athlete) (born 1966), South Korean sprinter
Lee Soon-ja (born 1939), South Korean former first lady, wife of Chun Doo-hwan
Lee Sun-ja (born 1978), South Korean sprint canoer
Park Soon-ja (born 1966), South Korean former field hockey player
See also
List of Korean given names
References
Korean feminine given names
Feminine given names |
https://en.wikipedia.org/wiki/Yext | Yext is a New York-based online marketing and search company. It offers brand updates using its cloud-based network of apps, search engines and other facilities. The company was founded in 2006 by Howard Lerman, Brian Distelburger, and Brent Metz. Its 2021 market cap was $2.0 billion and revenue was $354.7 million.
History
Yext was founded in 2006 as a local advertising business. Its 2009 revenue was $20 million after it switched to generating customer leads and charging per lead.
In August 2012, the company sold its pay-per-call business to IAC's CityGrid Media in order to focus on listings. By that time, Yext had raised $65.8 million in funding and handled 950,000 updates for 50,000 businesses.
Investors included Sutter Hill Ventures, Institutional Venture Partners, and WGI investments. By 2016, the company had $89 million in revenue and had expanded its offices at One Madison Avenue to 95,000 square feet.
In 2016, the company was ranked #60 on the Deloitte Fast 500 North America list.
In 2017, Yext was listed on the New York Stock Exchange.
In 2019, Yext announced that it was moving it's headquarters to 61 Ninth Ave in New York City, dubbed "The Yext Building". The distinctive building was designed by famed architect Rafael Viñoly. The move was originally planned for March 2020 but was delayed due to the onset of the COVID-19 Pandemic.
In March 2022, the company's founder Howard Lerman, announced that he was stepping down as CEO. He was succeeded as CEO by Michael Walrath who had been the Chairman of the Board since 2011.
References
Digital marketing companies of the United States
Marketing companies established in 2006
2017 initial public offerings
Companies listed on the New York Stock Exchange
2006 establishments in New York City
Software companies established in 2006 |
https://en.wikipedia.org/wiki/Dask | Dask or Desk () may refer to:
Dask, Hormozgan
Desk, Anbarabad, Kerman Province
Desk, Bam, Kerman Province
Desk-e Bala, Kerman Province
See also
DASK, the first computer in Denmark.
Dask (software), a library for performing parallel computation in Python |
https://en.wikipedia.org/wiki/ATN%20Food%20Food | ATN Food Food is a Canadian exempt Category B Hindi language specialty channel owned by Asian Television Network (ATN). It broadcasts programming from Food Food as well as Canadian content.
ATN Food Food is a lifestyle channel with a focus on Indian cuisine and food culture. Programming includes cooking shows, reality series, instructional shows, and food-related travel shows.
Programming
These shows have aired on ATN Food Food:
Budget Kitchen
Mummy Magic
Roti Raasta Aur India
Sanjeev Kapoor's Kitchen
Style Chef
Tea Time
Turban Tadka
Cook Smart
History
ATN Food Food was licensed by the CRTC on September 7, 2012 as ATN South Asian Cooking Channel 1. It officially launched on November 29, 2012 as ATN Food Food.
On September 28, 2018, the CRTC approved Asian Television Network's request to convert ATN Food Food from a licensed Category B specialty service to an exempted Cat. B third language service.
References
External links
Food Food
Digital cable television networks in Canada
Television channels and stations established in 2012
Hindi-language television in Canada |
https://en.wikipedia.org/wiki/Prep%20%26%20Landing%20%28series%29 | Prep & Landing is a series of computer animated television specials produced by the Walt Disney Animation Studios. Voices of Dave Foley, Derek Richardson, Sarah Chalke and W. Morgan Sheppard are featured in the specials.
TV specials
"Prep & Landing" (2009)
Wayne, a Christmas elf, is part of an elite organization known as "Prep & Landing", whose job is to ready millions of homes around the world for Santa Claus's visit. After working with "Prep & Landing" for two hundred twenty-seven years, Wayne looked forward to getting promoted. Instead, his former partner and trainee, Peterson, got the promotion, and Wayne is introduced to Lanny, a rookie whom Wayne has to also train. Wayne had been still bitter about the promotion, and decided to slack off during a mission. He permitted Lanny to do all of the work, which is disastrous. Meanwhile, Santa is informed mid-flight of a massive snow storm and that Wayne and Lanny have not fully prepared the house yet. He is told to cancel the landing, which has never happened before, when they promised to make it up for a boy named Timmy, who is living at the house. Wayne and Lanny discovered that the re-routing was a final decision, but after hearing Timmy thanking them in his sleep, Wayne decided to fix it. He called up Santa, telling him that he must land at Timmy's house. Wayne and Lanny then worked together to land Santa safely on Timmy's roof. On Christmas morning, Santa showed Wayne that Timmy had a merry Christmas. Santa offered a promotion to Wayne, but he turned it down so he can work with Lanny.
"Operation: Secret Santa" (2010)
Wayne and Lanny, who are now partners, are called by Magee to meet with a secret contact, known as Mrs. Claus, who sent them on a new mission to retrieve a box from Santa's secret workshop. Later they sneaked into Santa's office while he is asleep, using their high tech equipment from the previous film. Lanny's expertise at dressing the tree enabled them to enter the hidden workshop where they recovered the box and escaped just in time. Mrs. Claus revealed the contents of the box to be the last part of the first toy that Santa had ever made, and gave the complete toy back to him as his Christmas Present.
"Naughty vs. Nice" (2011)
The beginning of the special introduces the Coal Elf Brigade, a special unit of Christmas elves that are responsible for delivering lumps of coal to naughty children. While seeming cruel to some, the brigade added small, encouraging notes to the lumps such as "Try Harder next year", in an attempt to steer the children back to the nice list.
With the Big 2-5 fast approaching, Wayne and Lanny must race to recovered classified North Pole technology that has fallen into the hands of a hacker identified only as "JINGLESMELL1337". Desperate to prevent Christmas from descending into chaos, Wayne sought out, which is at the insistence of Magee, that the foremost Naughty Kid expert to aid in the mission, a bombastic member of the Coal Elf Brigade who als |
https://en.wikipedia.org/wiki/Girardia%20dorotocephala | Girardia dorotocephala is a species of dugesiid triclad native to North America.<ref>*Tyler S, Schilling S, Hooge M, and Bush LF (comp.) (2006–2012) Turbellarian taxonomic database. Version 1.7 Database</ref> It has been accidentally introduced in Japan. Girardia dorotocephala'' is cannibalistic, which led to its usage in memory transfer experiments.
References
Dugesiidae |
https://en.wikipedia.org/wiki/66th%20Primetime%20Emmy%20Awards | The 66th Primetime Emmy Awards honored the best in US prime time television programming from June 1, 2013 until May 31, 2014, as chosen by the Academy of Television Arts & Sciences. The ceremony was held on Monday, August 25, 2014, at the Nokia Theatre in Downtown Los Angeles, California, and was broadcast in the U.S. by NBC. Comedian and Late Night host Seth Meyers hosted the ceremony for the first time. The nominations were announced on July 10, 2014.
The scheduling of the Primetime Emmy Awards is coordinated with that of the Creative Arts Emmy Awards ceremony, which was held the previous weekend on August 16, 2014.
Breaking Bad was the major winner of the night, with five wins, including its second Primetime Emmy Award for Outstanding Drama Series for the second part of its fifth season. Modern Family won its fifth consecutive Primetime Emmy Award for Outstanding Comedy Series, tying with Frasier as the series with the most consecutive wins in the category. Gail Mancuso became the first woman in the history of the Primetime Emmy Awards to win the Outstanding Directing Emmy twice after her win for directing the Modern Family episode "Las Vegas". The Amazing Race won its tenth Primetime Emmy Award for Outstanding Reality-Competition Program as well. Other major winners of the night were Sherlock: His Last Vow (3 wins), American Horror Story: Coven and Fargo (2 wins each).
Scheduling of ceremony
The ceremony was held on a night other than Sunday for the first time since 1976 (the 28th Primetime Emmy Awards were also staged on a Monday that year, May 17). The ceremony's unusual date – a Monday night in late August – was due to two factors, primary being NBC's commitment to Sunday Night Football; since acquiring the National Football League's Sunday night game package in 2006, NBC, when it is their turn in the four-network rotation to air the Primetime Emmy Awards, usually schedules the ceremony for the Sunday before Labor Day weekend, to avoid conflicts with SNF in mid-September (when ABC, CBS or Fox normally air the ceremony). NBC's ideal date on the 2014 calendar for the ceremony (Sunday, August 24) led to the other scheduling factor — MTV's Video Music Awards, which were set for that night more than a year in advance (and would be staged in the L.A. area as well, at The Forum in Inglewood). On January 28, 2014, rather than go head-to-head with the VMA's, NBC announced that the ceremony would take place on Monday, August 25. The move would allow NBC to commit to a preseason Sunday Night Football broadcast for the 24th (a game between the Cincinnati Bengals and Arizona Cardinals); it also ensured the tradition of staging the Primetime Emmy Awards the weekend after the Creative Arts Emmy Awards (that ceremony was already set for August 16).
The ceremony's weeknight date and start time – 5:00 p.m. (PDT) in Los Angeles, California – led to concerns of rush hour traffic gridlock in Los Angeles' downtown core at the time of the ceremony; to help |
https://en.wikipedia.org/wiki/Tondiarpet%20railway%20station | Tondiarpet railway station is one of the railway station of the Chennai Central–Gummidipoondi section of the Chennai Suburban Railway Network. It serves the neighbourhood of Tondiarpet, a suburb of Chennai, and is located 5 km north of Chennai Central railway station. It has an elevation of 5 m above sea level.
History
The lines at the station were electrified on 13 April 1979, with the electrification of the Chennai Central–Gummidipoondi section.
Diesel loco shed
Tondiarpet diesel loco shed is located to the north of the station. Established in 1972 with the induction of a WDS4B-model diesel locomotive (WDS4B #19202), the shed was built to cater the shunting requirements of the marshalling yard at Tondiarpet, the goods sheds at Royapuram and Salt Cotaurs, and the coaching depot at Basin Bridge in Chennai division. With the augmentation of the fleet of WDS4B locos to 64, they were used in other locations in other divisions. In 2001, these were replaced with the WDM7-model main-line locomotives for passenger and yard shunting work. In April 2007, mainline WDM2-model locomotives were additionally inducted for hauling goods. As of June 2010, the total stock at the shed is 66, including 33 WDS4B locomotives, 4 WDS4D locomotives, 15 WDM2 locomotives and 14 WDM7 locomotives. In 2005, the shed registered the maximum holding of 74 locomotives. The shed has a total area of 75,000 sq m, including a covered area of 6,652 sq m, has a capacity of 50 locomotives. The shed employs about 378 persons.
See also
Chennai Suburban Railway
Railway stations in Chennai
References
External links
Tondiarpet station at Indiarailinfo.com
Stations of Chennai Suburban Railway |
https://en.wikipedia.org/wiki/Ilan%20Sadeh | Ilan Sadeh (born June 1, 1953) is an Israeli IT theoretician, entrepreneur, and human rights activist. He holds the position of Associate Professor of Computer Sciences and Mathematics at the University for Information Science and Technology "St. Paul The Apostle" in Ohrid, North Macedonia.
Biography
Background and activities
Sadeh was the first to claim publicly in the Israeli media that Israel has no right to be called the "heir" to Holocaust victims and no right to represent Holocaust survivors. According to him, Zionist leaders have little cause for pride in their actions during the Second World War – Zionist financiers withheld funds, while the JDC refused to help save Europe's Jewry, instead prioritizing the needs of the Yishuv in Palestine.
The situation in Israel brought Sadeh to the conclusion that the political system must be replaced. He entered politics and led a movement in behalf of Holocaust survivors. He published a few articles in Israeli newspapers and had a public impact. Sadeh was elected a representative of that community and ran in the preliminary election of the Labor Party for the Knesset, or Israeli Parliament (1996), but was not elected. Following his activities, Sadeh was recently threatened and accused of being a traitor. Sadeh has taken libel action over the charges in Israeli Court (2011).
Mathematical background and Sadeh's contribution
The asymptotic equipartition property (AEP) or "Shannon–McMillan–Breiman theorem" is a general property of the output samples of a stochastic source and is the basis of Information Theory. It is fundamental to the concept of typical sequences used in theories of coding theory. AEP was first introduced by Shannon (1948), proved in weak convergence by McMillan (1953) and later refined to strong convergence by Breiman (1957, 1960).
Shannon Theorems are based on AEP. Shannon provided in 1959 the first source-compression coding theorems. But neither he nor his successors could present any algorithm that attains Shannon bound.
Only in 1990, Ornstein and Shields have proposed an algorithm that attains Shannon bound. They proved the convergence to Shannon bound known as "rate-distortion function". But their algorithm is far from being useful and assumes a-priori knowledge of source distribution.
In Sadeh's Ph.D. research (1990–1992) he proposed a universal algorithm that attains Shannon bound. That is, it does not require a priori knowledge of source distribution and asymptotically has some computational advantages. The algorithm is a generalization and merging of Ornstein Shields Algorithm and Wiener Ziv Algorithm (1989).
When he tried to prove convergence to Shannon bound, known also as "Rate Distortion Function", he realized that he could not rely on AEP or Shannon McMillan Breiman Theory.
So in 1992, he presented and proved a new "Limit Theorem" and named it "Lossy AEP" or "Extended Shannon McMillan Breiman Theorem".
That means that the basis of "Information theory" |
https://en.wikipedia.org/wiki/Aargau%20S-Bahn | The Aargau S-Bahn ( or ) is an S-Bahn-style regional rail network serving the canton of Aargau, Switzerland.
History
Upon the timetable change on 14 December 2008, an S-Bahn numbering system was introduced for regional rail services in Aargau.
The new S-Bahn network was designed to complement the existing adjacent S-Bahn networks in Central Switzerland, Zurich and Basel. With that in mind, the line numbers selected for the new network were in the 20s (except the S14 Menziken–Aarau–Schöftland), so that there would be no conflict with the other networks.
The new network was essentially a redesignation of its existing lines. No new stops were built for it, and no new rolling stock was purchased. In some cases, however, certain services in the 2007/2008 timetable were modified (e.g. the Langenthal–Baden through connection), and to a limited extent the frequency of services was increased.
On 15 December 2019 the S29 was extended from Aarau to Sursee, replacing the Lucerne S-Bahn S8.
Lines
, the network consists of the following lines. Unless otherwise stated, the lines are .
Map
Related services
With the December 2021 timetable change, Swiss Federal Railways applied "S" designations to three Regio services in the canton of Solothurn:
: / ( –) –Olten
: –Solothurn
: –
These were numbered S20–S22 to avoid conflicts with the Aargau S-Bahn and are not part of the network.
See also
Transport in Aargau
References
External links
AAR bus+bahn– official site
SBB-CFF-FFS – official site
S-Bahn in Switzerland
S-Bahn |
https://en.wikipedia.org/wiki/Tirusulam%20railway%20station | The Tirusulam Railway Station is one of the railway stations of the Chennai Beach–Chengalpattu section of the Chennai Suburban Railway Network. It serves the neighbourhood of Tirusulam, a suburb of Chennai where the city's airport is located. It is located at a distance of from Chennai Beach terminus and is situated on the GST Road across the airport, with an elevation of above sea level.
History
The station was opened in the year 1985. The station lies in the Chennai Beach–Tambaram section of the Chennai Suburban Railway Network, the first suburban section of the city. With the completion of track-lying work in March 1931, which began in 1928, the suburban services were started on 11 May 1931 between Beach and Tambaram, and was electrified on 15 November 1931, with the first MG EMU services running on 1.5 kV DC. The section was converted to 25 kV AC traction on 15 January 1967.
Layout
The station has two suburban platforms and another island platform for long-distance mainline trains. Since mainline trains do not halt at the station, the island platform remains unused. The platform is 280 m long and has been considered to be extended to 575 m as there are plans to halt long-distance trains at the station.
Developments
The station is connected to the Chennai airport by means of a subway. Despite being situated at the entrance of the airport, the station does not cater to the needs of the air travellers due to the lack of proper approach corridors and other facilities. With the modernisation of Chennai Airport in 2012, several renovation processes are underway in the station. There are also plans to connect the station with the Metro Rail Station at the airport.
See also
Chennai Suburban Railway
Railway stations in Chennai
References
External links
Tirusulam railway station on IndiaRailInfo.com
Local Train timings from/to Tirusulam
Stations of Chennai Suburban Railway
Airport railway stations in India
Railway stations in Chengalpattu district |
https://en.wikipedia.org/wiki/Hello%20World%20%28disambiguation%29 | A "Hello, World!" program generally is a computer program that outputs or displays the message "Hello, World!".
Hello World may also refer to:
Music
"Hello World!" (composition), song by the Iamus computer
"Hello World" (Tremeloes song), 1969
"Hello World" (Lady Antebellum song), 2010
"Hello World", a song by Nik Kershaw from the album To Be Frank
"Hello, World!", a 2015 song by Bump of Chicken
"Hello World", a 2015 song by Ginny Blackmore
"Hello World", a song by Belle Perez
"Hello, World!", a 2018 song by Vocaloid producer YZYX featuring Hatsune Miku
"Hello World", a 2022 song by Alan Walker featuring Torine
Albums
Hello World, 2011 album by Back-On
Hello World (Information Society album), 2014
Hello World (Scandal album), 2014
Hello, World! (EP), 2022 EP by Xdinary Heroes
Hello World: The Motown Solo Collection, compilation album by Michael Jackson
Other uses
Helloworld Travel, an Australian-based travel agency
Helloworld (TV program), an Australian travel and lifestyle television program
Hello World (film), a 2019 Japanese animated film
Hello World (Web Series), a 2022 Telugu TV Series
Hello World: How to Be Human in the Age of the Machine, a book by Hannah Fry |
https://en.wikipedia.org/wiki/Jean-Loup%20Baer | Jean-Loup Baer is a computer scientist and Professor Emeritus at the University of Washington.
Biography
Jean-Loup Baer received the Diplome d'Ingénieur in Electrical Engineering and the Doctorat 3e cycle in Computer Science from the University of Grenoble (France) and the Ph.D. from UCLA in 1968 under the supervision of Gerald Estrin.
Awards and honors
In 1997, the Association for Computing Machinery named him an ACM Fellow "for contributions to the design and evaluation of parallel processing systems, in particular in the areas of cache coherence protocols and techniques to tolerate memory latency".
References
External links
University of Washington: Professor Emeritus, University of Washington homepage
Year of birth missing (living people)
Living people
University of Washington faculty
Fellows of the Association for Computing Machinery |
https://en.wikipedia.org/wiki/K%20shortest%20path%20routing | The k shortest path routing problem is a generalization of the shortest path routing problem in a given network. It asks not only about a shortest path but also about next k−1 shortest paths (which may be longer than the shortest path). A variation of the problem is the loopless k shortest paths.
Finding k shortest paths is possible by extending Dijkstra algorithm or Bellman-Ford algorithm.
History
Since 1957 many papers were published on the k shortest path routing problem. Most of the fundamental works were done between 1960s and 2001. Since then, most of the research has been on the problem's applications and its variants. In 2010, Michael Günther et al. published a book on Symbolic calculation of k-shortest paths and related measures with the stochastic process algebra tool CASPA.
Algorithm
The Dijkstra algorithm can be generalized to find the k shortest paths.
Variations
There are two main variations of the k shortest path routing problem. In one variation, paths are allowed to visit the same node more than once, thus creating loops. In another variation, paths are required to be simple and loopless. The loopy version is solvable using Eppstein's algorithm and the loopless variation is solvable by Yen's algorithm.
Loopy variant
In this variant, the problem is simplified by not requiring paths to be loopless. A solution was given by B. L. Fox in 1975 in which the k-shortest paths are determined in asymptotic time complexity (using big O notation. In 1998, David Eppstein reported an approach that maintains an asymptotic complexity of by computing an implicit representation of the paths, each of which can be output in O(n) extra time. In 2015, Akuba et al. devised an indexing method as a significantly faster alternative for Eppstein's algorithm, in which a data structure called an index is constructed from a graph and then top-k distances between arbitrary pairs of vertices can be rapidly obtained.
Loopless variant
In the loopless variant, the paths are forbidden to contain loops which adds an additional level of complexity. It can be solved using Yen's algorithm to find the lengths of all shortest paths from a fixed node to all other nodes in an n-node non negative-distance network, a technique requiring only 2n2 additions and n2 comparison, fewer than other available shortest path algorithms need. The running time complexity is pseudo-polynomial, being (where m and n represent the number of edges and vertices, respectively). In 2007, John Hershberger and Subhash Suri proposed a replacement paths algorithm, a more efficient implementation of Lawler's and Yen's algorithm with O(n) improvement in time.
Some examples and description
Example #1
The following example makes use of Yen’s model to find k shortest paths between communicating end nodes. That is, it finds a shortest path, second shortest path, etc. up to the Kth shortest path. More details can be found here.
The code provided in this example attempts to solve |
https://en.wikipedia.org/wiki/KnowledgeMan | KnowledgeMan was an early computer database management system created by Micro Data Base Systems of Lafayette, Indiana. KnowledgeMan was introduced in 1983 and was a PC-sized version of the company's mainframe computing database software. KnowledgeMan was promoted to users of dBase as faster database and using more sophisticated computing power. It had a macro language and SQL "structured query language" that allowed reports, its own spreadsheet interface and statistical graphics, i.e., pie charts, bar charts, etc. KnowledgeMan was designed by David Bartkus.
KnowledgeMan was the first database management system to be ported from a mainframe system. It was also the first written for the 16-bit PC processor. KnowledgeMan was the first to separate the database engine from the command interface, something that Microsoft Access was lauded for a decade later.
Micro Data Base Systems developed a graphical user interface for KnowledgeMan (by then more frequently called KMan) in 1985, although this was not popular with developers, who preferred to use the software's command line interface. In 1986 they introduced Guru, an expert system that incorporated KnowledgeMan's database and a graphical user interface. In the mid-1990s, KnowledgeMan was folded into Guru.
In 2004, Micro Data Base Systems folded and its product line was taken over by Savitar Corporation. Savitar folded in 2008.
Uses
Besides its uses in business computing, KnowledgeMan was used by archaeologists, including on a Neanderthal site in France, and on the remains of New Amsterdam in New York City and elsewhere, by physicists at FermiLab, and in a wide range of other domains.
References
Fourth-generation programming languages
1983 software
DOS software
Desktop database application development tools
Microcomputer software
Proprietary database management systems |
https://en.wikipedia.org/wiki/AnaROBIK | anaROBIK is the name given to an electropop computer-generated female vocalist created by British programmer Robert Hedin and accompanied by American multi-instrumentalist Bobby Trempealeau of Minneapolis, Minnesota.
"ana", as the character is called, was created using Yamaha's Vocaloid software, and specifically the "Lola" voice.
History
Hedin was formerly a member of the group Sister Friction, describing it on anaROBIK's website as yearning to be the "queerest pop band in the world". He conceived the new "vocalist" project in 2007, releasing the first album in 2010, followed by a remix album in 2011. The artist's website sets expectations for anaROBIK to "create musical compositions consisting of catchy melodies and body-friendly rhythms". Another stated goal is that "womanual [sic] performances by ana" as well as the computer performances "shall be used to create a rich and warm melding of woman and machine".
Technical details
anaROBIK's musical sounds are entirely synthesized, consisting of samples from the Moog Voyager, Roland Juno-60, Yamaha FS1R and SY85 and E-mu Audity 2000 and Emax, among others. Drums are mostly samples from Native Instruments' Battery library.
anaROBIK's recordings are mastered with a minimum of audio compression to avoid sounding "like crap".
Discography
Operator's Manual (2010)
Operator's Manual Addendum: The Remixes (2011)
References
External links
Culture of Minneapolis
Music software
Vocaloids introduced in 2007 |
https://en.wikipedia.org/wiki/Meenambakkam%20railway%20station | Meenambakkam Railway Station is one of the railway stations of the Chennai Beach–Chengalpet section of the Chennai Suburban Railway Network. It serves the neighbourhood of Meenambakkam, a suburb of Chennai. It is situated at Grand Trunk Road across Chennai International Airport Cargo Terminal, with an elevation of above sea level.
History
The station lies in the Chennai Beach–Tambaram section of the Chennai Suburban Railway Network, the first suburban section of the city. With the completion of track-lying work in March 1931, which began in 1928, the suburban services were started on 11 May 1931 between Beach and Tambaram, and was electrified on 15 November 1931, with the first MG EMU services running on 1.5 kV DC. The section was converted to 25 kV AC traction on 15 January 1967.
See also
Chennai Suburban Railway
Railway stations in Chennai
References
External links
Local Train timings from/to Meenambakkam
Stations of Chennai Suburban Railway
Railway stations in Chennai |
https://en.wikipedia.org/wiki/Cost%20database | A cost database is a computerized database of cost estimating information, which is normally used with construction estimating software to support the formation of cost estimates. A cost database may also simply be an electronic reference of cost data.
Overview
A cost database includes the electronic equivalent of a cost book, or cost reference book, a tool used by estimators for many years. Cost books may be internal records at a particular company or agency, or they may be commercially published books on the open market. AEC teams and federal agencies can and often do collect internally sourced data from their own specialists, vendors, and partners. This is valuable personalized cost data that is captured but often doesn't cover the same range that commercial cost book data can. Internally sourced data is difficult to maintain and do not have the same level of developed user interface or functionalities as a commercial product.
The cost database may be stored in relational database management system, which may be in either an open or proprietary format, serving the data to the cost estimating software. The cost database may be hosted in the cloud. Estimators use a cost database to store data in structured way which is easy to manage and retrieve.
Details
Costing data
The most basic element of a cost estimate and therefore the cost database is the estimate line item or work item. An example is "Concrete, 4000 psi (30 MPa)," which is the description of the item. In the cost database, an item is a row or record in a table (of items) and the description is a column or field for that record. Concrete may also be considered to be a material resource. In some systems, estimate line items and resources are the same, in other systems, various resources may be included with a line item. Other examples of resources are labor resources, such as carpenters, and equipment resources, such as cranes. Labor and equipment resources can be combined into a crew, which is then the assumed crew which will install the item or perform the work. Resources and crews can be stored as data in the cost database and can also be related to work items.
Examples of cost database line items:
Examples of cost database labor resources:
Examples of cost database equipment resources:
Examples of cost database crews:
Factor and adjustment data
Various factors and adjustments may be useful in the estimating process. Some examples include:
Factors to adjust costs from one location to another
Factors to adjust costs from one time to another
Currency conversion factors
Sales and use tax rates
Other tax, insurance, and bond rates
Overhead factors
Organizational data
Data which may be used to organize a cost estimate into groups and levels, and to summarize the cost details can also be part of a cost database. A popular coding system which can be applied to construction cost estimates is MasterFormat. Another coding method is Uniformat. Also, various types of work breakd |
https://en.wikipedia.org/wiki/Physical%20media | Physical media refers to the physical materials that are used to store or transmit information in data communications. These physical media are generally physical objects made of materials such as copper or glass. They can be touched and felt, and have physical properties such as weight and color. For a number of years, copper and glass were the only media used in computer networking.
The term physical media can also be used to describe data storage media like records, cassettes, VHS, LaserDiscs, CDs, DVDs, and Blu-rays, especially when compared with modern streaming media or content that has been downloaded from the Internet onto a hard drive or other storage device as files.
Types of physical media
Copper wire
Copper wire is currently the most commonly used type of physical media due to the abundance of copper in the world, as well as its ability to conduct electrical power. Copper is also one of the cheaper metals which makes it more feasible to use.
Most copper wires used in data communications today have eight strands of copper, organized in unshielded twisted pairs, or UTP. The wires are twisted around one another because it reduces electrical interference from outside sources. In addition to UTP, some wires use shielded twisted pairs (STP), which reduce electrical interference even further. The way copper wires are twisted around one another also has an effect on data rates. Category 3 cable (Cat3), has three to four twists per foot and can support speeds of 10 Mbit/s. Category 5 cable (Cat5) is newer and has three to four twists per inch, which results in a maximum data rate of 100 Mbit/s. In addition, there are category 5e (Cat5e) cables which can support speeds of up to 1,000 Mbit/s, and more recently, category 6 cables (Cat6), which support data rates of up to 10,000 Mbit/s (i.e., 10 Gbit/s).
On average, copper wire costs around $1 per foot.
Optical fiber
Optical fiber is a thin and flexible piece of fiber made of glass or plastic. Unlike copper wire, optical fiber is typically used for long-distance data communications, being that it allows for data transmission over far distances and can produce high transmission speeds. Optical fiber also does not require signal repeaters, which ends up reducing maintenance costs, since signal repeaters are known to fail often.
There are two major types of optical fiber in use today. Multimode fiber is approximately 62.5 µm in diameter and utilizes light-emitting diodes to carry signals over a maximum distance of about 2 kilometers. Single mode fiber is approximately 10 µm in diameter and is capable of carrying signals over tens of miles.
Like copper wire, optical fiber currently costs about $1 per foot.
Coaxial cables
Coaxial cables have two different layers surrounding a copper core. The inner most layer has an insulator. The next layer has a conducting shield. These are both covered by a plastic jacket. Coaxial cables are used for microwaves, televisions and computers.
This was the se |
https://en.wikipedia.org/wiki/Vincent%20Rutherford | Vincent "Vinny" Rutherford (born January 14, 1969) is an American television producer. He is best known as the executive producer of Attack of the Show! on the G4 network (2008–2012).
See also
History of television
External links
American television producers
Living people
1969 births
Place of birth missing (living people)
21st-century American people |
https://en.wikipedia.org/wiki/Insidetrak | Insidetrak is an employment website for job listings (thus also an example of vertical search) and online recruitment advertising network. The company aggregates job listings from job boards and company career sites in Australia and match them against a proprietary database of workplace reviews. The company intend to match job opportunity and insight information on the company advertising the job. A review process and technological solutions have been implemented to ensure reviews adhere to the community guidelines
Job advertisement is free in the site. The revenue model is currently undetermined with only one allusive sentence related to a-la-carte performance enhancement (advertising in a pay-per-click (PPC) model is the most likely interpretation).
Insidetrak currently operates job search engine only in Australia. Insidetrak is a local copy of the popular U.S. website glassdoor.com.
Like its American peers, Insidetrak is considered a minetent placed on their site.
See also
News Limited
Employment website
References
External links
Insidetrak Company Blog
Internet properties established in 2012
Employment websites |
https://en.wikipedia.org/wiki/Google%20Code-in | Google Code-in (GCI) was an international annual programming competition hosted by Google LLC that allowed pre-university students to complete tasks specified by various, partnering open source organizations. The contest was originally the Google Highly Open Participation Contest, but in 2010, the format was modified into its current state. Students that completed tasks won certificates and T-shirts. Each organization also selected two grand prize award winners who would earn a free trip to Google's Headquarters located in Mountain View, California. In 2020, Google announced cancellation of the contest.
History
The program began as Google Highly Open Participation Contest during 2007–2008 aimed at high school students. The contest was designed to encourage high school students to participate in open source projects. In 2010, the program was modified into Google Code-in. After the 2014 edition, the Google Melange was replaced by a separate website for Google Code-in. Mauritius, an African country, participated for the first time in 2016, and was noticed for its strong debut and in 2017, produced its first Grand Prize winner.
The contest was open to students thirteen years of age or older who were then enrolled in high school (or equivalent pre-university or secondary school program). Prizes offered by Google included a contest T-shirt and a participation certificate for completing at least one task and US$100 for every three tasks completed to a maximum of US$500. There was a grand prize of a trip to the Google headquarters for an award ceremony. Each participating open source project selected one contestant to receive the grand prize, for a total of 10 grand prize winners.
Statistics
Eligibility
Students must be between 13 and 17 years old (inclusive) to participate. In addition, students must upload parental consent forms as well as some documentation proving enrollment in a pre-university program.
Program
Google partners with certain open source organizations, all of which have had previous experience working with Google open source programs like Google Summer of Code. These organizations come up with "bite-sized" tasks that are self-contained, designed for pre-university students to complete. When the contest begins, students can register and claim tasks. Once claimed, students will have a set period of time to complete the task and can receive help from the mentor and the organization's community. Students may ask for deadline extensions if needed.
Prizes
Students who complete one task earn a certificate. Students who complete three tasks earn a T-shirt in addition to the certificate. There is a maximum of one T-shirt and one certificate per student. At the end of the competition, each organization will choose two students as the grand prize award winners and they will visit Google's Mountain View, California, USA headquarters for a four-day trip with an awards ceremony, an opportunity to meet with Google engineers, and a day of s |
https://en.wikipedia.org/wiki/Ninefold | Ninefold was a cloud computing company which provided infrastructure as a service (IaaS). Ninefold was headquartered in Sydney, Australia and was backed by Macquarie Telecom (), an ASX-listed Australian B2B telecommunications company.
History and growth
Launch
Ninefold was founded by Macquarie Telecom in 2011 to meet a growing demand for cloud computing in Australia. The company provided virtual servers from 2011 until it stopped trading a few years later.
Services
Ninefold offered self-managed virtual servers.
Virtual Servers
Ninefold’s customers were able to provision virtual servers via an online portal.
Australian Federal Government Hosting
On 26 June 2013, Ninefold became a member of the Data Centre as a Service (DCaaS) Multi-User List, which is published by the Australian Government Department of Finance. On 13 February 2015, Ninefold was listed as a product available to Federal Government agencies through Macquarie Telecom.
Docker Support
On 10 June 2014, Ninefold commenced support of Docker with the announcement that Docker 1.0.0 was available.
Competitors
AppScale
Heroku
Engine Yard
OpenShift
Amazon Web Services
DigitalOcean
References
External links
.
.
Cloud platforms
Cloud computing providers
Internet technology companies of Australia |
https://en.wikipedia.org/wiki/1794%20United%20States%20House%20of%20Representatives%20elections%20in%20South%20Carolina | Only one of the five South Carolina incumbents were re-elected.
Electoral data are only available for the 1st and 5th district of South Carolina's 6 districts at the time of the elections of 1794.
References
See also
List of United States representatives from South Carolina
United States House of Representatives elections, 1794 and 1795
1794
South Carolina
United States House of Representatives |
https://en.wikipedia.org/wiki/Astrostatistics | Astrostatistics is a discipline which spans astrophysics, statistical analysis and data mining. It is used to process the vast amount of data produced by automated scanning of the cosmos, to characterize complex datasets, and to link astronomical data to astrophysical theory. Many branches of statistics are involved in astronomical analysis including nonparametrics, multivariate regression and multivariate classification, time series analysis, and especially Bayesian inference. The field is closely related to astroinformatics.
Professional association
Practitioners are represented by the International Astrostatistics Association affiliated with the International Statistical Institute, the International Astronomical Union Working Group in Astrostatistics and Astroinformatics, the American Astronomical Society Working Group in Astroinformatics and Astrostatistics, the American Statistical Association Interest Group in Astrostatistics, and the Cosmostatistics Initiative. All of these organizations participate in the Astrostatistics and Astroinformatics Portal Web site.
References
Astrophysics
Applied statistics
Data mining
Machine learning |
https://en.wikipedia.org/wiki/Statewide%20opinion%20polling%20for%20the%202016%20United%20States%20presidential%20election | Statewide polls for the 2016 United States presidential election include the following. The polls listed here provide early data on opinion polling between the Democratic candidate, the Republican candidate, the Libertarian candidate, and the Green candidate. Prior to the parties' conventions, presumptive candidates were included in the polls. State polling is not conducted in all states for the election due to various factors. More polls usually are conducted in states that are considered swing states as more attention is given to the results. For determining a statistical tie, the margin of error provided by the polling source is applied to the result for each candidate.
Most recent polling
Immediately before the election, Hillary Clinton had a vote lead among states recently polled. State polls with results outside the margin of error showed 213 potential electoral votes for Clinton and 162 potential electoral votes for Donald Trump. In 14 states and two congressional districts (150 electoral votes), results for Clinton and Trump were within the margin of error. For the two states and one district without recent polling, one state (6 electoral votes) voted for Mitt Romney in the 2012 election, while one state and district (7 electoral votes) voted for Barack Obama. Third party candidates, such as Jill Stein and Gary Johnson, were also included in many statewide polls. They have not received support in statewide polling that surpasses the two main party nominees. Independent candidate Evan McMullin was tied with Donald Trump in the state of Utah, but he has only been included on a very limited number of statewide polls.
Alabama
9 electoral votes (Republican in 2008) 60%–39%(Republican in 2012) 61%–38%
Winner (Republican in 2016) 62%-34%
Alaska
3 electoral votes (Republican in 2008) 59%–38%(Republican in 2012) 55%–41%
Winner (Republican in 2016) 51%-37%
Two-way race
Four-way race
Arizona
11 electoral votes (Republican in 2008) 53%–45%(Republican in 2012) 53%–44%
Winner (Republican in 2016) 48%-45%
Two-way race
Three-way race
Four-way race
Arkansas
6 electoral votes (Republican in 2008) 59%–39%(Republican in 2012) 61%–37%
Winner (Republican in 2016) 61%-34%
Two-way race
Four-way race
California
55 electoral votes (Democratic in 2008) 61%–37%(Democratic in 2012) 60%–37%
Winner (Democratic in 2016) 62%-32%
Two-way race
Four-way race
Colorado
9 electoral votes (Democratic in 2008) 54%–45%(Democratic in 2012) 51%–46%
Winner (Democratic in 2016) 48%-43%
Two-way race
Three-way race
Four-way race
Five-way race
Connecticut
7 electoral votes (Democratic in 2008) 61%–38%(Democratic in 2012) 58%–41%
Winner (Democratic in 2016) 55%-41%
Four-way race
Delaware
3 electoral votes (Democratic in 2008) 62%–37%(Democratic in 2012) 59%–40%
Winner (Democratic in 2016) 53%-42%
Four-way race
District of Columbia
3 electoral votes (Democratic in 2008) 92%–7%(Democratic in 2012) 91%–7%
Winner (Democratic in 2016) 91%-4%
No polling was |
https://en.wikipedia.org/wiki/The%20Snow%20Queen%20%282012%20film%29 | The Snow Queen () is a 2012 Russian 3D computer-animated fantasy adventure family film written by Vadim Sveshnikov and directed by Vladlen Barbe and Maxim Sveshnikov. The Snow Queen was produced by Wizart Animation and released by Bazelevs. InlayFilm acted as co-production studio. The film is a remake of the 1844 story of the same name by Hans Christian Andersen. The film was produced by Timur Bekmambetov, Alexander Ligaiy, Yuri Moskvin, Sergey Rapoport and Olga Sinelshchikova.
Like the fairy tale, the main character and heroine of the film is Gerda (voiced by Nyusha and Jessica Straus). Set after the Snow Queen invoked the spell of eternal winter, the film follows the story of Gerda who sets out on an improbable frigid journey up North to save Kai. The Snow Queen never realized Gerda was truly the last threat from winter domination when henchman troll Orm (voice of Ivan Okhlobystin and Doug Erholtz) joins Gerda's quest as a friend.
The Snow Queen was one of the most anticipated projects of the Russian film industry in 2012. Inspirational evaluation of The Snow Queen at international film markets set its stage for international distribution. The film was released on 31 December 2012 in Russia. In the United States, it was released on 11 October 2013. After receiving generally positive reviews from critics, an Annecy International Animated Film Festival review noted the film's ambition is reminiscent of the golden age of Russian animation. The film also achieved significant commercial success, earning 233 million rubles domestically while total box office amounted to $13.6 million, nearly doubling its $7 million budget. The film became a milestone in the history of Russian animation as it received accolades from Moscow Film Festival and Zelenograd International Youth Film Festival.
Plot
The Snow Queen covered the world in ice. Only Master Vegard stands in her way, whose mirrors reflect not only appearances but also souls. One day the polar wind takes away Vegard and his wife Una, but they hide their children Gerda and Kai. Years later, the Snow Queen's servile troll Orm (who can shape shift into a black weasel) locates Kai, who is deemed Vegard's successor, at the orphanage St. Peter's Kids Shelter. At the orphanage Gerda sews mittens. After a tangle between both siblings and Orm, Kai is abducted by the North Wind, a polar cold spell that can only be invoked by the Snow Queen. The polar vortex shuttles Kai to the Snow Queen's palace. Gerda embarks on a journey with Orm and her pet white weasel Luta across the icy lands to rescue her brother.
They first enter a garden dome run by an old lady who seems nice, but her true intentions are to drug and enslave Gerda to grow and sell flowers. Orm and Luta catch wind of the scheme and thwart it. The lady sends out her carnivorous plant, Ivy, but the trio make their escape. Meanwhile, in the ice palace, Kai arrives and the Snow Queen leads him to her throne room. The Queen's mirror, after examining Kai, |
https://en.wikipedia.org/wiki/DcGO | dcGO is a comprehensive ontology database for protein domains. As an ontology resource, dcGO integrates Open Biomedical Ontologies from a variety of contexts, ranging from functional information like Gene Ontology to others on enzymes and pathways, from phenotype information across major model organisms to information about human diseases and drugs. As a protein domain resource, dcGO includes annotations to both the individual domains and supra-domains (i.e., combinations of two or more successive domains).
Concepts
There are two key concepts behind dcGO. The first concept is to label protein domains with ontology, for example, with Gene Ontology. That is why it is called dcGO, domain-centric Gene Ontology. The second concept is to use ontology-labeled protein domains for, for example, protein function prediction. Put it in a simple way, the first concept is about how to create dcGO resource, and the second concept is about how to use dcGO resource.
Timelines
In 2010, the algorithm behind the dcGO was initially published as an improvement to the SUPERFAMILY database.
In 2011, the 'dcGO Predictor' was ranked 10th in the 2011 CAFA competition when applied to Gene Ontology. This predictor is only domain-based method without machine learning.
In 2012, the database was officially released, published in NAR database issue.
In 2013, the webserver was improved to support many analyses using dcGO resource.
In the early 2014, the 'dcGO Predictor' was submitted for both function and phenotype predictions, ranked top in 4th in CAFA phenotype prediction.
In the late 2014, an open-source R package dcGOR was developed to help analyse ontologies and protein domain annotations.
Webserver
Recent use of dcGO is to build a domain network from a functional perspective for cross-ontology comparisons, and to combine with species tree of life (sTOL) to provide a phylogenetic context to function and phenotype.
Software
Open-source software dcGOR is developed using R programming language to analyse domain-centric ontologies and annotations.
Supported analyses include:
easy access to a wide range of ontologies and their domain-centric annotations;
able to build customised ontologies and annotations;
domain-based enrichment analysis and visualisation;
construction of a domain (semantic similarity) network according to ontology annotations;
significance analysis for estimating a contact (statistical significance) network using random walker algorithm;
high-performance parallel computing.
Functionalities under active development are:
algorithm and implementations for creating domain-centric ontology annotations;
ontology term prediction for input protein domain architectures;
reconstruction of ancestral discrete characters using maximum likelihood/parsimony.
See also
SCOP
Pfam
InterPro
Structural domain
Gene Ontology
References
External links
SUPERFAMILY
SCOP
Biological databases
Genetics in the United Kingdom
Genomics
Protein clas |
https://en.wikipedia.org/wiki/Computaci%C3%B3n%20y%20Sistemas | Computación y Sistemas is a peer-reviewed on Artificial Intelligence and Computing Science research providing a recognized forum for research in the area of computer science at Latin America. It was established in 1997 by Professor Adolfo Guzmán Arenas and it is published by Instituto Politécnico Nacional with the support of CONACyT.
Abstracting and indexing
The journal is abstracted and indexed in DBLP, Scielo, and Scopus.
Computación y Sistemas is included in the CONACyT until 2017.
Open Access Policy
Computación y Sistemas provides immediate open access to its peer-reviewed content.
Former Editors in Chief
Juan Humberto Sosa Azuela (IPN), Isaac Scherson (University of California, Irvine) & Ulises Cortés (KEMLg-UPC) (2009–2012)
Juan Luis Díaz de León (IPN), Jean Paul Frédéric Serra (Centre de Morphologie Mathématique) & Gerhard X. Ritter (University of Florida) (2004–2009)
George A. Bekey (USC), Juan Luis Díaz de León (IPN), Jean Paul Frédéric Serra (Centre de Morphologie Mathématique), Gerhard X. Ritter (University of Florida) & Adolfo Steiger Garçao (New University of Lisbon) (2003–2004)
George A. Bekey (USC), Adolfo Guzmán Arenas (IPN), Ramón López de Mántaras (CSIC) & Adolfo Steiger Garçao (New University of Lisbon) (1997 -2003)
References
External links
CONACyT registry of excellence magazinesEvaluation Criteria
http://scielo.unam.mx/scielo.php/script_sci_serial/pid_1405-5546/lng_en/nrm_iso
Computación y Sistemas
English-language journals
Quarterly journals |
https://en.wikipedia.org/wiki/Leonar3Do | Leonar3Do is an integrated software and hardware platform capable of creating a three-dimensional VR (virtual reality) environment on desktop computers and other devices, allowing for the creation, manipulation, and analysis of three-dimensional objects in a three-dimensional space. Leonar3Do was originally invented by Daniel Rátai in Budapest, Hungary. Products and applications based on the Leonar3Do platform are developed and marketed by Leonar3Do International Inc.
Technology and structure
The Leonar3Do has the following main hardware components:
The spatial input device, known as the "bird", as a replacement for the traditional mouse. The bird has six degrees of freedom, allowing users to grab, move and rotate their 3D model or their space.
Three-dimensional glasses with built-in infra-LEDs for the detection of the eyeglasses’ position.
Three tracking sensors, placed on the top of the display
Central panel for bi-directional communication
The three sensors' task is to track the position of both the 3D glasses and the input device (bird) and send this information to the central unit. The central unit transmits the received data to the computer and the Leonar3Do system software, which generates, manages, and displays the virtual reality environment produced by the data processed. The result is a complete 3D VR environment, where the user can view the virtual object from any angle. Leonar3Do also has a complete software development kit, which allows the development of new applications based on the Leonar3Do platform. With Leonar3Do's modeling software, users can give physical attributes to virtual objects like changeable mass, gravity, impeccability, and rebounding.
Products and additional applications
Leonar3Do hardware kit
This kit contains the following components:
central panel
3D glasses
bird (the spatial input device)
the 3 sensors
AVC (Analog Video Controller)
DVC (Digital Video Controller)
Leonar3Do Software and Operating Instructions DVD
Products
Leopoly: Application built on the Leonar3Do platform focusing on online co-creation, sculpting, and 3D model sharing.
Vimensio: Bundle of Leonar3Do hardware elements and Vimensio educational software built on the Leonar3Do platform, with a main focus on primary, secondary, and higher education. Users can create VR environments, simulations or new 3D VR applications for effective studying.
Vimensio Edit: Gives users the ability to create three-dimensional educational applications without the use of programming languages.
Vimensio Play: A cross-platform application system that allows the presentation of already created three-dimensional content.
Software applications
Software applications require a 3D monitor and a Leonar3Do Professional Edition Kit or a Vimensio Kit, including the Leonar3Do system software and hardware elements.
LeoWorld: 3D VR animation and modelling software allowing for real-time polygon optimization, lighting modification, and 3D coloring. The software form |
https://en.wikipedia.org/wiki/LANDFIRE | The LANDFIRE Program (“Landscape Fire and Resource Management Planning Tools") produces geo-spatial products and databases covering the United States. LANDFIRE is a partnership between the wildland fire management programs of the United States Department of Interior, the USDA Forest Service and the Nature Conservancy. LANDFIRE was chartered to create a nationally complete, comprehensive, and consistent set of products that support cross-country planning, and fire and natural resource management. This multi-partner Program produces consistent, comprehensive, geospatial data and databases that describe vegetation, wildland fuel, and fire regimes across the United States and insular areas. LANDFIRE's mission is to provide agency leaders and managers with a common "all-lands" data set of vegetation and wildland fire/fuels information for strategic fire and resource management planning and analysis.
LANDFIRE spatial products were designed for use at very large landscape, state, regional or national scales. LANDFIRE Program products have been used in a variety of ways, from supporting large federal wildland fire-related applications such as the Wildland Fire Decision Support System, and the Cohesive Strategy initiative, to landscape-level conservation planning, regional wildlife studies, ecosystem services, biofuels, and national carbon stock and biomass assessments. The LANDFIRE Program and the Nature Conservancy’s Conservation Gateway and Web-Hosted Applications Map websites list and describe a variety of applications of LANDFIRE products.
LANDFIRE began as a prototype in 2002 and was officially chartered in 2004 by the Wildland Fire Leadership Council (WFLC). In 2017 the United States Department of the Interior presented LANDFIRE with its Environmental Achievement Award, naming it the year's "Environmental Dream Team" in recognition for being "environmental champions and agents of change who work across organizational boundaries to enhance environmental stewardship, create efficiencies, improve communication, avoid or address conflict at the lowest levels, or reduce environmental review times."
Products
LANDFIRE comprises three primary areas of work: digital spatial data, quantitative vegetation dynamics models and a small number of user tools.
Spatial Data
The LANDFIRE Program product set includes a suite of more than 20, 30-meter spatial resolution raster data sets that cover the entire nation, regardless of ownership. A subset of LANDFIRE products is available for U.S. insular areas. The data sets are created using a consistent set of processes and inputs. They are fully compatible with each other, and are ready to use immediately after being downloaded. All layers are freely available from the LANDFIRE Program website and are delivered as continuous national mosaics, or as Web Service Calls in Arc GRID format. Data are also available in Arc GRID and Geo Tiff formats for user specified areas through the LANDFIRE Data Distribution Site. |
https://en.wikipedia.org/wiki/History%20of%20network%20traffic%20models | Design of robust and reliable networks and network services relies on an understanding of the traffic characteristics of the network. Throughout history, different models of network traffic have been developed and used for evaluating existing and proposed networks and services.
Demands on computer networks are not entirely predictable. Performance modeling is necessary for deciding the quality of service (QoS) level. Performance models in turn, require accurate traffic models that have the ability to capture the statistical characteristics of the actual traffic on the network. Many traffic models have been developed based on traffic measurement data. If the underlying traffic models do not efficiently capture the characteristics of the actual traffic, the result may be the under-estimation or over-estimation of the performance of the network. This impairs the design of the network. Traffic models are hence, a core component of any performance evaluation of networks and they need to be very accurate.
“Teletraffic theory is the application of mathematics to the measurement, modeling, and control of traffic in telecommunications networks. The aim of traffic modeling is to find stochastic processes to represent the behavior of traffic. Working at the Copenhagen Telephone Company in the 1910s, A. K. Erlang famously characterized telephone traffic at the call level by certain probability distributions for arrivals of new calls and their holding times. Erlang applied the traffic models to estimate the telephone switch capacity needed to achieve a given call blocking probability. The Erlang blocking formulas had tremendous practical interest for public carriers because telephone facilities (switching and transmission) involved considerable investments. Over several decades, Erlang’s work stimulated the use of queuing theory, and applied probability in general, to engineer the public switched telephone network. Teletraffic theory for packet networks has seen considerable progress in recent decades. Significant advances have been made in long-range dependence, wavelet, and multifractal approaches. At the same time, traffic modeling continues to be challenged by evolving network technologies and new multimedia applications. For example, wireless technologies allow greater mobility of users. Mobility must be an additional consideration for modeling traffic in wireless networks. Traffic modeling is an ongoing process without a real end. Traffic models represent our best current understanding of traffic behavior, but our understanding will change and grow over time.”
Network traffic models usage
Measurements are useful and necessary for verifying the actual network performance. However, measurements do not have the level of abstraction that makes traffic models useful. Traffic models can be used for hypothetical problem solving whereas traffic measurements only reflect current reality. In probabilistic terms, a traffic trace is a realization of a random pro |
https://en.wikipedia.org/wiki/Ilanga%20bicarinata%20bicarinata | Ilanga undata is a species of sea snail, a marine gastropod mollusk in the family Solariellidae.
Subspecies
Ilanga undata sphinx Herbert, 1987
Ilanga undata undata (G. B. Sowerby II, 1870)
Description
The height of the shell attains 9 mm, its diameter 15 mm. The depressed, pale reddish or fawn shell is perforated with a round umbilicus up to the apex. It is faintly spirally lirate and angulated almost above the suture. It is rounded-angular at the middle of the keel. The corners are red-stained. The interstices show red waving lines.
Distribution
This marine species occurs off the Agulhas Bank to the West Cape Province, South Africa
References
Thiele J. (1925). Gastropoden der Deutschen Tiefsee-Expedition. II Teil. Wissenschaftliche Ergebnisse der Deutschen Tiefsee-Expedition auf dem Dampfer "Valdivia" 1898-1899. 17(2): 35-382, pls 13-46
External links
Adams, A. & Reeve, L. A. (1848-1850). Mollusca. In A. Adams (ed.), The zoology of the voyage of H.M.S. Samarang, under the command of Captain Sir Edward Belcher, C.B., F.R.A.S., F.G.S., during the years 1843-1846. Reeve & Benham, London, x + 87 pp., 24 pls.
G.B. Sowerby (1870), Descriptions of forty-eight new Species of Shells; Proceedings of the Zoological Society of London
K.H. Barnard, Contributions to the knowledge of South African marine Mollusca. Part IV. Gastropoda : Prosobranchiata; Annals of the South African Museum v. 47 (1963-1974) p. 236-237
Herbert D.G. (2015). An annotated catalogue and bibliography of the taxonomy, synonymy and distribution of the Recent Vetigastropoda of South Africa (Mollusca). Zootaxa. 4049(1): 1-98.
To World Register of Marine Species
Gastropods.com: Ilanga undata undata
Endemic fauna of South Africa
bicarinata
Gastropods described in 1870 |
https://en.wikipedia.org/wiki/Chassis%20Plans | CP (North America) Inc., doing business as Chassis Plans, is an American military and industrial computer systems manufacturer specializing in rackmount computers, military computers, rugged computers, industrial PCs, rackmount LCDs, single-board computer systems with passive and active backplanes and motherboard systems. Chassis Plans is a spin-off of Industrial Computer Source.
Products
Chassis Plans specializes in providing custom and semi-custom solutions, with an emphasis on systems tailored exactly to the application requirements. A wide variety of rackmount 1U thru 5U computer systems are offered as standard products as outgrowths of custom designs. A line of military grade LCD keyboard systems is also offered.
History
1997: Established as a spin-off of Industrial Computer Source providing engineering services and computer system designs.
1998: Recognized by Internet Telephony Center Stage for the design of the 717-BP20 Rackmount Computer.
2001: Chassis Plans expands product offering from design services to complete turnkey computer systems.
2006: COTS Journal article "Rugged Displays Suit Up for Challenging Environments".
2011: Honored by 2nd selection in Inc 500/5000 list for 2011.
2012: Honored by 3rd selection in Inc 500/5000 list for 2012.
2013: Honored by 4th selection in Inc 500/5000 list for 2013. #39 of Top 100 Computer Hardware Companies.
2014: Funds 'Chassis Plans Leadership in Engineering Scholarship'.
2014: Intelligent Aerospace Magazine Article - "Enhancing displays used in unmanned aircraft systems ground control stations"
2014: COTS Journal Magazine article - "Ruggedized Servers Revamp Data-Centric Military Environments"
2014: Awards Leadership in Engineering Scholarship.
2014: Named for fifth time to Inc 500/5000 list.
2014: Secures trademarks for "Industrial Computer Source-Book" and "Military Computer Source-Book".
2015: Mil Embedded Systems magazine awards the TFX1-19 rackmount LCD an Editor's Choice Award
See also
List of computer hardware manufacturers
List of computer system manufacturers
References
Computer companies of the United States
Computer enclosure companies
Manufacturing companies based in San Diego
Computer companies established in 1997
1997 establishments in California |
https://en.wikipedia.org/wiki/GendBuntu | GendBuntu is a version of Ubuntu adapted for use by France's National Gendarmerie. The Gendarmerie have pioneered the use of open source software on servers and personal computers since 2005 when it adopted the OpenOffice.org office suite, making the OpenDocument .odf format its nationwide standard.
Project
The GendBuntu project derives from Microsoft's decision to end the development of Windows XP, and its inevitable replacement with Windows Vista or a later edition of Windows on government computers. This meant that the Gendarmerie would have incurred large expenses for staff retraining even if it had continued to use proprietary software.
One of the main aims of the GendBuntu project was for the organisation to become independent from proprietary software distributors and editors, and achieve significant savings in software costs (estimated to be around two million euros per year).
Around 90% of the 10,000 computers purchased by the Gendarmerie per year are bought without an operating system, and have GendBuntu installed by the Gendarmerie's technical department. This has become one of the major incentives of the scheme for staff; transferring to GendBuntu from a proprietary system means the staff member receives a new computer with a widescreen monitor.
The main goal is to migrate 80,000 computers by the end of 2014, a date which coincides with the end of support for Microsoft Windows XP. 35,000 GendBuntu desktops and laptops have been deployed as of November 2011.
A major technical problem encountered during the development of the project was keeping the existing computer system online while the update took place, not only in metropolitan France but also in overseas Departments and Regions. It was solved partly by redistributing dedicated servers or workstations on local area networks (depending on the number of employees working on each LAN) and with the use of an ITIL-compliant qualifying process.
An IT Support team helped to implement the changes. This included the "core team" at Gendarmerie headquarters at Issy-les-Moulineaux and the "running team" of four located at the Gendarmerie data center at Rosny-sous-Bois.
Timeline
2004 - OpenOffice.org software replaces 20,000 copies of the Microsoft Office suite on Gendarmerie computers, with the transfer of all 90,000 office suites being completed in 2005.
2006 - Migration begins to the Mozilla Firefox web browser, on 70,000 workstations, and to the Mozilla Thunderbird email client. The Gendarmerie follows the example of the Ministry of Culture in this decision. Other software follows, such as GIMP.
2008 - The decision is made to migrate to Ubuntu on 90% of the Gendarmerie's computers by 2016. Ubuntu is installed on 5,000 workstations installed all over the country (one on each police station's LAN), primarily for training purposes.
2009 - Nagios supervision begins
2010 - 20,000 computers ordered without a pre-installed operating system
January 2011 - Beginning of the large sca |
https://en.wikipedia.org/wiki/ARM%20Accredited%20Engineer | ARM Accredited Engineer (AAE) was a program of professional accreditations awarded by ARM Holdings. The AAE program was designed for computer software and hardware engineers wishing to validate their knowledge of ARM technology. The program was launched in 2012 at a series of events including ARM TechCon 2012.
The AAE program consisted of a number of certifications, each with its own syllabus, and each assessed by means of a separate one-hour multiple-choice exam.
The AAE program was ended in 2016.
Certifications
ARM Accredited Engineer (AAE)
AAE, an entry-level accreditation, was the first to be launched. The AAE syllabus covered software-related aspects of the ARMv7 Architecture, with a specific focus on Cortex-A and Cortex-R profiles, including applications processors and real-time processors. It did not cover Cortex-M systems. The AAE certification was aimed at general embedded software and systems developers who have a broad knowledge of ARM technology.
The syllabus covered the following subject areas:
ARM architecture (30%)
Software development (30%)
Software optimization (15%)
System (10%)
Software debug (8%)
Implementation (7%)
ARM Accredited MCU Engineer (AAME)
The AAME accreditation was launched on 16 September 2013. It was an entry-level accreditation, similar to the basic AAE accreditation, but focused on the ARMv7 Cortex-M profile. This accreditation was aimed at general embedded software engineers with a broad knowledge of ARM technology, with a bias toward microcontrollers.
The syllabus covered the following subject areas:
ARM architecture (35%)
Software development (30%)
Debug (13%)
Software optimization (10%)
Implementation (7%)
System Startup (5%)
Other accreditations
The following accreditations were being considered for launch between 2013 and 2016:
ARM Accredited Cortex-A Engineer (AACAE)
ARM Accredited Cortex-R Engineer (AACRE)
AA Windows on ARM Developer (AAWoAD)
AA Linux on ARM Developer (AALoAD)
AA Android on ARM Developer (AAAoAD)
AA Graphics Specialist (AAGS)
AA Security Specialist (AASS)
ARM Accredited Cortex-M Engineer (AACME)
ARM Accredited SoC Developer (AASoCD)
ARM Accredited SoC Specialist (AASoCS)
Exams
All AAE Program exams were delivered by Prometric Inc. as supervised computer-based tests on dedicated test platforms throughout their network of 10,000 Authorized Prometric Test Centers (APTCs) around the world. There were 70 multiple choice questions. Candidates were given one hour to complete the test. Results were issued instantly on-screen. Grades are either pass or fail - no letter or percentage grades are issued. On passing the exam, candidates were able to request a paper certificate to be mailed to them.
References
ARM architecture
Computer engineering
Information technology qualifications |
https://en.wikipedia.org/wiki/TOWIE%20Live | "TOWIE Live" is the second episode of a series of special episodes airing throughout December 2012 of The Only Way Is Essex. The episode originally aired live on the ITV2 television network in the United Kingdom on 3 December 2012, becoming the first reality television series to ever broadcast a live episode.
Cast
Joey Essex
Jessica Wright
James "Arg" Argent
Kirk Norcross
Mick Norcross
Lydia Rose Bright
Lucy Mecklenburgh
Sam Faiers
Chloe Sims
Gemma Collins
Lauren Pope
Mario Falcone
Patricia "Nanny Pat" Brooker
Billie Faiers
Debbie Douglas
Carol Wright
Billi Mucklow
Cara Kilbey
Tom Pearce
Ricky Rayment
James "Diags" Bennewith
Bobby-Cole Norris
Charlie King
Chris "Little Chris" Drake
Danni Park-Dempsey
Joan Collins
Jasmin Walia
Storylines
The episode begins with pre-recorded footage of cast members and guests arriving on a red carpet to Arg's charity talent show. Arg, who can't seem to find his trousers, walks through the theatre hallways with Diags. Arg and Diags walk into the girls' dressing room where Carol is giving a horrified Debbie a spray tan. Nanny Pat begins to call for Arg to come to the stage over the intercom. Lucy, Billie, Sam, Jess, Carol and Debbie wish Arg good luck as he leaves to go to the stage. It is revealed that Nanny Pat has been hiding Arg's trousers as punishment for him not inviting the Wrights to the barn party in the previous episode. Arg puts his trousers on and walks out on stage to begin the show with Gemma, Bobby, Cara and Billie watching from the audience. The scene then cuts to a conversation between Joey and Chloe. Joey asks Chloe for some advice on proposing to Sam.
Meanwhile, Debbie and Carol perform a skit on stage. In the audience, Bobby expresses his disappointment to Gemma at not being asked to be part of the show. The conversation then turns to the mystery man Bobby has been texting and the genuineness of Jasmin and Charlie's relationship. Cara and Billie, sitting behind them, eventually asks them to be quiet. Back to the skit, Carol accidentally falls off her chair during the performance. The scene then cuts to a conversation between Sam and Kirk, with Kirk revealing he's nervous about his upcoming performance. The two then discuss Kirk's date with Jasmin Walia (featured in the previous episode), with Kirk expressing his disappointment with Jasmin after she had dates with both himself and Charlie in the same night. Sam then goes on to talk about comments Chloe made about Joey possibly proposing to her. The scene cuts back to the stage again, with Jess now performing her new single, "Dominoes". The scene then abruptly cuts back to Sam and Kirk, who are waiting to start their scene. A voice can be heard in the background, telling Kirk to talk about Lauren Pope and then Kirk begins talking to Sam about Lauren. He then reveals that the two have been speaking to each other again and also reveals that they had slept together. Arg runs into the room, stressing that Charlie has five minutes to get ready to p |
https://en.wikipedia.org/wiki/SAF-T | SAF-T (Standard Audit File for Tax) is an international standard for electronic exchange of reliable accounting data from organizations to a national tax authority or external auditors. The standard is defined by the Organisation for Economic Co-operation and Development (OECD). The file requirements are expressed using XML, but the OECD does not impose any particular file format, recommending that (para 6.28) "It is entirely a matter for revenue bodies to develop their policies for implementation of SAF-T, including its representation in XML. However, revenue bodies should consider data formats that permit audit automation today while minimising potential costs to all stakeholders when moving to new global open standards for business and financial data such as XBRL, and XBRL- GL in particular."
The standard is now increasingly adopted within European countries as a means to file tax returns electronically.
The standard was adopted in 2008 by Portugal and has since spread to other European countries, e.g. Luxembourg, Austria, Germany and France. From 1 January 2022 SAF-T is also rolled out in Romania, where large Romanian-resident companies and certain foreign companies.
Although SAF-T is formally standardized, both with respect to syntax (format) and semantics (meaning) to allow for and fulfill automatic data interchange and tools support, e.g. across country borders or common computerized systems, it does include some room for revenue bodies (tax administrations) to add individual elements, e.g. to cover special needs in a taxation or audit system. For example, in Portugal the SAF-T (PT) v1.04_01 standard – based on SAF-T v1.0 – includes some special elements and types relevant to the standard in Portugal.
Standards
In May 2005, the OECD Committee on Fiscal Affairs (CFA) published the first version of the SAF-T guidance. Version 1.0 was based on entries as found in a General Ledger Chart of Accounts, together with master file data for customers and suppliers and details of invoices, orders, payments, and adjustments. The standard describes a set of messages for data exchange between accounting software and national tax authorities or auditors. The syntax is proprietary and based on XML. There are multiple localized versions available which are compatible with the general v1.0 standard. Schema was originally defined in old DTD format – a precursor to today's XML Schema.
The revised version (2.0) extended the standard to include information on Inventory and Fixed Assets. The opportunity was also taken to enhance the original SAF-T specification to take account of suggestions from OECD member countries and others. Schema is changed to XML Schema format and new information covering Inventory and Fixed Assets added. The schema is not fully backward compatible with v1.0.
Country adoptions
The following countries/organizations have laws adopting SAF-T:
See also
XBRL GL
UN/CEFACT
SIE (file format)
External links
SAF-T v2.0 XML schema htt |
https://en.wikipedia.org/wiki/Comparison%20of%20Start%20menu%20replacements%20for%20Windows%208 | Microsoft's Windows 8 operating system introduced an updated Start menu known as the "Start screen", which uses a full-screen design consisting of tiles to represent applications. This replaced the Windows desktop as the primary interface of the operating system. Additionally, the on-screen Start button was replaced by a hidden button in the corner of the screen; Microsoft explained that the Start button was removed because few people used it, noting the addition of "pinning" apps to the taskbar from Windows 7.
The change was controversial among users, and a market ensued for applications which restore the visible Start button, emulate the previous Start menu design, or allow users to boot directly to the Desktop instead of the Start screen.
The following is a list of Start menu replacements for Windows 8 which have received coverage from third-party sources:
The number of skins in the table givens the number of built-in skins. If there are downloadable skins, then a "+" is appended to the number to indicate that download extensions are possible.
RetroUI, StartIsBack, Classic Shell, Start8, and Pokki are five of the more notable of these. RetroUI is offered in 33 languages, and also for Windows Server 2012, and adds a taskbar and resizable windows. StartIsBack is also localized. Classic Shell used to be free and open source (now proprietary freeware), major items are localized and installing the Language Pack from Windows Update makes all items fully localized; Classic Shell is also available for Windows 7 and Windows Server, and claims over 25 million downloads. The Pokki download to restore the Start menu is free; as of January 2013, it has about 1.5 million users. The Pokki application platform, based on Chromium, enables desktop applications to be built—like mobile apps—using standard web languages like HTML5, CSS3, and JavaScript. It is also available for Windows XP and Windows 7. Pokki has raised $21.5M from investors like Google, Intel, and O'Reilly; its business model is to make a commission on software sold through its app store. Start8 has been downloaded over 5 million times.
See also
List of alternative shells for Windows
References
External links
Compare Start Menus:Classic Shell vs StartIsBack, Start8 etc
5 Windows 8 Apps to Bring Back the Start Menu by LAPTOP Magazine
Windows 8
Start Menu replacements for Windows 8 |
https://en.wikipedia.org/wiki/Binary%20Goppa%20code | In mathematics and computer science, the binary Goppa code is an error-correcting code that belongs to the class of general Goppa codes originally described by Valerii Denisovich Goppa, but the binary structure gives it several mathematical advantages over non-binary variants, also providing a better fit for common usage in computers and telecommunication. Binary Goppa codes have interesting properties suitable for cryptography in McEliece-like cryptosystems and similar setups.
Construction and properties
An irreducible binary Goppa code is defined by a polynomial of degree over a finite field with no repeated roots, and a sequence of distinct elements from that are not roots of .
Codewords belong to the kernel of the syndrome function, forming a subspace of :
The code defined by a tuple has dimension at least and
distance at least , thus it can encode messages of length at least using codewords of size while correcting at least errors. It possesses a convenient parity-check matrix in form
Note that this form of the parity-check matrix, being composed of a Vandermonde matrix and diagonal matrix , shares the form with check matrices of alternant codes, thus alternant decoders can be used on this form. Such decoders usually provide only limited error-correcting capability (in most cases ).
For practical purposes, parity-check matrix of a binary Goppa code is usually converted to a more computer-friendly binary form by a trace construction, that converts the -by- matrix over to a -by- binary matrix by writing polynomial coefficients of elements on successive rows.
Decoding
Decoding of binary Goppa codes is traditionally done by Patterson algorithm, which gives good error-correcting capability (it corrects all design errors), and is also fairly simple to implement.
Patterson algorithm converts a syndrome to a vector of errors. The syndrome of a binary word is expected to take a form of
Alternative form of a parity-check matrix based on formula for can be used to produce such syndrome with a simple matrix multiplication.
The algorithm then computes . That fails when , but that is the case when the input word is a codeword, so no error correction is necessary.
is reduced to polynomials and using the extended euclidean algorithm, so that , while and .
Finally, the error locator polynomial is computed as . Note that in binary case, locating the errors is sufficient to correct them, as there's only one other value possible. In non-binary cases a separate error correction polynomial has to be computed as well.
If the original codeword was decodable and the was the binary error vector, then
Factoring or evaluating all roots of therefore gives enough information to recover the error vector and fix the errors.
Properties and usage
Binary Goppa codes viewed as a special case of Goppa codes have the interesting property that they correct full errors, while only errors in ternary and all other cases. Asympt |
https://en.wikipedia.org/wiki/OGC%20GeoSPARQL | GeoSPARQL is a standard for representation and querying of geospatial linked data for the Semantic Web from the Open Geospatial Consortium (OGC). The definition of a small ontology based on well-understood OGC standards is intended to provide a standardized exchange basis for geospatial RDF data which can support both qualitative and quantitative spatial reasoning and querying with the SPARQL database query language.
The Ordnance Survey Linked Data Platform uses OWL mappings for GeoSPARQL equivalent properties in its vocabulary. The LinkedGeoData data set is a work of the Agile Knowledge Engineering and Semantic Web (AKSW) research group at the University of Leipzig, a group mostly known for DBpedia, that uses the GeoSPARQL vocabulary to represent OpenStreetMap data.
In particular, GeoSPARQL provides for:
a small topological ontology in RDFS/OWL for representation using
Geography Markup Language (GML) and well-known text representation of geometry (WKT) literals, and
Simple Features, RCC8, and DE-9IM (a.k.a. Clementini, Egenhofer) topological relationship vocabularies and ontologies for qualitative reasoning, and
a SPARQL query interface using
a set of topological SPARQL extension functions for quantitative reasoning, and
a set of Rule Interchange Format (RIF) Core inference rules for query transformation and interpretation.
Example
The following example SPARQL query could help model the question "What is within the bounding box defined by and ?"
PREFIX geo: <http://www.opengis.net/ont/geosparql#>
PREFIX geof: <http://www.opengis.net/def/function/geosparql/>
SELECT ?what
WHERE {
?what geo:hasGeometry ?geometry .
FILTER(geof:sfWithin(?geometry,
"POLYGON((-77.089005 38.913574,-77.029953 38.913574,-77.029953 38.886321,-77.089005 38.886321,-77.089005 38.913574))"^^geo:wktLiteral))
}
RCC8 use in GeoSPARQL
RCC8 has been implemented in GeoSPARQL as described below:
Implementations
There are (almost) no complete implementations of GeoSPARQL, there are, however partial or vendor implementations of GeoSPARQL. Currently there are the following implementations:
Apache Marmotta
GeoSPARQL was implemented in the context of the Google Summer of Code 2015. on Apache Marmotta; it uses PostGIS, and it is available just for PostgreSQL.
Apache Jena
Since version 2.11 Apache Jena has a GeoSPARQL extension.
Ontop VKG
Support for GeoSPARQL was added to Ontop in version 4.2.
Parliament
Parliament has an almost complete implementation of GeoSPARQL by using JENA and a modified ARQ query processor.
Eclipse RDF4J
Eclipse RDF4J is an open-source Java framework for scalable RDF processing, storage, reasoning and SPARQL querying. It offers support for a large subset of GeoSPARQL functionality.
Strabon
Strabon is an open-source semantic spatiotemporal RDF store that supports two popular extensions of SPARQL: stSPARQL and GeoSPARQL. Strabon is built by extending the well-known RDF store Sesame and extends Sesame's components to mana |
https://en.wikipedia.org/wiki/The%20People%27s%20Operator | The People's Operator (or TPO Mobile) was a mobile virtual network operator that provided mobile phone services in the United Kingdom via Three (though TPO had initially selected the EE company), and in the United States via the Sprint and T-Mobile networks. It was launched in 2012, with the stated aim of being an ethical mobile network operator. TPO said that their service gave private customers the opportunity to support good causes, charities, nonprofits, "progressive organisations" or "ethical groups" of their choice and receive updates on how their money was being spent, while businesses could fulfill their corporate social responsibility commitments. The company's stock lost nearly 90 percent in value in the year and a half after its launch. Trading of The People's Operator stock on the London exchange was suspended in July 2018, after the company failed to provide its 2017 financial reports. In December 2018, the company received a cash infusion from the holding company that was majority owner of Lycamobile. On 13 February 2019, TPO announced it had entered administration; its stock ceased trading on 26 February 2019.
History
Start-up
TPO was launched on 19 November 2012. At launch, it was owned entirely by its three co-founders, Andrew Rosenfeld, Tom Gutteridge and Mark Epstein, with Rosenfeld being the primary financial backing for the company. The organisation has been based in Shoreditch, London. It was established with the stated aim of being an ethical mobile phone operator. At launch, Rosenfeld was the Chairman, with Gutteridge and Epstein as vice-chairs, and Alex Franks as the chief executive. In mid-2013, they launched a range of a range of 30-day rolling pay monthly SIM-only deals.
Partnership with Jimmy Wales, going public, and leadership change
On 20 January 2014, TPO announced that Jimmy Wales had joined the organisation on a £250,000 annual salary as co-chair of the board, and had "taken a strategic stake in the business." Wales was quoted as saying that "TPO has huge potential for viral growth and the more it grows, the more money will pass to the people and communities that need it." TPO announced in January 2014 that it was aiming to launch its services in the United States and Europe within the next 12 months. Only weeks after Jimmy Wales joining the executive team, The Guardian reported in an interview with Wales that Wikipedia's article about the company had been written by a marketing consultant for the People's Operator, indicating the problem "with commerce entering Wikipedia". One financial reporter described the addition of Jimmy Wales as "not the greatest argument for backing a company".
In October 2014, the company announced that it intended to list publicly on London's Alternative Investment Market. It was estimated by Oscar Williams-Grut that the company could be worth £100 million upon its initial public offering. This was later described as a "hugely overblown price".
On 8 February 2015, Rosenfeld d |
https://en.wikipedia.org/wiki/ICOM%20Tele%20A/S | ICOM is a Danish mobile virtual network operator and broadbands network operator.
History
Founded in 1995, ICOM (ICOM Networks) was the first Danish company to create, design, service and deliver complete wide area network-solutions (WAN) for public Danish institutions, be it municipalities and national administrative bodies. Since then ICOM has become a provider of WAN and more recently in IP telephony.
Through its wholly owned Danish SIP MVNO ICOM Tele provides coverage of telecom services; broadband, mobile/fixed telephony over IP, wholesale carrier traffic and other value-adding services.
Product portfolio
The core product of the unified communication platform is dubbed ICOM Suite and collects communication critical components for end customers. ICOM Suite is essentially a natural expansion for a MVNO to provide for its end customers.
Connection to MNOs
ICOM is technically connected to two Danish MNOs:
TDC
Telenor
Telecommunications companies of Denmark
Technology companies based in Copenhagen
Danish companies established in 1995
Mobile virtual network operators |
https://en.wikipedia.org/wiki/Tiruvottiyur%20railway%20station | Tiruvottiyur railway station is one of the railway station of the Chennai Central–Gummidipoondi section of the Chennai Suburban Railway Network. It serves the neighbourhood of Tiruvottiyur, a suburb of Chennai, and is located 9 km north of Chennai Central railway station. It has an elevation of 7 m above sea level.
History
The lines at the station were electrified on 13 April 1979, with the electrification of the Chennai Central–Gummidipoondi section.
Services
Daily regular EMU services are available up to Gummidipoondi, Sullurpeta, Ennore in the north and Chennai central in the south. In addition, rare daily rails are available up to Chennai beach, Tiruvallur, Velachery, Tambaram and Chengalpattu.
Traffic
Approximately 25,000 people use the station every day.
See also
Chennai Suburban Railway
Railway stations in Chennai
Tiruvottiyur
References
External links
Tiruvottiyur station at Indiarailinfo.com
Stations of Chennai Suburban Railway
Railway stations in Chennai |
https://en.wikipedia.org/wiki/Saadatabad%2C%20Hormozgan | Saadatabad (, also Romanized as Sa‘ādatābād; also known as Sa‘ātābād) is a village in Tarom Rural District, in the Central District of Hajjiabad County, Hormozgan Province, Iran. At the 2006 census, its population was 76, in 20 families.
References
Populated places in Hajjiabad County |
https://en.wikipedia.org/wiki/Legend%20of%20a%20Rabbit | Legend of a Rabbit ( Tùxiá Chuánqí), released in the United States as Legend of Kung Fu Rabbit, is a 2011 Chinese computer-animated film directed by Sun Yijun. The film features an original cast of Fan Wei, Yan Ni, Zhang Fengyi, Zhang Yishan and Pu Cunxin. In the English version, it stars the voices of Jon Heder, Tom Arnold, Rebecca Black, Michael Clarke Duncan and Claire Geare.
The film was released in 62 countries, and was the first Chinese animated feature ever to be shown internationally. The film was a box office failure in China, managing to gross CNY16.2 million compared to its CNY120 million budget. Some noted its similarity to the Kung Fu Panda film franchise.
A sequel to the film, Legend of a Rabbit: The Martial of Fire, was released in 2015.
Plot
A rabbit named Fu has an occupation of cooking pancakes in Beijing. He is trained by kung fu master named Laoguanzhu, so he can defeat the master's enemy. Fu, surprised at this discovery, confronts Laoguanzhu; furious at these accusations, Laoguanzhu begins to enlarge until he becomes a giant and devours Tu'er.
Cast
Production and release
Legend of a Rabbit was directed by Sun Yijun, president of animation at Beijing Film Academy. It was made over the course of three years, with a crew of 500 animators.
The film was produced on a budget of CNY120 million, with 80% of it used for production equipment, while the rest was used for marketing. Yijun said that he was not completely satisfied with the film, but it would still get attention to the Chinese animation industry. He also said:
Legend of a Rabbit was first presented in December 2010, at a conference held in Beijing. The first teaser was released in February 2011, and a seven-minute preview was later put online in June. The film premiered at the 2011 Cannes Film Festival. It was later shown at 3,000 theaters in China, and was released in more than 80 countries, making it the first Chinese animated film ever to have an international theatrical release. Tianjin North Film Studio signed a deal with Cartoon Network to air the film in Australia, New Zealand, India and Taiwan, and merchandise such as a line of toys were also made.
It was announced in 2011 that an English dub of the film was in the works, with Michael Clarke Duncan, Rebecca Black, Claire Geare and Jade Lianna-Peters. Other candidates were Daniel Craig, Robert De Niro, Ralph Fiennes, Hugh Grant, Madonna, Shaquille O'Neal and Michael Tyson. It was the first-ever Chinese picture to have it be dubbed English on its North American release. The DVD of the English dub was released by Lions Gate Entertainment on September 24, 2013.
Reception
Legend of a Rabbit was a commercial flop at the Chinese box office, managing to gross CNY16.2 million against its CNY210 million budget. It had earned over CNY10 million on its first week. The film's director considered that the reason for the very little amount of viewing for cartoon movies was due to the audience's habits. However, in Marc |
https://en.wikipedia.org/wiki/Social%20network%20analysis%20in%20criminology | Social network analysis in criminology views social relationships in terms of network theory, consisting of nodes (representing individual actors within the network) and ties (which represent relationships between the individuals, such as offender movement, sub offenders, crime groups, etc.). These networks are often depicted in a social network diagram, where nodes are represented as vertices and ties are represented as edges.
Known scholars of social network analysis include Gisela Bichler, Lucia Summers, Carlo Morselli, Aili Malm, Jean McGloin, Jerzy Sarnecki, Diane Haynie, Andrew Papachristos, Mangai Natarajan, Francesco Calderoni, and David Bright.
Key terms
Offender Movement
The movement of deviants from one location to another (e.g. from home to the location of criminal acts).
Co-Offenders
When two or more distinct individuals who participate in a criminal act.
Crime Group
A social group, which participates in a criminal act. The group will often divide the labor in the act to maximize efficiency.
Key concepts
Crime Pattern Theory
Crime pattern theory consists of four key points: (1) that criminal events are complex, (2) that crime is not random, (3) that criminal opportunities are not random, and (4) that offenders and victims are not pathological in their use of time and space.
Graph theory
Centrality measures are used to determine the relative importance of a vertex within the overall network (i.e. how influential a person is within a criminal network or, for locations, how important an area is to a criminal's behavior). There are four main centrality measures used in criminology network analysis:
Degree
Historically, the first and conceptually simplest is degree centrality, which is defined as the number of edges incident upon a vertex (i.e., the number of ties that a node has). The degree can be interpreted in terms of the immediate risk of a node for catching whatever is flowing through the network. In the case of a directed network (where ties have direction), it is usually defined as two separate measures of degree centrality, namely indegree and outdegree.
Betweenness
Betweenness centrality quantifies the number of times a vertex acts as a bridge along the shortest path between two other vertices. It was introduced as a measure for quantifying the control of a human on communication with other humans in a social network by Linton Freeman. In his conception, vertices that have a high probability to occur on a randomly chosen shortest path between two randomly chosen vertices have a high betweenness.
Eigenvector
Eigenvector is a term widely used in the linear algebra. Eigenvector centrality is a measure of the influence of a node in a network. It assigns relative scores to all vertices in the network based on the concept that connections to high-scoring vertices contribute more to the score of the vertex in question than equal connections to low-scoring vertices.
Closeness
The farness of a vertex is defin |
https://en.wikipedia.org/wiki/Lulu%20smoothing | In signal processing, Lulu smoothing is a nonlinear mathematical technique for removing impulsive noise from a data sequence such as a time series. It is a nonlinear equivalent to taking a moving average (or other smoothing technique) of a time series, and is similar to other nonlinear smoothing techniques, such as Tukey or median smoothing. LULU smoothers are compared in detail to median smoothers by Jankowitz and found to be superior in some aspects, particularly in mathematical properties like idempotence.
Properties
Lulu operators have a number of attractive mathematical properties, among them idempotence – meaning that repeated application of the operator yields the same result as a single application – and co-idempotence.
An interpretation of idempotence is that: 'Idempotence means that there is no “noise” left in the smoothed data and co-idempotence means that there is no “signal” left in the residual.'
When studying smoothers there are four properties that are useful to optimize:
Effectiveness
Consistency
Stability
Efficiency
The operators can also be used to decompose a signal into various subcomponents similar to wavelet or Fourier decomposition.
History
Lulu smoothers were discovered by C. H. Rohwer and have been studied for the last 30 years. Their exact and asymptotic distributions have been derived.
Operation
Applying a Lulu smoother consists of repeated applications of the min and max operators over a given subinterval of the data.
As with other smoothers, a width or interval must be specified. The Lulu smoothers are composed of repeated applications of the L (lower) and U (Upper) operators, which are defined as follows:
L operator
For an L operator of width n over an infinite sequence of xs (..., xj, xj+1,...), the operation on xj is calculated as follows:
Firstly we create (n + 1) mini-sequences of length (n + 1) each. Each of these mini-sequences contains the element xj. For example, for width 1, we create 2 mini-sequences of length 2 each. For width 1 these mini sequences are (xj−1, xj) and (xj, xj+1). For width 2, the mini-sequences are (xj−2, xj−1, xj), (xj−1, xj, xj+1) and (xj, xj+1, xj+2). For width 2, we refer to these mini-sequences as seq−1, seq0 and seq+1
Then we take the minimum of each of the mini sequences. Again for width 2 this gives: (Min(seq−1), Min(seq0), Min(seq+1)). This gives us (n + 1) numbers for each point.
Lastly we take the maximum of (the minimums of the mini sequences), or Max(Min(seq−1), Min(seq0), Min(seq+1)) and this becomes L(xj)
Thus for width 2, the L operator is:
L(xj) = Max(Min(seq−1), Min(seq0), Min(seq+1))
U Operator
This is identical to the L operator, except that the order of Min and Max is reversed, i.e. for width 2:
U(xj) = Min(Max(seq−1), Max(seq0), Max(seq+1))
Examples
Examples of the U and L operators, as well as combined UL and LU operators on a sample data set are shown in the following figures.
It can be seen that the results of the UL and LU oper |
https://en.wikipedia.org/wiki/Mobi | Mobi or MOBI may refer to:
Companies
Mobi (company), an American wireless provider
Computing
.mobi, internet top domain name
.mobi, a file extension of the deprecated Mobipocket e-book format
People
Mobi Fehr (born 1994), American soccer player
Mobi Okoli (born 1987), Nigerian football player
Mobi Oparaku (born 1976), Nigerian former football player
Other uses
Vancouver Bike Share, a Canadian bicycle sharing system branded as Mobi by Shaw Go
Fiat Mobi, a 2016–present Brazilian-Italian city car
See also
Moby (disambiguation) |
https://en.wikipedia.org/wiki/EU4%20%28disambiguation%29 | EU4 can refer to the following:
Europa Universalis IV: a computer game by Paradox Interactive.
Haplogroup E1b1b (Y-DNA) in human genetics, previously known as EU4.
Big Four (Western Europe), four major European powers, also known as EU4. |
https://en.wikipedia.org/wiki/Usama%20Fayyad | Usama M. Fayyad (born July, 1963) is an American-Jordanian data scientist and co-founder of KDD conferences and ACM SIGKDD association for Knowledge Discovery and Data Mining. He is a speaker on Business Analytics, Data Mining, Data Science, and Big Data. He recently left his role as the Chief Data Officer at Barclays Bank.
Early life
Fayyad was born to a Jordanian family in Carthage, Tunisia in July 1963, and lived his early childhood in Tunisia and other countries in the Middle East, Africa and Southern Europe. He graduated high school in Amman, Jordan from the National Orthodox School with GCE O-Levels. He spent most of his life in the U.S., having received his undergraduate and graduate education in Ann Arbor, MI at the University of Michigan.
Career
Fayyad holds BSE's in both electrical and computer engineering (1984); MSE in computer science and engineering (1986); and M.Sc. in mathematics (1989). He also earned his Ph.D. in engineering from the University of Michigan, Ann Arbor (1991). Fayyad has published over 100 technical articles in the fields of data mining, Artificial Intelligence, machine learning, and databases. He holds over 30 patents and is a Fellow of both the AAAI (Association for Advancement of Artificial Intelligence) and the ACM (Association for Computing Machinery). Fayyad has edited two influential books on data mining and he launched and served as editor-in-chief of both the primary scientific journal in the field of data mining (Data Mining and Knowledge Discovery) and the primary newsletter in the technical community published by the ACM: SIGKDD Explorations. He continues to be active in the academic community, serving at chairman of ACM’s SIGKDD Executive Committee which runs the world’s premiere data science, big data, and data mining conferences: the KDD international annual conferences. Fayyad is a recipient of the ACM SIGKDD Innovation Award (2007) and Service Award (2003)
– the only person to ever receive both awards.
Fayyad is an active angel investor in the U.S. and in the Middle East. He is also part of the U.S. Dept of State Delegation on Entrepreneurship in the Middle East. Fayyad is an active speaker in both academic and business meetings, and regularly delivers keynotes on BigData, Predictive Analytics, Data Mining, Monetization Strategies, and Early-Stage Investment and Acceleration strategies for technology startups.
From 1989 to 1996 Fayyad held a leadership role at NASA's Jet Propulsion Laboratory (JPL), where his work in the analysis and exploration of Big Data in scientific applications (gathered from observatories, remote-sensing platforms and spacecraft) garnered him the top research excellence award that Caltech awards to JPL scientists – The Lew Allen Award for Excellence in Research, as well as a U.S. Government medal from NASA.
Prior to founding his first startup in 2000, Fayyad was at Microsoft for five years. At Microsoft he led the data mining and exploration group at Microsoft Res |
https://en.wikipedia.org/wiki/Onehunga%20railway%20station | Onehunga railway station is the terminus station on the Onehunga Line of the Auckland railway network in New Zealand. It is located at the southern end of Onehunga Town Centre and consists of a single side platform which is accessed from Onehunga Mall and Princes Street.
History
The current station is the third to have served Onehunga. The original station opened in 1873, and was situated adjacent to Princes Street, to the north-east of the current station. Additionally, the Onehunga Wharf railway station served the Port of Onehunga from 1878 to 1927.
Through services to Auckland railway station ceased in 1950, but passenger trains continued running between Onehunga and Penrose, to connect with mainline services into Auckland, until April 1973. The station closed following the withdrawal of passenger service but the line through the station remained open for freight trains until 2006.
The new station was opened on 18 September 2010 and services started on 19 September 2010. The station was first served by electric trains on 28 April 2014, with the Onehunga Line being the first line to switch to using AM Class Electric Multiple Units.
Transport links
Onehunga Bus Station is located approximately 200m north of the station and is a major hub for Auckland's bus network. The Onehunga railway station is the closest rail stop to the outlet mall, Dress Smart.
Bus services 36, 38, 68, 74, 298 and 670 serve Onehunga station.
See also
Onehunga Branch
Public transport in Auckland
Transport in Auckland
List of Auckland railway stations
References
Railway stations in New Zealand
Rail transport in Auckland
Railway stations opened in 1873
Railway stations closed in 1973
Railway stations opened in 2010
1873 establishments in New Zealand
Railway stations in New Zealand opened in the 1870s
Railway stations in New Zealand opened in the 2010s
Railway stations in New Zealand closed in the 20th century |
https://en.wikipedia.org/wiki/Scopula%20graphidata | Scopula graphidata is a moth of the family Geometridae. It is found on Sulawesi.
References
Moths described in 1920
graphidata
Moths of Indonesia |
https://en.wikipedia.org/wiki/Narrative%20network | A narrative network is a system that represents complex event sequences or characters’ interactions as depicted by a narrative text. Network science methodology offers an alternative way of analysing the patterns of relationships, composition and activities of events and actors studied in their own context. Network theory can contribute to the understanding of the structural properties of a text and the data contained in it. The meaning of the individual and the community in a narrative is conditional on their position in a system of social relationships reported by the author. Hence, a central problem when dealing with narratives is framing and organising the author's perspective of individual and collective connections to understand better the role of both the witness (viz. the persona that emerges from the narrative) and its testimony as reflected by the text. However, the category of narrative network is in its formative, initial phase and as a consequence it is hard to view as a stable and defined notion in linguistics, and beyond sociology.
Overview: Narrative as a structure of a story in time
To be an object of study and analysis, time must be transformed into a causal sequence, and the only way this can be done is by narration. As a form of description, narrating inevitably requires sequencing in time. The direction of time is not a trivial thing, but the backbone of the information contained in the narrative itself. One has to bear in mind the fundamental concepts of Genette's narratology, mainly the concept of ‘order.’ This distinguishes three entities: story, narrative, and narration. The story generally corresponds to a series of events placed its chronological order (the story time). When these events are rearranged and represented in a form that has its own sequence and features by the author, it produces a narrative. Even if the narrated events are not chronologically ordered, being reported in the narrative's time, they always refer to a position in the story time.
The survey of any textual account ought to take into account its literary nature. Far from being a window that must be revealed to penetrate into a ‘historical truth,’ each historical document adds to the number of texts that must be interpreted if an approachable and intelligible picture of a given historical milieu is to be drawn. As pointed out by Peter Munz, "Narrative is the only literary device available which will reflect the past’s time structure." The pretension that conceives of history as the representation of the ‘actual’ should be put aside to acknowledge that one can only approach past structures by contrasting them with, or bonding them to, the imaginable world. In this way, and similar to Genette's conception of narrative order and time, a historical narrative implies not simply an account of events that happened in the transition from one point in time to another. Thence, historical narrative is a progressive ‘redescription’ of events and people th |
https://en.wikipedia.org/wiki/Wimco%20Nagar%20railway%20station | Wimco Nagar railway station is one of the railway station of the Chennai Central–Gummidipoondi section of the Chennai Suburban Railway Network. It serves the neighbourhood of Tiruvottiyur, a suburb of Chennai, India, and is located 11 km north of Chennai Central railway station. It has an elevation of 9 m above sea level.
History
The lines at the station were electrified on 13 April 1979, with the electrification of the Chennai Central–Gummidipoondi section.
See also
Chennai Suburban Railway
Railway stations in Chennai
References
External links
Wimco Nagar station at Indiarailinfo.com
Stations of Chennai Suburban Railway
Railway stations in Chennai
Railway stations in Tiruvallur district |
https://en.wikipedia.org/wiki/Underbelly%3A%20Squizzy | Underbelly: Squizzy, the sixth series of the Australian Nine Network reality crime drama series anthology Underbelly, originally aired from 28 July 2013 to 1 September 2013. It is an eight-part series based on the life and career of notorious Melbourne gangster, Squizzy Taylor, and is set between 1915 and 1927. It premiered on 28 July 2013. The series began its production in late 2012, with filming commencing towards the end of 2012. It is the second series in the franchise after Badness not to have 13 episodes and the first series to be fully set in Melbourne since Underbelly.
Premise
The sixth and final series of Underbelly depicts the rise and fall of one of Australia's most notorious 20th-century gangsters, Squizzy Taylor. It shows how Taylor became one of the most feared criminals in Melbourne at the time and his eventual death, which was also depicted in Underbelly: Razor. Justin Rosniak, who played Taylor in Razor, does not reprise his role in the new series; instead Jared Daperis has taken on the role.
Cast
Main cast
Jared Daperis as Joseph Theodore Leslie "Squizzy" Taylor
Camille Keenan as Dolly Grey
Susie Porter as Rosie Taylor
Ashley Zukerman as Detective James Bruce
Luke Ford as Albert "Tankbuster" McDonald
Dan Wyllie as Detective Frederick Piggott
Ken Radley as Detective John Brophy
Nathan Page as Henry Stokes
Diana Glenn as Annie Stokes
Matt Boesenberg as John "Snowy" Cutmore
Gracie Gilbert as Ida Pender
Andrew Ryan as Angus "Gus" Murray
Richard Cawthorne as "Long Harry" Slater
Ian Dixon as Ted Whiting
Sam Greco as Sam "Bunny" Whiting
Elise Jansen as Lorna Kelly
Greg Fleet as Richard Buckley
Jackson Ezard as Hugh Hanlon
Episodes
Viewership
Novelisation
Andy Muir, one of the screenwriters of the series, wrote the novelisation Underbelly Squizzy which was due to be published by Allen & Unwin Australia in July 2013.
References
External links
2013 Australian television series debuts
2013 Australian television series endings
2013 Australian television seasons
2010s Australian crime television series
2010s Australian drama television series
2010s Australian television miniseries
Nine Network original programming
Television series set in the 1910s
Television shows set in Victoria (state)
Television series set in the 1920s
Organised crime in Melbourne |
https://en.wikipedia.org/wiki/Wiper%20%28malware%29 | In computer security, a wiper is a class of malware intended to erase (wipe, hence the name) the hard drive or other static memory of the computer it infects, maliciously deleting data and programs.
Examples
A piece of malware referred to as "Wiper" was allegedly used in attacks against Iranian oil companies. In 2012, the International Telecommunication Union supplied Kaspersky Lab with hard drives allegedly damaged by Wiper for analysis. While a sample of the alleged malware could not be found, Kaspersky discovered traces of a separate piece of malware known as Flame.
The Shamoon malware contained a disk wiping mechanism; it was employed in 2012 and 2016 malware attacks targeting Saudi energy companies, and utilized a commercial direct drive access driver known as Rawdisk. The original variant overwrote files with portions of an image of a burning U.S. flag. The 2016 variant was nearly identical, except using an image of the body of Alan Kurdi instead.
A wiping component was used as part of the malware employed by the Lazarus Group—a cybercrime group with alleged ties to North Korea, during the 2013 South Korea cyberattack, and the 2014 Sony Pictures hack. The Sony hack also utilized RawDisk.
In 2017, computers in several countries—most prominently Ukraine, were infected by NotPetya, which is a variant of the Petya ransomware that was a wiper in functional sense. The malware infects the master boot record with a payload that encrypts the internal file table of the NTFS file system. Although it still demanded a ransom, it was found that the code had been significantly modified so that the payload could not actually revert its changes, even if the ransom were successfully paid.
Several variants of wiper malware were discovered during the 2022 Ukraine cyberattacks on computer systems associated with Ukraine. Named CaddyWiper, HermeticWiper, IsaacWiper, and FoxBlade by researchers, the programs showed little relation to each other, prompting speculation that they were created by different state-sponsored actors in Russia especially for this occasion.
References
Types of malware |
https://en.wikipedia.org/wiki/Cyberweapon | Cyberweapons are commonly defined as malware agents employed for military, paramilitary, or intelligence objectives as part of a cyberattack. This includes computer viruses, trojans, spyware, and worms that can introduce malicious code into existing software, causing a computer to perform actions or processes unintended by its operator.
Characteristics
A cyberweapon is usually sponsored or employed by a state or non-state actor, meets an objective that would otherwise require espionage or the use of force, and is employed against specific targets. A cyberweapon performs an action that would normally require a soldier or spy, and which would be considered either illegal or an act of war if performed directly by a human agent of the sponsor during peacetime. Legal issues include violating the privacy of the target and the sovereignty of its host nation. Example of such actions are surveillance, data theft and electronic or physical destruction. While a cyberweapon almost certainly results in either direct or indirect financial damages to the target group, direct financial gains for the sponsor are not a primary objective of this class of agent. Often cyberweapons are associated with causing physical or functional harm to the system which it attacks, despite being software. However, there is no consensus on what officially constitutes a cyberweapon.
Unlike malware used by script kiddies to organize botnets, where the ownership, physical location, and normal role of the machines attacked is largely irrelevant, cyberweapons show high selectivity in either or both of their employment and their operation. Before the attack, cyberweapons usually identify the target using different methods. Likewise, malware employed by fraudsters for the theft of personal or financial information demonstrates lower selectivity and wider distribution.
Cyberweapons are dangerous for multiple reasons. They are typically difficult to track or defend against due to their lack of physical components. Their anonymity allows them to hide in systems undetected until their attack is unleashed. Many of these attacks exploit "zero days" (vulnerabilities in software that companies have zero days to fix). They are also significantly cheaper to produce than cyber defenses to protect against them. Oftentimes, cyberweapons from one force are obtained by an opposing force and are then repurposed to be used against the original force, as can be seen with the cyberweapons WannaCry and NotPetya.
While the term cyber weapon is frequently used by the press, some articles avoid it, instead using terms such as "internet weapon", "hack", or "virus". Mainstream researchers debate the requirements of the term while still referring to the employment of the agent as a "weapon", and the software development community in particular uses the term more rarely.
Examples
The following malware agents generally meet the criteria above, have been formally referred to in this manner by industry security |
https://en.wikipedia.org/wiki/Burn%20Notice%20%28season%207%29 | The seventh and final season of the American television spy drama Burn Notice aired from June 6, 2013 to September 12, 2013, on the cable television channel USA Network. The 13-episode season was ordered by USA Network on November 7, 2012. In May 2013, the network announced that this season will be the show's last. Production on the series wrapped on July 31, 2013.
Season Overview
After making the deal to get his friend and his mother released from their prison cells, Michael is once again working for the CIA, this time under his new handler, Agent Andrew Strong (Jack Coleman). Operating deep undercover in the Dominican Republic, a bearded Michael spends nine months posing as an alcoholic ex-spy, committing the occasional crime to pay the rent in order to attract his target and old friend, Randall Burke (Adrian Pasdar), who is suspected to be the leader of a terrorist network. After Burke watches him for six months, he finally approaches Michael with a potential job opportunity. To sell his cover, Michael acts desperate for a job, but Burke is hesitant and tells Michael to take care of himself. After meeting with Strong at a baseball game to update him about his meeting with Burke, Strong reminds Michael of their deal; in return for Strong saving his friends and mother from life in prison, Michael has to take Burke down. Later that night, Burke and his associate, Pablo visit Michael and agrees to give him a job under one condition; Michael quits drinking or else he gets a bullet in the back of his head. He also tells Michael that he's not just offering him a new job, he's offering him a new life and in this life, there are no second chances.
Meanwhile, Sam, Jesse, Fiona, and Madeline are back in Miami living their lives without Michael. Sam is back with Elsa (Jennifer Taylor), Jesse is back at his private security firm, Fiona is bounty hunting with her new boyfriend, Carlos Cruz (Stephen Martines), and Madeline is trying to get custody of Nate's son, Charlie since Ruth is in rehab. They come together again when a mysterious man using various cover IDs (Nick E. Tarabay) begins asking around about Michael. He finally succeeds when he pretends to be a child custody specialist to trick Madeline into revealing that Michael is working on a government assignment after making a deal with the CIA to get them all released from prison. When Fiona asks what Madeline told him about Michael, Madeline is horrified that she accidentally put Michael in danger.
Meanwhile, after Michael and Pablo complete a job for Burke which was to blow up a bunch of satellite equipment in a security firm, Pablo gets a call from the mystery man in Miami and learns that Michael is still working for the CIA. To preserve his cover, Michael floors it through the police checkpoint, leading to the cops shooting them and the car flips over, killing Pablo. That night, Michael lies to Burke about the reason Pablo was killed, claiming that Pablo panicked and Michael was trying to get t |
https://en.wikipedia.org/wiki/Pinoy%20True%20Stories | Pinoy True Stories is a collective title of five docu-news magazine programs broadcast by ABS-CBN. The network's news journalists will tackle real-life accounts of Filipinos and help in solving problems that affect the communities and families nationwide. The five programs of Pinoy True Stories currently airs every Mondays to Saturdays on ABS-CBN, with an encore telecast on Jeepney TV. It also airs worldwide via TFC.
Pinoy True Stories premiered on December 3, 2012, each of the five programs were previously aired every weekday afternoons on the Kapamilya Gold afternoon block. On December 7, 2015, all the five programs of Pinoy True Stories has been moved to late weeknights.
From May 5, 2020, the five programs of Pinoy True Stories has been temporarily suspended airings due to the temporary closure of ABS-CBN because of the cease and desist order of the National Telecommunications Commission (NTC), following the expiration of the network's 25-year franchise granted in 1995.
Hosts
Final hosts
Dyan Castillejo (for Sports U)
Julius Babao (for Mission Possible; formerly for Busted)
Karen Davila (for My Investment ; formerly for Encounter and 3-in-1)
Jeff Canoy (for #NoFilter; formerly for Red Alert)
Chiara Zambrano (for #NoFilter)
Abner Mercado (for #NoFilter)
Raphael Bosano (for #NoFilter)
Kori Quintos (for #NoFilter)
Jacque Manabat (for #NoFilter)
Jeck Batallones (for #NoFilter)
Kevin Manalo (for #NoFilter)
Sherrie Ann Torres (for #NoFilter)
Former hosts
Doris Bigornia (for Pearl of People)
Maan Macapagal (for Help)
Dominic Almelor (for Help)
K Brosas (for 3-in-1)
Atty. Claire Castro (for 3-in-1)
Atom Araullo <small>(for Red Alert; formerly for ‘’Mystery and RealiTV)</small>
Anthony Taberna (for TNT: One-on-One with Tunying; formerly for Accuse)
Final programs
Mission Possible
In Mission Possible, Julius Babao seeks out the inspirational stories of ordinary Filipino people with love, and how their dreams will turn into possible. The segment currently airs every Saturdays, with replays on Monday mornings and late nights.
It premiered on February 9, 2015, replacing Bistado.
My Puhunan
In My Puhunan (My Investment, stylized as my PUHUNAN), Karen Davila talks about various types of business and employees. The segment currently airs every Saturdays, with replay on Tuesday late nights and on Thursday mornings.
It premiered on July 17, 2013, replacing Saklolo it ended on February 4, 2015, and returned on July 7, 2015.
#NoFilter#NoFilter talks about the daily life of every Filipino individual through a point-of-view by a documentarist. The segment airs every Wednesdays with a replay every Friday mornings.
It premiered on May 1, 2019, replacing Red Alert.
Sports USports U is a sequel to the long-running Sports Unlimited. Dyan Castillejo will profile the lives of Filipino athletes from various sports. The segment airs every Thursdays.
It premiered on February 12, 2015, replacing the Thursday timeslot of TNT: Tapatan ni Tunying.
|
https://en.wikipedia.org/wiki/Australian%20Computer%20Museum%20Society | The Australian Computer Museum Society Inc, (ACMS) is a society dedicated to the preservation of the history of computing in Australia, including software, hardware, operating systems and literature. ACMS was registered and is a charitable institution which relies on memberships and donations to operate. Established in 1994, their members have since amassed a large number of unique devices designed and built by Australians.
References
Organisations based in Sydney
Organizations established in 1994
Historical societies of Australia
Information technology organizations based in Oceania |
https://en.wikipedia.org/wiki/Purch%20Group | Purch Group, Inc. was a New York City-based digital media company. Originally established in 2003 as TechMedia Network, Inc., it was positioned as a "portfolio of brands and products focused on purchasing decisions"—consisting primarily of websites focusing on reviews of consumer electronics, positioned to marketers as outlets to "directly engage with buyers in the right place, at the right time".
In 2018, Purch sold its consumer brands to Future plc. Its business-to-business unit Business.com was not included in the sale.
History
In 2009, Purch, then known as TechMedia Network, Inc. acquired LiveScience, Space.com and Newsarama from Imaginova. Two years later, TechMedia Network acquired Laptop Magazine from Bedford Communications. In July 2013, the company acquired Bestofmedia Group, publisher of Tom's Hardware, Tom's Guide, Tom's IT Pro, Anandtech and a variety of sister publications across Europe. TechMedia Network, Inc. acquired BuyerZone.com, LLC from Reed Business Information in early 2014.
In April 2014, TechMedia Network. changed its name to Purch and simultaneously announced an exclusive partnership with Mobile Nations, a portfolio of mobile-focused online communities. In December 2014, Purch announced the acquisition of AnandTech and in March 2015 the company announced the acquisition of mobile shopping app Consumr, which was rebranded that following July as Purchx. Included in the rebrand was the launch of the Purch Marketplace, where shoppers can browse and buy technology products and services online. In September 2015, Purch acquired Active Junky, a loyalty program and online shopping site for outdoor gear. This was followed by the December 2015 acquisition of ShopSavvy, a mobile shopping app.
Purch's 2015 round of funding ($135 million) was led by Canso Investment Counsel. Purch has received additional funding from ABS Capital Partners, Village Ventures, and Highway 12 Ventures. Purch was headquartered in New York City, where Greg Mason served as CEO.
In 2018, Purch announced that it would sell its consumer brands to British media company Future plc for $132.5 million. Its business-to-business operations were retained under the Business.com banner (which it had acquired in 2016).
List of websites
The company owned and operated the following websites:
AnandTech
LiveScience
Newsarama
Space.com
Tom's Hardware (Tom’s Guide)
Following websites were not included during the sale to Future, and went under Business.com:
Business.com
References
External links
Digital media
Mass media companies of the United States
2018 disestablishments in New York (state)
2018 mergers and acquisitions |
https://en.wikipedia.org/wiki/Acromag | Acromag, Inc. is a company that manufactures embedded computing, process instrumentation, and distributed I/O products.
Established in 1957, Acromag built its reputation designing critical measurement instrumentation equipment for the petrochemical and aerospace industries. It now designs analog and digital control products for the industrial I/O and defense markets.
Acromag's experience in designing industrial I/O has paved the way for solutions to ground loops, RFI/EMI noise, and temperature drift. Many products are available with agency approvals such as UL, cUL, FM, CSA, CE, ATEX, and others to assure precise operation in hostile environments.
The company has three product divisions: Embedded Computing Solutions, Process Control and Automation Solutions and Contract Manufacturing Services. Its product lines focus on manufacturing, military, scientific, public utility, and transportation applications.
History
Acromag's history began in 1957 with Henry Patton, a pioneer in the development of solid-state magnetic amplifiers. Expanding from its first location in Detroit, Michigan, (now Southfield), Acromag headquarters currently reside in Wixom, Michigan.
It acquired Xembedded, LLC (formerly XycomVME) in 2012.
Process Instrumentation and Embedded Board Innovations
1960s Designed and manufactured temperature transmitters and thermo-electric metal testers
1970s Rack-mount I/O systems and field-mount transmitters
1980s Remote data acquisition systems; Exorbus and VMEbus I/O boards
1990s μP-based signal conditioners; Industry Pack modules and carrier cards
2000s Distributed I/O; PMC modules, PCI and CompactPCI I/O boards, reconfigurable FPGA modules
2010s USB-configured instruments; XMC modules, VPX boards, industrial PCs
2016 Offer contract manufacturing services
References
Technology companies established in 1957
Engineering companies of the United States
1957 establishments in Michigan
Companies based in Oakland County, Michigan |
https://en.wikipedia.org/wiki/Tadataka | Tadataka (written: 隆忠, 忠敬, 忠教 or 忠崇) is a masculine Japanese given name. Notable people with the name include:
, Japanese kugyō
, Japanese daimyō
, Japanese cartographer
, Japanese samurai
Japanese masculine given names
Masculine given names |
https://en.wikipedia.org/wiki/Rectifier%20%28neural%20networks%29 | In the context of artificial neural networks, the rectifier or ReLU (rectified linear unit) activation function is an activation function defined as the positive part of its argument:
where x is the input to a neuron. This is also known as a ramp function and is analogous to half-wave rectification in electrical engineering. This activation function was introduced by Kunihiko Fukushima in 1969 in the context of visual feature extraction in hierarchical neural networks. It was later argued that it has strong biological motivations and mathematical justifications. In 2011 it was found to enable better training of deeper networks, compared to the widely used activation functions prior to 2011, e.g., the logistic sigmoid (which is inspired by probability theory; see logistic regression) and its more practical counterpart, the hyperbolic tangent. The rectifier is, , the most popular activation function for deep neural networks.
Rectified linear units find applications in computer vision and speech recognition using deep neural nets and computational neuroscience.
Advantages
Sparse activation: For example, in a randomly initialized network, only about 50% of hidden units are activated (have a non-zero output).
Better gradient propagation: Fewer vanishing gradient problems compared to sigmoidal activation functions that saturate in both directions.
Efficient computation: Only comparison, addition and multiplication.
Scale-invariant: .
Rectifying activation functions were used to separate specific excitation and unspecific inhibition in the neural abstraction pyramid, which was trained in a supervised way to learn several computer vision tasks. In 2011, the use of the rectifier as a non-linearity has been shown to enable training deep supervised neural networks without requiring unsupervised pre-training. Rectified linear units, compared to sigmoid function or similar activation functions, allow faster and effective training of deep neural architectures on large and complex datasets.
Potential problems
Non-differentiable at zero; however, it is differentiable anywhere else, and the value of the derivative at zero can be arbitrarily chosen to be 0 or 1.
Not zero-centered.
Unbounded.
Dying ReLU problem: ReLU (rectified linear unit) neurons can sometimes be pushed into states in which they become inactive for essentially all inputs. In this state, no gradients flow backward through the neuron, and so the neuron becomes stuck in a perpetually inactive state and "dies". This is a form of the vanishing gradient problem. In some cases, large numbers of neurons in a network can become stuck in dead states, effectively decreasing the model capacity. This problem typically arises when the learning rate is set too high. It may be mitigated by using leaky ReLUs instead, which assign a small positive slope for x < 0; however, the performance is reduced.
Variants
Piecewise-linear variants
Leaky ReLU
Leaky ReLUs allow a small, positive gradient whe |
https://en.wikipedia.org/wiki/Nvidia%20CUDA%20Compiler | Nvidia CUDA Compiler (NVCC) is a proprietary compiler by Nvidia intended for use with CUDA. CUDA code runs on both the CPU and GPU. NVCC separates these two parts and sends host code (the part of code which will be run on the CPU) to a C compiler like GCC or Intel C++ Compiler (ICC) or Microsoft Visual C++ Compiler, and sends the device code (the part which will run on the GPU) to the GPU. The device code is further compiled by NVCC. NVCC is based on LLVM. According to Nvidia provided documentation, nvcc in version 7.0 supports many language constructs that are defined by the C++11 standard and a few C99 features as well. In version 9.0 several more constructs from the C++14 standard are supported.
Any source file containing CUDA language extensions (.cu) must be compiled with nvcc. NVCC is a compiler driver which works by invoking all the necessary tools and compilers like cudacc, g++, cl, etc. NVCC can output either C code (CPU Code) that must then be compiled with the rest of the application using another tool or PTX or object code directly. An executable with CUDA code requires: the CUDA core library (cuda) and the CUDA runtime library (cudart).
Other widely used libraries:
CUBLAS: BLAS implementation
CUFFT: FFT implementation
CUDPP (Data Parallel Primitives): Reduction, Scan, Sort.
Thrust: Reduction, Scan, Sort.
See also
OpenCL
Heterogeneous System Architecture
CUDA binary (cubin) – a type of fat binary
References
David B. Kirk, and Wen-mei W. Hwu. Programming massively parallel processors: a hands-on approach. Morgan Kaufmann, 2010.
Nvidia Documentation on nvcc. https://docs.nvidia.com/cuda/cuda-compiler-driver-nvcc/
CUDPP. https://web.archive.org/web/20181117222643/http://gpgpu.org/developer/cudpp
Nvidia software
Compilers |
https://en.wikipedia.org/wiki/Yen%27s%20algorithm | In graph theory, Yen's algorithm computes single-source K-shortest loopless paths for a graph with non-negative edge cost. The algorithm was published by Jin Y. Yen in 1971 and employs any shortest path algorithm to find the best path, then proceeds to find K − 1 deviations of the best path.
Algorithm
Terminology and notation
Description
The algorithm can be broken down into two parts, determining the first k-shortest path, , and then determining all other k-shortest paths. It is assumed that the container will hold the k-shortest path, whereas the container , will hold the potential k-shortest paths. To determine , the shortest path from the source to the sink, any efficient shortest path algorithm can be used.
To find the , where ranges from to , the algorithm assumes that all paths from to have previously been found. The iteration can be divided into two processes, finding all the deviations and choosing a minimum length path to become . Note that in this iteration, ranges from to .
The first process can be further subdivided into three operations, choosing the , finding , and then adding to the container . The root path, , is chosen by finding the subpath in that follows the first nodes of , where ranges from to . Then, if a path is found, the cost of edge of is set to infinity. Next, the spur path, , is found by computing the shortest path from the spur node, node , to the sink. The removal of previous used edges from to ensures that the spur path is different. , the addition of the root path and the spur path, is added to . Next, the edges that were removed, i.e. had their cost set to infinity, are restored to their initial values.
The second process determines a suitable path for by finding the path in container with the lowest cost. This path is removed from container and inserted into container and the algorithm continues to the next iteration.
Pseudocode
The algorithm assumes that the Dijkstra algorithm is used to find the shortest path between two nodes, but any shortest path algorithm can be used in its place.
function YenKSP(Graph, source, sink, K):
// Determine the shortest path from the source to the sink.
A[0] = Dijkstra(Graph, source, sink);
// Initialize the set to store the potential kth shortest path.
B = [];
for k from 1 to K:
// The spur node ranges from the first node to the next to last node in the previous k-shortest path.
for i from 0 to size(A[k − 1]) − 2:
// Spur node is retrieved from the previous k-shortest path, k − 1.
spurNode = A[k-1].node(i);
// The sequence of nodes from the source to the spur node of the previous k-shortest path.
rootPath = A[k-1].nodes(0, i);
for each path p in A:
if rootPath == p.nodes(0, i):
// Remove the links that are part of the previous shortest paths which share the same root pa |
https://en.wikipedia.org/wiki/Billboard%20Year-End%20Hot%20100%20singles%20of%202012 | Billboard publishes annual lists of songs based on chart performance over the course of a year based on Nielsen Broadcast Data Systems and SoundScan information. For 2012, the list for the top 100 Billboard Hot 100 Year-End songs was published on December 14, calculated with data from December 3, 2011 to November 24, 2012. At the number-one position was Gotye's "Somebody That I Used to Know" featuring Kimbra, which stayed atop the Hot 100 for eight consecutive weeks.
See also
2012 in American music
List of Billboard Hot 100 number-one singles of 2012
List of Billboard Hot 100 top-ten singles in 2012
References
United States Hot 100 Year-End
Lists of Billboard Year-End Hot 100 singles |
https://en.wikipedia.org/wiki/LRT%20Klasika | LRT Klasika is a Lithuanian radio station dedicated to culture and classical music and produced by Lithuanian National Radio and Television (LRT).
LRT Klasika is broadcast from a network of 22 FM transmitters and its programmes are also streamed on the internet.
Programming
Its programme content in 2012 was made up as follows:
Music 64.3%
Cultural 24.2%
Educational 6.3%
Religious 4.4%
Current affairs 0.6%
Other 0.2%
References
External links
Radio stations in Lithuania |
https://en.wikipedia.org/wiki/Kathivakkam%20railway%20station | Kathivakkam railway station is one of the railway station of the Chennai Central–Gummidipoondi section of the Chennai Suburban Railway Network. It serves the neighbourhood of Kathivakkam, a suburb of Chennai, and is located 14 km north of Chennai Central railway station. It has an elevation of 9 m above sea level.
History
The lines at the station were electrified on 13 April 1979, with the electrification of the Chennai Central–Gummidipoondi section.
Gallery
See also
Chennai Suburban Railway
Railway stations in Chennai
References
External links
Kathivakkam station at Indiarailinfo.com
Stations of Chennai Suburban Railway
Railway stations in Chennai
Railway stations in Tiruvallur district |
https://en.wikipedia.org/wiki/Slowsort | Slowsort is a sorting algorithm. It is of humorous nature and not useful. It is a reluctant algorithm based on the principle of multiply and surrender (a parody formed by taking the opposites of divide and conquer). It was published in 1984 by Andrei Broder and Jorge Stolfi in their paper Pessimal Algorithms and Simplexity Analysis (a parody of optimal algorithms and complexity analysis).
Algorithm
Slowsort is a recursive algorithm.
It sorts in-place.
It is a stable sort. (It does not change the order of equal-valued keys.)
This is an implementation in pseudocode:
procedure slowsort(A[], start_idx, end_idx) // Sort array range A[start ... end] in-place.
if start_idx ≥ end_idx then
return
middle_idx := floor( (start_idx + end_idx)/2 )
slowsort(A, start_idx, middle_idx) // (1.1)
slowsort(A, middle_idx + 1, end_idx) // (1.2)
if A[end_idx] < A[middle_idx] then
swap (A, end_idx, middle_idx) // (1.3)
slowsort(A, start_idx, end_idx - 1) // (2)
Sort the first half, recursively. (1.1)
Sort the second half, recursively. (1.2)
Find the maximum of the whole array by comparing the results of 1.1 and 1.2, and place it at the end of the list. (1.3)
Sort the entire list (except for the maximum now at the end), recursively. (2)
An unoptimized implementation in Haskell (purely functional) may look as follows:
slowsort :: (Ord a) => [a] -> [a]
slowsort xs
| length xs <= 1 = xs
| otherwise = slowsort xs' ++ [max llast rlast] -- (2)
where m = length xs `div` 2
l = slowsort $ take m xs -- (1.1)
r = slowsort $ drop m xs -- (1.2)
llast = last l
rlast = last r
xs' = init l ++ min llast rlast : init r
Complexity
The runtime for Slowsort is .
A lower asymptotic bound for in Landau notation is for any .
Slowsort is therefore not in polynomial time. Even the best case is worse than Bubble sort.
References
Computer humor
Sorting algorithms |
https://en.wikipedia.org/wiki/Patt%20%28disambiguation%29 | Yale Nance Patt is an American professor of electrical and computer engineering at The University of Texas at Austin.
Patt may also refer to:
People
Harvey M. Patt (1918–1982), American physiologist, radiobiologist, and cell biologist
Iddo Patt, filmmaker and television advertiser
Other
Party All the Time, a song sometimes referred to as "PATT"
Trentino Tyrolean Autonomist Party (Partito Autonomista Trentino Tirolese) |
https://en.wikipedia.org/wiki/Foreground%20detection | Foreground detection is one of the major tasks in the field of computer vision and image processing whose aim is to detect changes in image sequences. Background subtraction is any technique which allows an image's foreground to be extracted for further processing (object recognition etc.).
Many applications do not need to know everything about the evolution of movement in a video sequence, but only require the information of changes in the scene, because an image's regions of interest are objects (humans, cars, text etc.) in its foreground. After the stage of image preprocessing (which may include image denoising, post processing like morphology etc.) object localisation is required which may make use of this technique.
Foreground detection separates foreground from background based on these changes taking place in the foreground. It is a set of techniques that typically analyze video sequences recorded in real time with a stationary camera.
Description
All detection techniques are based on modelling the background of the image, i.e. set the background and detect which changes occur. Defining the background can be very difficult when it contains shapes, shadows, and moving objects. In defining the background it is assumed that the stationary objects could vary in color and intensity over time.
Scenarios where these techniques apply tend to be very diverse. There can be highly variable sequences, such as images with very different lighting, interiors, exteriors, quality, and noise. In addition to processing in real time, systems need to be able to adapt to these changes.
A very good foreground detection system should be able to:
Develop a background (estimate) model.
Be robust to lighting changes, repetitive movements (leaves, waves, shadows), and long-term changes.
Background subtraction
Background subtraction is a widely used approach for detecting moving objects in videos from static cameras. The rationale in the approach is that of detecting the moving objects from the difference between the current frame and a reference frame, often called "background image", or "background model". Background subtraction is mostly done if the image in question is a part of a video stream. Background subtraction provides important cues for numerous applications in computer vision, for example surveillance tracking or human pose estimation.
Background subtraction is generally based on a static background hypothesis which is often not applicable in real environments. With indoor scenes, reflections or animated images on screens lead to background changes. Similarly, due to wind, rain or illumination changes brought by weather, static backgrounds methods have difficulties with outdoor scenes.
Temporal average filter
The temporal average filter is a method that was proposed at the Velastin. This system estimates the background model from the median of all pixels of a number of previous images.
The system uses a buffer with the pixel values of the last |
https://en.wikipedia.org/wiki/Girls%20in%20Prison%20%281994%20film%29 | Girls in Prison is a 1994 American television film directed by John McNaughton. Girls in Prison originally aired on the cable television network Showtime in 1994 as part of the series Rebel Highway.
Plot
A young aspiring singer is sent to prison after getting wrongly convicted of murdering a record company president in 1950s Hollywood. With the help of two other convicts whose backstories we see previously, she must survive as the real culprits send "hit girls" to kill her inside. One of these convicts connects her to a private investigator who tracks the culprits down, but the murderer has determined to silence her.
Cast
Diane McGee as Mrs. Felton
Harvey Chao as Liam Fong
Bahni Turpin as Melba
Ralph Meyering Jr. as Jim Jeffrey
Letitia Hicks as Receptionist
Ione Skye as Carol Madison
J. Patrick McCormack as Gordon Madison
William C. Clark as Actor Playing McCarthy
William Boyett as Dr. Shainmark
David Paul Needles as McCarthy on Newsreel
Tamara Clatterbuck as Actress on Newsreel
Missy Crider as Aggie O'Hanlon
Jon Polito as Boss Johnson
Anne Heche as Jennifer
Angie Rae McKinney as Miranda
Raymond O'Connor as Mickey Maven
References
External links
1994 television films
1994 films
American television films
1990s English-language films
Films directed by John McNaughton
Films scored by Hummie Mann
Rebel Highway
Women in prison films
Films set in the 1950s
Films produced by Debra Hill |
https://en.wikipedia.org/wiki/Timeline%20of%20numerical%20analysis%20after%201945 | The following is a timeline of numerical analysis after 1945, and deals with developments after the invention of the modern electronic computer, which began during Second World War. For a fuller history of the subject before this period, see timeline and history of mathematics.
1940s
Monte Carlo simulation (voted one of the top 10 algorithms of the 20th century) invented at Los Alamos by von Neumann, Ulam and Metropolis.
Crank–Nicolson method was developed by Crank and Nicolson.
Dantzig introduces the simplex method (voted one of the top 10 algorithms of the 20th century) in 1947.
Turing formulated the LU decomposition method.
1950s
Successive over-relaxation was devised simultaneously by D.M. Young, Jr. and by H. Frankel in 1950.
Hestenes, Stiefel, and Lanczos, all from the Institute for Numerical Analysis at the National Bureau of Standards, initiate the development of Krylov subspace iteration methods. Voted one of the top 10 algorithms of the 20th century.
Equations of State Calculations by Fast Computing Machines introduces the Metropolis–Hastings algorithm.
In numerical differential equations, Lax and Friedrichs invent the Lax-Friedrichs method.
Householder invents his eponymous matrices and transformation method (voted one of the top 10 algorithms of the 20th century).
Romberg integration
John G.F. Francis and Vera Kublanovskaya invent QR factorization (voted one of the top 10 algorithms of the 20th century).
1960s
First recorded use of the term "finite element method" by Ray Clough, to describe the methods of Courant, Hrenikoff, Galerkin and Zienkiewicz, among others. See also here.
Exponential integration by Certaine and Pope.
In computational fluid dynamics and numerical differential equations, Lax and Wendroff invent the Lax-Wendroff method.
Fast Fourier Transform (voted one of the top 10 algorithms of the 20th century) invented by Cooley and Tukey.
First edition of Handbook of Mathematical Functions by Abramowitz and Stegun, both of the U.S.National Bureau of Standards.
Broyden does new quasi-Newton method for finding roots in 1965.
The MacCormack method, for the numerical solution of hyperbolic partial differential equations in computational fluid dynamics, is introduced by MacCormack in 1969.
Verlet (re)discovers a numerical integration algorithm, (first used in 1791 by Delambre, by Cowell and Crommelin in 1909, and by Carl Fredrik Störmer in 1907, hence the alternative names Störmer's method or the Verlet-Störmer method) for dynamics.
1970s
Creation of LINPACK and associated benchmark by Dongarra et al., as well as BLAS.
1980s
Progress in wavelet theory throughout the decade, led by Daubechies et al.
Creation of MINPACK.
Fast multipole method (voted one of the top 10 algorithms of the 20th century) invented by Rokhlin and Greengard.
First edition of Numerical Recipes by Press, Teukolsky, et al.
In numerical linear algebra, the GMRES algorithm invented in 1986.
See also
Scientific computing
Histor |
https://en.wikipedia.org/wiki/Tom%20Worthington%20%28computer%20programmer%29 | Thomas Worthington (born 3 February 1957) is an Australian computer programmer best known as an expert witness in the Maguire v SOCOG 2000 Olympic web accessibility case and teacher of Green computing.
He is known for his ICT policy work and on-line teaching.
Projects
Worthington was President of the Australian Computer Society (ACS). He gave evidence opposing Internet censorship on behalf of the ACS to an Australian Senate committee hearing in the mid 1990s.
Worthington appeared as an expert witness in the case Maguire v SOCOG 2000 in the Human Rights and Equal Opportunity Commission, providing an analysis of the accessibility for the disabled of the Sydney 2000 Olympics web site
He is the author of ICT Sustainability: Assessment and Strategies for a Low Carbon Future, a free open access book of course notes for Green computing courses run by the Australian National University and Australian Computer Society.
In July 2013 Worthington established a new business and website "Higher Education Whisperer", to provide advice on vocational and university course design, learning, teaching and research.
Academic achievements
Worthington undertook his computer programmer training in the Australian Public Service. He also completed a Certificate in Audio-Visual Video, Audio-Visual Video Production at the Canberra Institute of Technology in 1990. He was awarded a Graduate Certificate in Higher Education by The Australian National University and Certificate IV in Training and Assessment (TAE40110) from Canberra Institute of Technology (CIT) in 2013. He was awarded a Masters of Education in Distance Education by Athabasca University in February 2017.
Worthington has had research papers published on topics including e-learning for ICT sustainability and a proposal to combine the features of synchronous and asynchronous learning in one software package.
Employment
Worthington is an Adjunct Lecturer in the Research School of Computer Science, College of Engineering and Computer Science at the Australian National University, where he teaches ICT Sustainability, the design of web sites and use of e-commerce systems. He is also a member of the ANU Energy Change Institute and the ANU Climate Change Institute. Previously he worked as a civilian public servant employed by the Australian Department of Defence in the Australian Defence Force Headquarters, writing Internet and web policy.
Awards and honours
In May 1998, Computerworld magazine named Worthington as one of the most influential individuals in the Australian IT industry. In 1999 the Australian Computer Society elected Worthington a Fellow of the society for his contribution to public policy on the use of the Internet. He was later made an Honorary Life Member and Certified Professional. In 2010 Worthington was presented with the ACT ICT Educator of the Year 2010 Award for his work on sustainable computing education.
References
Australian computer programmers
1957 births
Living people
People from th |
https://en.wikipedia.org/wiki/Peek%20%28data%20type%20operation%29 | In computer science, peek is an operation on certain abstract data types, specifically sequential collections such as stacks and queues, which returns the value of the top ("front") of the collection without removing the element from the collection. It thus returns the same value as operations such as "pop" or "dequeue", but does not modify the data.
The name "peek" is similar to the basic "push" and "pop" operations on a stack, but the name for this operation varies depending on data type and language. Peek is generally considered an inessential operation, compared with the more basic operations of adding and removing data, and as such is not included in the basic definition of these data types. However, since it is a useful operation and generally easily implemented, it is frequently included in practices, and in some definitions peek is included as basic, with pop (or analog) defined in terms of peek; see abstract definition.
Data types
Sequential types for which peek is often implemented include:
Stack
Queue
Priority queue (such as a heap)
Double-ended queue (deque)
Double-ended priority queue (DEPQ)
Single-ended types, such as stack, generally only admit a single peek, at the end that is modified. Double-ended types, such as deques, admit two peeks, one at each end.
Names for peek vary. "Peek" or "top" are common for stacks, while for queues "front" is common. Operations on deques have varied names, often "front" and "back" or "first" and "last". The name "peak" is also occasionally found, in the sense of "top, summit", though this also occurs as a spelling error for the verb "peek".
Abstract definition
Intuitively, peek returns the same value as pop, but does not change the data. Behavior when the collection is empty varies – most often this yields an underflow error, identically to a pop on an empty collection, but some implementations provide a function which instead simply returns (without error), essentially implementing if isempty then return, else peek.
This behavior can be axiomatized in various ways. For example, a common VDM (Vienna Development Method) description of a stack defines top (peek) and remove as atomic, where top returns the top value (without modifying the stack), and remove modifies the stack (without returning a value). In this case pop is defined in terms of top and remove.
Alternatively, given pop, the operation peek can be axiomatized as:
peek(D) = pop(D)
peek(D), D = D
meaning "returns the same value as pop", and "does not change the underlying data" (value of data after peek same as before peek).
Implementation
Peek can generally be implemented very easily in simple routine taking O(1) time and no added space, by a simple variant of the pop operation. Most sequential data types are implemented by a data structure containing a reference to the end, and thus peek is simply implemented by dereferencing this. In some cases it is more complicated, however.
For some data types, such as stacks, this can |
https://en.wikipedia.org/wiki/Ennore%20railway%20station | Ennore railway station is one of the railway stations of the Chennai Central–Gummidipoondi section of the Chennai Suburban Railway Network. It serves the neighbourhood of Ennore, a suburb of Chennai, and is located 16 kilometres north of Chennai Central railway station. It has an elevation of 7 metres above sea level.
History
The lines at the station were electrified on 13 April 1979, with the electrification of the Chennai Central–Gummidipoondi section.
Traffic
About 15,000 people uses the station every day.
See also
Chennai Suburban Railway
Railway stations in Chennai
References
External links
Ennore station at Indiarailinfo.com
Stations of Chennai Suburban Railway
Railway stations in Chennai
Railway stations in Tiruvallur district |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.