source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/10G | 10G is a term used by some cable Internet access providers and industry groups in the United States in reference to broadband networks with a maximum potential download rate of ten gigabits per second (10 Gbit/s). The term was first used in this regard by industry association NCTA in January 2019, which said it had filed for a trademark on the term, and expanded on by CableLabs in a summer 2019 white paper.
The term "10G" has no connection to the numbered generations of cellular network standards such as 5G (fifth generation). Some articles discussing the term have posited that 10G suggests to casual readers that service would be twice as fast as 5G, when in fact the 5G standard already encompasses even faster speeds of up to 20 Gbit/s.
In early 2023, Comcast began referring to its Xfinity Internet service as now being on a "10G network", despite the fact that the top-speed service available in the vast majority of homes served by Comcast was still only 1 Gbit/s.
In October 2023, the National Advertising Division (NAD) of the Better Business Bureau ruled that it considered Comcast's use of 10G to be false or misleading, as it constituted an express claim that Comcast was using a tenth-generation network or was promising 10 Gbit/s speeds to all customers. The NAD recommended that Comcast should either discontinue its claims or clarify 10G as an "aspirational" technology. Comcast said it would appeal the decision by the self-regulatory body.
See also
10 Gigabit Ethernet – a set of technologies for Ethernet communications that support up to 10 Gbit/s speeds
10G-PON and 10G-EPON – passive optical network standards that support up to 10 Gbit/s speeds
References
Internet access
Internet terminology
Comcast |
https://en.wikipedia.org/wiki/Antonivka%20Railway%20Bridge | The Antonivka Railway Bridge (, ) was a single-track railway bridge over the Dnieper, in the Kherson Oblast in southern Ukraine. It connected rail networks in Ukraine on either side of Dnieper. The Kherson–Kerch Railway line ran over the bridge. The bridge was destroyed during the retreat of Russian troops in November 2022.
Geographical location
The bridge is located at kilometre 43.5 of the river near the confluence of the Inhulets and the Dnieper and six kilometres east of the urban settlement of Antonivka, in Kherson, after which it was named.
History
The construction of the bridge began in 1939, but with the beginning of the German-Soviet war it was interrupted after the first pillars had been installed. The Germans built a railway bridge some distance downstream, which was destroyed during the war.
A railway engineering regiment familiar with overcoming water barriers was commissioned in 1949 to build the nearly one kilometre-long strategic bridge. The railway bridge was put into operation on 12 December 1954.
In the course of the Russian attack on Ukraine beginning in 2022, the bridge became strategically important as a route for Russian troops heading west. After the bridge had fallen into Russian hands during the first days of the war, it was made impassable by Ukrainian air raids during the summer of 2022. The bridge was completely destroyed in November 2022 during the withdrawal of Russian troops from the area to the west of the Dnieper, as also was the nearby Antonivka Road Bridge.
See also
Antonivka Road Bridge
List of crossings of the Dnieper
References
Bridges completed in 1954
Bridges over the Dnieper
Buildings and structures in Kherson Oblast
Kherson
Railway bridges in Ukraine
Buildings and structures demolished in 2022 |
https://en.wikipedia.org/wiki/Wrestle%20Princess%20I | Wrestle Princess (sequentially known as Wrestle Princess I) was a professional wrestling event promoted by CyberFight's sub-brand Tokyo Joshi Pro-Wrestling. It took place on November 7, 2020, in Tokyo, Japan, at the Tokyo Dome City Hall with limited attendance due in part to the ongoing COVID-19 pandemic at the time. The event aired on CyberAgent's AbemaTV online linear television service and CyberFight's streaming service Wrestle Universe.
It was the first annual event under the "Wrestle Princess" branch, which is considered to be Tokyo Joshi Pro-Wrestling's yearly main pay-per-view.
Background
Storylines
The event featured ten professional wrestling matches that resulted from scripted storylines, where wrestlers portrayed villains, heroes, or less distinguishable characters in the scripted events that built tension and culminated in a wrestling match or series of matches.
Event
The event started with the confrontation between Mei Suruga and Moka Miyamoto, and Sena Shiori and Suzume, solded with the victory of the latter team. In the second bout, Mahiro Kiryu and Pom Harajuku picked up a victory over Haruna Neko and Marika Kobashi in tag team action. On October 7, 2020, Thunder Rosa was forced to relinquish the International Princess Championship as she was unable to travel to Japan due to COVID-19 restrictions. The following day, TJPW announced a tournament to crown the new champion, with the semifinals and finals of the tournament culminating at Wrestle Princess. Later that month, on October 10 and 17, Hikari Noa, Mirai Maiumi, Yuki Kamifuku, and Shoko Nakajima were the participants that reached the semifinals of the tournament.. In the first semifinal, Hikari Noa defeated Mirai Maiumi. In the second one, Yuki Kamifuku defeated Shoko Nakajima. In the sixth bout of the evening, Saki Akai defeated Hyper Misao in what was billed as a switching random rules match. Next up, Aja Kong and Miyu Yamashita defeated Maki Itoh and Sareee in tag team action. In the eighth bout, Yuki Kamifuku defeated Hikari Noa in the International Princess Championship tournament finals to win the vacant title. In the semi main event, Nodoka Tenma and Yuki Aino defeated Miu Watanabe and Rika Tatsumi to win the Princess Tag Team Championship, ending the latter team's reign at 370 days and four successful defenses.
In the main event, Yuka Sakazaki defeated Mizuki to retain the Princess of Princess Championship for the fourth successful time in that respective reign.
Results
Notes
References
External links
TJPW official site
Tokyo Joshi Pro-Wrestling
CyberAgent
2020 in professional wrestling
November 2020 events in Japan
Professional wrestling in Japan
Events in Tokyo
Professional wrestling in Tokyo
Women's professional wrestling |
https://en.wikipedia.org/wiki/International%20Particle%20Physics%20Outreach%20Group | The International Particle Physics Outreach Group (IPPOG) is a network of scientists, educators, and communicators from around the world with the shared aim of enhancing the public's understanding and appreciation of particle physics. Established in 1997 at CERN, IPPOG works in collaboration with particle physics laboratories and experiments, including CERN, the Pierre Auger Observatory, DESY, and GSI.
History
IPPOG started out as the European Particle Physics Outreach Group (EPPOG) in 1997 with the sponsorship of the European Committee for Future Accelerators (ECFA) and the High Energy Particle Physics Board of the European Physical Society (EPS-HEPP).
In November 2012, EPPOG became IPPOG and soon after added the US as its first country member, followed by Israel, Ireland, Slovenia, Australia and South Africa.
Activities
IPPOG focuses on creating and implementing outreach initiatives related to particle physics. These include exhibitions, educational materials, and events designed for various audiences. Additionally, IPPOG provides resources for science communicators, educators, and physicists to assist in their outreach efforts, aiming to convey the concepts of particle physics in a comprehensible manner.
References
External links
Physics education
CERN
Particle physics
1997 establishments in Switzerland |
https://en.wikipedia.org/wiki/Monotone%20dualization | In theoretical computer science, monotone dualization is a computational problem of constructing the dual of a monotone Boolean function. Equivalent problems can also be formulated as constructing the transversal hypergraph of a given hypergraph, of listing all minimal hitting sets of a family of sets, or of listing all minimal set covers of a family of sets. These problems can be solved in quasi-polynomial time in the combined size of its input and output, but whether they can be solved polynomial time is an open problem.
Definitions
A Boolean function takes as input an assignment of truth values to its arguments, and produces as output another truth value. It is monotone when changing an argument from false to true cannot change the output from true to false. Every monotone Boolean function can be expressed as a Boolean expression using only logical disjunction ("or") and logical conjunction ("and"), without using logical negation ("not"). Such an expression is called a monotone Boolean expression. Every monotone Boolean expression describes a monotone Boolean function.
There may be many different expressions for the same function. Among them are two special expressions, the conjunctive normal form and disjunctive normal form. For monotone functions these two special forms can also be restricted to be monotone:
The conjunctive normal form of a monotone function expresses the function as a conjunction ("and") of clauses, each of which is a disjunction ("or") of some of the variables. A clause may appear in the conjunctive normal form if it is true whenever the overall function is true; in this case it is called an implicate, because the truth of the function implies the truth of the clause. This expression may be made canonical by restricting it to use only prime implicates, the implicates that use a minimal set of variables. The conjunctive normal form using only prime implicates is called the prime CNF.
The disjunctive normal form of a monotone function expresses the function as a disjunction ("or") of clauses, each of which is a conjunction ("and") of variables. A conjunction may appear in the disjunctive normal form if it is false whenever the overall function is false; in this case, it is called an implicant, because its truth implies the truth of the function. This expression may be made canonical by restricting it to use only prime implicants, the implicants that use a minimal set of variables. The disjunctive normal form using only prime implicants is called the prime DNF.
The dual of a Boolean function is obtained by negating all of its variables, applying the function, and then negating the result. The dual of the dual of any Boolean function is the original function. The dual of a monotone function is monotone. If one is given a monotone Boolean expression, then replacing all conjunctions by disjunctions produces another monotone Boolean expression for the dual function, following De Morgan's laws. However, this will transform the |
https://en.wikipedia.org/wiki/European%20Cricket%20Network | The European Cricket Network also known as ECN is a cricket organisation which was established in 2019, to promote and develop the sport of Cricket in Europe.
See also
European Cricket League
European Cricket Championship
References |
https://en.wikipedia.org/wiki/KayiFamily | Kayifamily, also known as Kayi Tribe is indeed a network of file streaming websites operating platform of Turkish television series of historical and drama series from Turkey, and Pakistan, especially those related to the Diriliş: Ertuğrul, Kuruluş: Osman, and Destan which allowed users to watch Turkish series for free. These websites have allowed users to watch Turkish series for free. It has gained notoriety as the world's "most popular illegal site," according to ATV and TRT1, a status it has held since 2018. As of July 2023, there are still active websites that attempt to imitate the brand.
Development
The site went through several name changes after being shut down from different domains; sometimes the name appeared as "KayiFamilyTV," and other times as "KayiFamilyUK" The original name and URL is kayifamily.com, which changed to other domains, including kayifamily.xyz before redirecting to kayifamily.org and later gomovies.is. It was changed to kayifamily.co.uk and then to kayifamilytv.com before changing to KayiFamily.com, before finally settling on KayiFamily.com and remaining there until shutdown.
In October 2020, the DMCA listed KayiFamily in its Online Notorious Markets overview to the Office of the United States Trade Representative (USTR), stating that: The site had a global Alexa rank of 559 and a local rank of 386 in the U.S. KayiFamily.to had 2.26 million worldwide unique visitors in August 2021, according to SimilarWeb data. In October 2021, Similarweb url reported that KayiFamily.com was the "most-used pirate website" in the United Kingdom.
KayiFamily included HD, HD-RIP, Blu-ray, and camera qualities of series. The video hosters and players it used included Openload, Streamango, and MyCloud. However, due to frequent DMCA takedown requests, the site had to constantly change its domain names to evade legal action. Despite these challenges, the site remained active and continued to provide its services, adapting to various domain changes.
In December 2022, the creators of KayiFamily launched another streaming site dedicated to anime, named KayiFamilyTV, which remained on "Top" for months after KayiFamily ongoing DMCA concerns. The site continued to operate and serve its user base, albeit under different domain names and aliases.
Reappearance
In October 2021, the MPAA's update on Online Notorious Markets to the United States Trade Representative, said that the closure of KayiFamily, KayiFamilyHub, KayiStream, and KayiFamilyTV, on foot of a criminal investigation in Pakistan and Turkey in 2018, was "an important development" in combatting illegal film piracy services, especially after increased pressure from ATV and TRT1. However, the MPAA report also noted that numerous copycat sites had emerged in at least eight other countries under the KayiFamily banner, despite ongoing DMCA takedown efforts and the website being blocked in the UK.
In November 2018, Quora users reported sites connected or similar to KayiFamily, such as |
https://en.wikipedia.org/wiki/5th%20Critics%27%20Choice%20Real%20TV%20Awards | The 5th Critics' Choice Real TV Awards, presented by the Broadcast Television Journalists Association and NPACT, which recognizes excellence in nonfiction, unscripted and reality programming across broadcast, cable and streaming platforms, were held on June 15, 2023. The ceremony was not held in-person due to the 2023 Writers Guild of America strike, instead a television special saluting the winners was aired the day after on KTLA.
The nominations were announced on May 15, 2023, with RuPaul's Drag Race leading with five.
Winners and nominees
Winners are listed first, highlighted in boldface, and indicated with a double dagger ().
Special awards
Impact Award
Lisa Vanderpump
References
External links
2023 television awards
2023 in American television
Critics' Choice Real TV Awards
June 2023 events in the United States |
https://en.wikipedia.org/wiki/List%20of%20channels%20owned%20by%20Sun%20TV%20Network | This is the list of channels owned by Sun TV Network in India.
On air channels
Sun TV Network currently owns and operates 33 TV channels (25 SD + 8HD) across some Indian languages – Tamil, Telugu, Malayalam, Kannada, Marathi and Bengali.
Defunct channels
References
Lists of television channels by language
Lists of television channels in India
Channels
Sun Group
India
lists of television channels
Television channels |
https://en.wikipedia.org/wiki/Sony%20Movie%20Channel%20%28disambiguation%29 | Sony Movie Channel is an American television channel.
Sony Movie Channel may also refer to:
AXN Black, a pan-European television network formerly known as Sony Movie Channel in Hungary
Great! Movies, a British television channel previously branded as Sony Movies
Hollywood Suite, a Canadian company which operates a television channel previously branded as Sony Movie Channel |
https://en.wikipedia.org/wiki/National%20Data%20Administration | The National Data Administration (NDA, ) is an administration under the National Development and Reform Commission (NDRC) of the State Council of the People's Republic of China.
History
The NDA was proposed in March 2023 as part of a reform of the Chinese Communist Party (CCP) and government institutions, which was approved by the National People's Congress. The NDA took over several responsibilities from the Cyberspace Administration of China and the NDRC, including promoting smart cities and the exchange of information resources across industries.
On 28 July 2023, Liu Liehong was appointed as the director of the NDA. The NDA was officially inaugurated on 25 October.
Functions
The NDA, an agency under the National Development and Reform Commission, is responsible for data and its regulation in China. According to the plan that established the agency, the NDA is responsible for "coordinating and promoting the construction of data infrastructure, coordinating the integration, sharing, development and utilization of data resources". The NDA is also responsible for regulating the digital economy and implementing a national big data strategy.
References
2023 establishments in China
Government agencies established in 2023
Government agencies of China
Organizations based in Beijing
State Council of the People's Republic of China |
https://en.wikipedia.org/wiki/List%20of%20fellows%20of%20IEEE%20Computer%20Society | In the Institute of Electrical and Electronics Engineers, a small number of members are designated as fellows for having made significant accomplishments to the field. The IEEE Fellows are grouped by the institute according to their membership in the member societies of the institute. This list is of IEEE Fellows from the IEEE Computer Society.
See also
List of IEEE Fellows
References
Lists of IEEE fellows |
https://en.wikipedia.org/wiki/R6%20Scott%20Road | The R6 Scott Road is a planned express bus service with bus rapid transit elements in Metro Vancouver, British Columbia, Canada. Part of TransLink's RapidBus network, it will travel along Scott Road and 72 Avenue in Surrey and will connect Scott Road station, North Delta, and Newton.
The route is expected to begin service in early 2024.
History
On June 28, 2018, the Mayors' Council and TransLink's board of directors approved the second phase of the 10-Year Vision. This phase included provisions for two new B-Line routes, one of which would connect Newton Exchange to the SkyTrain's Expo Line via Scott Road.
During a presentation to Delta city council on November 9, 2020, TransLink stated that the route would be named the R6 Scott Road RapidBus, and run from Newton Exchange to Scott Road station. This planned route would not directly stop at Scottsdale Exchange in order to shorten the travel time along the route.
Construction on the route started in April 2023 to introduce bus priority lanes, queue jumps, and remove bus bays for congestion mitigation.
Route description
Starting at Scott Road station, the R6 is planned to travel south along Scott Road towards 72 Avenue, then continue east along 72 Avenue towards Newton Exchange.
Stops
Scott Road station – connects to the Expo line and also serves South Westminster and Bridgeview
103A Avenue
96 Avenue
92 Avenue – serves Annieville
Nordel Way
84 Avenue
80 Avenue
75 Avenue
72 Avenue – connects to Scottsdale Exchange and serves the Scottsdale area
124 Street
126 Street – serves Kwantlen Polytechnic University
132 Street
Newton Exchange – serves Newton Town Centre and connects to the R1 King George RapidBus, as well other local services to Surrey, Langley and White Rock and express service to Richmond
See also
List of bus routes in Metro Vancouver
References
External links
TransLink
R6 Scott Road RapidBus | Translink
Transport in Greater Vancouver
RapidBus (TransLink)
Transport in Surrey, British Columbia
Transport in Delta, British Columbia |
https://en.wikipedia.org/wiki/National%20Commission%20for%20Personal%20Data%20Protection | The National Commission for Personal Data Protection (NCPDP) is a regulatory body established by the Government of Pakistan under the Personal Data Protection Bill 2023. The Commission is tasked with monitoring data processing activities and protecting the privacy rights of individuals.
Establishment
The NCPDP, the National Committee for Personal Data Protection, was founded within six months of the initiation of the Personal Data Protection Act in 2023. The federal government formally announced its establishment via a published notification in a government gazette.
Legislation
The Federal Cabinet approved the Personal Data Protection Bill of 2023, which seeks to govern the gathering, processing, utilization, disclosure, and transmission of personal data. This bill establishes a framework for data protection that encompasses offenses related to infringing on an individual's data privacy rights. Additionally, it suggests substantial fines for violations, with penalties potentially reaching up to $2 million or an equivalent sum in Pakistani rupees.
Role and responsibilities
The NCPDP functions as a civil court to safeguard users' private documents and data while addressing the concerns of individuals who file complaints. Its primary responsibility is to guarantee the security of personal information and data belonging to various organizations and companies. The commission enforces restrictions on the sharing of a user's information or data with any company, individual, or government entity without the user's explicit consent.
Controversies
Despite its purported goal of safeguarding citizens' privacy, certain critics contend that the new data protection law is a pretense aimed at compromising citizens' privacy. They assert that meaningful advancements in data protection can only be achieved through a more comprehensive policy-making approach that actively involves privacy experts, technology companies, and the public.
References
Government agencies of Pakistan
Data protection authorities
2023 establishments in Pakistan
Government agencies established in 2023 |
https://en.wikipedia.org/wiki/Tanzania%E2%80%93Burundi%20Standard%20Gauge%20Railway | The Tanzania–Burundi Standard Gauge Railway is a planned electrified railway line connecting the Tanzanian Standard Gauge Railway with the planned railway network of Burundi. It will link the town of Uvinza in western Tanzania to the capital of Burundi, Gitega, via the border town of Musongati. Through the Tanzanian railway network, the planned line will provide Burundi with a rail link to the Indian Ocean. The project is the first phase of the proposed Tanzania–Burundi–DR Congo Standard Gauge Railway.
Overview
In January 2022, the governments of Tanzania and Burundi signed a Memorandum of Understanding, in which they agreed to the construction of a standard gauge (1435 mm or 4 ft 81⁄2 in) railway line between the two countries. Initially, costs were estimated at US$900 million. The planned railway line is an extension of Tanzania's Standard Gauge Railway and is aimed at reducing transportation cost and increasing regional economic integration. Tanzania's finance ministry expects more than a million yearly tonnes of cargo to be transported between the two countries, and more than 3 million tonnes of minerals each year to be ferried from Burundi to Tanzania. It would be only the second transnational electrified railway on the African continent. The timeline for the completion of the project is five years.
In August 2022, the Tanzanian government invited bids for the design and construction of the Uvinza-Gitega (Tanzania-Burundi) Standard Gauge (SGR) line. The Tanzania Railway Corporation is managing procurement for the governments of both countries, though Burundi's ARTF will be involved in supervision of the construction. Bidding closes on November 15, 2023.
The line will span approximately 367 kilometres, featuring 282 kilometres of main railway line and 85 kilometres of siding and passing loops. It will be built based on AREMA and UIC standards.
Location
The railway line will connect to the Tanzanian standard gauge network at the town of Uvinza. From there, it runs in a general northwesterly direction along the Malagarasi river across the international border to the town of Musongati and onwards to the Burundian capital Gitega.
Phases
The project is divided in two lots, of which the second lot is to be completed in two phases.
Lot 1
Uvinza–Malagarasi
This section of 156 kilometres will be built by Tanzania. In total, 180 kilometres of railway infrastructure will be built on this section. Costs for this section are estimated at US$959.4 million.
Lot 2
Malagarasi–Gitega
This section will be built by Burundi and is to be completed in two phases. Phase A stretches from Malagarasi to Musongati for a distance of 80 kilometres. At the border, a 600 metre multimodal bridge will be built, accommodating both cars and trains. Phase B runs for 46 kilometres from Musongati to Gitega. In total, 187 kilometres of railway infrastructure will be built on the section. The cost for this section is expected to be US$1442.7 million.
Funding
The Bur |
https://en.wikipedia.org/wiki/Bronwen%20Connor | Bronwen Jane Connor is a New Zealand academic. She is a professor of pharmacology at the University of Auckland, where she is head of the Neural Reprogramming and Repair Lab.
Academic career
Connor's father has degrees in engineering and physics, and so she "grew up in a house with science". She had originally planned to major in exercise science at university, due to her love of rowing, but became hooked on neurology. Connor completed a Bachelor of Science in pharmacology and physiology in 1994. She followed this with a PhD titled The role of neurotrophic factors in neurodegenerative disorders of the human brain at the University of Auckland. Connor then undertook postdoctoral research at Northwestern University in Chicago, where she investigated gene therapy for Parkinson's disease. She joined the faculty at the University of Auckland in 2000, rising to full professor in 2019.
Connor researches neurological diseases such as Parkinson's disease, Huntington's disease, multiple sclerosis, stroke and depression. Her work focuses on identifying the pathways through which the diseases develop, and trying to identify therapeutic targets for stem cell therapy or gene therapy. Connor's work has pioneered the transformation of a patient's own adult skin cells into neural stem cells, which can then be used in treatment without the risk of immune rejection.
Honours and awards
In 2013, Connor was awarded the NEXT Woman of the Year Health and Science Award.
In the 2018 Queen's Birthday Honours, Connor was appointed a Member of the New Zealand Order of Merit, for services to the treatment of neurological disorders.
Selected works
s
References
External links
YouTube video of Connor talking about her career and work, part of the Neurological Foundation of New Zealand's Women in Science series
Connor's inaugural professorial lecture
New Zealand academics
New Zealand women academics
University of Auckland alumni
Academic staff of the University of Auckland
New Zealand neuroscientists
New Zealand pharmacologists
Members of the New Zealand Order of Merit
Neuropharmacologists |
https://en.wikipedia.org/wiki/Turakhia | Turakhia is a surname. Notable people with the surname include:
Bhavin Turakhia (born 1979), Indian entrepreneur
Divyank Turakhia (born 1982), Indian-born computer-programmer |
https://en.wikipedia.org/wiki/Dictionary%20of%20Chinese%20Character%20Variants | The Dictionary of Chinese Character Variants is a large database of Chinese character forms compiled by the Republic of China's Ministry of Education, first unveiled in June 2000.
Background
It is currently the largest Chinese dictionary. Its sixth edition was released in November 2017. The database organizes glyphs found in "calligraphy documents" dating from ancient times through to the present, assigning variants created by distinct writing methods but sharing pronunciation and meaning to standard forms. A total of 106,330 characters are counted, including:
29,921 standard characters
4,808 everyday characters
6,329 uncommon characters
18,319 rare characters
465 novel characters
74,407 variant characters
2,002 characters of unclear status
The Dictionary of Chinese Character Variants contains a far greater number of characters than the Hanyu Da Zidian (60,370 characters) and the Zhonghua Zihai (85,568 words), ultimately surpassing the Hanzihai's total of 102,447 characters.
References
Chinese dictionaries |
https://en.wikipedia.org/wiki/Simafilm | Sima Film () is the Iranian government state IRIB network film production corporation. It was established in 1994. It produces four genres of film for Farsi speakers. It's exclusively creating productions for IRIB. This corporation acts as one of the major departments within IRIB organization. It has underwent changes in recent 2020s years with government contracts for productions going through to Simafilm instead of IRIB network. Its CEO is Javad Ramezannejad.
References
1994 establishments |
https://en.wikipedia.org/wiki/Talon%20Cyber%20Security | Talon Cyber Security is an Israel-based provider of cybersecurity technologies with headquarters in Tel Aviv. It develops a secure browser engineered to provide enterprise-grade security across all devices, irrespective of location, device type, or operating system.
History
Talon Cyber Security was founded in 2021 by Ofer Ben Noon (the founder of Argus Cyber Security, an Israeli developer of security technologies for vehicles) and Ohad Bobrov (the founder of Lacoon Mobile Security, which specializes in security for mobile telephones).
In April 2021, the company raised a $26,000,000 seed round, which became the biggest seed round in Israel. The company also announced an investment from John W. Thompson, former chairman of the board at Microsoft and ex-CEO of Symantec; George Kurtz, co-founder of CrowdStrike; and Mark Anderson, formerly the president of Palo Alto Networks.
In October 2021, it launched the security-focused browser Talon's browser. Talon was listed in Israel's Globes Most Promising Startups of 2021.
In January 2022, Talon Cyber Security announced that it raised $43 million in new funding, including $17 million in agreement for future equity investments.
In May 2022 the company appointed Admiral Mike Rogers, a retired United States Navy admiral who served as the second commander of the United States Cyber Command as well as the director of the National Security Agency (NSA) and the chief of Central Security Service (CSS) to its Board of Advisors. In August 2022, Talon Cyber Security raised $100,000,000 in Series A funding.
In 2023, Talon Cyber Security announced that it has integrated its secure enterprise browser with the Microsoft Azure OpenAI Service to provide enterprise-grade ChatGPT access.
Operations
Talon Cyber Security focuses on addressing the security needs of the distributed workforce. The company's main product is a secure browser that provides security and enables access to corporate applications and data across various devices, managed or unmanaged, and operating systems. Talon's browser is based on Chromium. Via a management console, Talon’s browser allows businesses to apply their own policies across their employees’ browsers and get data on what workers are doing on the Web while working.
The company is based in Tel Aviv, Israel. Ofer Ben-Noon is co-founder and serves a company’s CEO, Ohad Bobrov is co-founder and serves as CTO.
References
Companies of Israel
Technology companies
2021 establishments |
https://en.wikipedia.org/wiki/Tabled%20logic%20programming | Tabling is a technique first developed for natural language processing, where it was called Earley parsing. It consists of storing in a table (a.k.a. chart in the context of parsing) partial successful analyses that might come in handy for future reuse.
Tabling consists of maintaining a table of goals that are called during execution, along with their answers, and then using the answers directly when the same goal is subsequently called. Tabling gives a guarantee of total correctness for any (pure) Prolog program without function symbols.
Tabling can be extended in various directions. It can support recursive predicates through SLG resolution or linear tabling. In a multi-threaded Prolog system tabling results could be kept private to a thread or shared among all threads. And in incremental tabling, tabling might react to changes.
History
The adaptation of tabling into a logic programming proof procedure, under the name of Earley deduction, dates from an unpublished note from 1975 by David H.D. Warren. An interpretation method based on tabling was later developed by Tamaki and Sato, modelled as a refinement of SLD-resolution.
David S. Warren and his students adopted this technique with the motivation of changing Prolog’s semantics from the completion semantics to the minimal model semantics.
Tabled Prolog was first introduced in XSB. This resulted in a complete implementation of the well-founded semantics, a three-valued semantics that represents values for true, false and unknown.
References
Logic programming
Dynamic programming |
https://en.wikipedia.org/wiki/Abiodun%20Musa%20Aibinu | Abiodun Musa Aibinu (born 4 January 1973) is a Nigerian academician and acadopreneur with a Doctor of Philosophy in Artificial Intelligence to Digital Signal and Image Processing from International Islamic University Malaysia where he also served as the Assistance Professor at Malaysia University. He was a Professor of Mechantronics Engineering and Head of department of Mechantronics Engineering at Federal University of Technology Minna. He is the Vice Chancellor of Summit University, Offa.
Early life
Abiodun Musa Aibinu was born in Lagos, Nigeria, and is a native of Ibadan, Oyo State. He had a National Diploma in Electrical and Electronics Engineering at The Polytechnic of Ibadan and a Bachelor of Science degree from Obafemi Awolowo University. Abiodun earned a Master of Science in Engineering at Blekinge Tekniska Hogskola, specializing in mechanics, robotics, and automation engineering. He completed his PhD in Engineering in Mechanic, robotic and automation from International Islamic University of Malaysia in 2010.
Research team
He was the vice-chancellor, chief academic officer, and principal investigator at research groups named The Advanced Science Research Group Innovation (ASRG) and Artificial Intelligence for Females in STEM (AI4FS). He was the substantive Vice-chancellor that initiated the collaborations by with Tiwakiki Limited, a Manchester-based company led by Abiola Oladipo.This collaboration was reported that it's resulted in the successful acquisition of a substantial research grant worth 1.3 million Euros for the project, which was funded by the EU.Aibinu through the IARSG team collaborated with Landmark University, Omu Aran, to organise the grant writing skills and research workshop .It was reported that This initiative not only facilitated knowledge exchange between the institutions but also empowered researchers with the tools to secure funding for innovative projects.Aibinu collaborates beyond institutional boundaries he collaborated with the Nigerian Stored Products Research Institute (NSPRI). Together, they embarked on a mission to address the significant losses incurred by farmers in Nigeria. Leveraging the university's research-driven approach and innovative methodologies, this partnership sought to revolutionize agricultural practices and mitigate post-harvest losses. The NSPRI's recognition of Summit University as a consistent champion of academic excellence and pioneering discoveries speaks volumes about Professor Aibinu's lasting legacy in the research community.
Career and education
Aibinu's completed his Secondary School in 1991 with Senior Secondary School Certificate (SSCE) at Éuba Secondary Schools in Mushin, Lagos. Following this, he completed his National Diploma in Electrical and Electronics Engineering from 1993 to 1995 at The Polytechnic of Ibadan, achieving an Upper Credit Division.Aibinu pursued a Bachelor of Science degree at Obafemi Awolowo University in Ile-Ife from 1995 to 2001, earning Second |
https://en.wikipedia.org/wiki/IMGSRC.RU | iMGSRC.RU is a free Russian photo hosting service for storing unlimited digital images and albums. As of July 2022, the service has about 75 million user-uploaded images in its database and about 1.5 million registered users. As of mid-2022, the average monthly attendance of the service is 14 million unique users per month.
As of July 2022, the site is ranked number one in the Rambler TOP-100 ranking in the Culture and Arts / Photography category. According to the data for June 2022 of SimilarWeb portal iMGSRC.RU service is among the TOP-10 photo sites along with flickr.com, shutterstock.com and gettyimages.com. The work of the service was covered on specialized portals in reviews devoted to the most popular photo hosting sites.
Blocking
On July 8, 2021, photo hosting was temporarily blocked on the territory of the Russian Federation. Full unblocking was carried out by Roskomnadzor on August 9, 2021.
References
External links
Блог ЖЖ iMGSRC.RU
official Medium blog iMGSRC.RU
Web 2.0
Internet properties established in 2006
Image-sharing websites |
https://en.wikipedia.org/wiki/Ulery | Ulery may refer to:
People
Dana Ulery (born 1938), American computer scientist
Jordan Ulery (born 1949), American politician
Other uses
Ulery Mill, building in Pennsylvania
Eli Ulery House, house inn Illinois |
https://en.wikipedia.org/wiki/Fakt%20Marathi%20Cine%20Sanman | The Fakt Marathi Cine Sanman are annual awards presented by the Fakt Marathi television network to honour both artistic and technical excellence in the Marathi-language film industry of India. The Awards were presented for the first time on 27 July 2022, at The Club in Andheri. The members of the jury select the winners. The awards are divided into two categories: popular awards and technical awards. The ceremony is televised on the Marathi television network Fakt Marathi.
Jury members
Hosts
Award categories
Popular awards
Best Film
Best Director
Best Actor in a Lead Role
Best Actress in a Lead Role
Best Actor in a Supporting Role
Best Actress in a Supporting Role
Best Performance in a Comic Role
Best Performance in a Negative Role
Best Playback Singer Male
Best Playback Singer Female
Best Music Director
Best Lyricist
Technical awards
Best Story
Best Dialogue
Best Screenplay
Best Cinematographer
Special Awards
Fakt Marathi Cine Sanman 2022
The award ceremony was held on 27 July 2022, at The Club in Andheri. The event was hosted by Amey Wagh and Onkar Bhojane and Vidya Balan was the special guest. The event was telecasted on 21 August 2022.
Chandramukhi led the ceremony with 14 nominations, followed by Soyrik and Dharmaveer with 11 nominations each.
Dharmaveer and Chandramukhi won 6 awards each, thus becoming the most-awarded films at the ceremony, with the former winning Best Film, Best Director and Best Actor in a Lead Role, and the latter winning Best Actress in a Lead Role, Best Actress in a Supporting Role and Best Performance in a Negative Role.
Pravin Tarde received five nominations across various categories, winning for Best Director and Best Dialogue, while Makarand Mane received four nominations and won for Best Screenplay.
Anand Shinde and Adarsh Shinde, a father-son duo, both won Best Playback Singer Male awards for different songs.
Technical Awards
Special Awards
Fakt Marathi Cine Sanman 2023
The nominations were announced on 5 September 2023 and award ceremony was held on 15 September 2023. The event was hosted by Amey Wagh and Onkar Bhojane while Jackie Shroff and Satish Shah were the special guest. The event was telecasted on 28 October 2023.
Technical Awards
Special Awards
References
Awards established in 2022
Indian film awards
Marathi cinema
Maharashtra awards |
https://en.wikipedia.org/wiki/The%20Republican%20Compiler | The Republican Compiler was a newspaper printed in Gettysburg, Pennsylvania servicing Adams County. The newspaper predated the Republican Party, and its name instead refers to early American Republicanism.
History
Lefever family
The newspaper was founded by Jacob Lefever in 1819, the second oldest newspaper in Gettysburg, behind just The Adams Sentinel. Lefever operated as the paper's chief executive and publisher until 1839 when he gave the newspaper to his son, Isaac Lefever, to pursue a political career, ultimately serving a single term in the Pennsylvania House of Representatives in 1848.
Stevens libel case
In 1831, then Gettysburg lawyer and borough councilman Thaddeus Stevens, gave a speech in Hagerstown, Maryland, where he strongly condemned freemasonry claiming that the organization was seeking to undermine the United States and enslave the American people. The newspaper, staunchly Democratic, attacked the personal appearance and character of Stevens, in an attempt to undermine the popularity of the local Anti-Masonic Party. Calling Stevens "bald" "stout" "lame" and a "harlot", and that his speech was "the vilest slanders barefaced falsehood and pandemoniac malignity against a large and respectable portion of our citizens that ever fell from the lips of any man." The newspaper also attacked Stevens place of birth for not being Pennsylvania when seeking to impact Pennsylvanian politics. In response, Stevens sued Lefever and the paper for libel, to which Lefever argued no defense and had to pay a $50 fine ($1,768.90 in 2023), retract the article, and was sentenced to three months in prison. The severity of the punishment that presiding Judge John Reed gave Lefever troubled Democratic governor George Wolf and his State Attorney Samuel Douglas, who sent his Adams County deputy, Andrew G. Miller to request Reed remit the prison sentence, Reed refused. After the trial, former state senator Zephaniah Herbert accused Reed, and the other presiding Judge, McClean, of prejudice as both were very active in local anti-masonic circles. A petition was also signed by most of Gettysburg's founding families requested they remit Lefever's prison sentence. Seventeen days after his sentencing, Governor Wolf pardoned Lefever. Later in Stevens' career, it was revealed that he bribed the editors of the Adams Sentinel and the Antimasonic Star to publish inflammatory rhetoric against The Republican Compiler which compelled Lefever to print the piece against Stevens.
Stahle family
Isaac, who was never a journalist or politician, sold the paper in 1843 to Edward Stahle to finance his tuition at the University of Pennsylvania's Medical School. Edward gave the newspaper to his son Henry Stahle shortly after in 1845. The newspaper maintained and even increased their ties to the Democratic Party, publishing their statements and declarations, as such, with the founding of the Republican Party in 1854 Henry would cease publication of The Republican Compiler in 1857, w |
https://en.wikipedia.org/wiki/Katrin%20Heitmann | Katrin Heitmann is a German-American cosmologist whose research involves large-scale computer simulations of the universe, focused on understanding its distribution of matter and rate of expansion. She is a Deputy Division Director of High Energy Physics at the Argonne National Laboratory, the former spokesperson of the LSST Dark Energy Science Collaboration, a senior associate of the Kavli Institute for Cosmological Physics at the University of Chicago, and an affiliate of the Northwestern-Argonne Institute of Science and Engineering at Northwestern University.
Education and career
Heitmann has a 2000 Ph.D. from the Technical University of Dortmund. Her dissertation, Non-equilibrium dynamics of symmetry breaking and gauge fields in quantum field theory, was supervised by Jürgen Baacke. She became a researcher at the Los Alamos National Laboratory from 2000 to 2011, when she moved to her present position at Argonne.
Recognition
In 2023, she was elected as a Fellow of the American Physical Society (APS), after a nomination from the APS Division of Astrophysics, "for pioneering the development of innovative and novel techniques in cosmic simulations for the era of precision cosmology, and for providing sustained scientific leadership, specifically within LSST DESC".
References
Year of birth missing (living people)
Living people
German emigrants to the United States
German astrophysicists
German cosmologists
German women physicists
American astrophysicists
American cosmologists
American women physicists
Women astrophysicists
Technical University of Dortmund alumni
Los Alamos National Laboratory personnel
Argonne National Laboratory people
Fellows of the American Physical Society |
https://en.wikipedia.org/wiki/Andrey%20Leman | Andrey Aleksandrovich Leman (, 1940–2012) was a Soviet mathematician and computer scientist who is known for the development of the Weisfeiler Leman graph isomorphism test together with Boris Weisfeiler published in 1968. He contributed to the chess computer Kaissa, which was the winner of the world's first chess tournament between computer programs in 1974. In his youth he successfully participated in math Olympiads () becoming a jury member for the Moscow Mathematical Olympiad in the 1960s. He also coedited a book for preparation of future olympiad participants.
He contributed to the first Soviet database INES which was used ubiquitously in the USSR and for which he received the USSR Council of Ministers Prize. In 1990 he emigrated into the US where he continued to work as a software developer. He contributed to the Cuneiform OCR in the 1990s which was used by notable companies such as Oracle, IBM, and Samsung.
References
External links
This page has a photo of him and offers more biographical details. Here is a russian version of this blog.
1940 births
2012 deaths
20th-century Russian educators
20th-century Russian mathematicians
Artificial intelligence researchers
Moscow State University alumni
Textbook writers
Russian educators
Russian mathematicians
Russian computer programmers
Russian emigrants to the United States
Soviet educators
Soviet mathematicians
Soviet computer scientists
Computer chess people
Place of birth missing
Place of death missing |
https://en.wikipedia.org/wiki/BlacVolta | BlacVolta Network is a Ghanaian digital media company which focused on entertainment, lifestyle, and nightlife in Africa.
History
BlacVolta Network has a range of offerings committe to Africa's entertainment and lifestyle scene.
In 2023, the company expanded into Uganda, specifically in Kampala, and has a team of 16 creative professionals and founded by Joseph Adjei.
BlacVolta Network consists of BlacVolta Media, BlacVolta Nightlife Podcast, BlacVolta merchandises, BlacVolta Talent Management and BlacVolta Events.
References
Broadcasting in Ghana
Annual events in Ghana
Ghanaian culture |
https://en.wikipedia.org/wiki/Jugando%20Pelota%20Dura | Jugando Pelota Dura is a Puerto Rican television talk show hosted by Ferdinand Perez. The program initially premiered on Sistema TV network in 2012 before moving on to Univision Puerto Rico (later, Teleonce) in 2017 after the passing of Hurricane Maria left WMTJ unable to broadcast the show. The show shares its name from Perez's radio show Pelota Dura (Hard Ball) that airs on WUNO. The program primarily features coverage of political issues and headlines, along with discussion from a panel of analysts and political figures.
History
After serving 2 terms as a legislator for the PPD and a failed candidacy for the mayoral seat of San Juan, Puerto Rico, Ferdinand Perez launched Jugando Pelota Dura (Playing Hard Ball) on WMTJ (Sistema TV). The show focused on providing a platform to highlight issues that are affecting the people of Puerto Rico and allowed Perez to use his knowledge and connections to invite local politicians and discuss ways to address this issues. The original version of the show featured Perez alongside a panel of journalists and political analysts which included Yolanda Velez Arcelay, Leo Aldridge, Denisse Perez and Zoe Laboy.
In 2017, after Hurricane Maria damaged the facilities of WMTJ, Jugando Pelota Dura was forced to find a new home and the show moved to WLII-DT which at the time was branded as Univision Puerto Rico. Jugando Pelota Dura premired on Univision on December 2017 airing at the coveted 5:55pm time-slot, however, during the show's time in Univision the show was shuffled around the scheduled and moved time-slots several times which hurt it chances to hold an audience, 4 months after its premiere on April 2018 the show was moved to 9:00pm and two months later on June 2018 the show was moved to 7:00pm where it has remained since.
The show features Ferdinand Perez alongside a panel of journalist and a panel of guests who are related to the topics discussed on that day's episode. The original panel featured Zoe Laboy, Yolanda Velez Acerlay, Leo Aldridge and Denise Perez. In 2020, Alex Delago (a journalist from WUNO) joined the cast and so did Margarita Aponte a journalist who previously had worked as anchor of Las Noticias before its initial closure in 2014. Laboy, Arcelay and Aldridge all left in 2022 to join WKAQ-TV in the show Rayos X after their exit JPD added to the panel Victor Hernandez and Cyd Marie Flemming, a long anchor of Las Noticias who returned to WLII-DT after an 8-year absence. Aponte and Flemming also perform hosting duties on occasions where Perez can not make it to the show.
Additionally, the show added Jailenne Rivera as a co-host. Rivera would be in charge of commercial break lead-ins and producing reports from the field. Rivera would eventually leave the show in 2023 with her role being filled by Kimberly Santiago moving forward.
On November 29, 2022, after speculation began that the show would move networks once again, Ferdinand Perez announced on his Instagram that he had renewed his contra |
https://en.wikipedia.org/wiki/Fizz%20%28app%29 | Fizz is an American social media network founded in 2020 by two Stanford University students. The application focuses on college specific groups where students can anonymously create posts and comment and upvote other posts. It is currently accessible at more than 80 colleges around the US as of August 2023 and is aiming to be at 250 by January 2024. Fizz has had three successful rounds of funding: Seed Funding ($4.5 million in September 2022), Series A ($12 million in November 2022), and Series B ($25 million in August 2023), giving it a combined $41.5 million of capital.
References |
https://en.wikipedia.org/wiki/EDION%20Corporation | (short for "Exciting Discovery In One Network") is a consumer electronics retailer chain in Japan. It was formerly a holding company that operated multiple chain brands. As of 2023, EDION is the fifth largest electronics and home appliance retailer, behind Yamada Denki, Bic Camera, K's Holdings, and Yodobashi Camera.
History
EDION was founded on March 29, 2002 as a joint holding company of Chūbu region chain and Chūgoku region chain Deodeo. In order to compete with northern Kantō region electronics retailers such as Yamada Denki, which were expanding nationwide, EDION entered into business alliances with Osaka chain , Kansai region chain , Hokuriku region and Hokkaido chain , and Tōhoku region and Hokkaido chain . The was formed by the five companies to plan and develop original products. However, in 2004, Midori Denka merged with EDION, and the alliance with the remaining three companies was temporarily dissolved. In July 2006, EDION absorbed Kantō region chain . The company also invested in , a core company of the Maruni Group that manufactures furniture, showing its desire to become an fast fashion specialist.
In February 2007, EDION acquired 40% of the shares in 3Q and made it a consolidated subsidiary. Listed on the Tokyo Stock Exchange and Nagoya Stock Exchange (), the head office moved from Nagoya to Osaka from January to July 2007 with the aim of strengthening the foundations of the Kansai region. In total, the company operates 1,212 stores under its umbrella (as of March 2014).
On February 8, 2007, EDION entered into a business and capital alliance with Bic Camera to develop an urban station-type business. Ultimately, the aim was to integrate the businesses, but as it became clear that there were differences in direction, the two companies decided to only form a business partnership and the integration was scrapped. After that, the business partnership with Bic Camera was terminated at the expiration of the two-year contract.
In October 2009, the operating subsidiaries were reorganized into two divisions: EDION East and EDION west. A year later, both divisions were merged and transferred from a holding company to an operating company, completing a series of integrations. In conjunction with the series of reorganizations, the company established a "regional brand" strategy and transferred stores outside its territory to its original regional management company.
In 2012, Best Denki entered into a capital and business alliance with Yamada Denki. On December 10, the Fair Trade Commission approved the merger on the condition that eight of the 10 areas where there are no stores other than those of the two companies would be transferred to other businesses. From September to November, EDION acquired six stores located in Chichibu, Asakura, Karatsu, Shimabara, Isahaya, and Hitoyoshi from Yamada Denki and Best Denki. At the same time, on October 16, 2013, EDION acquired , which was a Best Denki franchisee in Kagoshima Prefecture. On Octobe |
https://en.wikipedia.org/wiki/Alliance%20for%20Responsible%20Citizenship | Alliance for Responsible Citizenship (ARC) is an international centre-right network who focus on social and cultural issues faced by member nations. Its formation was announced by its founders, Jordan Peterson, John Anderson and Baroness Stroud in June of 2023, with a London conference held in late October of that year. One Australian journalist identified the purpose of ARC as follows:to replace a sense of division and drift within conservatism, and Western society at large, with a renewed cohesion and purpose.
History
In an interview with the Sydney Morning Herald, John Anderson said the group emerged as a response to the "civilisational" moment, of western decline, as liberal democracies "are plagued with self doubt" as to their own values and beliefs. The "shaky ground" of depleted social institutions, such as the Christian Church, and the breakdown of cohesive social norms could be seen as part of this crisis. The founders believe the West now has no binding narrative, as this has been "picked apart"; leaving it with a geostrategic vulnerability. In the face of this crisis, Anderson characterised the goal of ARC was to "regroup, and put forward a positive agenda.”
Others described ARC as being a response to problems in contemporary conservatism itself. That the global movement, in English-speaking world at least, was "scrambling to define itself by what it opposes rather than what it believes." A report in The Telegraph saw the group as a corrective to the "chaos" and "excesses" in American conservatism during the rise of Donald Trump, the "muddle" conservative beliefs in the UK, and a lack of a clear reason for the existence of a conservative group in Australia.
Beliefs
The organisation has no hard set of political statements. Its organising ideas are reported to coalesce around responsible citizenship, motivated by "faith and hope" to ensure our "social fabric." Founding documents focus on the strength of family structures, protecting "free exchange and good governance", reassessing energy and resources, and "environmental stewardship". Overall, its concerns fall into five strands:
1. Family, social fabric and population
Key figures in the group, such as Miriam Cates, identify the breakdown of the family as a cause of "economic stagnation." The alliance emphasises family as the centre for bringing "flourishing and prosperity to their homes, communities, and beyond. The fraying of "social fabric" is primarily addressed in the family context, which Peterson asserts, using conservative categories, will be "approximating the nuclear family" with "long-term, committed, stable heterosexual marriages sanctified by the community".
2. Free enterprise and good governance
The group is highly critical of contemporary market economies, particularly woke business practises, crony capitalism and "the spread of ESG into boardrooms" all of which are said to overlook actual shareholder interests. Some figures in the group, such as Sir Paul Mars |
https://en.wikipedia.org/wiki/Kevin%20Sekniqi | Kevin Sekniqi is an Albanian-American computer scientist and entrepreneur. Sekniqi helped develop the Avalanche Consensus protocol underlying the Avalanche blockchain platform, and is currently the co-founder and COO of Ava Labs. Previously, he was a Ph. D. candidate in computer science at Cornell University. He was a recipient of the Forbes 30 Under 30 award in 2022.
At Cornell, Sekniqi conducted research in distributed systems under the advisorship of professors Emin Gün Sirer and Robbert van Renesse. Sekniqi also conducted research in order-preserving encryption schemes and stablecoin economics. He interned at Microsoft and NASA.
In high school, Sekniqi started Bitcoin mining after reading a post on Reddit. In 2018, Sekniqi collaborated with Cornell professors Emin Gün Sirer, Robbert van Renesse, Associate Professor Ittay Eyal, and fellow doctoral student Maofan "Ted" Yin on the research leading to the discovery of Avalanche Consensus. The protocol was a deviation from classical consensus protocols, whereby probabilistic sampling replaced all-to-all communication. The research work was eventually commercialized into production with Ava Labs, which developed the Avalanche blockchain.
References
Living people
Cornell University faculty
People associated with cryptocurrency
American computer scientists
William E. Macaulay Honors College alumni |
https://en.wikipedia.org/wiki/Participatory%20budgeting%20experiments | Participatory budgeting experiments are experiments done in the laboratory and in computerized simulations, in order to check various ethical and practical aspects of participatory budgeting. These experiments aim to decide on two main issues:
Front-end: which ballot type to use as an input? Common formats are: k-approval ballots (- each voter approves exactly k), threshold-approval ballots (- each voter approves all projects with value above a given threshold), knapsack voting (each voter approves projects whose total cost is at most the budget), ranking projects by value or by value-per-money, and cardinal ballots (see List of participatory budgeting votes for details on which input format is used in each city).
Back-end: Which rule to use for aggregating the voters' preferences? (see combinatorial participatory budgeting for detailed descriptions of various aggregation rules).
Comparing ballot types
Goel, Krishnaswamy, Sakshuwong and Aitamurto report the results of several experiments done on real PB systems in Boston (2015-2016), Cambridge (2014-2015), Vallejo (2015) and New York City (2015). They compare knapsack voting to k-approval voting. Their main findings are:
Knapsack voting tends to favor cheaper projects, whereas k-approval favors more expensive projects. This is probably due to the fact that knapsack voting raises the voters' attention to the project costs.
The time it takes users to vote using the digital interface is not significantly different between the two methods; knapsack voting does not take more time.
Using pairwise comparisons of value-per-money, they conclude that knapsack voting allows voters to better represent their prefernces.
Later experiments lead to different conclusions:
Benade, Itzhak, Shah, Procaccia and Gal compared input formats on two dimensions: efficiency (social welfare of the resulting outcomes), and usability (cognitive burden on the voters). They conducted an empirical study with over 1200 voters. Their story was about resource allocation for a desert island. They concluded that k-approval voting imposes low cognitive burden and is efficient, although it is not perceived as such by the voters.
Benade, Nath, Procaccia and Shah experimented with four input formats: knapsack voting, ranking by value, ranking by value-for-money, and threshold-approval. Their goal was to maximize social welfare by using observed votes as proxies for voters’ unknown underlying utilities. They found out that threshold-approval voting performs best on real PB data.
Fairstein, Benade and Gal report the results of an experiment with Amazon Turk workers, on a PB process in an imaginary town. In their experiment, 1800 participants vote in four PB elections in a controlled setting, to evaluate the practical effects of the choice of voting format and aggregation rule. They compared k-approval, threshold-approval, knapsack voting, rank by value, rank by value/cost, and cardinal ballots. Their main findings are that the k |
https://en.wikipedia.org/wiki/Charles%20James%20Hambro | Charles James Hambro, (born 26 March 1991) is a British technology entrepreneur with a particular focus on the metaverse and virtual fashion industries. He is the co-founder and CEO of metaverse data company GEEIQ.
Early life and family
Hambro was born on 26 March 1991 in London to The Honourable Charles Edward Hambro and Nicole J. Nicholas. He is a grandson of Charles Hambro, Baron Hambro, a banker who served as the senior honorary treasurer of the Conservative Party, and a great-grandson of Sir Charles Jocelyn Hambro. He is of Danish, German Jewish, and Greek ancestry, and is a descendant of Baron Carl Joachim Hambro, a Danish banker who founded the Hambros Bank and was ennobled by Frederick VII of Denmark in 1851. Hambro is also a great-grandson of Lady Lettice Cotterell, a member of the Bright Young Things and the daughter of William Lygon, 7th Earl Beauchamp. His family claims royal descent from George Keppel, 3rd Earl of Albemarle and Robert the Bruce.
Career
GEEIQ works with the likes of Gucci, Walmart, Heineken, L'Oréal and Tommy Hilfiger to help carve out their data-driven virtual strategies.
In 2021, Hambro was a member of the team that won a Webby Award in the Advertising, Media & PR category for GEEIQ's involvement in Gucci Garden Archetypes on Roblox.
Hambro's expertise in the metaverse and virtual fashion industries has been featured in various articles, including a CNN Style piece on fashion in the metaverse and a Vogue Business article on the increasing popularity of digital fashion.
Personal life
Hambro lives in London, England and at his family estate in Dumbleton, Gloucestershire. He has three sisters, Christiana, Tatiana and Marina.
References
External links
Gentleman’s Journal |
https://en.wikipedia.org/wiki/Opinion%20polling%20for%20the%202023%20New%20South%20Wales%20state%20election | In the lead-up to the 2023 New South Wales state election, a number of polling companies conducted regular opinion polls for various news organisations. These polls collected data on parties' primary vote, and contained an estimation of the two-party-preferred vote. They also asked questions about the electorates' views on major party leaders.
Voting intention
Graphical summary
Aggregate data of voting intention from all opinion polling since the 2019 election. Local regression trends for each party.
Primary vote
Two party preferred
Opinion polls
Preferred Premier and satisfaction
Graphical summary
Polling
Electorate polling
References
2023 New South Wales state election
2023 state election |
https://en.wikipedia.org/wiki/Opinion%20polling%20for%20the%202019%20New%20South%20Wales%20state%20election | In the lead-up to the 2019 New South Wales state election, a number of polling companies conducted regular opinion polls for various news organisations. These polls collected data on parties' primary vote, and contained an estimation of the two-party-preferred vote. They also asked questions about the electorates' views on major party leaders.
Graphical summary
Voting intention
The ReachTEL poll on 10 September 2018 includes 5.9% of undecided voters.
The ReachTEL poll on 29 November 2018 includes 3.1% of undecided voters.
The YouGov-Galaxy poll on 28–29 November 2018 includes 5% of undecided voters.
Preferred Premier and satisfaction
References
2019 state election |
https://en.wikipedia.org/wiki/Opinion%20polling%20for%20the%202015%20New%20South%20Wales%20state%20election | In the lead-up to the 2015 New South Wales state election, a number of polling companies conducted regular opinion polls for various news organisations. These polls collected data on parties' primary vote, and contained an estimation of the two-party-preferred vote. They also asked questions about the electorates' views on major party leaders.
Voting intention
Graphical summary
Primary vote graph
Two-party preferred graph
Voting intention polling
Leadership polling
Graphical summary
Better Premier and leadership polling
References
2015 state election |
https://en.wikipedia.org/wiki/Opinion%20polling%20for%20the%202022%20Victorian%20state%20election | In the lead-up to the 2022 Victorian state election, a number of polling companies conducted regular opinion polls for various news organisations. These polls collected data on parties' primary vote, and contained an estimation of the two-party-preferred vote. They also asked questions about the electorates' views on major party leaders.
Graphical summary
Voting intention
Preferred Premier and satisfaction
References
2022 Victorian state election
2022 state election |
https://en.wikipedia.org/wiki/Opinion%20polling%20for%20the%202018%20Victorian%20state%20election | In the lead-up to the 2018 Victorian state election, a number of polling companies conducted regular opinion polls for various news organisations. These polls collected data on parties' primary vote, and contained an estimation of the two-party-preferred vote. They also asked questions about the electorates' views on major party leaders.
Graphical summary
Voting intention
In the lead-up to the election, Poll aggregation site Poll Bludger placed the two-party-preferred vote for Labor at 53.5%, coupled with primary vote shares at 41.0% for Labor, 39.8% for the Liberal/National Coalition, and 11.1% for the Greens. Election Analyst Antony Green stated on the ABC's election coverage that the result was "four to five percent better than all the opinion polls, which is the most out I've seen opinion polls in this country"
The Liberal Party wrote in their campaign review that their data gathered in their internal research in marginal seats was "fundamentally wrong", which lead to resources and campaigners being diverted from marginal Liberal-held seats to "target "Labor" seats on the false assumption that "[the Liberal Party] had already won [Liberal held] seats".
Preferred Premier and satisfaction
References
2018 Victorian state election
2018 state election |
https://en.wikipedia.org/wiki/Opinion%20polling%20for%20the%202014%20Victorian%20state%20election | In the lead-up to the 2014 Victorian state election, a number of polling companies conducted regular opinion polls for various news organisations. These polls collected data on parties' primary vote, and contained an estimation of the two-party-preferred vote. They also asked questions about the electorates' views on major party leaders.
Graphical summary
Voting intention
Better Premier and satisfaction polling
Polling that is conducted by Newspoll and published in The Australian is conducted via random telephone number selection in city and country areas. Sampling sizes usually consist of around 1100–1200 electors. The declared margin of error is ±3 percentage points.
References
2014 Victorian state election
2014 state election |
https://en.wikipedia.org/wiki/Opinion%20polling%20for%20the%202010%20Victorian%20state%20election | In the lead-up to the 2010 Victorian state election, a number of polling companies conducted regular opinion polls for various news organisations. These polls collected data on parties' primary vote, and contained an estimation of the two-party-preferred vote. They also asked questions about the electorates' views on major party leaders.
Polling conducted by Newspoll and published in The Australian is performed via random telephone number selection in city and country areas. Sampling sizes usually consist of over 1000 electors, with the declared margin of error at ±3 percent.
Voting intention
Sky News exit polls in marginal seats recorded a Coalition 54-46 Labor result.
Leadership polling
References
2010 state election |
https://en.wikipedia.org/wiki/Opinion%20polling%20for%20the%202024%20Queensland%20state%20election | In the lead-up to the 2024 Queensland state election, a number of polling companies will conduct regular opinion polls for various news organisations. These polls will collect data on parties' primary vote, and will contain an estimation of the two-party-preferred vote. They will also ask questions about the electorates' views on major party leaders.
Voting intention
Some polls do not publish a two-party-preferred result. In these cases, the result has been manually calculated from preference flows at the 2020 election.
Preferred Premier and satisfaction
Preferred Premier
Satisfaction ratings
Notes
References
2024 state election |
https://en.wikipedia.org/wiki/Opinion%20polling%20for%20the%202020%20Queensland%20state%20election | In the lead-up to the 2020 Queensland state election, a number of polling companies conducted regular opinion polls for various news organisations. These polls collected data on parties' primary vote, and contained an estimation of the two-party-preferred vote. They also asked questions about the electorates' views on major party leaders.
Graphical summary
Voting intention
Better Premier and leadership approval
References
2020 state election |
https://en.wikipedia.org/wiki/Opinion%20polling%20for%20the%202017%20Queensland%20state%20election | In the lead-up to the 2017 Queensland state election, a number of polling companies conducted regular opinion polls for various news organisations. These polls collected data on parties' primary vote, and contained an estimation of the two-party-preferred vote. They also asked questions about the electorates' views on major party leaders.
Graphical summary
Voting intention
References
2017 state election |
https://en.wikipedia.org/wiki/Opinion%20polling%20for%20the%202015%20Queensland%20state%20election | In the lead-up to the 2015 Queensland state election, a number of polling companies conducted regular opinion polls for various news organisations. These polls collected data on parties' primary vote, and contained an estimation of the two-party-preferred vote. They also asked questions about the electorates' views on major party leaders.
Polling conducted by Newspoll and published in The Australian is conducted via random telephone number selection in city and country areas. Sampling sizes usually consist of around 1100–1200 electors. The declared margin of error is ±3 percentage points.
Graphical summary
Voting intention
Leadership polling
References
2015 state election |
https://en.wikipedia.org/wiki/Tribute%20%28sexual%20act%29 | A tribute, cum tribute, or hatewank is sexual activity that involves ejaculating on the picture of someone. Originating as an online sex game, this act has gained recent coverage for its use in cyberbullying as a way to spite, intimidate a victim or achieve sexual satisfaction over them with impunity.
Definition
A tribute consists in ejaculating on a portrait, and then recording the portrait and the semen together. Tributes often circulate in dedicated online communities composed of mostly of men. Sometimes, they take the form of a video, which are known hatewank or tribute videos depending on the context. Some tributes can feature men or random objects as targets. More commonly, the targets are women. Tributed individuals can range from celebrities, to semi-public individuals like journalists, to low-profile individuals like the tributer's partner. It can be considered as a form of fetish activity.
Origins
A 2022 Vice article frames tributes as a form bukkake by proxy as both portray multiple men ejaculating on one woman. The sexual practice of bukkake originates in 1980s Japan as an alternative sex act developed due to censorship of genitals in Japanese pornography.
As of 2006, the term was slang among porn actors. Back then, it was considered a form of online sex game. As with the general definition of tribute, the act involves the target, usually a woman, soliciting tribute images online and aims to get the most replies from men browsing.
Use for cyberbullying
Starting with the Gamergate controversy, tributes have gained notoriety as a way for male communities to spite female targets. In those contexts, the images are taken without consent from the target's social media. Victims have described feeling guilt after being subject to tributes. Cyberbullying through tributes seeks to shame the victim into going off social media and can be combined with other forms of harassment like doxing. Such tributes often occur in group settings with internal discussion involving mockery of the victim. The superficial homage given to such tributes conflicts with their knowingly non-consensual production. Target pictures are often taken from casual settings and casting them in an explicit way serves to cause further torment to the victim. Such media of the victims in a sexual setting can often not be practically removed from circulation.
Motive and sociological explanation
British law professor Clare McGlynn suggests that the search of social status and the need for bonding motivates men to participate in tribute communities. Non-consensual tributes are sometimes fueled by a desire to silence or degrade women that are in public life, or express a pro-feminist stance. Alternatively, non-consensual tributes are described as tool to satisfy sexual or fetishistic desires with impunity.
Legal challenges
As with deepfake pornography, non-consensual tributes are considered challenging to address legally since they are often created using publicly-ava |
https://en.wikipedia.org/wiki/Urbanke | Urbanke is a surname. Notable people with the surname include:
Bianca Urbanke (born 1967), German handball player
Rüdiger Urbanke (born 1966), Austrian computer scientist |
https://en.wikipedia.org/wiki/City%20of%20Media%20Arts | UNESCO's City of Media Arts project is part of the wider Creative Cities Network. The Network launched in 2004, and has member cities in seven creative fields. The other fields are: Crafts and Folk Art, Music, Film, Gastronomy, Literature, Media Arts and Design Cities.
The current designated Cities of Media Arts of UNESCO are:
See also
Creative Cities Network
City of Film
City of Gastronomy
City of Literature
City of Crafts and Folk Arts
City of Music (UNESCO)
Design Cities (UNESCO)
References
UNESCO
Lists of cities |
https://en.wikipedia.org/wiki/Simge%20K%C3%BC%C3%A7%C3%BCkyavuz | Simge Küçükyavuz is a Turkish-American industrial engineer whose research involves mathematical optimization, including mixed-integer programming and stochastic programming, and their applications in network design. She is David A. and Karen Richards Sachs Professor of Industrial Engineering and Management Sciences, and Chair of Industrial Engineering and Management Sciences, at Northwestern University.
Education and career
Küçükyavuz graduated from Middle East Technical University in Ankara in 1998, with a bachelor's degree in industrial engineering. She went to the University of California, Berkeley for graduate study in industrial engineering and operations research, earning a master's degree in 2000 and completing her Ph.D. in 2004. Her doctoral dissertation, Polyhedral Approaches to Capacitated Fixed-Charge Network Flow Problems, was supervised by Alper Atamturk.
She joined the University of Arizona Department of Systems and Industrial Engineering in 2004 as a visiting assistant professor, becoming a regular-rank assistant professor in 2006. She moved to Ohio State University in 2009, and was promoted to associate professor there in 2012. She became dean's associate professor at the University of Washington from 2016 to 2018, when she moved to Northwestern University. At Northwestern, she was promoted to full professor in 2021 and named as the David A. and Karen Richards Sachs Professor in 2023, in the same year becoming department chair.
Recognition
Küçükyavuz was a 2015 recipient of the Institute for Operations Research and the Management Sciences (INFORMS) Computing Society Prize. She was named as a Fellow of INFORMS, in the 2023 class of fellows, "for outstanding research in mixed-integer optimization and stochastic optimization, as well as distinguished service to, and leadership in, the profession".
References
External links
Home page
Year of birth missing (living people)
Living people
Turkish emigrants to the United States
Turkish industrial engineers
Turkish women academics
American industrial engineers
American women engineers
Middle East Technical University alumni
University of California, Berkeley alumni
University of Arizona faculty
Ohio State University faculty
University of Washington faculty
Northwestern University faculty
Fellows of the Institute for Operations Research and the Management Sciences |
https://en.wikipedia.org/wiki/ZP8396 | ZP8396 is an amylin analogue dosed once weekly, developed by Zealand Pharma for the treatment of type 2 diabetes and obesity. Preclinical data suggests it may be more effective in combination with semaglutide.
References
Amylin receptor agonists |
https://en.wikipedia.org/wiki/Val%C3%A1%C5%A1ek | Valášek is a surname. Notable people with the surname include:
Chris Valasek (born 1982), American computer security researcher
Jindřich Valášek (1886–1956), Czech footballer
Joseph Valasek (1897–1993), American physicist
Tomáš Valášek (born 1972), Slovak diplomat |
https://en.wikipedia.org/wiki/Juyang%20Weng | Juyang (John) Weng is a Chinese-American computer engineer, neuroscientist, author, and academic. He is a former professor at the Department of Computer Science and Engineering at Michigan State University and the President of Brain-Mind Institute and GENISAMA.
Weng has conducted research on grounded machine learning by intersecting computer science and engineering, with brain and cognitive science. In collaborative research efforts with his coworkers, he has explored mental architectures and computational models for autonomous development across various domains such as vision, audition, touch, behaviors, and motivational systems, both in biological and engineered systems. He has authored two books, Natural and Artificial Intelligence: Introduction to Computational Brain-Mind and Motion and Structure from Image Sequences, and is the editor of the book series 'New Frontiers in Robotics.' In addition, he has published over 300 articles.
Weng is a Life Fellow of the Institute of Electrical and Electronics Engineers (IEEE) and the Founder and President of the Brain-Mind Institute, and the startup GENISAMA. He is also the Founder and Editor-in-chief of the International Journal of Humanoid Robotics and the Brain-Mind Magazine and an Associate Editor of the IEEE Transactions on Autonomous Mental Development (now Cognitive and Developmental Systems). Additionally, he served as a Guest editor for five special issues, including What AI and Neuroscience Can Learn from Each Other: Open Problems in Models and Theories, Cognitive Computation, The Special Issue on Brain Imaging-informed Multimodal Analysis, IEEE Transactions on Autonomous Mental Development, and The Special Issue on Autonomous Mental Development, International Journal of Humanoid Robotics.
Education
Weng obtained his BS degree from Fudan University in 1982, followed by earning his M.Sc. and Ph.D. degrees in computer science from the University of Illinois at Urbana-Champaign in 1985 and 1989, respectively.
Career
Following his Ph.D., in 1990, Weng began his academic career as a visiting assistant research professor at the Beckman Institute of the University of Illinois, Urbana. From 1992 to 1998, he served as an assistant professor at Michigan State University, becoming associate professor in 1998 and professor in 2003.
Research
Weng's research revolves around grounded machine learning, spanning vision, audition, natural language understanding, planning, and real-time hardware implementations. He is also involved in technology transfer through his startup, GENISAMA, which focuses on grounded, emergent, natural, incremental, skull-closed, attentive, motivated, and abstract systems. His theoretical contributions include mathematically proving that Developmental Networks (DNs) he developed can learn any universal turing machines and establishing a theory on Autonomous Programming For General Purposes (APFGP), supporting Conscious Machine Learning.
Weng has worked on developmental networ |
https://en.wikipedia.org/wiki/Large%20object | Large object may refer to:
Binary large object, a collection of binary data stored as a single entity
Character large object, a collection of character data in a database management system |
https://en.wikipedia.org/wiki/Giveth | Giveth is a global fundraising platform in the Ethereum ecosystem that allows people to raise money in cryptocurrency for public goods projects, on five blockchains: Ethereum Mainnet, Polygon, Gnosis Chain, Celo, and Optimism.
Donors on Giveth are rewarded for using the platform when they donate to verified projects and receive between 50-80% of the value of their donation in return in GIV tokens, the native cryptocurrency of Giveth. A project becomes verified once it has submitted to a verification process that includes providing proof of its charitable nature.
Since 2017, over $3.5 million USD has been raised on Giveth, and approximately $750,000 has been rewarded to its donors.
History
Giveth was founded by members of The Robinhood Group and The White Hat Group including Griff Green and Jordi Baylina. The Robinhood Group was responsible for altruistically hacking and returning the funds from the unprecedented crypto hack of The DAO in July 2016. The Robinhood Group rescued over $208 million USD in crypto, refusing any donations for their work.
Green was community manager at The DAO at the time of the July 2016 hack, and orchestrated The DAO fund recovery in cooperation with Vitalik Buterin and the Ethereum Foundation. He had previously created a “course for DAO ninjas” that proved effective in supporting the recovery. Green was the first employee of Slock.it, the organization responsible for building The DAO and founding its legal entity (SARL) DAO.Link in Switzerland.
Green remains fully active at Giveth, and Jordi Baylina is still in part responsible for smart contract writing at Giveth. Green earned a Masters in Digital Currencies from the University of Nicosia in 2016, part of the first cohort to ever receive such a degree, with a focus on sharing economies.
Since 2018, Giveth participates in Burning Man each year in educating the public about the philanthropic and public goods value of crypto fundraising including introductions to what is blockchain and digital sovereignty at Camp Decentral.
Business Model
Individuals or collectives can freely create a project on Giveth and immediately begin raising and receiving funds. Projects must include contact information, a crypto wallet address where donations will be sent, project description, photos, and eventually updates.
Giveth is unique as a crowdfunding platform in that it does not touch or hold the funds that are donated, due to the nature of blockchain technology on which it is built. Donations move directly from the donor’s crypto wallet to the project’s crypto wallet without any intermediary such as a bank. The cryptocurrency is reflected (but not actually contained) in the crypto wallets and is decentrally stored on blockchain ledgers.
Giveth collects no fees from either donors or projects. Donors pay a “gas fee”, or crypto transaction fee, relative to the blockchain on which the donation is being made.
Based on the same non-traditional business model of transparency and |
https://en.wikipedia.org/wiki/Rainer%20M%C3%BChlhoff | Rainer Mühlhoff (born 1982) is a German philosopher, mathematician and full professor for ethics of artificial intelligence at Osnabrück University, Germany.
Career
Rainer Mühlhoff studied mathematics, theoretical physics and computer science at the Universities of Heidelberg, Münster and Leipzig. His thesis was on “Higher Spinfields on Curved Spacetimes”. Afterwards he continued his studies in philosophy, gender studies and German literature in Berlin. He earned a PhD in philosophy from Free University of Berlin in 2016 with a dissertation on affect theory after Spinoza and Foucault. His work, which focused on post-structuralism, continental philosophy and critical social theory, was supervised by Jan Slaby and Martin Saar. He then worked as a research fellow at the Free University of Berlin and at the Technical University of Berlin. In 2021 he became full professor for ethics of artificial intelligence at Osnabrück University. He holds the first professorship focused on the interdisciplinary field of “Ethics of Artificial Intelligence” in Germany.
In 2022, Mühlhoff was co-author of the data protection impact assessment of the German COVID-19 app “Corona-Warn-App”, which contributed in sparking a debate on the necessity and security of contact-tracing apps in Germany.
Research Focus
Mühlhoff’s research focuses on critical philosophy of digital media and social philosophy as well as ethics and critique of the digital society, big data and artificial intelligence. He has published works on privacy and data protection, intersectionality, and anti-discrimination in the context of digital technology and has an interdisciplinary approach. His philosophical approach is greatly influenced by post-structuralism and connects technology, power and subjectivity.
Positions
Human-Aided AI
Mühlhoff views machine learning systems as sociotechnical systems. According to his position, the commercial application of machine learning is structurally dependent on human participation. Unpaid labor by both users of AI systems and click workers are used by tech companies. When training AI models, media systems of human-computer interaction are deliberately designed in such a way that users produce data, like with CAPTCHAs. Current commercial AI systems would therefore not replace human intelligence but rather “capture” it.
Predictive Privacy
Mühlhoff is known for his works on data privacy in the context of artificial intelligence. In his works, he points at the societal consequences of “predictive analysis”, meaning the usage of machine learning models for the prediction of personal or unknown information about individuals: “One of the main concerns related to automated decision making based on PA [predictive analytics] is the potential contribution of this technology to stabilizing or even increasing social and economic inequalities and power differentials within societies“. According to Mühlhoff, privacy is endangered by this kind of AI applications, because |
https://en.wikipedia.org/wiki/2023%20AI%20Safety%20Summit | The 2023 Artificial Intelligence Safety Summit is an international conference discussing the safety and regulation of artificial intelligence. It is being held in Bletchley Park, Milton Keynes, United Kingdom, on 1–2 November 2023. It is the first ever global summit on Artificial Intelligence.
Background
Prime Minister of the United Kingdom Rishi Sunak has made AI one of the priorities of his government, announcing that the UK would host a global AI Safety conference in Autumn 2023.
Venue
Bletchley Park was a World War II codebreaking facility established by the British government on the site of a Victorian manor and is in the British city of Milton Keynes. It has played an important role in the history of computing, with some of the first modern computers being built at the facility. In preparation, Bletchley Park is closed to the public until 6 November.
Agenda
28 countries at the summit have issued an agreement known as the 'Bletchley Declaration', calling for international co-operation to manage the challenges and risks of artificial intelligence. Emphasis has been placed on regulating "Frontier AI", a term for the latest and most powerful AI systems. Concerns that have been raised at the summit include the potential use of AI for terrorism, criminal activity, and warfare, as well as existential risk posed to humanity as a whole.
Tech entrepreneur Elon Musk and Prime Minister Rishi Sunak are expected to do a live interview on AI Safety on 2 November.
President of the United States Joe Biden has signed an executive order requiring AI developers to share safety results with the US government.
Future
The next AI Safety Summit is expected to be hosted by South Korea in mid-2024, followed by France around late-2024.
Notable attendees
The following individuals are expected to attend the summit:
Rishi Sunak, Prime Minister of the United Kingdom
Kamala Harris, Vice President of the United States
Charles III, King of the United Kingdom (attending virtually)
Elon Musk, Owner of SpaceX, Tesla, Neuralink, and xAI
Ursula von der Leyen, President of the European Commission
Sam Altman, CEO of OpenAI
Nick Clegg, Former British Politician and President of Global Affairs at Meta Platforms
References
Artificial intelligence conferences
2023 conferences
November 2023 events in the United Kingdom
Bletchley Park |
https://en.wikipedia.org/wiki/NewTek | NewTek, Inc. is a San Antonio, Texasbased hardware and software company that produces live and post-production video tools and visual imaging software for personal computers. The company was founded in 1985 in Topeka, Kansas, United States, by Tim Jenison and Paul Montgomery. On April 1, 2019, it was announced that NewTek would be acquired by Vizrt.
Products
In 2005, NewTek introduced TriCaster, a product that merges live video switching, broadcast graphics, virtual sets, special effects, audio mixing, recording, social media publishing, and web streaming into an integrated, portable and compact appliance. TriCaster was announced at DEMO@15 and then launched at the National Association of Broadcasters (NAB) in 2005. At NAB 2006, NewTek announced TriCaster PRO, which introduced professional video, audio connections, and virtual sets (using proprietary NewTek LiveSet technology) to the TriCaster line.
At NAB 2007, NewTek introduced TriCaster STUDIO, the first TriCaster to support six cameras. At NAB 2008, NewTek introduced TriCaster BROADCAST, the first model to deliver SDI video and audio support. In early 2009, NewTek introduced 3PLAY, a portable multi-channel HD/SD slow-motion replay system. At NAB 2009, NewTek introduced TriCaster TCXD300, the first high-definition TriCaster. At NAB 2010, NewTek introduced TriCaster TCXD850, a 22-channel high-definition model in a rack mount form factor. The TCXD850 won four industry awards: the Winners Circle Award, STAR, Vidy, and Black Diamond awards from EventDV, TV Technology, Videography, and DV magazines, respectively, at NAB 2010.
In 2004, NewTek released the source code to some of their Amiga Platform products through DiscreetFX.
In 2015, NewTek announced the Network Device Interface (NDI®) protocol which allows applications and devices to transport high-quality, low-latency video over gigabit Ethernet networks. The protocol was available for public products starting in early 2016. In 2017, version 3 of the protocol was released, which adds multicast support and a high-efficiency mode called NDI-HX.
Company history
The company's first products included DigiView in 1986 and DigiPaint, both for the Commodore Amiga personal computer.
DigiView was the first full-color video digitizer and added slow-scan digitizing capabilities to the Amiga platform allowing images to be imported at low cost before modern image scanning technology was widely available. Consisting of an input module that allowed the connection of a standard black-and-white video camera (security cameras were popularly used), greyscale images could be captured to the Amiga. With the addition of a color wheel, full-color images could be captured by rotating the wheel's red, green, and blue segments in front of the lens and capturing the same image three times, once through each filter. This could be done manually or with a motorized accessory. The software combined the color information from the three images into one color image. Acco |
https://en.wikipedia.org/wiki/Authorization | Authorization or authorisation (see spelling differences) is the function of specifying access rights/privileges to resources, which is related to general information security and computer security, and to access control in particular. More formally, "to authorize" is to define an access policy. For example, human resources staff are normally authorized to access employee records and this policy is often formalized as access control rules in a computer system. During operation, the system uses the access control rules to decide whether access requests from (authenticated) consumers shall be approved (granted) or disapproved (rejected). Resources include individual files or an item's data, computer programs, computer devices and functionality provided by computer applications. Examples of consumers are computer users, computer software and other hardware on the computer.
Overview
Access control in computer systems and networks rely on access policies. The access control process can be divided into the following phases: policy definition phase where access is authorized, and policy enforcement phase where access requests are approved or disapproved. Authorization is the function of the policy definition phase which precedes the policy enforcement phase where access requests are approved or disapproved based on the previously defined authorizations.
Most modern, multi-user operating systems include role-based access control (RBAC) and thereby rely on authorization. Access control also uses authentication to verify the identity of consumers. When a consumer tries to access a resource, the access control process checks that the consumer has been authorized to use that resource. Authorization is the responsibility of an authority, such as a department manager, within the application domain, but is often delegated to a custodian such as a system administrator. Authorizations are expressed as access policies in some types of "policy definition application", e.g. in the form of an access control list or a capability, or a policy administration point e.g. XACML. On the basis of the "principle of least privilege": consumers should only be authorized to access whatever they need to do their jobs. Older and single user operating systems often had weak or non-existent authentication and access control systems.
"Anonymous consumers" or "guests", are consumers that have not been required to authenticate. They often have limited authorization. On a distributed system, it is often desirable to grant access without requiring a unique identity. Familiar examples of access tokens include keys, certificates and tickets: they grant access without proving identity.
Trusted consumers are often authorized for unrestricted access to resources on a system, but must be verified so that the access control system can make the access approval decision. "Partially trusted" and guests will often have restricted authorization in order to protect resources against improper acce |
https://en.wikipedia.org/wiki/Line%20drawing%20algorithm | In computer graphics, a line drawing algorithm is an algorithm for approximating a line segment on discrete graphical media, such as pixel-based displays and printers. On such media, line drawing requires an approximation (in nontrivial cases). Basic algorithms rasterize lines in one color. A better representation with multiple color gradations requires an advanced process, spatial anti-aliasing.
On continuous media, by contrast, no algorithm is necessary to draw a line. For example, cathode-ray oscilloscopes use analog phenomena to draw lines and curves.
List of line drawing algorithms
The following is a partial list of line drawing algorithms:
Naive algorithm
Digital Differential Analyzer (graphics algorithm) — Similar to the naive line-drawing algorithm, with minor variations.
Bresenham's line algorithm — optimized to use only additions (i.e. no division Multiplications); it also avoids floating-point computations.
Xiaolin Wu's line algorithm — can perform spatial anti-aliasing, appears "ropey" from brightness varying along the length of the line, though this effect may be greatly reduced by pre-compensating the pixel values for the target display's gamma curve, e.g. out = in ^ (1/2.4).
Gupta-Sproull algorithm
A naive line-drawing algorithm
The simplest method of screening is the direct drawing of the equation defining the line.
dx = x2 − x1
dy = y2 − y1
for x from x1 to x2 do
y = y1 + dy × (x − x1) / dx
plot(x, y)
It is here that the points have already been ordered so that .
This algorithm works just fine when (i.e., slope is less than or equal to 1), but if (i.e., slope greater than 1), the line becomes quite sparse with many gaps, and in the limiting case of , a division by zero exception will occur.
The naive line drawing algorithm is inefficient and thus, slow on a digital computer. Its inefficiency stems from the number of operations and the use of floating-point calculations. Algorithms such as Bresenham's line algorithm or Xiaolin Wu's line algorithm are preferred instead.
Gupta and Sproull algorithm
The Gupta-Sproull algorithm is based on Bresenham's line algorithm but adds antialiasing.
An optimized variant of the Gupta-Sproull algorithm can be written in pseudocode as follows:
DrawLine(x1, x2, y1, y2) {
x = x1;
y = y1;
dx = x2 − x1;
dy = y2 − y1;
d = 2 * dy − dx; // discriminator
// Euclidean distance of point (x,y) from line (signed)
D = 0;
// Euclidean distance between points (x1, y1) and (x2, y2)
length = sqrt(dx * dx + dy * dy);
sin = dx / length;
cos = dy / length;
while (x <= x2) {
IntensifyPixels(x, y − 1, D + cos);
IntensifyPixels(x, y, D);
IntensifyPixels(x, y + 1, D − cos);
x = x + 1
if (d <= 0) {
D = D + sin;
d = d + 2 * dy;
} else {
D = D + sin − cos;
d = d + 2 * (dy − dx);
y = y + 1;
|
https://en.wikipedia.org/wiki/Tar%20%28computing%29 | In computing, tar is a computer software utility for collecting many files into one archive file, often referred to as a tarball, for distribution or backup purposes. The name is derived from "tape archive", as it was originally developed to write data to sequential I/O devices with no file system of their own. The archive data sets created by tar contain various file system parameters, such as name, timestamps, ownership, file-access permissions, and directory organization. POSIX abandoned tar in favor of pax, yet tar sees continued widespread use.
History
The command-line utility was first introduced in the Version 7 Unix in January 1979, replacing the tp program (which in turn replaced "tap"). The file structure to store this information was standardized in POSIX.1-1988 and later POSIX.1-2001, and became a format supported by most modern file archiving systems. The tar command was abandoned in POSIX.1-2001 in favor of pax command, which was to support ustar file format; the tar command was indicated for withdrawal in favor of pax command at least since 1994.
Today, Unix-like operating systems usually include tools to support tar files, as well as utilities commonly used to compress them, such as xz, gzip, and bzip2.
The command has also been ported to the IBM i operating system.
BSD-tar has been included in Microsoft Windows since Windows 10 April 2018 Update, and there are otherwise multiple third party tools available to read and write these formats on Windows.
Rationale
Many historic tape drives read and write variable-length data blocks, leaving significant wasted space on the tape between blocks (for the tape to physically start and stop moving). Some tape drives (and raw disks) support only fixed-length data blocks. Also, when writing to any medium such as a file system or network, it takes less time to write one large block than many small blocks. Therefore, the tar command writes data in records of many 512 B blocks. The user can specify a blocking factor, which is the number of blocks per record. The default is 20, producing 10 KiB records.
File format
There are multiple tar file formats, including historical and current ones. Two tar formats are codified in POSIX: ustar and pax. Not codified but still in current use is the GNU tar format.
A tar archive consists of a series of file objects, hence the popular term tarball, referencing how a tarball collects objects of all kinds that stick to its surface. Each file object includes any file data, and is preceded by a 512-byte header record. The file data is written unaltered except that its length is rounded up to a multiple of 512 bytes. The original tar implementation did not care about the contents of the padding bytes, and left the buffer data unaltered, but most modern tar implementations fill the extra space with zeros. The end of an archive is marked by at least two consecutive zero-filled records. (The origin of tar's record size appears to be the 512-byte disk |
https://en.wikipedia.org/wiki/One-instruction%20set%20computer | A one-instruction set computer (OISC), sometimes referred to as an ultimate reduced instruction set computer (URISC), is an abstract machine that uses only one instructionobviating the need for a machine language opcode. With a judicious choice for the single instruction and given arbitrarily many resources, an OISC is capable of being a universal computer in the same manner as traditional computers that have multiple instructions. OISCs have been recommended as aids in teaching computer architecture and have been used as computational models in structural computing research. The first carbon nanotube computer is a 1-bit one-instruction set computer (and has only 178 transistors).
Machine architecture
In a Turing-complete model, each memory location can store an arbitrary integer, anddepending on the modelthere may be arbitrarily many locations. The instructions themselves reside in memory as a sequence of such integers.
There exists a class of universal computers with a single instruction based on bit manipulation such as bit copying or bit inversion. Since their memory model is finite, as is the memory structure used in real computers, those bit manipulation machines are equivalent to real computers rather than to Turing machines.
Currently known OISCs can be roughly separated into three broad categories:
Bit-manipulating machines
Transport triggered architecture machines
Arithmetic-based Turing-complete machines
Bit-manipulating machines
Bit-manipulating machines are the simplest class.
FlipJump
The FlipJump machine has 1 instruction, a;b - flips the bit a, then jumps to b. This is the most primitive OISC, but it's still useful. It can successfully do Math/Logic calculations, branching, pointers, and calling functions with the help of its standard library.
BitBitJump
A bit copying machine, called BitBitJump, copies one bit in memory and passes the execution unconditionally to the address specified by one of the operands of the instruction. This process turns out to be capable of universal computation (i.e. being able to execute any algorithm and to interpret any other universal machine) because copying bits can conditionally modify the code that will be subsequently executed.
Toga computer
Another machine, called the Toga Computer, inverts a bit and passes the execution conditionally depending on the result of inversion. The unique instruction is TOGA(a,b) which stands for TOGgle a And branch to b if the result of the toggle operation is true.
Multi-bit copying machine
Similar to BitBitJump, a multi-bit copying machine copies several bits at the same time. The problem of computational universality is solved in this case by keeping predefined jump tables in the memory.
Transport triggered architecture
Transport triggered architecture (TTA) is a design in which computation is a side effect of data transport. Usually, some memory registers (triggering ports) within common address space perform an assigned operation when the in |
https://en.wikipedia.org/wiki/List%20of%20mobile%20network%20operators | For a more comprehensive list of mobile phone operators, see Mobile country codes.
Terrestrial
This is a list of the world's thirty largest terrestrial mobile phone network operators measured by number of subscriptions.
Satellite based
This is a list of the world's five largest satellite phone network operators measured by number of subscribers.
By region
List of mobile network operators of the Americas
List of mobile network operators of the Asia Pacific region
List of mobile network operators of Europe
List of mobile network operators of the Middle East and Africa
See also
Comparison of mobile phone standards
List of sovereign states by number of broadband Internet subscriptions
List of countries by number of Internet users
List of countries by number of telephone lines in use
List of countries by smartphone penetration
List of multiple-system operators
List of telephone operating companies
For a more comprehensive list of mobile phone operators, see Mobile country codes.
Footnotes
References
External links
List of all mobile network operators in the World divided by country
For a more comprehensive list of mobile phone operators, see Mobile country codes. |
https://en.wikipedia.org/wiki/Cyberpunk%20%28role-playing%20game%29 | Cyberpunk is a tabletop role-playing game in the dystopian science fiction genre, written by Mike Pondsmith and first published by R. Talsorian Games in 1988. It is typically referred to by its second or fourth edition names, Cyberpunk 2020 and Cyberpunk Red, in order to distinguish it from the cyberpunk genre after which it is named.
Setting
Cyberpunk exists within its own fictional timeline, which splits from the real world in the 1980s. The timeline has been extended with each major edition of the game, from the first edition set in 2013 to Cyberpunk Red set in 2045.
The backstory for Cyberpunk begins with the United States becoming embroiled in a major conflict in Central America in the 1980s. This conflict ends in a military coup and causes a significant economic collapse. As a result, the Soviet Union is itself preserved from collapse, and the European Common Market and Japan emerge as global superpowers. In tandem with economic collapse, other disasters have wreaked havoc across the globe, including food blights and devastating famines, as well as the destruction of entire regions of land as a consequence of war. By the late 1990s, the Middle East has become a radioactive desert in the fallout of nuclear conflict.
With the lack of government and police enforcement due to the Central American wars and subsequent economic collapse, casual violence has become endemic in many parts of the world. At the same time, megacorporations have risen to power and fight amongst themselves for dominance, and orbital habitats have begun to develop and form into independent states, both causes and symptoms of the increasing fracturing of civilization. Bioengineering, against a backdrop of warfare, has resulted in the rapid development of cybernetic prosthetics and direct human-machine interfaces, and many now suffer from "technoshock," an inability to cope with a world of synthetic muscle tissue, organic circuits, and designer drugs.
The main location for Cyberpunk is the fictional Night City, situated on the West Coast of the United States between Los Angeles and San Francisco. With a population of five million, it presents a stratified society of gang warfare, corporate rivalries, and political machinations in which the players must survive.
System
The rules of Cyberpunk are built on R. Talsorian's Interlock system.
A core game mechanic is the concept of Difficulty Values, used to gauge whether a player succeeds or fails at any given task. A player takes the value of their most appropriate character attribute, adds the values of any relevant skills or modifiers, and then finally adds the value of a ten-sided die roll. In order to succeed, they must beat the Difficulty Value assigned to the task by the gamemaster. Cyberpunk was one of the first tabletop games to use this concept.
Character creation
As cyberpunks, the players embrace body modification, cybertech and bioengineering. They live by four tenets:
Style over substance.
Attitude is everyt |
https://en.wikipedia.org/wiki/JDO | JDO may refer to:
Java Data Objects
Jewish Defense Organization
the IATA code for Juazeiro do Norte Airport |
https://en.wikipedia.org/wiki/Turtle%20graphics | In computer graphics, turtle graphics are vector graphics using a relative cursor (the "turtle") upon a Cartesian plane (x and y axis). Turtle graphics is a key feature of the Logo programming language.
Overview
The turtle has three attributes: a location, an orientation (or direction), and a pen. The pen, too, has attributes: color, width, and on/off state (also called down and up).
The turtle moves with commands that are relative to its own position, such as "move forward 10 spaces" and "turn left 90 degrees". The pen carried by the turtle can also be controlled, by enabling it, setting its color, or setting its width. A student could understand (and predict and reason about) the turtle's motion by imagining what they would do if they were the turtle. Seymour Papert called this "body syntonic" reasoning.
A full turtle graphics system requires control flow, procedures, and recursion: many turtle drawing programs fall short. From these building blocks one can build more complex shapes like squares, triangles, circles and other composite figures. The idea of turtle graphics, for example is useful in a Lindenmayer system for generating fractals.
Turtle geometry is also sometimes used in graphics environments as an alternative to a strictly coordinate-addressed graphics system.
History
Turtle graphics are often associated with the Logo programming language. Seymour Papert added support for turtle graphics to Logo in the late 1960s to support his version of the turtle robot, a simple robot controlled from the user's workstation that is designed to carry out the drawing functions assigned to it using a small retractable pen set into or attached to the robot's body. Turtle geometry works somewhat differently from (x,y) addressed Cartesian geometry, being primarily vector-based (i.e. relative direction and distance from a starting point) in comparison to coordinate-addressed systems such as bitmaps or raster graphics. As a practical matter, the use of turtle geometry instead of a more traditional model mimics the actual movement logic of the turtle robot. The turtle is traditionally and most often represented pictorially either as a triangle or a turtle icon (though it can be represented by any icon).
Today, the Python programming language's standard library includes a Turtle graphics module. Like its Logo predecessor, the Python implementation of turtle allows programmers to control one or more turtles in a two-dimensional space. Since the standard Python syntax, control flow, and data structures can be used alongside the turtle module, turtle has become a popular way for programmers learning Python to familiarize themselves with the basics of the language.
Extension to three dimensions
The ideas behind turtle graphics can be extended to include three-dimensional space. This is achieved by using one of several different coordinate models. A common setup is cartesian-rotational as with the original 2D turtle: an additional "up" vector (normal |
https://en.wikipedia.org/wiki/Windowing%20system | In computing, a windowing system (or window system) is a software suite that manages separately different parts of display screens. It is a type of graphical user interface (GUI) which implements the WIMP (windows, icons, menus, pointer) paradigm for a user interface.
Each currently running application is assigned a usually resizable and usually rectangular surface of the display to present its GUI to the user; these windows may overlap each other, as opposed to a tiling interface where they are not allowed to overlap. Usually a window decoration is drawn around each window. The programming of both the window decoration and of available widgets inside of the window, which are graphical elements for direct user interaction, such as sliders, buttons, etc., is eased and simplified through the use of widget toolkits.
Technical details
The main component of any windowing system is usually called the display server, although alternative denominations such as window server or compositor are also in use. Any application that runs and presents its GUI in a window, is a client of the display server. The display server and its clients communicate with each other over an application programming interface (API) or a communications protocol, which is usually called display server protocol, the display server being the mediator between the clients and the user. It receives all the input from the kernel, that the kernel receives from all attached input devices, such as keyboard, pointing devices, or touchscreen and transmits it to the correct client. The display server is also responsible for the output of the clients to the computer monitor. The output of sound is usually not managed by the display server, but the sound volume is usually handled through GUI applets and it is the display server who decides which applications are on top. A windowing system enables the computer user to work with several programs at the same time. Each program presents its GUI in its own window, which is generally a rectangular area of the screen.
From a programmer's point of view, a windowing system implements graphical primitives. For example: rendering fonts or drawing a line on the screen. It provides an abstraction of the graphics hardware for use by higher-level elements of the graphical interface such as a window manager.
A display server protocol can be network capable or even network transparent, facilitating the implementation of thin clients.
Display server
A display server or window server is a program whose primary task is to coordinate the input and output of its clients to and from the rest of the operating system, the hardware, and each other. The display server communicates with its clients over the display server protocol, a communications protocol, which can be network-transparent or simply network-capable.
The display server is a key component in any graphical user interface, specifically the windowing system.
The server/client relationship of a standal |
https://en.wikipedia.org/wiki/TWAIN | TWAIN and TWAIN Direct are application programming interfaces (APIs) and communication protocols that regulate communication between software and digital imaging devices, such as image scanners and digital cameras. TWAIN is supported on Microsoft Windows, Linux and Mac OS X.
The three key elements of TWAIN are:
Application software. For example, graphics software, a fax application or a word processor.
Source manager software. The source manager software is a software library provided by the TWAIN Working Group.
Device drivers (referred to as "Source software" in the specification document)
Both the application and the device driver must support TWAIN for the interface to be successfully used.
The first release was in 1992,
and it was last updated in 2021.
It was designed with the help of a number of companies from the computer industry, to try to establish a unified standard connection interface between computers and imaging devices.
History
The design of TWAIN began in January 1991. The TWAIN group was originally launched in 1992 by several members of the imaging industry, with the intention of standardizing communication between image handling software and hardware. Review of the original TWAIN Developer's Toolkit occurred from April, 1991 through January, 1992.
On September 19, 2019, the TWAIN Working Group announced TWAIN Direct 1.0 which is a RESTful API version of the TWAIN specification.
Name origin
The word TWAIN is not officially an acronym, but it is a backronym. The official website notes that "the word TWAIN is from Kipling's "The Ballad of East and West" — '...and never the twain shall meet...' — reflecting the difficulty, at the time, of connecting scanners and personal computers.
It was up-cased to TWAIN to make it more distinctive. This led people to believe it was an acronym, and then to a contest to come up with an expansion. None was selected, but the entry Technology Without an Interesting Name continues to haunt the standard. For example, the Encyclopedia of Information Technology lists "Technology Without an Interesting Name" as the official meaning of TWAIN.
Objectives
Objectives of the TWAIN Working Group and standard include:
Ensure image-handling software and hardware compatibility
Keep the specification current with the state of current software and hardware while maintaining backward compatibility
Provide multiple-platform support
Maintain and distribute a no-charge developer's toolkit
Ensure ease of implementation
Encourage widespread adoption
Open Source Data Source Manager
LGPL Open Source License
BSD Open Source Sample Application and Sample Data Source Application
TWAIN provides support for:
Production, high-speed scanning
ICC Color profiles
Digital cameras
Multiple operating system platforms including Windows, classic Mac OS, macOS, and Linux
TWAIN Working Group
Today the TWAIN standard, including the specification, data source manager and sample code, are mainta |
https://en.wikipedia.org/wiki/S-100%20bus | The S-100 bus or Altair bus, IEEE 696-1983 (withdrawn), is an early computer bus designed in 1974 as a part of the Altair 8800. The bus was the first industry standard expansion bus for the microcomputer industry. computers, consisting of processor and peripheral cards, were produced by a number of manufacturers. The bus formed the basis for homebrew computers whose builders (e.g., the Homebrew Computer Club) implemented drivers for CP/M and MP/M. These microcomputers ran the gamut from hobbyist toy to small business workstation and were common in early home computers until the advent of the IBM PC.
Architecture
The bus is a passive backplane of 100-pin printed circuit board edge connectors wired in parallel. Circuit cards measuring 5 × 10-inches serving the functions of CPU, memory, or I/O interface plugged into these connectors. The bus signal definitions closely follow those of an 8080 microprocessor system, since the Intel 8080 microprocessor was the first microprocessor hosted on the bus. The 100 lines of the bus can be grouped into four types: 1) Power, 2) Data, 3) Address, and 4) Clock and control.
Power supplied on the bus is bulk unregulated +8 Volt DC and ±16 Volt DC, designed to be regulated on the cards to +5 V (used by TTL ICs), -5 V and +12 V for Intel 8080 CPU IC, ±12 V RS-232 line driver ICs, +12 V for disk drive motors. The onboard voltage regulation is typically performed by devices of the 78xx family (for example, a 7805 device to produce +5 volts). These were linear regulators which are commonly mounted on heat sinks.
The bi-directional 8-bit data bus of the Intel 8080 is split into two unidirectional 8-bit data buses. The processor could use only one of these at a time. The Sol-20 used a variation that had only a single 8-bit bus and used the now-unused pins as signal grounds to reduce electronic noise. The direction of the bus, in or out, was signaled using the otherwise unused DBIN pin. This became universal in the market as well, making the second bus superfluous. Later, these two 8-bit buses would be combined to support a 16-bit data width for more advanced processors, using the Sol's system to signal the direction.
The address bus is 16-bits wide in the initial implementation and later extended to 24-bits wide. A bus control signal can put these lines in a tri-state condition to allow direct memory access. The Cromemco Dazzler, for example, is an early card that retrieved digital images from memory using direct memory access.
Clock and control signals are used to manage the traffic on the bus. For example, the DO Disable line will tristate the address lines during direct memory access. Unassigned lines of the original bus specification were later assigned to support more advanced processors. For example, the Zilog Z-80 processor has a non-maskable interrupt line that the Intel 8080 processor does not. One unassigned line of the bus then was reassigned to support the non-maskable interrupt request.
Hist |
https://en.wikipedia.org/wiki/Inter-process%20communication | In computer science, inter-process communication (IPC), also spelled interprocess communication, are the mechanisms provided by an operating system for processes to manage shared data. Typically, applications can use IPC, categorized as clients and servers, where the client requests data and the server responds to client requests. Many applications are both clients and servers, as commonly seen in distributed computing.
IPC is very important to the design process for microkernels and nanokernels, which reduce the number of functionalities provided by the kernel. Those functionalities are then obtained by communicating with servers via IPC, leading to a large increase in communication when compared to a regular monolithic kernel. IPC interfaces generally encompass variable analytic framework structures. These processes ensure compatibility between the multi-vector protocols upon which IPC models rely.
An IPC mechanism is either synchronous or asynchronous. Synchronization primitives may be used to have synchronous behavior with an asynchronous IPC mechanism.
Approaches
Different approaches to IPC have been tailored to different software requirements, such as performance, modularity, and system circumstances such as network bandwidth and latency.
Applications
Remote procedure call interfaces
Java's Remote Method Invocation (RMI)
ONC RPC
XML-RPC or SOAP
JSON-RPC
Message Bus (Mbus) (specified in RFC 3259) (not to be confused with M-Bus)
.NET Remoting
gRPC
Platform communication stack
The following are messaging, and information systems that utilize IPC mechanisms but don't implement IPC themselves:
KDE's Desktop Communications Protocol (DCOP) deprecated by D-Bus
D-Bus
OpenWrt uses ubus micro bus architecture
MCAPI Multicore Communications API
SIMPL The Synchronous Interprocess Messaging Project for Linux (SIMPL)
9P (Plan 9 Filesystem Protocol)
Distributed Computing Environment (DCE)
Thrift
ZeroC's Internet Communications Engine (ICE)
ØMQ
Enduro/X Middleware
YAMI4
Enlightenment_(software) E16 uses eesh as an IPC
Operating system communication stack
The following are platform or programming language-specific APIs:
Apple Computer's Apple events, previously known as Interapplication Communications (IAC)
ARexx ports
Enea's LINX for Linux (open source) and various DSP and general-purpose processors under OSE
The Mach kernel's Mach Ports
Microsoft's ActiveX, Component Object Model (COM), Microsoft Transaction Server (COM+), Distributed Component Object Model (DCOM), Dynamic Data Exchange (DDE), Object Linking and Embedding (OLE), anonymous pipes, named pipes, Local Procedure Call, MailSlots, Message loop, MSRPC, .NET Remoting, and Windows Communication Foundation (WCF)
Novell's SPX
POSIX mmap, message queues, semaphores, and shared memory
RISC OS's messages
Solaris Doors
System V's message queues, semaphores, and shared memory
Linux Transparent Inter Process Communication (TIPC)
OpenBinder Open binder
QNX's PPS |
https://en.wikipedia.org/wiki/CCG |
CCG may refer to:
Coast guards
Canadian Coast Guard
China Coast Guard
Companies
Chemical Computing Group, a Canadian pharmaceutical software company
Entertainment
Collectible card game
Command & Conquer: Generals, a 2003 video game
Community-controlled game, a video game genre
Electronics
Copper Control Gear (CCG), a type of Electrical ballast Switch Start for lighting, alternative to ECG (Electronic Control Gear) Electronic.
Other
Castor Cracking Group, a demo (computer art) group
Center for China and Globalization, a think tank in China
Centre for Computational Geography, University of Leeds, England
Children's Cancer Study Group, conducted cancer research
Clinical commissioning group, commissioners of many health services in England
Combinatory categorial grammar, a grammar formalism
Computational Chemistry Grid
Country commercial guides, reports from the United States Commercial Service
County Cricket Ground (disambiguation)
Cross-correlogram, a statistical plotting technique
Commission of Counter Ghoul, a fictional organization in the manga series Tokyo Ghoul
CCG, a codon for the amino acid proline
Climate Compatible Growth, a research-based programme funded by the United Kingdom Foreign, Commonwealth and Development Office |
https://en.wikipedia.org/wiki/Passphrase | A passphrase is a sequence of words or other text used to control access to a computer system, program or data. It is similar to a password in usage, but a passphrase is generally longer for added security. Passphrases are often used to control both access to, and the operation of, cryptographic programs and systems, especially those that derive an encryption key from a passphrase. The origin of the term is by analogy with password. The modern concept of passphrases is believed to have been invented by Sigmund N. Porter in 1982.
Security
Considering that the entropy of written English is less than 1.1 bits per character, passphrases can be relatively weak. NIST has estimated that the 23-character passphrase "IamtheCapitanofthePina4" contains a 45-bit strength. The equation employed here is:
4 bits (1st character) + 14 bits (characters 2–8) + 18 bits (characters 9–20) + 3 bits (characters 21–23) + 6 bits (bonus for upper case, lower case, and alphanumeric) = 45 bits
(This calculation does not take into account that this is a well-known quote from the operetta H.M.S. Pinafore. An MD5 hash of this passphrase can be cracked in 4 seconds using crackstation.net, indicating that the phrase is found in password cracking databases.)
Using this guideline, to achieve the 80-bit strength recommended for high security (non-military) by NIST, a passphrase would need to be 58 characters long, assuming a composition that includes uppercase and alphanumeric.
There is room for debate regarding the applicability of this equation, depending on the number of bits of entropy assigned. For example, the characters in five-letter words each contain 2.3 bits of entropy, which would mean only a 35-character passphrase is necessary to achieve 80 bit strength.
If the words or components of a passphrase may be found in a language dictionary—especially one available as electronic input to a software program—the passphrase is rendered more vulnerable to dictionary attack. This is a particular issue if the entire phrase can be found in a book of quotations or phrase compilations. However, the required effort (in time and cost) can be made impracticably high if there are enough words in the passphrase and if they are randomly chosen and ordered in the passphrase. The number of combinations which would have to be tested under sufficient conditions make a dictionary attack so difficult as to be infeasible. These are difficult conditions to meet, and selecting at least one word that cannot be found in any dictionary significantly increases passphrase strength.
If passphrases are chosen by humans, they are usually biased by the frequency of particular words in natural language. In the case of four word phrases, actual entropy rarely exceeds 30 bits. On the other hand, user-selected passwords tend to be much weaker than that, and encouraging users to use even 2-word passphrases may be able to raise entropy from below 10 bits to over 20 bits.
For example, the widely used crypt |
https://en.wikipedia.org/wiki/Futurebus | Futurebus, or IEEE 896, is a computer bus standard, intended to replace all local bus connections in a computer, including the CPU, memory, plug-in cards and even, to some extent, LAN links between machines. The effort started in 1979 and didn't complete until 1987, and then immediately went into a redesign that lasted until 1994. By this point, implementation of a chip-set based on the standard lacked industry leadership. It has seen little real-world use, although custom implementations continue to be designed and used throughout industry.
History
In the late 1970s, VMEbus was faster than the parts plugged into it. It was quite reasonable to connect a CPU and RAM to VME on separate cards to build a computer. However, as the speed of the CPUs and RAM rapidly increased, VME was quickly overwhelmed. Increasing the speed of VME was not easy, because all of the parts plugged into it would have to be able to support these faster speeds as well.
Futurebus looked to fix these problems and create a successor to systems like VMEbus with a system that could grow in speed without affecting existing devices. In order to do this the primary technology of Futurebus was built using asynchronous links, allowing the devices plugged into it to talk at whatever speed they wished. Another problem that needed to be addressed was the ability to have several cards in the system as "masters", allowing Futurebus to build multiprocessor machines. This required some form of "distributed arbitration" to allow the various cards to gain access to the bus at any point, as opposed to VME, which put a single master in slot 0 with overall control. In order to have a clear performance benefit, Futurebus was designed to have the performance needed ten years in the future.
Typical IEEE standards start with a company building a device, and then submitting it to the IEEE for the standardization effort. In the case of Futurebus this was reversed, the whole system was being designed during the standardization effort. This proved to be its downfall. As companies came to see Futurebus as the system, they all joined in. Soon the standards meetings had hundreds of people attending, all of them demanding that their particular needs and wants be included. As the complexity grew, the standards process slowed. In the end it took eight long years before the specification was finally agreed on in 1987. Tektronix did make a few workstations based on Futurebus. American Logic Machines (ALM) continues to build end to end system Futurebus hybrid solutions, including VME-to-Futurebus+ and other Bus-to-Futurebus bridge technologies.
That was just in time for the US Navy who had been looking for a new high-speed system for the Next Generation Computer Resources (NGCR) project for passing sonar data around in their newly designed Seawolf-class submarines, and they said they would standardize on Futurebus if only a few more changes would be made. Seeing a potential massive government buy, the additi |
https://en.wikipedia.org/wiki/QuickRing | QuickRing was a gigabit-rate interconnect that combined the functions of a computer bus and a network. It was designed at Apple Computer as a multimedia system to run "on top" of existing local bus systems inside a computer, but was later taken over by National Semiconductor and repositioned as an interconnect for parallel computing. It appears to have seen little use in either role, and is no longer being actively worked on. However it appears to have been an inspiration for other more recent technologies, such as HyperTransport.
History
QuickRing started as an offshoot of the fabled Futurebus project, which started in the late 1970s under the aegis of the IEEE. The Futurebus process quickly bogged down, and concluding it was doomed, several of the main designers left the effort in 1987 to try again on smaller projects, leading to both QuickRing and SCI. In the case of QuickRing the main proponent was Paul Sweazey of National Semiconductor, who had hosted Futurebus's cache coherency group. Sweazey left National Semiconductor and moved to Apple Computer's Advanced Technology Group, where the new system was developed.
The system was first announced publicly at the 1992 Worldwide Developers Conference, positioned primarily as a secondary bus for computer systems to carry multiple streams of digital video without using the existing backplane bus. Apple was particularly interested in this role due to the limitations of their current NuBus systems in terms of speed. They envisioned various video cards using a second connector located near the top of the card, opposite the NuBus connector on the bottom, to talk to each other. Optionally, one of the cards would produce compressed output, which could be sent over the NuBus for storage or display. Before any commercial use of QuickRing, newer versions of PCI started appearing that offered performance close enough to QuickRing to make its role redundant. Apple switched to an all-PCI based computer lineup starting in 1995, and in one of their general downsizings in the early 90s, Apple dropped their funding for QuickRing.
Sweazey moved back to National Semiconductor, who positioned QuickRing as a high-speed interconnect. Here it had little better luck, competing against SCI on one hand, and ever-faster versions of Ethernet on the other. Efforts were made to standardize QuickRing inside the existing VMEbus system using some redundant pins in response to an industry effort to standardize parallel processing hardware, but nothing ever came of this. The US Navy announced several tenders for QuickRing products for sonar data processing (for which they had originally had Futurebus+ developed), but it is unclear whether or not it was actually used in this role. National eventually lost interest, and the system essentially disappeared in 1996. Similar products, notably SKYconnect and Raceway, were also standardized in this role, but seem to have seen little use as well.
Description
The basic QuickRing syste |
https://en.wikipedia.org/wiki/Z3%20%28computer%29 | The Z3 was a German electromechanical computer designed by Konrad Zuse in 1938, and completed in 1941. It was the world's first working programmable, fully automatic digital computer. The Z3 was built with 2,600 relays, implementing a 22-bit word length that operated at a clock frequency of about 5–10 Hz. Program code was stored on punched film. Initial values were entered manually.
The Z3 was completed in Berlin in 1941. It was not considered vital, so it was never put into everyday operation. Based on the work of the German aerodynamics engineer Hans Georg Küssner (known for the Küssner effect), a "Program to Compute a Complex Matrix" was written and used to solve wing flutter problems. Zuse asked the German government for funding to replace the relays with fully electronic switches, but funding was denied during World War II since such development was deemed "not war-important".
The original Z3 was destroyed on 21 December 1943 during an Allied bombardment of Berlin. That Z3 was originally called V3 (Versuchsmodell 3 or Experimental Model 3) but was renamed so that it would not be confused with Germany's V-weapons. A fully functioning replica was built in 1961 by Zuse's company, Zuse KG, which is now on permanent display at Deutsches Museum in Munich.
The Z3 was demonstrated in 1998 to be, in principle, Turing-complete. However, because it lacked conditional branching, the Z3 only meets this definition by speculatively computing all possible outcomes of a calculation.
Thanks to this machine and its predecessors, Konrad Zuse has often been suggested as the inventor of the computer.
Design and development
Zuse designed the Z1 in 1935 to 1936 and built it from 1936 to 1938. The Z1 was wholly mechanical and only worked for a few minutes at a time at most. Helmut Schreyer advised Zuse to use a different technology. As a doctoral student at the Berlin Institute of Technology in 1937 he worked on the implementation of Boolean operations and (in today's terminology) flip-flops on the basis of vacuum tubes. In 1938, Schreyer demonstrated a circuit on this basis to a small audience, and explained his vision of an electronic computing machine – but since the largest operational electronic devices contained far fewer tubes this was considered practically infeasible. In that year when presenting the plan for a computer with 2,000 electron tubes, Zuse and Schreyer, who was an assistant at Telecommunication Institute at the Technical University of Berlin, were discouraged by members of the institute who knew about the problems with electron tube technology. Zuse later recalled: "They smiled at us in 1939, when we wanted to build electronic machines ... We said: The electronic machine is great, but first the components have to be developed." In 1940, Zuse and Schreyer managed to arrange a meeting at the Oberkommando der Wehrmacht (OKW) to discuss a potential project for developing an electronic computer, but when they estimated a duration of two or th |
https://en.wikipedia.org/wiki/Line%20editor | In computing, a line editor is a text editor in which each editing command applies to one or more complete lines of text designated by the user. Line editors predate screen-based text editors and originated in an era when a computer operator typically interacted with a teleprinter (essentially a printer with a keyboard), with no video display, and no ability to move a cursor interactively within a document. Line editors were also a feature of many home computers, avoiding the need for a more memory-intensive full-screen editor.
Line editors are limited to typewriter keyboard text-oriented input and output methods. Most edits are a line-at-a-time. Typing, editing, and document display do not occur simultaneously. Typically, typing does not enter text directly into the document. Instead, users modify the document text by entering these commands on a text-only terminal. Commands and text, and corresponding output from the editor, will scroll up from the bottom of the screen in the order that they are entered or printed to the screen. Although the commands typically indicate the line(s) they modify, displaying the edited text within the context of larger portions of the document requires a separate command.
Line editors keep a reference to the "current line" to which the entered commands usually are applied. In contrast, modern screen based editors allow the user to interactively and directly navigate, select, and modify portions of the document. Generally line numbers or a search based context (especially when making changes within lines) are used to specify which part of the document is to be edited or displayed.
Early line editors included Expensive Typewriter and QED. Both pre-dated the advent of Unix; the former two ran on DEC PDP-1's, while the latter was a Unisys product. Unix systems offer both ed and ex, the latter typically as a specialized mode of a full-screen editor. For the first 10 years of the IBM PC, the only editor provided in DOS was the Edlin line editor.
Line editors are still used non-interactively in shell scripts and when dealing with failing operating systems. Update systems such as patch traditionally used diff data converted into a script of ed commands. They are also used in many MUD systems, though many people edit text on their own computer using MUD's download and upload features. |
https://en.wikipedia.org/wiki/BESK | BESK (Binär Elektronisk SekvensKalkylator, Swedish for "Binary Electronic Sequence Calculator") was Sweden's first electronic computer, using vacuum tubes instead of relays. It was developed by Matematikmaskinnämnden (Swedish Board for Computing Machinery) and for a short time it was the fastest computer in the world. The computer was completed in 1953 and in use until 1966. The technology behind BESK was later continued with the transistorized FACIT EDB and FACIT EDB-3 machines, both software compatible with BESK. Non-compatible machines highly inspired by BESK were SMIL made for the University of Lund, SAABs räkneautomat SARA, "SAAB's calculating machine", and DASK made in Denmark.
BESK was developed by the Swedish Board for Computing Machinery (Matematikmaskinnämnden) a few years after the mechanical relay computer BARK (Binär Aritmetisk Relä-Kalkylator, Swedish for "Binary Arithmetic Relay Calculator"). The team was initially led by Conny Palm, who died in December 1951, after which Stig Comét took over. The hardware was developed by Erik Stemme. Gösta Neovius and Olle Karlqvist were responsible for architecture and instruction set. It was closely modeled on the IAS machine for which the design team had retrieved drawings during a scholarship to Institute for Advanced Study (IAS) and Massachusetts Institute of Technology, U.S.
During the development of the BESK magnetic drum memory, Olle Karlqvist discovered a magnetic phenomenon, which has been called the Karlqvist gap.
Performance
BESK was a 40-bit machine; it could perform an addition in 56 μs and a multiplication took 350 μs. The electrostatic memory could store 512 words. The instruction length was 20 bits, so each word could store two instructions. BESK contained 2400 "radio tubes" (vacuum tubes) and 400 germanium diodes (so it was partly solid state). The power consumption was 15 kVA.
Initially an average runtime of 5 minutes was achieved before hardware problems appeared. In 1954 the system became more stable. Breakpoints were introduced to allow software restart after hardware failures.
Originally BESK had a British Williams tube 512 word x 40 bit memory based on 40 cathode tubes, and eight spare tubes. The memory was from the beginning found to be insufficient and Carl-Ivar Bergman was given just a few weeks to build and install a ferrite core memory in 1956. To complete the work before the deadline they hired housewives with knitting experience to make the memory. One of the new memory bits did not work at first, but it was easily cut out and replaced.
Usage
BESK was inaugurated on 1 April 1954 and handled weather data for Carl-Gustaf Rossby and the Swedish Meteorological and Hydrological Institute, statistics for the telecommunications service provider Televerket, wing profiles for the attack aircraft Saab Lansen, and road profiles for the road authority Vägverket. During the nights Swedish National Defence Radio Establishment (FRA) used BESK for cracking encryption of radi |
https://en.wikipedia.org/wiki/BARK%20%28computer%29 | BARK () was an early electromechanical computer. BARK was built using standard telephone relays, implementing a 32-bit binary machine. It could perform addition in 150 ms and multiplication in 250 ms. It had a memory with 50 registers and 100 constants. It was later expanded to double the memory. Howard Aiken stated in reference to BARK "This is the first computer I have seen outside Harvard that actually works."
History
BARK was developed by Matematikmaskinnämnden (Swedish Board for Computing Machinery) a few years before BESK. The machine was built with 8,000 standard telephone relays, 80 km of cable and with 175,000 soldering points. Programming was done by plugboard. It was completed in February 1950 at a cost of 400,000 Swedish kronor (less than $100,000), became operational on April 28, 1950, and was taken offline on September 22, 1954. The engineers on the team led by Conny Palm were Harry Freese, Gösta Neovius, Olle Karlqvist, Carl-Erik Fröberg, G. Kellberg, Björn Lind, Arne Lindberger, P. Petersson and Madeline Wallmark.
See also
BESK - Binär Elektronisk Sekvens-Kalkylator - Sweden's second computer.
Elsa-Karin Boestad-Nilsson, a programmer on BARK and BESK
SMIL - SifferMaskinen I Lund (The Number Machine in Lund)
History of computing hardware
References
External links
Tekn. lic. Olle Karlqvist in memoriam (in Swedish), Google translation, memorial site of one of the engineers behind BARK and BESK. On BARK page there's a technical pdf document (in English): The BARK, A Swedish General Purpose Relay Computer
One-of-a-kind computers
Electro-mechanical computers
Science and technology in Sweden |
https://en.wikipedia.org/wiki/General%20number%20field%20sieve | In number theory, the general number field sieve (GNFS) is the most efficient classical algorithm known for factoring integers larger than . Heuristically, its complexity for factoring an integer (consisting of bits) is of the form
in O and L-notations. It is a generalization of the special number field sieve: while the latter can only factor numbers of a certain special form, the general number field sieve can factor any number apart from prime powers (which are trivial to factor by taking roots).
The principle of the number field sieve (both special and general) can be understood as an improvement to the simpler rational sieve or quadratic sieve. When using such algorithms to factor a large number , it is necessary to search for smooth numbers (i.e. numbers with small prime factors) of order . The size of these values is exponential in the size of (see below). The general number field sieve, on the other hand, manages to search for smooth numbers that are subexponential in the size of . Since these numbers are smaller, they are more likely to be smooth than the numbers inspected in previous algorithms. This is the key to the efficiency of the number field sieve. In order to achieve this speed-up, the number field sieve has to perform computations and factorizations in number fields. This results in many rather complicated aspects of the algorithm, as compared to the simpler rational sieve.
The size of the input to the algorithm is or the number of bits in the binary representation of . Any element of the order for a constant is exponential in . The running time of the number field sieve is super-polynomial but sub-exponential in the size of the input.
Number fields
Suppose is a -degree polynomial over (the rational numbers), and is a complex root of . Then, , which can be rearranged to express as a linear combination of powers of less than . This equation can be used to reduce away any powers of with exponent . For example, if and is the imaginary unit , then , or . This allows us to define the complex product:
In general, this leads directly to the algebraic number field , which can be defined as the set of complex numbers given by:
The product of any two such values can be computed by taking the product as polynomials, then reducing any powers of with exponent as described above, yielding a value in the same form. To ensure that this field is actually -dimensional and does not collapse to an even smaller field, it is sufficient that is an irreducible polynomial over the rationals. Similarly, one may define the ring of integers as the subset of which are roots of monic polynomials with integer coefficients. In some cases, this ring of integers is equivalent to the ring . However, there are many exceptions, such as for when is equal to 1 modulo 4.
Method
Two polynomials f(x) and g(x) of small degrees d and e are chosen, which have integer coefficients, which are irreducible over the rationals, and which, when i |
https://en.wikipedia.org/wiki/Marlborough%20Sounds | The Marlborough Sounds (te reo Māori: Te Tauihu-o-te-Waka) are an extensive network of sea-drowned valleys at the northern end of the South Island of New Zealand. The Marlborough Sounds were created by a combination of land subsidence and rising sea levels. According to Māori mythology, the sounds are the prows of the many sunken waka of Aoraki.
Overview
Covering some of sounds, islands, and peninsulas, the Marlborough Sounds lie at the South Island's north-easternmost point, between Tasman Bay / Te Tai-o-Aorere in the west and Cloudy Bay in the south-east. The almost fractal coastline has 1/10 of the length of New Zealand's coasts.
The steep, wooded hills and small quiet bays of the sounds are sparsely populated, as access is difficult. Many of the small settlements and isolated houses are only accessible by boat. The main large port is Picton on the mainland, at the head of Queen Charlotte Sound. It is at the northern terminus of the South Island's main railway and state highway networks. The main small-boat port, Waikawa, is one of New Zealand's largest and provides a base for leisure sailors and vacationers.
The main sounds, other than Queen Charlotte Sound, are Pelorus Sound / Te Hoiere and Kenepuru Sound. Tory Channel is a major arm of Queen Charlotte Sound, and between them, the Channel and the Sound isolate the hills of Arapaoa Island from the mainland. Other major islands in the sounds include D'Urville Island.
The Sounds are home to the entire breeding population of the rare and vulnerable rough-faced shag (also known as the New Zealand king cormorant) which nests on a small number of rocky islets there. The Department of Conservation manages a total of over 50 reserves in the area.
History
Pre-modern era
The sounds were extensively travelled and partly inhabited by Māori groups before the coming of the Europeans, using the sounds as shelter from bad weather and partaking of the rich food sources. Māori were also known to carry their canoes over some stretches of land on portage paths. However, as in most areas of the South Island, populations were smaller than in the North Island.
European history of the area is considered to start with Captain Cook's visit to the sounds in the 1770s, discovering a plant (Cook's scurvy grass) high in vitamin C which helped to cure scurvy amongst his crew. On Motuara Island, Cook also proclaimed British sovereignty over the South Island. Some parts of the sounds also later developed a significant whaling history, and much of the sounds was (thinly) settled by European farmers in the late 19th and early 20th century.
Ferries and marine farms
The Marlborough Sounds are connected to Cook Strait at the north-east extreme. At this point, the North Island is at its closest to the South Island, and the inter-island road, rail, and passenger ferry service between Picton and Wellington travels through the sounds.
Marine farming, especially of salmon and mussels, is increasingly common, having started |
https://en.wikipedia.org/wiki/Subclass | Subclass may refer to:
Subclass (taxonomy), a taxonomic rank below "class"
Subclass (computer science)
Subclass (set theory)
See also
Superclass |
https://en.wikipedia.org/wiki/Data%20link%20layer | The data link layer, or layer 2, is the second layer of the seven-layer OSI model of computer networking. This layer is the protocol layer that transfers data between nodes on a network segment across the physical layer. The data link layer provides the functional and procedural means to transfer data between network entities and may also provide the means to detect and possibly correct errors that can occur in the physical layer.
The data link layer is concerned with local delivery of frames between nodes on the same level of the network. Data-link frames, as these protocol data units are called, do not cross the boundaries of a local area network. Inter-network routing and global addressing are higher-layer functions, allowing data-link protocols to focus on local delivery, addressing, and media arbitration. In this way, the data link layer is analogous to a neighborhood traffic cop; it endeavors to arbitrate between parties contending for access to a medium, without concern for their ultimate destination. When devices attempt to use a medium simultaneously, frame collisions occur. Data-link protocols specify how devices detect and recover from such collisions, and may provide mechanisms to reduce or prevent them.
Examples of data link protocols are Ethernet, the IEEE 802.11 WiFi protocols, ATM and Frame Relay. In the Internet Protocol Suite (TCP/IP), the data link layer functionality is contained within the link layer, the lowest layer of the descriptive model, which is assumed to be independent of physical infrastructure.
Function
The data link provides for the transfer of data frames between hosts connected to the physical link. Within the semantics of the OSI network architecture, the protocols of the data link layer respond to service requests from the network layer, and perform their function by issuing service requests to the physical layer. That transfer can be reliable or unreliable; many data link protocols do not have acknowledgments of successful frame reception and acceptance, and some data link protocols might not even perform any check for transmission errors. In those cases, higher-level protocols must provide flow control, error checking, acknowledgments, and retransmission.
The frame header contains the source and destination addresses that indicate which device originated the frame and which device is expected to receive and process it. In contrast to the hierarchical and routable addresses of the network layer, layer 2 addresses are flat, meaning that no part of the address can be used to identify the logical or physical group to which the address belongs.
In some networks, such as IEEE 802 local area networks, the data link layer is described in more detail with media access control (MAC) and logical link control (LLC) sublayers; this means that the IEEE 802.2 LLC protocol can be used with all of the IEEE 802 MAC layers, such as Ethernet, Token Ring, IEEE 802.11, etc., as well as with some non-802 MAC layers suc |
https://en.wikipedia.org/wiki/AA | AA, Aa, Double A, or Double-A may refer to:
Arts, entertainment and media
America's Army, a 2002 computer game published by the U.S. Army
Ancient Anguish, a computer game in existence since 1992
Aa!, a J-Pop musical group
Double-A (band), stylised as AA, South Korean boy band
Aa (album), a 2016 album by Baauer
AA (song), a 2021 single by Walker Hayes
Ace Attorney, a series of video games developed by Capcom.
AA Films, an Indian film distribution company
AA Book (disambiguation)
AA, the production code for the 1966 Doctor Who serial The Savages
Brands, organizations and enterprises
Alcoholics Anonymous, an international fellowship dedicated to helping alcoholics peer to peer in sobriety
A. A. Arms, a defunct firearms manufacturer
Aerolíneas Argentinas, an Argentine airline (logo used to consist of two A's)
Air Asia, an Asian multinational low cost carrier
Air Austral, flag carrier airline of Reunion (logo used to consist of two A’s)
Alcoa, an American aluminum-producing company (stock symbol AA)
American Airlines, major American full-service airline (logo used to consist of two A’s)
Anadolu Agency, a state-run press agency in Turkey
Arakan Army, an ethnic army in Rakhine State, Myanmar
Audio-Animatronics, used at the Disney Parks
Academia de Artes, Mexico
Amalgamated Association of Iron and Steel Workers, a former union in the United States
Andecha Astur, an Asturian nationalist party
Architectural Association School of Architecture, London, United Kingdom
Astrological Association of Great Britain, London, United Kingdom
Auswärtiges Amt, the Foreign Office of Germany
Danish Association of Architects (Akademisk Arkitektforening)
The AA (formerly The Automobile Association), a British motoring organization
AA Ireland, an Irish automotive services company
AA Motoring Trust, a former British road safety charity operated by The AA that was merged to form the IAM Motoring Trust
USAA, an American financial services company
Philosophy and religion
A∴A∴, a spiritual organization created in 1907 by Aleister Crowley
Abhisamayalankara, or Abhisamaya-alaṅkāra, a Mahayana Buddhist text
Augustinians of the Assumption, a congregation of Catholic religious (priests and brothers)
Statue of A'a from Rurutu, a wooden fertility-god sculpture from the Pacific island of Rurutu
"A is A", an expression of the law of identity: each thing is identical with itself
Language
aa, Latin-script digraph used in the orthographies of Dutch, Finnish and other languages
aa, representation of letter Å in several Scandinavian languages
aa, a romanization of Arabic letter alif
Ꜳ, an orthographic ligature
Afar language (ISO 639-1 language code aa)
Aa (Bengali), a Bengali letter
Measurements
AA, a bra size
AA, a width in shoe sizes
AA battery size
Nature
Aa (plant), a genus of orchid
Aa (snail), a subgenus of snail
ʻAʻā or aa, a form of lava
A term for "river" in German hydronymy, see Aach (toponymy)
People
Aa (surname), a Scan |
https://en.wikipedia.org/wiki/Root-finding%20algorithms | In mathematics and computing, a root-finding algorithm is an algorithm for finding zeros, also called "roots", of continuous functions. A zero of a function , from the real numbers to real numbers or from the complex numbers to the complex numbers, is a number such that . As, generally, the zeros of a function cannot be computed exactly nor expressed in closed form, root-finding algorithms provide approximations to zeros, expressed either as floating-point numbers or as small isolating intervals, or disks for complex roots (an interval or disk output being equivalent to an approximate output together with an error bound).
Solving an equation is the same as finding the roots of the function . Thus root-finding algorithms allow solving any equation defined by continuous functions. However, most root-finding algorithms do not guarantee that they will find all the roots; in particular, if such an algorithm does not find any root, that does not mean that no root exists.
Most numerical root-finding methods use iteration, producing a sequence of numbers that hopefully converges towards the root as its limit. They require one or more initial guesses of the root as starting values, then each iteration of the algorithm produces a successively more accurate approximation to the root. Since the iteration must be stopped at some point, these methods produce an approximation to the root, not an exact solution. Many methods compute subsequent values by evaluating an auxiliary function on the preceding values. The limit is thus a fixed point of the auxiliary function, which is chosen for having the roots of the original equation as fixed points, and for converging rapidly to these fixed points.
The behavior of general root-finding algorithms is studied in numerical analysis. However, for polynomials, root-finding study belongs generally to computer algebra, since algebraic properties of polynomials are fundamental for the most efficient algorithms. The efficiency of an algorithm may depend dramatically on the characteristics of the given functions. For example, many algorithms use the derivative of the input function, while others work on every continuous function. In general, numerical algorithms are not guaranteed to find all the roots of a function, so failing to find a root does not prove that there is no root. However, for polynomials, there are specific algorithms that use algebraic properties for certifying that no root is missed, and locating the roots in separate intervals (or disks for complex roots) that are small enough to ensure the convergence of numerical methods (typically Newton's method) to the unique root so located.
Bracketing methods
Bracketing methods determine successively smaller intervals (brackets) that contain a root. When the interval is small enough, then a root has been found. They generally use the intermediate value theorem, which asserts that if a continuous function has values of opposite signs at the end points of an in |
https://en.wikipedia.org/wiki/Donkey%20Kong%203 | is a shooter video game developed and published by Nintendo. It is the third installment in the Donkey Kong series and it was released for arcades worldwide in 1983, the Family Computer in 1984, then in North America for the Nintendo Entertainment System in 1986. The gameplay departs from previous Donkey Kong games, and it stars an exterminator named Stanley instead of Mario.
It was re-released on the Wii Virtual Console in North America on July 14, 2008, and in Europe on January 9, 2009. It was re-released on Nintendo Switch through Nintendo Switch Online.
Gameplay
Donkey Kong hangs from vines at the center of the screen, and the player-controlled Stanley the exterminator runs and jumps on platforms beneath him. Stanley can fire bug spray at both Donkey Kong and insects flying around the levels. A level is completed by continually using his sprayer on Donkey Kong, forcing him to the top of the screen, or by killing all of the bugs. A Super Sprayer can on the vines falls down when Donkey Kong is sprayed past it. The Super Sprayer only lasts for a limited amount of time, but it pushes Donkey Kong upward at a much faster rate, making it easier to complete the level. It only spawns at the start of each life.
The insects consist of Buzzbees, queen Beespies (which shatter into deadly pieces when destroyed), Creepy inchworms, Attacker bees, Kabutomushi beetles, and Butterflies. Some of the flying insects attempt to pick up the flowers at the bottom of the screen and carry them away. Lost flowers decrease the bonus at the end of the round.
There are three levels which repeat in a fixed sequence. An extra life is given at 50,000 points, and then the game goes to "survival of the fittest" mode thereafter.
Plot
Donkey Kong has begun rampaging in Stanley's greenhouse garden and it's up to him to stop the ape from stirring up any more insects that will soon destroy his flowers. Stanley saves the flowers by spraying bug spray on Donkey Kong and exterminating all of the attacking bees.
Reception
The game was moderately successful in Japan, where Game Machine listed Donkey Kong 3 on their December 1, 1983, issue as being the fourth most-successful new table arcade unit of the month. Despite this, it was a commercial failure in North America, particularly due to the wake of the video game crash of 1983.
Reviews for the arcade game were generally positive. Gene Lewin of Play Meter magazine rated it 8 out of 10. Computer and Video Games said that the game's "fast action and superior sound effects" made Donkey Kong 3 a "sure hit" in arcades.
Retrospectively, reception has been divisive, with criticism aimed at its departure of its predecessors and the lack of Mario. IGN gave the Virtual Console version a 6.0 out of 10, describing it as a "radical departure" from the previous Donkey Kong games, calling it "repetitive".
In 2015, Nathan Birch of Uproxx ranked Donkey Kong 3 twentieth on a list of the thirty NES black box titles. Birch called the game "fun |
https://en.wikipedia.org/wiki/Scilab | Scilab is a free and open-source, cross-platform numerical computational package and a high-level, numerically oriented programming language. It can be used for signal processing, statistical analysis, image enhancement, fluid dynamics simulations, numerical optimization, and modeling, simulation of explicit and implicit dynamical systems and (if the corresponding toolbox is installed) symbolic manipulations.
Scilab is one of the two major open-source alternatives to MATLAB, the other one being GNU Octave. Scilab puts less emphasis on syntactic compatibility with MATLAB than Octave does, but it is similar enough that some authors suggest that it is easy to transfer skills between the two systems.
Introduction
Scilab is a high-level, numerically oriented programming language. The language provides an interpreted programming environment, with matrices as the main data type. By using matrix-based computation, dynamic typing, and automatic memory management, many numerical problems may be expressed in a reduced number of code lines, as compared to similar solutions using traditional languages, such as Fortran, C, or C++. This allows users to rapidly construct models for a range of mathematical problems. While the language provides simple matrix operations such as multiplication, the Scilab package also provides a library of high-level operations such as correlation and complex multidimensional arithmetic.
Scilab also includes a free package called Xcos for modeling and simulation of explicit and implicit dynamical systems, including both continuous and discrete sub-systems. Xcos is the open source equivalent to Simulink from the MathWorks.
As the syntax of Scilab is similar to MATLAB, Scilab includes a source code translator for assisting the conversion of code from MATLAB to Scilab. Scilab is available free of cost under an open source license. Due to the open source nature of the software, some user contributions have been integrated into the main program.
Syntax
Scilab syntax is largely based on the MATLAB language. The simplest way to execute Scilab code is to type it in at the prompt, --> , in the graphical command window. In this way, Scilab can be used as an interactive mathematical shell.
Hello World! in Scilab:
disp('Hello World');
Plotting a 3D surface function:
// A simple plot of z = f(x,y)
t=[0:0.3:2*%pi]';
z=sin(t)*cos(t');
plot3d(t,t',z)
Toolboxes
Scilab has many contributed toolboxes for different tasks, such as
Scilab Image Processing Toolbox (SIP) and its variants (such as SIVP)
Scilab Wavelet Toolbox
Scilab Java and .NET Module
Scilab Remote Access Module
More are available on ATOMS Portal or the Scilab forge.
History
Scilab was created in 1990 by researchers from INRIA and École nationale des ponts et chaussées (ENPC). It was initially named Ψlab (Psilab). The Scilab Consortium was formed in May 2003 to broaden contributions and promote Scilab as worldwide reference software in academia and industry. In July 20 |
https://en.wikipedia.org/wiki/IUCN%20Red%20List | The International Union for Conservation of Nature (IUCN) Red List of Threatened Species, also known as the IUCN Red List or Red Data Book, founded in 1964, is an inventory of the global conservation status and extinction risk of biological species. A series of Regional Red Lists are produced by countries and organizations, which assess the risk of extinction to species within a political management unit.
The goals of the Red List are to provide scientifically-based information on the status of species and subspecies at a global level, to draw attention to the magnitude and importance of threatened biodiversity, to influence national and international policy and decision-making, and to provide information to guide actions to conserve biological diversity.
Major species assessors include BirdLife International, the Institute of Zoology (the research division of the Zoological Society of London), the World Conservation Monitoring Centre, and many Specialist Groups within the IUCN Species Survival Commission (SSC). Collectively, assessments by these organizations and groups account for nearly half the species on the Red List.
The IUCN aims to have the category of every species re-evaluated at least every ten years, and every five years if possible. This is done in a peer reviewed manner through IUCN Species Survival Commission Specialist Groups (SSC), which are Red List Authorities (RLA) responsible for a species, group of species or specific geographic area, or in the case of BirdLife International, an entire class (Aves). The red list unit works with staff from the IUCN Global Species Programme as well as current program partners to recommend new partners or networks to join as new Red List Authorities.
The number of species which have been assessed for the Red List has been increasing over time. of 150,388 species surveyed, 42,108 are considered at risk of extinction because of human activity, in particular overfishing, hunting, and land development.
History
The idea for a Red Data Book was suggested by Peter Scott in 1963.
1966-1977 Red Data Lists
Initially the Red Data Lists were designed for specialists and were issued in a loose-leaf format that could be easily changed.
The first two volumes of Red Lists were published in 1966 by conservationist Noel Simon, one for mammals and one for birds.
The third volume that appeared covered reptiles and amphibians. It was created by René E. Honegger in 1968.
In 1970 the IUCN published its fifth volume in this series. This was the first Red Data List which focused on plants (angiosperms only), compiled by Ronald Melville.
The final volume of Red Data List created in the older, loose leaf style was volume 4 on freshwater fishes. This was published in 1979 by Robert Rush Miller.
1969 Red Data Book
The first attempt to create a Red Data Book for a nonspecialist public came in 1969 with The Red Book: Wildlife in Danger. This book covered varies groups but was predominantly about mammals an |
https://en.wikipedia.org/wiki/InterNIC | InterNIC, known as the Network Information Center (NIC) until 1993, was the organization primarily responsible for Domain Name System (DNS) domain name allocations and X.500 directory services. From its inception in 1972 until October 1, 1991, it was run by the Stanford Research Institute, now known as SRI International, and led by Jake Feinler. From October 1991 until September 18, 1998, it was run by Network Solutions. Thereafter, the responsibility was assumed by the Internet Corporation for Assigned Names and Numbers (ICANN).
It was accessed through the domain name internic.net, with email, FTP and World Wide Web services run at various times by SRI, Network Solutions, Inc., and AT&T. This website is still active today, operated by ICANN, and currently provides reference documents and information related to domain registration. The InterNIC also coordinated the IP address space, including performing IP address management for North America prior to the formation of ARIN. InterNIC is a registered service mark of the U.S. Department of Commerce. The use of the term is licensed to the Internet Corporation for Assigned Names and Numbers (ICANN).
SRI
The first central authority to coordinate the operation of the network was the Network Information Center (NIC). The NIC was based in Doug Engelbart's lab, the Augmentation Research Center, at the Stanford Research Institute (now SRI International) in Menlo Park, California.
In 1972, Elizabeth J. Feinler, better known as Jake, became principal investigator of the project.
The Internet Assigned Numbers Authority (IANA) assigned the numbers, while the NIC published them to the rest of the network. Jon Postel fulfilled the role of manager of IANA, in addition to his role as the RFC Editor, until his death in 1998.
The NIC provided reference service to users (initially over the phone and by physical mail), maintained and published a directory of people (the "white pages"), a resource handbook (the "yellow pages", a list of services) and the protocol handbook. After the Network Operations Center at Bolt, Bernek and Newman brought new hosts onto the network, the NIC registered names, provided access control for terminals, audit trail and billing information, and distributed Request for Comments (RFCs). Feinler, working with Steve Crocker, Jon Postel, Joyce Reynolds and other members of the Network Working Group (NWG), developed RFCs into the official set of technical notes for the ARPANET and later the Internet. The NIC provided the first links to online documents using the NLS Journal system developed at SRI's Augmentation Research Center.
On the ARPANET, hosts were given names to be used in place of numeric addresses. Owners of new hosts sent email to to request an address. A file named was distributed by the NIC and manually installed on each host on the network to provide a mapping between these names and their corresponding network address. As the network grew, this became increasingly cumbers |
https://en.wikipedia.org/wiki/Format | Format may refer to:
Printing and visual media
Text formatting, the typesetting of text elements
Paper formats, or paper size standards
Newspaper format, the size of the paper page
Computing
File format, particular way that information is encoded for storage in a computer file
Document file format, for storing documents on a storage media, especially for use by computer
Audio file format, for storing digital audio data on a computer system
Video file format, for storing digital video data on a computer system
Content format, encoded format for converting a specific type of data to displayable information
Disk formatting, preparing computer hard disks to store data, destroying any existing contents
FORMAT (command), a command-line utility to format disks in many computer operating systems
Format (Common Lisp), a programming function for formatting printed output
Format (Fortran 66), a programming statement for formatting printed output
Format (Algol68), a programming function and type for formatting printed output
Arts and entertainment
Film format, standard characteristics regarding image capture on photographic film
Format (photographic agency), agency set up in 1983 to represent women photographers
Playoff format, type of competition in sports and games to determine an overall champion
Radio format, the overall content broadcast on a radio station
TV format, overall concept, premise and branding of a television program
Music
Format (album), a compilation album of B-sides and bonus tracks released February 2012 by Pet Shop Boys
The Format, a musical group
The Format (album), by AZ
DJ Format, a hip-hop artist
See also
Form (disambiguation)
Style (disambiguation) |
https://en.wikipedia.org/wiki/Airliners.net | Airliners.net is an aviation website that includes an extensive photo database of aircraft and airports, as well as a forum catering to aviation enthusiasts. Created by Johan Lundgren, Jr., the site originated in 1996 as Pictures of Modern Airliners. It was acquired by Demand Media (now known as Leaf Group) in 2007, and underwent a major redesign in 2016.
History
Johan Lundgren, Jr., an IT student/aviation enthusiast attending Luleå University of Technology in Sweden, created the site Pictures of Modern Airliners in 1996. Lundgren had been working on the site during his military service. It initially hosted only his own aircraft photos before a new section was created for other photographers to upload their photos.
In 1997, Lundgren transitioned to a new site entitled Airliners.net and established a web server in his dormitory room. Three more servers were added, and eventually all servers were relocated to the computer rooms at the university. Lundgren started investing all of his time into the site, although he received help from a growing number of volunteers.
On 27 July 2007, Lundgren announced that the site would be acquired by Demand Media. It was sold to the company for US$8.2 million. Reasons behind the decision included the difficulty of managing the rapidly growing site, which was by that point supported by 25 servers.
A revamped site was launched on 14 June 2016.
In February 2017, the site was acquired by VerticalScope, majority-owned by Torstar.
Membership
The site offers free membership, using online advertising instead as a source of revenue. Before the June 2016 redesign, Airliners.net provided three levels of membership: the Photographer Account, Premium Membership and First Class Membership. The latter two required payment, while a Photographer Account could be created for free.
Features
The site has two main features: the photo database and the forum. The database contains over 2.7 million photos with over 8.6 billion total views as of June 2016. All photos undergo screening prior to being admitted to the database, which can be searched by various factors including aircraft type, the airport at which the photo was taken and the aircraft registration. The forum is divided into ten subforums: Civil Aviation; Travel, Polls & Preferences; Technical/Operations; Aviation Hobby; Aviation Photography; Photography Feedback; Trip Reports; Military Aviation & Space Flight; Non-Aviation; and Site Related. Airliners.net also offers a complimentary newsletter service and a database of information on aircraft types developed with the help of Aerospace Publications.
See also
List of Internet forums
References
External links
Airliners.net
Internet properties established in 1997
Online databases
Aviation websites
Aviation Internet forums |
https://en.wikipedia.org/wiki/Lenstra%20elliptic-curve%20factorization | The Lenstra elliptic-curve factorization or the elliptic-curve factorization method (ECM) is a fast, sub-exponential running time, algorithm for integer factorization, which employs elliptic curves. For general-purpose factoring, ECM is the third-fastest known factoring method. The second-fastest is the multiple polynomial quadratic sieve, and the fastest is the general number field sieve. The Lenstra elliptic-curve factorization is named after Hendrik Lenstra.
Practically speaking, ECM is considered a special-purpose factoring algorithm, as it is most suitable for finding small factors. , it is still the best algorithm for divisors not exceeding 50 to 60 digits, as its running time is dominated by the size of the smallest factor p rather than by the size of the number n to be factored. Frequently, ECM is used to remove small factors from a very large integer with many factors; if the remaining integer is still composite, then it has only large factors and is factored using general-purpose techniques. The largest factor found using ECM so far has 83 decimal digits and was discovered on 7 September 2013 by R. Propper. Increasing the number of curves tested improves the chances of finding a factor, but they are not linear with the increase in the number of digits.
Algorithm
The Lenstra elliptic-curve factorization method to find a factor of a given natural number works as follows:
Pick a random elliptic curve over (the integers modulo ), with equation of the form together with a non-trivial point on it.
This can be done by first picking random , and then setting to assure the point is on the curve.
One can define Addition of two points on the curve, to define a group. The addition laws are given in the article on elliptic curves.
We can form repeated multiples of a point : . The addition formulae involve taking the modular slope of a chord joining and , and thus division between residue classes modulo , performed using the extended Euclidean algorithm. In particular, division by some includes calculation of the .
Assuming we calculate a slope of the form with , then if , the result of the point addition will be , the point "at infinity" corresponding to the intersection of the "vertical" line joining and the curve. However, if , then the point addition will not produce a meaningful point on the curve; but, more importantly, is a non-trivial factor of .
Compute on the elliptic curve (), where is a product of many small numbers: say, a product of small primes raised to small powers, as in the p-1 algorithm, or the factorial for some not too large . This can be done efficiently, one small factor at a time. Say, to get , first compute , then , then , and so on. is picked to be small enough so that -wise point addition can be performed in reasonable time.
If we finish all the calculations above without encountering non-invertible elements (), it means that the elliptic curves' (modulo primes) order is not smooth enough, so we need |
https://en.wikipedia.org/wiki/Gregory%20Bateson | Gregory Bateson (9 May 1904 – 4 July 1980) was an English anthropologist, social scientist, linguist, visual anthropologist, semiotician, and cyberneticist whose work intersected that of many other fields. His writings include Steps to an Ecology of Mind (1972) and Mind and Nature (1979).
In Palo Alto, California, Bateson and colleagues developed the double-bind theory of schizophrenia.
Bateson's interest in systems theory forms a thread running through his work. He was one of the original members of the core group of the Macy conferences in Cybernetics (1941–1960), and the later set on Group Processes (1954–1960), where he represented the social and behavioral sciences. He was interested in the relationship of these fields to epistemology. His association with the editor and author Stewart Brand helped widen his influence.
Early life and education
Bateson was born in Grantchester in Cambridgeshire, England, on 9 May 1904. He was the third and youngest son of (Caroline) Beatrice Durham and the distinguished geneticist William Bateson. He was named Gregory after Gregor Mendel, the Austrian monk who founded the modern science of genetics.
The younger Bateson attended Charterhouse School from 1917 to 1921, obtained a Bachelor of Arts in biology at St. John's College, Cambridge, in 1925, and continued at Cambridge from 1927 to 1929.
According to Lipset (1982), Bateson's life was greatly affected by the death of his two brothers. John Bateson (1898–1918), the eldest of the three, was killed in World War I. Martin Bateson (1900–1922), the second brother, was then expected to follow in his father's footsteps as a scientist, but came into conflict with his father over his ambition to become a poet and playwright. The resulting stress, combined with a disappointment in love, resulted in Martin's public suicide by gunshot under the statue of Anteros in Piccadilly Circus on 22 April 1922, which was John's birthday. After this event, which transformed a private family tragedy into public scandal, the parents' ambitious expectations fell on Gregory.
Career
In 1928, Bateson lectured in linguistics at the University of Sydney.
From 1931 to 1937, he was a Fellow of St. John's College, Cambridge. He spent the years before World War II in the South Pacific in New Guinea and Bali doing anthropology.
In the 1940s, he helped extend systems theory and cybernetics to the social and behavioral sciences.
Although initially reluctant to join the intelligence services, Bateson served in OSS during World War II along with dozens of other anthropologists. He was stationed in the same offices as Julia Child (then Julia McWilliams), Paul Cushing Child, and others. He spent much of the war designing 'black propaganda' radio broadcasts. He was deployed on covert operations in Burma and Thailand, and worked in China, India, and Ceylon as well. Bateson used his theory of schismogenesis to help foster discord among enemy fighters. He was upset by his wartime experience and |
https://en.wikipedia.org/wiki/CCM | CCM may refer to:
Cubic centimetre (ccm), metric unit of volume
Computing
CCM mode, an encryption algorithm
Client Configuration Manager, a component of Microsoft System Center Configuration Manager
Combined Cipher Machine, a WWII-era cipher system
Community Climate Model, predecessor of the Community Climate System Model
Constrained conditional model, a machine-learning framework
CORBA Component Model
Customer communications management, a type of software
Government
Center for Countermeasures, a US White Sands Proving Grounds operation
Chama Cha Mapinduzi, the ruling political party in Tanzania
Convention on Cluster Munitions, a 2010 international treaty prohibiting cluster bombs
Job titles
Certified Case Manager, an accreditation for health care providers
Certified Construction Manager, an accreditation by the Construction Management Association of America
Certified Consulting Meteorologist, an accreditation of the American Meteorological Society (AMS)
Command Chief Master Sergeant, a rank and billet in the U.S. Air Force
Music
Aspects of mid-20th century American Christian evangelicism:
Contemporary Christian music
CCM Magazine
Contemporary classical music
Contemporary commercial music
University of Cincinnati – College-Conservatory of Music
Schools and organizations
Cardinal Courier Media, an overseeing body at St. John Fisher College
City College of Manila, Philippines
Council of Churches of Malaysia, an ecumenical fellowship in Malaysia
County College of Morris, New Jersey, United States
Science and medicine
Calcium concentration microdomains, part of a cell's cytoplasm
Carbon concentrating mechanisms, a photosynthesis condition in plants
Cardiac contractility modulation, a therapy for heart failure
Cerebral cavernous malformation, a type of venous malformation in the brain
Climate change mitigation, climate change topic
Convergent cross mapping, a statistical test
Places
Cape Cod Mall, a shopping mall in Hyannis, Massachusetts
Macao Cultural Centre, Macau, China
Sport
CCM (bicycle company), a Canadian bicycle manufacturer
CCM (ice hockey), a Canadian sporting goods brand
Central Coast Mariners FC, an Australian A-League football team
Clews Competition Motorcycles, a British motorcycle manufacturer
Transportation
CCM Airlines, an airline of Corsica, France
Combatant Craft Medium, a U.S. Navy patrol boat
Core Cabin Module, a part of the Chinese space station
Other uses
Catherine Cortez Masto (born 1964), United States Senator from Nevada
Caja Castilla-La Mancha (CCM), a former Spanish savings bank |
https://en.wikipedia.org/wiki/White%20Aryan%20Resistance%20%28Sweden%29 | White Aryan Resistance (, VAM) was a militant neo-Nazi network active in Sweden between 1991 and 1993.
Overview
The name of the group was derived from the US white supremacist organisation White Aryan Resistance (WAR). According to Stieg Larsson, a researcher of white supremacist organizations, the group was rather styled on the then already defunct US white supremacist group The Order, led by Robert Jay Mathews. VAM was founded by Klas Lund, other leading members were Torulf Magnusson and Peter Melander, editor of the group's magazine Storm. The organisation's symbol was the "Wolfsangel" with a sword in the center. VAM has been implicated in many serious crimes in Sweden. According to a report prepared and jointly published in November 1999 by Sweden's four largest daily newspapers, Aftonbladet, Expressen, Dagens Nyheter and Svenska Dagbladet, many former members of the organisation are members of present-day neo-Nazi organisations.
After VAM and a prison sentence, Klas Lund founded the self-declared Swedish Resistance Movement in 1997, which later became the Nordic Resistance Movement. Another VAM offshoot was the now-defunct National Socialist Front which was formed in 1994.
References
Neo-Nazi organizations
Neo-fascist terrorism
Neo-Nazism in Sweden
Racism in Sweden
1991 establishments in Sweden
1993 disestablishments in Sweden
Organizations established in 1991
Organizations disestablished in 1993 |
https://en.wikipedia.org/wiki/Conversational%20Monitor%20System | The Conversational Monitor System (CMS, originally Cambridge Monitor System) is a simple interactive single-user operating system. CMS was originally developed as part of IBM's CP/CMS operating system, which went into production use in 1967. CMS is part of IBM's VM family, which runs on IBM mainframe computers. VM was first announced in 1972, and is still in use today as z/VM.
CMS runs as a "guest" operating system in a private virtual machine created by the VM control program. The control program plus CMS together create a multi-user time-sharing operating system.
History
CMS was originally developed as part of IBM's CP/CMS operating system. At the time, the acronym meant "Cambridge Monitor System" (but also: "Console Monitor System").
CMS first ran under CP-40, a one-off research system using custom hardware at IBM's Cambridge Scientific Center. Production use at CSC began in January 1967. The CMS user interface drew heavily on experience with the influential first-generation time-sharing system CTSS, some of whose developers worked on CP/CMS. (CTSS was used as an early CP/CMS development platform.)
Later in 1967, CP/CMS became generally available on the IBM System/360 Model 67, where, although the new control program CP-67 was a substantial re-implementation of CP-40, CMS remained essentially the same. IBM provided CP/CMS "as is" – without any support, in source code form, as part of the IBM Type-III Library. CP/CMS was thus an open source system. Despite this lack of support from IBM, CP/CMS achieved great success as a time-sharing platform; by 1972, there were some 44 CP/CMS systems in use, including commercial sites that resold access to CP/CMS.
In 1972, IBM released its VM/370 operating system, a re-implementation of CP/CMS for the System/370, in an announcement that also added virtual memory hardware to the System/370 series. Unlike CP/CMS, VM/370 was supported by IBM. VM went through a series of versions, and is still in use today as z/VM.
Through all its distinct versions and releases, the CMS platform remained still quite recognizable as a close descendant of the original CMS version running under CP-40. Many key user interface decisions familiar to today's users had already been made in 1965, as part of the CP-40 effort. See CMS under CP-40 for examples.
Both VM and CP/CMS had checkered histories at IBM. VM was not one of IBM's "strategic" operating systems, which were primarily the OS and DOS families, and it suffered from IBM political infighting over time-sharing versus batch processing goals. This conflict is why CP/CMS was originally released as an unsupported system, and why VM often had limited development and support resources within IBM. An exceptionally strong user community, first established in the self-support days of CP/CMS but remaining active after the launch of VM, made substantial contributions to the operating system, and mitigated the difficulties of running IBM's "other operating system".
Architecture
|
https://en.wikipedia.org/wiki/Technophobia | Technophobia (from Greek τέχνη technē, "art, skill, craft" and φόβος phobos, "fear"), also known as technofear, is the fear or dislike of advanced technology or complex devices, especially computers. Although there are numerous interpretations of technophobia, they become more complex as technology continues to evolve. The term is generally used in the sense of an irrational fear, but others contend fears are justified. It is the opposite of technophilia.
Larry Rosen, a research psychologist, computer educator, and professor at California State University, Dominguez Hills, suggests that there are three dominant subcategories of technophobes – the "uncomfortable users", the "cognitive computerphobes", and "anxious computerphobes". First receiving widespread notice during the Industrial Revolution, technophobia has been observed to affect various societies and communities throughout the world. This has caused some groups to take stances against some modern technological developments in order to preserve their ideologies. In some of these cases, the new technologies conflict with established beliefs, such as the personal values of simplicity and modest lifestyles.
Examples of technophobic ideas can be found in multiple forms of art, ranging from literary works such as Frankenstein to films like Metropolis. Many of these works portray a darker side to technology, as perceived by those who are technophobic. As technologies become increasingly complex and difficult to understand, people are more likely to harbor anxieties relating to their use of modern technologies.
Prevalence
A study published in the journal Computers in Human Behavior was conducted between 1992 and 1994 surveying first-year college students across various countries. The overall percentage of the 3,392 students who responded with high-level technophobic fears was 29%. In comparison, Japan had 58% high-level technophobes and Mexico had 53%.
A published report in 2000 stated that roughly 85–90% of new employees at an organization may be uncomfortable with new technology, and are technophobic to some degree.
History
Technophobia began to gain attention as a movement in England with the dawn of the Industrial Revolution. With the development of new machines able to do the work of skilled craftsmen using unskilled, low-wage labor, those who worked a trade began to fear for their livelihoods. In 1675, a group of weavers destroyed machines that replaced their jobs. By 1727, the destruction had become so prevalent that Parliament made the demolition of machines a capital offense. This action, however, did not stop the tide of violence. The Luddites, a group of anti-technology workers, united under the name "Ludd" in March 1811, removing key components from knitting frames, raiding houses for supplies, and petitioning for trade rights while threatening greater violence. Poor harvests and food riots lent aid to their cause by creating a restless and agitated population for them to draw s |
https://en.wikipedia.org/wiki/Reentrancy%20%28computing%29 | A computer program or subroutine is called reentrant if multiple invocations can safely run concurrently on multiple processors, or if on a single-processor system its execution can be interrupted and a new execution of it can be safely started (it can be "re-entered"). The interruption could be caused by an internal action such as a jump or call, or by an external action such as an interrupt or signal, unlike recursion, where new invocations can only be caused by internal call.
This definition originates from multiprogramming environments, where multiple processes may be active concurrently and where the flow of control could be interrupted by an interrupt and transferred to an interrupt service routine (ISR) or "handler" subroutine. Any subroutine used by the handler that could potentially have been executing when the interrupt was triggered should be reentrant. Similarly, code shared by two processors accessing shared data should be reentrant. Often, subroutines accessible via the operating system kernel are not reentrant. Hence, interrupt service routines are limited in the actions they can perform; for instance, they are usually restricted from accessing the file system and sometimes even from allocating memory.
Reentrancy is neither necessary nor sufficient for thread-safety in multi-threaded environments. In other words, a reentrant subroutine can be thread-safe, but . Conversely, thread-safe code need not be reentrant (see below for examples).
Other terms used for reentrant programs include "sharable code". Reentrant subroutines are sometimes marked in reference material as being "signal safe". Reentrant programs are often "pure procedures".
Background
Reentrancy is not the same thing as idempotence, in which the function may be called more than once yet generate exactly the same output as if it had only been called once. Generally speaking, a function produces output data based on some input data (though both are optional, in general). Shared data could be accessed by any function at any time. If data can be changed by any function (and none keep track of those changes), there is no guarantee to those that share a datum that that datum is the same as at any time before.
Data has a characteristic called scope, which describes where in a program the data may be used. Data scope is either global (outside the scope of any function and with an indefinite extent) or local (created each time a function is called and destroyed upon exit).
Local data is not shared by any routines, re-entering or not; therefore, it does not affect re-entrance. Global data is defined outside functions and can be accessed by more than one function, either in the form of global variables (data shared between all functions), or as static variables (data shared by all invocations of the same function). In object-oriented programming, global data is defined in the scope of a class and can be private, making it accessible only to functions of that class. There is |
https://en.wikipedia.org/wiki/System%20administrator | A system administrator, sysadmin, or admin is a person who is responsible for the upkeep, configuration, and reliable operation of computer systems, especially multi-user computers, such as servers. The system administrator seeks to ensure that the uptime, performance, resources, and security of the computers they manage meet the needs of the users, without exceeding a set budget when doing so.
To meet these needs, a system administrator may acquire, install, or upgrade computer components and software; provide routine automation; maintain security policies; troubleshoot; train or supervise staff; or offer technical support for projects.
Related fields
Many organizations staff offer jobs related to system administration. In a larger company, these may all be separate positions within a computer support or Information Services (IS) department. In a smaller group they may be shared by a few sysadmins, or even a single person.
A database administrator (DBA) maintains a database system, and is responsible for the integrity of the data and the efficiency and performance of the system.
A network administrator maintains network infrastructure such as switches and routers, and diagnoses problems with these or with the behavior of network-attached computers.
A security administrator is a specialist in computer and network security, including the administration of security devices such as firewalls, as well as consulting on general security measures.
A web administrator maintains web server services (such as Apache or IIS) that allow for internal or external access to web sites. Tasks include managing multiple sites, administering security, and configuring necessary components and software. Responsibilities may also include software change management.
A computer operator performs routine maintenance and upkeep, such as changing backup tapes or replacing failed drives in a redundant array of independent disks (RAID). Such tasks usually require physical presence in the room with the computer, and while less skilled than sysadmin tasks, may require a similar level of trust, since the operator has access to possibly sensitive data.
An SRE Site Reliability Engineer - takes a software engineering or programmatic approach to managing systems.
Training
Most employers require a bachelor's degree in a related field, such as computer science, information technology, electronics engineering, or computer engineering. Some schools also offer undergraduate degrees and graduate programs in system administration.
In addition, because of the practical nature of system administration and the easy availability of open-source server software, many system administrators enter the field self-taught.
Generally, a prospective employee will be required to have experience with the computer systems they are expected to manage. In most cases, candidates are expected to possess industry certifications such as the Microsoft MCSA, MCSE, MCITP, Red Hat RHCE, Novell CNA, CNE, |
https://en.wikipedia.org/wiki/Data%20acquisition | Data acquisition is the process of sampling signals that measure real-world physical conditions and converting the resulting samples into digital numeric values that can be manipulated by a computer. Data acquisition systems, abbreviated by the acronyms DAS, DAQ, or DAU, typically convert analog waveforms into digital values for processing. The components of data acquisition systems include:
Sensors, to convert physical parameters to electrical signals.
Signal conditioning circuitry, to convert sensor signals into a form that can be converted to digital values.
Analog-to-digital converters, to convert conditioned sensor signals to digital values.
Data acquisition applications are usually controlled by software programs developed using various general purpose programming languages such as Assembly, BASIC, C, C++, C#, Fortran, Java, LabVIEW, Lisp, Pascal, etc. Stand-alone data acquisition systems are often called data loggers.
There are also open-source software packages providing all the necessary tools to acquire data from different, typically specific, hardware equipment. These tools come from the scientific community where complex experiment requires fast, flexible, and adaptable software. Those packages are usually custom-fit but more general DAQ packages like the Maximum Integrated Data Acquisition System can be easily tailored and are used in several physics experiments.
History
In 1963, IBM produced computers that specialized in data acquisition. These include the IBM 7700 Data Acquisition System, and its successor, the IBM 1800 Data Acquisition and Control System. These expensive specialized systems were surpassed in 1974 by general-purpose S-100 computers and data acquisition cards produced by Tecmar/Scientific Solutions Inc. In 1981 IBM introduced the IBM Personal Computer and Scientific Solutions introduced the first PC data acquisition products.
Methodology
Sources and systems
Data acquisition begins with the physical phenomenon or physical property to be measured. Examples of this include temperature, vibration, light intensity, gas pressure, fluid flow, and force. Regardless of the type of physical property to be measured, the physical state that is to be measured must first be transformed into a unified form that can be sampled by a data acquisition system. The task of performing such transformations falls on devices called sensors. A data acquisition system is a collection of software and hardware that allows one to measure or control the physical characteristics of something in the real world. A complete data acquisition system consists of DAQ hardware, sensors and actuators, signal conditioning hardware, and a computer running DAQ software. If timing is necessary (such as for event mode DAQ systems), a separate compensated distributed timing system is required.
A sensor, which is a type of transducer, is a device that converts a physical property into a corresponding electrical signal (e.g., strain gauge, thermistor). |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.