source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/Zeitschriftendatenbank | The or ZDB (translated as: German Union Catalogue of Serials) is the central bibliographical database for title and ownership records of ongoing collections in Germany and Austria, for example from trade journals, magazines and newspapers. The ZDB holds records of almost all German scientific libraries and many other public libraries and is freely available on the Internet. The journal database is managed by the (SBB) in cooperation with the (DNB), the German National Library, which is responsible for the technical system support and further development.
Overview
The basic requirement for the inclusion of a title in the journal database is that it belongs to the genre of the continuous collective works like periodicals, serials or series issued in several parts (booklets, volumes) and which are not limited in the duration of publication (such as lexica). The spectrum includes not only printed evidence (print media), but also titles from electronic journals and microforms.
The database records which periodicals are available in the individual participating libraries and allows searching for magazine titles. The so-called inventory data record provides information about which volumes are available in which library. In contrast, the ZDB does not list any article title.
Due to its range of title and inventory records, the ZDB is the backbone of interlibrary loan system in Germany for the aforementioned types of literature. In addition to the holdings of German libraries, it also lists those from Austria and (to a limited extent) other European countries. As one of the world's largest database of its kind, the ZDB comprises more than 1.9 million titles in all languages from 1500 up to the present day and it contains over 17 million ownership records of around 3630 German and Austrian libraries for these titles.
Since June 2014, most of the metadata has been under the Creative Commons Zero (CC0 1.0) license and is therefore released for reuse.
In the 1970s, the former (GKD) was created from the catalogue data of the ZDB. This was incorporated into the (GND) in April 2012.
Notes
References
External links
https://www.dnb.de/DE/Professionell/ProjekteKooperationen/zdb/zdb_node.html
https://zdb-katalog.de/ ZDB catalog
http://www.zeitschriftendatenbank.de/ news about ZDB
Digital libraries
Creative Commons-licensed databases |
https://en.wikipedia.org/wiki/Lichenoconium%20pyxidatae | Lichenoconium pyxidatae is a species of lichenicolous fungus belonging to the class Dothideomycetes. It has a Holarctic distribution being found in Alaska and various parts of Russia, including Siberia, Franz Josef Land, Novaya Zemlya and Wrangel Island.
Host species
Lichenoconium pyxidatae is known to infect numerous host species. It has a preference to growing on the podium of Cladonia lichens. Known host species include:
Cladonia chlorophaea (sensu lato)
Cladonia coniocraea
Cladonia deformis
Cladonia macroceras
Cladonia macrophylla
Cladonia pocillum
Cladonia pyxidata
Cladonia rangiferina
some unidentified Cladonia species
References
Dothideomycetes
Fungi described in 1900 |
https://en.wikipedia.org/wiki/Liiv%20Sandbox | Liiv Sandbox (), formerly Sandbox Gaming, is a South Korean esports organization owned by the multi-channel network . It has teams competing in League of Legends, Crazyracing Kartrider, and FIFA Online. Its League of Legends team competes in the LCK, the top-level league for the game in South Korea.
League of Legends
History
Sandbox Network acquired the roster and LCK spot of Team BattleComics on 18 December 2018, shortly after the latter qualified for the league through the promotion tournament.
Current roster
Notes
References
External links
Sandbox Network – Esports
Esports teams based in South Korea
League of Legends Champions Korea teams |
https://en.wikipedia.org/wiki/Maschinelles%20Austauschformat%20f%C3%BCr%20Bibliotheken | The or MAB (literally translating as "machine data exchange format for libraries") is a bibliographic data exchange format.
MAB was commonly used as an exchange format for metadata especially in German-speaking countries. Internationally, a comparable widespread exchange format today is MARC.
Overview
MAB was mostly used in conjunction with the (RAK). The origins of MAB trace back to 1973, when a national exchange format was initiated in Germany under the leadership of the (DNB) together with the (ABT). A comprehensive revision of MAB led to the new format version MAB2 in 1995 after two years of development work. Later, four supplements to MAB2 were published.
The DNB neither used MAB as a cataloging format nor internally as a working format, but only for data exchange with other libraries. The use of MAB in the German-speaking library sector has been replaced by a switch to MARC:
Since 2009, the DNB started to provide its bibliographic data and authority data also in MARC 21 format. With the introduction of the (GND) in April 2012 the delivery of authority data in MAB format by the DNB was discontinued. In June 2013, the delivery of data in MAB format was finally abandoned.
Content and structure
Similar to its Anglo-American counterpart MARC, MAB consists of five sub-formats that characterize different types of data:
MAB format for bibliographic data (MAB-Titel)
MAB format for name authority data (MAB-PND)
MAB format for corporate bodies (MAB-GKD)
MAB format for subject headings (MAB-SWD)
MAB format for local data (MAB-Lokal)
The MAB format allows a finer granularity when marking bibliographical elements than MARC. The greater diversification can be absorbed by grouping similar elements. Elements that belong together are arranged hierarchically.
Comparison with MARC
Although influenced by MARC, MAB does not represent a strictly congruent equivalent mapping compared to the MARC architecture, but shows some significant conceptual differences.
While the MARC formats follow a relatively strict sequence of record headers and secondary entries when recording a title, MAB allows elements that match each other to be arranged in segments.
The approach of the MAB is therefore more geared towards the linking of semantically related components than to the comparatively static structure of the MARC formats.
Another difference is the assignment between bibliographical elements and fields. While MARC may combine several bibliographical elements in fields or subfields, MAB generally only assigns one element to each field. For example, field 245 of the MARC bibliographic format records a subject title along with a parallel title, while MAB would define a separate field for the parallel title. Overall, MAB prefers a more finely granulated breakdown and then puts the individual components in a context. In MARC, information about a multi-volume work would possibly be summarized in one sentence, while MAB in this case forms several sentences |
https://en.wikipedia.org/wiki/Julie%20Fouquet | Julie Elizabeth Fouquet is an American applied physicist, engineer, laser scientist, and inventor known for her work in optical networking and wave power.
Education
Fouquet was born in Palo Alto, California. She majored in physics at Harvard University (Radcliffe College), advised by Edward Mills Purcell. At Harvard, she served as the undergraduate representative on the university's Advisory Committee on Shareholder Responsibility, but resigned in 1978 in protest of its makeup and behavior. She graduated Phi Beta Kappa in 1980, and earned a Ph.D. in applied physics from Stanford University in 1986, with the dissertation Recombination Dynamics in Quantum Well Semiconductor Structures supervised by laser scientist Anthony E. Siegman.
Career
She began working for HP Labs in 1985, and later worked for the HP spin-off company Agilent Technologies. There, she developed all-optical switches based on reflection of light from bubbles in a fluid, generated using the same technology used for inkjet printers. In 2004, she was named a Fellow of the IEEE, "for contributions to optical switch and light-emitting device technologies". Parts of Agilent spun off again into Avago Technologies in 2005, and Fouquet came to work for Avago as a senior principal research scientist.
In 2015, she founded 3newable LLC, a company focused on developing renewable energy from ocean waves.
References
Year of birth missing (living people)
Living people
21st-century American engineers
American physicists
American women engineers
American women physicists
Radcliffe College alumni
Stanford University alumni
Fellow Members of the IEEE
21st-century American women
Physicists from California |
https://en.wikipedia.org/wiki/JabberMask | JabberMask is an under-development wearable computer face mask that uses LED lights to allow its wearer to smile in a manner, despite wearing a mask. The mask was developed by game developer Tyler Glaiel. An early un-named prototype version of the mask gained considerable attention online when revealed on Glaiel's personal Twitter account, and even WHO ended up listing it as a "COVID-19 innovation" on their website. Though he initially said he had no plans to sell it and recommended people making their own, the positive press led him to eventually take the project to Kickstarter where he was able to crowdfund over $70,000 to mass-produce it. The mask is powered by an Arduino computer.
References
American inventions
Kickstarter-funded products
Medical masks
Wearable computers |
https://en.wikipedia.org/wiki/List%20of%20programs%20broadcast%20by%20Heart%20of%20Asia%20Channel | The following is a list of programs broadcast by Heart of Asia Channel, a Philippine free-to-air television channel owned by GMA Network Inc.
Current original programs
Note: Titles are listed in alphabetical order followed by the year of debut in parentheses.
Chinese
The Wolf
South Korean
Backstreet Rookie
Ghost Doctor
Innocent Defendant
Oh My Baby
Scarlet Heart
The Merciless Judge
The Penthouse
That Kind Of Love
Thai
Mint to Be
The Leaves
Current syndicated programs
Note: Titles are listed in alphabetical order followed by the year of debut in parentheses.
News
GMA Integrated News Bulletin
Local drama
Juan Happy Love Story
Princess Charming
Film presentation
Action Flicks
Asian Cinemix
Feel na Films
Strictly Pinoy
Infomercial
EZ Shop Asia
Upcoming programs
K-Feels
Angel's Last Mission
Another Miss Oh
Delayed Justice
Goblin: The Lonely and Great God
My Love From the Star
My Shy Boss
What's Wrong with Secretary Kim
Witch's Love
VIP
Absolutely Asian
Beauty Boy
Gokusen
Legend of Fuyao
Nabi, My Stepdarling
Prince of Wolf
Put Your Head on My Shoulder
Previous programs
Note: Titles are listed in alphabetical order followed by the year of debut in parentheses.
Original programs
Chinese
Douluo Continent
Fighter of Destiny
Fire of Eternal Love
General and I
God of Lost Fantasy
Legend of Fuyao
Love Actually
Miss The Dragon
Princess Weiyoung
Rakshasa Street
Starry Night, Starry Sea
The Fox Fairy
The Love Knot
When a Snail Falls in Love
Indian
Aladdin: You Would've Heard the Name
Japanese
Chibi Maruko-chan
Gokusen
Moribito: Final
Latin American
La Doña
The Formula
Malay
The Maid
Singaporean
Hello From The Other Side
When Duty Calls
South Korean
About Time
Angel's Last Mission
Are You Human?
Backstreet Rookie
Boys Over Flowers
Code Name: Yong-Pal
Doctor John
Dong Yi
Emperor: Ruler of the Mask
Ending Again
Ending Like A Flower
Eunguk and the Ugly Duckling
Extraordinary You
Fates and Furies
Fight for My Way
Girl Detective Park Hae-Sol
Her Private Life
Hit the Top
I Hear Your Voice
Innocent Defendant
Into the World Again
Lie After Lie
Like a Fairytale
Love Alert
Love in the Moonlight
Love in Trouble
Man X Man
Marrying My Daughter Twice
Middle School Student A
Misty
Mr. Queen
My Absolute Boyfriend
My Daughter, Geum Sa-weol
My Friend is Still Alive
My Love from the Star
Oh My Baby
Oh My Ghost
One the Woman
Playful Kiss
Princess Hours (Korean version)
Queen and I
Queen of Mystery
Scarlet Heart
Scripting Your Destiny
Secret Garden
Show Window: The Queen's House
Signal
Sky Castle
Stairway to Heaven
Strong Girl Bong-soon
Tale of the Nine Tailed
Taste of Curry
The Best Ending
The Big One
The Good Manager
The Heirs
The Last Empress
The Legend of the Blue Sea
The Penthouse
The Penthouse 2
The Penthouse 3
The Red Sleeve
|
https://en.wikipedia.org/wiki/Green%20Snake%20%282021%20film%29 | Green Snake, known in China as White Snake 2: The Tribulation of the Green Snake (), is a 2021 Chinese computer animation fantasy film directed by Amp Wong, with animation production by Light Chaser Animation, Alibaba Pictures, Tianjin Maoyan Weiying Culture Media and Bilibili. It is the sequel to 2019's White Snake. The film was inspired by the Chinese folktale Legend of the White Snake and was released in China on 23 July 2021.
Synopsis
Verta the green snake-demon must find a way to escape from the modern Shura City of mortals, in order to rescue her elder sister Blanca the White Snake from the demon-slaying monk Fahai without her demonic abilities.
Plot
At Zhenjiang, China, the snake-demon sisters, Blanca the white snake and Verta the green snake, challenge the demon-slaying monk, Fahai, to rescue Blanca's husband, Xu Xian. They are defeated, Blanca's hairpin wand gets destroyed and she gets imprisoned under Leifeng Pagoda. Verta blames Xian for being weak and useless, as well as Blanca for falling for him. Verta gets overpowered again and gets sucked into a portal.
Verta wakes up, without her demonic powers, in a modern dystopian city called Asuraville, a place that imprisons creatures from many different eras. She meets a woman named Sun, who helps her adjust to the modern world, and a mysterious masked man with amnesia, who saves them. The main enemies in Asuraville are an army of Ox-Heads & Horse-Faces, led by the Ox Leader who seeks to conquer the city. Sun is killed by the Ox's army, but Verta is saved by the Raksha army, led by a man named Simon, whom Verta gets smitten with.
Simon takes her to All-Good Market to meet the owner, who turns out to be the fox-demon. Verta also meets the masked man again. The fox-demon explains that everyone gets sent here because they have an obsession. The only way to leave is to let it go by discarding their token and jumping into the Pool of Release, but it makes you forget what you cared about and drains your will. Not wanting to forget Blanca, Verta doesn't do it, while the masked man can't remember his obsession. She lets him join them in gratitude for saving her.
Back at Raksha territory, the Ox's army kills Simon's army. While outrunning some evil spirits, the masked man gets stuck and Verta tries to help him, but Simon abandons them upon seeing them as dead weight. The pair survive anyway. Verta learns a lesson that in love strength doesn’t matter, having a good heart does, accepting that her sister was right. The masked man removes his mask, revealing his face resembles Blanca, indicating that he's a reincarnation of her from another era. They go back to the market, with Simon there too, to ask the fox-demon for an alternate way of getting out. She tells them about the Wish Bridge, which is harder, but doesn't cost anything. The Ox's army invades the market. Simon apologizes to Verta and attempts to fight the Ox. He dealt what should have been the decisive blow but it is revealed that the Ox |
https://en.wikipedia.org/wiki/Janka%20Chleb%C3%ADkov%C3%A1 | Janka Chlebíková is a Slovak computer scientist specializing in graph algorithms, combinatorial optimization, and hardness of approximation. She is a senior lecturer and associate head for partnerships in the school of computing at the University of Portsmouth in England.
Education and career
Chlebíková earned a diploma (master's degree) in mathematics from Charles University in 1988, a doctorate in mathematics from Charles University, and a second doctorate in computer science from Comenius University in 2000.
After working as a software developer, she became a lecturer at Comenius University in 1995. She became a postdoctoral researcher at the University of Kiel from 2001 to 2004, and then returned to Comenius University as an associate professor from 2004 to 2008 before moving to the University of Portsmouth in 2009.
Personal life
Chlebíková is married to Miroslav Chlebík, a mathematician at the University of Sussex. Their daughter Andrea, a quadrilingual child prodigy in mathematics, studies atmospheric science at the University of Cambridge.
References
External links
Year of birth missing (living people)
Living people
Slovak computer scientists
Slovak women computer scientists
Charles University alumni
Comenius University alumni
Academics of the University of Portsmouth |
https://en.wikipedia.org/wiki/MG-111%20%28Minas%20Gerais%20highway%29 | The MG-111 is a state highway located in the Brazilian state of Minas Gerais. Its total length is , and its entire network is paved. Its route starts in Ipanema and ends at the border between the states of Minas Gerais and Rio de Janeiro.
Route
MG-111 passes through the following municipalities:
Ipanema
Conceição de Ipanema
Santana do Manhuaçu
Manhuaçu
Reduto
Manhumirim
Alto Jequitibá
Caparaó
Espera Feliz
Carangola
Faria Lemos
Tombos
References
Highways in Minas Gerais |
https://en.wikipedia.org/wiki/List%20of%20Innamorata%20episodes | Innamorata is a 2014 Philippine television drama romantic fantasy series broadcast by GMA Network. It premiered on the network's Afternoon Prime line up from February 17, 2014 to June 20, 2014, replacing Magkano Ba ang Pag-ibig?.
Mega Manila ratings are provided by AGB Nielsen Philippines.
Series overview
Episodes
February 2014
March 2014
April 2014
May 2014
June 2014
References
Lists of Philippine drama television series episodes |
https://en.wikipedia.org/wiki/Croft%20railway%20station%2C%20Leicester | Croft railway station was a railway station serving the village of Croft in Leicestershire. It was on the Birmingham to Peterborough Line about southwest of . The line is owned by Network Rail.
History
The station was opened on 1 December 1877 by the London North Western Railway, at a cost of £1209.
British Rail closed the station on 4 March 1968.
The station was of timber, modular construction, similar to that of the LNWR on the Rugby to Stamford Railway, with simple timber braces to support the awning. Access was from the main driveway and footpaths from the adjacent footbridge. Although the "down" platform was removed in 1950, steps from Arbor Road led here. In 1885, the booking office was extended to the west to provide a goods office, this time in concrete, mined from the local granite company. A station master's house was provided in 1892, built on the west side of Station Road. The platforms were faced in local granite and extended in 1904 and again in 1922. The station was a popular entry into the LNWR gardens competition, but was demolished following the station's closure. The Station Masters house and cottages remain after suffragettes set fire to the station in 1914.
References
Disused railway stations in Leicestershire
Former London and North Western Railway stations
Railway stations in Great Britain opened in 1877
Railway stations in Great Britain closed in 1968
Beeching closures in England |
https://en.wikipedia.org/wiki/Naj%20Austin | Najla Austin is an American business executive. She is the founder and CEO of the wellness social club Ethel's Club and the social networking platform Somewhere Good.
Career
Austin began her career in real estate. She decided to found a social club and co-working space for people of color based in Williamsburg, Brooklyn, after she had trouble finding a Black woman therapist. In January 2019, she posted on Instagram to gauge potential interest in the social club and garnered a waiting list of 4,000 people. She founded Ethel's Club shortly after. She used the crowdfunding website iFundWomen to raise $26,000 to finance start-up costs. The business is named after Austin's late grandmother, Ethel Lucas, who was an active community organizer known for her social gatherings. The club, which now has a digital platform, has about 1,500 members as of December 2020.
In October 2020, Austin was selected to speak for the Time100 Talks series curated by Meghan Markle and Prince Harry.
Austin launched a beta version of the social networking platform Somewhere Good in January 2021. She received $3.75 million in seed funding to build the app. It is also oriented to people of color and will have moderators and a member code of conduct. Austin also launched the brand Form No Form, a 24-hour film platform.
Personal life
Austin resides in Brooklyn. Austin has five siblings including Mujai Austin.
Accolades
2019 – Inc., Female Founders 100
2020 –Time Out New York's Women of the Year
References
External links
Official Instagram
Somewhere Good
Ethel's Club
Year of birth missing (living people)
Living people
African-American founders
African-American women in business
American women chief executives
21st-century African-American women
21st-century American businesswomen
21st-century American businesspeople |
https://en.wikipedia.org/wiki/The%208-Bit%20Guy | David Murray (born ), commonly known as The 8-Bit Guy, is an American retrocomputing enthusiast and video game developer who runs a YouTube channel under the same name.
History
Murray launched his YouTube channel in 2006 under the username adric22. He worked on repairing and refurbishing iBook G3 and G4 laptops and later on MacBooks, buying and selling them on eBay, and later from his own website. He called himself the iBook Guy. He made videos to show how he repairs some of the equipment, but had made his living with the actual repairs, as well as resales. In 2011, he shut down his repair business.
Five months after creating his channel, David and his brother made a channel called MyPCHelp, which would mostly upload computer tutorials for the average Joe to understand.
Murray noticed his general videos about computing were attracting more subscribers. In 2015, he renamed his primary channel to "The 8-Bit Guy" and focused on retrocomputing. He says an average episode takes about 15 hours to produce.
Murray ran several different YouTube channels with topics such as keyboard instruments from the 1980s, coin collecting, and airguns, although the latter two did not have as much popularity as his retrocomputing videos so he stopped uploading videos to them.
Murray was dissatisfied with his long used in-home filming studio, so in 2020 he began construction on a small building in his backyard which would hold his new studio. In 2021, the new studio was finished and became Murray's primary filming location.
Content
The channel is known for its videos on restoration of old computers, and demonstration of old technology. Murray has also developed video games designed to run on old computers, including Planet X1 for the VIC-20, Planet X2 for Commodore 64, Planet X3 for MS-DOS and Attack of the PETSCII Robots for the Commodore PET (which has since been then ported to many other platforms, including VIC-20, Commodore 64, Commodore 128, Amiga, Apple II, MS-DOS, NES, SNES, and Sega Genesis). He has demonstrated the development of these games on his YouTube channel. Moreover, he has developed PETDraw for various Commodore computers, a pseudo-raster drawing software using PETSCII. In addition, Murray is working on the Commander X16, an 8 bit computer inspired by the Commodore 64, made using off the shelf modern parts (although with a few new old-stock chips such as the YM2151). Murray is also passionate about electric cars, and has published videos about them on his channel.
Murray also co-hosts the GeekBits podcast alongside his brother Mike Murray and friend Craig Bowes.
Personal life
Murray lives in the Dallas–Fort Worth area in Texas. and he used to work for AST Research as a tech support specialist. His second cousin was musician Dimebag Darrell.
References
Living people
1970s births
Year of birth uncertain
American video game programmers
Entertainers from Dallas
Technology YouTubers
YouTube channels launched in 2006
YouTubers from Texas |
https://en.wikipedia.org/wiki/Performance%20portability | Performance portability refers to the ability of computer programs and applications to operate effectively across different platforms. Developers of performance portable applications seek to support multiple platforms without impeding performance, and ideally while minimizing platform-specific code.
It is a sought after commodity within the HPC (high performance computing) community, however there is no universal or agreed upon way to measure it. There is some contention as to whether portability refers to the portability of an application or the portability of the source code.
Performance can be measured in two ways: either by comparing an optimized version of an application with its portable version; or to compare the theoretical peak performance of an application based on how many FLOPs are performed, with the data moved from main-memory to the processor.
The diversity of hardware makes developing software that works across a wide variety of machines increasingly important for the longevity of the application.
Contentions
The term performance portability is frequently used in industry and generally refers to: "(1) the ability to run one application across multiple hardware platforms; and (2) achieving some notional level of performance on these platforms." For example, at the 2016 DOE (United States Department of Energy) Centers of Excellence Performance Portability Meeting, John Pennycook (Intel), stated “An application is performance portable if it achieves a consistent level of performance [e.g. defined by execution time or other figure of merit, not percentage of peak FLOPS (floating point operations per second] across platforms relative to the best known implementation on each platform.” More directly, Jeff Larkin (NVIDIA) noted that performance portability was when "The same source code will run productively on a variety of different architectures."
Performance portability is a key topic of discussion within the HPC (high performance computing) community. Collaborators from industry, academia, and DOE national laboratories meet annually at the Performance, Portability, and Productivity at HPC Forum, launched in 2016, to discuss ideas and progress toward performance portability goals on current and future HPC platforms.
Relevance
Performance portability retains relevance among developers due to constantly evolving computing architectures that threaten to make applications designed for current hardware obsolete. Performance portability represents the assumption that a developer's singular codebase will continue to perform within acceptable limits on newer architectures and on a variety of current architectures that the code hasn't yet been tested on. The increasing diversity of hardware makes developing software that works across a wide variety of machines necessary for longevity and continued relevance.
One prominent proponent of performance portability is the United States Department of Energy's (DOE) Exascale Computing Proje |
https://en.wikipedia.org/wiki/KO%20Masters | KO Masters is a Romanian professional kickboxing, boxing and bare-knuckle promotion company that was founded in 2018.
The KO Masters's events are broadcast by Digi Sport in Romania and Fight Network internationally. KO Masters also aired several of their events live on Sport Extra.
The KO Masters are in partnerships with the Real Xtreme Fighting (RXF).
Events
Notable fighters
Male boxers
Mihai Nistor
Male kickboxers
Claudiu Alexe
Valentin Bordianu
Cezar Buzdugan
Ionel Bălan
Mirel Drăgan
Alex Filip
Ion Grigore
Ionuț Iancu
Alexandru Lungu
Florin Lupu
Răzvan Macioi
Adrian Maxim
Cristian Măniţă
Adelin Mihăilă
Costin Mincu
Amansio Paraschiv
Alexandru Radnev
Cristian Ristea
Muhammed Balli
Michael Boapeah
Lofogo Sarour
Max van Gelder
Ion Surdu
Serghei Zanosiev
Shakib Haroun
Andrew Tate
Female kickboxers
Andreea Cebuc
See also
KO Masters in 2021
Colosseum Tournament
Dynamite Fighting Show
Golden Fighter Championship
OSS Fighters
References
External links
KO Masters on Facebook
Fight Network
2021 establishments in Romania
Bare-knuckle boxing
Professional boxing organizations
Kickboxing organizations
Sports organizations established in 2021
Companies based in Bucharest |
https://en.wikipedia.org/wiki/UFO%20%28video%20game%29 | UFO is a video game for MS-DOS compatible operating systems published in 1989 by Sublogic.
Gameplay
UFO is a game in which the player commands an alien flying saucer looking to harvest the energy released by humans when they experience fear.
Reception
Daniel Hockman reviewed the game for Computer Gaming World, and stated that "the game is unique. There is nothing else like it on the market. If you want something different, can live with polygon cities, and are willing to tackle some truly difficult flight demands you might want to give UFO a try."
Reviews
ASM (Aktueller Software Markt) - Nov, 1989
The Games Machine - Jan, 1990
Computer Gaming World - Nov, 1992
References
1989 video games
Alien invasions in video games
DOS games
DOS-only games
Flight simulation video games
Sublogic games
Unidentified flying objects in fiction
Video games developed in the United States |
https://en.wikipedia.org/wiki/Bonnie%20Ray | Bonnie Kathryn Ray is an American statistician and data scientist, the head of data science at Chartbeat, a publisher data analytics firm. Her publications in statistics have concerned long-range dependence, change detection, orthogonal defect classification, and wide-ranging applications including financial market analysis, climate models, and software engineering.
Education and career
Ray is originally from Mississippi, and grew up in northern Louisiana. She majored in mathematics at Baylor University, where she was president of the Mu Sigma Beta mathematics honor society, and held summer internships at Texas Instruments. She graduated Phi Beta Kappa in 1985, and completed a Ph.D. in statistics at Columbia University in 1991. Her dissertation, Fractionally Differenced ARMA Processes: Seasonality and Forecasting Issues, was jointly supervised by Jonathan Hosking and Howard Levene.
After postdoctoral research with Peter Lewis at the Naval Postgraduate School, she became an assistant professor of mathematics at the New Jersey Institute of Technology, and earned tenure there before moving to the Thomas J. Watson Research Center of IBM Research in 2001. At IBM she spent two years as program manager for analytics and optimization at IBM's China Research Laboratory in Beijing, and eventually became senior manager for data and decision analytics and director of cognitive algorithms.
In 2015, Ray moved from IBM to become vice president of data science at Talkspace, an online and mobile therapy company, before moving again to her present position at Chartbeat.
Recognition
Ray was elected as a Fellow of the American Statistical Association in 2005.
References
Year of birth missing (living people)
Living people
American women statisticians
Baylor University alumni
Columbia Graduate School of Arts and Sciences alumni
New Jersey Institute of Technology faculty
IBM Research computer scientists
Fellows of the American Statistical Association
21st-century American women |
https://en.wikipedia.org/wiki/Phil%20Lambert | Phillip Lambert (1 July 1950 – 25 July 2021) was an Australian television identity.
Biography
He was notable for his long association with the Nine Network's Melbourne station GTV9 where he worked from 1969 to 2019, becoming the station's longest serving employee.
Throughout his 50 years at the station, Lambert worked chiefly as a camera operator and as a floor manager on numerous Channel 9 productions, working with a range of well known personalities including Graham Kennedy, Don Lane and Bert Newton.
However, he is arguably best known for his regular unscripted on-screen appearances during segments on the station's long running national variety program Hey Hey It's Saturday, where he was nicknamed "Lucky Phil".
He announced his retirement from the station in April 2019.
Lambert died at the age of 71 on 25 July 2021.
References
External links
1950 births
2021 deaths
Australian television people |
https://en.wikipedia.org/wiki/Batwheels | Batwheels is an American computer-animated superhero children's television series that premiered on September 17, 2022, on HBO Max. It made its linear premiere on October 17, 2022 on Cartoon Network's preschool block Cartoonito.
Plot
The Bat-Family's vehicles are brought to life by the Batcomputer to form the "Batwheels", a team led by the Batmobile or "Bam", to fight crime in Gotham City.
Characters
The Batwheels
The Batmobile / Bam (voiced by Jacob Bertrand) - The insecure leader of the Batwheels.
Redbird / Red (voiced by Jordan Reed) - Robin's car and the youngest of the Batwheels.
Batgirl cycle / Bibi (voiced by Madigan Kacmar) - Batgirl's small but impulsive motorcycle.
Bat Truck / Buff (voiced by Noah Bentley) - A good-hearted monster truck who serves as the Batwheels' muscle.
The Batwing / Batwing / Wing (voiced by Lilimar) - Batman's sophisticated and confident supersonic jet.
The Batcomputer / BC (voiced by Kimberly D. Brooks) - The team's trainer, supervisor, dispatcher, and mother figure.
M.O.E. (voiced by Mick Wingert) - Short for Mobile Operation Expert, M.O.E. Batman's kindhearted yet sarcastic robot mechanic.
The Bat-Family
Bruce Wayne / Batman (voiced by Ethan Hawke) - A vigilante operating in Gotham City and father figure to the Batwheels. Hawke previously turned down the role for Joel Schumacher's Batman Forever.
Duke Thomas / Robin (voiced by A.J. Hudson) - A mystery-loving member of the Bat-Family who wants to prove himself in the eyes of Batman.
Cassandra Cain / Batgirl (voiced by Leah Lewis) - A daredevil tech-savvy member of the Bat-Family, who serves as a "big sister" figure in the group.
Oliver Queen / Green Arrow (voiced by MacLeod Andrews) - A vigilante archer from Star City and a friend of Batman's. He operates in Star City.
The Legion of Zoom
Badcomputer (voiced by SungWon Cho) - An A.I. computer software inside a scoreboard who wants to replace the Bat Computer as the most powerful computer on Earth.
Crash (voiced by Tom Kenny) - Badcomputer's crash-dummy like robot minion.
Prank (voiced by Griffin Burns) - Joker's funny and pranking van.
Jestah (voiced by Alexandra Novelle) - Harley Quinn's fun-loving ATV.
Ducky (voiced by Ariyan Kassam) - Penguin's mischief-causing duck on a boat with wheels vehicle.
Quizz (voiced by Josey Montana McCoy) - Riddler's quiz-loving helicopter.
Snowy (voiced by Xolo Maridueña) - Mr. Freeze's bad but gentle snow crawler.
The Rogues' Gallery
The Joker (voiced by Mick Wingert) - Batman's archenemy and the self-proclaimed "Clown Prince of Crime".
Harleen Quinzel / Harley Quinn (voiced by Chandni Parekh) - Joker's partner-in-crime and girlfriend.
Oswald Cobblepot / The Penguin (voiced by Jess Harnell) - An elegant penguin-like criminal.
Edward Nigma / The Riddler (voiced by SungWon Cho) - A riddle-obsessed criminal.
Victor Fries / Mr. Freeze (voiced by Regi Davis) - An ice-themed supervillain with a mechanical suit.
Selina Kyle / Catwoman (voiced by Gina Rodrigu |
https://en.wikipedia.org/wiki/42nd%20News%20and%20Documentary%20Emmy%20Awards | The 42nd News and Documentary Emmy Awards were presented by the National Academy of Television Arts and Sciences (NATAS), to honor the best in American news and documentary programming in 2020. The winners were announced on two ceremonies via live-stream at Watch.TheEmmys.TV and other apps associated, the winners for the News categories were announced on September 28, 2021, while the ones for the Documentary categories were revealed on September 29, 2021.
The nominees were announced on July 27, 2021, with CBS's news magazine 60 Minutes and Vice's news program VICE News Tonight leading the nominations with 16 each while PBS was the most nominated network with 52.
Winners and nominees
The nominations were announced on July 27, 2021.
News Programming
Spanish Language Programming
Documentary Programming
Craft
Regional News
Multiple nominations
Notes
References
External links
News & Documentary Emmys website
News and Documentary Emmy Awards
Emmy Awards
News & Documentary Emmy Awards |
https://en.wikipedia.org/wiki/Fang%20Liu%20%28statistician%29 | Fang Liu is a Chinese-American statistician and data scientist whose research topics include differential privacy, statistical learning theory, Bayesian statistics, regularization, missing data, and applications in biostatistics. She is a professor in the Department of Applied and Computational Mathematics and Statistics at the University of Notre Dame.
Education and career
Liu was talented in mathematics as a child, competed in mathematics competitions, and wanted to become a mathematician, but was discouraged from doing so by her parents, who wanted her to become a physician. As a compromise, she studied biology at Peking University, where she earned a bachelor's degree in 1997.
She began her graduate studies at Iowa State University intending to study genetics, but quickly switched to a program in statistics, and earned a master's degree there in 1999, and a Ph.D. from the University of Michigan in 2003. Her dissertation, Bayesian Methods for Statistical Disclosure Control in Microdata, involved both data privacy and Bayesian statistics, and was supervised by Roderick J. A. Little.
After completing her doctorate, she became a researcher at the Merck Research Laboratories. She returned to academia, joining the Notre Dame faculty, in 2011.
Recognition
Liu was named a Fellow of the American Statistical Association in 2021, "for novel contributions to differentially private synthetic data and Bayesian modeling; for outstanding interdisciplinary research in clinical and public health studies; for leadership in education and training; and for service to the profession".
References
External links
Home page
Year of birth missing (living people)
Living people
American statisticians
American women statisticians
Chinese statisticians
Chinese women mathematicians
Chinese mathematicians
Peking University alumni
Iowa State University alumni
University of Michigan alumni
University of Notre Dame faculty
Fellows of the American Statistical Association
21st-century American women |
https://en.wikipedia.org/wiki/Westfalenhallen%20station | Westfalenhallen station () is an underground rapid transit station in the city of Dortmund, in North Rhine-Westphalia, Germany. It is part of the Dortmund Stadtbahn network and serves the Westfalenhallen venues.
Services
, the following services stop at Westfalenhallen:
: service every 10 minutes to Dortmund Hauptbahnhof.
: service every 10 minutes to .
References
External links
Dortmund VRR stations |
https://en.wikipedia.org/wiki/Service%20data%20adaptation%20protocol | Service Data Adaptation Protocol is a protocol specified by 3GPP. The SDAP sublayer is configured by RRC. SDAP maps the QoS flow to the Bearer service.
References
3GPP standards |
https://en.wikipedia.org/wiki/Gecko%27s%20Garage | Gecko's Garage is a British computer-animated children's television series about a friendly gecko car mechanic named Gecko who helps vehicles, robots, and others who need a helping hand. In addition to entertaining its target audience of children aged 2-5, it also aims to help children develop cognitive skills such as colours, shapes, and numbers. Part of YouTube's Toddler Fun Learning channel, the show is presented on YouTube, Peacock, Amazon Prime Video, and other streaming services.
History
In 2012, husband-and-wife team Amalie and Christian Hughes of Wirral in northwest England, near Liverpool, developed The Toddler Fun Learning channel to host the educational videos they created for their own 2-year-old, with the key series being Gecko's Real Vehicles. In February 2019 Moonbug Entertainment purchased the Toddler Fun Learning channel, including Gecko's Garage.
In July 2021, NBCUniversal's streaming platform Peacock aired the first season of six episodes.
Actor Martin Dickinson performs the voice of Gecko. Before that, Gecko's voice was performed by Christian Hughes.
References
External links
Animated preschool education television series
British preschool education television series
NBCUniversal
CBeebies
Animated television series about reptiles and amphibians
Fictional chameleons and geckos
British computer-animated television series
2015 British television series debuts
2010s British animated television series
2010s British children's television series
2020s British animated television series
2020s British children's television series
British children's animated musical television series
YouTube channels launched in 2015 |
https://en.wikipedia.org/wiki/Signal%20transition%20graphs | Signal Transition Graphs (STGs) are typically used in electronic engineering and computer engineering to describe dynamic behaviour of asynchronous circuits, for the purposes of their analysis or synthesis.
Main definitions and applications
Informally, an STG is a graphical description of the behaviour of an asynchronous circuit in the form where information about causal relations between signalling events is represented directly, as opposed to descriptions based on states. In that way, STGs help to formalise the description of a circuit typically represented by timing diagrams, sometimes also called waveforms. The latter are widely used by electronic engineers.
More formally, an STG is a type of an interpreted (or labelled) Petri net whose transitions are labelled with the names of changes in the values of signals (cf. signal transitions). For example, the typical case of the labelling is the case where signals are binary, hence the transition are interpreted as rising and falling edges of the signals in the circuit.
STGs usually give more compact descriptions of the behaviour of asynchronous circuits than state graphs. The complexity of an STG specification of a circuit is typically linear in the number of signals in the circuit while the complexity of a state graph can grow exponentially, due to the fact that asynchronous circuits have high degree of concurrency. In STGs concurrent events are represented via cause-sequence relations (cf. true concurrency) while in state graphs concurrency is represented via interleaving.
STGs were first proposed in 1981, under the name Signal Graphs, by Leonid Rosenblum (in Russian) in. They were studied more formally and applied to the design of asynchronous interfaces by Alex Yakovlev in 1982, in his PhD thesis (in Russian). They were later presented in English in 1985, in two independent sources, one by Rosenblum and Yakovlev in and the other by Tam-Anh Chu in (an earlier version was presented at ICCD'85). Since then, STGs have been studied extensively in theory and practice, which has led to the development of popular software tools for analysis and synthesis of asynchronous control circuits, such as Petrify (chief developer: Jordi Cortadella) and Workcraft (a toolkit from Newcastle University).
Amongst the various examples of using STGs in designing asynchronous circuits, the most well known are those in the domain of asynchronous interfaces, controllers, arbiters and analog-mixed signal circuits, cf., most recently STGs have been extended to model causal behaviour involving causality mediated by capacitive coupling, such as those used in switched capacitor converters (SCCs).
Extensions and Related Models
Besides STGs, based on binary signals, there are also Symbolic STGs, where signals can be multi-valued.
STGs with timing (delays) information annotation were first introduced in, and later in, where ideas of analysis of behaviour of circuits with timing constraints, later called Relative Timin |
https://en.wikipedia.org/wiki/Autonomy%2C%20Agency%20and%20Assurance%20Innovation%20Institute | The Autonomy, Agency and Assurance Innovation Institute (3Ai) is an Australian research institute which hopes to create a new applied science around the management of artificial intelligence, data and technology inclusive of their impact on humanity.
Background
The institute was founded on 4 September 2017 by the Australian National University (ANU) and CSIRO's Data 61 Research Business Unit. Initial plans covered a 5-year period with the goal of establishing a new intellectual framework by 2022. It is envisaged that this would combine theory and praxis within a curriculum which would enable the training of the first generation of certified practitioners with a professional qualification in the emergent applied science. Genevieve Bell was appointed as the first director. It is located in the School of Cybernetics, at the ANU College of Engineering and Computer Science, Canberra, Australia.
The foundation of 3Ai has been cited as one example of how Australian universities endeavour to engage with industry to develop a new field of applied science. The development of a Master's programme to establish a new branch of engineering has attracted support from Microsoft, KPMG and the Macquarie Group.
External links
Official website
References
Research institutes in Australia
Scientific organisations based in Australia
2017 establishments in Australia |
https://en.wikipedia.org/wiki/Fran%C3%A7ois%20Chollet | François Chollet (; born 20 October 1989) is a French software engineer and artificial intelligence researcher currently working at Google. Chollet is the creator of the Keras deep-learning library, released in 2015, and a main contributor to the TensorFlow machine learning framework. His research focuses on computer vision, the application of machine learning to formal reasoning, abstraction, and how to achieve greater generality in artificial intelligence.
Education and career
Chollet graduated with a Master of Engineering from ENSTA Paris a school of the Polytechnic Institute of Paris in 2012 and started working at Google in 2015. His papers have been published at major conferences in the field, including the Conference on Computer Vision and Pattern Recognition (CVPR), the Conference on Neural Information Processing Systems (NeurIPS), the International Conference on Learning Representations (ICLR). He is the author of Xception: Deep Learning with Depthwise Separable Convolutions, which is among the top ten most cited papers in CVPR proceedings.
Books
Chollet is the author of Deep Learning with Python, the co-author with Joseph J. Allaire of Deep Learning With R, and the creator of the Abstraction and Reasoning Corpus (ARC) Challenge.
Awards
On December 1, 2021, Chollet won the Global Swiss AI Award for breakthroughs in AI.
Bibliography
References
French computer scientists
Artificial intelligence researchers
Google employees
Living people
Machine learning researchers
1989 births |
https://en.wikipedia.org/wiki/Cat%20%2B%20Gamer | is a Japanese manga series written and illustrated by Wataru Nadatani. It was serialized in Shogakukan's shōnen manga magazine Shōnen Sunday S from November 2018 to January 2022.
Publication
Cat + Gamer, written and illustrated by Wataru Nadatani, was serialized in Shogakukan's shōnen manga magazine Shōnen Sunday S from November 24, 2018, to January 25, 2022. Shogakukan has collected its chapters into eight individual tankōbon volumes that were released from May 17, 2019 to April 18, 2022.
In July 2021, Dark Horse Comics announced that they had licensed the manga for English release in North America. The translation is done by Zack Davisson and the first volume was released on March 2, 2022.
Volumes
Reception
In 2022, the series was nominated for a Harvey Award in the Best Manga category; it was nominated for the same category in 2023.
References
External links
Cat + Gamer official website at Sunday Web Every
Comedy anime and manga
Comics about cats
Dark Horse Comics titles
Shogakukan manga
Shōnen manga
Slice of life anime and manga |
https://en.wikipedia.org/wiki/Yao%20Wang | Yao Wang is a Chinese-American video engineer whose research topics include networked video, video coding, computer vision, medical imaging, and the use of machine learning techniques to diagnose lymphedema and concussions. She is a professor of electrical and computer engineering and of biomedical engineering in the New York University Tandon School of Engineering, where she is also Associate Dean for Faculty Affairs and holds an affiliated faculty position in the Radiology Department of the New York University Grossman School of Medicine. She is also a member of NYU WIRELESS.
Education and career
Wang has bachelor's and master's degrees in electronic engineering from Tsinghua University, awarded in 1983 and 1985, respectively. She completed her Ph.D. in electrical and computer engineering in 1990 at the University of California, Santa Barbara, and in the same year joined the faculty of the Polytechnic Institute of New York, the predecessor institution to the NYU Tandon School.
Book
Wang is the coauthor, with Jörn Ostermann and Ya-Qin Zhang, of the textbook Video Processing and Communications (Prentice Hall, 2001).
Recognition
Wang was named a Fellow of the IEEE in 2004, "for contributions to video processing and communication".
References
External links
NYU Video Lab
Year of birth missing (living people)
Living people
American electrical engineers
American women engineers
Chinese electrical engineers
Chinese women engineers
Tsinghua University alumni
University of California, Santa Barbara alumni
Polytechnic Institute of New York University faculty
Fellow Members of the IEEE
21st-century American women |
https://en.wikipedia.org/wiki/Execute%20instruction | In a computer instruction set architecture (ISA), an execute instruction is a machine language instruction which treats data as a machine instruction and executes it.
It can be considered a fourth mode of instruction sequencing after ordinary sequential execution, branching, and interrupting. Since it is an instruction that operates on other instructions like the repeat instruction, it has also been classified as a meta-instruction.
Computer models
Many computer families introduced in the 1950s and 1960s include execute instructions: the IBM 709 and IBM 7090 (op code mnemonic: ), the IBM 7030 Stretch (, ), the PDP-1/-4/-7/-9/-15 (), the UNIVAC 1100/2200 (), the CDC 924 (), the PDP-6/-10 (), the IBM System/360 (), the GE-600/Honeywell 6000 (, ), the SDS-9xx (), the SDS 92 (), and the SDS Sigma series ().
Fewer 1970s designs include execute instructions: the Nuclear Data 812 minicomputer (1971) (), the HP 3000 (1972) (), and the Texas Instruments TI-990 (1975) and its microprocessor version, the TMS9900 (1976) (). An execute instruction was proposed for the PDP-11 in 1970, but never implemented for it or its successor, the VAX.
Modern instruction sets do not include execute instructions because they interfere with pipelining, prefetching, and other optimizations.
Semantics
The instruction to be executed, the target instruction, may be in a register or fetched from memory. Some architectures allow the target instruction to itself be an execute instruction; others do not.
The target instruction is executed as if it were in the memory location of the execute instruction. If, for example, it is a subroutine call instruction, execution is transferred to the subroutine, with the return location being the location after the execute instruction. However, some architectures implement variants of the execute instruction which inhibit branches.
The System/360 supports variable-length target instructions. It also supports modifying the target instruction before executing it. The target instruction must start on an even-numbered byte.
The GE-600 series supports execution of two-instruction sequences, which must be doubleword-aligned.
Some architectures support an execute instruction which operates in a different protection and address relocation mode. For example, the ITS PDP-10 paging device supports a privileged-mode 'execute relocated' instruction which allows memory reads, writes, or both to use the user-mode page mappings. Similarly, the KL10 variant of the PDP-10 supports the privileged instruction 'previous context XCT'.
The execute instruction can cause several problems when one execute instruction points to another one and so on:
the processor may be uninterruptable for multiple clock cycles if the execute instruction cannot be interrupted in the middle of execution;
similarly, the processor may go into an infinite loop if the series of execute instructions is circular and uninterruptable;
if the execute instructions are on different s |
https://en.wikipedia.org/wiki/%22Deji%22%20Meets%20Girl | is a Japanese original short anime television series produced by Liden Films. It aired from October to December 2021 on the Super Animeism programming block.
Characters
A first-year high school student in Okinawa. She was originally in the handball club but quit after an injury. During summer vacation she works part-time at the front desk of her father's Hotel Higa.
A young tourist from Tokyo staying at Hotel Higa.
Maise's father and the owner of Hotel Higa.
Maise's grandmother who works as a psychic under the name "Yuta".
Media
Manga
A manga adaptation, also written and illustrated by Akane Malbeni, was serialized in Flex Comix's Comic Polaris website from September 30, 2021 to 2022. The series was collected into a single tankōbon volume, published by Flex Comix on May 13, 2022.
Volume list
Anime
The original story is credited to Naminoue Seinendan and produced by Japanese studio Liden Films, with direction and character design by Ushio Tazawa and series composition and original character design by Akane Malbeni; Kaori Akatsu and Norifumi Okuno designed the props, with music by Hiroshi Nakamura, sound direction by Ryousuke Naya, sound work credited to Studio Mouse, editing by Satomi Yamada, backgrounds supervised by Miu Miyamoto, colour design by Kunio Tsujita, compositing supervised by Mitsuyoshi Yamamoto and CG directed by Yoshimasa Yamazaki. The series aired from October 2 to December 18, 2021, on the Super Animeism block on MBS, TBS and other channels. Aoi Kubo performed the series's theme song "Otogibanashi no Yо̄ na Kiseki".
The series had its international premiere on August 25, 2021, at the 25th Fantasia International Film Festival in Montreal as a closing-day screening.
In North America, GKIDS will screen the series in theaters in 2022.
Episode list
Release
The animated series has been licensed for North America by GKIDS and for the United Kingdom and the Republic of Ireland by Anime Limited. It was released in cinemas in North America as part of event screenings of the unrelated feature film Fortune Favours Lady Nikuko and in the United Kingdom and the Republic of Ireland the same way on August 10, 2022.
Notes
References
External links
Official website
Official Twitter
2021 anime television series debuts
Anime with original screenplays
Animeism
Fantasy anime and manga
Flex Comix manga
Japanese webcomics
Liden Films
Shōjo manga |
https://en.wikipedia.org/wiki/Elad%20Hazan | Elad Hazan is an Israeli-American computer scientist, academic, author and researcher. He is a Professor of Computer Science at Princeton University, and the co-founder and director of Google AI Princeton.
Hazan co-invented adaptive gradient methods and the AdaGrad algorithm. He has published over 150 articles and has several patents awarded. He has worked machine learning and mathematical optimization, and more recently on control theory and reinforcement learning. He has authored a book, entitled Introduction to Online Convex Optimization. Hazan is the co-founder of In8 Inc., which was acquired by Google in 2018.
Education
Hazan studied at Tel Aviv University and received his bachelor's and master's degrees in Computer Science in 2001 and 2002, respectively. He then moved to the United States, earning his Doctoral Degree in Computer Science from Princeton University in 2006 under Sanjeev Arora.
Career
Upon receiving his doctoral degree, Hazan held an appointment as a Research Staff Member in the Theory Group at IBM Almaden Research Center in 2006. Following this appointment, he joined Technion - Israel Institute of Technology as an assistant professor in 2010 and was tenured and promoted to Associate Professor in 2013. In 2015, he joined Princeton University as an Assistant Professor of Computer Science, and later became Professor of Computer Science in 2016. Since 2018, he has been serving as a Director of Google AI Princeton.
Research
Hazan's research primarily focuses on machine learning, mathematical optimization, control theory and reinforcement learning. He is the co-inventor of five US patents.
Machine learning and mathematical optimization
Hazan co-introduced adaptive subgradient methods to dynamically incorporate knowledge of the geometry of the data observed in earlier iterations, and to perform more informative gradient-based learning. The AdaGrad algorithm changed optimization for deep learning and serves as the basis for today's fastest algorithms. In his study, he also made substantial contributions to the theory of online convex optimization, including the Online Newton Step and Online Frank Wolfe algorithm, projection free methods, and adaptive-regret algorithms.
In the area of mathematical optimization, Hazan proposed the first sublinear-time algorithms for linear classification as well as semi-definite programming. He also gave the first linearly converging Frank-Wolfe-type algorithm.
More recently, Hazan and his group proposed a new paradigm for differentiable reinforcement learning called non-stochastic control, which applies online convex optimization to control.
Awards and honors
2002–2006 - Gordon Wu fellowship, Princeton University
2008 - Machine Learning Journal Award best student paper, COLT
2009, 2012 - IBM Pat Goldberg Memorial Best Paper Award
2011–2015 - European Research Council Marie Curie Fellow
2011, 2015 - Google Research Award
2012 - ICML Best Student Paper Runner Up
2013 - European Research Council |
https://en.wikipedia.org/wiki/Aminah%20Zawedde | Aminah Zawedde, is a Ugandan computer scientist. academic and public administrator, who serves as the permanent secretary of the Uganda Ministry of ICT and National Guidance since 15 July 2021. Before that Zawedde was a
lecturer and researcher in the School of Computing and Informatics Technology at Makerere University, the oldest and largest public university in Uganda.
Background and education
She was born in the Buganda Region of Uganda in the 1970s. After attending local primary and secondary schools, she was admitted to Makerere University. She graduated with a Bachelor of Science in Statistics and Economics in 2001. She followed that with a Master of Science degree in Information Systems, also from Makerere University.
She also studied at the University of Cape Town, graduating with a Postgraduate Diploma in Educational Technology, in 2014. Her third degree was a Doctor of Philosophy in Software Engineering, obtained from the Eindhoven University of Technology, in the Netherlands, in 2016.
Career
Zawedde has been a lecturer and a researcher at the School of Computing at Informatics at Makerere for over 15 years. For the first five years, she was an assistant lecturer. Starting January 2011, until July 2021 she was a tenured lecturer, who supervised undergraduate and postgraduate students at the school.
During that period, she worked and volunteered in various academic and non-academic positions, including as a Data Officer at the Electoral Commission of Uganda, as an IT Intern at the Uganda Revenue Authority, as an IT Consultant at the Infectious Diseases Institute and as visiting lecturer at KCA University in Nairobi, Kenya.
On 15 July 2021, president Yoweri Museveni made wide-reaching changes affecting a number of cabinet ministries, including the retirement of seven permanent secretaries. As part of those changes, Zawedde was appointed PS of the ICT ministry, replacing Vincent Waiswa Bagiire who was relocated to the Ministry of Foreign Affairs.
Other considerations
Zawedde has authored or co-written a number of peer-reviewed articles, in the areas of her expertise and has presented some of them at international, regional and national conferences.
She serves as a non-executive director of DFCU Group, the parent company of DFCU Bank and of National Information Technology Authority Uganda (NITA-U).
See also
Geraldine Ssali Busuulwa
List of government ministries of Uganda
References
External links
Dr. Aminah Zawedde: Member NITA Uganda
Breaking: Museveni names new Permanent Secretaries As of 15 July 2021.
Living people
Ganda people
1978 births
Ugandan Muslims
Makerere University alumni
University of Cape Town alumni
Eindhoven University of Technology alumni
Academic staff of Makerere University
People from Central Region, Uganda
21st-century Ugandan women scientists
21st-century Ugandan scientists |
https://en.wikipedia.org/wiki/Merkur%20Spiel-Arena/Messe%20Nord%20station | Merkur Spiel-Arena/Messe Nord station () is a surface-level rapid transit station in the city of Düsseldorf, in North Rhine-Westphalia, Germany. It is part of the Düsseldorf Stadtbahn network and serves the Merkur Spiel-Arena.
Services
the following services stop at Merkur Spiel-Arena/Messe Nord:
: service every 10 minutes to Düsseldorf Hauptbahnhof.
References
External links
Düsseldorf VRR stations |
https://en.wikipedia.org/wiki/2021%20VTV%20Awards | The 2021 VTV Awards (Vietnamese: Ấn tượng VTV 2021 - Hành trình nhiệm màu) is a ceremony honouring the outstanding achievement in television on the Vietnam Television (VTV) network from August 2020 to July 2021. It was planned to take place on September 5, 2021 but delayed due to the impact of COVID-19 quarantine. On December 3, it was announced that the ceremony will take place on January 1, 2022 merging with New Year welcoming show.
This year, audience can only vote in Round 2 (Top 5). For the first time, audience votes are collected from views, heart-dropping and shares on the VTVGo mobile app.
Winners and nominees
(Winners denoted in bold)
Presenters/Awarders
Special performances
References
External links
List of television programmes broadcast by Vietnam Television (VTV)
2021 television awards
VTV Awards
2021 in Vietnamese television
January 2022 events in Vietnam |
https://en.wikipedia.org/wiki/Cycling%20on%20NBC | Cycling on NBC is the de facto name for broadcasts of multiple-stage bicycle races produced by NBC Sports, the sports division of the NBC television network. This includes broadcasts of the Tour de France, Vuelta a España, UCI World Tour Championships, Tour of California, USA Pro Cycling Challenge, and Liège–Bastogne–Liège.
Overview
Coors Classic coverage
In 1985, NBC broadcast the Coors International Bicycle Classic as part of its anthology program Sportsworld. Greg Lewis anchored NBC's coverage alongside Connie Carpenter and Alexi Grewal.
Tour de Trump coverage
From 1989 to 1990, NBC broadcast the Tour de Trump, which was a North American cycling stage race initially sponsored by businessman (and later U.S. President) Donald Trump.
For the very first edition in 1989, Dick Enberg anchored the coverage alongside Gary Gerould and analyst Clif Halsey. Greg Lewis meanwhile, interviewed cyclists after the final stage. NBC would cover at least two weeks worth of action for two hours each on Sunday afternoons while ESPN otherwise, provided the bulk of the coverage.
The following year, NBC announced that it would commit to airing at least six hours worth of the Tour de Trump race. This time, John Tesh anchored NBC's coverage alongside Phil Liggett.
Incidentally, the idea for the race was conceived by John Tesh, who had covered the 1987 Tour de France for CBS and on his return suggested holding a race in the United States to the basketball commentator and entrepreneur Billy Packer. Packer originally planned to call the race the Tour de Jersey. He approached representatives of casinos in Atlantic City for sponsorship, and Donald Trump offered to be the race's primary sponsor and Packer's business partner in the venture. It was Packer who suggested the Tour de Trump name.
Tour de France coverage
In 1999, NBCSN, then known as Outdoor Life Network (or OLN) acquired the U.S. broadcast rights to the Tour de France for US$3 million. Coverage of the Tour on OLN brought substantially greater viewership to the then fledgling channel, due in part to the then-growing popularity of American rider Lance Armstrong. In 2004, where Armstrong would aim for a record-breaking sixth straight Tour de France title, OLN would devote over 344 hours in July to coverage of the Tour, along with documentaries and other original programming surrounding the event – which was promoted through a US$20 million advertising campaign.
Overall, while its coverage of the Tour de France helped OLN expand its carriage to over 60 million homes, rumors surrounding Armstrong's possible retirement from racing led to concerns over OLN's emphasis on him (to the point that some critics referred to OLN as standing for "Only Lance Network"), with critics questioning whether the network could sustain itself without the viewership that Lance Armstrong's presence had brought to its coverage.
On June 15, 2004, the Discovery Channel signed a deal to become sponsor of the U.S. Postal Service Pro Cyc |
https://en.wikipedia.org/wiki/James%20Renegar | James Milton Renegar Jr. (born May 14, 1955) is an American mathematician, specializing in optimization algorithms for linear programming and nonlinear programming.
Biography
In 1983 he received his Ph.D. in mathematics from the University of California, Berkeley. His Ph.D. thesis On the Computational Complexity of Simplicial Algorithms in Approximation Zeros of Complex Polynomials was supervised by Stephen Smale. After postdoc positions, Renegar joined in 1987 the faculty of the School of Operations Research and Information Engineering at Cornell University and is now a full professor there.
Renegar is a leading expert on optimization algorithms. In recent years, the focus of his research is devising new algorithms for linear programming. He has done research on 'interior-point methods for convex optimization (for which he wrote a well-known introductory monograph), quantifier elimination methods for the first-order theory of the reals, development of the notion of "condition number" in the context of general conic optimization problems, algorithms for hyperbolic programming, and most recently, the discovery of a simple paradigm for solving general convex conic optimization problems by first-order methods.' His 2001 monograph A Mathematical View of Interior-point Methods in Convex Optimization is intended to present a general theory of interior-point methods, suitable for a wide audience of graduate students in mathematics and engineering.
In 1990 Renegar was an invited speaker at the International Congress of Mathematicians in Kyoto. In 1995 he was a founding member of the nonprofit organization Foundations of Computational Mathematics. He was awarded the 2018 Khachiyan Prize.
James M. Renegar Jr. married Catharine M. Barnaby and is the father of two children, Alice and Nicholas James. James M. Renegar Sr. (1928–2005) practiced law in Oklahoma City for many years.
Selected publications
Articles
1988(over 740 citations)
(over 760 citations)
Books
References
External links
1955 births
Living people
20th-century American mathematicians
21st-century American mathematicians
American computer scientists
Numerical analysts
Theoretical computer scientists
University of California, Berkeley alumni
Cornell University College of Engineering faculty |
https://en.wikipedia.org/wiki/Bossiaea%20inundata | Bossiaea inundata is a species of flowering plant in the family Fabaceae and is endemic to the Murchison River Gorge in Western Australia. It is a spreading, openly-branched shrub with oblong, elliptic or egg-shaped leaves with the narrower end towards the base, and deep yellow and red flowers.
Description
Bossiaea inundata is a spreading, openly-branched shrub that typically grows up to a height of up to high and has ridged stems and short side shoots ending in a sharp point. The leaves are oblong, elliptic or egg-shaped with the narrower end towards the base, long and wide on a petiole long with tapering stipules long at the base. The flowers are usually arranged singly or in small groups, often on short, spiny side branches, each flower on a pedicel long. There is often only one bracts long at the base of the pedicel. The five sepals are joined at the base forming a tube long, the two upper lobes long and the three lower lobes long, with an oblong to egg-shaped bracteole long on the pedicel. The standard petal is deep yellow with a reddish base and long, the wings long, and the keel is pinkish-red with a greenish base and long. Flowering occurs from May to September.
Taxonomy and naming
Bossiaea inundata was first formally described in 2006 by James Henderson Ross in the journal Muelleria from specimens collected in the bed of the Murchison River upstream from the Ross Graham lookout in 1998. The specific epithet (inundata) refers to the habitat of this species that results in the plants sometimes being inundated.
Distribution and habitat
This bossiaea grows in the bed and on the banks of the Murchison River in the Geraldton Sandplains biogeographic region in the west of Western Australia.
Conservation status
Bossiaea inundata is classified as "Priority Two" by the Western Australian Government Department of Parks and Wildlife meaning that it is poorly known and from only one or a few locations.
References
inundata
Flora of Western Australia
Plants described in 2006 |
https://en.wikipedia.org/wiki/System%2010 | System 10 or System Ten may refer to:
Computing
DECsystem-10, the mainframe line by Digital Equipment Corporation
Singer System 10, the business minicomputer
IBM System z10, the mainframe line by IBM
Namco System 10, the arcade system board
Tandy 10 Business Computer System, the business minicomputer
Operating systems
Android 10, the Google operating system
BlackBerry 10, the BlackBerry operating system
Linux distribution versions:
Debian 10, the Debian Project distribution (2019)
Fedora 10, the RedHat-based distribution (2008)
Gentoo 10, the special release of Gentoo distribution (2009)
Mandriva 10, the Mandriva distribution (2004)
Mint 10, the Ubuntu-based distribution (2010)
openSUSE 10, the openSUSE Project distribution (2005)
Ubuntu 10.4 and Ubuntu 10.10, the Canonical distribution (2010)
Mac OS X, the Apple operating system now known as macOS
TOPS-10, the Digital Equipment Corporation operating system
FTOS, the Force10 operating system
FreeBSD 10, the FreeBSD Project operating system
Version 10 Unix, the last version of the original Unix of Bell Labs
Windows 10, the Microsoft operating system
Sports
10-point must system, the boxing strategy
Perfect 10 (gymnastics), the scoring system
Other
Base-ten number system, the decimal numeral system
ICD-10 Procedure Coding System, the system of medical classification
Pentax System 10, the Pentax single-lens camera
STS-10 (Space Transportation System-10), a cancelled Space Shuttle mission
See also
System X (disambiguation)
OSX (disambiguation)
OS 10 |
https://en.wikipedia.org/wiki/Perceiver | Perceiver is a transformer adapted to be able to process non-textual data, such as images, sounds and video, and spatial data. Transformers underlie other notable systems such as BERT and GPT-3, which preceded Perceiver. It adopts an asymmetric attention mechanism to distill inputs into a latent bottleneck, allowing it to learn from large amounts of heterogeneous data. Perceiver matches or outperforms specialized models on classification tasks.
Perceiver was introduced in June 2021 by DeepMind. It was followed by Perceiver IO in August 2021.
Design
Perceiver is designed without modality-specific elements. For example, it does not have elements specialized to handle images, or text, or audio. Further it can handle multiple correlated input streams of heterogeneous types. It uses a small set of latent units that forms an attention bottleneck through which the inputs must pass. One benefit is to eliminate the quadratic scaling problem found in early transformers. Earlier work used custom feature extractors for each modality.
It associates position and modality-specific features with every input element (e.g. every pixel, or audio sample). These features can be learned or constructed using high-fidelity Fourier features.
Perceiver uses cross-attention to produce linear complexity layers and to detach network depth from input size. This decoupling allows deeper architectures.
Components
A cross-attention module maps a (larger) byte array (e.g., a pixel array) and a latent array (smaller) to another latent array, reducing dimensionality. A transformer tower maps one latent array to another latent array, which is used to query the input again. The two components alternate. Both components use query-key-value (QKV) attention. QKV attention applies query, key, and value networks, which are typically multilayer perceptrons – to each element of an input array, producing three arrays that preserve the index dimensionality (or sequence length) of their inputs.
Perceiver IO
Perceiver IO can flexibly query the model's latent space to produce outputs of arbitrary size and semantics. It achieves results on tasks with structured output spaces, such as natural language and visual understanding, StarCraft II, and multi-tasking. Perceiver IO matches a Transformer-based BERT baseline on the GLUE language benchmark without the need for input tokenization and achieves state-of-the-art performance on Sintel optical flow estimation.
Outputs are produced by attending to the latent array using a specific output query associated with that particular output. For example to predict optical flow on one pixel a query would attend using the pixel’s xy coordinates plus an optical flow task embedding to produce a single flow vector. It is a variation on the encoder/decoder architecture used in other designs.
Performance
Perceiver's performance is comparable to ResNet-50 and ViT on ImageNet without 2D convolutions. It attends to 50,000 pixels. It is competitive in all mo |
https://en.wikipedia.org/wiki/Datauli%2C%20Raebareli | Datauli is a village in Harchandpur block of Rae Bareli district, Uttar Pradesh, India. As of 2011, its population is 1,980, in 357 households. It has one primary school and no healthcare facilities.
The 1961 census recorded Datauli as comprising 4 hamlets, with a total population of 822 people (442 male and 380 female), in 157 households and 140 physical houses. The area of the village was given as 1,049 acres.
The 1981 census recorded Datauli as having a population of 1,167 people, in 200 households, and having an area of 425.74 hectares. The main staple foods were given as wheat and rice.
References
Villages in Raebareli district |
https://en.wikipedia.org/wiki/Data%20Security%20Law%20of%20the%20People%27s%20Republic%20of%20China | The Data Security Law of the People's Republic of China (; referred to as the Data Security Law or DSL) governs the creation, use, storage, transfer, and exploitation of data within China. The law is seen to be primarily targeted at technology companies which have grown increasingly powerful in China over the years. The law is part of a series of interlocking but related national security legislation including the National Security Law of the People's Republic of China, Cybersecurity Law and National Intelligence Law, passed during Xi Jinping's administration as part of efforts to strengthen national security .
Provisions
The law controversially requires data localisation of data collected by foreign and domestic entities on Chinese citizens. The law prohibits the export of data by technology companies without first the completion of a "cybersecurity review", the process of which is vague and still being developed. In addition, foreign judicial authorities are prohibited from requesting data on Chinese citizens without first seeking permission from Chinese authorities.
Reactions
Carolyn Bigg of law firms DLA Piper Hong Kong stated that the law represents: “another important piece in the overall data protection regulatory jigsaw in China”, making it: “complex" and "increasingly onerous" for international businesses to navigate through. Chinese technology company stocks fell in reaction to the passing of the law while tech companies such as Meituan, Alibaba and Ant Financial were all placed under regulatory scrutiny prior to its passing. The law is seen to have wide-ranging implications and is seen as another step in the increasing lawfare between China and the United States in areas of trade, intellectual property and national security since the beginning of the US-China trade war which began in 2016.
See also
Personal Information Protection Law of the People's Republic of China
Cybersecurity Law of the People's Republic of China
References
Law of the People's Republic of China
Laws of China
2021 in China
2021 in law
Data protection |
https://en.wikipedia.org/wiki/Series%205 | Series 5 may refer to:
Aston Martin V8 Series 5, an automobile model
BMW 5 Series, a line of automobiles
GeForce 5 Series, a line of video cards
Psion Series 5, a line of handheld computers
South African Class 6E1, Series 5, a series of electric locomotives
See also
500 series (disambiguation)
System 5 |
https://en.wikipedia.org/wiki/Networker%20Baire | Networker Baire () is a Bangladeshi romantic comedy web film written and directed by Mizanur Rahman Aryan. The story is inspired by true events. Screenplay has been done by Jobaed Ahsan along with Mizanur Rahman Aryan. The film stars Sariful Razz, Yash Rohan, Nazia Haque Orsha, Tasnuva Tisha, Khairul Basar, Junayed Bukdadi, Tasnia Farin, Nazifa Tushi.
Networker Baire is the first film of the famous television direction Mizanur Rahman Aryan. Initially, he wanted to make it for theatres. But due to this ongoing COVID-19 pandemic, releasing films in theatres has become difficult. In this circumstance, Chorki came forward and financed this project.
Redoan Rony serves as the producer of the film under the banner on Frame Per Second in association with Mr. Aryan Films. Networker Baire has been released on Chorki on 19 August 2021.
Networker Baire received critical acclaim, with praise for its story, cinematography, acting, and music.
Plot
Four Friends; Munna, Abir, Sifat, and Ratul. This is the story of their bond, friendship, and the ups and down of life. They plan a tour to get out of this chaotic city, have a blast, explore, and go beyond the network. This is the first tour of them together, they plan to continue this tradition forever, but an unexpected event happens that changes their life. Those four friends were engaging in fun, banters, and madness in the heart of Cox's Bazar when something unexpected happens to them.
Cast
Production
On 8 April 2021, Chorki released a mashup video revealing their launching date and their upcoming most awaited projects. In that video, there were some scenes of Networker Baire but that time name wasn't announced.
On 30 April 2021, they finally announced the film Networker Baire and introduced the cast and crew of the film in a press release.
Filming began in November 2020 in Dhaka. Indoor shooting completed here. And the principal outdoor photography has been taken place on beaches of Cox's Bazar and St. Martin's Island in December 2020 to January 2021 for a span of 17 days. There were some underwater shoots in the sea which required expertise.
Release
The film has been released digitally on Chorki on 19 August 2021.
Reception
Networker Baire has been praised by both critics and the audience. Suborna Mustafa wrote, "Mizanur Rahman Aryan's storytelling style is totally different. Networker Baire is just another signature of his talent". Reviewing for The Business Standard, Siffat Bin Ayub gave the film a "7.2 out of 10" score and said, "The film delivered on exactly what we wanted – some beautiful scenery, good acting, and a simple yet wonderful story about friendship."
Music
The first song of the film was released on Chorki's YouTube channel on Friendship Day 2021.
References
External links
Networker Baire on Chorki
2021 films
Chorki original films
Bengali-language Bangladeshi films
2020s Bengali-language films
Films shot in Cox's Bazar
Films set in Cox's Bazar
Films scored by Sajid Sarkar |
https://en.wikipedia.org/wiki/Samsung%20Galaxy%20Tab%20A7 | The Samsung Galaxy Tab A7 is a mid-range Android tablet computer designed by Samsung Electronics. There are two variants: Samsung Galaxy Tab A7 (2020) and Samsung Galaxy Tab A7 Lite.
History
The Galaxy Tab A7 was announced on and released shortly after on . The Samsung Galaxy Tab A7 Lite is a smaller, less powerful, more compact, and affordable version of the Galaxy Tab A7. It was announced on , and released on .
References
A7
Tablet computers introduced in 2020 |
https://en.wikipedia.org/wiki/Network%20of%20Communists | The Network of Communists (, RdC) is a communist political movement network, founded in Bologna on 13 September 1998.
History
The RdC was born initially from the union of the Communists Forum with the association Communist Initiative of the Emilia-Romagna, the association In Movement for a Communist Project of Milano, the Communist Collective Rosa Luxemburg of Aversa and the Communist Circle of Trivero street of Torino.
In the May 2000 the RdC is cofounder of the Communist Coordination, together with the Movement for the Confederation of Communist, The Other Lombardia-Head Up, the Communist Coordination of Napoli and the Cultural Centre The Worker of Massa Carrara and La Spezia, but the experience fell apart during 2001 and the RdC regained full autonomy.
From June 2009 the RdC joined the Federation of the Left, leaving it in the following December, judging the FdS not autonomous enough from the Democratic Party.
In the March 2013 Sergio Cararo is one of the signatories of the Declaration for an anti-capitalist and libertarian movement. On its basis was formed the Ross@ association, and many members of RdC joined it.
In June 2016 Mauro Casadio signed, as member of the RdC secretariat, the Appeal for an alternative to the diktats of the European Union. From it was born the social platform Eurostop, of which the RdC is still member.
From 2017, together with Eurostop, the RdC joined Power to the People!.
Organization
The activity of the RdC is focused on three areas:
Research on class composition, Marxist theory and international issue through inquiries, essays and books (the RdC has a specific magazine about Southern America, Nuestra America, and it has a publishing house, I quaderni di Contropiano).
Direct activity of militants in grassroots trade unionism.
Direct participation to different structures of international solidarity, anti-militarist, cultural and of information. It also participates to a series of local experiences, linked to the independent left.
The RdC is linked to two students organization: Cambiare rotta - Organizzazione giovanile comunista (for the university students) and OSA - Opposizione Studentesca d'Alternativa (for the middle students).
Press
The official press of the RdC is Contropiano, communist newspaper founded in 1993.
National assemblies
I assembly - Roma, 23 March 2002
II assembly - Roma, 10–11 March 2007
III assembly - Roma, 2–3 April 2011
Election results
References
Communist parties in Italy
1998 establishments in Italy
Eurosceptic parties in Italy |
https://en.wikipedia.org/wiki/Repeat%20instruction | In computer instruction set architectures (ISA), a repeat instruction is a machine language instruction which repeatedly executes another instruction a fixed number of times, or until some condition is met.
Since it is an instruction that operates on other instructions like the execute instruction, it has been classified as a meta-instruction.
Computer models
The Univac 1103 (1953) includes a repeat instruction (op code mnemonic: ) which executes the following instruction a fixed number of times, possibly incrementing one or both of the address fields of that instruction. This compensates for the architecture's lack of index registers.
The GE-600/Honeywell 6000 series (1964) supports a single-instruction repeat (), a double-instruction repeat (), and a linked-list repeat ().
The x86 ISA, starting with the 8086, includes a series of special-purpose repeat instructions () which are called "repeat string operation prefixes" and may only be applied to a small number of string instructions (). These instructions repeat an operation and decrement a counter until it is zero, or may also stop when a certain condition is met.
The Texas Instruments TMS320 digital signal processor (1983) includes an instruction for repeating a single-cycle instruction or two single-cycle instruction in parallel () and an instruction for repeating a block of instructions (). These use special block-repeat counter registers ().
Semantics
The instruction or instruction pair to be executed follows the repeat instruction. Fields in the instruction determine the loop termination condition. In the case of the TMS320, a block of up to 64Kbytes can be repeated.
Notes
Central processing unit
Instruction processing
Instruction set architectures |
https://en.wikipedia.org/wiki/G%C3%A9rard%20Th%C3%A9ry | Gérard Théry (25 February 1933 – 18 July 2021) was a French engineer and computer scientist. He was from 1974 to 1981 and President of the Cité des Sciences et de l'Industrie from 1996 to 1998. He was a founding member of the program and Minitel. He once stated that the internet was "ill-suited to the provision of commercial services", which was proven to be incorrect. He was also responsible for the French government's program against the Year 2000 problem from 1998 to 2000.
Biography
Théry graduated from the École Polytechnique in 1952 and the Télécom Paris in 1957. In 1955, he began working for the Ministry of Postes, Télégraphes et Téléphones, serving as an aide to Minister Jacques Marette from 1966 to 1967. He started his career working on submarine cables, participating in numerous cable-laying campaigns by AT&T between Perpignan and Oran. He also helped lay the first electric submarine cable in the English Channel. He joined the Centre national d'études des télécommunications in 1962 and helped Bell Labs develop the first echo suppressors for a communications satellite.
On 16 October 1974, Théry was appointed Directeur générale des Télécommunications, becoming responsible for the French telephone development program, Delta LP. He also helped France replace its system of crossbar switches with the telephone exchange. In 1976, he and his team launched one of the first packet switching data networks, Transpac, which enjoyed great success upon its opening on 14 December 1978. That year, Télétel and Minitel were launched, both of which remained until 2012, when they were finally closed by . In 1979, the Telecom 1 satellite was launched. Théry was ousted from his position on 17 August 1981 due to the fact that he was considered to be too close to President Valéry Giscard d'Estaing.
In 1984, Théry joined the Société Générale, where he was appointed a member of the executive committee. He was chosen by TF1 and TDF Group to be an amicable expert on relieving contention between the two companies. In 1989, he was appointed to the executive committee of Renault, where he also became head of the IT department. In 1994, he was commissioned by the French government for the famous report "Autoroutes de l'Information", in which he made his infamous quote against the future of the internet. The prediction error is often mocked in social networks and taken as a dictionary-definition example of prediction errors and their causes. He served as President of the Cité des Sciences et de l'Industrie, serving until 1998.
In 1998, Théry created the film Gérard Théry et Associés, specializing in telecommunications and information technology consulting. At the same time he also collaborated with Dassault Group on the development of an electric car. On 20 February 1998, the French government appointed him to lead the mission against the Year 2000 problem.
Gérard Théry died in Paris on 18 July 2021 at the age of 88.
Distinctions
Officer of the Legion of Honour ( |
https://en.wikipedia.org/wiki/Hinsa%20Siburian | Lieutenant General (Ret.) Hinsa Siburian (born 28 October 1959) is an Indonesian government official and former military officer. He served as Chief of National Cyber and Crypto Agency (Indonesian: Badan Siber dan Sandi Negara, BSSN) beginning in 21 May 2019, replacing Major General (Ret.) Dr. Djoko Setiadi.
Early life
Siburian was born at Tarutung, 28 October 1959. He graduated from Indonesian Military Academy in 1986, and won both Adhi Makayasa and Tri Sakti Wiratama awards. Adhi Makayasa was named best graduate of Indonesian Military Academies system (each branch has their own Adhi Makayasa winner), and Tri Sakti Wiratama awarded him with the highest honor, for excelling in mental, physical, and intellectual aspects.
He was educated in the Indonesian Army Command and General Staff College (graduated in 2000), Indonesian Armed Forces Staff and Command Colleges (graduated in 2006), and National Resilience Institute of The Republic of Indonesia (2011).
Career
Siburian was assigned to Kopassus after graduation. He took various assignments during his time in military, mostly in Kopassus.
Kopassus (1986–1994)
Commander of Counter Terrorism Training Center, Sat-81/Counter Terror, Kopassus (1994)
Task Force Commander of Cendrawasih Task Force, Group 3 Sandhi Yudha Kopassus (2002)
Operation Assistant of Army Strategic Reserve Command (Kakostrad) (2009)
Regimental Commander 043/Garuda Hitam, Kodam II/Sriwijaya (2010)
Middle Commissioned Officer (Indonesian: Perwira Menengah, Pamen) HQ Detachment, TNI AD HQ (2011)
Training Director Indonesian Army Doctrine, Education and Training Development Command (2012)
Regimental Commander 173/Praja Vira Braja, Kodam XVII/Cendrawasih (2013)
Kodam Chief of Staff (Indonesian: Kepala Staf Kodam, Kasdam) Kodam XVII/Cenderawasih (2013)
Operation Assistant of Army Chief of Staff (2014)
Commander of Infantry Weaponry Center, Indonesian Army Doctrine, Education and Training Development Command (2014)
Chief of Kodam XVII/Cenderawasih (2015)
Vice Chief of Staff Indonesian Army (2017)
During his assignment in Papua as Kasdam of Kodam XVII/Cenderawasih, he was instrumental in reconciling Dani tribe and Moni tribe, two indigenous tribe in Papua, which almost started the Timika tribal war in 2014.
Post Military Career
In December 2018, he was appointed commissary of Freeport Indonesia.
On 21 May 2019, he was appointed by Joko Widodo as Chief of BSSN, where he remained through 2021.
Chief of BSSN
On 21 May 2019, he was appointed Chief of BSSN via Presidential Decree No 56/P/2019. He was appointed as the second chief of BSSN, and the first to enjoy ministerial-level facilities and rights. He swore to fight hoaxes and to strengthen Indonesia cyber intelligence capabilities.
Personal life
Siburian married Lucyanna Endang boru Sianturi. He was honored by both Siburian and Sianturi Batak clans on 5 August 2017 in a traditional ceremony.
References
1959 births
Living peopl |
https://en.wikipedia.org/wiki/Jelena%20Mi%C5%A1i%C4%87 | Jelena Mišić is a Yugoslav-Canadian computer scientist specializing in wireless networking, mobile computing, cloud computing, blockchain-based data recording, and cryptocurrency. She is a professor of computer science at Toronto Metropolitan University. She received her PhD in computer engineering from University of Belgrade in 1986.
Before joining Ryerson University (now Toronto Metropolitan University), she was with University of Manitoba and Hong Kong University of Science and Technology. She has authored or coauthored four books and more than 300 papers in journals and conference proceedings in the area of computer networks and security. In 2018, she was elected Fellow of the Institute of Electrical and Electronics Engineers "for contributions to modeling and performance evaluation in wireless communications."
References
External links
Home page
Fellow Members of the IEEE
Serbian women engineers
Academic staff of Toronto Metropolitan University
University of Belgrade alumni
Academic staff of the University of Manitoba
Academic staff of the Hong Kong University of Science and Technology
Living people
Year of birth missing (living people)
Place of birth missing (living people) |
https://en.wikipedia.org/wiki/Plasma%20Bigscreen | Plasma Bigscreen is a software project from KDE which contains an interface optimized for Smart TVs and other computers such as the Raspberry Pi which can be connected to large displays.
Software
The desktop environment is based on KDE Plasma 5. Voice control is provided through integration with Mycroft AI. Plasma Bigscreen supports HDMI-CEC.
Availability
Plasma Bigscreen is currently available as a KDE Neon-based image, or installable on postmarketOS.
See also
Plasma Mobile
Mycroft (software)
References
External links
Free and open-source software
KDE Plasma |
https://en.wikipedia.org/wiki/We%20Didn%27t%20Start%20the%20Fire%20%28podcast%29 | We Didn't Start the Fire is a modern history podcast that ran from January 2021 to June 2023. It is hosted by Katie Puckrik and Tom Fordyce and produced by Crowd Network.
Premise
The podcasts takes topics from the pop song "We Didn't Start the Fire", released by Billy Joel in 1989. The song lists, via a series of fast-paced lyrics, brief references to 118 significant political, cultural, scientific, and sporting events between 1949, the year of Joel's birth, and 1989, in a mainly chronological order. The podcast looks at these in turn with expert guests, with topics including the politics of Harry S. Truman, space exploration, rock'n'roll and also including American, Korean and Cuba-Soviet Union relations at the height of The Cold War.
Reception
Miranda Sawyer in The Guardian reviewed a "funny, informative discussion.. genuinely interesting and fun" and described it as her "new favourite show". Sawyer later noted that "Puckrik and Fordyce are funny, but also excellent interviewers and this show, which incorporates war, philosophy, celebrity and political machinations, is far better than you would ever imagine." Sawyer later put the podcast in her top 10 of the year for 2021.
Billy Joel himself heard the show and appears as a special guest on an episode first broadcast on October 25, 2021.
Episodes
References
History podcasts
Audio podcasts
2021 podcast debuts |
https://en.wikipedia.org/wiki/Sep%20%28given%20name%29 | Sep is a masculine given name and nickname, often a short form of Septimus. It may refer to:
Sepandar Kamvar (born 1977), American computer scientist, artist, author and entrepreneur
Sep Lambert (1876–1959), Irish cricketer
Sep Ledger (1889–1917), South African rugby union player
Sep Ruf (1908–1982), German architect and designer
Sep E. Scott (1879–1965), British painter, illustrator and comics artist
Sep Smith (1912–2006), English footballer
Sep Vanmarcke (born 1988), Belgian road racing cyclist
Sep Visser (born 1990), Dutch international rugby union player
Masculine given names
Hypocorisms
Nicknames |
https://en.wikipedia.org/wiki/Jionghua%20Jin | Jionghua (Judy) Jin is a Chinese-American industrial engineer whose research involves quality engineering, advanced manufacturing, and data fusion. She is a professor of industrial and operations engineering at the University of Michigan, where she directs the manufacturing program in the division of integrative systems and design.
Education and career
Jin has bachelor's and master's degrees from Southeast University in China, earned in 1984 and 1987 respectively, and worked as a lecturer at Southeast University from 1987 to 1994. She completed a Ph.D. in industrial and operations engineering at the University of Michigan in 1999.
She became an assistant professor of systems and industrial engineering at the University of Arizona in 2000, and returned to the University of Michigan as an associate professor in 2005. She became a full professor in 2011.
Recognition
Jin is a recipient of the 2002 Presidential Early Career Award for Scientists and Engineers. Jin was named a Fellow of the American Society of Mechanical Engineers in 2012, a Fellow of the Institute of Industrial and Systems Engineers in 2015, and a Fellow of the Institute for Operations Research and the Management Sciences in 2020.
References
External links
Home page
Year of birth missing (living people)
Living people
American industrial engineers
American women engineers
Chinese industrial engineers
Chinese women engineers
Chinese engineers
Southeast University alumni
Academic staff of Southeast University
University of Michigan alumni
University of Michigan faculty
Fellows of the American Society of Mechanical Engineers
Fellows of the Institute for Operations Research and the Management Sciences
21st-century American women
Recipients of the Presidential Early Career Award for Scientists and Engineers |
https://en.wikipedia.org/wiki/A.%20Murat%20Eren | A. Murat Eren (Meren) is a computer scientist known for his work on microbial ecology and developing novel, open-source, computational tools for analysis of large data sets.
Early life and education
Eren grew up in the Barhal Valley in Turkey and studied cryptography as an undergraduate at Canakkale Onsekiz Mart Universitesi where he earned a B.S. in 2002. He moved to the United States and started his Ph.D. at the University of New Orleans. While working at the Children's Hospital of New Orleans, Eren was introduced to microbiology by Michael Ferris. In 2011 Eren completed his Ph.D.; his dissertation was titled Assessing microbial diversity through nucleotide variation.
Career and research
Eren's Ph.D. research involved developing oligotyping, a computational method to examine the diversity of microorganisms within high throughput sequencing datasets. Following his Ph.D., Eren joined the Marine Biological Laboratory as a postdoctoral scientist, during which he applied oligotyping to microbes that live in the human genitourinary tract, oral cavity, and sewage. In 2015 he joined the University of Chicago as an assistant professor, where he started using metagenomics to investigate the ecology and evolution of microbes found in the human gut, human mouth, and surface ocean. In 2022, Eren was appointed Professor of Ecosystem Data Science at the University of Oldenburg and the Alfred Wegener Institute for Polar and Marine Research.
Eren is an advocate of open-source software and leads the community development of anvi'o, a platform to allow analysis and visualization of large datasets.
Selected publications
Awards and honors
Alfred P. Sloan Foundation Research Fellowship in Ocean Sciences (2020)
American Society for Microbiology Award for Early Career Environmental Research (2020)
References
External links
University of Chicago faculty
University of New Orleans alumni
Çanakkale Onsekiz Mart University alumni
Living people
Turkish computer scientists
Ecologists
Free software programmers
1980 births |
https://en.wikipedia.org/wiki/TimescaleDB | TimescaleDB is an open-source time series database developed by Timescale Inc. It is written in C and extends PostgreSQL. TimescaleDB is a relational database and supports standard SQL queries. Additional SQL functions and table structures provide support for time series data oriented towards storage, performance, and analysis facilities for data-at-scale.
One of the key features of TimescaleDB is its performance, which has been compared to InfluxDB. Time-based data partitioning provides for improved query execution and performance when used for time oriented applications. More granular partition definition is achieved through the use of user defined attributes.
TimescaleDB is offered as open source software under the Apache 2.0 license. Additional features are offered in a community edition as source available software under the Timescale License Agreement (TLS).
History
Timescale was founded by Ajay Kulkarni (CEO) and Michael J. Freedman (CTO) in response to their need for a database solution to support internet of things workloads.
References
Free and open-source software
2018 software
Time series software |
https://en.wikipedia.org/wiki/Mike%20Verdu | Michael Verdu (born December 28, 1964) is an American manager and producer and author of computer games.
Life
Verdu was born on December 28, 1964. His father worked for a trade union, his mother was a dance instructor. Michael visited the Rensselaer Polytechnic Institute in Troy, 600 km away from his native Washington. He did not finish his studies because Advanced Technology, an IT service provider for the US Department of Defense, offered him a lucrative job as a programmer. Aged 20, he left Advanced Technology in 1985 to found the software company Paragon Systems that produced software for the Department of Defense. Paragon's programs were used to maintain submarines of the Ohio and Los Angeles-class submarines. The company also rented out programming capacities, for example to Bob Bates' video game start-up Challenge Inc. which developed text adventures for industry leader Infocom. In September 1987 Verdu sold Paragon Systems (which had 25 employees by the time) to IT service provider American Systems Corporation where he worked as the business unit director for software development for the following three years.
When defense budgets dwindled down with the end of the Cold War, Verdu turned his passion for computer games into a profession and founded the video game development studio Legend Entertainment together with Bob Bates who in the meantime was affected by the shutdown of Infocom. Legend Entertainment produced text adventures and acted as its own publisher. Verdu was the CEO of the company and remained on this position until the company was sold to GT Interactive in 1998. After the acquisition Legend Entertainment was integrated into GT Interactive's production line as a studio and remained so when Infogrames bought GT in 1999. Verdu and Bates acted as the studio heads, with the studio focussing on the production of first person shooters.
From July 2002 until May 2009 Verdu worked for EA Los Angeles, first as producer, then from 2005 on as division director for real-time strategy games, and from 2007 on as vice president/general manager. During his seven years at EA Los Angeles he was responsible for titles such as Command & Conquer 3: Tiberium Wars or The Lord of the Rings: The Battle for Middle-earth II. From June 2009 until August 2012 Verdu worked as Chief Creative Officer for American browser game publisher Zynga. At this time Zynga had a market value of about nine billion dollars. In September 2012 he left Zynga to found the independent studio TapZen. The starting capital was provided by his former employer, later on Chinese tech corporation Tencent acquired a financial interest. In January 2015 TapZen was bought up by browser and mobile games producer Kabam. The Canadians hired Verdu as Chief Creative Officer for the mother company.
When Kabam was bought up by South Korean video game company Netmarble Verdu went back to Electronic Arts, this time as senior vice president of EA Mobile. From May 2019 on he was vice president |
https://en.wikipedia.org/wiki/List%20of%20Legal%20Wives%20episodes | Legal Wives is a Philippine television drama series broadcast by GMA Network. It aired on the network's Telebabad line up and worldwide via GMA Pinoy TV from July 26, 2021 to November 12, 2021.
Series overview
Episodes
References
Lists of Philippine drama television series episodes |
https://en.wikipedia.org/wiki/Network%20Culture | Network Culture. Politics for the Information Age is a 2004 book by Italian scholar Tiziana Terranova, focusing on the effects of information technology on society.
References
2004 non-fiction books
Books about the Internet |
https://en.wikipedia.org/wiki/Network%20Propaganda | Network Propaganda: Manipulation, Disinformation and Radicalization in American Politics is a 2018 book by American scholars Robert Faris, Hal Roberts and Yochai Benkler, focusing on the negative effects of information technology on the American society and its impact on media polarization. Covering the period from the start of the 2016 election cycle to the one year anniversary of Donald Trump's inauguration, it tracks a rapid conversion of the right-wing media ecosystem from mainstream journalism with a fact-checking dynamic, to an insular self-referential model rewarding ideological consonance over factual accuracy.
References
2018 non-fiction books
Books about the Internet
Books about politics of the United States
Oxford University Press books |
https://en.wikipedia.org/wiki/Mathematics%20of%20apportionment | Mathematics of apportionment describes mathematical principles and algorithms for fair allocation of identical items among parties with different entitlements. Such principles are used to apportion seats in parliaments among federal states or political parties. See apportionment (politics) for the more concrete principles and issues related to apportionment, and apportionment by country for practical methods used around the world.
Mathematically, an apportionment method is just a method of rounding fractions to integers. As simple as it may sound, each and every method for rounding suffers from one or more paradoxes. The mathematical theory of apportionment aims to decide what paradoxes can be avoided, or in other words, what properties can be expected from an apportionment method.
The mathematical theory of apportionment was studied as early as 1907 by the mathematician Agner Krarup Erlang. It was later developed to a great detail by the mathematician Michel Balinsky and the economist Peyton Young. Besides its application to political parties, it is also applicable to fair item allocation when agents have different entitlements. It is also relevant in manpower planning - where jobs should be allocated in proportion to characteristics of the labor pool, to statistics - where the reported rounded numbers of percentages should sum up to 100%, and to bankruptcy problems.
Definitions
Input
The inputs to an apportionment method are:
A positive integer representing the total number of items to allocate. It is also called the house size, since in many cases, the items to allocate are seats in a house of representatives.
A positive integer representing the number of agents to which items should be allocated. For example, these can be federal states or political parties.
A vector of numbers representing entitlements - represents the entitlement of agent , that is, the amount of items to which is entitled (out of the total of ). These entitlements are often normalized such that . Alternatively, they can be normalized such that their sum is ; in this case the entitlements are called quotas and termed denoted by , where and . Alternatively, one is given a vector of populations ; here, the entitlement of agent is .
Output
The output is a vector of integers with , called an apportionment of , where is the number of items allocated to agent i.
For each agent , the real number is called the quota of , and denotes the exact number of items that should be given to . In general, a "fair" apportionment is one in which each allocation is as close as possible to the quota .
An apportionment method may return a set of apportionment vectors (in other words: it is a multivalued function). This is required, since in some cases there is no fair way to distinguish between two possible solutions. For example, if (or any other odd number) and , then (50,51) and (51,50) are both equally reasonable solutions, and there is no mathematical way to choose o |
https://en.wikipedia.org/wiki/Tell%20Me%20Everything%20%28TV%20series%29 | Tell Me Everything is a British teen drama television series, created and co-written by Mark O'Sullivan. It premiered on 8 December 2022 on ITVX, as part of the inaugural slate of programming on the new streaming service, and was broadcast linearly on ITV2 from 6 June 2023.
The series was announced on 5 August 2021 when filming had commenced in Welwyn Garden City. The series is ITV2's first original drama in over ten years and has been compared to E4 teen drama Skins (2007–2013). Tell Me Everything initially centres on Jonny (Eden H Davies), whose mental health problems come into greater focus following a family tragedy, but also stars Spike Fearn, Lauryn Ajufo, Callina Liang, Tessa Lucille and Carla Woodcock as part of a greater ensemble; the production team stated that during the casting process, they focused on casting young and rising actors.
Filming for a second series was conducted over summer 2023, with confirmation of its commission that September.
Premise
Tell Me Everything centres around 16-year-old Jonny (Eden H Davies), whose ongoing battles with his mental health exacerbate after a tragic event, with an attraction and relationship with a girl called Mei (Callina Liang) helping him to hide it from his best friends Louis (Spike Fearn) and Neve (Lauryn Ajufo), who are also undergoing their own personal difficulties as they enter college, which are explored with new students Regan (Tessa Lucille) and Zia (Carla Woodcock).
ITV said Tell Me Everything explores "the stresses of mental health for today’s teens created by the omnipresence of technology and social media, whilst they are still searching for their own identity, exploring sexuality, and experimenting with relationships, drink, drugs and sex".
Cast
Main
Eden H Davies as Jonny Murphy, a 16-year-old who appears confident and carefree on the surface but is hiding a battle with depression.
Spike Fearn as Louis Green, a 17-year-old long-term friend of Jonny and Neve, with underdeveloped social skills and aloof relationship with his mother and stepfather.
Lauryn Ajufo as Neve (Nifemi), a long-term friend of Louis and Jonny, who hides an attraction to Jonny and her envy at her sister's academic prowess.
Callina Liang as Mei, a mysterious Chinese-Canadian girl whose family moves to Welwyn Garden City in late summer, and deploys manipulative tendencies in order to attract Jonny and delude his friends and her family.
Tessa Lucille as Regan Cullen, a student at the local college who is a lesbian and hiding her role as a carer for her grandmother.
Carla Woodcock as Zia, a student at the local college who is also a social media influencer.
Recurring and notable
Aidan McArdle as John, Jonny's father and landlord of his pub, The Angel; he was the only person to have been aware of Jonny's mental health problems.
Clare Calbraith as Ann, Jonny and Andrew's mother, who struggles in the aftermath of her husband's death to balance both working as a nurse and at the pub.
Mark Quartley as |
https://en.wikipedia.org/wiki/Afghanistan%20%2711 | Afghanistan '11 is a turn-based strategy computer wargame developed in 2017 by Every Single Soldier, and published by Slitherine Software. Set during the War in Afghanistan, the player controls an American forward operating base who is tasked with capturing a series of villages from the Taliban, while winning the hearts and minds of the local population, and then transferring control of the area to the Afghan National Army.
Gameplay
In Afghanistan '11, the player controls the US military, who capture an area owned by the Taliban. The game can be played either as part of an 18-level campaign, or a single skirmish. Games last 60 turns, and on the 50th turn, the US military will withdraw from the area, leaving it in control of the Afghan National Army (ANA), who the US will have been training until this point, and now must defend it until the 60th turn. The player wins the game if they retain control of the area and have a Hearts & Minds (H&M) score over 50 when all turns have ended.
The H&M score can be increased by disarming IEDs, providing humanitarian aid, building infrastructure and waterworks, and eliminating the Taliban. It is decreased when civilians are killed, or when the Taliban raid villages and destroy US infrastructure. As the H&M score increases, the local population will become more willing to provide the player with intelligence about the Taliban. In order to deploy new units, the player uses Political Points, representative of domestic support for the war, which are gained when the Taliban are defeated in combat, but decreased when US units are killed. Destroying poppy fields, used by the Taliban to farm opium, also increases Political Points and weakens the Taliban, but at the cost of H&M.
The game also features random events, such as an ANA unit deserting, or an airstrike accidentally hitting a hospital, leading to airstrikes temporarily becoming more expensive.
Development
A spiritual successor to Vietnam '65, the game was designed by former South African soldier Johan Nagel, who had experience dealing with counterinsurgency during his military career.
On September 6 2018, the DLC pack Afghanistan 11: Royal Marines was released, focusing on the British military unit of the same name, adding ten new missions to the game and new vehicles. Additionally, it adds a new gameplay mechanic in the form of civilian vehicles, some of which will contain car bombs.
In 2018, Afghanistan '11 was removed from the iOS App Store as it depicted "a specific government or other real entity as the enemies." The removal was criticised for not making sense, as many other historical video games, such as Twilight Struggle and Civilization VI were allowed to remain on the App Store despite also featuring real combatants as the enemies. Slitherine responded by stating that "Afghanistan '11 is probably the only wargame ever produced where killing the enemy is not the main focus of the game."
Reception
GameWatcher gave the game a score of 7.5/10, |
https://en.wikipedia.org/wiki/Visual%20Basic | Visual Basic is a name for a family of programming languages from Microsoft. It may refer to:
Visual Basic, the current version of Visual Basic launched in 2002 which runs on .NET
Visual Basic (classic), the original Visual Basic supported from 1991 to 2008
Embedded Visual Basic, the classic version geared toward embedded applications
Visual Basic for Applications, an implementation of Visual Basic 6 built into programs such as Microsoft Office and used for writing macros
VBScript, an Active Scripting language |
https://en.wikipedia.org/wiki/Land%20of%20the%20Free%20%28Cyberpunk%29 | Land of the Free is a 1988 role-playing game adventure published by R. Talsorian Games for Cyberpunk.
Plot summary
Land of the Free is an adventure in which a team of edgerunners go across the country from New York, to the deadly Night City, pursued by enemies who would kill them for a mysterious secret.
Reviews
Dragon #211
Valkyrie #1 (Sept., 1994)
References
Cyberpunk (role-playing game)
Role-playing game supplements introduced in 1988
Science fiction role-playing game adventures |
https://en.wikipedia.org/wiki/List%20of%20Computer%20Chronicles%20episodes | Computer Chronicles is an American half-hour television series, which was broadcast from 1983 to 2002 on Public Broadcasting Service (PBS) public television. Presented by Gary Kildall, Stewart Cheifet, and George Morrow, the series documented various issues from the rise of the personal computer from its infancy to the global market at the turn of the 21st century.
Computer Chronicles was created in 1983 by Stewart Cheifet (later the show's co-host), who was then the station manager of the College of San Mateo's KCSM-TV. The series was initially broadcast as a local weekly series, co-produced by WITF-TV in Harrisburg, Pennsylvania. It became a national series on PBS from 1983 to 2002, with Cheifet co-hosting most of the later seasons. Kildall served as co-host from 1983 to 1990, providing insights and commentary on products, as well as discussions on the future of the ever-expanding personal computer sphere.
A total of 488 episodes of Computer Chronicles were produced from 1983 to 2002. New episodes broadcast on Sundays with a duration of 30 minutes, four episodes a month, 48 episodes per year. All episodes were digitized and provided to the Internet Archive for free streaming and download.
Episodes
Overview
Season 1 (1984)
Season 2 (1985)
Season 3 (1985-86)
Season 4 (1986–87)
Season 5 (1987–88)
Season 6 (1988–89)
Season 7 (1989–90)
Season 8 (1990–91)
Season 9 (1991–92)
Season 10 (1992–93)
Season 11 (1993–94)
Season 12 (1994–95)
Season 13 (1995–96)
Season 14 (1995–97)
Season 15 (1997–98)
Season 16 (1998–99)
Season 17 (1999–2000)
Season 18 (2000–01)
Season 19 (2001–02)
References
External links
Lists of American non-fiction television series episodes |
https://en.wikipedia.org/wiki/Series%2080 | Series 80 may refer to:
Transport
Oldsmobile Series 80, automobile series
Cadillac Series 80, automobile series
Computing
Series 80 (software platform), a platform for mobile phones that uses Symbian OS
HP series 80, line of computers
Other
Colt Mk IV Series 80, the pistol line |
https://en.wikipedia.org/wiki/Series%2070 | Series 70 may refer to:
Transport
Oldsmobile Series 70, automobile series
Cadillac Series 70, automobile series
Buick Series 70, automobile series
Computing
UNIVAC Series 70, line of computers |
https://en.wikipedia.org/wiki/The%20Ice%20Age%20Adventures%20of%20Buck%20Wild | The Ice Age Adventures of Buck Wild is a 2022 computer-animated adventure comedy film directed by John C. Donkin, in his feature directorial debut, with a screenplay by Jim Hecht, Ray DeLaurentis, and William Schifrin. It is a spin-off film of the Ice Age franchise, and serves as the sixth overall installment in the franchise. The film stars the voices of Simon Pegg (the only previous cast member to return), Vincent Tong, Aaron Harris, Utkarsh Ambudkar, and Justina Machado also starring in the film. It follows the two opossum brothers Crash and Eddie and their adventure to becoming independent possums alongside the titular character Buck Wild.
Originally planned to be a television series, The Ice Age Adventures of Buck Wild was redeveloped into a feature-length film. Produced by 20th Century Animation and released under the Walt Disney Pictures label, it was released on January 28, 2022, as a Disney+ original film. The film received generally negative reviews from critics who felt that it had a lack of primary focus on the titular character, and criticized the recasting of voice actors, animation quality, the absence of Scrat, and lack of involvement from Blue Sky Studios.
Plot
In an attempt to practice one of their extreme stunts, Crash and Eddie accidentally cause an avalanche and destroy the gang's summer habitat. Manny, Sid, Diego, and Ellie get mad at them, declaring they would not survive on their own. Wanting to prove them wrong, Crash and Eddie secretly leave their temporary camp while the others are asleep. Finding them gone the next morning, Ellie insists that they go search for them. Meanwhile, Crash and Eddie stumble upon the entrance to the Lost World, a land full of dinosaurs, and run into their old friend Buck, who saves them from raptors and tells them that a Protoceratops named Orson, who was bullied when he was young for having a massive brain, has escaped from exile and has come to conquer the Lost World. Buck tries to get Crash and Eddie back to their home, but finds out that Orson has covered the entrance with a boulder.
Buck and the possums go to Buck's shelter, where Buck explains how he used to be part of an old team that established a watering hole as a place for animals to peacefully co-exist. He goes on to say that Orson did not accept an offer to join his team because he believed in a world where the strong dominate the weak, with him being the leader. Buck further explains that they defeated Orson and banished him to an island, where he learned that he can control two raptors with fire.
The two raptors find Buck's hideout, but Zee, a zorilla who used to be part of Buck's former team, saves Buck and the possums by using a gas to knock out the raptors. Orson then gets an army of raptors and attacks the watering hole, with Buck and Zee telling the animals to evacuate. Buck and Zee, their relationship strained after their team's breakup, go with the possums to get help. They arrive at the Lost Lagoon and summon their |
https://en.wikipedia.org/wiki/The%20Black%20Network | The Black Network is an American short musical film released in 1936 that was directed by Roy Mack and released through Vitaphone. It is extant.
Synopsis
Nina Mae McKinney plays the star performer of a radio show who must contend with the sponsor's wife, who wants to take over her spot. The wife, Mezzanine, is more than willing to use her husband's shoe polish company to blackmail the show to do as she wishes. Ultimately Mezzanine's singing is so terrible that listeners complain and she is taken off the show, the status quo restored.
Cast
Nina Mae McKinney
The Nicholas Brothers
The Washboard Serenaders
Babe Wallace
Amanda Randolph as Mezzanine Johnson
Production
The Black Network went into production at the Brooklyn Vitaphone studios during December 1935, starting on December 7. Nina Mae McKinney and The Nicholas Brothers were announced as the film's stars; they had previously worked together in the 1932 Roy Mack film Pie Pie Blackbird. The film, which was created as part of the "Broadway Brevity" series, adapted a script written by A. Dorian Otvos and special songs were credited to Cliff Hess. Photography was by Ray Foster and the film was edited by Bert Frank.
Release
The Black Network was released to theaters in 1936, where it was shown as a supplemental film alongside movies such as The Lion's Den and Adventure in Manhattan.
Reception
The Film Daily praised The Black Network, citing the actors' performances as a highlight while noting that the story was not original.
See also
Vitaphone Varieties
References
External links
The Black Network at the TCM Movie Database
1936 musical comedy films
1936 short films
American short films
African-American films |
https://en.wikipedia.org/wiki/Time%20in%20Rwanda | Time in Rwanda is given by a single time zone, officially denoted as Central Africa Time (CAT; UTC+02:00). Rwanda has never observed daylight saving time.
IANA time zone database
In the IANA time zone database, Rwanda is given one zone in the file zone.tab – Africa/Kigali. "RW" refers to the country's ISO 3166-1 alpha-2 country code. Data for Rwanda directly from zone.tab of the IANA time zone database; columns marked with * are the columns from zone.tab itself:
See also
List of time zones by country
List of UTC time offsets
References
External links
Current time in Rwanda at Time.is
Time in Rwanda at TimeAndDate.com
Time in Rwanda |
https://en.wikipedia.org/wiki/Chet%20Moritz | Chet T. Moritz is an American neural engineer, neuroscientist, physiologist, and academic researcher. He is a Professor of Electrical and Computer Engineering, and holds joint appointments in the School of Medicine departments of Rehabilitation Medicine, and Physiology & Biophysics at the University of Washington.
Moritz's research is focused on neurotechnology including stimulation to restore function after brain and spinal cord injury. His work also includes brain-computer interfaces to control muscle and spinal stimulation. His discoveries have been featured in Nature, MSNBC national news, Wired, Popular Mechanics and local TV news and community outreach videos. He has also been quoted in the New York Times, Newsweek, Scientific American, Forbes, and Science News, and in a news story by Nature.
Education
Moritz graduated with a bachelor's degree in Zoology from the University of Washington in 1998. He then enrolled at the University of California, Berkeley, and earned his Doctoral Degree in Integrative Biology in 2003. From 2003 till 2004, he served as a Postdoctoral Fellow of Integrative Physiology at the University of Colorado, and subsequently rejoined the University of Washington as a Senior Fellow.
Career
Following his Postdoctoral fellowship, Moritz joined the faculty at the University of Washington as a Research Assistant Professor in the Department of Physiology & Biophysics in 2009, and was promoted to Assistant Professor of Rehabilitation Medicine in 2010. Along with this appointment, he held secondary appointments as assistant professor in the Department of Physiology and Biophysics. He was promoted to Associate Professor in 2014, and later joined the Department of Electrical & Computer Engineering in 2018. Since 2010, he has been a member of the Graduate Faculty, and a mentor for the Neuroscience Graduate Program.
Research
Moritz has worked in the area of neurotechnology, neuromodulation, brain-computer interfaces, and home rehabilitation physical therapy.
Brain computer interfaces
Moritz conducted a study in 2008 demonstrating that a brain-computer interface can be used to control stimulation of paralyzed muscles and restore movement. This has spawned several successful human trials of this concept in people with spinal cord injury. With Alik Widge, Moritz also demonstrated that cognitive areas of the pre-frontal cortex could be used to limbic stimulation paving the way for psychiatric neuroprostheses and an allowed patent. With David Bjanes, Moritz demonstrated a new way to provide sensory feedback directly to the brain.
Neurotechnology
Moritz's team demonstrated that stimulation of the spinal cord could lead to lasting improvements in hand and arm function that persisted beyond stimulation. This demonstration of ‘engineered neuroplasticity’ paved the way for human trials of spinal cord stimulation. He and Fatma Inanici's recent studies regarding transcutaneous spinal cord stimulation indicate that non-invasive transcutaneo |
https://en.wikipedia.org/wiki/Camille%20Bohannon | Camille Bohannon is a broadcaster who spent four decades in radio, including working as an anchor/reporter for the U.S. national news networks of NBC, Mutual, United Press International and AP Broadcast. After retiring in 2008, she continued to work part-time as a voice-over and narrator announcer. She has also served as a member of the Broadcast Committee of the U.S. National Press Club.
Early life
Born Mary Camille Skora, Bohannon was the only child of Lillian Marie and George W. Skora. As the daughter of a State Department foreign service employee, she lived in eight countries and learned to speak four languages. She graduated cum laude in 1968 from Highlands University in Las Vegas, New Mexico, where she was named "Woman of the Year". In 2008 the university recognized her as a "distinguished alumna".
Radio career
Bohannon first became involved in broadcasting by chance. At Highlands she studied language and political science, with the general idea of following her father into foreign service work. However, she was asked to provide commentary about the university's homecoming parade by the local cable TV company's CATV-Channel 2, which evolved into a daily news program that was also carried by local radio station KFUN, which later hired her as a disc jockey.
After moving to the Washington, D. C. area, in 1970 she began working at a series of regional radio stations, beginning with the overnight program at WHFS, a suburban Maryland outlet. After that station changed to fulltime rock programming, she moved to weekend shifts at WETA and WWDC. In 1976 she and then-husband Jim Bohannon began hosting radio station WTOP's morning program. However, the station owner did not want the show to be labeled as a "husband and wife team", so Camille had to adopt the pseudonym of "Laura Walters". The next year the two moved to middays at WRC, with Camille now allowed to use her own name.
In 1980 the pair left the Washington area to work mornings at station WCFL in Chicago. At the time of the move Camille was quoted as saying: "People ask how we can be together so much, but my answer is that we're making up for the first five years when I was a DJ at night and Jim did news during the day and we never saw each other." However, the couple eventually divorced.
Camille Bohannon later moved back to the Washington, D.C. area, where she generally continued to use her married name, while sometimes broadcasting using the pseudonym "Ann Taylor". During the rest of her career she primarily worked in a series of national radio network news positions. In late 1983, she joined the United Press International Radio Network as an anchor. In 1987 she became a part-time anchor at Westwood One, and in 1990 became fulltime anchor of NBC Radio Networks overnight hourly newscasts. In 1993 she joined Associated Press Radio as an anchor/reporter. While at AP, she wrote and recorded the daily "Today in History" series.
After retiring in 2008, Bohannon continued to work on indiv |
https://en.wikipedia.org/wiki/Zuo%20Hui | Zuo Hui (January 1971 – May 20, 2021) was a Chinese entrepreneur, real estate tycoon and founder of KE Holdings.
Early life and education
In 1992, Zuo earned a degree in computer science from Beijing University of Chemical Technology.
In 2008, he earned a Master of Business Administration from Peking University.
Career
After graduating, Zuo worked in a series of sales jobs in insurance and other industries.
In 2001, he founded Beijing Lianjia, a Chinese real-estate brokerage company.
In 2010, Zuo started Yiju Taihe, which offered property-related financial services.
In 2018, Zuo founded Beike, an online brokerage platform. In the same year, Zuo created KE Holdings, an umbrella company into which he put Lianjia, Yiju Taihe and Beike.
In 2020, KE Holdings raised $2.12 billion from its IPO on the New York Stock Exchange, valuing the company at just under $40 billion.
Net worth
In April 2021, Forbes estimated Zuo's net worth to be $15.5 billion.
Death
Zuo died on May 20, 2021, at 50 years old as a result of an unspecified illness. Beike named CEO Peng Yongdong as the new chairman following his death.
References
1971 births
2021 deaths
Chinese businesspeople
Beijing University of Chemical Technology alumni
Peking University alumni |
https://en.wikipedia.org/wiki/Consumer%20Data%20Right | The Consumer Data Right is the name of a legislative, regulatory, and standards framework for consumer data portability in Australia. This framework has been created and introduced by the Australian Government, which is implementing the framework on a sector-by-sector basis.
Background
In May 2017, the Productivity Commission released a report 'Data Availability and Use' that recommended, among other things, a new 'Comprehensive Right' for consumers. This proposed new right would allow consumers to access and correct data about themselves held by product or service providers. It would also allow a consumer to have a machine-readable copy of their consumer data provided either to them or directly to a nominated third party, such as a new service provider.
In November 2017, the Australian Government announced plans to legislate a national 'Consumer Data Right', which would allow customers open access to their banking, energy, phone and internet transactions data.
Legislation
In 2019, the Australian Parliament passed the 'Treasury Laws Amendment (Consumer Data Right) Bill 2019' to create the Consumer Data Right (CDR); the bill inserted a new part (Part IVD - Consumer Data Right) into the Competition and Consumer Act 2010, and amended the Australian Information Commissioner Act 2010 and Privacy Act 1988.
The CDR legislation
provides individuals and businesses (consumers) with a right to efficiently and conveniently access specified data in relation to them held by businesses (data holders).
authorises secure access to this data by trusted and accredited third parties (accredited data recipients).
requires businesses (data holders) to provide public access to information on specified products they have on offer.
The CDR legislation establishes a framework to enable the CDR to be applied to various sectors of the economy over time.
Designation
The CDR legislation gives the Minister (responsible for the CDR) powers to designate a sector for which the CDR will apply. The Minister designates a sector through a legislative instrument. In the instrument, the Minister designates a sector by specifying:
classes of information (designated data)
businesses (data holders) who hold one or more of those classes of information
The Minister, in the instrument, may also designate a ‘gateway’, or multiple ‘gateways’ to facilitate the transfer of data between a data holder and accredited data recipient or the consumer; a gateway typically would be an Australian Government entity, or a body within the effective control of the Australian Government or an Australian state or territory government.
The table below summarizes designations made so far:
The designation instrument itself does not impose data sharing obligations. The requirement to disclose particular data emanates from the CDR rules, which provide the framework for how the CDR operates in a particular sector.
CDR rules
The CDR rules are a legislative instrument made (by the Minister) u |
https://en.wikipedia.org/wiki/Toshiba%20Libretto%20W100 | The Toshiba Libretto W100 is a dual-touchscreen computer from the Toshiba Libretto series.
History
The W100 was released for the 25th anniversary of Toshiba in the laptop industry. It was released in July 2010.
Specifications
Windows 7
Two capacitive touchscreens
Intel Pentium U5400
Reception
Engadget noted that the software was unstable in an early model. Techradar noted that the model is "on the chunky size". Popular Mechanics noted the clever design. ZDnet noted the high price tag.
Further developments
Later in 2010, Acer also developed a laptop with two touchscreens.
References
External links
User manual of the Toshiba Libretto W100
Libretto W100
Tablet computers introduced in 2010 |
https://en.wikipedia.org/wiki/List%20of%20programs%20broadcast%20by%20Smile%20%28TV%20network%29 | Although primarily a Christian-based network, Smile has acquired some secular programming from outside producers and the public domain, such as Lassie and The Big Garage, as well as acquiring the U.S. rights to Canadian series such as Mickey's Farm. It also airs family-oriented movies with religious/inspirational themes on Friday afternoons and Saturday evenings.
Current programming
All programs listed are designated as E/I by Smile, completely fulfilling the Federal Communications Commission's educational programming requirements.
Original programming
Programming from PBS Kids
Acquired programming
Former programming
Original programming
Programming from PBS Kids
Acquired programming
Notes
References
External links
https://smileofachildtv.org/schedule/
Smile |
https://en.wikipedia.org/wiki/Alan%20Selman | Alan Louis Selman (April 2, 1941 – January 22, 2021) was a mathematician and theoretical computer scientist known for his research on structural complexity theory, the study of computational complexity in terms of the relation between complexity classes rather than individual algorithmic problems.
Education and career
Selman was a graduate of the City College of New York. He earned a master's degree at the University of California, Berkeley before completing his Ph.D. in 1970 at Pennsylvania State University. His dissertation, Arithmetical Reducibilities and Sets of Formulas Valid in Finite Structures, was supervised by Paul Axt, a student of Stephen Cole Kleene.
He became a postdoctoral researcher at Carnegie Mellon University, and an assistant professor of mathematics at Florida State University, before moving to the computer science department of Iowa State University, eventually becoming a full professor there. In the late 1980s he moved to Northeastern University, becoming acting dean there, and in 1990 he moved again to the University at Buffalo as chair of computer science. He retired in 2014, and died on January 22, 2021.
He was the first chair of the annual Computational Complexity Conference, and served as editor-in-chief of the journal Theory of Computing Systems for 18 years, beginning in 2001.
Selected publications
Selman's research publications included well-cited works on the classification of different types of reductions according to their computational power, the formulation of promise problems, the complexity class UP of problems solvable by unambiguous Turing machines, and their applications to the computational complexity of cryptography:
As well as being the editor of several edited volumes, Selman was the coauthor of the textbook Computability and Complexity Theory (with Steve Homer, Springer, 2001; 2nd ed., 2011).
Recognition
Selman was a Fulbright Scholar and Humboldt Fellow. He was named an ACM Fellow in 1998, as "an influential contributor to computational complexity theory and a dedicated professional within the academic computer science community". In 2002, ACM SIGACT (the Special Interest Group on Algorithms and Computation Theory of the Association for Computing Machinery) gave him their Distinguished Service Prize, noting his work in helping to found the Computational Complexity Conference and in helping to fund theoretical computer science research through his work drafting policy reports for the National Science Foundation.
The journal Theory of Computing Systems is organizing a commemorative issue celebrating his memory.
References
External links
1941 births
2021 deaths
20th-century American mathematicians
21st-century American mathematicians
American computer scientists
Theoretical computer scientists
City College of New York alumni
University of California, Berkeley alumni
Pennsylvania State University alumni
Florida State University faculty
Iowa State University faculty
Fellows of the Association fo |
https://en.wikipedia.org/wiki/Diane%20J.%20Cook | Diane Joyce Cook is an American computer scientist whose research interests include artificial intelligence, data mining, machine learning, home automation, and smart environments. She is Regents Professor and Huie-Rogers Chair Professor of Electrical Engineering and Computer Science at Washington State University.
Her research has included methods for testing the intelligence of artificially intelligent systems, using sensors in home automation to detect mental issues in older residents, developing robotic home care assistants, adapting to the habits of smart home owners, and more generally application of ubiquitous computing and ambient intelligence in home automation.
Education and career
Cook studied mathematics and computer science at Wheaton College (Illinois), graduating in 1985. She went to the University of Illinois Urbana-Champaign for graduate study, earning a master's degree in 1987 on the automation of music notation under the joint supervision of computer scientist William Kubiz and experimental musician Sever Tipei, and completing a Ph.D. in 1990 on topics related to planning in artificial intelligence, supervised by Robert Stepp.
She became an assistant professor at the University of South Florida and a faculty fellow at the NASA Ames Research Center, but quickly moved to the University of Texas at Arlington, becoming professor there in 2001 and University Distinguished Scholar Professor in 2004. In 2006, she moved to Washington State University as Regents Professor and Huie-Rogers Chair.
Books
Cook is the coauthor of:
Smart Environments: Technology, Protocols, and Applications (with Sajal K. Das, Wiley, 2005)
Activity Learning: Discovering, Recognizing, and Predicting Human Behavior from Sensor Data (with Narayanan C. Krishnan, Wiley, 2015)
With Lawrence B. Holder, she is the co-editor of Mining Graph Data (Wiley, 2007).
Recognition
Cook was named a Fellow of the IEEE in 2008, "for contributions to machine learning algorithm design and application". In 2016 she was named a Fellow of the National Academy of Inventors.
References
External links
Home page
Year of birth missing (living people)
Living people
American computer scientists
American women computer scientists
Wheaton College (Illinois) alumni
University of South Florida faculty
University of Texas at Arlington faculty
Washington State University faculty
Fellow Members of the IEEE
20th-century American women educators
20th-century American educators
21st-century American women educators
21st-century American educators
Grainger College of Engineering alumni |
https://en.wikipedia.org/wiki/Angela%20Ken | Angela Ken Tavares Rojas (born May 16, 2002), better known as Angela Ken, is a Filipino singer-songwriter, dancer, occasional actress and influencer. She gained acclaim on social networking service TikTok. After releasing her single "Ako Naman Muna", she signed with Star Magic, a talent agency under ABS-CBN Corporation. Angela is also a member of the Squad Plus. In 2022, Angela made her acting debut in the iWantTFC musical series titled Lyric and Beat as Verlyn.
Career
2021
In 2021, Angela debuted with the release of her first single "Ako Naman Muna". An English version of the said song was released on July 23, 2021.
She also interpreted "Sila Pa Rin" for the soundtrack of Marry Me, Marry You.
In December 2021, Angela would be a part of the soundtrack for Saying Goodbye, where she interpreted the single "If We Fall in Love".
2022
Angela would later release her next single titled "It's Okay Not To Be Okay" on January 14, 2022. She later made her acting debut in the musical series Lyric and Beat, portraying Verlyn in the said series.
Around some time in August 2022, Angela was one of the artists who were part of the Beyond The Stars tour as part of Star Magic's 30th anniversary. The artists performed in a US Tour at the Kings Theatre in Brooklyn, New York, The Warfield in San Francisco, and in the Saban Theatre, Beverly Hills in Los Angeles. Prior to the tour, the artists (except SAB) first performed at the Newport Performing Arts Theater in Newport World Resorts.
Discography
Filmography
Television/Digital
References
2002 births
Living people
People from Imus
Star Magic
Star Music artists
Actresses from Cavite
Singers from Cavite |
https://en.wikipedia.org/wiki/Canadian%20Anti-Hate%20Network | The Canadian Anti-Hate Network (CAHN) is a Canadian nonprofit organization that monitors hate groups, far-right groups, and hate crimes in Canada. It was formed in 2018 in Toronto, Ontario and previously received funding from the Government of Canada. CAHN provides information to journalists and the media, researchers, law enforcement, policy makers, and community organizations. The organization is modelled after and supported by the American Southern Poverty Law Center (SPLC).
History
CAHN was formed in 2018 in Toronto, Ontario by more than fifteen journalists, community leaders, academics, and legal experts. In its first public statement in 2018, CAHN called for criminal charges to be brought against Montreal IT consultant and Neo-Nazi Gabriel Sohier Chaput, who goes by the pseudonym Charles Zeiger.
In 2019, white nationalist Kevin Goudreau was served with a peace bond obliging his to stay away from CAHN staff, after he encouraged violence towards staff.
On November 1, 2020, Chris Vanderweide, known as 'Helmet Guy' for participating in violence at Hamilton Pride 2019, was arrested by the York Regional Police (YRP) and charged with uttering threats against CAHN chair Bernie Farber and CAHN executive director Evan Balgord in a private Facebook group. Before contacting the YRP, CAHN had contacted the Hamilton Police Service (HPS) about the threats, but HPS declined to investigate the threats due to their wording. Afterwards, Farber called for an internal investigation into the HPS and for Hamilton Mayor Fred Eisenberger to look into why the threats were not further investigated. In response, Constable Jerome Stewart said that "The matter is before the court system in York Region and as such Hamilton Police will not provide any further comments at this time".
In the aftermath of the 2021 United States Capitol Attack, a team from CAHN was attempting to identify three people seen at the riot, one of whom was holding a Canadian flag.
On April 15, 2021, CAHN filed a complaint with the Law Society of Ontario against criminal lawyer Colin A. Browne for reciting the oath of the far-right Proud Boys organization in a video posted on Telegram.
In a September 9, 2021 CTV News interview, CAHN deputy director Elizabeth Simons described people "at the heart of" COVID-19 protests in Canada, including "anti-lockdown, anti-mask and anti-vaccine protests", as part of a "far-right", "anti-democratic", and "pro-insurrectionist" movement who hold extreme views on a number of issues.
In late June 2022, the CAHN published an online booklet with the goal of educating teachers, students, and parents on how to identify and confront forms of hate in school and online.
In October 2022, the Government of Saskatchewan said that it would discourage teachers from using an anti-hate toolkit created by the CAHN, adding that "The toolkit does not meet criteria such as being high quality, free from bias as reasonably possible, and having appropriate and significant Saskatch |
https://en.wikipedia.org/wiki/Garuda%20Linux | Garuda Linux is a x86-64 general-purpose Linux distribution, based on Arch Linux operating system. It is available in a wide range of popular Linux desktop environments, including modified versions of the KDE Plasma 5 desktop environment. The term Garuda, originating from Hinduism, is defined as a divine eagle-like sun bird and the king of birds.
It features a rolling release update model using Pacman as its package manager.
Garuda Linux uses a rolling release model, meaning that there are no "major releases" of completely new versions of the system; a regular system update is all that is needed to obtain the latest software from the Arch Linux repository. Installation images are released every month by the Arch team which are simply up-to-date snapshots of the main system comonents, similiar to the Arch Linux operating system.
History
Garuda Linux was released on the 26th of March, 2020. Developed and maintained by developers around the world. It was founded by Shrinivas Vishnu Kumbhar, a university student from India and SGS from Germany.
Features
Garuda Linux installation process is done with Calamares, a graphical installer. The rolling release model means that the user does not need to upgrade/reinstall the whole operating system to keep it up-to-date inline with the latest release. Garuda Linux uses systemd as its init software. Package management is handled by Pacman via command line, and front-end UI package manager tools such as the pre-installed Pamac. It can be configured as either a stable system (default) or bleeding edge in line with Arch. Garuda Linux includes colorized UI which comes in various options, with the option to further customize the user preferences.
Desktop environments
Garuda Linux provides many releases with various desktop environments and package defaults. All have Arch Linux as their base and the Garuda Linux Team provide their own additional package builds via Chaotic-AUR which is part of all releases.
Garuda Downloader is a tool provided by the Garuda Linux team for Windows and Linux to download the latest official release of all editions.
System requirements
Garuda Linux hardware requirements vary on the desktop environment used, but they are very similar.
Minimum requirements:
30 GB storage
4 GB RAM
Recommended requirements:
40 GB storage
8 GB RAM
Garuda Linux also requires a storage device that contains 4 GB of space for their standard versions. Gaming desktop environments require a storage device with 8 GB storage space available.
Installation
The official Garuda Linux website supplies ISO images that can be run using a bootable USB device with 4 GB/8 GB of storage space, depending on the ISO image chosen. After the user has their partitions and formats set up on their drive, they can insert the thumbdrive and boot into it from the BIOS. Calamares installer will begin its process and present the user with a GUI installer.
Garuda Linux uses a rolling release update model in which new p |
https://en.wikipedia.org/wiki/Time%20in%20Burundi | Time in Burundi is given by a single time zone, officially denoted as Central Africa Time (CAT; UTC+02:00). Burundi does not observe daylight saving time.
IANA time zone database
In the IANA time zone database, Burundi is given one zone in the file zone.tab – Africa/Bujumbura. "BI" refers to the country's ISO 3166-1 alpha-2 country code. Data for Burundi directly from zone.tab of the IANA time zone database; columns marked with * are the columns from zone.tab itself:
See also
List of time zones by country
List of UTC time offsets
References
External links
Current time in Burundi at Time.is
Time in Burundi at TimeAndDate.com
Time in Burundi |
https://en.wikipedia.org/wiki/William%20J.%20Hartman | William J. Hartman is a United States Army major general who has served as the Commander of the Cyber National Mission Force since August 2019. He previously served as the Deputy Commanding General of Joint Force Headquarters–Cyber of the United States Army Cyber Command from August 1, 2017 to August 2019.
In May 2023, Hartman was nominated for promotion to lieutenant general with assignment as the deputy commander of United States Cyber Command.
References
Living people
Place of birth missing (living people)
Recipients of the Legion of Merit
United States Army generals
United States Army personnel of the Gulf War
United States Army personnel of the Iraq War
United States Army personnel of the War in Afghanistan (2001–2021)
Year of birth missing (living people) |
https://en.wikipedia.org/wiki/Penril | Penril DataComm Networks, Inc. was a computer telecommunications hardware company that made some acquisitions and was eventually split into two parts: one was acquired by Bay Networks and the other was a newly formed company named Access Beyond. The focus of both company's products was end-to-end data transfer. By the mid-1990s, with the popularization of the internet, this was no longer of wide interest.
History
Penril, whose earnings reports and other financials were followed by The New York Times in the 1990s, made several acquisitions but also grew internally. Following its Datability acquisition it renamed itself Penril Datability Networks.
By the time the 1968-founded Penril was acquired by Bay their name was Penril DataComm Networks. The company, which as of 1985 "had made 14 acquisitions in 12 years," also had done extensive work regarding quality control, and leveraged their product line by what The Washington Post called clever packaging: "software, cables, instructions and telephone support" sold to those less technically skilled as "Network in a Box."
Datability
Datability Software Systems Inc. was the initial name of what by 1991 became 'Datability, Inc.', "a manufacturer of hardware that links computer networks." The 1977-founded firm began as a software consulting company, especially in the area of databases. To speed up project development they built a program generator, which they marketed as Control 10/20 (targeted at users of Digital Equipment Corporation's DECsystem-10 and DECSYSTEM-20). After trying their hand at time-sharing they built hardware to enhance bridging these computers to DEC's VAX product line. In particular they focused on Digital's LAT protocol, selling "boxes" that reimplemented the protocol, at a lower price than DEC's. They later expanded into other areas of telecommunications hardware The firm relocated to a larger manufacturing plant in 1991 and was acquired by Penril in 1993.
Access Beyond
Access Beyond was initially housed by Penril, from which it was spun off. A securities analyst noted
that Access began operations with no debt. They subsequently merged with Hayes Corporation. Some of the funds brought to the merger came from a sale by Penril of two of its divisions, each bringing about $4 million.
Ron Howard
Ron Howard, founder of Datability, became part of Penril when the latter acquired the former, and was CEO of Access Beyond when it was spun off by Penril. Access merged with Hayes Microcomputer Products and was renamed Hayes Corp, at which time Howard became executive VP of business development and corporate vice chairman of Hayes.
People
In the matter of hiring immigrants, in an industry where recent arrivals came from a culture of six day work weeks, and subcontracting was then common, these assembly line workers at Penril comprised about 25%, compared to double in other firms. Placement was overseen by government agencies.
Controversy
Penril had a joint development agreement, beginning in |
https://en.wikipedia.org/wiki/Chorki | Chorki is a Bangladeshi subscription-based over-the-top media service and original programming production company, owned by Transcom Group via Prothom Alo subsidiary of Mediastar Limited, and was launched on 12 July 2021 worldwide. The service shows original content and content from other providers, including television series, films, and documentaries. The service is available in an ad-free version with limited content, while the premium tier includes a larger content library including original shows and films.
Background and history
Bangladesh has become a growing market for OTT. Foreign streaming services were doing business in Bangladesh successfully. But there were very little local content. To fill the gap Mediastar Ltd. came forward, and in 2020, they announced to launch an OTT platform in next year and named it Chorki. In April 2021, Indian High Commission of Dhaka shares 38 documentary films with Chorki. Early 2021, it was told that 3 June 2021 would be the launching date. But later, it was delayed to July 2021. On 12 July 2021, a launching ceremony was held on online due to the lockdown of the COVID-19 pandemic and Chorki started its journey with a motto - Film, Fun, Foorti. Jaya Ahsan and many more stars joined in online in this opening ceremony. Chorki is currently available for Android, iOS, Apple TV, Amazon Fire TV, Android TV, Samsung Smart TV. Chorki won the Best Digital Diversification Project award at the Bangladesh Media Innovation Awards 2022 held in September 2022.
Content
Chorki mainly focuses on Bangla language content. They also show Turkish and Iranian films with Bangla dubbed version. They have two categories of contents premium and free respectively. To watch premium content subscription is required. They offer a wide variety of video content such as movies, series, Shows, non-fiction Content, Music Video, Chorki Original content, and many more Bangla and foreign language video contents. They started their journey with over 200 titles of films, TV series, documentaries, TV dramas, etc.
Technology Partner
Chorki has partnered with leading global streaming and OTT solution provider, ViewLift to power its on-demand video streaming service. Chorki platform uses AVOD, SVOD and TVOD models to monetize its content.
Original programming
Feature films
Drama
Comedy
Documentaries
TV Shorts
Exclusive programming
Foreign Films
Foreign series
References
External links
Official Website
Entertainment companies of Bangladesh
Internet television streaming services in Bangladesh
Companies based in Dhaka
Bangladeshi entertainment websites
Bangladeshi companies established in 2021 |
https://en.wikipedia.org/wiki/Cycling%20on%20ABC | Cycling on ABC is the de facto name for broadcasts of bicycle races produced by ABC Sports, the sports division of the American Broadcasting Company television network.
Overview
Race Across America
In 1982, Wide World of Sports devoted the April 17 and 23 editions to coverage of the Race Across America, which was then known as the Great American Bike Race. Jim Lampley anchored ABC's coverage of the inaugural race alongside Diana Nyad. ABC's coverage of the 1982 Great American Bicycle Race wound up garnering an Emmy for the Best Sports Documentary.
In total, ABC would cover the first five installments of the Race Across America. From 1983-1985, ABC aired the Race Across America in two one hour segments on Wide World of Sports. For their final year of covering the event (1986), ABC aired the Race Across America on Wide World of Sports as a single two-hour program.
Tour de France coverage
On July 26, 1976, Wide World or Sports provided coverage of the Tour de France for the very first time.
ABC later covered the Tour de France from 1989–2000, succeeding CBS in that capacity. ABC agreed to pay $1 million a year for the television rights to the Tour de France. ABC also carried Paris–Roubaix in this time frame under the Wide World of Sports umbrella.
In 1989, Sam Posey was brought in as part of the ABC Sports broadcast team covering the Tour de France. Many people were surprised by Posey's knowledge and genuine enthusiasm for the sport. ABC would bring him back as the lead anchor for the 1990 and 1991 races.
ABC's standard format for broadcasting the Tour de France consisted of a 12-minute report on behalf of Wide World of Sports on Saturdays and then, hours worth of coverage the following afternoon. In total, ABC would present approximately eight same day telecasts. Four of them would be scheduled for broadcast on Wide World of Sports while the other four would be classified as special Sunday broadcasts.
ABC's coverage of the 1996 Tour de France was nominated for an Emmy for Outstanding Live Event Turnaround.
In 2001, ABC as well as their sister network, ESPN, would be supplanted by the Outdoor Life Network in broadcasting the Tour de France.
Summer Olympic coverage
At the 1984 Summer Olympics in Los Angeles, Al Michaels provided the play-by-play commentary for the road cycling events alongside Greg LeMond and Eric Heiden. For the track events, Bill Flemming had the play-by-play duties alongside Eric Heiden.
Commentators
John Eustice
Terry Gannon
Frank Gifford
Adrian Karsten
Jim Lampley
Phil Liggett
Brent Musburger
Diana Nyad
Sam Posey
Robin Roberts
Paul Sherwen
Beth Ruyak
Pierre Salinger
Al Trautwig
See also
References
External links
ABC News - Tour de France
ABC Sports - Wide World of Sports - ESPN
ABC
ABC Sports
American Broadcasting Company original programming
Wide World of Sports (American TV series)
1982 American television series debuts
1986 American television series endings
1989 American television series debuts
1970s |
https://en.wikipedia.org/wiki/General%20Practice%20Data%20for%20Planning%20and%20Research | The General Practice Data for Planning and Research system was set up by the British National Health Service as a replacement for the General Practice Extraction Service as a means of transmitting data intended for use beyond that of providing individual health care. This might include healthcare planning, or research.
It was announced on 21 May 2021,
It received a cautious welcome for the potential benefits to Health Research, particularly as large scale medical data is providing valuable data on the most effective treatments for Covid-19.
Privacy and implementation concerns
Amongst patients and the general public concerns have been raised about sale of NHS data to private companies.
The Pulse magazine - distributed to general practitioners in the UK, carried articles reflecting concern about the scope of the data being collected and the additional workload and legal risks it would impose on GPs
Responsibility for informing patients was devolved to GP Practices, for example by updating the Privacy Notice on their website. Doctors urged a delay in introduction due to these concerns
Opt out
Patients can out of NHS data sharing at two levels, firstly then can ask their GP not to share data with NHS digital for purposes of research and planning, called a Type 1 Opt Out, and secondly they can opt out of NHS Digital sharing - the National Data Opt Out.
The Type 1 Opt Out was implemented by the patient filling out a downloadable paper form and returning it to their GP,
Implementation delay
The process of making GP data available to NHS Digital for wider use was due to begin on 1 July 2021, but was delayed until 1 September
It has now been delayed until four criteria have been met
the ability to delete data if patients choose to opt-out of sharing their GP data with NHS Digital, even if this is after their data has been uploaded
the backlog of opt-outs has been fully cleared
a Trusted Research Environment has been developed and implemented in NHS Digital
patients have been made more aware of the scheme through a campaign of engagement and communication
Data security and governance
From the GP Data for Planning and Research: Letter from Parliamentary Under Secretary of State for Health and Social Care to general practices in England - 19 July 2021
References
External links
General Practice Data for Planning and Research (GPDPR)
How to opt out | medConfidential
use MY data - 94
Our perspective on the new system for GP data | Understanding patient data
OpenSAFELY: Home
Databases in England
Department of Health and Social Care
Medical databases in the United Kingdom |
https://en.wikipedia.org/wiki/Next-fit%20bin%20packing | Next-fit is an online algorithm for bin packing. Its input is a list of items of different sizes. Its output is a packing - a partition of the items into bins of fixed capacity, such that the sum of sizes of items in each bin is at most the capacity. Ideally, we would like to use as few bins as possible, but minimizing the number of bins is an NP-hard problem. The next-fit algorithm uses the following heuristic:
It keeps a current bin, which is initially empty.
When an item arrives, it checks whether the item fits into the current bin.
If it fits, it is placed inside it.
Otherwise, the current bin is closed, a new bin is opened and the coming item is placed inside this new bin.
Next-Fit is a bounded space algorithm - it requires only one partially-filled bin to be open at any time. The algorithm was studied by David S. Johnson in his doctoral thesis in 1973.
Run time
The running time of NextFit can be bounded by , where is the number of items in the list.
Approximation ratio
Denote by NF(L) the number of bins used by NextFit, and by OPT(L) the optimal number of bins possible for the list L.
Upper bound
Then, for each list , . The intuition to the proof s the following. The number of bins used by this algorithm is no more than twice the optimal number of bins. In other words, it is impossible for 2 bins to be at most half full because such a possibility implies that at some point, exactly one bin was at most half full and a new one was opened to accommodate an item of size at most . But since the first one has at least a space of , the algorithm will not open a new bin for any item whose size is at most . Only after the bin fills with more than or if an item with a size larger than arrives, the algorithm may open a new bin. Thus if we have bins, at least bins are more than half full. Therefore, . Because is a lower bound of the optimum value , we get that and therefore .
Lower bound
For each , there exists a list such that and .
The family of lists for which it holds that is given by with . The optimal solution for this list has bins containing two items with size and one bin with items with size (i.e., bins total), while the solution generated by NF has bins with one item of size and one item with size .
Bounded item size
If the maximum size of an item is , then the asymptotic approximation ratio ratio satisfies:
for all ;
for all .
Other properties
Next-Fit packs a list and its inverse into the same number of bins.
Next-k-Fit (NkF)
Next-k-Fit is a variant of Next-Fit, but instead of keeping only one bin open, the algorithm keeps the last bins open and chooses the first bin in which the item fits.
For , NkF delivers results that are improved compared to the results of NF, however, increasing to constant values larger than improves the algorithm no further in its worst-case behavior. If algorithm is an AlmostAnyFit-algorithm and then .
See also
Next-fit-decreasing (NFD) is the offline variant |
https://en.wikipedia.org/wiki/Best-fit%20bin%20packing | Best-fit is an online algorithm for bin packing. Its input is a list of items of different sizes. Its output is a packing - a partition of the items into bins of fixed capacity, such that the sum of sizes of items in each bin is at most the capacity. Ideally, we would like to use as few bins as possible, but minimizing the number of bins is an NP-hard problem. The best-fit algorithm uses the following heuristic:
It keeps a list of open bins, which is initially empty.
When an item arrives, it finds the bin with the maximum load into which the item can fit, if any.
If such a bin is found, the new item is placed inside it.
Otherwise, a new bin is opened and the coming item is placed inside it.
Approximation ratio
Denote by BF(L) the number of bins used by Best-Fit, and by OPT(L) the optimal number of bins possible for the list L. The analysis of BF(L) was done in several steps.
The first upper bound of was proven by Ullman in 1971.
An improved upper bound was proved by Garey, Graham and Ullman, Johnson and Demers.
Afterward, it was improved by Garey, Graham, Johnson, Ullman, Yao and Chi-Chih to .
Finally this bound was improved to by Dósa and Sgall. They also present an example input list , for that matches this bound.
Worst-fit
Worst-Fit is a "dual" algorithm to best-fit: it tries to put the next item in the bin with minimum load.
This algorithm can behave as badly as Next-Fit, and will do so on the worst-case list for that . Furthermore, it holds that .
Since Worst-Fit is an AnyFit-algorithm, there exists an AnyFit-algorithm such that .
References
Bin packing |
https://en.wikipedia.org/wiki/First-fit%20bin%20packing | First-fit (FF) is an online algorithm for bin packing. Its input is a list of items of different sizes. Its output is a packing - a partition of the items into bins of fixed capacity, such that the sum of sizes of items in each bin is at most the capacity. Ideally, we would like to use as few bins as possible, but minimizing the number of bins is an NP-hard problem. The first-fit algorithm uses the following heuristic:
It keeps a list of open bins, which is initially empty.
When an item arrives, find the first bin into which the item can fit, if any.
If such a bin is found, the new item is placed inside it.
Otherwise, a new bin is opened and the coming item is placed inside it.
Approximation ratio
Denote by FF(L) the number of bins used by First-Fit, and by OPT(L) the optimal number of bins possible for the list L. The analysis of FF(L) was done in several steps.
The first upper bound of for FF was proven by Ullman in 1971.
In 1972, this upper bound was improved to by Garey, Graham and Ullman, Johnson and Demers.
In 1976, it was improved by Garey, Graham, Johnson, Yao and Chi-Chih to , which is equivalent to due to the integrality of and .
The next improvement, by Xia and Tan in 2010, lowered the bound to .
Finally, in 2013, this bound was improved to by Dósa and Sgall. They also present an example input list , for which matches this bound.
Below we explain the proof idea.
Asymptotic ratio at most 2
Here is a proof that the asymptotic ratio is at most 2. If there is an FF bin with sum less than 1/2, then the size of all remaining items is more than 1/2, so the sum of all following bins is more than 1/2. Therefore, all FF bins except at most one have sum at least 1/2. All optimal bins have sum at most 1, so the sum of all sizes is at most OPT. Therefore, number of FF bins is at most 1+OPT/(1/2) = 2*OPT+1
Asymptotic ratio at most 1.75
Consider first a special case in which all item sizes are at most 1/2. If there is an FF bin with sum less than 2/3, then the size of all remaining items is more than 1/3. Since the sizes are at most 1/2, all following bins (except maybe the last one) have at least two items, and sum larger than 2/3. Therefore, all FF bins except at most one have sum at least 2/3, and the number of FF bins is at most 2+OPT/(2/3) = 3/2*OPT+1.
The "problematic" items are those with size larger than 1/2. So, to improve the analysis, let's give every item larger than 1/2 a bonus of R. Define the weight of an item as its size plus its bonus. Define the weight of a set of items as the sum of weights of its contents.
Now, the weight of each FF bin with one item (except at most one) is at least 1/2+R, and the weight of each FF bin with two or more items (except at most one) is 2/3. Taking R=1/6 yields that the weight of all FF bins is at least 2/3.
On the other hand, the weight of every bin in the optimal packing is at most 1+R = 7/6, since each such bin has at most one item larger than 1/2. Therefore, the total we |
https://en.wikipedia.org/wiki/Harmonic%20bin%20packing | Harmonic bin-packing is a family of online algorithms for bin packing. The input to such an algorithm is a list of items of different sizes. The output is a packing - a partition of the items into bins of fixed capacity, such that the sum of sizes of items in each bin is at most the capacity. Ideally, we would like to use as few bins as possible, but minimizing the number of bins is an NP-hard problem.
The harmonic bin-packing algorithms rely on partitioning the items into categories based on their sizes, following a Harmonic progression. There are several variants of this idea.
Harmonic-k
The Harmonic-k algorithm partitions the interval of sizes harmonically into pieces for and such that . An item is called an -item, if .
The algorithm divides the set of empty bins into infinite classes for , one bin type for each item type. A bin of type is only used for bins to pack items of type . Each bin of type for can contain exactly -items. The algorithm now acts as follows:
If the next item is an -item for , the item is placed in the first (only open) bin that contains fewer than pieces or opens a new one if no such bin exists.
If the next item is an -item, the algorithm places it into the bins of type using Next-Fit.
This algorithm was first described by Lee and Lee. It has a time complexity of where n is the number of input items. At each step, there are at most open bins that can be potentially used to place items, i.e., it is a k-bounded space algorithm.
Lee and Lee also studied the asymptotic approximation ratio. They defined a sequence , for and proved that for it holds that . For it holds that . Additionally, they presented a family of worst-case examples for that
Refined-Harmonic (RH)
The Refined-Harmonic combines ideas from the Harmonic-k algorithm with ideas from Refined-First-Fit. It places the items larger than similar as in Refined-First-Fit, while the smaller items are placed using Harmonic-k. The intuition for this strategy is to reduce the huge waste for bins containing pieces that are just larger than .
The algorithm classifies the items with regard to the following intervals: , , , , , for , and . The algorithm places the -items as in Harmonic-k, while it follows a different strategy for the items in and . There are four possibilities to pack -items and -items into bins.
An -bin contains only one -item.
An -bin contains only one -item.
An -bin contains one -item and one -item.
An -bin contains two -items.
An -bin denotes a bin that is designated to contain a second -item. The algorithm uses the numbers N_a, N_b, N_ab, N_bb, and N_b' to count the numbers of corresponding bins in the solution. Furthermore, N_c= N_b+N_ab
Algorithm Refined-Harmonic-k for a list L = (i_1, \dots i_n):
1. N_a = N_b = N_ab = N_bb = N_b' = N_c = 0
2. If i_j is an I_k-piece
then use algorithm Harmonic-k to pack it
3. else if i_j is an I_a-item
then if N_b != 1,
then pack i |
https://en.wikipedia.org/wiki/Arjen%20Kamphuis | Arjen Kamphuis (Groningen, 26 January 1972 – missing since 20 August 2018, last seen in Bodø, Norway) was a cybersecurity expert and hacktivist. He addressed topics like open standards and free software, safe elections and an IT-aware and IT-capable government, eventually to protect free speech and democracy. Ever since Edward Snowden leaked highly classified information from the National Security Agency (NSA) in 2013, he was especially dedicated to protecting investigative journalists. He wrote the book ‘Information security for investigative journalists’ with co-author Silkie Carlo, director of Big Brother Watch.
Career
Kamphuis was co-founder and Chief Technology Officer of Gendo. Kamphuis studied Natural Sciences at Utrecht University and worked for IBM and Twynstra Gudde as IT architect, trainer and IT strategy advisor. He was a certified EDP auditor and information security specialist. Since 2006 he helped to secure the information systems of corporates, national government and NGO's. His work ranges from regular privacy-compliance and security-awareness up to countering espionage against companies, journalists and governments. To keep up technically he was involved with the global hacker-scene. He kept in touch with (former)employees of spy agencies and other professionals who work at the front of critical infrastructure protection. He worked on the strategic impact of new technological developments and the social, economic and geo-political impact of science and technology.
In 2016 Kamphuis started working for Brunel in Amsterdam as Lead Advisor Information Security and from then on he worked closely with William (Bill) Binney and Kirk Wiebe. On 11 August 2017, he was invited with Bill Binney to a press conference in Austria, together with Max Schrems and Thomas Lohninger to talk about mass surveillance in Austria. In late 2017 he started the Brunel daughter company Pretty Good Knowledge as Technical Director. Bill Binney and Kirk Wiebe were co-founders and they contribute as Directors of Analytics.
Kamphuis has been involved in formulating public IT policy in the areas of open standards and open source for the government and public sector. He advised senior managers and administrators of companies and public institutions, members of parliament in several European countries and the Dutch Cabinet about the opportunities offered by open standards and open source software for the European knowledge economy and society as a whole. In the expert team of Plasterk he advised about (not) using e-voting for elections.
Personal life
Kamphuis was in a relationship with Annie Machon, former MI5 intelligence officer and whistleblower, between 2007 and 2014, living in Düsseldorf and Berlin. In 2016 he settled in Amsterdam. He was a much sought-after international speaker on technology policy issues. He wrote about his insights and ideas for Huffington Post.
Disappearance
The Norwegian police conclude that Kamphuis probably drowned due to a kayakin |
https://en.wikipedia.org/wiki/First-fit-decreasing%20bin%20packing | First-fit-decreasing (FFD) is an algorithm for bin packing. Its input is a list of items of different sizes. Its output is a packing - a partition of the items into bins of fixed capacity, such that the sum of sizes of items in each bin is at most the capacity. Ideally, we would like to use as few bins as possible, but minimizing the number of bins is an NP-hard problem, so we use an approximately-optimal heuristic.
Description
The FFD algorithm works as follows.
Order the items from largest to smallest.
Open a new empty bin, bin #1.
For each item from largest to smallest, find the first bin into which the item fits, if any.
If such a bin is found, put the new item in it.
Otherwise, open a new empty bin put the new item in it.
In short: FFD orders the items by descending size, and then calls first-fit bin packing.
An equivalent description of the FFD algorithm is as follows.
Order the items from largest to smallest.
While there are remaining items:
Open a new empty bin.
For each item from largest to smallest:
If it can fit into the current bin, insert it.
In the standard description, we loop over the items once, but keep many open bins. In the equivalent description, we loop over the items many times, but keep only a single open bin each time.
Performance analysis
The performance of FFD was analyzed in several steps. Below, denotes the number of bins used by FFD for input set S and bin-capacity C.
In 1973, D.S. Johnson proved in his doctoral thesis that for any instance S and capacity C.
In 1985, B.S. Backer gave a slightly simpler proof and showed that the additive constant is not more than 3.
Yue Minyi proved that in 1991 and, in 1997, improved this analysis to together with Li Rongheng.
In 2007 György Dósa proved the tight bound and presented an example for which .
Worst-case example
The lower bound example given in by Dósa is the following: Consider the two bin configurations:
;
.
If there are 4 copies of and 2 copies of in the optimal solution, FFD will compute the following bins:
4 bins with configuration ,
1 bin with configuration ,
1 bin with configuration ,
1 bin with configuration ,
1 one final bin with configuration ,
That is, 8 bins total, while the optimum has only 6 bins. Therefore, the upper bound is tight, because .
This example can be extended to all sizes of : in the optimal configuration there are 9k+6 bins: 6k+4 of type B1 and 3k+2 of type B2. But FFD needs at least 11k+8 bins, which is .
Monotonicity properties
Contrary to intuition, is not a monotonic function of C. Similarly, is not a monotonic function of the sizes of items in S: it is possible that an item shrinks in size, but the number of bins increases.
However, the FFD algorithm has an "asymptotic monotonicity" property, defined as follows.
For every instance S and integer m, let MinCap(S,m) be the smallest capacity C such that
For every integer m, let MinRatio(m) be the infimum of the numbers r≥1 such |
https://en.wikipedia.org/wiki/Next-fit-decreasing%20bin%20packing | Next-fit-decreasing (NFD) is an algorithm for bin packing. Its input is a list of items of different sizes. Its output is a packing - a partition of the items into bins of fixed capacity, such that the sum of sizes of items in each bin is at most the capacity. Ideally, we would like to use as few bins as possible, but minimizing the number of bins is an NP-hard problem. The NFD algorithm uses the following heuristic:
Order the items from largest to smallest.
Initialize an empty bin and call it the "open bin".
For each item in order, check if it can fit into the open bin:
If it fits, then place the new item into it.
Otherwise, close the current bin, open a new bin, and put the current item inside it.
In short: NFD orders the items by descending size, and then calls next-fit bin packing.
Performance upper bound
Baker and Coffman proved that, for every integer r, when the size of all items is at most 1/r, the asymptotic approximation ratio of RFD satisfies,where is a sequence whose first elements are approximately 1.69103, 1.42312, 1.30238. In particular, taking r=1 implies that .
Later, NFD has also been analyzed probabilistically.
Variants
Next-Fit packs a list and its inverse into the same number of bins. Therefore, Next-Fit-Increasing has the same performance as Next-Fit-Decreasing.
However, Next-Fit-Increasing performs better when there are general cost structures.
References
Bin packing |
https://en.wikipedia.org/wiki/R1a-SUR51 | R1a-SUR51 - Y-chromosomal paternal line, found in modern Bashkirs, Mishars, Hungarians and Serbs.
The Institute of Hungarian Research determinated the whole genome data of King Béla III of Hungary which was published in 2020, and King Saint Ladislaus of Hungary which was published in 2023. The paternal Y chromosome of both member of the Hungarian royal Árpád dynasty belong to the haplogroup R-ARP (R1a1a1b2a2a1c3a3b) which is a sub-haplogroup of the haplogroup R-SUR51 which belongs to the R-Z2123 clade.
Ethnogenomic tree
R1a-Z645>Z93>Z94>Z2124>Z2125>Z2123>Y2632>Y2633>SUR51
The ancestral subclades R1a-Y2632 are found among the Saka population of the Tien Shan, date: 427-422 BC.
Clan-tribal affiliation and distribution area of representatives of the line R1a-SUR51
Representatives of the R1a-SUR51 line are currently settled in Bashkiria, Tatarstan, Nizhny Novgorod and Ryazan regions, in Hungary and in Serbia.
Bashkirs46 RU-BA samples from Bashkortostan, Russia
Uchalinsky District Bashkortostan
Sura-Teleu, Zium-Teleu, Bure-Teleu, Oghuz-Teleu;
Kuyurgazinsky, Burzyansky and Kugarchinsky District s of Bashkortostan
Huun-Qipsak, Qariy-Qipsak, Boshman-Qipsak, Sankem-Qipsak;
Burzyansky and Kuyurgazinsky districts of Bashkortostan
Nughay-;
Abzelilovsky District Bashkortostan
Babsak-Qaraghay-Qipsak;
Abzelilovsky and Meleuzovsky District s of Bashkortostan
Shakman-Tamyan;
Zianchurinsky and Khaibullinsky District s of Bashkortostan, Orenburg Region
Aqsak-Usergan;
Aktanyshsky District Tatarstan
Sarish-Qipsak;
Mishars
Drozhzhanovsky District Tatarstan
Barkhievs, Tuktamyshevs and others;
Nizhny Novgorod Region (Krashiy Ostrov).
Bilyaletdinovs and others;
Temnikov, Ryazan region
Derbyshevs and others;
Hungarians
Fejér County.
Serbia
South Bačka District (Vojvodina).
Lifetime of a common ancestor between the Arpad dynasty and the Bashkirs R1a-SUR51
According to the research of Peter L. Nagy, Judit Olasz and others, the lifetime of a common ancestor between the Bashkir R1a-SUR51 and the Arpad dynasty falls on the beginning of our era. Another researcher Bulat A. Muratov displays the time of the divergence of the Bashkirs R1a-SUR51 from the Arpad dynasty to the 7th century AD.
Bibliography and Notes
Arpad Dynasty
References
Haplogroup R
Indo-European genetics
Human Y-DNA haplogroups
Nomadic groups in Eurasia
History of Central Asia
Hungarian nobility
Hungarian tribes and clans |
https://en.wikipedia.org/wiki/Ofer%20Strichman | Ofer Strichman (Hebrew: עופר שטרייכמן, born: 4 September 1968) is a professor of computational logic and computer science at the Davidson Industrial Engineering and Management, Technion – Israel Institute of Technology. He holds the Joseph Gruenblat chair in production engineering.
Early life and education
Ofer Strichman was born and raised in Haifa. He graduated from Alliance high-school in 1986 and joined the academic reserve program of the IDF. He received his BSc in Industrial Engineering (specializing in operations research and information systems) from the Technion in 1991. He then served for six years in the IDF, while studying for an MSc degree in operations research and information systems at the Technion.
After leaving the IDF, he started a PhD program in 1997 at the Weizmann Institute in Rehovot, Israel, under the supervision of Prof. Amir Pnueli. He specialized in formal methods and computational logic, and specifically in translation validation for compilers, Bounded Model Checking, and decision procedures. His thesis title was ‘Efficient decision procedures for validation’. In 2001 he started a post-doc position at Carnegie Mellon University, under the sponsorship of Prof. Edmund Clarke, where he specialized in model checking.
Academic career
Strichman joined the information systems group at the faculty of industrial engineering and management at the Technion in 2003, as a senior lecturer. He was promoted to an associate professor in 2009 and to a full professor in 2017. In 2020 he was awarded the Joseph Gruenblat chair in production engineering.
During each summer in the years 2003–2015, Strichman was a visiting scientist at the Software Engineering Institute in Pittsburgh. He was a consultant of IBM Research for 6 years, as of 2004. In 2010 he was a visiting scientist at Microsoft Research in Redmond, Washington, as part of a sabbatical.
Research
Prof. Strichman's main research areas are formal verification and computational logic. He, along with fellow Israeli scientist Benny Godlin, is known for coining the term ‘regression verification’ to describe a technique for proving the equivalence of recursive programs, and for developing various decision procedures (mostly for equalities with uninterpreted functions).
Honors and awards
Strichman won the Technion's Gutwirth award in 2010, and in 2021 the CAV award for "pioneering contributions to the foundations of the theory and practice of satisfiability modulo theories (SMT)”.
Several software tools (a SAT solver, and a CSP solver) that were developed by his students under his supervision won gold and silver medals in international competitions.
Publications
Books
Decision Procedures - an algorithmic point of view Together with Daniel Kroening. Springer-Verlag, 2008.
Efficient Decision Procedures for Validation (a re-edited collection of Strichman's PhD publications). LAP Lambert Academic Publishing, 2010.
Selected articles
Ultimately Incremental SAT. Proc. of the 17th In |
https://en.wikipedia.org/wiki/History%20of%20Ruby | The history of the Ruby programming language began when Yukihiro Matsumoto first conceived of the language in 1993, then released it in 1995. Annual releases of the language often take place on Christmas Day. Interest in the language surged around 2005 because of the Ruby on Rails framework.
Conception
Ruby creator Yukihiro Matsumoto has said that Ruby was conceived in 1993. In a 1999 post to the ruby-talk mailing list, he describes some of his early ideas about the language:
Matsumoto describes the design of Ruby as being like a simple Lisp language at its core, with an object system like that of Smalltalk, blocks inspired by higher-order functions, and practical utility like that of Perl.
The name "Ruby" originated during an online chat session between Matsumoto and Keiju Ishitsuka on February 24, 1993, before any code had been written for the language. Initially two names were proposed: "Coral" and "Ruby". Matsumoto chose the latter in a later e-mail to Ishitsuka. Matsumoto later noted a factor in choosing the name "Ruby" – it was the birthstone of one of his colleagues.
First publication
The first public release of Ruby 0.95 was announced on Japanese domestic newsgroups on December 21, 1995. Subsequently, three more versions of Ruby were released in two days. The release coincided with the launch of the Japanese-language ruby-list mailing list, which was the first mailing list for the new language.
Already present at this stage of development were many of the features familiar in later releases of Ruby, including object-oriented design, classes with inheritance, mixins, iterators, closures, exception handling and garbage collection.
Early releases
Following the release of Ruby 0.95 in 1995, several stable versions of Ruby were released in the following years:
Ruby 1.0: December 25, 1996
Ruby 1.2: December 1998
Ruby 1.4: August 1999
Ruby 1.6: September 2000
In 1997, the first article about Ruby was published on the Web. In the same year, Matsumoto was hired by netlab.jp to work on Ruby as a full-time developer.
In 1998, the Ruby Application Archive was launched by Matsumoto, along with a simple English-language homepage for Ruby.
In 1999, the first English language mailing list ruby-talk began, which signaled a growing interest in the language outside Japan. In this same year, Matsumoto and Keiju Ishitsuka wrote the first book on Ruby, The Object-oriented Scripting Language Ruby (オブジェクト指向スクリプト言語 Ruby), which was published in Japan in October 1999. It would be followed in the early 2000s by around 20 books on Ruby published in Japanese.
By 2000, Ruby was more popular than Python in Japan. In September 2000, the first English language book Programming Ruby was printed, which was later freely released to the public, further widening the adoption of Ruby amongst English speakers. In early 2002, the English-language ruby-talk mailing list was receiving more messages than the Japanese-language ruby-list, demonstrating Ruby's incr |
https://en.wikipedia.org/wiki/Tom%20Okman | Tom Okman (Lithuanian: Tomas Okmanas; born November 5, 1987) is a Lithuanian businessman and entrepreneur. He is the co-founder of business accelerator Tesonet and cybersecurity solutions company Nord Security, which is best known for its VPN service NordVPN. In 2017, Tom Okman made the annual New Europe 100 list of the Financial Times. In 2020, Okman was named the CEO of the year by the leading Lithuanian business newspaper Verslo Zinios.
Early life
Tom Okman was born and raised in Vilnius. He earned a bachelor's degree in history at Vilnius University and later earned a master's degree in e-business management at Mykolas Romeris University.
Career
Okman founded Tesonet together with Eimantas Sabaliauskas in 2008. After trying 34 various projects and ideas, from computer games to web hosting solutions, they finally focused on network security, business hosting, and big data solutions. Both individually and through the Tesonet accelerator, Okman invested in more than 50 different projects and ventures. He is actively involved in mentoring new ventures in the Lithuanian startup ecosystem and has taken part in launching a new association aimed at the growth of active Lithuanian startups.
In 2012, Okman co-founded the VPN service company NordVPN. He contributed to the development of the solution, significantly reducing the time required for TCP packets to travel between the client, the VPN server, and their ultimate destination. Tom Okman is listed as one of the inventors of this method in the US patent office database.
In 2017, Okman co-founded Nord Security, an umbrella company for several cybersecurity solutions both for clients and businesses, like NordVPN, NordVPN Teams, NordPass, and NordLocker. However, a near-future vision for Nord Security, according to Okman, is to have one app that users could forget about after its activation: it would cover all the important areas of consumer security in the background.
Since 2020, Tom Okman has been a member of the Forbes Technology Council.
He is also a member of the board of trustees at the Vilnius University Institute of International Relations and Political Science, together with the eighth President of the Republic of Lithuania Dalia Grybauskaitė and other prominent Lithuanian figures.
Advocacy
Tom Okman is a member of the board of directors of the Internet infrastructure coalition (i2Coalition). This initiative ensures that those who build the infrastructure of the internet have a voice in public policy. In 2019, i2Coalition and six leading VPN service providers launched an initiative called VPN Trust Initiative (VTI). A year later, VTI released a set of VTI Principles to offer a comprehensive set of best practices for VPN providers. Speaking on behalf of NordVPN, a member of VTI, Okman stated that the release of VTI Principles and Standards sets the bar for the whole industry.
References
1987 births
Living people
Businesspeople in information technology
Technology company founde |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.