source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/Alex%20in%20Wonderland%20%28TV%20series%29 | Alex in Wonderland is a 1959 television series of at least 13 episodes that was distributed by the NTA Film Network. The raconteur Alexander King was the host, giving commentary on various topics.
Format
John P. Shanley wrote in The New York Times, "Mr. King, author, artist, and raconteur, spends virtually the entire hour he is on the air each week in telling anecdotes from his own life and philosophizing about achievements and derelictions of others."
In preparation for each episode, King made a list of approximately 20 topics about which he might talk. He said that he always had at least six topics unaddressed when an episode was completed. He sometimes had guests, and his wife sometimes appeared with him. She also occasionally performed a drum solo on the show.
Production
It was produced by Mitchell Grayson and directed by Max Miller. It was filmed on Tuesdays at NTA's flagship station WNTA-TV beginning on March 10.
References
1959 American television series debuts
1959 American television series endings
1950s American television series
English-language television shows
First-run syndicated television programs in the United States
NTA Film Network |
https://en.wikipedia.org/wiki/Munindar%20P.%20Singh | Munindar P. Singh is a SAS institute distinguished professor and a full professor in the Department of Computer Science at North Carolina State University. Singh is an IEEE Fellow, a AAAI Fellow, a AAAS Fellow, an ACM Fellow, a Member of Academia Europaea, and a ACM SIGAI Autonomous Agents Research Award recipient.
Education
Singh received his B.Tech. in computer science & engineering from the Indian Institute of Technology Delhi in 1986. He obtained a Ph.D. in computer science from the University of Texas at Austin in 1993 under the supervision of E. Allen Emerson and Nicholas M. Asher.
Research
Singh's research interests include multiagent systems, service-oriented computing, software engineering, artificial intelligence, and social networks. He has made several important contributions to the understanding of interaction and norms in multiagent systems. He introduced to artificial intelligence the distinction between social commitment (a norm) and psychological commitment (a mental attitude). Singh also introduced the idea that interaction among autonomous social principals (e.g., between two or more organizations) must have a social semantics. This idea has proved to be highly influential within multiagent systems research. In recognition of Singh's contribution, the paper in which he introduced this idea was awarded the IFAAMAS 2016 Influential Paper Award. Taking this line of thinking further, Singh, in joint work with his Ph.D. student pInar Yolum, introduced the abstraction of commitment protocols.
Singh has also made important contributions to social networks, trust, and distributed computing. His Blindingly Simple Protocol Language (BSPL) introduces the idea that message ordering in interaction protocols fall out automatically from information flow requirements. Therefore, one need not model specify control flow at all in interaction protocols.
References
External links
Munindar P. Singh's home page
Multiagent Systems and Service-Oriented Computing Laboratory
Indian computer scientists
Fellow Members of the IEEE
IIT Delhi alumni
North Carolina State University faculty
University of Texas at Austin alumni
Year of birth missing (living people)
Living people
Artificial intelligence researchers
Fellows of the Association for the Advancement of Artificial Intelligence |
https://en.wikipedia.org/wiki/Rakesh%20Agrawal | Rakesh Agrawal may refer to:
Rakesh Agrawal (chemical engineer), National Medal of Technology & Innovation Laureate; professor at Purdue University
Rakesh Agrawal (computer scientist), former Technical Fellow at the Microsoft Search Labs
See also
Rakesh Aggarwal (born 1975), British businessman
Rakesh Aggarwal (gastroenterologist) (born 1961), Indian gastroenterologist |
https://en.wikipedia.org/wiki/NVDIMM | A NVDIMM (pronounced "en-vee-dimm") or non-volatile DIMM is a type of persistent random-access memory for computers using widely used DIMM form-factors. Non-volatile memory is memory that retains its contents even when electrical power is removed, for example from an unexpected power loss, system crash, or normal shutdown. Properly used, NVDIMMs can improve application performance and system crash recovery time. They enhance solid-state drive (SSD) endurance and reliability.
Many "non-volatile" products use volatile memory during normal operation and dump the contents into non-volatile memory if the power fails, using an on-board backup power source. Volatile memory is faster than non-volatile; it is byte-addressable; and it can be written to arbitrarily, without concerns about wear and device lifespan. However, including a second memory to achieve non-volatility (and the on-board backup power source) increases the product cost compared to volatile memory.
There are many emerging non-volatile memories in development and a few that have been launched including Magnetoresistive RAM (MRAM) and Intel's 3D XPoint. Like MRAM, Nano-RAM based on carbon nanotubes is one technology intended to come close to DRAM on the criteria of performance, byte-addressability and device lifespan; first products are expected in 2021 at moderate density, from fabrication partner Fujitsu. The goal of this technology is able to scale cost-effectively scale out so persistent memory could replace DRAM as the main system memory in enterprise systems.
Types
There are three types of NVDIMM implementations by JEDEC Standards org:
NVDIMM-F: DIMM with flash storage. System users will need to pair the storage DIMM alongside a traditional DRAM DIMM. While there's no official standard, NVDIMM-F type of modules have been available since 2014.
NVDIMM-N: DIMM with flash storage and traditional DRAM on the same module. The computer accesses the traditional DRAM directly during system runtime. In the event of a power failure, the module copies the data from the volatile traditional DRAM to the persistent flash memory, and copies it back when power is restored. It uses a small backup power source for the module while the data in DRAM is being copied to the flash storage.
NVDIMM-P: specification fully released by JEDEC in February 2021. It enables computer main memory to be persistent, using persistent memory technology and can share the DDR4 or DDR5 DIMM interconnect with DRAM DIMMs.
Non-Standard NVDIMM implementations:
NVDIMM-X: DDR4 DIMM with NAND Flash storage and volatile DRAM on the same module, developed by Xitore.
As of November 2012, most NVDIMMs used NAND flash as the non-volatile memory. Emerging memory technologies aim to achieve NVDIMM without a cache or two separate memories. Intel and Micron have announced use of the 3D XPoint PCM technology in NVDIMM-F. Sony and Viking Technology have announced an NVDIMM-N product based on the ReRAM technology. In 2015, Samsung and N |
https://en.wikipedia.org/wiki/EMCO%20Remote%20Installer | EMCO Remote Installer is a software distribution tool for Windows. It allows network administrators to install and uninstall software on remote Windows computers connected to a local network, and to audit installed software and Windows updates remotely.
Functionality
EMCO Remote Installer allows network administrators to install, uninstall and audit installed software on remote Windows computers across a local network. The remote installation, uninstallation and audit operations can be executed on multiple remote computers in parallel. Such operations can be initiated either manually or scheduled for automatic execution.
The application supports remote installation of EXE setups, MSI and MSP packages. All the supported types of packages are installed on remote PCs silently. To install an EXE installation, a user should specify the command-line parameters activating the silent installation mode or provide an installation scenario file. MSI and MSP packages are installed silently using the standard installation options.
EMCO Remote Installer allows auditing software and OS updates installed on remote PCs. The application extracts information about the installed software from remote PCs and stores it in a database enabling the user to generate software inventory reports. The collected software inventory information is used to uninstall applications and updates. A user can select software installed on remote PCs to uninstall it remotely. Remote uninstallation is performed silently. To uninstall software that was installed using EXE setups, a user should specify the command-line parameters activating the silent uninstallation mode or provide an uninstallation scenario file. Software installed using MSI and MSP packages is uninstalled silently using the standard options.
Key features and functions
Remote silent installation and uninstallation of x86 and x64 EXE/MSI/MSP packages
Software distribution to multiple remote PCs in parallel
Remote audit of installed software
Installation/uninstallation of multiple packages at once
Execution of custom pre- and post-installation actions
Scheduler that supports execution of one-time and recurrent remote operations
Free and Professional editions
EMCO Remote Installer is available in two editions. The Free edition is free for personal and commercial usage and includes features to audit installed software and to install/uninstall up to five installation packages on up to five remote PCs at a time. The Professional edition requires a commercial license and includes the full range of all the available features.
Functionality limitations
EMCO Remote Installer collects information from remote PCs on installed applications and updates that were installed "per machine". Software installed "per user" (i.e. installed in a particular Windows user account) is not detected by the application. Remote installation and uninstallation operations can work with "per machine" installations only.
Alternatives
Remote soft |
https://en.wikipedia.org/wiki/ROZA | ROZA () was a radical left political party in Greece that is part of the Coalition of the Radical Left.
ROZA was formed in 2008, by independent left-wing activists and members of the Network for Political and Social Rights. The political target of ROZA is the participatory formation of SYRIZA in combination with its programming radicalization. The party was dissolved in 2013.
References
External links
Official site
2008 establishments in Greece
Communist parties in Greece
Components of Syriza
Luxemburgism
Political parties established in 2008 |
https://en.wikipedia.org/wiki/TransLattice | TransLattice is a software company based in Santa Clara, California. It geographically distributes databases and applications for enterprise, cloud and hybrid environments. TransLattice offers a NewSQL database and an application platform.
History
TransLattice was founded in 2007 and officially launched in 2010. The company co-founders are Frank Huerta, CEO, Mike Lyle, Executive VP of Engineering and Robert Geiger, who previously worked together at Recourse Technologies. TransLattice is based in Santa Clara, California.
In August 2008 the company received $9.5 million in series A funding from DCM, an early stage capital venture funding company.
In 2013, TransLattice acquired StormDB, a database-as-a-service startup. StormDB's clustered PostgreSQL fork was open sourced in 2014 under the name Postgres-XL.
Technology
TransLattice specializes in distributed databases and application platforms for enterprise and cloud IT systems. The company has developed a geographically-distributed computing-architecture that allows a single database to run on multiple nodes located anywhere.
The TransLattice Elastic Database (TED), a NewSQL database management system, enables the building of a "highly available, fault tolerant data fabric multiple nodes that can be located anywhere in the world". The TransLattice database is fully SQL/ACID-compliant. TED operates as "a cohesive, single database".
TransLattice provided the world's first geographically-distributed relational database management system (RDBMS) to deploy on multiple public-cloud-provider networks at the same time, as well as on virtual machines, physical hardware or any combination thereof.
References
Database companies
Software companies based in California
Companies based in Santa Clara, California
Software companies of the United States |
https://en.wikipedia.org/wiki/U3%20%28Vienna%20U-Bahn%29 | Line U3 is a line on the Vienna U-Bahn metro system.
Opened in 1991, it currently has 21 stations and a total length of , from to , making it the shortest line on the network.
It is connected to at , at , at and at .
Stations
Line U3 currently serves the following stations:
(transfer to: - park & ride facility)
(transfer to: )
(transfer to: )
(transfer to: )
(transfer to: )
( park & ride facility)
(transfer to: )
References
External links
U3
Railway lines opened in 1991
1991 establishments in Austria |
https://en.wikipedia.org/wiki/Atalla | Atalla may refer to:
Mohamed M. Atalla, Egyptian-American semiconductor and cybersecurity pioneer, also known by the alias "John" or "Martin" M. Atalla
Utimaco Atalla, Information Protection and Control Suite (data security software) company, founded by Mohamed Atalla
Ash Atalla, a British television producer
Andrew Atalla, the British founder of online marketing agency atom42
The former name of Epworth, Georgia
See also
Attala (disambiguation) |
https://en.wikipedia.org/wiki/Dev%20Kanya | Dev Kanya is a Bollywood film. It was released in 1963.
Music
"Mata O Mata Jeevan Ki Data" - Asha Bhosle
"Pag Ghungharoo Bole Chhananan Chhum" - Asha Bhosle, Mahendra Kapoor
"Saiyan Chhod De Mera Haath, Haye Dhadke Jiya, Kaise Chhod Du" - Asha Bhosle, Mohammed Rafi
"Zara Pehchano Toh Main Kaun, Kaha Se Aaye" - Asha Bhosle, Mukesh
"Bole Jhan Jhan Jhan Payal Bole" - Asha Bhosle
"O Sansar Banane Wale" - Asha Bhosle
"Piyaa-Milan Ko Jaane Waali Sambhal-Sambhal Kar Chal" - Amirbai Karnataki
References
External links
1963 films
1960s Hindi-language films |
https://en.wikipedia.org/wiki/InterNICHE | InterNICHE (International Network for Humane Education; ), is a non-profit organization and an international network based in the United Kingdom that promotes the use of humane alternatives within biological science and veterinary medical education globally. The network is composed of campaigners, students, teachers and trainers.
Resource
Resources developed by InterNICHE to highlight alternatives in biological sciences of the multi-language book From Guinea Pig to Computer Mouse (2003), several Alternative Loan Systems, the Humane Education Award. The organization also has a website www.interniche.org, conferences, outreach visits and training around the world.
See also
Alternatives to animal testing
References
Sources
Patricia Ann Owens. Encyclopedia of animal rights and animal welfare. School Library Journal. vol. 56 iss. 4 p. 10.
External links
Alternatives to animal testing
Animal welfare organisations based in the United Kingdom
Anti-vivisection organizations
Humane education
Organizations established in 1988 |
https://en.wikipedia.org/wiki/Keith%20Winstein | Keith Jonathan Winstein (born 1981) is a U.S. computer scientist and journalist. He is currently a professor at Stanford University.
Previously, he was the Claude E. Shannon Research Assistant at the Computer Science and Artificial Intelligence Laboratory's Networks and Mobile Systems group at the Massachusetts Institute of Technology, pursuing a Ph.D. under Hari Balakrishnan. Winstein is best known as the author of Mosh, the mobile shell, a UDP-based ssh replacement optimized for mobile users featuring predictive local echo, automatic roaming, and high network resiliency.
He is the son of the late experimental physicist Bruce Winstein.
Computer science
Winstein was involved in several computer science projects.
Tyrannosaurus Lex is a system Winstein designed to hide messages in documents by altering specific words, published in 1999 while Winstein was in high school at the Illinois Mathematics and Science Academy. The system was the original work in the field of "linguistic steganography." However, analysis of Winstein's scheme by other researchers found that Tyrannosaurus Lex contains several vulnerabilities, allowing an eavesdropper to potentially decode hidden messages embedded using the system.
Mosh, the mobile shell, first released in March 2012, is a computing tool used to connect from a client computer to a server over the Internet, to run a remote terminal. Mosh is similar to SSH, with additional features meant to improve usability for mobile users.
qrpff is one of the shortest programs that implements the DeCSS algorithm, co-authored by Winstein and Marc Horowitz, while at MIT.
LAMP was a project at MIT that allowed users to play CDs from a music library over the cable TV system.
Winstein, along with Joshua Mandel, built a device for Richard Stallman that allowed him to get past the MIT proximity-card-locked doors, while allowing him to remain anonymous. The device would identify itself as Winstein, Gerald Jay Sussman, or Hal Abelson, in order to open the door.
Journalism
Winstein was a news reporter for The Wall Street Journal'''s Boston bureau from 2005 to its closure in 2009, focusing on the biomedical beat. Prior to his stint at the Journal, he was a reporter and news editor for MIT's student newspaper, The Tech, and interned at The New York Sun''.
As a reporter, Winstein wrote several articles critical of medical studies.
Winstein also disclosed errors in Google Flu Trends.
References
Massachusetts Institute of Technology alumni
Place of birth missing (living people)
Living people
1981 births |
https://en.wikipedia.org/wiki/International%20Tree-Ring%20Data%20Bank | The International Tree-Ring Data Bank (ITRDB) is a data repository for tree ring measurements that has been maintained since 1990 by the United States' National Oceanic and Atmospheric Administration Paleoclimatology Program and World Data Center for Paleoclimatology. The ITRDB was initially established by Hal Fritts through the Laboratory of Tree-Ring Research at the University of Arizona, with a grant from the US National Science Foundation, following the First International Workshop on Dendrochronology in 1974. The ITRDB accepts all tree ring data with sufficient metadata to be uploaded, but its founding focus was on tree ring measurements intended for climatic studies.
Specific information is required for uploading data to the database, such as the raw tree ring measurements, an indication of the type of measurement (full ring widths, earlywood, latewood), and the location. However, the types of data and the rules for accuracy and precision of the primary data, tree-ring width measurements, are decided by the dendrochronologists who are contributing the data, rather than by NOAA or any other governing organization.
See also
Dendrochronology
References
External links
International Tree-Ring Data Bank
Ultimate Tree-Ring Web Pages
Laboratory of Tree-Ring Research University of Arizona
Archaeological databases
Dating methodologies in archaeology
Incremental dating
Scientific databases
Geochronological institutions and organizations
Dendrology |
https://en.wikipedia.org/wiki/Chloroclystis%20viridata | Chloroclystis viridata is a moth in the family Geometridae. It was described by Warren in 1895. It is found on Peninsular Malaysia and from Sulawesi to New Guinea.
Subspecies
Chloroclystis viridata viridata (Peninsular Malaysia)
Chloroclystis viridata phaeina Prout, 1958 (Sulawesi to New Guinea)
References
External links
Moths described in 1895
viridata |
https://en.wikipedia.org/wiki/Said%20Hadjerrouit | Said Hadjerrouit is a professor of informatics and computer science at the University of Agder in Kristiansand, Norway. He got a doctoral degree (Dr.Ing) in 1992 in the field of medical expert systems and artificial intelligence, and a master's degree (1985) in software engineering from the Technische Universität Berlin, Germany. His teaching in Berlin focused mostly on informatics and society, philosophical and ethical issues of computing, and computers in developing countries. In 1991, he moved from Berlin to Kristiansand, Norway, and worked at the Institute of Electronic Data processing at the University of Agder. In 1994, he moved to the Institute of Mathematical Sciences at the same university, where he was appointed as an associate professor for teaching object-oriented programming, Web engineering, software development, and databases. From 2004, his work shifted to didactics of informatics and computer science education, ICT in mathematics education, ICT-enhanced learning, Web-based learning resources, social software, and Web 2.0 technology. In 2008, Hadjerrouit made a major shift in his research focus from didactics of informatics and Computer Science to mathematics education and use of digital tools in teaching and learning mathematics. He has been teaching the doctoral course “Theories in the Learning and Teaching of Mathematics” since 2014. He is also supervising two PhD students in the field of Flipped Classroom and documentational approach to mathematics education. Hadjerrouit has more than 140 publications in international journals and conference proceedings. He was awarded for Best Paper at Society for Information Technology and Teacher Education Conference (SITE 2010) in San Diego, California, United States, and IADIS e-Society conference 2012 in Berlin, Germany.
Hadjerrouit is leader of PhD committee for Specialisation in Mathematical Sciences (FDM).
Hadjerrouit is a member of the Agder Academy of Sciences and Letters, with members from Agder, Norway, and from abroad. Hadjerrouit is a member of ISI, and editorial review board of JELLO.
Selected publications
Hansen, N. K., &; Hadjerrouit, S. (2023). Analyzing Students’ Computational Thinking and Programming Skills for Mathematical Problem Solving. Open and Inclusive Educational Practice in the Digital World. . Springer Nature, pp. 155-173.
Stigberg, H.; Hadjerrouit, S.; Kaufmann, O. T.; Marentakis, G. (2022). Analysing tensions faced by pre-service mathematics teachers engaging in digital fabrication. Proceedings of the 45th Conference of the International Group for the Psychology of Mathematics Education (PME 45). . Universidad de Alicante, pp. 4-51 - 4-58.
Hansen, N.K. &; Hadjerrouit, S. (2021). Exploring Students’ Computational Thinking for Mathematical Problem-Solving: A Case Study. I: Proceedings of the 18th International Conference on Cognition and Exploratory Learning in Digital Age (CELDA2021). IADIS Press 2021, pp. 251-260.
Hadjerrouit, S.; Hansen, N.K. (2020). |
https://en.wikipedia.org/wiki/YDS%20algorithm | YDS is a scheduling algorithm for dynamic speed scaling processors which minimizes the total energy consumption. It was named after and developed by Yao et al. There is both an online and an offline version of the algorithm.
Offline Algorithm
Definitions:
There is a set of n Jobs , where each job has a release time , deadline and a processing volume .
is a certain time interval.
Also we have , the work density in .
And finally is the set of Jobs that must be processed in , that means Jobs with .
The algorithm then works as follows:
While
Determine the time interval of maximum density .
In process the jobs of at speed according to EDF
Set .
Remove from the time horizon and update the release times and deadlines of unscheduled jobs accordingly.
end While
In other terms it's a recursive algorithm that will follow these steps until all jobs are scheduled:
Calculate all intensities for all possible combinations of intervals. This means that for every start time and end time combination the intensity of work is calculated. For this the times of all jobs whose arrival time and deadline lie inside the interval are added and divided by the interval length. To speed up the process, only combinations of arrival times and later deadlines need to be considered, as times without arrival of a process or deadline can be shrunk to a smaller interval with the same processes, thus increasing intensity, and negative intervals are invalid. Then the maximum intensity interval is selected. In case of multiple equally intense intervals, one can be chosen at will, as intensities of non-overlapping intervals do not influence each other, and removing a part of an interval will not change the intensity of the rest, as processes are removed proportionally.
The processes inside this interval are scheduled using Earliest Deadline First, meaning that the job inside this interval whose deadline will arrive soonest is scheduled first, and so on. The jobs are executed at the above calculated intensity to fit all jobs inside the interval.
The interval is removed from the timeline, as no more calculations can be scheduled here. To simplify further calculations, all arrival times and deadlines of remaining jobs are recalculated to omit already occupied times. For example, assume a job with arrival time , deadline and a workload , and a job with , and . Assume the previous interval was from time to . To omit this interval the times of and need to be adjusted; workloads are unaffected, as no work has been done for either or . stays the same, as it's unaffected by later omissions. , however, needs to be changed to , as . This is the time job has left before its deadline. The arrival time becomes , as it would have been inside the removed interval. also becomes , as the time left after the removed interval is . It is important, however, to remember the actual arrival and deadline times for later assembly of the scheduling.
Repeat steps 1- |
https://en.wikipedia.org/wiki/George%20Michael%20%28computational%20physicist%29 | George Anthony Michael (February 16, 1926 – June 5, 2008) was an American computational physicist at Lawrence Livermore Laboratories,
involved in the development of supercomputing. He was one of the founders of the annual ACM/IEEE Supercomputing Conference, first held in 1988. The George Michael
Memorial Fellowship was established in his honor. George was the person primarily responsible for doing the interviews and gathering the materials for the web site: Stories of the Development of Large Scale Scientific Computing at Lawrence Livermore National Laboratory.
References
1926 births
2008 deaths
20th-century American physicists
American computer scientists
Lawrence Livermore National Laboratory staff
Computational physicists |
https://en.wikipedia.org/wiki/HCS%20clustering%20algorithm | The HCS (Highly Connected Subgraphs) clustering algorithm (also known as the HCS algorithm, and other names such as Highly Connected Clusters/Components/Kernels) is an algorithm based on graph connectivity for cluster analysis. It works by representing the similarity data in a similarity graph, and then finding all the highly connected subgraphs. It does not make any prior assumptions on the number of the clusters. This algorithm was published by Erez Hartuv and Ron Shamir in 2000.
The HCS algorithm gives a clustering solution, which is inherently meaningful in the application domain, since each solution cluster must have diameter 2 while a union of two solution clusters will have diameter 3.
Similarity modeling and preprocessing
The goal of cluster analysis is to group elements into disjoint subsets, or clusters, based on similarity between elements, so that elements in the same cluster are highly similar to each other (homogeneity), while elements from different clusters have low similarity to each other (separation). Similarity graph is one of the models to represent the similarity between elements, and in turn facilitate generating of clusters. To construct a similarity graph from similarity data, represent elements as vertices, and elicit edges between vertices when the similarity value between them is above some threshold.
Algorithm
In the similarity graph, the more edges exist for a given number of vertices, the more similar such a set of vertices are between each other. In other words, if we try to disconnect a similarity graph by removing edges, the more edges we need to remove before the graph becomes disconnected, the more similar the vertices in this graph. Minimum cut is a minimum set of edges without which the graph will become disconnected.
HCS clustering algorithm finds all the subgraphs with n vertices such that the minimum cut of those subgraphs contain more than n/2 edges, and identifies them as clusters. Such a subgraph is called a Highly Connected Subgraph (HCS). Single vertices are not considered clusters and are grouped into a singletons set S.
Given a similarity graph G(V,E), HCS clustering algorithm will check if it is already highly connected, if yes, returns G, otherwise uses the minimum cut of G to partition G into two subgraphs H and H', and recursively run HCS clustering algorithm on H and H'.
Example
The following animation shows how the HCS clustering algorithm partitions a similarity graph into three clusters.
Pseudocode
function HCS(G(V, E)) is
if G is highly connected then
return (G)
else
(H1, H2, C) ← MINIMUMCUT(G)
HCS(H1)
HCS(H2)
end if
end function
The step of finding the minimum cut on graph is a subroutine that can be implemented using different algorithms for this problem. See below for an example algorithm for finding minimum cut using randomization.
Complexity
The running time of the HCS clustering algorithm is bounded by × f(n, m |
https://en.wikipedia.org/wiki/Operation%20Cybersnare | Operation Cybersnare was a United States Secret Service operation in 1995 targeted at computer hackers.
In January 1995, the Secret Service set up an undercover bulletin board system in Bergen County, New Jersey. This was the first undercover Internet sting of its kind. With the help of an undercover informant, they advertised the bulletin board across the Internet. The topics for discussion were cellular telephone cloning and computer hacking.
In September, twelve raids across the country resulted in the arrest of six hackers. From the press release, those arrested were:
Richard Lacap, of Katy, Texas, who used the computer alias of "Chillin" and Kevin Watkins, of Houston, Texas, who used the computer alias of "Led". Lacap and Watkins were charged by criminal complaint with conspiring to break into the computer system of an Oregon Cellular Telephone company.
Jeremy Cushing, of Huntington Beach, California, who used the computer alias of "Alpha Bits", was charged with trafficking in cloned cellular telephone equipment and stolen access devices used to program cellular telephones.
Frank Natoli, of Brooklyn, New York, used the computer alias of "Mmind". He was charged with trafficking in stolen access devices used to program cellular telephones.
Al Bradford, of Detroit, Michigan, who used the computer alias of "Cellfone", was charged with trafficking in unauthorized access devices used to program cellular telephones.
Michael Clarkson, of Brooklyn, New York, who used the computer alias of "Barcode", was charged with possessing and trafficking in hardware used to obtain unauthorized access to telecommunications services.
Sources
PMF, A British Hacker in America
Jeffrey Gold, "Internet Sting Operation Nets Six Attempting to Sell Stolen Data", Associated Press, 11 September 1995
Geoff Boucher, "Computer Hacker Snared in Cyber-Sting : Technology: Huntington Beach man is one of six arrested in alleged plot to steal credit card and cellular phone codes.", Los Angeles Times, 12 September 1995
Geoff Boucher, "On-Line Sting Just the Beginning, Says Cyber-Sleuth Squad", Los Angeles Times, 13 September 1995
Clifford J. Levy, "Secret Service Goes On Line and After Hackers", New York Times, 12 September 1995
Reily Gregson, "SECRET SERVICE ATTACKS CELLULAR FRAUD AT SOURCE, STOPS COMPUTER HACKERS", RCR Wireless, 18 September 1995
CTIA press release: "Wireless Industry Salutes U.S. Secret Service", 11 September 1995. (Archived)
Cybercrime
Hacking (computer security) |
https://en.wikipedia.org/wiki/Massive%20Online%20Analysis | Massive Online Analysis (MOA) is a free open-source software project specific for data stream mining with concept drift. It is written in Java and developed at the University of Waikato, New Zealand.
Description
MOA is an open-source framework software that allows to build and run experiments
of machine learning or data mining on evolving data streams. It includes a set of learners and stream generators that can be used from the Graphical User Interface (GUI), the command-line, and the Java API.
MOA contains several collections of machine learning algorithms:
Classification
Bayesian classifiers
Naive Bayes
Naive Bayes Multinomial
Decision trees classifiers
Decision Stump
Hoeffding Tree
Hoeffding Option Tree
Hoeffding Adaptive Tree
Meta classifiers
Bagging
Boosting
Bagging using ADWIN
Bagging using Adaptive-Size Hoeffding Trees.
Perceptron Stacking of Restricted Hoeffding Trees
Leveraging Bagging
Online Accuracy Updated Ensemble
Function classifiers
Perceptron
Stochastic gradient descent (SGD)
Pegasos
Drift classifiers
Self-Adjusting Memory
Probabilistic Adaptive Windowing
Multi-label classifiers
Active learning classifiers
Regression
FIMTDD
AMRules
Clustering
StreamKM++
CluStream
ClusTree
D-Stream
CobWeb.
Outlier detection
STORM
Abstract-C
COD
MCOD
AnyOut
Recommender systems
BRISMFPredictor
Frequent pattern mining
Itemsets
Graphs
Change detection algorithms
These algorithms are designed for large scale machine learning, dealing with concept drift, and big data streams in real time.
MOA supports bi-directional interaction with Weka (machine learning). MOA is free software released under the GNU GPL.
See also
ADAMS Workflow: Workflow engine for MOA and Weka (machine learning)
Streams: Flexible module environment for the design and execution of data stream experiments
Weka (machine learning)
Vowpal Wabbit
List of numerical analysis software
References
External links
MOA Project home page at University of Waikato in New Zealand
SAMOA Project home page at Yahoo Labs
Data mining and machine learning software
Free science software
Java (programming language) software
Free data analysis software |
https://en.wikipedia.org/wiki/Information%20security%20indicators | In information technology, benchmarking of computer security requires measurements for comparing both different IT systems and single IT systems in dedicated situations. The technical approach is a pre-defined catalog of security events (security incident and vulnerability) together with corresponding formula for the calculation of security indicators that are accepted and comprehensive.
Information security indicators have been standardized by the ETSI Industrial Specification Group (ISG) ISI. These indicators provide the basis to switch from a qualitative to a quantitative culture in IT Security Scope of measurements: External and internal threats (attempt and success), user's deviant behaviours, nonconformities and/or vulnerabilities (software, configuration, behavioural, general security framework). In 2019 the ISG ISI terminated and related standards will be maintained via the ETSI TC CYBER.
The list of Information Security Indicators belongs to the ISI framework that consists of the following eight closely linked Work Items:
ISI Indicators (ISI-001-1 and Guide ISI-001-2): A powerful way to assess security controls level of enforcement and effectiveness (+ benchmarking)
ISI Event Model (ISI-002): A comprehensive security event classification model (taxonomy + representation)
ISI Maturity (ISI-003): Necessary to assess the maturity level regarding overall SIEM capabilities (technology/people/process) and to weigh event detection results. Methodology complemented by ISI-005 (which is a more detailed and case-by-case approach)
ISI Guidelines for event detection implementation (ISI-004): Demonstrate through examples how to produce indicators and how to detect the related events with various means and methods (with classification of use cases/symptoms)
ISI Event Stimulation (ISI-005): Propose a way to produce security events and to test the effectiveness of existing detection means (for major types of events)
An ISI-compliant Measurement and Event Management Architecture for Cyber Security and Safety (ISI-006): This work item focuses on designing a cybersecurity language to model threat intelligence information and enable detection tools interoperability.
ISI Guidelines for building and operating a secured SOC (ISI-007): A set of requirements to build and operate a secured SOC (Security Operations Center) addressing technical, human and process aspects.
ISI Description of a whole organization-wide SIEM approach (ISI-008): A whole SIEM (CERT/SOC based) approach positioning all ISI aspects and specifications.
Preliminary work on information security indicators have been done by the French Club R2GS. The first public set of the ISI standards (security indicators list and event model) have been released in April 2013.
References
External links
ETSI ISG ISI members
ETSI TC CYBER (responsible for ISI maintenance)
ETSI ISI flyer
ISI Quick Reference Card
ISI events Quick Reference Card
Club R2GS portal
Data security
Security |
https://en.wikipedia.org/wiki/Kyle%20Cranmer | Kyle Cranmer is an American physicist and a professor at New York University at the Center for Cosmology and Particle Physics and Affiliated Faculty member at NYU's Center for Data Science. He is an experimental particle physicist working, primarily, on the Large Hadron Collider, based in Geneva, Switzerland. Cranmer popularized a collaborative statistical modeling approach and developed statistical methodology, which was used extensively for the discovery of the Higgs boson at the LHC in July, 2012.
Cranmer is active in the discussions of data preservation, open access, reproducibility, machine learning, and e-science in the context of particle physics.
Cranmer performed a search for exotic Higgs decays in archived data from the ALEPH experiment ten years after the experiment finalized. He serves on the advisory board for INSPIRE, the literature database for high energy physics, and is a member of the Data Preservation in High Energy Physics study group as well as Data and Software Preservation for Open Science.
Since the discovery of the Higgs boson, Cranmer has been a popular choice as a guest on science television programming. In July, 2011, Cranmer appeared in a special episode of Neil deGrasse Tyson's StarTalk Live alongside Bill Nye the Science Guy, Eugene Mirman, and Sarah Vowell. In a special video created for Science Nation, the online magazine of the National Science Foundation, Cranmer was featured discussing the Higgs boson in November, 2012. Cranmer also discussed the discovery of the Higgs boson in a TedxTalk in February, 2013.
Cranmer obtained his Ph.D. in physics from the University of Wisconsin-Madison in 2005 under Sau Lan Wu and his B.A. in mathematics and physics from Rice University. He was a Goldhaber Fellow at Brookhaven National Lab from 2005 to 2007. In 2007, he was awarded the Presidential Early Career Award for Scientists and Engineers from President George W. Bush via the Department of Energy's Office of Science and in 2009 he was awarded the National Science Foundation's Career Award. Cranmer is also a graduate of the Arkansas School for Mathematics, Sciences, and the Arts. He was named a Fellow of the American Physical Society in 2021.
References
External links
Kyle Cranmer's website at NYU
RooStats
People from Little Rock, Arkansas
Particle physicists
Living people
21st-century American physicists
Experimental physicists
Rice University alumni
Year of birth missing (living people)
University of Wisconsin–Madison alumni
New York University faculty
Fellows of the American Physical Society |
https://en.wikipedia.org/wiki/Krieau%20station | Krieau is a station on of the Vienna underground railway (U-Bahn) network. It is located in the Leopoldstadt district of the city, and is the station that serves both Messe Wien as well as the new campus of the Vienna University of Economics and Business. It opened in 2008. Krieau Station was originally to be named Trabrennstraße, but the planned name was changed in 2006, two years before the station opened.
Artwork
In October 2013 the French graffiti artist Honet was commissioned by Wiener Linien and KÖR Kunst im öffentlichen Raum (Public Art Vienna) to create an artwork on 14 concrete pillars of the station's elevated metro track. His work titled Totem Modern shows the faces of cartoon superheroes and sci-fi characters of the 1970s, reflecting the "erstwhile function of columns as historically and religiously charged objects from a present-day point of view" turning them into "cult objects".
Honet was followed in April 2014 by the Brazilian graffiti artist Speto who created an artwork titled 3 Brothers dedicated to the Villas-Bôas brothers on another 14 concrete pillars of the metro track. Honoring the brothers' legacy as champions for the indigenous population of the Amazon basin, Speto adorned the subway pillars with characters from Brazilian mythology like Boitatá, Iara or Boto and tribal pattern designs employing graphic styles of the Brazilian Literatura de Cordel.
References
External links
Buildings and structures in Leopoldstadt
Railway stations opened in 2008
2008 establishments in Austria
Vienna U-Bahn stations
Railway stations in Austria opened in the 2000s |
https://en.wikipedia.org/wiki/Markus%20Jakobsson | Markus Jakobsson is a computer security researcher, entrepreneur and writer, whose work is focused on the issue of digital security.
Career
Markus Jakobsson is currently Chief Scientist at Artema Labs, a company with the mission of disrupting and improving the crypto and NFT markets. Prior to his current role, he has been Chief Scientist at ByteDance; Chief of Security and Data Analytics at Amber Solutions, and Chief Scientist at Agari.
Prior to that, he was a senior director at Qualcomm as a result of Qualcomm acquiring FatSkunk in 2014; Jakobsson founded FatSkunk in 2009, and served as its CTO until the acquisition.
Prior to his position at Qualcomm, Jakobsson has served as Principal Scientist of Consumer Security at PayPal, held positions as the Principal Scientist for Palo Alto Research Center and RSA Security, and served as vice president of the International Financial Cryptography Association. Prior to these positions, he was a member of the Technical Staff at Bell Labs, and held a position at Xerox PARC. In addition, Jakobsson serves as an expert witness and is a member of the software and networking litigation group Harbor Labs.
He has a background in higher education, having served as an associate professor at Indiana University where he was also a cybersecurity researcher and co-director of the Center for Applied Cybersecurity Research. He has also served as an adjunct associate professor at New York University.
Companies founded and advisory positions
In, 2021, Jakobsson co-founded Artema Labs. In 2004, Jakobsson was one of the founders of the digital security company RavenWhite. The Silicon Valley company offers device identification technologies and other authentication solutions for businesses that pair customer identity with digital privacy. In 2006, he launched securitycartoon.com with Dr. Sukamol Srikwan. A website using comics to teach security awareness and understanding among the average internet user, it became the basis for the company Extricatus, which developed Fastwords, an online password creation system where users create secure passwords made of a string of everyday words in order to make them easy to remember. In 2009, Jakobsson co-founded Fatskunk, a company that targets malware that attacks wireless devices such as tablets and smartphones. He founded ZapFraud Inc in 2013. ZapFraud is an IP holding company with a portfolio related to targeted email attacks, including phishing and business email compromise.
Markus has served on the advisory boards for Metaforic, a VC-backed company that markets software that other developers can incorporate into their own for greater security, and Lifelock, an identity protection company. In addition, he is a visiting research fellow of the Anti-Phishing Working Group (APWG), an organization focused on reducing cybercrime.
Education
Jakobsson holds a PhD in computer science from the University of California at San Diego, as well as master's degrees from both the University of |
https://en.wikipedia.org/wiki/R.%20J.%20Huggins | R. J. (Bob) Huggins (born June 4, 1958) is a Canadian entrepreneur, director, producer, writer, and documentary filmmaker. He is best known for founding PaperofRecord.com, a comprehensive database of searchable newspaper image documents published in their original form. The company was sold to Google in 2006, and became an integral part of the Google News Archive.
Huggins has since pursued innovation projects in technology, mentorship, publishing, and documentary filmmaking.
Newspaper digitization
In 1999, Huggins founded Cold North Wind, Inc., the parent company of PaperofRecord.com. PaperofRecord.com became the first company in the world to digitize over 21 million archived newspaper images from publications in Canada, United States, Mexico and Europe. The PaperofRecord database offered its users the unique ability to view its newspaper archives in their original published format, and search the entire contents of each page, down to a single word. Canada's two largest newspapers, The Globe and Mail and the Toronto Star, were the first to participate in this process, with their archives being fully digitized and accessible to PaperofRecord subscribers by 2002.
The response to the PaperofRecord project was overwhelmingly positive, with economic historian Richard Salvucci describing the site as "simply essential for historians working on the history of Mexico." In 2012, the Canadian Baseball Network named Huggins one of the "Most Influential Canadians in Baseball," commending his work in archiving the entirety of The Sporting News as part of the PaperofRecord project.
The PaperofRecord.com collection was acquired in 'secret' in 2006 by Google and announced publicly in 2008. Huggins described the decision as "bittersweet," expressing disappointment that the Canadian government was not able to invest adequate resources into the project, while also attesting that "without the help and vision of a company such as Google, this immense, global, educational resource would not be possible on the scale that is being contemplated."
In his other involvement with newspaper digitization, Huggins was a founding member of The Globe and Mail'''s electronic information service team, Info Globe. He helped implement electronic “as of release” documents for Finance Canada and negotiated Soviet commercial electronic rights from Novosti Press Agency of the first commercial statistical trade information to the West for the New York Times Information Services.
Entrepreneurial work
Huggins has more than 25 years experience as a professional and entrepreneurial pioneer in the newspaper publishing, web/content publishing and high technology sectors. His publication, This Country Canada, received the Silver and Honorable Mention Awards at the Eighteenth National Magazine Awards in the Photojournalism and Words and Pictures categories respectively.
In 2002, Huggins was nominated as Canadian Entrepreneur of the Year by Ernst & Young. He was the Entrepreneur in Residenc |
https://en.wikipedia.org/wiki/Financial%20Review%20Sunday | Financial Review Sunday was an Australian business news television program produced by the Nine Network, in partnership with Fairfax Media. It aired on the Nine Network at 10:00am after Weekend Today and was hosted by Deborah Knight. The show premiered on 5 May 2013 and is sponsored by Westpac and CPA Australia.
Eddy Meyer was a reporter for the show and various journalists from the Australian Financial Review also contribute stories and interviews. Joe Aston featured as the Rear Window segment presenter.
Nine News reporter Jayne Azzopardi was a fill in presenter.
In March 2015, Nine Network announced that the program is cancelled.
References
Nine News
Australian television news shows
Television shows set in Sydney
2013 Australian television series debuts
2015 Australian television series endings
English-language television shows
Business-related television series |
https://en.wikipedia.org/wiki/Network%20Development%20Plan%20%E2%80%93%20Metropolitan%20Rail | The Network Development Plan – Metropolitan Rail was a long-term development plan for the rail network of Melbourne, Australia. It was written by Public Transport Victoria (PTV) and released to the public on 27 March 2013 under the Napthine government and received minor updates in 2016.
Similar plans were intended to be released for regional rail, trams and buses. However, only the metropolitan rail aspect of the plan was released to the public by PTV. The Regional Network Development Plan was released by the Victorian Department of Transport in 2016.
The primary aim of the metropolitan rail plan was to improve the efficiency, reliability and patronage of Melbourne's train network and transition it towards a rapid transit system. It set out a number of goals over four stages, to be carried out over 20 years. Then-CEO of PTV Ian Dobbs estimated the whole plan would cost about $30 billion.
In 2019 PTV was abolished as an independent, statutory government body and absorbed into the Victorian Department of Transport. The plan was influential on Melbourne's transport planning but does not represent current government policy.
Background
The Public Transport Development Authority, later trading as Public Transport Victoria, was established by the Victorian government under Premier Ted Baillieu with the intent of, among other things, planning and improving the operations of the rail network.
Plan
Stage 1: (Timeline 2012 – 2016)
This stage outlined immediate high priority goals to overcome urgent constraints, with a targeted completion date of 2016. All projects listed in Stage 1 had been completed in 2022.
Stage 2: (Timeline 2016 – 2022)
The second stage focused on creating a "metro-style" system by segregating operations and creating end-to-end lines, with a targeted completion date of 2022. It is expected that most projects in stage 2 will be completed by 2025.
Stage 3: (Timeline 2022 – 2027)
This stage focuses on extending the network to growth areas and suburbs without railway access, and utilising the preceding growth in capacity. It is to be completed within 15 years, before 2027.
Some projects are planned to happen in the next decade. Some projects may be built in a different form of transit, such as Rowville line becoming a possible light rail corridor or Doncaster line becoming a proper bus rapid transit corridor.
Implementation of HCS across the network is uncertain as of 2023.
Stage 4: (Timeline 2027 – 2032)
The final stage involves further utilisation of extra capacity and preparing for future growth in Melbourne. The stage is to be carried out within 20 years, before 2032.
The reconfiguration of the metropolitan rail network will create seven independently operated lines similar to other rapid transit systems
Some projects listed are planned to be completed in the next decade but are still in their early stages. most details about these projects are still unknown.
Reception and legacy
2018 Transport for Victoria plan
In Oc |
https://en.wikipedia.org/wiki/E.T.%20Gleitsmann | E.T. Gleitsmann was a German producer of printing ink, founded in Dresden in 1847 by Emil Theodor Gleitsmann. It would later expand into an international network with branches in Austria (Vienna/Rabenstein), Hungary (Budapest), Italy (Turin) and Sweden (Trelleborg).
The headquarters moved to Berlin in 1953. It eventually became part of the Huber Group and changed its name to Gleitsmann Security Inks in 1998.
Swedish factory
A factory in Trelleborg, Sweden was established in 1901. After World War II, it became independently owned in 1948, changing its name to G-Man. After a series of mergers and ownership changes the company is now a part of Flint Group.
References
Companies established in 1847
Manufacturing companies based in Dresden
1847 establishments in Germany |
https://en.wikipedia.org/wiki/Bel%20RTL | Bel RTL is a commercial radio network broadcasting in Brussels and Wallonia (French-speaking Belgium). The station is owned by the Radio H holding company, which is part of the Belgium-based RTL Belgium. It is now owned by DPG Media and Groupe Rossel since 31 March 2022.
Bel RTL is currently (as of 2021) the most widely listened-to commercial radio station in the French Community of Belgium. It is the station's aim to be as big in Belgium as its sister station RTL is in France. Many of Bel RTL's presenters came to the station from the RTL-TVI television channel.
Coverage
Bel RTL broadcasts throughout Wallonia and Brussels on the following FM frequencies:
Programmes
References
External links
French-language radio stations in Belgium
Radio stations established in 1978
Radio stations established in 1991
1978 establishments in Belgium
1980s disestablishments in Belgium
1991 establishments in Belgium
Mass media in Brussels
Schaerbeek |
https://en.wikipedia.org/wiki/Bedwin%20Hacker | Bedwin Hacker is a Tunisian film about a computer hacker and TV pirate who broadcasts messages promoting freedom and equality for North Africans, and the attempt by the French Direction de la surveillance du territoire to find her and stop her. Released in 2003, it predated the 2010 Arab Spring by several years. The film breaks several stereotypes of typical Tunisian cinema, by focusing on mobility issues in 21st century Tunisia.
Plot summary
The film opens with a pirate transmission of a cartoon camel superimposed over a speech by president Truman about nuclear power. The piracy originates in a remote location in North Africa based on the handiwork of a 'lone wolf' hacker, Kalt, working with her young acquaintance who calls her 'auntie'.
Kalt then rescues her illegal immigrant friend Frida from the clutches of French immigration in Paris by hacking the immigration computers. Kalt meets a journalist named Chams. Escaping the situation there, which includes police raids on immigrant meetings, they flee back to Tunisia.
In Tunisia Kalt resumes her pirate transmissions. Throughout the film we see various European TV broadcasts interrupted by her transmissions of the camel and messages of freedom and equality for North Africans:
"In the third millennium there are other epochs, other places, other lives. We are not a mirage."
Somewhere inside the French DST, Julia, her boss, and agent Zbor try to track down the transmissions and stop them.
Julia happens to be the girlfriend of Chams, and she attempts to use him to infiltrate Kalt's supposed terrorist circle and bring her down. Chams is conflicted but complies with her commands. He puts on a ruse of interviewing the old man who owns the house where Kalt and his family live.
The old man is a poet and we hear snippets of his philosophical and artistic poetry espousing the value of freedom, which Chams ignores as he tries to find out the secrets of Kalt's life. He attempts to help Julia put a trojan horse onto Kalt's machine but Kalt has put in safeguards that stop him and reveal his treachery to her.
During flashbacks we learn that Julia believes the mysterious hacker to be the Pirate Mirage, who may also be her old acquaintance from École Polytechnique, which is, indeed, Kalt. A flashback shows them working on computers in their younger days as well as being lovers.
Kalt's friends accompany Frida to a music concert she is putting on. They are stopped by the Tunisian police who are working with the French authorities, but they are waved through
At one point the Camel tells the viewers to call a telephone number. Somehow this shuts down power to a section of Paris called La Défense. After this, the government pressure on Julia's department becomes intense as millions of dollars are spent trying to put out disinformation about the Bedwin Hacker as well as track her down.
As the DST closes in on Kalt, Chams becomes more and more conflicted, telling Julia that there are no terrorists in Ka |
https://en.wikipedia.org/wiki/Cyberdreams%20%28disambiguation%29 | Cyberdreams is a defunct American video game developer.
Cyberdreams may also refer to:
Cyberdreams, a 1995 French anthology by G. David Nordley
Cyberdreams, a 2002 album by Westworld
Isaac Asimov's Cyberdreams, a 1994 anthology edited by Gardner Dozois and Sheila Williams |
https://en.wikipedia.org/wiki/Pertino | Pertino was a computer networking software company based in Los Gatos, California. In December 2015, Pertino was acquired by Boise, Idaho-based networking company Cradlepoint.
History
Pertino was a Silicon Valley-based startup company founded by Craig Elliott and Scott Hankins. It derived its name from its city of origin, Cupertino, California. Elliott was a former Apple (NSDQ:AAPL) executive who later served as CEO at Packeteer Networks, where he led the company through its acquisition by Blue Coat Systems in 2008. Co-founder and CTO Hankins was the former Director of Engineering at Blue Coat Systems, where he led the software integration of PacketShaper technology into the onboard flight systems of the Northrop Grumman RQ-4 Global Hawk drone. Other founding members include Andrew Mastracci (Architect) and Michael Cartsonis (Former VP of Product and Business Development).
In October 2012, Pertino released a private beta test of its Cloud Network Engine in the Spiceworks online IT community. Also in October, Pertino raised US$ 8.5 million in venture capital from Norwest Venture Partners and Lightspeed Venture Partners, as well as a number of private investors. Pertino secured B-round financing five months later with a $20 million investment from Jafco Ventures.
Pertino introduced its network-as-a-service (NaaS) in February 2013.
In October 2013, Pertino announced its Fall release at the Spiceworld IT conference in Austin, Texas. The release included a redesigned web management dashboard and AppScape, reportedly the industry's first cloud network app store for network services. The company also released its beta version of Pertino for Android, giving visibility to Android devices, in addition to Windows and Mac machines.
In December 2015, Pertino was acquired by Boise, Idaho-based networking company Cradlepoint.
Products
The company developed technology known as a Cloud Network Engine, which combined software-defined networking (SDN) technology with wide-area network (WAN) virtualization, a field now known as SD-WAN. The network engine was hosted in data centers around the world such as Amazon Web Services, Rackspace, and Linode.
Users could deploy a cloud-based network by downloading and installing Pertino's software, and then invite others to join. Users installed software on office resources including file servers, application servers, local printers, or desktops to enable remote connectivity.
References
Companies established in 2011
Software companies based in California
Companies based in Santa Clara, California
Defunct software companies of the United States
Software companies established in 2011 |
https://en.wikipedia.org/wiki/Margaret%20Martonosi | Margaret Martonosi is an American computer scientist who is currently the Hugh Trumbull Adams '35 Professor of Computer Science at Princeton University. Martonosi is noted for her research in computer architecture and mobile computing with a particular focus on power-efficiency.
She is also noted for her leadership in
broadening participation in computing. She is currently co-chair of the CRA-W Board. In 2016, she was appointed to a six-year term as an Andrew Dickson White professor-at-large at Cornell University.
On September 23, 2019, the National Science Foundation announced that Martonosi had been selected to serve as head of the Directorate for Computer and Information Science and Engineering (CISE) at NSF. She started on February 1, 2020.
Biography
Margaret Rose Martonosi was born in Boston, Massachusetts. She received a B.S. in Electrical Engineering from Cornell University in 1986. She received a M.S. in Electrical Engineering from Stanford University in 1987 and a Ph.D in Electrical Engineering from Stanford University in 1993.
After a brief post-doc at Stanford, she joined the Department of Electrical Engineering at Princeton University in 1994 as an assistant professor. She was promoted to Associate Professor in 2000 and to Professor in 2004. In 2010 she moved to the Computer Science Department at Princeton University.
Career
In the area of power-aware computer architecture, Martonosi is known for her work on the Wattch power modeling infrastructure. Among the first architecture-level power modeling tools, Wattch demonstrated that early-stage power modeling tools could be accurate enough to allow computer architects to assess processor power consumption early enough in the design process for power to have a substantive influence on design choices. Martonosi's group has also performed research on real-system power measurement, and on power and thermal management.
In the area of mobile systems, some of Martonosi's early work included the design and deployment of mobile sensors for tracking zebras in Kenya This work demonstrated the use of delay tolerant protocols and low-power GPS devices for wildlife tracking. More recently, Martonosi has researched human mobility patterns and has developed novel mobile applications for crowdsourcing traffic information.
Awards
In 2009 she was named an ACM Fellow "for contributions in power-aware computing."
In 2010, she was named an IEEE Fellow "for contributions to power-efficient computer architecture and systems design."
In 2015, she was named a Jefferson Science Fellow and served in the Bureau of Economic and Business Affairs at the United States Department of State. She won the 2015 ISCA Influential Paper Award for her co-authored paper describing a framework for architectural-level power analysis and optimizations.
In 2017 she received the SIGMOBILE Test-of-Time Award for the ASPLOS 2002 paper entitled "Energy-Efficient Computing for Wildlife Tracking: Design Tradeoffs and Early E |
https://en.wikipedia.org/wiki/State%20Highway%2040%20%28New%20Zealand%29 | State Highway 40 was part of the New Zealand state highway network before it was revoked in 1991–92.
Route
SH 40 left at the small locality of Ahititi, north of New Plymouth. The route follows the Tongaporutu River and its tributaries, passing through the high King Country hills and the locality of Kotare. After Waitaanga, the road passes over the Waitaanga saddle and enters the Ōhura River valley. At Ōhura, old intersects with SH 40 at a TOTSO junction. It follows the Stratford to Okahukura Line along with the Ōhura River until Tuhua, after passing through Nihoniho and Matiere. From Tuhua, the road runs alongside the river and a major electricity pylon line past the Ongarue Substation until the intersection with at Mangatupoto.
See also
List of New Zealand state highways
References
40
New Plymouth District |
https://en.wikipedia.org/wiki/XCP%20%28protocol%29 | XCP (or) "Universal Measurement and Calibration Protocol" is a network protocol originating from ASAM for connecting calibration systems to electronic control units, ECUs. It enables read and write access to variables and memory contents of microcontroller systems at runtime. Entire datasets can be acquired or stimulated synchronous to events triggered by timers or operating conditions. In addition, XCP also supports programming of flash memory.
ASAM states "The primary purpose of XCP is to adjust internal parameters and acquire the current values of internal variables of an ECU. The first letter X in XCP expresses the fact that the protocol is designed for a variety of bus systems."
In 2003, the protocol was standardized as "ASAM MCD-1 XCP". XCP is a successor to CAN Calibration Protocol (CCP) that was developed back in the mid-1990s. At that time, CAN was the dominant networking system in the automobile industry. Over time, other bus systems such as LIN, MOST and FlexRay emerged and made it necessary to extend the protocol to other transport media. In addition, XCP supports synchronous and asynchronous serial interfaces. With Ethernet or USB as the transport medium, XCP can also serve as a standardized interface to analog measurement devices and to hardware interface converters to RAM emulators, JTAG or other microcontroller debug interfaces.
Due to its broad range of use, a primary goal in the development of XCP was to achieve as lean an implementation in the ECU as possible and high scalability of features and resource utilization. XCP can even be implemented on 8-bit microcontrollers for CAN or SCI with few resources, and it exploits the full potential of FlexRay or Ethernet on high-performance platforms.
As a two-layer protocol, XCP consistently separates the protocol and transport layers from one another and adheres to a Single-Master/Multi-Slave concept. XCP always uses the same protocol layer independent of the transport layer. The “X” in its name stands for the variable and interchangeable transport layer. Currently, the following transport layers are defined as standard by ASAM as of October 2016:
XCP on CAN
XCP on CAN FD
XCP on SxI (SPI, SCI)
XCP on Ethernet (TCP/IP and UDP/IP)
XCP on USB
XCP on FlexRay
In addition to supporting other transport layers, the successor to the CCP protocol contains many functional improvements such as:
Better resource utilization in the ECU
Synchronous data stimulation
Support of start-up measurements
Optimized communication by block transfer commands
Plug & play configuration
More precise measurement data acquisition by measuring the time stamps in the ECU (Slave)
XCP allows a client to access memory on the ECU using a format defined in a separate A2L file. Because the A2L format file contains all the information to access the information, the ECU code does not have to be recompiled to access different measurements or calibrations.
References
External links
ASAM official W |
https://en.wikipedia.org/wiki/Mindy%20Robinson | Melinda Lynn Robinson (born February 14, 1980) is a reality TV show personality. Robinson is known for appearing as herself on network shows Take Me Out, King of the Nerds, Millionaire Matchmaker, and appears in the music video "Sexy and I Know It". She has also appeared in the films Abstraction, Pain & Gain, Casting Couch, Mantervention, V/H/S/2, and the comedy The Bet.
She often works with her long–term boyfriend, former UFC heavyweight champion and actor Randy Couture.
Robinson ran in the Republican primary for Nevada's 3rd congressional district in the 2020 election, finishing third. Robinson has promoted various conspiracy theories on her Twitter account, including QAnon, the Clinton body count conspiracy theory, and a conspiracy theory regarding Stoneman Douglas High School shooting survivor and gun control activist David Hogg.
Filmography
Film
Television
Web
References
External links
1980 births
Living people
American conspiracy theorists
American film actresses
American libertarians
Participants in American reality television series
Nevada Republicans
21st-century American women |
https://en.wikipedia.org/wiki/Gymnoscelis%20albicaudata | Gymnoscelis albicaudata is a moth in the family Geometridae. It is found in the north-eastern Himalayas and on Peninsular Malaysia, Java, Bali, Borneo, the Philippines, Taiwan and Japan. The habitat consists of upper montane forests.
References
Moths described in 1897
Gymnoscelis
Moths of Japan |
https://en.wikipedia.org/wiki/Critical%20area%20%28computing%29 | In integrated circuit design, a critical area is a section of a circuit design wherein a particle of a particular size can cause a failure. It measures the sensitivity of the circuit to a reduction in yield.
The critical area on a single layer integrated circuit design is given by:
where is the area in which a defect of radius will cause a failure, and is the density function of said defect.
References
Integrated circuits |
https://en.wikipedia.org/wiki/Uncle%20Grandpa | Uncle Grandpa is an American animated television series created by Peter Browngardt for Cartoon Network that ran from September 2, 2013 to June 30, 2017. It is based on Browngardt's animated short of the same name from The Cartoonstitute. Uncle Grandpa is also a spin-off of Secret Mountain Fort Awesome, which was in turn a spin-off of The Cartoonstitute short. It was produced by Cartoon Network Studios.
The show is a surreal action-adventure comedy that relies extensively on visual gags and catchphrases. Creator Pete Browngardt has cited the work of cartoonists Don Martin, Gary Larson and Robert Crumb, as well as Golden Age–era animators such as Tex Avery and Max Fleischer when it came to developing the style of the show. Each 11-minute episode is presented in a unique format, consisting of a main seven to nine-minute story, some short bumpers typically composed of a quick visual joke, and an original short that focuses on the show's side characters.
Cartoon Network renewed the series for the fourth and fifth seasons: first splitting the second season (of 52 episodes) into two halves, which respectively became the second and third season, then dividing in half the already announced third season into the fourth and fifth season (of 26 and 23 episodes, respectively), which served as the final seasons.
The series premiered on Cartoon Network on September 2, 2013. While the pilot was nominated in 2010 for a Primetime Emmy Award in the category of Outstanding Short-Format Animated Program, the show itself was awarded in 2014 for the work of Nick Edwards in the category of Outstanding Individual in Animation. Kevin Michael Richardson was also nominated for a Annie Award in 2016 in the category of Best Voice Acting for an Animated TV/Broadcast Production for his work as Mr. Gus in the show. The show on itself received mixed reviews from critics, with praise toward the show's animation and visual humor, while also receiving criticism for its pacing.
Plot
Uncle Grandpa is a magical shapeshifting person that stops by children's houses every day to see how they are doing. The children he visits have a problem of their own and Uncle Grandpa tries to help them through a series of chaotic and surreal misadventures. He is a clowny sort of person who sometimes eats inedible objects (paper, and mostly books). He drives/lives in a UG-2000 model robotic RV known as the Perpetual Persistence and is accompanied by a talking red fanny pack named Belly Bag, a green dinosauroid named Mr. Gus, a static photographic cutout of a tiger named Giant Realistic Flying Tiger, and an anthropomorphic pepperoni pizza slice named Pizza Steve. He greets everybody using “Good Morning.”
Characters
Main
Uncle Grandpa (voiced by Peter Browngardt, Pendleton Ward in "For Pete! Love, Pen"), a comically dumb character yet also strong, magical, and shapeshifting and he loves helping kids with their problems.
Mr. Gus (voiced by Kevin Michael Richardson), a calm collected dinosaur who |
https://en.wikipedia.org/wiki/La%20viuda%20negra%20%28TV%20series%29 | La viuda negra (The Black Widow) is a 2014 Spanish-language telenovela produced by RTI Producciones and Televisa for United States-based television network Univisión and for Colombia-based television network Caracol Television. It is an adaptation of the book La patrona de Pablo Escobar of José Guarnizo based on history from Griselda Blanco.
Series overview
Season 1 (2014)
The story of Griselda Blanco, a woman who as a teenager was raped by her stepfather. Griselda decides to leave home because her mother did not believe her stepfather abused her. Griselda joins a gang of criminals in order to survive alone in the world. Griselda falls for "Cejas" the first man who betrays her and thus was born "La viuda negra", a woman who murdered her three husbands for having betrayed her. Her ruthlessness and ability to sell large amounts of cocaine earned her the reputation of The Queen of Cocaine.
Season 2 (2016)
Griselda has a second chance to live, but to save her son, who is sentenced to die in the electric chair, Griselda agrees to work with the American government and help end a dangerous drug cártel, whose leader is José Joaquín Guerra, alias "El Diablo".
Griselda feels lost and desolate in love, until she meets her guardian angel, Ángel Escudero. This time, the widow will have to choose between returning to wear the crown as "Queen of Cocaine" or secure the future of her new family.
Cast
Main
Ana Serradilla as Griselda Blanco
Julián Román as Richi
Ramiro Meneses as Sugar
Juan Pablo Gamboa as Norm Jones
Eileen Moreno as Young Griselda
Lucho Velasco as Robayo
Margarita Reyes as Celia
Alex Gil as Killer
Francisco Bolívar as Agente García
Jenni Osorio as Juliana
Emilia Ceballos as Katty
Isabel Cristina Estrada as Abogada
Katherine Porto as Susana
Raúl Méndez as Joaquí Guerra "El Diablo"
Luis Giraldo as Dylan
Héctor de Malba as Alejandro Buendía
Luis Roberto Guzmán as Ángel Escudero
Daniel Lugo as Carlos Sarmiento
César Mora as Pelón
Antonio Jiménez as Tyler
Martín Karpan as Brian Ferguson
María Fernanda Yepes as Venus
Héctor García as Yépez
Alejandro López as Rincón
Luis Carlos Fuquen as "Lokiño"
Claudio Cataño as Robert Jones
Mauricio Bastidas as Capó
Eduardo Victoria as Topo
Piero Melotti as El Zarco
Alfredo Anhert as Vicente
Angeline Moncayo as Daga
Sandra Beltrán as Cecilia
Recurring
Fernando Gaviria as General Guzmán
Tiaré Scanda as Ana Blanco
Viviana Serna as Karla Otálvaro
Julián Farietta as Michael Corleone Blanco
Yessy García as Silvio
Camilo Wilson as Cejas
Rodolfo Silva as Coronel Ronderos
Ana Soler as Señora Restrepo
María José Vargas as Child Griselda
Norma Nivia as La Alemana
Pablo Valentín as Ceferino
Carlos Felipe Sánchez as Young Richi
Luis Eduardo Motoa as Presidente de Colombia
Ilja Rosendahl as State Attorney
Vanessa Acosta Paula Gómez
Camila Kisara as Cinthya
Claudio Cataño as Robert Jones
Luis Fernando Montoya as Enzo Vittoria
Mauricio Mejía as Pablo Escobar
Lucas Vel |
https://en.wikipedia.org/wiki/CNN%20Films | Cable News Network Films (known as CNN Films) is a motion picture division of CNN under Warner Bros. Pictures, originally launched in 2012. Its first film, Girl Rising premiered in spring 2013 in the United States.
History
On October 8, 2012, CNN announced the creation of CNN Films. CNN says that it will acquire and commission original feature-length documentaries that will "examine an array of political, social, and economic subject matters." It also signed development deals with documentary directors Alex Gibney and Andrew Rossi. Since its creation, it already acquired the rights for Girl Rising, a 100-minute documentary narrated by Meryl Streep, Anne Hathaway, Kerry Washington, and Selena Gomez.
While the documentaries will initially air on CNN, the network reportedly plans to enter them in film festivals and distribute them to theaters as well.
At the 2013 Sundance Film Festival, CNN announced the acquisition of three documentaries. It acquired the rights to air Life Itself, a film adaptation of Roger Ebert's 2011 memoir, in television. The project will be directed by Steve James and executive produced by Martin Scorsese and Steven Zaillian. It is scheduled to air in 2014. The two other untitled projects are expected to air on CNN in 2013. One, from directors Michael Tucker and Petra Epperleini, centers on 9/11 and reconstructs the events at Ground Zero; the other, from director Andrew Rossi, focuses on the transformation of higher education, examining the costs and relevance of college.
CNN Films bought the television rights of Escape Fire: The Fight to Rescue American Healthcare which premiered on March 10, 2013, on CNN. The film was directed by Matthew Heineman and Susan Froemke. The film premiered on January 19, 2012, at the 2013 Sundance Film Festival and was theatrically released on October 5, 2012.
CNN Films acquired Penny Lane's Our Nixon, and CNN premiered the film in August 2013, while Cinedigm released it theatrically. The network has also then acquired the domestic television broadcast rights of the Sundance film selection Robert Stone's Pandora's Promise and aired it on CNN in November 2013 while it was theatrically released five months before.
On December 10, 2020, CNN Films teamed up with the BBC to produce a documentary about the development and manufacturing of vaccines for the COVID-19 pandemic. The documentary is produced by British virologist-turned-filmmaker Catherine Gale who also directs with American independent filmmaker and medical journalist Caleb Hellerman, and will air in 2021 on CNN in the United States under the tile Race for the Vaccine and BBC Two in the United Kingdom under the title Vaccine: The Inside Story.
Filmography
References
External links
Films
Film distributors of the United States
Film production companies of the United States
American companies established in 2012
Mass media companies established in 2012 |
https://en.wikipedia.org/wiki/My%20Kitchen%20Rules%20%28series%205%29 | The fifth season of the Australian competitive cooking competition show My Kitchen Rules premiered on the Seven Network on 27 January 2014.
Format changes
The Food Truck — From the Top 12 to Top 9 rounds, teams were divided into two groups, cooking in a restaurant-like environment. Members of the public were served the dishes and paid for what they believed the meal was worth. The group that made the most money won the challenge whilst the losing group had to compete in a following cook-off to avoid elimination. The truck was run by chef, Colin Fassnidge.
The Jury — From the Top 12 to Top 9 cook-off rounds, a jury was present and were able to save/send one of the competing teams to/from elimination. The jury was formed by the teams from the winning group of the Food Truck, and, if applicable, the People's Choice winner.
People Choice Winners — A slight change of rules was used for this season due to the inclusion of the Food Truck. Unlike previous seasons, the winner did not always receive immunity from elimination. To ensure there were even teams for the Food Truck, some winners were given an advantage instead, such as being able to select the teams or ingredients. This was applicable to People's Choice challenges 2 & 4.
Ultimate Instant Restaurant — The Top 5 teams headed back home to compete in an Ultimate Instant Restaurant round. They had to prepare two dishes for each course, with guest teams having the choice of which dish they wanted to order.
Teams
Elimination history
Competition details
Instant Restaurants
During the Instant Restaurant rounds, each team hosts a three-course dinner for judges and fellow teams in their allocated group. They are scored and ranked among their group, with the lowest scoring team being eliminated.
Round 1
Episodes 1 to 6
Airdate — 27 January to 4 February
Description — The first of the two instant restaurant groups are introduced into the competition in Round 1. The lowest scoring team at the end of this round is eliminated.
Round 2
Episodes 7 to 12
Airdate — 5 February to 16 February
Description — The second group now start their Instant Restaurant round. The same rules from the previous round apply and the lowest scoring team is eliminated.
Round 3 (Gatecrasher Round)
Episodes 13 to 18
Airdate — 17 February to 25 February
Description — In the third round of instant restaurants, the three lowest scoring safe teams in the first two groups combined, were to compete in another instant restaurant round. From here, three newly introduced 'gatecrasher' teams also joined the round. As per the first two rounds, the same format of scoring is repeated and the lowest scoring team is eliminated .
Top 12
People's Choice 1: Breakfast at Central
Episode 19
Airdate — 26 February 2014
Location — Central railway station, Sydney
Description — Teams must cook and serve a convenient, on-the-go breakfast for Sydney's commuters at Central Station. The public voted for their favourite dish, with the team re |
https://en.wikipedia.org/wiki/The%20Egg%20Salad%20Equivalency | "The Egg Salad Equivalency" is the twelfth episode of the sixth season of the American comedy television series The Big Bang Theory. The episode was originally aired on the CBS television network on January 3, 2013. The story was created by Chuck Lorre, Eric Kaplan and Jim Reynolds, then turned into a teleplay by Steven Molaro, Bill Prady and Steve Holland. Mark Cendrowski directed the episode.
"The Egg Salad Equivalency" received positive reviews from critics. In the United States, this episode was watched by 19.25 million viewers and received 6.1/18 percent rating among adults between 18 and 49, ranking first in both its timeslot and the night.
Synopsis
Sheldon's assistant, Alex, flirts with Leonard a little more openly, and he finally picks up on it. Leonard is intrigued by the prospect of being liked by two women at the same time, but he has no feelings for Alex whatsoever; he just likes the attention. When he discusses how to handle this issue with the guys, Sheldon immediately voices his displeasure with the scenario, feeling that Alex should focus on him alone. Sheldon covertly tries to get advice from Penny, Amy, and Bernadette about what to do using a thinly disguised scenario, but Penny figures out that he is referring to Leonard and Alex and gets irritated, even being more upset when Sheldon off-handedly reveals that Leonard enjoys Alex's flirtation.
Sheldon tries to talk to Alex about it directly, but his graphic suggestions and inappropriate comments about women cause her to file a sexual harassment complaint. Sheldon has the same problem with the Human Resources Administrator, calling black woman Janine Davis a "slave" to her biological urges, and tries to explain himself discussing a woman's menstrual cycle. Frustrated, Sheldon dishes out dirt on some of the inappropriate things the others have done in the past, which results in Raj, Howard and Leonard being called into HR alongside him. Sheldon is required to take an online sexual harassment course, which he delegates to Alex, saying he does not want to waste time on it.
Leonard gives Penny a musical apology about Alex's hitting on him. He also discovers that Penny can be insecure about their relationship though they make up after Leonard tells her that Alex means nothing to him. At the end of the episode, Penny decides to get over her insecurities by wearing a pair of eyeglasses to look smarter, which turns Leonard on.
Broadcast and reception
Ratings in the US
"The Egg Salad Equivalency" originally aired on CBS on January 3, 2013. The episode was watched 19.25 million viewers and received 6.1/18 percent rating among adults between 18 and 49. It was top in its timeslot, ahead of the Fox Network's reality television show Mobbed, and the repeat of National Broadcasting Company's comedy series 30 Rock, American Broadcasting Company's musical series Nashville, and The CW Television Network's drama The Vampire Diaries. The Big Bang Theory was also the highest rated show of the ni |
https://en.wikipedia.org/wiki/Fledborough%20Viaduct | Fledborough Viaduct is a former railway viaduct near Fledborough, Nottinghamshire which is now part of the national cycle network.
History
The viaduct is a substantial structure which carried the double-track LD&ECR's Chesterfield Market Place to Lincoln Central main line over the River Trent.
It is situated between the former stations of Fledborough and Clifton-on-Trent, but nearer the latter.
Opened in 1897, it consists of 59 arches spread either side of four metal girder spans which cross the river itself. Nine million bricks were used in its construction which cost £65,000.
Timetabled passenger services over the viaduct ended in September 1955, though summer weekend excursions from Nottinghamshire and Derbyshire to Cleethorpes and Mablethorpe and from Manchester Central to Yarmouth Vauxhall continued until 1964.
From the 1960s traffic east of Langwith Junction was overwhelmingly coal, much of which went straight from collieries to High Marnham Power Station which opened in 1959, this traffic therefore turned off about half a mile before the viaduct. The Grimsby to Whitland express fish train ran until at least 1962 via Fledborough and through Mansfield Central.
The four original steel truss spans over the River Trent were replaced with steel plate girder spans of single track width in 1965. These were positioned within the existing spans before the old spans were removed.
Traffic continued to run over the viaduct until 21 February 1980 when a goods train derailed at Clifton-on-Trent seriously damaging the track. Reinstatement was deemed uneconomic and the line from Pyewipe Junction over the viaduct as far as High Marnham was closed and ultimately lifted.
Coal traffic continued from the west to High Marnham power station until this closed in 2003. Since 2009 that stretch of line has become Network Rail's High Marnham Test Track.
Modern Times
Today the railway trackbed eastwards from the site of Fledborough station, across the viaduct, through Clifton to Doddington & Harby forms an off-road part of National Cycle Route 647 which is part of the National Cycle Network.
From Harby onwards through the site of Skellingthorpe almost to Pyewipe Junction the trackbed forms an off-road part of National Cycle Route 64.
See also
List of crossings of the River Trent
References
Sources
External links
Fledborough Viaduct on old OS map npemaps
Fledborough Viaduct signalling and trackwork plus High Marnham Power Station signalboxes
Fledborough Viaduct resumee and photo forgottenrelics
Fledborough Viaduct photos and bibliography transportheritage
Fledborough Viaduct photos oldminer
Fledborough Viaduct and High Marham Power Station neolithicsea
Fledborough Viaduct and Dukeries Trail nottinghamshire
Lancashire, Derbyshire and East Coast Railway structures
Railway viaducts in Nottinghamshire |
https://en.wikipedia.org/wiki/Human%20Olfactory%20Data%20Explorer | The Human Olfactory Data Explorer (HORDE) is a database of human olfactory receptors. The database provides information of the human olfactory receptor families, as well for dogs, platypuses, opossums and chimpanzees. The database is hosted at the Weizmann Institute of Science.
References
External links
HORDE home page
Biological databases |
https://en.wikipedia.org/wiki/MasterChef%20Australia%20%28series%205%29 | The fifth series of the Australian cooking game show MasterChef Australia premiered Sunday 2 June 2013 on Network Ten, with replays airing at 11am the following day.
This particular series of the show was won by Emma Dean who had defeated Lynton Tapp and Samira El Khafir in the grand finale on 1 September 2013.
Changes
With the filming location from previous series at 13 Doody Street in Alexandria, New South Wales shutting down in August 2012, the production moved to the Centenary Hall at the Royal Melbourne Showgrounds in Flemington, Victoria. Graeme Stone replaced Nicholas McKay as narrator.
Unlike previous seasons, the audition and preliminary stages were not broadcast; instead the season started with the Top 22 (instead of previously used Top 24). Series 5 featured themed weeks, starting with 'Girls vs. Boys'. Other themes included Italian and Middle Eastern cuisine-focused weeks, a Kids week and weeks based on regions of the country such as the Barossa Valley and Western Australia. Masterclass was filmed in front of a live audience, with Matt Preston joining Gary and George "behind the stove".
Along with the above changes, this season was also cast with contestant's personalities in mind above cooking ability in response to the success of the Seven Network's rival cooking show My Kitchen Rules. The changes were not well received by both critics and audiences, and led to disappointing ratings compared to previous seasons with the show sitting on an average of 570,000.
The Finale featured three finalists instead of two.
Contestants
Top 22
Future appearances
Emma Dean appeared on Series 6 as a guest judge for a Mystery Box and Invention test Challenge.
Emma also appeared on Series 10 at the Auditions to support the Top 50.
Lynton Tapp appeared on Series 12 and was eliminated on 19 April 2020, finishing 24th .
Christina Batista appeared on Series 14 and was eliminated on 10 May 2022, finishing 20th.
Guest chefs
Frank Camorra - MasterClass 1
Maggie Beer - Barossa Boot Camp Day 2, MasterClass 2
Will Woods - MasterClass 2
Curtis Stone - Offsite Challenge 1, MasterClass 7
Shannon Bennett - Offsite Challenge 1
Stephanie Alexander - MasterClass 3
Bernard Chu - Elimination Challenge 3
Antonio Carluccio - Offsite Challenge 2, MasterClass 4
Stefano De Pieri - Pressure Test 1
Guillaume Brahimi - Immunity Challenge 2
Russell Blaikie - Immunity Challenge 2
Matt Stone - Elimination Challenge 5
Brendan Pratt - MasterClass 5
Kate Lamont - MasterClass 5
Ian Curley - Elimination Challenge 6
Paul Wilson - MasterClass 6
Daniel Wilson - Pressure Test 2
Nick Palumbo - Second Chance Challenge 3
Aaron Turner - MasterClass 8
Kirsten Tibballs - Pressure Test 3, MasterClass 9
Heston Blumenthal - Pressure Test 4, Immunity Challenge 3, Offsite Challenge 4, Elimination Challenge 10, MasterClass 10
Greg Malouf - Dubai Team Challenge
Donovan Cooke - Service Challenge
Elimination chart
In Week 1, the six worst performers from the Protein Challenge then |
https://en.wikipedia.org/wiki/Microsoft%20Language%20Portal | Microsoft Language Portal is a multilingual online dictionary of computing terms.
It also offers free downloads of localization style guides, translations of user interface text, and a feedback feature. It was made public in 2009.
References
External links
MS Language Portal
Online dictionaries
Multilingual dictionaries
Microsoft websites
Translation databases
Glossaries
Internationalization and localization
Style guides for technical and scientific writing |
https://en.wikipedia.org/wiki/Tom%20Wilber | Tom Wilber is an American journalist and public speaker who specializes in environmental issues. During 25 years with Gannett's USA Today Network, he won multiple individual and team Best of Gannett honors for coverage of issues ranging from catastrophic flooding in upstate New York to impacts of shale gas development in New York and Pennsylvania. His 2012 book, Under the Surface: Fracking, Fortunes and the Fate of the Marcellus Shale (Cornell University Press), was selected as a finalist for the 2013 New York Public Library’s Helen Bernstein Book Award for Excellence in Journalism. He has taught newspaper journalism at Binghamton University, and holds a master's degree from the S.I. Newhouse School of Public Communications program at Syracuse University.
Books
Vanishing Point: The Search for a B-24 Bomber Crew Lost on the World War II Home Front, Three Hills, 2023.
Under the Surface: Fracking, Fortunes and the Fate of the Marcellus Shale, Cornell University Press, 2012.
Reviews
Publishers Weekly review of Vanishing Point
The New York Review of Books review of Under the Surface
Associated Press review of Under the Surface
Publishers Weekly review of Under the Surface
Library Journal review of Under the Surface
Journal of Comparative Policy Analysis review of Under the Surface
Interviews and articles
Radio interviews on WNYC'sThe Brian Lehrer Show
Radio interview on WSKG's Off the Page
Radio interview on WAMC's The Round Table
Radio interview on WCNY's Capitol Press Room
Radio interview on Australian Broadcasting Corporation's Radio National Breakfast
Movie review in The Huffington Post
Featured on The New York Times' Dot Earth
Article in Buffalo Spree
Article in the Press & Sun Bulletin
External links
Lecture at Cornell University, April 4, 2013: Fracking and the Future of Global Energy: Golden Age or Dark Age?
Tom Wilber's Shale Gas Review
References
Year of birth missing (living people)
Living people
Place of birth missing (living people)
American male journalists
S.I. Newhouse School of Public Communications alumni |
https://en.wikipedia.org/wiki/Evelyn%20E.%20Smith | Evelyn E. Smith (25 July 1922 – 4 July 2000) was an American writer of science fiction and mysteries, as well as a compiler of crossword puzzles.
Profile
During the 1950s, under her own name, Smith regularly published short stories and novelettes in such publications as Galaxy Science Fiction, Fantastic Universe and the The Magazine of Fantasy & Science Fiction. Her short fiction ranges from satires set in a post-apocalyptic setting such as "The Last of the Spode" and "The Hardest Bargain", to "BAXBR/DAXBR", where she explores the dangers of Martian crossword puzzles. Her science fiction novels chiefly deal with questions of gender identity and, like all of her work, are characterized by their wit and humor.
Smith is probably best known, however, for her Miss Melville Mystery series, which chronicles the exploits of a middle-aged socialite-turned-assassin.
Under the pseudonym of Delphine C. Lyons, she authored a number of gothic romance novels and the non-fiction works Everyday Witchcraft and Love Potions & Spells, which collect folklore and magical spells, and Fortune Telling, eight ways to read the future.
Smith's short story "At Last I've Found You" was adapted into an opera by Seymour Barab; it premiered in Charlotte, North Carolina in 1984.
Works
Novels
The Perfect Planet (1962)
Unpopular Planet (1975)
The Copy Shop (1985)
Short stories
"Tea Tray in the Sky" (1952)
"The Martian and the Magician" (1952)
"Not Fit for Children" (1953)
"The Last of the Spode" (1953) [also as by Evelyn Smith ]
"Nightmare on the Nose" (1953)
"BAXBR/DAXBR" (1954) also appeared as:
"Call Me Wizard" (1954)
"Gerda" (1954)
"The Agony of the Leaves" (1954)
"At Last I've Found You" (1954)
"Collector's Item" (1954)
"The Laminated Woman" (1954)
"The Vilbar Party" (1955)
"Dragon Lady" (1955)
"Helpfully Yours" (1955)
"The Big Jump" (1955)
"Man's Best Friend" (1955)
"The Princess and the Physicist" (1955)
"The Faithful Friend" (1955)
"Teragram" (1955)
"The Good Husband" (1955)
"The Doorway" (1955)
"Jack of No Trades" (1955)
"Weather Prediction" (1955)
"Floyd and the Eumenides" (1955)
"Bodyguard" (1956)
"The Captain's Mate" (1956)
"The Venus Trap" (1956)
"Mr. Replogle's Dream" (1956)
"Woman's Touch" (1957)
"The Ignoble Savages" (1957)
"The Lady from Aldebaran" (1957)
"Once a Greech" (1957)
"Outcast of Mars" (1957)
"The 4D Bargain" (1957)
"The Hardest Bargain" (1957)
"The Man Outside" (1957)
"The Most Sentimental Man" (1957)
"The Weegil" (1957)
"The Blue Tower" (1958)
"My Fair Planet" (1958)
"Never Come Midnight" (1958)
"Two Suns of Morcali" (1958) (variant title: "The Two Suns of Morcali")
"The People Upstairs" (1959)
"The Alternate Host" (1959)
"Someone To Watch Over Me" (1959)
"Send Her Victorious" (1960)
"A Day in the Suburbs" (1960)
"Sentry of the Sky" (1961)
"Softly While You're Sleeping" (1961)
"Robert E. Lee at Moscow" (1961)
"They Also Serve" (1962)
"Little Gregory" (1964)
"Calliope and Gherkin and the Yan |
https://en.wikipedia.org/wiki/Thomas%20E.%20Anderson | Thomas E. Anderson (born August 28, 1961) is an American computer scientist noted for his research on distributed computing, networking and operating systems.
Biography
Anderson received a B.A. in Philosophy from Harvard University in 1983. He received a M.S. in computer science from University of Washington in 1989 and a Ph.D in computer science from University of Washington in 1991.
He then joined the Department of Computer Science at the University of California, Berkeley as an assistant professor in 1991. While there he was promoted to associate professor in 1996. In 1997, he moved to the University of Washington as an associate professor. In 2001, he was promoted to professor, and in 2009 to the Robert E. Dinning Professor in Computer Science. He currently holds the Warren Francis and Wilma Kolm Bradley Endowed Chair.
Awards
His notable awards include:
ACM SIGOPS Mark Weiser Award in 2005
ACM Fellow in 2005
IEEE Koji Kobayashi Computers and Communications Award, 2013
USENIX Lifetime Achievement Award, 2014
National Academy of Engineering, 2016, for "contributions to the design of resilient and efficient distributed computer systems."
Works
References
External links
University of Washington web page: Thomas E. Anderson, Department of Computer Science
American computer scientists
University of Washington faculty
UC Berkeley College of Engineering faculty
ACM
Living people
Harvard College alumni
University of Washington alumni
1961 births
People from Orlando, Florida
Scientists from Florida
Members of the United States National Academy of Engineering |
https://en.wikipedia.org/wiki/Barson%20Baad | Barson Baad is a popular drama serial shown on the PTV network in 2006. The drama was written by Nasir Jaffri, scripted by the late Salman Wajih Hassan and directed by Syed Faisal Bukhari. The show was filmed in Pakistan and Scotland .
Plot
Barson Baad is a story of two brothers who live in Scotland.
Cast
Jawed Sheikh
Shabbir Jan
Khayyam Sarhadi
Ahsan Khan
Fareeda Shabbir
Kashif Mehmood
Narjis Amir
Hamda Raheel
Darakshan Tahir
Rehana Siddiqui
Eva Majid
Zaigham Jaffri
Production crew
Salman Wajih Hassan (screenplay)
Syed Nasir Jaffri (producer)(writer)
Syed Faisal Bukhari (director)
Wajid Ali Nashad (Music)
waris baig (Singer)
Mumtaz Khan
References
Pakistani drama television series
Urdu-language television shows
Pakistan Television Corporation original programming |
https://en.wikipedia.org/wiki/List%20of%20number-one%20Billboard%20Blues%20Albums%20of%20the%201990s | Blues Albums is a music chart published weekly by Billboard magazine which ranks the top selling blues albums in the United States, ranked by sales data as compiled by Nielsen SoundScan. The chart debut as the Top Blues Albums in the issue dated September 2, 1995, as a 15-position chart with its first number one being Eric Clapton's From the Cradle.
Its introduction was a culmination of commercial realities at the time and a recognition of the "enduring legacy and artistic force of this timeless genre".
Number-one blues albums of the 1990s
These are the albums which have reached number one on the Blues Albums chart during the 1990s, listed chronologically. Note that Billboard publishes charts with an issue date approximately 7–10 days in advance.
References
External links
United States Blues
Blues 1990s |
https://en.wikipedia.org/wiki/Sheelagh%20Carpendale | Sheelagh Carpendale is a Canadian artist and computer scientist working in the field of information visualization and human-computer interaction.
Profession
Carpendale is a professor at the School of Computing Science at Simon Fraser University, where she holds an NSERC/SMART Industrial Research Chair in Interactive Technologies. She was previously a professor at University of Calgary, where she held a Canada Research Chair in Information Visualization and an NSERC/AITF/SMART Industrial Research Chair in Interactive Technologies. She directs the Innovations in Visualization (InnoVis.) research group. At University of Calgary, she founded the interdisciplinary graduate group, Computational Media Design. Her research on information visualization, large interactive displays, and new media art draws on her dual background in Computer Science (BSc. and Ph.D. Simon Fraser University) and Visual Arts (Sheridan College, School of Design and Emily Carr, College of Art).
College
Carpendale left high school with science scholarships but instead initially opted for fine arts, attending Sheridan College, School of Design and Emily Carr, Institute of Art and Design. For ten years she worked professionally in the arts. During this time she was part of establishing the Harbourfront Arts Centre at York Quay, in Toronto. Subsequently, she has reconnected with her interests in math and science and studied computer science at Simon Fraser University. Her research expertise focuses on information visualization, interaction design, and qualitative empirical work and includes such projects as: visualizing ecological dynamics, using visualization to integrate scientific results and sounds from Antarctica to create a tool to inspire musical composition, visualizing uncertainty, visualizing social activities, and multi-touch and tabletop interaction. She has found the combined visual arts and computer science background invaluable in her research.
Recognition
She is the recipient of several major awards including the British Academy of Film and Television Arts Award (BAFTA) for Off-line Learning as well as academic and industrial grants from Natural Sciences and Engineering Research Council, Intel Inc., Canada Foundation for Innovation, and Forest Renewal British Columbia.
In 2012 she was awarded the NSERC E.W.R. Steacie Memorial Fellowship, which is given to the six top scientists nationally across all NSERC research areas and within 12 years of their PhD. She will also be featured in Canada's Science, Technology and Innovation Council State of the Nation 2012 report. In 2013, she was awarded the
Canadian Human Computer Communications Society (CHCCS) Achievement Award, which is presented periodically to a Canadian researcher who has made a substantial contribution to the fields of computer graphics, visualization, or human- computer interaction.
She was elected to the CHI Academy and received the IEEE VGTC Visualization Career Award in 2018.
In 2021, she was inducte |
https://en.wikipedia.org/wiki/PCGamingWiki | The PCGamingWiki is a British-based collaboratively edited free wiki internet encyclopaedia focused on collecting video game behaviour data (such as save locations and startup parameters), to optimising gameplay, and fixing issues found in PC games. Intended fixes and optimisations range from simple cut-scene removals, to modifications that allow for wide-screen resolutions, and more. The wiki site runs on MediaWiki software, and was created by Andrew Tsai, a British businessman from London, England. The site was founded on . As of October 2022, the PCGamingWiki has more than 30,000 registered users, and 48,000 content pages. Since its inception, the PCGamingWiki has been featured on numerous gaming focused websites, including Kotaku, Destructoid, and Rock Paper Shotgun. It regularly receives more than 10,000 unique page views a day.
History
The PCGamingWiki was founded on , by Andrew Tsai, who is also known under the username 'Andytizer'. Tsai was motivated to create the wiki based on his experiences with the games LA Noire and Titan Quest. The wiki was mostly baren until Andrew enlisted the help of users on the website Reddit.
On 11 April 2012, Tsai attempted to Kickstart the PCGamingWiki with a goal of $60,000. The project ended on 12 May 2012, failing to complete its goal and only earning $2,736. On 19 December 2012 the project was put on Kickstarter again, this time with a goal of £500. This was much more successful, ending on 20 January 2013 with more than 400% funding.
On 24 December 2012, the PCGamingWiki forums were created with help from user JRWR. The forums are used to discuss articles, improvements, fix problems, and report bugs. As of March 2014, there have been 3374 posts to the forums.
On 26 March 2013, Andrew Tsai announced a new section of the PCGamingWiki network entitled The Port Report. The Port Report would function in a similar way to the, then recently defunct, Port Authority section of GameSpy. The Port Report would focus on video games ported from video game console to PC, and judge them based on their technical prowess, rather than story or gameplay. Based on similar concepts from the wiki, The Port Report allows anyone to submit articles for publishing.
On 29 November 2014, a Patreon funding campaign with the goal of supporting the website was launched.
In April 2020, the wiki launched new categories to track a game's monetisation model, including the types of microtransactions present.
References
External links
PCGamingWiki.com
MediaWiki websites
Wiki communities
Online encyclopedias
Internet properties established in 2012
Video game websites
British websites |
https://en.wikipedia.org/wiki/Mohammed%20Assaf | Mohammad Jaber Abdul Rahman Assaf (; born 1 September 1989) is a Palestinian pop singer well known for being the winner of the second season of Arab Idol, broadcast by the MBC network. His victory received worldwide coverage from the media and was welcomed with joy by Palestinians and the rest of the Arab world. In 2013, Assaf was named a goodwill ambassador for peace by The United Nations Relief and Works Agency for Palestine Refugees (UNRWA). He was also named ambassador of culture and arts by the Palestinian government and was offered a position with "diplomatic standing" by Palestinian President Mahmoud Abbas. Assaf's story is the basis of the 2015 film The Idol, directed by Hany Abu-Assad. After Arab Idol, Assaf has gone on to enjoy huge popularity in the Arab World and the Arab diaspora and has released two albums and a great number of singles and collaborations. Most of his music is sung in the Iraqi and Gulf dialects.
Life
He was born in Misrata, Libya to Palestinian parents. He lived there until he was 4 years old, when his parents moved back to Gaza, he grew up in Khan Younis refugee camp with a middle class couple where he attended UNRWA elementary school. His mother's family hails from the village of Bayt Daras, which was captured and depopulated by the nascent IDF in 1948 and his father's family is from Beersheba. Assaf's parents moved to Khan Yunis Refugee Camp when he was four years old. He is one of six siblings, three of whom, including Assaf, have been involved in performing live music. Assaf's mother Intisar, a mathematics teacher, has stated that Assaf began singing at the age of five and "had a voice of someone who was much, much older." Before his role on the television show he was attending Gaza City's Palestine University majoring in media and public relations. Assaf did not have professional training as a singer; he started his career singing at weddings and other private events. He entered the public view in 2000 during a popular local television program where he called in and sung a nationalist song to the host's praise. Afterward, he was frequently offered contracts with local record companies. Sometime after his first performance, he sang in a local event in Gaza attended by late Palestinian president Yasser Arafat.
Arab Idol
Mohammad Assaf travelled from Gaza Strip to Egypt to audition for Arab Idol. It took him two days to reach Egypt by car due to complications on the border. At the beginning, he had to convince the Egyptian security at the border crossing, where he was stuck for two days, to leave Gaza. Once he reached the hotel where the auditions were taking place, the doors were closed in which they did not accept anymore auditions so he jumped over the wall. After he jumped over the wall, he couldn't get a number to audition; he sat hopelessly in the hall where other contestants were waiting for their turn. He started singing to the contestants, and a Palestinian contestant, Ramadan Abu Nahel, who was waitin |
https://en.wikipedia.org/wiki/Variable%20elimination | Variable elimination (VE) is a simple and general exact inference algorithm in probabilistic graphical models, such as Bayesian networks and Markov random fields. It can be used for inference of maximum a posteriori (MAP) state or estimation of conditional or marginal distributions over a subset of variables. The algorithm has exponential time complexity, but could be efficient in practice for low-treewidth graphs, if the proper elimination order is used.
Factors
Enabling a key reduction in algorithmic complexity, a factor , also known as a potential, of variables is a relation between each instantiation of of variables to a non-negative number, commonly denoted as . A factor does not necessarily have a set interpretation. One may perform operations on factors of different representations such as a probability distribution or conditional distribution. Joint distributions often become too large to handle as the complexity of this operation is exponential. Thus variable elimination becomes more feasible when computing factorized entities.
Basic Operations
Variable Summation
Algorithm 1, called sum-out (SO), or marginalization, eliminates a single variable from a set of factors, and returns the resulting set of factors. The algorithm collect-relevant simply returns those factors in involving variable .
Algorithm 1 sum-out(,)
= collect factors relevant to
= the product of all factors in
return
Example
Here we have a joint probability distribution. A variable, can be summed out between a set of instantiations where the set at minimum must agree over the remaining variables. The value of is irrelevant when it is the variable to be summed out.
After eliminating , its reference is excluded and we are left with a distribution only over the remaining variables and the sum of each instantiation.
The resulting distribution which follows the sum-out operation only helps to answer queries that do not mention . Also worthy to note, the summing-out operation is commutative.
Factor Multiplication
Computing a product between multiple factors results in a factor compatible with a single instantiation in each factor.
Algorithm 2 mult-factors(,)
= Union of all variables between product of factors
= a factor over where for all
For each instantiation
For 1 to
instantiation of variables consistent with
return
Factor multiplication is not only commutative but also associative.
Inference
The most common query type is in the form where and are disjoint subsets of , and is observed taking value . A basic algorithm to computing p(X|E = e) is called variable elimination (VE), first put forth in.
Taken from, this algorithm computes from a discrete Bayesian network B. VE calls SO to eliminate variables one by one. More specifically, in Algorithm 2, is the set C of conditional probability tables (henceforth "CPTs") for B, is a list of query variables, is a list of observed variables, is the corresponding list of observed |
https://en.wikipedia.org/wiki/Women%27s%20Justice%20Network | Women's Justice Network (WJN), formerly known as the Women in Prison Advocacy Network (WIPAN), is an incorporated not-for-profit charity based in Sydney, Australia, focused on advocacy around issues affecting female prisoners.
History
WIPAN was founded in 2008 by Kat Armstrong, Carol Berry, Marissa Sandler and Nicki Petrou, and is managed by a volunteer Management Committee, (The Board). WIPAN's co-founder Kat Armstrong was the organisation’s volunteer Director/CEO from early 2008 to January 2016.
The organisation expanded in 2014, thanks to a grant from the Department of Family and Community Services (NSW), and from early 2016, a new CEO, mentoring coordinator and housing and family coordinator were all able to be employed. WIPAN has also received small, one off charity grants and funding grants of the NSW Government, such as the three years of one-off funding grants from, the NSW Government, Office of Women, used to establish WIPAN's mentoring service in 2009.
WIPAN maintained that 84 per cent of women sent to prison in 2017 had committed non-violent offences.
In 2017, WIPAN rebranded with the trading name WJN and retained WIPAN as its legal name.
Description and aims
It is a volunteer-based organisation and focuses on advocacy around issues affecting female prisoners, providing support to women exiting prison through its mentoring program, with the aim to reduce rates of female incarceration and recidivism.
The organisation's work involves undertaking research and systemic advocacy around the needs of women prisoners and ex-prisoners at an institutional level, whilst also assisting ex-prisoners at an individual level through its mentoring program, the only such non-government service in New South Wales (NSW).
Activities
In consultation with other community groups, as well as partner peak body organisations such as the New South Wales Council of Social Services (NCOSS), WIPAN undertakes a broad range of research and advocacy activities including the production of resources guides, policy and research papers on issues such as the housing and support needs of women leaving prison and prisoner health. The organisation makes submissions to government on policy matters affecting female prisoners and their families such as sentencing, Apprehended Violence Orders (AVO) and prison privatisation.
In 2011, with funding from the Myer Foundation and working with the Public Interest Advocacy Centre (PIAC), WIPAN produced a self-help guide for women prisoners in NSW. The guide was designed to be distributed to female prisoners before release, and assist them to meet their own financial, housing, health, and legal needs, once in the community.
In 2012, with funding from the NSW Office for Women, WIPAN produced The Long Road to Freedom: A guide for women to escape the cycle of domestic violence and jail, a guide designed to assist women experiencing domestic violence who are also affected by the criminal justice system.
WIPAN attends and presents at |
https://en.wikipedia.org/wiki/List%20of%20fjords%2C%20channels%2C%20sounds%20and%20straits%20of%20Chile | The information regarding fjords, channels, sound and straits of Chile on this page is compiled from the data supplied by the National Geospatial-Intelligence Agency, Country Files (GNS).
Content
This list contains only:
Listnr - List number (Wikipedia intern)
Full name - reversed generic. The full name is the complete name that identifies a named feature. The full name is output in reversed generic, "Desertores, Canal" as stored in the database, as opposed to the reading order, "Canal Desertores".
Latitude of the feature in ± decimal degrees
Longitude of the feature in ± decimal degrees
Unique Feature Identifier (UFI) is a number which uniquely identifies a Geoname feature. Same UFI means same feature.
FDC is the Feature Designation Code
Other names listed by NGA for the same feature
This list doesn't include Chilean claims in the Antarctica.
NGA lists 1447 names for 838 features with generics like "Fiordo", "Seno", "Canal", "Paso", "Bahía", "Brazo", "Estrecho", "Ensenada", "Estero". This compilation moved repeated UFIs to the last column of the first name given by NGA.
NGA gives following definition of the features in Feature Designation Code:
CHNM, marine channel, that part of a body of water deep enough for navigation through an area otherwise not suitable
CHNN, navigation channel, a buoyed channel of sufficient depth for the safe navigation of vessels
STRT, strait, a relatively narrow waterway, usually narrower and less extensive than a sound, connecting two larger bodies of water
FJD(S), fjord(s), a long, narrow, steep-walled, deep-water arm(s) of the sea at high latitudes, usually along mountainous coasts
SD, sound, a long arm of the sea forming a channel between the mainland and an island or islands; or connecting two larger bodies of water
Although some features are called "Bahía", the designation code "BAY" was not selected.
More information
For more information about the feature search in GeoNames Search, using the Unique Feature Identifier (UFI) in the "Advanced Search" Form.
Overview
List of fjords, channels, sounds and straits of Chile
See also
List of islands of Chile
Drake Passage
Guía Narrows
Primera Angostura
Segunda Angostura
References
External links
United States Hydrographic Office, South America Pilot (1916)
Chile
Fjords
Geography of Chile |
https://en.wikipedia.org/wiki/Jean%20Montalat | Jean Montalat (12 July 1912, Tulle - 22 September 1971) was a French politician. During the Second World War, he was drafted into and subsequently joined the Alliance network of the French Resistance, escaping to Algeria in 1943 to join the Free French forces. He represented the French Section of the Workers' International (SFIO) in the National Assembly from 1951 to 1971 and was the mayor of Tulle from 1959 to 1971.
References
1912 births
1971 deaths
People from Tulle
Politicians from Nouvelle-Aquitaine
French Section of the Workers' International politicians
Deputies of the 2nd National Assembly of the French Fourth Republic
Deputies of the 3rd National Assembly of the French Fourth Republic
Deputies of the 1st National Assembly of the French Fifth Republic
Deputies of the 2nd National Assembly of the French Fifth Republic
Deputies of the 3rd National Assembly of the French Fifth Republic
Deputies of the 4th National Assembly of the French Fifth Republic
Mayors of places in Nouvelle-Aquitaine
French military personnel of World War II
French Resistance members
Free French military personnel of World War II
Recipients of the Croix de Guerre 1939–1945 (France)
Recipients of the Resistance Medal |
https://en.wikipedia.org/wiki/Julius%20Anatolyevich%20Schrader | Julius Anatolyevich Schreider, OP [Yu. A. Schreider] (28 October 192724 August 1998) was a mathematician, cyberneticist, philosopher, and a convert to Roman Catholicism.
Education and research work
Schrader was born in Dnepropetrovsk, Soviet Union. In 1946, he graduated from the renowned Mechanics and Mathematics Faculty of Moscow State University. He completed his doctoral work in 1949 and in 1950 completed his postdoctoral dissertation on functional analysis.
Schrader worked for several years in various scientific and mathematical training institutes in Moscow, before moving to the department of semiotics of the All-Russian Institute of Scientific and Technical Information at the Russian Academy of Sciences in 1961, where he remained until 1989. Schrader conducted foundational work in the early days of computer science and was appointed one of the Institute's Professors of Informatics in 1984.
In 1960 Schrader became interested in religion and philosophy, eventually devoting significant time to the formal study of philosophy and obtaining a doctorate in philosophy In 1981.
He wrote a number of books on both mathematics and philosophy, including "Equality, the Similarity of the Order" (1970), "Systems and Models" (1980), "The Nature of Biological Knowledge" (1991), "Fundamentals of Ethics" (1993), and "The Values That We Choose" (1999). He also published numerous articles, including in the journal "Problems of Philosophy". Several of his and his students' papers on the mathematics of concept hierarchies and mereology were published in English translation in the journal Automatic Documentation and Mathematical Linguistics (a translation of the journal Научно-Tехническая Информация; Nauchno-Tekhnicheskaya Informatsiya).
In 1989, Schrader moved to a permanent job at the Institute for Information Transmission Problems at the Russian Academy of Sciences. He taught at the Moscow State University in the Mechanics and Mathematics Department and Department of Structural and Applied Linguistics at the Faculty of Philology. He has published about 800 papers.
Conversion to Roman Catholicism
In 1970, Schrader was baptized in the Roman Catholic Church, an uncommon occurrence in the secular culture of the Soviet Union. In 1977, he joined the Third Order of the Dominican Order (Saint Dominic). Schrader's religious conversion resulted in his expulsion from the Communist Party and his demotion at the Institute.
In 1989 he became one of the organizers of the Catholic club "Spiritual Dialogue" and was elected its chairman. Since 1993 he was Academician-Secretary of the "Science and Theology" Department of the Russian Academy of Natural Sciences and chairman of the board of the Center of Philosophy, Psychology and Sociology of Religion.
In 1991, Schrader became Professor of the College of Catholic Theology of Saint Thomas Aquinas, and in 1996 Professor of the Biblical Theological Institute of Saint Andrew in the city of Moscow, where he taught courses on "E |
https://en.wikipedia.org/wiki/International%20Symposium%20on%20Symbolic%20and%20Algebraic%20Computation | ISSAC, the International Symposium on Symbolic and Algebraic Computation, is an academic conference in the field of computer algebra. ISSAC has been organized annually since 1988, typically in July. The conference is regularly sponsored by the Association for Computing Machinery special interest group SIGSAM, and the proceedings since 1989 have been published by ACM. ISSAC is considered as being one of the most influential conferences for the publication of scientific computing research.
History
The first ISSAC took place in Rome on 4–8 July 1988. It succeeded a series of meetings held between 1966 and 1987 under the names SYMSAM, SYMSAC, EUROCAL, EUROSAM and EUROCAM.
ISSAC Awards
The Richard D. Jenks Memorial Prize for excellence in software engineering applied to computer algebra is awarded at ISSAC every other year since 2004.
The ISSAC Distinguished Paper Award is awarded at ISSAC since 2002 to authors that display excellence in areas that include, but are not limited to, algebraic computation, symbolic-numeric computation, and system design and implementation.
The ISSAC Distinguished Student Author Award is awarded at ISSAC since 2004 to authors if they were a student at the time their paper was submitted.
Conference topics
Typical topics include:
exact linear algebra;
polynomial system solving;
symbolic summation;
symbolic integration and computational differential algebra;
computational group theory;
symbolic-numeric algorithms;
the design and implementation of computer algebra systems;
applications of computer algebra.
See also
Journal of Symbolic Computation
References
External links
ISSAC web page
Bibliographic information about ISSAC at DBLP
Computer algebra
Theoretical computer science conferences
Recurring events established in 1988
Association for Computing Machinery conferences |
https://en.wikipedia.org/wiki/International%20Symposium%20on%20Algorithms%20and%20Computation | ISAAC, the International Symposium on Algorithms and Computation, is an academic conference in the field of theoretical computer science. ISAAC has been organized annually since 1990. The proceedings are published by Springer-Verlag in the LNCS series.
References
Computer science conferences |
https://en.wikipedia.org/wiki/Computationally%20bounded%20adversary | In information theory, the computationally bounded adversary problem is a different way of looking at the problem of sending data over a noisy channel. In previous models the best that could be done was ensuring correct decoding for up to d/2 errors, where d was the Hamming distance of the code. The problem with doing it this way is that it does not take into consideration the actual amount of computing power available to the adversary. Rather, it only concerns itself with how many bits of a given code word can change and still have the message decode properly. In the computationally bounded adversary model the channel – the adversary – is restricted to only being able to perform a reasonable amount of computation to decide which bits of the code word need to change. In other words, this model does not need to consider how many errors can possibly be handled, but only how many errors could possibly be introduced given a reasonable amount of computing power on the part of the adversary. Once the channel has been given this restriction it becomes possible to construct codes that are both faster to encode and decode compared to previous methods that can also handle a large number of errors.
Comparison to other models
Worst-case model
At first glance, the worst-case model seems intuitively ideal. The guarantee that an algorithm will succeed no matter what is, of course, highly alluring. However, it demands too much. A real-life adversary cannot spend an indefinite amount of time examining a message in order to find the one error pattern which an algorithm would struggle with.
As a comparison, consider the Quicksort algorithm. In the worst-case scenario, Quicksort makes O(n2) comparisons; however, such an occurrence is rare. Quicksort almost invariably makes O(n log n) comparisons instead, and even outperforms other algorithms which can guarantee O(n log n) behavior. Let us suppose an adversary wishes to force the Quicksort algorithm to make O(n2) comparisons. Then he would have to search all of the n! permutations of the input string and test the algorithm on each until he found the one for which the algorithm runs significantly slower. But since this would take O(n!) time, it is clearly infeasible for an adversary to do this. Similarly, it is unreasonable to assume an adversary for an encoding and decoding system would be able to test every single error pattern in order to find the most effective one.
Stochastic noise model
The stochastic noise model can be described as a kind of "dumb" noise model. That is to say that it does not have the adaptability to deal with "intelligent" threats. Even if the attacker is bounded it is still possible that they might be able to overcome the stochastic model with a bit of cleverness. The stochastic model has no real way to fight against this sort of attack and as such is unsuited to dealing with the kind of "intelligent" threats that would be preferable to have defenses against.
Therefore, a computationally |
https://en.wikipedia.org/wiki/Santa%20Diabla | Santa Diabla (literally: Holy Devil, English title: Broken Angel) is an American telenovela written by José Ignacio Valenzuela, and produced by United States-based television network Telemundo Studios, Miami. The story begins with Gaby Espino and Carlos Ponce starring as the protagonists, while Aarón Díaz and Ximena Duque star as the antagonists.
Telemundo aired the serial as part of its 2013–2014 season. On August 6, 2013, the network began broadcasting Santa Diabla weeknights at 10pm/9c, replacing El Señor de los Cielos. As with most of its other telenovelas, the network broadcast English subtitles as closed captions on CC3.
Plot
Santa Diabla is the story of Santa Martínez (Gaby Espino), a woman who seeks revenge for the murder of her husband Willy Delgado (Lincoln Palomeque). Santa's revenge includes marrying Humberto Cano (Carlos Ponce), a powerful attorney in Marrero. Humberto hired Willy Delgado to give piano lessons to Humberto's niece Daniela Milan (Ana Osorio) at the Cano family's home, until Bárbara Cano (Wanda D'Isidoro), Daniela's mother and Humberto's sister, accused Willy of harassment and attempted rape of her daughter. Blaming the Canos for the unjust death of her husband, Santa intends to destroy the Cano family, but as she tries to complete her mission, she meets and falls in love with Santiago Cano (Aarón Díaz), Humberto and Bárbara's brother. All the while Inés Robledo (Ximena Duque) who is a rich and evil woman uses her power and influence to try and keep Santiago and Santa apart because of her obsession with Santiago.
Although Humberto is portrayed as the evil brother for most of the series, in a shocking twist, it is revealed that it is Santiago who is the evil brother. Everyone finds this out when it is revealed that Santiago was responsible for the murders occurring in Marrero. Santiago's mental disorder, dissociative identity disorder, causes him to kill people at will. It is also revealed that Humberto was aware of this, but kept it secret to protect his brother. Another reveal is how Santiago found a picture of Santa when he and Willy were in prison, and planned to make Santa his wife. Flashbacks recall that everything Santiago did was calculating and conniving.
In the end, Santa chooses Humberto, even though everybody thinks he's evil (she knows he is good). In the final episode after a dramatic scene, Humberto is killed by Santiago, and Santa never tells him that she is pregnant with his child. Santiago ends up in a mental asylum and it is left unclear if he escapes.
Cast
Starring
Gaby Espino as Amanda Brown / Santa Martínez -
Aarón Díaz as Santiago Cano -
Ximena Duque as Inés Robledo -
Carlos Ponce as Humberto Cano -
Recurring cast
Frances Ondiviela as Victoria Coletti -
Roberto Mateos as Patricio Vidal -
Lincoln Palomeque as Willy Delgado -
Wanda D'Isidoro as Bárbara Cano -
Ezequiel Montalt as Jorge "George" Millan -
Lis Vega as Lisette Guerrero -
Zully Montero as Hortensia de Santan |
https://en.wikipedia.org/wiki/Hildreth%20%28name%29 | Hildreth is both a surname and a given name. Notable people with the name include:
Surname:
Ellen Hildreth, co-inventor of the Marr–Hildreth algorithm in machine vision.
Horace A. Hildreth, governor of Maine, 1945–1949
James Hildreth, cricketer
Lee Hildreth, footballer
Lou Wills Hildreth (1928–2019), American Southern gospel performer, songwriter, talent agent and television host
Mark Hildreth, wrestler, known as Van Hammer
Mark Hildreth (actor)
Richard Hildreth, journalist, historian
Sam Hildreth, racehorse trainer
Samuel Hildreth (American Revolution) (1750–1823), a surgeon in the Massachusetts militia and aboard Massachusetts naval privateers during the American Revolutionary War
Samuel Prescott Hildreth (1783–1863), a pioneer physician, scientist, and historian in Ohio and the Northwest Territory
Wes Hildreth, or E. W. Hildreth, a notable USGS geologist
Given name:
Hildreth Frost, Colorado National Guardsman and lawyer
Hildreth Glyn-Jones (1895–1980), British barrister
Hildreth Meière, artist |
https://en.wikipedia.org/wiki/Interleaving%20%28disk%20storage%29 | In block storage devices such as hard disk drives, interleaving is a technique used to improve slow system performance by putting data accessed sequentially into non-sequential blocks, typically sectors. The number of physical sectors between consecutive logical sectors is called the interleave skip factor or skip factor.
Historically, interleaving was used in
Minimizing missed rotations between instructions on computers storing instructions on a drum memory
Ordering block storage on storage devices such as drums, floppy disk drives and hard disk drives. The purpose of interleaving was to adjust the time difference between when the program was ready to transfer data, and when those data were actually arriving at the drive head to be read. Interleaving was common prior to the 1990s, but faded from use as processing speeds increased. Modern disk storage is not interleaved. Modern operating systems do not use interleaving for, e.g., paging files.
Interleaving was used to arrange the sectors most efficiently, so that after reading a sector, time is allowed for processing, and then the next sector in sequence is ready to be read just as the computer is ready to do so. Matching the sector interleave to the processing speed therefore accelerates the data transfer, but an incorrect interleave can make the system perform markedly slower.
Information is typically stored on disks in small pieces referred to as sectors or blocks. These are arranged in concentric rings called tracks, across the surface of each disk. While it may be simplest to order the blocks directly on each track as 1 2 3 4 5 6 7 8 9, for early computing devices serial ordering was not practical.
Data to be written or read is saved to a special region of reusable memory referred to as a buffer. When data needed to be written, it was moved into the buffer, and then written from the buffer to the disk. When data was read, the reverse process transferred data first into the buffer and then to system RAM. Most early computers were not fast enough to read a sector, move the data from the buffer to system RAM, and be ready to read the next sector by the time that next sector was appearing under the read head.
If sectors were arranged in direct order, after the first sector was read, the computer might, for example, have sectors 2, 3 and 4 pass under the read head before it was ready to receive data again. The computer doesn't need sectors 4, 5, 6, 7, 8, 9, or 1, and must wait for them to pass by, before reading sector 2. This wait for the disk to spin around to the next sector slows the data transfer rate.
To correct for the processing delays, the ideal interleave for this system would be 1:4, ordering the sectors like this: 1 8 6 4 2 9 7 5 3. It reads sector 1, then processes it while the three sectors 8 6 and 4 pass by, and when the microprocessor becomes ready again, sector two is arriving just as it is needed.
A 1:1 interleave (skip factor of 0) places the sectors sequentially—1 2 3 |
https://en.wikipedia.org/wiki/Aakash%20%28tablet%20series%29 | Aakash, or Ubislate 7, is a series of low-cost tablet computers produced by DataWind, all of which use the Android operating system.
Datawind
DataWind is a British company that produce wireless web access products, and is the makers of Ubisurfer and pocketsurfer. The company was found in 2001 by brothers Suneet and Raja Singh Tuli, originally from Punjab. The company has offices in India, U.S. and Canada. It was contracted to make cheap tablet computers for students in India by the Ministry of Human Resource Development; it also sold them publicly as "Ubislate 7", but did not meet demand, so was criticized in the media. By May 2013, it had shipped all the pre-orders dating back to December 2011.
Models
The Ubislate 7 series includes the following models:
Ubislate 7
Ubislate 7+
Ubislate 7Ri
Ubislate 7R+
Ubislate 7Ci
Ubislate 7C+
Ubislate 7CZ (announced)
Variants
All the tablets in the series are categorized as follows:
Hardware
The Ubislate 7 Series Tablet has a seven-inch touchscreen with 800×480 pixel resolution and uses Cortex A8 800Mhz processor (256 MB RAM) while the others have Cortex A8 1 GHz processor with 512 MB RAM. The initial model had 2 full size USB ports while in the final models they were reduced to a single Micro USB port. The Ubislate 7+ had 2 GB flash memory while the final models have 4 GB flash memory. All of the models support MicroSD Cards, up to 32 GB. The final models also features a G-Sensor for maintaining orientation. Like other Android devices these have no physical buttons except a Home screen button, power button and volume rocker. The final models also has a front facing VGA Camera. The tablets use a proprietary power connector.
Software
The Ubislate 7+ runs on Android 2.2 Froyo while an update to 2.3 Gingerbread is available. All other models run on Android 4.0.3 Ice Cream Sandwich. The tablets have a customized version of the operating system, which includes:
Google Search in top left corner of homescreen
Workspace Effect Settings, next to google search
Volume Controls on the bottom,
Pre installed Apps include- App Killer, UbiInfo, Ubimail, Internet Ubisurfer etc.
The Ubislate 7+ has access to Getjar app store while others has complete access to Google Playstore.
References
Android (operating system) devices
Tablet computers |
https://en.wikipedia.org/wiki/Computer%20Arimaa | Computer Arimaa refers to the playing of the board game Arimaa by computer programs.
In 2002, Indian-American computer engineer Omar Syed published the rules to Arimaa and announced a $10,000 prize, available annually until 2020, for the first computer program (running on standard, off-the-shelf hardware) able to defeat each of three top-ranked human players in a three-game series. The prize was claimed in 2015, when a computer program played 7:2 against three human players. The game has been the subject of several research papers.
State space of Arimaa
Opening
The number of different ways that each player can set up their pieces at the beginning of the game is:
The player can put 8 rabbits on 16 possible squares, followed by 2 cats on the 8 remaining squares, 2 dogs on the 6 remaining squares, 2 horses on the four remaining squares, one camel on one of the two remaining squares, and the elephant on the final unused square.
Because each player can start the game with one of 64,864,800 opening setups, the total state space for the opening is:
As Christ-Jan Cox said in his Master's thesis, because the number of possible initial states is so large, "[i]t follows that it is very difficult to develop complete databases of opening moves."
Artificial intelligence techniques
Material evaluation
It is important for the computer to be able to evaluate the value of the pieces on the board so it can assess whether or not a capture or exchange would be desirable. Assessing the relative value of pieces is an area of ongoing Arimaa research. Some currently used systems are DAPE and FAME.
Techniques used in Arimaa bots
The following techniques are used by some or all of the artificial intelligence programs that play Arimaa:
Bitboards
Transposition tables
Zobrist hashing
Minimax and Alpha beta pruning
Killer moves and refutation tables
Static evaluation function
Quiescence search
Monte-Carlo Tree Search
UCT
Techniques rarely used In Arimaa bots
Opening book
Endgame tablebase
Computer performance
Several aspects of Arimaa make it difficult for computer programs to beat good human players. Because so much effort has gone into the development of strong chess-playing software, it is particularly relevant to understand why techniques applicable to chess are less effective for Arimaa.
Brute-force searching
The simplest chess programs use brute-force searching coupled with static position evaluation dominated by material considerations. They examine many, many possible moves, but they are not good (compared to humans) at determining who is winning at the end of a series of moves unless one side has more pieces than the other. The same is true for Arimaa programs, but their results are not as good in practice.
When brute-force searching is applied to Arimaa, the depth of the search is limited by the huge number of options each player has on each turn. Computationally, the number of options a player has available to them governs the number of different pa |
https://en.wikipedia.org/wiki/Jubatus | Jubatus is an open-source online machine learning and distributed computing framework developed at Nippon Telegraph and Telephone and Preferred Infrastructure. Its features include classification, recommendation, regression, anomaly detection and graph mining.
It supports many client languages, including C++, Java, Ruby and Python.
It uses Iterative Parameter Mixture for distributed machine learning.
Notable Features
Jubatus supports:
Multi-classification algorithms:
Perceptron
Passive Aggressive
Confidence Weighted
Adaptive Regularization of Weight Vectors
Normal Herd
Recommendation algorithms using:
Inverted index
Minhash
Locality-sensitive hashing
Regression algorithms:
Passive Aggressive
feature extraction method for natural language:
n-gram
Text segmentation
References
Data mining and machine learning software |
https://en.wikipedia.org/wiki/Drama%20%28British%20TV%20channel%29 | Drama is a British free-to-air television channel broadcasting drama (and, to a lesser extent, comedy, sci-fi) programming in the United Kingdom and Ireland as part of the UKTV network of channels.
History
The channel launched on 8 July 2013, replacing Blighty. On Freeview, the channel was placed on channel 20, previously occupied by Gold. On Sky, the channel initially launched on channel 291, in the overspill area of the Entertainment section and moved to channel 166 on 24 July after purchasing the slot used by PBS America (formerly named PBS UK in 2011). The channel launched on Virgin Media on 14 August on channel 190. In September 2014, UKTV blamed the channel for their 7% profits fall. In September 2018, Drama and Really were added to Virgin Media Ireland.
A timeshift channel, Drama +1, was launched on Sky and Virgin Media on 16 September 2019, replacing Travel Channel +1. On 25 January 2021, it was announced that the timeshift channel would be taking over CCXTV's Freeview slot (channel 73) on 1 February 2021, with CCXTV ending transmission. On 1 February 2022, BBC Three relaunched on Freeview channel 23 which shifted all the channels from that slot until Freeview 82 down a place, meaning that Drama +1 was now on channel 74.
On 28 March 2022, Drama +1 moved to Freeview 60 as a limited reach channel, as channel 25 was used by UKTV for their female skewing W channel, which means that Dave ja vu took the COM4 slot from Drama +1 on Freeview channel 74.
Programming
The channel is positioned as a home for British dramas from the last 40 years. The channel has featured classic drama series such as Auf Wiedersehen, Pet; The Cinder Path; Cranford; Lark Rise to Candleford; Pride & Prejudice; Sharpe; and Tipping the Velvet. As well as all these classic drama titles, a number of more recently produced BBC One daytime drama series have acquired a primetime slot on Drama. These series include Father Brown, which has been showing in an 8pm slot on Friday nights and which has a spin-off series, called Sister Boniface Mysteries. This period detective television series about a Catholic Nun is a co-production between BBC Studios and Britbox in North America, and has debuted as a free-to-air series directly on Drama, without getting an airing first on BBC One. In addition to drama programmes, the channel shows a number of classic BBC sitcoms in a teatime slot (usually between 5:25 pm and 8 pm) with Last of the Summer Wine, Porridge, The Upper Hand and Birds of a Feather currently being repeated in August 2023.
Current
All Creatures Great and Small
'Allo 'Allo!
Atlantic Crossing (UKTV Play only)
A Million Little Things (UKTV Play only)
Annika
As Time Goes By
Are You Being Served?
Bad Girls
Ballykissangel
Bergerac
The Bill
Berlin Station (UKTV Play only)
Birds of a Feather (the BBC series)
Born and Bred
The Brittas Empire
Broken
Brush Strokes
The Brokenwood Mysteries
Butterfiles
Call the Midwife
Campion
Case Histories
Catherine Cookson: The Cinder Path
Cathe |
https://en.wikipedia.org/wiki/Supreme%20Ruler%201936 | Supreme Ruler 1936 is a grand strategy computer wargame developed by BattleGoat Studios set in the World War II era. First announced in March 2013, It is a sequel to Supreme Ruler: Cold War. The game was released on May 9, 2014.
In the game, players will attempt to control a country during the time of the Second World War.
Supreme Ruler 1936 generally operates as a real time strategy game, though players are able to pause the game or change the game speed. The military element of the game is played through battalion-sized units represented on the game map, that can be controlled and given orders using the mouse individually or through groupings. Optionally players may leave unit initiative turned on, which will allow the AI to control military units for the player.
The player may also use Cabinet Ministers to assist with the operation of their regions, through the use of a Minister-priorities system and an in-game alerts system.
The main focus of the game are on four campaigns, each taking place from the perspective of either Germany, Japan, Italy, and the United Kingdom. Scenarios depict key moments in the war, such as Operation Barbarossa, Case Blue, and even alternate history scenarios such as Operation Sea Lion.
Multiplayer is available in LAN or Internet play for up to 16 players.
References
External links
SupremeWiki
2014 video games
Grand strategy video games
World War II grand strategy computer games
Government simulation video games
Real-time strategy video games
Video games developed in Canada
Windows games
Windows-only games
Multiplayer and single-player video games
Supreme Ruler |
https://en.wikipedia.org/wiki/Martin%20Allen%20%28disambiguation%29 | Martin Allen (born 1965) is an English football manager and a retired footballer.
Martin Allen may also refer to:
Martin Allen (entrepreneur) (1931–2009), American computer company founder
Martin Allen (writer), English playwright and screenwriter
Martin F. Allen (1842–1927), American banker, businessman, farmer and politician from Vermont
Martin Allen (numismatist), British numismatist and historian
Martin Allen (publicist) (born 1958), Welsh publicist and historical revisionist
Disappearance of Martin Allen (1964–1979)
See also
Marty Allen (1922–2018), American stand-up comedian and actor
Allen (surname) |
https://en.wikipedia.org/wiki/SiMPLE | SiMPLE (a recursive acronym for SiMPLE Modular Programming Language & Environment) is a programming development system that was created to provide easy programming capabilities for everybody, especially non-professionals.
Following the death of SiMPLE creator Bob Bishop, the SiMPLE Codeworks website and forums are now offline, however they can be accessed via the internet archive archive.org.
History
In 1995, Bob Bishop and Rich Whicker, (both former Apple Computer Engineers) decided to create a new programming language that would be easy enough for everyone to understand and use. (They felt that other existing languages such as C++ and their environments were far too complicated for beginners.) The programming language that they created was called SiMPLE.
Inspiration
SiMPLE is vaguely reminiscent of the AppleSoft BASIC programming language that existed on the old Apple-II computers. However, SiMPLE is not (and was never intended to be) merely a "clone" of Applesoft BASIC. It was merely "inspired" by it. There are many features of Applesoft that needed to be improved. For example, Applesoft was an interpreted language, and so it ran somewhat slowly (even for a 1MHZ processor). SiMPLE, on the other hand, compiles into an executable (.EXE) file. So it not only produces programs that run faster, but those programs can even run on computers that don't have SiMPLE installed.
Another difference between the two languages is in the use of line numbers. Applesoft required them; SiMPLE doesn't even use them. (Instead of typing program statements onto the black Apple screen, SiMPLE uses a text editor.) Furthermore the "FOR-NEXT" loops in Applesoft have been replaced by "Do-Loop" instructions in SiMPLE. (But they function in much the same way).
However, aside from a few differences in their outward appearances, writing programs in SiMPLE has a similar "feel" to what one experienced when writing programs in Applesoft. For example, when using SiMPLE in command-line mode, a program is run by simply typing the word "RUN" on a black screen (just as was done on the Apple!)
Versions
"Simple" is a generic term for three slightly different versions of the language: Micro-SiMPLE, Pro-SiMPLE, and Ultra-SiMPLE.
(a) Micro-SiMPLE is an introductory programming language designed to use only 4 keywords: Call, Set, If, and Goto. An example of a Micro-SiMPLE program listing (and a snapshot of the output display it generates) is shown in the figure below:
(b) Pro-SiMPLE is the DOS-based version of SiMPLE requiring the use of only 23 keywords. Its graphics capabilities are limited to only 16 colors with a resolution of only 640 x 480 pixels. Its sound capabilities are limited to simple "beeps" through the computer's built-in speaker.
(c) Ultra-SiMPLE is the Windows-based version of SiMPLE. It utilizes exactly the same 23 keywords as Pro-SiMPLE. Its graphics capabilities allow millions of colors in whatever resolution the user's system provides. Its sound capabili |
https://en.wikipedia.org/wiki/Gridcentric%2C%20Inc. | Gridcentric, Inc. was a software company that provided virtualization technology for datacenters. The company's flagship product, Virtual Memory Streaming (VMS) reduced boot time, memory footprint and operating costs for virtual machines in the cloud.
The company headquarters was in Toronto, Ontario, Canada with offices in Santa Clara, California.
Gridcentric was a privately held company backed by Rogers Ventures, Citrix Startup Accelerator, Investment Accelerator Fund, and Ontario Centers of Excellence. It was taken over by Google in 2014.
Gridcentric supported the OpenStack project and was used by several OpenStack based cloud computing companies including Piston Cloud Computing for building enterprise cloud platforms.,
History
Gridcentric, Inc. was founded in 2009 by Tim Smith, Adin Scannell and Andres Lagar-Cavilla. The technology is derived from a University of Toronto research project called Snowflock. The Snowflock project applied the idea of an operating system fork — a process of self-replication — to cluster management, a widely recognized problem that was proving intractable in the department’s computational biology lab. Gridcentric's technology was used for many purposes including optimizing Virtual Desktop Infrastructure platforms, development, and test server farms and scaling out critical IT services rapidly.
Gridcentric was acquired by Google in 2014.
See also
Cloud computing
Cloud infrastructure
Virtualization
References
Software companies established in 2009
Software companies disestablished in 2014
2009 establishments in Ontario
2014 disestablishments in Ontario
Defunct software companies of Canada
Google acquisitions
2014 mergers and acquisitions |
https://en.wikipedia.org/wiki/Ellen%20Weinberg%20Dreyfus | Ellen Weinberg Dreyfus is an American rabbi. She is a founder and former president of the Women's Rabbinic Network, which was founded in 1976 by fifteen female rabbinical students.
Biography
She was ordained in 1979 at the Hebrew Union College-Jewish Institute of Religion (HUC-JIR) in New York, and is to her knowledge the first woman to be ordained as a rabbi while pregnant.
In 1983, she moved back to Illinois, becoming the first female rabbi in that state. In 2001, she became the first female president of the Chicago Board of Rabbis. In 2004, HUC-JIR awarded her an honorary Doctor of Divinity degree. In 2009, she was installed as the second female president of Reform Judaism's Central Conference of American Rabbis (CCAR) in Jerusalem, making her the first female leader of a major rabbinic organization to begin her tenure in Israel. In 2009, she was also inducted onto the Board of Governors of HUC-JIR. In 2010, she was selected as one of the top 50 rabbis in America by Newsweek and the Sisterhood blog of The Jewish Daily Forward. In 2011, she received the Rabbi Mordecai Simon Memorial Award. The piece "From Generation to Generation: A Roundtable Discussion
with Rabbi Ellen Weinberg Dreyfus", appears in the book The Sacred Calling: Four Decades of Women in the Rabbinate, published in 2016.
Personal life
She is married and has three children. Her father-in-law is the late Rabbi A. Stanley Dreyfus, also a Reform Rabbi.
References
Rabbis from New York (state)
American Reform rabbis
Reform women rabbis
Living people
Year of birth missing (living people)
21st-century American rabbis |
https://en.wikipedia.org/wiki/Paleter%C3%ADa%20La%20Michoacana | La Michoacana is a group of different Mexican ice cream parlors, with an estimated 8 to 15 thousand locations in Mexico. The "chain" is a successful business model network of family-run businesses, no single company operates them as a formal franchise operation. In 1992 Alejandro Andrade and a group of enthusiastic ITESO students developed an image that would unify all La Michoacana parlors. And now it is an image that belongs to the entire town of Tocumbo. Paleterias bearing the name La Michoacana (or variations of this) are also found throughout the United States, Central and South America.
Controversy
The informal structure of the business has led to legal battles over the rights to the "La Michoacana" brand. Currently, there are 3 different brands in Mexico that claim the ownership of the name. These are Paleterías La Michoacana, La Nueva Michoacana, and Helados La Michoacana. All of them present the emblematic aesthetic of the name, presenting pink and black color palettes, and heavily featuring a Mexican woman in the logo.
Also, due to the fact these are not operated as franchises but rather as small, independent businesses that choose to use the name, the quality of the product, pricing, and variety, the product itself can vary widely between locations.
References
Ice cream brands
Ice cream parlors
Dairy products companies of Mexico |
https://en.wikipedia.org/wiki/IOS%207 | iOS 7 is the seventh major release of the iOS mobile operating system developed by Apple Inc., being the successor to iOS 6. It was announced at the company's Worldwide Developers Conference on June 10, 2013, and was released on September 18 of that year. It was succeeded by iOS 8 on September 17, 2014.
iOS 7 introduced a completely redesigned user interface, a design credited to a team led by Apple's former senior vice president of design, Jony Ive. The new look, featuring flatter icons, a new slide-to-unlock function, and new animations, was described by Ive as "profound and enduring beauty in simplicity". The new design was implemented throughout the operating system, including the Notification Center, which was updated with three tabs offering different views of information; notifications visible on the lock screen; a redesigned Siri voice assistant offering visual indicators; and a Control Center offering easy access to the most commonly used features. iOS 7 also introduced AirDrop, a wireless sharing technology; CarPlay, phone and car integration; and automatic app updates in the App Store. iOS 7 was the first version of iOS to support 64-bit apps and processors.
Reception of iOS 7 was mixed. The new design language was criticized, with critics noting the implementation of design changes rather than actual productivity improvements, and citing examples such as animations delaying access, lack of icon consistency, and buttons being hidden as negative aspects of the user experience. The addition of the Control Center was praised, as were updates to Siri and multitasking. Shortly after release, there were reports of the new design causing sickness, a trend explained as being caused by animations with similar effects as car sickness.
User adoption of iOS 7 was fast. Its iOS market share was reported to be as high as 35% after one day, and installed on 200 million devices within 5 days, which Apple stated was "the fastest software upgrade in history."
iOS 7 is the last version of iOS that supports the iPhone 4 as its successor, iOS 8, drops support for that model.
System features
Design
iOS 7 introduced a complete visual overhaul of the user interface. With "sharper, flatter icons, slimmer fonts, a new slide-to-unlock function, and a new control panel that slides up from the bottom of the screen for frequently accessed settings", the operating system also significantly redesigned the standard pre-installed apps from Apple. Jonathan Ive, Apple's head of design, commented that "There is a profound and enduring beauty in simplicity, in clarity, in efficiency. True simplicity is derived from so much more than just the absence of clutter and ornamentation - it's about bringing order to complexity. iOS 7 is a clear representation of these goals. It has a whole new structure that is coherent and applied across the entire system." The background colour of the Boot screen matches the device's front bezel colour of white or black, with the opposite |
https://en.wikipedia.org/wiki/CentreComm | CentreComm, now known as the NMCC (Network Management Control Centre) is Transport for London's emergency control room for London Buses. CentreComm's primary purpose is to provide an emergency control centre for London Buses contracted bus network. It is co-located with Transport for London's LSTCC centre which control London's traffic lights and traffic flow.
Should an incident require an emergency response such as road closures, accidents, robberies, theft, vandalism or assault; CentreComm would activate an emergency response such as calling the emergency services or diverting buses as appropriate.
CentreComm was conceived in 1979 and consisted of a mere handful of people equipped with two-way radios and paper records. In 2013 they had constant radio contact with all 8500 buses on the network via the iBus radio system. Through GPS fitted to each of London's buses they can monitor their location at all times.
CentreComm is in operation 24 hours a day 364 days a year, with Christmas Day being the only day it is closed.
For bus drivers, conductors and passenger assistants their services are activated via the IBus (London) system by initiating a code red (emergency) or code blue (information) call. For garage-based bus operator staff they are contacted via the telephone or by email.
References
External links
TfL: All London's buses now fitted with iBus
In Pictures: 30 Years of CentreComm
London Buses: Big Red Book
TfL Traffic
London Buses
Transport in London
Bus transport in London |
https://en.wikipedia.org/wiki/Stack-sortable%20permutation | In mathematics and computer science, a stack-sortable permutation (also called a tree permutation) is a permutation whose elements may be sorted by an algorithm whose internal storage is limited to a single stack data structure. The stack-sortable permutations are exactly the permutations that do not contain the permutation pattern 231; they are counted by the Catalan numbers, and may be placed in bijection with many other combinatorial objects with the same counting function including Dyck paths and binary trees.
Sorting with a stack
The problem of sorting an input sequence using a stack was first posed by , who gave the following linear time algorithm (closely related to algorithms for the later all nearest smaller values problem):
Initialize an empty stack
For each input value x:
While the stack is nonempty and x is larger than the top item on the stack, pop the stack to the output
Push x onto the stack
While the stack is nonempty, pop it to the output
Knuth observed that this algorithm correctly sorts some input sequences, and fails to sort others. For instance, the sequence 3,2,1 is correctly sorted: the three elements are all pushed onto the stack, and then popped in the order 1,2,3. However, the sequence 2,3,1 is not correctly sorted: the algorithm first pushes 2, and pops it when it sees the larger input value 3, causing 2 to be output before 1 rather than after it.
Because this algorithm is a comparison sort, its success or failure does not depend on the numerical values of the input sequence, but only on their relative order; that is, an input may be described by the permutation needed to form that input from a sorted sequence of the same length. Knuth characterized the permutations that this algorithm correctly sorts as being exactly the permutations that do not contain the permutation pattern 231: three elements x, y, and z, appearing in the input in that respective order, with z < x < y. Moreover, he observed that, if the algorithm fails to sort an input, then that input cannot be sorted with a single stack.
As well as inspiring much subsequent work on sorting using more complicated systems of stacks and related data structures, Knuth's research kicked off the study of permutation patterns and of permutation classes defined by forbidden patterns.
Bijections and enumeration
The sequence of pushes and pops performed by Knuth's sorting algorithm as it sorts a stack-sortable permutation form a Dyck language: reinterpreting a push as a left parenthesis and a pop as a right parenthesis produces a string of balanced parentheses. Moreover, every Dyck string comes from a stack-sortable permutation in this way, and every two different stack-sortable permutations produce different Dyck strings. For this reason, the number of stack-sortable permutations of length n is the same as the number of Dyck strings of length 2n, the Catalan number
Stack-sortable permutations may also be translated directly to and from (unlabeled) binary trees, anot |
https://en.wikipedia.org/wiki/Static%20%28keyword%29 | In some programming languages such as C (and its close descendants like C++, Objective-C, and Java), static is a reserved word controlling both lifetime (as a static variable) and visibility (depending on linkage). The effect of the keyword varies depending on the details of the specific programming language.
Common C/C++ behavior
In C and C++, the effect of the static keyword in C depends on where the declaration occurs.
static may act as a storage class (not to be confused with classes in object-oriented programming), as can extern, auto and register (which are also reserved words). Every variable and function has one of these storage classes; if a declaration does not specify the storage class, a context-dependent default is used:
extern for all top-level declarations in a source file,
auto for variables declared in function bodies.
In these languages, the term "static variable" has two meanings which are easy to confuse:
A variable with the same lifetime as the program, as described above (language-independent); or
(C-family-specific) A variable declared with storage class static.
Variables with storage class extern, which include variables declared at top level without an explicit storage class, are static in the first meaning but not the second.
Static global variable
A variable declared as static at the top level of a source file (outside any function definitions) is only visible throughout that file ("file scope", also known as "internal linkage"). In this usage, the keyword static is known as an "access specifier".
Static function
Similarly, a static functiona function declared as static at the top level of a source file (outside any class definitions)is only visible throughout that file ("file scope", also known as "internal linkage").
Static local variables
Variables declared as static inside a function are statically allocated, thus keep their memory location throughout all program execution, while having the same scope of visibility as automatic local variables (auto and register), meaning they remain local to the function. Hence whatever values the function puts into its static local variables during one call will still be present when the function is called again.
C++ specific
Static member variables
In C++, member variables declared as static inside class definitions are class variables (shared between all class instances, as opposed to instance variables).
Static member function
Similarly, a static member functiona member function declared as static inside a class definitionis meant to be relevant to all instances of a class rather than any specific instance. A member function declared as static can be called without instantiating the class.
Java
This keyword static means that this method is now a class method; it will be called through class name rather than through an object.
A static method is normally called as <classname>.methodname(), whereas an instance method is normally called as <objectname>.methodname(). |
https://en.wikipedia.org/wiki/Steve%20Teig | Steve Teig is an American business leader, currently serving as the Chief Executive Officer of Perceive.
Teig received a B.S.E. degree in Electrical Engineering and Computer Science from Princeton University in 1982. He went on to co-found Simplex in 1998, and the firm was acquired by Cadence Design Systems in 2002. Following the acquisition, he served as the Chief Scientist of Cadence. In 2003, he left Cadence to co-found Tabula, where he served as the new firm's Chief Technology Officer (CTO). Tabula focused on the design of semiconductors, particularly FPGAs. Tabula shut down on March 24, 2015. Following the dissolution of Tabula, he became the CTO of Tessera Technologies. Tessera changed its name to Xperi in 2017.
In 2020, Teig became the CEO of the semiconductor company Perceive. The firm focuses on hardware for running machine learning software on mobile devices. Perceive was incubated at Xperi, and Xperi is the majority shareholder in the new company.
He currently holds over 390 patents.
References
External links
Steve Teig biography, Perceive.io website
Steve Teig Lecture on New Ideas and Entrepreneurship to Stanford University Students, 2013.10.23
Steve Teig Lecture on Spacetime 3D Programmable Integrated Circuits (11 min), 2012.06.18
Steve Teig Lecture on Spacetime 3D Programmable Integrated Circuits (61 min), 2012.10.07
Edison Awards 2012: Presentation from Steve Teig (11 min), 2012.06.18
American chief technology officers
Princeton University alumni
American inventors
Living people
Year of birth missing (living people) |
https://en.wikipedia.org/wiki/Future%20TV%20Co.%20Ltd. | Future TV Co. Ltd. is a subsidiary of China Network Television (CNTV), the official online division of Chinese national public broadcaster China Central Television (CCTV). It focuses on the expansion of Internet TV business and runs a national Internet TV platform—China Internet TV (iCNTV), which has millions of online users.
iCNTV is the first internet television platform approved by China's State Administration of Radio, Film and Television (SARFT). It is capable of providing 450,000-hour request programs for audiences and has the exclusive Internet TV broadcasting rights for Olympics, the World Cup, etc. in China.
Foundation
In March 2010, CNTV got the first Internet TV license from the State Administration of Radio, Film and Television (SARFT), which regulates the radio, TV and film industries in China.
In 2011, SARFT issued rules that said makers of Internet TV equipment can only offer services in partnership with seven licensed content providers, including CNTV.
In December 2011, CNTV and Tencent formed a joint venture - Future TV Co Ltd -, to run the Internet TV business. CNTV holds the majority stake in the operation. Tencent, the country's largest Internet company by revenue, thus extends its services for all "four screens"- computers, tablets, mobile phones and televisions. The company also plans to introduce more services, such as entertainment and e-commerce services, to TV sets.
Under the strategic partnership pact, Tencent, which has more than 1,200 Internet services and applications, said it would initially put QQ, the most popular instant-messaging tool in China, on TV.
Cooperation
Xiaomi
State broadcaster China Network Television (CNTV) has formed a partnership with Beijing’s Xiaomi Technology Co., maker of a device that allows people to put streamed Internet video content on their TVs. The deal will allow Xiaomi to stream some of the state broadcaster's popular content on the platform of iCNTV.
TCL
Chinese television manufacturer TCL Multimedia, internet giant Tencent, and Future Television, the internet TV subsidiary of CCTV's national online TV station CNTV, have partnered to release TCL 3D smart cloud TVs installed with QQ TV 2.0. Future Television will provide the internet TV license used in the partnership.
Konka
Future TV announced a strategic partnership with Chinese television and consumer electronics manufacturer Konka on September 11, 2012, through which Future TV's HD film and television, sporting event, and educational resources, as well as content offered through partnerships with internet companies like Sina, Sohu, and PPLive (PPTV) will be offered to owners of Konka's X8100-series "dual-channel cloud sync" televisions.
LG
Future TV has announced a strategic partnership in Beijing to provide content for LG Electronics' multi-screen internet TV services available on LG devices such as TV sets, projectors, and content players. Future Television will also develop HD and 3D content as well as interactive media |
https://en.wikipedia.org/wiki/Your%20Pretty%20Face%20Is%20Going%20to%20Hell | Your Pretty Face Is Going to Hell is an American sitcom on Adult Swim, Cartoon Network's late night programming block. The series made its official debut on April 18, 2013, on Adult Swim. The show is a live-action workplace comedy about Gary, an associate demon, as he attempts to capture souls on earth in order to climb the corporate ladder of the underworld. Gary hopes to advance in Hell, but he may be too stupid, lazy and kind-hearted to realize his dreams of promotion.
The show was renewed for a fourth season, which began production on June 5, 2017. The fourth season premiered on May 3, 2019.
On July 13, 2020, co-creator Dave Willis announced that a one-off extended finale special was in the works, with the possibility of internet-exclusive shorts in the future. The extended finale was eventually scrapped, but the internet-exclusive shorts, known as Your Pretty Face Is Going to Hell: The Cartoon (originally announced as Your Pretty Face Is Going to Hell: The Animated Series), was released on October 21, 2022 on the Adult Swim YouTube channel.
The show is titled after a song from the 1973 album Raw Power by the Stooges.
Characters
Gary Bunda (Henry Zebrowski) – a bumbling employee in Hell whose schemes to condemn human souls to Hell often fail.
Claude Vernon (Craig Rowin, Season 1 & 2, Season 3 (second half), and season 4) – Gary's younger and more-respected intern who often shows him up at work. The character wasn't present for the 1st half of season 3, though no mention is made of what became of him. He returned in the 2nd half of season 3, starting with the episode "Golden Fiddle Week".
"Satan", a.k.a. *Darren Farley (Matt Servitto) – Gary's boss, who presents himself as THE Satan who rules all of Hell in seasons 1 & 2. But season 3 revealed that he's actually Darren Farley, a demon who rose up the ranks to middle management and runs the 11th circle of Hell, for "Miscellaneous" sins.
Lucas (Dana Snyder, Seasons 1 & 2) – Gary's former roommate who's still alive. He appears annoyed when Gary returns to Earth to recruit him.
Benji (Dan Triandiflou) – one of Gary's co-workers in Hell. He's usually in charge of making the orientation and 'how to' videos of Hell. Formerly a TV weatherman in Charlotte, he was arrested by the FBI for raping, murdering, and cannibalizing 143 children.
Troy Ersatz (Dana Snyder, Season 3 & 4) – Gary's co-worker in Hell who replaced Claude for most of season 3, is different from Snyder's other character Lucas. Unlike Claude, Troy tends to end up suffering alongside Gary when their various schemes backfire and was once temporarily demoted to "tortured soul" status.
Eddie (Eddie Pepitone) – a tortured soul. He's often seen as the victim of various acts of sadism brought on by the demons or Satan himself. He gets briefly promoted to demon status when Troy is demoted, in season 3, but Eddie was traumatized by the horrors inflicted upon him by the other demons and having a heart of gold, he failed to live up to |
https://en.wikipedia.org/wiki/Mitochondrial%20fusion | Mitochondria are dynamic organelles with the ability to fuse and divide (fission), forming constantly changing tubular networks in most eukaryotic cells. These mitochondrial dynamics, first observed over a hundred years ago are important for the health of the cell, and defects in dynamics lead to genetic disorders. Through fusion, mitochondria can overcome the dangerous consequences of genetic malfunction. The process of mitochondrial fusion involves a variety of proteins that assist the cell throughout the series of events that form this process.
Process overview
When cells experience metabolic or environmental stresses, mitochondrial fusion and fission work to maintain functional mitochondria. An increase in fusion activity leads to mitochondrial elongation, whereas an increase in fission activity results in mitochondrial fragmentation. The components of this process can influence programmed cell death and lead to neurodegenerative disorders such as Parkinson's disease. Such cell death can be caused by disruptions in the process of either fusion or fission.
The shapes of mitochondria in cells are continually changing via a combination of fission, fusion, and motility. Specifically, fusion assists in modifying stress by integrating the contents of slightly damaged mitochondria as a form of complementation. By enabling genetic complementation, fusion of the mitochondria allows for two mitochondrial genomes with different defects within the same organelle to individually encode what the other lacks. In doing so, these mitochondrial genomes generate all of the necessary components for a functional mitochondrion.
With mitochondrial fission
The combined effects of continuous fusion and fission give rise to mitochondrial networks. The mechanisms of mitochondrial fusion and fission are regulated by proteolysis and posttranslational modifications. The actions of fission, fusion and motility cause the shapes of these double membrane bound subcellular organelles we know as mitochondria to continually change.
The changes in balance between the rates of mitochondrial fission and fusion directly affect the wide range of mitochondrial lengths that can be observed in different cell types. Rapid fission and fusion of the mitochondria in cultured fibroblasts has been shown to promote the redistribution of mitochondrial green fluorescent protein (GFP) from one mitochondrion to all of the other mitochondria. This process can occur in a cell within a time period as short as an hour.
The significance of mitochondrial fission and fusion is distinct for nonproliferating neurons, which are unable to survive without mitochondrial fission. Such nonproliferating neurons cause two human diseases known as dominant optic atrophy and Charcot Marie Tooth disease type 2A, which are both caused by fusion defects. Though the importance of these processes is evident, it is still unclear why mitochondrial fission and fusion are necessary for nonproliferating cells.
Regulati |
https://en.wikipedia.org/wiki/Yunnanxane | Yunnanxane is a bioactive taxane diterpenoid first isolated from Taxus wallichiana. Yunnanxane was later isolated from cell cultures of Taxus cuspidata and Taxus chinensis. Four homologous esters of yunnanxane have also been isolated from Taxus. Yunnanxane is reported to have anticancer activity in vitro.
See also
Taxusin
Hongdoushans
References
Acetate esters
Taxanes
Vinylidene compounds |
https://en.wikipedia.org/wiki/Katerina%20Mikailenko | Katerina Mikailenko is an American actress, model, and dancer best known for her numerous guest appearances on various network television shows and for her memorable role as Wilhelmina "Billie" Lewis in the 2013 psychological thriller The Employer starring Malcolm McDowell. She grew up in a small town near Portland, Oregon and has also lived in San Diego and Los Angeles.
Career
As a child and teenager, Katerina appeared in modeling campaigns for Adidas, Nike and several department stores. She also fervently studied ballet and modern dance in a semi-professional dance troupe. Despite her natural stage presence, Katerina didn't discover her talent and love for acting until she was cast as Cecily in her high school's production of The Importance of Being Earnest. At the age of 16, Katerina and her family relocated to sunny San Diego, CA. The change in location let her give professional acting a real shot, and with her good looks, talent and a pinch of luck, she was quickly cast in numerous commercials. She followed these successes by booking guest appearances on award-winning shows such as CSI: Miami, Without a Trace, NCIS: Los Angeles and Parks and Recreation. Today she continues to work in both television and movies.
Partial filmography
Frat Party (2009) as Michela
Burlesque (2010) as Brittany
Crazy, Stupid, Love. (2011) as Stephanie
The Shower (2012) as Kim
The Employer (2013) as Billie
References
External links
Official website
American film actresses
American television actresses
Actresses from Oregon
Year of birth missing (living people)
Living people
21st-century American women |
https://en.wikipedia.org/wiki/Longest%20alternating%20subsequence | In combinatorial mathematics, probability, and computer science, in the longest alternating subsequence problem, one wants to find a subsequence of a given sequence in which the elements are in alternating order, and in which the sequence is as long as possible.
Formally, if is a sequence of distinct real numbers, then the subsequence is alternating<ref
name="Stanleybook"></ref> (or zigzag or down-up) if
Similarly, is reverse alternating (or up-down) if
Let denote the length (number of terms) of the longest alternating subsequence of . For example, if we consider some of the permutations of the integers 1,2,3,4,5, we have that
; because any sequence of 2 distinct digits are (by definition) alternating. (for example 1,2 or 1,4 or 3,5);
because 1,5,3,4 and 1,5,2,4 and 1,3,2,4 are all alternating, and there is no alternating subsequence with more elements;
because 5,3,4,1,2 is itself alternating.
Efficient algorithms
The longest alternating subsequence problem is solvable in time , where is the length of the original sequence.
Distributional results
If is a random permutation of the integers and , then it is possible to show<ref
name="widom"></ref><ref
name="stanley"></ref><ref
name="hr"></ref>
that
Moreover, as , the random variable , appropriately centered and scaled, converges to a standard normal distribution.
Online algorithms
The longest alternating subsequence problem has also been studied in the setting of online algorithms, in which the elements of are presented in an online fashion, and a decision maker needs to decide whether to include or exclude each element at the time it is first presented, without any knowledge of the elements that will be presented in the future,
and without the possibility of recalling on preceding observations.
Given a sequence of independent random variables with common continuous distribution , it is possible to construct a selection procedure that maximizes the expected number of alternating selections.
Such expected values can be tightly estimated, and it equals .
As , the optimal number of online alternating selections appropriately centered and scaled converges to a normal distribution.
See also
Alternating permutation
Permutation pattern and pattern avoidance
Counting local maxima and/or local minima in a given sequence
Turning point tests for testing statistical independence of observations
Number of alternating runs
Longest increasing subsequence
Longest common subsequence
References
Problems on strings
Permutations
Combinatorics
Dynamic programming |
https://en.wikipedia.org/wiki/Datatec | Datatec Limited, also known as Datatec Group, is an international ICT solutions and services group operating in more than 50 countries across North America, Latin America, Europe, Africa, Middle East, and Asia-Pacific. Through three core divisions, the Group offers Integration and Managed Services (Logicalis International and Logicalis Latin America) and Technology Distribution and Financial Services (Westcon International).
History
Datatec was founded in 1986 by Jens Montanana, who became the company's first CEO. The company's shares started trading on the Johannesburg Stock Exchange in December 1994, with share code DTC.
In 1996, Datatec launched a joint venture with UUNET to form UUNET Africa, an internet service provider.
In 1997, the company began its international expansion and acquired UK-based IT firm Logical Networks, which later changed its name to Logicalis.
In June 1998, Datatec acquired a 92.5% stake in US distributor Westcon, for $160 million. The company then consolidated its five continent distribution business under the Westcon brand.
In 1999, Datatec acquired communications consultancy Mason Communications.
In November 2000, the company announced it was selling its stake in UUNET Africa to WorldCom.
In 2004, Datatec acquired UK-based telecommunications research and consultancy firm Analysys for £12.8 million. Analysys was merged with Mason Communications and the new company was renamed Analysys Mason Group (AMG).
In October 2006, the company was listed on the Alternative Investment Market (AIM) of the London Stock Exchange.
In May 2014, the company spun off Mason Advisory from Analysys Mason, to focus on IT, cloud, security and mobile technology consulting.
In June 2017, Datatec announced it was selling the North and Latin American operations of Westcon-Comstor, along with 10% of the remaining part of Westcon (Westcon International) to Fremont, CA-based IT supply chain services company Synnex, for a reported consideration of up to $830 million.
In October 2017, Datatec announced they were planning to delist their secondary listing on the London AIM market on December 8 of that year, due to limited liquidity of the shares on AIM.
In May 2018, Logicalis Group, a subsidiary of Datatec, has signed an agreement to acquire 100 percent of the issued share capital of Coasin, a Chilean ICT services provider that also operates in Peru.
In August 2020, Datatec has announced that its subsidiary Logicalis Latin America has acquired a 30% stake in Brazilian Kumulus.
In June 2021, Logicalis Group acquired Siticom, a 5G integrator based in Germany.
In July 2022, the business disposed of its management consulting subsidiary, Analysys Mason, for £210m (R4.12bn) to UK fund manager Bridgepoint Development Capital.
Companies
Datatec's companies have three main divisions:
Technology distribution
Westcon International – a value-added distributor of security, collaboration, networking and datacentre.
IT managed services
Logicalis – a |
https://en.wikipedia.org/wiki/Offspring%20%28season%204%29 | The fourth season of Offspring, an Australian drama television series, premiered on 22 May 2013 on Network TEN. The season concluded after 13 episodes. Offspring is the story of the impossible loves of 30-something obstetrician Nina Proudman (Asher Keddie), and her fabulously messy family, as they navigate the chaos of modern life.
Cast
Regular
Asher Keddie as Nina Proudman
Kat Stewart as Billie Proudman
Matthew Le Nevez as Patrick Reid
Deborah Mailman as Cherie Butterfield (up to ep. 4)
Eddie Perfect as Mick Holland
Richard Davies as Jimmy Proudman
Linda Cropper as Geraldine Proudman
with Lachy Hulme as Martin Clegg
and John Waters as Darcy Proudman (up to ep. 4, recurring thereafter)
Recurring
Jane Harber as Zara Perkich
Alicia Gardiner as Kim Akerholt
Kate Jenkinson as Kate Reid
Henry & Jude Schimizzi Peart as Ray Proudman
Ido Drent as Lawrence Pethbridge
Caren Pistorius as Eloise Ward
Kevin Hofbauer as Joseph Green
Ben & Sam Hunter, Teah Whalan, Cleo Mete as Alfie Proudman
Guest starring
Kamahl as Dr. Bandari
Robbie Magasiva as Ugly Pete
Special guest starring
Garry McDonald as Phillip Noonan
Clare Bowditch as Rosanna Harding
Episodes
Ratings
Figures are OzTAM Data for the 5 City Metro areas.
Overnight - Live broadcast and recordings viewed the same night.
Consolidated - Live broadcast and recordings viewed within the following seven days.
References
2013 Australian television seasons |
https://en.wikipedia.org/wiki/QuickTime%20Graphics | QuickTime Graphics is a lossy video compression and decompression algorithm (codec) developed by Apple Inc. and first released as part of QuickTime 1.x in the early 1990s. The codec is also known by the name Apple Graphics and its FourCC SMC. The codec operates on 8-bit palettized RGB data. The bit-stream format of QuickTime Graphics has been reverse-engineered and a decoder has been implemented in the projects XAnim and libavcodec.
Technical Details
The input video that the codec operates on is in an 8-bit palettized RGB colorspace. Compression is achieved by conditional replenishment and by reducing the palette from 256 colors to a per-4×4 block adaptive palette of 1-16 colors. Because Apple Video operates in the image domain without motion compensation, decoding is much faster than MPEG-style codecs which use motion compensation and perform coding in a transform domain. As a tradeoff, the compression performance of Apple Graphics is lower. The decoding complexity is approximately 50% that of the QuickTime Animation codec.
Each frame is segmented into 4×4 blocks in raster-scan order. Each block can be coded in one of the following coding modes: skip mode, single color, 2-, 4-, and 8 color palette modes, two repeat modes, and PCM.
Skip mode
The skip mode realizes conditional replenishment. If a block is coded in skip mode, the content of the block at same location in the previous frame is copied to the current frame. Runs of skip blocks are coded in a run-length encoding scheme, enabling a high compression ratio in static areas of the picture.
Single color
In single color mode, the entire 4×4 block is painted with a single color. This mode can also be considered as a 1-color palette mode.
Palette (2, 4, or 8-color) modes
In the palette modes, each 4×4 block is coded with a 2, 4, or 8-color palette. To select one of the colors from the palette, 1, 2, or 3 bits per pixel are used, respectively. The palette can be written to the bitstream either explicitly or as a reference to an entry in the palette cache. The palette cache is a set of three circular buffers which store the 256 most recently used palettes, one each for of the 2, 4, and 8-color modes.
Interpreted as vector quantization, three-dimensional vectors with components red, green, and blue are quantized using a forward adaptive codebook with between 1 and 8 entries.
Repeat modes
There are two different repeat modes. In the single block repeat mode, the previous block is repeated a specified number of times. In the two block repeat mode, the previous two blocks are repeated a specified number of times.
PCM (16 color) mode
In 16-color mode, the color of each pixel in a block is explicitly written to the bit-stream. This mode is lossless and equivalent to raw PCM without any compression.
See also
Indexed color
Color quantization
Block truncation coding, a similar coding technique for grayscale content
Color Cell Compression, a similar coding technique for color content, b |
https://en.wikipedia.org/wiki/PO-552%20Road%20%28Spain%29 | The PO-552 is a road from the Galician Regional Roads Network. It constitutes one of the major transport systems for the coastal towns of the southern area of the Province of Pontevedra, in Galicia, Spain. It links the city of Vigo with Tui and the Portuguese border, parallel to the Ria of Vigo, the Atlantic Ocean and the lower course of the Miño River.
Roads in Spain |
https://en.wikipedia.org/wiki/2013%E2%80%9314%20Scunthorpe%20United%20F.C.%20season | The 2013–14 season is Scunthorpe United's 1st in the fourth division of English football since 2005, following their relegation from League One the previous season.
League Two Data
League table
Result Summary
Result by round
Kit
|
|
Squad
Statistics
|-
|colspan="14"|Players currently out on loan:
|-
|colspan="14"|Players who have left the club:
|}
Captains
Goalscorers
Disciplinary record
Suspensions served
Contracts
Transfers
In
Loans in
Out
Loans out
Fixtures and Results
Pre-season
League Two
FA Cup
League Cup
Johnstone's Paint Trophy
Overall summary
Summary
Score overview
2013-14
2013–14 Football League Two by team |
https://en.wikipedia.org/wiki/The%20Voice%20van%20Vlaanderen%20%28season%201%29 | The Voice van Vlaanderen is a Belgian reality talent show. The 1st season of the Flemish version premiered on November 25, 2011 on the vtm television network.
The coaches for the debut seasons were Natalia Druyts, one of the most popular recording artists of Flandern and close runner-up of the first season of Idool, Koen Wauters, host and judge of several casting shows and band member of Clouseau, Jasper Steverlinck, who was topping the Flemish single charts with a cover of Life on Mars and Alex Callier from Flemish band Hooverphonic. The winner of this season was Glenn Claes from team Jasper.
Blind auditions
Episode 1: November 25, 2011
Episode 2: 2 December 2011
Episode 3: 9 December 2011
Episode 4: 16 December 2011
Episode 5: 23 December 2011
Episode 6: 30 December 2011
The Wildcards
Battles
Coaches begin narrowing down the playing field by training the contestants with the help of "trusted advisors". Each episode featured eight battles consisting two of pairings from within each team, and each battle concluding with the respective coach eliminating one of the two contestants; the six winners for each coach advanced to the live shows.
– Battle Winner
Episode 7: 6 January 2012
Episode 8: 13 January 2012
Episode 9: 20 January 2012
Episode 10: 27 January 2012
The Sing-off
Each coach nominates 5 acts from their group to advance to the live shows. The 3 remaining acts per group will do a sing-off for the remaining live show spot.
Live shows
— Contestant was in the bottom and immediately eliminated by the coach
— Contestant was in the bottom and saved after the Sing-Off by the coach
— Contestant was in the bottom and eliminated after the Sing-Off by the coach
Episode 11: 3 February 2012
Episode 12: 10 February 2012
Episode 13: 17 February 2012
Episode 14: 23 February 2012
Episode 15: 2 March 2012
Semifinals: 9 March 2012
Semi-final results
Finals: 17 March 2012
After Snow Patrol performed Bert Voordeckers and Iris Van Straten, who placed 4th and 3rd respectively, were eliminated with Glenn Claes and Silke Mastbooms advancing to the superfinal. Glenn performed his single "Knight in Shining Armour" and Silke sang "Awake". The results were postponed for the next day.
Final results
Summaries
Results table
Team Jasper
Team Koen
Team Alex
Team Natalia
Summary of competitors
Competitors' table
– Winner
– Runner-up
– Third
– Fourth
– Eliminated
Ratings
References
1
2011 Belgian television seasons
2012 Belgian television seasons |
https://en.wikipedia.org/wiki/The%20Voice%20van%20Vlaanderen%20%28season%202%29 | The Voice van Vlaanderen is a Belgian reality talent show. The second season of the Flemish version premiered on January 18, 2013 on the vtm television network.
The coaches for this season were Natalia Druyts, one of the most popular recording artists of Flanders and close runner-up of the first season of Idool; Koen Wauters, host and judge of several casting shows and band member of Clouseau; Jasper Steverlinck, who was topping the Flemish single charts with a cover of "Life on Mars"; and Alex Callier from Flemish band Hooverphonic.
The winner of the second season was Paulien Mathues. Because she belonged to Jasper Steverlink's team, Steverlink became the winning coach of The Voice for the second time.
Contestants
Contestants for the live shows were:
Team Alex
Olivier De Laet
Jaouad Alloul
Jelle Degens
Kaat Verschueren
Toni Verlinden
Arnd Van Vlierden
Lauren Zweegers
Kaat Verschueren
Timna Vanhecke
Team Koen
Theo Dewitte
Maria Theresa Morales
Eva Van Puyvelde
Niels Cockx
Els Artois
Patricia Lalomia
Freija D'Hondt
Jeroen Van Troyen
Team Jasper
Paulien Mathues
Matthijs Vanstaen
Domien Cnockaert
Sarah Godard
Lisa Castelli
Lori Eestermans
Eva & Elias Storme
Bert Van Renne
Team Natalia
Robby Longo
Jana De Valck
Daniel López Montejo
Chris Medaer
Julie Barbé
Jens Oomes
Lucas Peeters
Bjorn & Joeri Rotthier
Blind auditions
Episode 1 (18 January 2013)
Episode 2 (25 January 2013)
Episode 3 (1 February 2013)
Episode 4 (8 February 2013)
Episode 5 (15 February 2013)
Episode 6 (22 February 2013)
Battles
Coaches begin narrowing down the playing field by training the contestants with the help of "trusted advisors". Each episode featured eight battles consisting two of pairings from within each team, and each battle concluding with the respective coach eliminating one of the two contestants; the six winners for each coach advanced to the live shows.
Coaches and assistant coaches
— Battle winner
— Stolen by Alex
— Stolen by Jasper
— Stolen by Koen
— Stolen by Natalia
Episode 7 (1 March 2013)
Episode 8 (8 March 2013)
Episode 9 (15 March 2013)
Episode 10 (22 March 2013)
Live shows
– Winner
– Kaat Verschueren quit after voice problems and was replaced by Lauren Zweegers
Episode 11 (29 March 2013)
Episode 12 (5 April)
Épisode 13 (12 avril)
Épisode 14 (19 April 2013)
Episode 15 — Semi-final (26 April 2013)
Result
Episode 16 — Final (3 May 2013)
Result
Summaries
Results table
References
2
2013 Belgian television seasons |
https://en.wikipedia.org/wiki/Bill%20Curtis | Bill Curtis (born 1948) is a software engineer best known for leading the development of the Capability Maturity Model and the People CMM in the Software Engineering Institute at Carnegie Mellon University, and for championing the spread of software process improvement and software measurement globally. In 2007 he was elected a Fellow of the Institute of Electrical and Electronics Engineers (IEEE) for his contributions to software process improvement and measurement. He was named to the 2022 class of ACM Fellows, "for contributions to software process, software measurement, and human factors in software engineering".
Personal life
Bill Curtis was born in Meridian, Texas in 1948. He graduated from the Fort Worth Country Day School in 1967 where the Bill Curtis Award is given annually to the undergraduate boy whose performance contributes the most to the athletic program. He received his B.A. in mathematics, psychology, and theater in 1971 from Eckerd College in St. Petersburg, Florida. He received his M.A. in 1974 from The University of Texas. He received his Ph.D. specializing in organizational psychology and statistics in 1975 from Texas Christian University in Fort Worth, Texas. He has published 4 books, over 150 articles, and has been on the editorial board of 7 academic journals. He lives in Fort Worth, Texas.
Career
He started his career as a Research Assistant Professor in the Organizational Research Group at the University of Washington where he also taught statistics in the Department of Psychology and performed research on programmer skills, leadership, and sports psychology. He entered software engineering in 1978 as the Manager of Software Management Research at Information System Programs in General Electric's Space Division (now a division of Lockheed Martin) in Arlington, Virginia, where he led research on software metrics and programming practices. From 1980 to 1983 he developed a global software productivity and quality measurement system in ITT's Programming Technology Center.
During 1983–1990 he founded the Human Interface Laboratory and later led Design Process Research at Microelectronics and Computer Technology Corporation (MCC), the American Fifth Generation Computer Research Consortium in Austin, Texas. During 1991–1992 he was the Director of the Software Process Program at the Software Engineering Institute (SEI) at Carnegie Mellon University in Pittsburgh, Pennsylvania, where he led the projects that produced the Capability Maturity Model for Software (CMM). and the People CMM In 1993 he returned to Austin and co-founded TeraQuest Metrics, which provided CMM-based improvement services globally. TeraQuest was acquired by Borland Software Corporation in 2005, where he became the Chief Process Officer.
He is currently the Director of the Consortium for IT Software Quality (CISQ), an IT industry leadership group founded by the SEI and OMG. Under his leadership CISQ has begun releasing standards for measuring the size (Au |
https://en.wikipedia.org/wiki/2013%E2%80%9314%20Barnsley%20F.C.%20season | The 2013–14 season was Barnsley's eighth consecutive season in the Championship since promotion in 2006.
Kit
|
|
Championship data
League table
Result summary
Result by round
Squad
Statistics
|-
|colspan="14"|Players who left the club during the season:
|}
Captains
As of 30 November 2013
Goalscorers
As of 3 May 2014
Disciplinary record
As of 3 May 2014
Suspensions served
As of 1 January 2014
Contracts
As of 30 June 2014
Transfers
As of 29 June 2014
In
Loans in
Out
Loans out
Fixtures & results
Pre-season
Championship
League Cup
FA Cup
Overall summary
Summary
As 3 May 2014
Score overview
As 3 May 2014
References
2013-14
2013–14 Football League Championship by team |
https://en.wikipedia.org/wiki/Abu%20Dhabi%20Metro | Abu Dhabi Metro is a planned metro system that would be part of a larger transit network for the city of Abu Dhabi, United Arab Emirates. First announced in 2008, as of 2023 construction has yet to start.
Plan
The entire transit network will be 131 km long when complete, including an partially underground metro line, two light rail lines and bus rapid transit. It is expected to cost Dh7 billion.
Phase 1 of the network () was intended to be completed by 2020, with a further () in later phases. However, as of August 2022, no contracts have been signed and no construction has started.
The system will be composed of four basic lines:
Line heavy rail rapid transit of which will be underground
Line light rail with 24 stops
Line light rail with 21 stops
Line bus rapid transit loop with 25 stops
The metro will mainly connect the proposed Central Business District with Sowwah Island, Reem Island, Saadiyat Island, Yas Island, Abu Dhabi International Airport, Sheikh Zayed Grand Mosque, Masdar City, Capital City District, Emerald Gateway, Zayed Sports City and ADNEC.
Construction
Firms interested in bidding for contracts on phase 1 of the project were due to submit statements of intent to the government by mid June 2013.
The Department of Transport has planned phase 1 for construction in three contracts:
civil works for the above-ground structures (design and build contracts.
underground construction work (design and build contracts.
the rail system, the rolling stock and the operation and maintenance for the line; (design, build, operate and maintain contracts.)
Contracts are due to be awarded in 2015. Under the original plan, the first phase was due to be complete by 2015, but is now scheduled to be operational no sooner than 2030.
From October 2016, the project halted. In August 2018, the Abu Dhabi Department of Transport invited bids for consultancy services for the emirate's metro and light rail projects completed in 2033.
Notes
References
External links
Abu Dhabi Department of Transport page
Rapid transit in the United Arab Emirates
Transport in Abu Dhabi
Proposed rapid transit |
https://en.wikipedia.org/wiki/James%20Whelton | James Whelton is an Irish computer coder, venture capital advisor, and co-founder of CoderDojo, a network of free computer clubs for children.
At the age of 16, Whelton became famous for hacking the iPod Nano and creating watch faces for the device. In 2011, at the age of 18, he co-founded, CoderDojo, along with entrepreneur Bill Liao. Whelton headed up his school's computer club in Cork, Ireland. After CoderDojo was established, he became an entrepreneur-in-residence at Polaris Ventures.
References
People from Cork (city)
Irish computer programmers
Living people
Year of birth missing (living people) |
https://en.wikipedia.org/wiki/Harry%20Goode | Harry Goode may refer to:
Harry H. Goode (1909–1960), American computer engineer and systems engineer
Harry King Goode (1892–1942), World War I flying ace
Harry C. Goode Jr. (1938–2013), former mayor of Melbourne, Florida |
https://en.wikipedia.org/wiki/Grojband | Grojband (portmanteau for "garage" and "band") is a Canadian animated television series created by Todd Kauffman and Mark Thornton for Teletoon in Canada and Cartoon Network in the United States. Produced by Fresh TV and Neptoon Studios, with animation by Elliott Animation, in association with FremantleMedia Enterprises, it premiered on June 10, 2013, in the United States, on September 5, 2013, in Canada, and on April 21, 2014, in the United Kingdom. It is executive produced by Tom McGillis and Jennifer Pertsch, the creators of the hit animated reality franchise Total Drama.
Synopsis
Grojband follows the story of a Canadian indie rock garage band of the same name formed by Corey Riffin and his three best friends, Laney and twin brothers Kin and Kon, as they work together to propel their band to international stardom. When they do not have the lyrics, Corey and his friends get Trina, Corey's sister, into an emotional mode to write entries in her diary that Corey can use for lyrical inspiration, so that Corey and his friends can perform a perfect song.
Characters
Grojband
Corey Jaron Riffin (voiced by Lyon Smith) – Corey is the younger brother of Trina Riffin. He is a 13-year-old confident, optimistic, laidback, and quirky leader, vocalist, and guitarist of Grojband. Although good-natured, he is on a constant search for new gigs for the band to perform at and will do whatever it takes to play music at them, which is usually by angering his sister, Trina, who will write in her diary. He then translates her venting into lyrics for their songs due to the fact he is unable to come up with lyrics of his own. He is named after the Canadian musician Corey Crewe.
Laney Penn (voiced by Bryn McAuley) – Laney is the bassist, Vocalist and self-proclaimed band manager of Grojband. She is the younger sister of Chloe. Laney is a short, sarcastic, ambitious, and passionate redhead and the only female in the band, the latter of which everyone else isn't able to acknowledge. She tends to be the most rational member of the band, mainly because she cares about the others, but is usually prone to giving in to Corey and his schemes. This is because she has a crush on Corey, to which Corey is oblivious to. Her name is a pun on the famous Beatles song Penny Lane.
Kin Kujira (voiced by Sergio Di Zio) – Kin is the Japanese keyboardist of the band, and Kon's small, bespectacled older twin brother and best friend. Despite his eccentric behaviour and antics, he is extremely smart and has a knack for advanced technology, often building strange gadgets that help the band with their gigs.
Kon Kujira (voiced by Tim Beresford) – Kon is the Japanese drummer of the band, and Kin's large, overweight younger twin brother and best friend. Kon is sometimes dense and just as crazy as his brother Kin, but is very strong, usually well-meaning, and has a cherubic and excitable demeanor. He and his brother derive their first names from King Kong and their last name from Gojira, the Jap |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.