AI Video Tools

Explore the best AI Video Tools — independent reviews, comparisons, pricing and step-by-step how-to guides, curated by Aizhi.

  • Document classification

    Document classification

    Document classification or document categorization is a problem in library science, information science and computer science. The task is to assign a document to one or more classes or categories. This may be done "manually" (or "intellectually") or algorithmically. The intellectual classification of documents has mostly been the province of library science, while the algorithmic classification of documents is mainly in information science and computer science. The problems are overlapping, however, and there is therefore interdisciplinary research on document classification. The documents to be classified may be texts, images, music, etc. Each kind of document possesses its special classification problems. When not otherwise specified, text classification is implied. Documents may be classified according to their subjects or according to other attributes (such as document type, author, printing year etc.). In the rest of this article only subject classification is considered. There are two main philosophies of subject classification of documents: the content-based approach and the request-based approach. == "Content-based" versus "request-based" classification == Content-based classification is classification in which the weight given to particular subjects in a document determines the class to which the document is assigned. It is, for example, a common rule for classification in libraries, that at least 20% of the content of a book should be about the class to which the book is assigned. In automatic classification it could be the number of times given words appears in a document. Request-oriented classification (or -indexing) is classification in which the anticipated request from users is influencing how documents are being classified. The classifier asks themself: “Under which descriptors should this entity be found?” and “think of all the possible queries and decide for which ones the entity at hand is relevant” (Soergel, 1985, p. 230). Request-oriented classification may be classification that is targeted towards a particular audience or user group. For example, a library or a database for feminist studies may classify/index documents differently when compared to a historical library. It is probably better, however, to understand request-oriented classification as policy-based classification: The classification is done according to some ideals and reflects the purpose of the library or database doing the classification. In this way it is not necessarily a kind of classification or indexing based on user studies. Only if empirical data about use or users are applied should request-oriented classification be regarded as a user-based approach. == Classification versus indexing == Sometimes a distinction is made between assigning documents to classes ("classification") versus assigning subjects to documents ("subject indexing") but as Frederick Wilfrid Lancaster has argued, this distinction is not fruitful. "These terminological distinctions,” he writes, “are quite meaningless and only serve to cause confusion” (Lancaster, 2003, p. 21). The view that this distinction is purely superficial is also supported by the fact that a classification system may be transformed into a thesaurus and vice versa (cf., Aitchison, 1986, 2004; Broughton, 2008; Riesthuis & Bliedung, 1991). Therefore, assigning a subject term to a document in an index is equivalent to assigning that document to the class of documents indexed by that term (all documents indexed or classified as X belong to the same class of documents). == Automatic document classification (ADC) == Automatic document classification tasks can be divided into three sorts: supervised document classification where some external mechanism (such as human feedback) provides information on the correct classification for documents, unsupervised document classification (also known as document clustering), where the classification must be done entirely without reference to external information, and semi-supervised document classification, where parts of the documents are labeled by the external mechanism. There are several software products under various license models available. === Techniques === Automatic document classification techniques include: Artificial neural network Concept Mining Decision trees such as ID3 or C4.5 Expectation maximization (EM) Instantaneously trained neural networks Latent semantic indexing Multiple-instance learning Naive Bayes classifier Natural language processing approaches Rough set-based classifier Soft set-based classifier Support vector machines (SVM) K-nearest neighbour algorithms tf–idf == Applications == Classification techniques have been applied to spam filtering, a process which tries to discern E-mail spam messages from legitimate emails email routing, sending an email sent to a general address to a specific address or mailbox depending on topic language identification, automatically determining the language of a text genre classification, automatically determining the genre of a text readability assessment, automatically determining the degree of readability of a text, either to find suitable materials for different age groups or reader types or as part of a larger text simplification system sentiment analysis, determining the attitude of a speaker or a writer with respect to some topic or the overall contextual polarity of a document. health-related classification using social media in public health surveillance article triage, selecting articles that are relevant for manual literature curation, for example as is being done as the first step to generate manually curated annotation databases in biology

    Read more →
  • Webedia

    Webedia

    Webedia S.A. is a company specializing in online media, a subsidiary of the Fimalac group based in Levallois-Perret, France. Webedia is active in more than twenty countries including France (AlloCiné, Jeuxvideo.com, MGG, Puremédias, Ode, Pureshopping, Volum, Terrafemina, 750g, easyVoyage, l’Automobile Magazine, Le 10 Sport), Brazil (AdoroCinema, Tudo Gostoso, Minhavida), Germany (Filmstarts, Moviepilot, GameStar), Spain and Latin America (Xataka, SensaCine, Raiser Games), Poland (Gry-Online and GetHero) and the United States (Boxoffice Pro). == History == === Early years (2007-2013) === Webedia was created in France in 2007, following the successive launches of the websites Purepeople, Puretrend and Purefans. Webedia bought the comparison shopping website Shopoon in 2008 and renamed it Pureshopping, and the website Ozap (media news) from M6 group in 2011 and renamed it Puremédias. Webedia was acquired by Fimalac in May 2013 and became its Internet media subsidiary. === Growth (2013-2016) === In 2013, Fimalac acquired AlloCiné, the websites Newsring and Youmag, the cooking website 750g and the cultural platform Exponaute. In 2014, Webedia acquired OverBlog, Jeuxvideo.com (through L'Odyssée Interactive and moved to Paris in 2015), Moviepilot (Germany), and Gameo Consulting (owner of Millenium, electronic sports), In December 2014, Webedia announced a license agreement with Ziff Davis to launch sites under the IGN franchise in Brazil and France at the beginning of 2015. The French version of IGN was launched on 2, it targets the general public and casual gamers. In 2015, Webedia acquired Côté Ciné Group (technological solutions for movie theaters and specialized press magazines: BoxOffice Pro in the United States and Côté Ciné in France), 57% of Easyvoyage group (online travel comparators Easyvol and Alibabuy, Mixicom (website JeuxActu and multi-channel network), 50% of the Brazilian network Paramaker, and West World Media (digital marketing company for the film industry). In 2016, Webedia bought Scimob (mobile video game studio), Surprizemi (home-delivered surprise boxes), Eklablog (blogging platform) Oxent (eSports World Convention), and Bang Bang Management (sports PR agency). In addition, an agreement is made with Paris Saint-Germain for Webedia to recruit and manage e-sports players on behalf of Paris Saint-Germain eSports. On November 15, 2016, the LFP announced that it had reached an agreement with beIN Sports and Webedia for the broadcasting of the first edition of the e-League 1. The competition is renewed for two additional seasons on July 26, 2017, the broadcasting agreements are renewed. On December 8, 2016, Webedia joined forces with Chronopost to launch Pourdebon, a home delivery service that connects Internet users and labeled producers (AOC, organic AB, etc.). Webedia has a slight majority (53%) in this new platform. === 2017 === On January 19, 2017, Webedia announced the acquisition of the English company Peach Digital, specializing in web development and digital marketing for movie theaters. In February 2017, Le Figaro announced that Webedia had invested 10 million euros in Illico Fresco, a home delivery service for baskets of recipes. The same month, FDJ and Webedia announced a partnership for the creation of eSports competitions: a professional one (FDJ Masters League) and another one for amateur gamers (FDJ Open Series) starting in March 2017. They are broadcast on Webedia's Web TV. At the end of February 2017, the media group finalized the acquisition of MyPoseo, a SaaS publisher specialized on SEO analytics. On March 8, 2017, Webedia launched LeStream, a Twitch Web TV dedicated to video games, the result of two years of development, in the company of several YouTubers including Cyprien and Squeezie,. On March 29, 2017, Webedia bought the Brazilian web publisher Minha Vida, a website devoted to health, nutrition, beauty and fitness, which attracts 14.3 million unique monthly visitors. Webedia reaches 44 million unique visitors in Brazil, and thus becomes the leading publisher on entertainment themes. In June 2017, the company made its largest international acquisition, with the American agency 3BlackDot, a media and marketing agency focused on videogamers. The agency, based in Los Angeles, manages 36 YouTubers followed by millions of subscribers on their channels which total 700 million videos viewed per month. In July 2017, Webedia bought IDZ, an audiovisual production company, and thus strengthened its production activities and its leadership on the YouTube channel networks in France. That year, Webedia was the first French media group to use the measurement of their global audiences by Comscore. It represents deduplicated coverage on desktops, laptops, smartphones and tablets, and includes audiences for websites, mobile applications and videos. This new measure allows Webedia to establish a deduplicated global audience of 177 million unique visitors in April 2017. In October 2017, Webedia announced its intention to launch a TV channel dedicated to electronic sports, called ES1. The channel was officially launched on January 10, 2018, on Orange TV and on February 6, 2018, on Free and Bouygues Telecom. In November 2017, Webedia, with the support of CDC International Capital, entered into exclusive negotiations with the Saudi company Uturn Entertainment, specializing in online entertainment, particularly on YouTube, and the production of digital content for the region's youth, with a view to merging it with Diwanee, a Webedia subsidiary in the Middle East, for an amount close to $100 million. In December 2017, Webedia acquired a majority stake in the United States–based company called Creators Media, which brings together social and video production platforms specializing in popular culture and entertainment. That same month, Webedia joined forces with Elephant, Emmanuel Chain's audiovisual production company, to create a new content production label aimed at Millennials. === 2018-2019 === In January 2018, Webedia launched a sports marketing agency: Only Sports & Passions. That same month, Illico Fresco, specialist in the delivery of kit meals belonging to Webedia, joined forces with Weight Watchers, the world leader in slimming products. In April 2018, Webedia published new audience figures in partnership with Comscore, 188 million unique monthly visitors in December 2017, an increase of 6.2% compared to the previous measure dating from April 2017. The same month, Webedia unveils its ambitions concerning content production, as a partnership with the video game studio Focus Home Interactive is signed with a title "Fear the Wolves" already planned for 2018, co-production projects of films, cartoons or series are announced. In July 2018, Webedia bought the American authors company Full Fathom Five, a company that helps authors produce books, TV series, films and video games. In October 2018, Webedia announced that it was focusing on both esports clubs PSG Esports and LeStream Esport. The first one being geared towards international competitions and the second devoted mainly to the French esports scene. The "Millenium" brand is thus refocusing around its media activities and esports merchandising products, and the "Millenium esport club" being gradually closed. The same month, the company announced the acquisition of Weblogs, a Spanish-speaking website publisher, thereby strengthening its activity in Spain and Latin America. On October 22, 2018, Webedia announced the merger of BoxOffice magazine with Film Journal International. On November 13, 2018, Groupe SEB announced the acquisition from Webedia of 750g International, the international branch of the French recipe site 750g (the original French website 750g.com being retained by Webedia). The group is thus separating from Gourmandize (United States and United Kingdom), HeimGourmet (Germany), Rebañando (Spain), Receitas Sem Fronteiras (Brazil / Portugal) and Tribù Golosa (Italy). The same month, Webedia joined forces with Riot Games to launch the French League of League of Legends (LFL), the first French professional league on the League of Legends game, which will bring together the 8 best teams on the French scene. In March 2019, Webedia bought 51% of the audiovisual production company Elephant. The new set will weigh 500 million euros, a quarter of which will be made outside France. The same month, Webedia purchased a majority stake in the company Partoo, which publishes a SaaS platform specializing in local marketing for brands and merchants. On March 14, 2019, a new measurement of the international audience of Webedia sites was produced by Comscore, posting 250 million unique visitors in December 2018, up 9.2% compared to December 2017. In June 2019, the group joined forces with Michel Cymes, a famous doctor and French TV host by taking a majority stake in his company Club Santé Débat, in order to develop a health platform around the Dr. Good! Brand. In Sep

    Read more →
  • Foreground detection

    Foreground detection

    Foreground detection is one of the major tasks in the field of computer vision and image processing whose aim is to detect changes in image sequences. Background subtraction is any technique which allows an image's foreground to be extracted for further processing (object recognition etc.). Many applications do not need to know everything about the evolution of movement in a video sequence, but only require the information of changes in the scene, because an image's regions of interest are objects (humans, cars, text etc.) in its foreground. After the stage of image preprocessing (which may include image denoising, post processing like morphology etc.) object localisation is required which may make use of this technique. Foreground detection separates foreground from background based on these changes taking place in the foreground. It is a set of techniques that typically analyze video sequences recorded in real time with a stationary camera. == Description == All detection techniques are based on modelling the background of the image, i.e., setting the background and detecting which changes occur. Defining the background can be difficult when it contains shapes, shadows, and moving objects. In defining the background, it is assumed that stationary objects may vary in color and intensity over time. Scenarios in which these techniques apply tend to be very diverse. There can be highly variable sequences, such as images with different lighting, interiors, exteriors, quality, and noise. In addition to real-time processing, systems need to adapt to these changes. A foreground detection system should be able to: Develop a background model (estimate). Be robust to lighting changes, repetitive movements (leaves, waves, shadows), and long-term changes. == Background subtraction == Background subtraction is a widely used approach for detecting moving objects in videos from static cameras. The rationale in the approach is that of detecting the moving objects from the difference between the current frame and a reference frame, often called "background image", or "background model". Background subtraction is mostly done if the image in question is a part of a video stream. Background subtraction provides important cues for numerous applications in computer vision, for example surveillance tracking or human pose estimation. Background subtraction is generally based on a static background hypothesis which is often not applicable in real environments. With indoor scenes, reflections or animated images on screens lead to background changes. Similarly, due to wind, rain or illumination changes brought by weather, static backgrounds methods have difficulties with outdoor scenes. == Temporal average filter == The temporal average filter is a method that was proposed at the Velastin. This system estimates the background model from the median of all pixels of a number of previous images. The system uses a buffer with the pixel values of the last frames to update the median for each image. To model the background, the system examines all images in a given time period called training time. At this time, we only display images and will find the median, pixel by pixel, of all the plots in the background this time. After the training period for each new frame, each pixel value is compared with the input value of funds previously calculated. If the input pixel is within a threshold, the pixel is considered to match the background model and its value is included in the pixbuf. Otherwise, if the value is outside this threshold pixel is classified as foreground, and not included in the buffer. This method cannot be considered very efficient because they do not present a rigorous statistical basis and requires a buffer that has a high computational cost. == Conventional approaches == A robust background subtraction algorithm should be able to handle lighting changes, repetitive motions from clutter and long-term scene changes. The following analyses make use of the function of V(x,y,t) as a video sequence where t is the time dimension, x and y are the pixel location variables. e.g. V(1,2,3) is the pixel intensity at (1,2) pixel location of the image at t = 3 in the video sequence. === Using frame differencing === A motion detection algorithm begins with the segmentation part where foreground or moving objects are segmented from the background. The simplest way to implement this is to take an image as background and take the frames obtained at the time t, denoted by I(t) to compare with the background image denoted by B. Here using simple arithmetic calculations, we can segment out the objects simply by using image subtraction technique of computer vision meaning for each pixels in I(t), take the pixel value denoted by P[I(t)] and subtract it with the corresponding pixels at the same position on the background image denoted as P[B]. In mathematical equation, it is written as: P [ F ( t ) ] = P [ I ( t ) ] − P [ B ] {\displaystyle P[F(t)]=P[I(t)]-P[B]} The background is assumed to be the frame at time t. This difference image would only show some intensity for the pixel locations which have changed in the two frames. Though we have seemingly removed the background, this approach will only work for cases where all foreground pixels are moving, and all background pixels are static. A threshold "Threshold" is put on this difference image to improve the subtraction (see Image thresholding): | P [ F ( t ) ] − P [ F ( t + 1 ) ] | > T h r e s h o l d {\displaystyle |P[F(t)]-P[F(t+1)]|>\mathrm {Threshold} } This means that the difference image's pixels' intensities are 'thresholded' or filtered on the basis of value of Threshold. The accuracy of this approach is dependent on speed of movement in the scene. Faster movements may require higher thresholds. === Mean filter === For calculating the image containing only the background, a series of preceding images are averaged. For calculating the background image at the instant t: B ( x , y , t ) = 1 N ∑ i = 1 N V ( x , y , t − i ) {\displaystyle B(x,y,t)={1 \over N}\sum _{i=1}^{N}V(x,y,t-i)} where N is the number of preceding images taken for averaging. This averaging refers to averaging corresponding pixels in the given images. N would depend on the video speed (number of images per second in the video) and the amount of movement in the video. After calculating the background B(x,y,t) we can then subtract it from the image V(x,y,t) at time t = t and threshold it. Thus the foreground is: | V ( x , y , t ) − B ( x , y , t ) | > T h {\displaystyle |V(x,y,t)-B(x,y,t)|>\mathrm {Th} } where Th is a threshold value. Similarly, we can also use median instead of mean in the above calculation of B(x,y,t). Usage of global and time-independent thresholds (same Th value for all pixels in the image) may limit the accuracy of the above two approaches. === Running Gaussian average === For this method, Wren et al. propose fitting a Gaussian probabilistic density function (pdf) on the most recent n {\displaystyle n} frames. In order to avoid fitting the pdf from scratch at each new frame time t {\displaystyle t} , a running (or on-line cumulative) average is computed. The pdf of every pixel is characterized by mean μ t {\displaystyle \mu _{t}} and variance σ t 2 {\displaystyle \sigma _{t}^{2}} . The following is a possible initial condition (assuming that initially every pixel is background): μ 0 = I 0 {\displaystyle \mu _{0}=I_{0}} σ 0 2 = ⟨ some default value ⟩ {\displaystyle \sigma _{0}^{2}=\langle {\text{some default value}}\rangle } where I t {\displaystyle I_{t}} is the value of the pixel's intensity at time t {\displaystyle t} . In order to initialize variance, we can, for example, use the variance in x and y from a small window around each pixel. Note that background may change over time (e.g. due to illumination changes or non-static background objects). To accommodate for that change, at every frame t {\displaystyle t} , every pixel's mean and variance must be updated, as follows: μ t = ρ I t + ( 1 − ρ ) μ t − 1 {\displaystyle \mu _{t}=\rho I_{t}+(1-\rho )\mu _{t-1}} σ t 2 = d 2 ρ + ( 1 − ρ ) σ t − 1 2 {\displaystyle \sigma _{t}^{2}=d^{2}\rho +(1-\rho )\sigma _{t-1}^{2}} d = | ( I t − μ t ) | {\displaystyle d=|(I_{t}-\mu _{t})|} Where ρ {\displaystyle \rho } determines the size of the temporal window that is used to fit the pdf (usually ρ = 0.01 {\displaystyle \rho =0.01} ) and d {\displaystyle d} is the Euclidean distance between the mean and the value of the pixel. We can now classify a pixel as background if its current intensity lies within some confidence interval of its distribution's mean: | ( I t − μ t ) | σ t > k ⟶ foreground {\displaystyle {\frac {|(I_{t}-\mu _{t})|}{\sigma _{t}}}>k\longrightarrow {\text{foreground}}} | ( I t − μ t ) | σ t ≤ k ⟶ background {\displaystyle {\frac {|(I_{t}-\mu _{t})|}{\sigma _{t}}}\leq k\longrightarrow {\text{background}}} where the parameter k {\displaystyle k} is a free threshold (usuall

    Read more →
  • Hardware security

    Hardware security

    Hardware security is a discipline originated from the cryptographic engineering and involves hardware design, access control, secure multi-party computation, secure key storage, ensuring code authenticity, measures to ensure that the supply chain that built the product is secure among other things. A hardware security module (HSM) is a physical computing device that safeguards and manages digital keys for strong authentication and provides cryptoprocessing. These modules traditionally come in the form of a plug-in card or an external device that attaches directly to a computer or network server. Some providers in this discipline consider that the key difference between hardware security and software security is that hardware security is implemented using "non-Turing-machine" logic (raw combinatorial logic or simple state machines). One approach, referred to as "hardsec", uses FPGAs to implement non-Turing-machine security controls as a way of combining the security of hardware with the flexibility of software. Hardware backdoors are backdoors in hardware. Conceptionally related, a hardware Trojan (HT) is a malicious modification of electronic system, particularly in the context of integrated circuit. A physical unclonable function (PUF) is a physical entity that is embodied in a physical structure and is easy to evaluate but hard to predict. Further, an individual PUF device must be easy to make but practically impossible to duplicate, even given the exact manufacturing process that produced it. In this respect it is the hardware analog of a one-way function. The name "physical unclonable function" might be a little misleading as some PUFs are clonable, and most PUFs are noisy and therefore do not achieve the requirements for a function. Today, PUFs are usually implemented in integrated circuits and are typically used in applications with high security requirements. Many attacks on sensitive data and resources reported by organizations occur from within the organization itself.

    Read more →
  • List of monochrome and RGB color formats

    List of monochrome and RGB color formats

    This list of monochrome and RGB palettes includes generic repertoires of colors (color palettes) to produce black-and-white and RGB color pictures by a computer's display hardware. RGB is the most common method to produce colors for displays; so these complete RGB color repertoires have every possible combination of R-G-B triplets within any given maximum number of levels per component. Each palette is represented by a series of color patches. When the number of colors is low, a 1-pixel-size version of the palette appears below it, for easily comparing relative palette sizes. Huge palettes are given directly in one-color-per-pixel color patches. For each unique palette, an image color test chart and sample image (truecolor original follows) rendered with that palette (without dithering) are given. The test chart shows the full 256 levels of the red, green, and blue (RGB) primary colors and cyan, magenta, and yellow complementary colors, along with a full 256-level grayscale. Gradients of RGB intermediate colors (orange, lime green, sea green, sky blue, violet, and fuchsia), and a full hue spectrum are also present. Color charts are not gamma corrected. These elements illustrate the color depth and distribution of the colors of any given palette, and the sample image indicates how the color selection of such palettes could represent real-life images. These images are not necessarily representative of how the image would be displayed on the original graphics hardware, as the hardware may have additional limitations regarding the maximum display resolution, pixel aspect ratio and color placement. Implementation of these formats is specific to each machine. Therefore, the number of colors that can be simultaneously displayed in a given text or graphic mode might be different. Also, the actual displayed colors are subject to the output format used - PAL or NTSC, composite or component video, etc. - and might be slightly different. For simulated images and specific hardware and alternate methods to produce colors other than RGB (ex: composite), see the List of 8-bit computer hardware palettes, the List of 16-bit computer hardware palettes and the List of video game console palettes. For various software arrangements and sorts of colors, including other possible full RGB arrangements within 8-bit color depth displays, see the List of software palettes. == Monochrome palettes == These palettes only have some shades of gray, from black to white (considered the darkest and lightest "grays", respectively). The general rule is that those palettes have 2n different shades of gray, where n is the number of bits needed to represent a single pixel. === Monochrome (1-bit grayscale) === Monochrome graphics displays typically have a black background with a white or light gray image, though green and amber monochrome monitors were also common. Such a palette requires only one bit per pixel. Where photo-realism was desired, these early computer systems had a heavy reliance on dithering to make up for the limits of the technology. In some systems, as Hercules and CGA graphic cards for the IBM PC, a bit value of 1 represents white pixels (light on) and a value of 0 the black ones (light off); others, like the Playdate and Atari ST and Apple Macintosh with monochrome monitors, a bit value of 0 means a white pixel (no ink) and a value of 1 means a black pixel (dot of ink), which it approximates to the printing logic. === 2-bit Grayscale === In a 2-bit color palette each pixel's value is represented by 2 bits resulting in a 4-value palette (22 = 4). 2-bit dithering: It has black, white and two intermediate levels of gray as follows: A monochrome 2-bit palette is used on: The Monochrome Display Adapter for the IBM PC NeXT Computer, NeXTcube and NeXTstation monochrome graphic displays. Original Game Boy system portable video game console. Macintosh PowerBook 150 monochrome LC displays. Amiga with A2024 monochrome monitor in high-resolution mode. The original Amazon Kindle The original WonderSwan The Tiger Electronics Game.com portable video game console The original Neo Geo Pocket. === 4-bit Grayscale === In a 4-bit color palette each pixel's value is represented by 4 bits resulting in a 16-value palette (24 = 16): 4-bit grayscale dithering does a fairly good job of reducing visible banding of the level changes: A monochrome 4-bit palette is used on: MOS Technology VDC (on the Commodore 128 with monochrome monitor) Amstrad CPC series with a GT64/GT65 Green Monitor (16 unique green shades) Amstrad CPC Plus series with the MM12 Monochrome monitor (16 shades of grey) Some Apple PowerBooks equipped with monochrome displays like the PowerBook 5300 The original VideoNow === 8-bit Grayscale === In an 8-bit color palette each pixel's value is represented by 8 bits resulting in a 256-value palette (28 = 256). This is usually the maximum number of grays in ordinary monochrome systems; each image pixel occupies a single memory byte. Most scanners can capture images in 8-bit grayscale, and image file formats like TIFF and JPEG natively support this monochrome palette size. Alpha channels employed for video overlay also use (conceptually) this palette. The gray level indicates the opacity of the blended image pixel over the background image pixel. == Dichrome palettes == === 16-bit RG palette === The RG or red–green color space is a color space that uses only two primary colors: red and green. It was used on early color processes for films. It was used as an additive format, similar to the RGB color model but without a blue channel, on processes such as Kinemacolor, Prizma, Technicolor I, Raycol, etc., producing shades of black, red, green and yellow. Alternatively, it was used as a subtractive format on Brewster Color I, Kodachrome I, Prizma II, Technicolor II, etc., producing shades of transparent, red, green and black. Until recently, its primary use was in low-cost light-emitting diode displays in which red and green tended to be far more common than the still nascent blue LED technology, but full-color LEDs with blue have become more common in recent years. ColorCode 3-D, a anaglyph stereoscopic color scheme, uses the RG color space to simulate a broad spectrum of color in one eye, while the blue portion of the spectrum transmits a black-and-white (black-and-blue) image to the other eye to give depth perception. === 16-bit RB palette === === 16-bit GB palette === == Regular RGB palettes == Here are grouped those full RGB hardware palettes that have the same number of binary levels (i.e., the same number of bits) for every red, green and blue components using the full RGB color model. Thus, the total number of colors are always the number of possible levels by component, n, raised to a power of 3: n×n×n = n3. === 3-bit RGB === 3-bit RGB dithering: Systems with a 3-bit RGB palette use 1 bit for each of the red, green and blue color components. That is, each component is either "on" or "off" with no intermediate states. This results in an 8-color palette ((21)3 = 23 = 8) that has black, white, the three RGB primary colors red, green and blue and their correspondent complementary colors cyan, magenta and yellow as follows: The color indices vary between implementations; therefore, index numbers are not given. The 3-bit RGB palette is used by: Text terminals following the ECMA-48 standard (sometimes known as the "ANSI standard", although ANSI X3.128 does not define colors) World System Teletext Level 1/1.5 Videotex Oric computers BBC Micro PC-8801 (up to the MkII) PC-9801 (with original 8086 CPU, before the VM/VX models) Sharp X1 (models before the X1 Turbo Z) Sharp MZ 700 FM-7, FM New 7, FM 77 (before the FM77AV) Sinclair QL Space Invaders Part II (arcade hardware) Macintosh SE (with a color printer or external monitor) Atari 2600 (SECAM version) Color Maximite (PIC32 based microcomputer) Arcadia 2001 PV-1000 Monkey Magic (arcade hardware) VIC-20 (high-res mode) Mouse Trap (arcade hardware) Sanyo MBC-550 series Windows 1.0 (includes dithering) === 6-bit RGB === Systems with a 6-bit RGB palette use 2 bits for each of the red, green, and blue color components. This results in a (22)3 = 43 = 64-color palette as follows: 6-bit RGB systems include the following: Enhanced Graphics Adapter (EGA) for IBM PC/AT (16 colors at once) Sega Master System video game console (32 colors at once) GIME for TRS-80 Color Computer 3 (16 colors at once) Pebble Time smartwatch which has a 6-bit (64 color) e-paper display Parallax Propeller using the reference VGA circuit === 9-bit RGB === Systems with a 9-bit RGB palette use 3 bits for each of the red, green, and blue color components. This results in a (23)3 = 83 = 512-color palette as follows: 9-bit RGB systems include the following: Atari ST (Normally 4 to 16 at once without tricks) MSX2 computers (up to 16 at once) Sega Genesis video game console, (64 colors at once) Sega Nomad TurboGrafx-16 (NEC PC-Engine) ZX Spectrum Next The NEC PC-88

    Read more →
  • Europa-Lehrmittel

    Europa-Lehrmittel

    The Verlag Europa-Lehrmittel Nourney, Vollmer GmbH & Co. KG (English: European educational media), based in Haan (district Gruiten) near Düsseldorf, Germany, develops educational media for vocational training and further education as used in vocational schools, universities, companies and further education institutions for industrial-technical, business, social, health as well as gastronomic professions. The contents are delivered in print as well as in digital formats, including offered as apps, simulations, software and through an exam preparation portal. The publisher has its own digital learning platform, the Europathek. General partner is Nourney, Vollmer & Co. GmbH, a school and specialist book publisher. == History == The publishing house was founded in Wuppertal in 1948, when the first books were published. In Eislingen/Fils a construction office was set up to create the technical drawings for the textbooks - today the drawing office of the publisher in Ostfildern. A little over 40 years later, in 1989, a new company building was built in Haan-Gruiten. In 1997, Europa-Lehrmittel acquired the Fachbuchverlag Pfanneberg with its program aimed at gastronomic professions. Further program expansions in vocational training were realized by adding titles of the publishing houses Lau, Gerber, Pluspunkt, parts of the Verlag Handwerk und Technik program and that of the Gildebuchverlag. In 2013, the scientific and technical university titles of Verlag Harri Deutsch were taken over, including the bestselling "Handbook of Mathematics" by Ilya Nikolaevich Bronstein and Konstantin Adolfovic Semendyayev. In addition, Europa-Lehrmittel's first exam apps appeared. In 2017, the publisher introduced its own digital learning platform named Europathek. The Prüfungsdoc (English: Examination Doc) platform, which enables targeted online preparation for exams, went online the same year. In 2018, the titles of the Düsseldorf publishing house SOL for self-organized learning were incorporated into Europa-Lehrmittel's program. == Program == The program meanwhile includes well over 2000 print and digital publications, including specialist titles on metal technology, automotive and electrical engineering (like "Tabellenbuch Metall" (English: Metal Book of Tables)), on business administration, as well as works for the gastronomic profession (e.g. "Der junge Koch" (English: The Young Cook)). Many titles also appear as licensed editions in over 20 different languages on all continents. All contents are presented in an annual catalog, on the website, in schools, in companies, and at trade fairs and congresses. The publisher is a member of the Deutscher Hauswirtschaftsrat. == Digital educational media == Europathek: In addition to digital books, Europathek also provides media packages, additional materials and e-learning contents. The online contents of the 'media shelf' can be used per web browser. There are also software versions and apps for offline use, with the help of which the obtained titles can be viewed after downloading. Prüfungsdoc (English: Examination Doc): Prüfungsdoc offers web-based learning, practice and repetition to prepare for the intermediate and final examinations. This includes simulations of the exams with direct evaluation of the results.

    Read more →
  • Digital anthropology

    Digital anthropology

    Digital anthropology is the anthropological study of the relationship between humans and digital-era technology. The field is new, and thus has a variety of names with a variety of emphases. These include techno-anthropology, digital ethnography, cyberanthropology, and virtual anthropology. == Definition and scope == Most anthropologists who use the phrase "digital anthropology" are specifically referring to online and Internet technology. The study of humans' relationship to a broader range of technology may fall under other subfields of anthropological study, such as cyborg anthropology. The Digital Anthropology Group (DANG) is classified as an interest group in the American Anthropological Association. DANG's mission includes promoting the use of digital technology as a tool of anthropological research, encouraging anthropologists to share research using digital platforms, and outlining ways for anthropologists to study digital communities. Cyberspace or the "virtual world" itself can serve as a "field" site for anthropologists, allowing the observation, analysis, and interpretation of the sociocultural phenomena springing up and taking place in any interactive space. National and transnational communities, enabled by digital technology, establish a set of social norms, practices, traditions, storied history and associated collective memory, migration periods, internal and external conflicts, potentially subconscious language features and memetic dialects comparable to those of traditional, geographically confined communities. This includes the various communities built around free and open-source software, online platforms such as Facebook, Twitter/X, Instagram, 4chan and Reddit and their respective sub-sites, and politically motivated groups like Anonymous, WikiLeaks, or the Occupy movement. A number of academic anthropologists have conducted traditional ethnographies of virtual worlds, such as Bonnie Nardi's study of World of Warcraft or Tom Boellstorff's study of Second Life. Academic Gabriella Coleman has done ethnographic work on the Debian software community and the Anonymous hacktivist network. Theorist Nancy Mauro-Flude conducts ethnographic field work on computing arts and computer subcultures such as systerserver.net a part of the communities of feminist web servers and the Feminist Internet network. Eitan Y. Wilf examines the intersection of artists' creativity and digital technology and artificial intelligence. Yongming Zhou studied how in China the internet is used to participate in politics. Eve M. Zucker and colleagues study the shift to digital memorialization of mass atrocities and the emergent role of artificial intelligence in these processes. Victoria Bernal conducted ethnographic research on the themes of nationalism and citizenship among Eritreans participating in online political engagement with their homeland. Anthropological research can help designers adapt and improve technology. Australian anthropologist Genevieve Bell did extensive user experience research at Intel that informed the company's approach to its technology, users, and market. == Methodology == === Digital fieldwork === Many digital anthropologists who study online communities use traditional methods of anthropological research. They participate in online communities in order to learn about their customs and worldviews, and back their observations with private interviews, historical research, and quantitative data. Their product is an ethnography, a qualitative description of their experience and analyses. Other anthropologists and social scientists have conducted research that emphasizes data gathered by websites and servers. However, academics often have trouble accessing user data on the same scale as social media corporations like Facebook and data mining companies like Acxiom. In terms of method, there is a disagreement in whether it is possible to conduct research exclusively online or if research will only be complete when the subjects are studied holistically, both online and offline. Tom Boellstorff, who conducted a three-year research as an avatar in the virtual world Second Life, defends the first approach, stating that it is not just possible, but necessary to engage with subjects “in their own terms”. Others, such as Daniel Miller, have argued that an ethnographic research should not exclude learning about the subject's life outside the internet. === Digital technology as a tool of anthropology === The American Anthropological Association offers an online guide for students using digital technology to store and share data. Data can be uploaded to digital databases to be stored, shared, and interpreted. Text and numerical analysis software can help produce metadata, while a codebook may help organize data. == Ethics == Online fieldwork offers new ethical challenges. According to the American Anthropological Association's ethics guidelines, anthropologists researching a community must make sure that all members of that community know they are being studied and have access to data the anthropologist produces. However, many online communities' interactions are publicly available for anyone to read, and may be preserved online for years. Digital anthropologists debate the extent to which lurking in online communities and sifting through public archives is ethical. The Association also asserts that anthropologists' ability to collect and store data at all is "a privilege", and researchers have an ethical duty to store digital data responsibly. This means protecting the identity of participants, sharing data with other anthropologists, and making backup copies of all data. == Prominent figures == Genevieve Bell is an Australian cultural anthropologist credited for pioneering the User Experience field. During her time working for Intel Corporation, Bell studied how various cultures from around the world interacted with and experienced technology. Researching and improving user experience allows companies and designers to gather data regarding how users utilize their digital products and what requires improvement or expansion. Tom Boellstorff is an anthropologist known for Coming of Age in Second Life: An Anthropologist Explores the Virtually Human where he conducted research on how engaging in virtual worlds affects the player’s sense of self. Gabriella Coleman is an American anthropologist concerned with the politics, ethics, and culture of hacking and online activism. Coleman’s most notable ethnography features the hacktivist collective Anonymous, where she argues that various genres of hacking exist according to the social conditions at play. Coleman is dedicated to making her ethnography accessible to a diverse audience, including academics and non-academics. Diana E. Forsythe was an American anthropologist of science and technology and the author of the essays featured in Studying Those Who Study Us: An Anthropologist in the World of Artificial Intelligence. She asked relevant questions such as how should humans interact with computers and how gender roles are maintained in technology-oriented occupations. Heather Horst is a sociocultural anthropologist interested in the relationship between digital social relations and material culture. Nancy Mauro-Flude is a design anthropologist whose work explores the tacit relations between embodied cognition, computational materiality, maker culture, self-hosted webserver cooperatives, creative practice, and artistic research in digital infrastructure and Internet publishing. Mizuko Ito is a Japanese cultural anthropologist specializing in technology use and the intersection between computers and the social sciences. Her primary interest is in how young people utilize media technology and how it can be used to engage students in education. Daniel Miller is an anthropologist with a concentration in digital anthropology. His research includes the smartphone and perpetual opportunism, the intent and consequences of posting on social media in various geographical locations, and how hospice patients use media to socialize in the last stage of their lives. Mike Wesch is a cultural anthropologist interested in how people share their lives, cultures, and beliefs through digital media.

    Read more →
  • Battleboarding

    Battleboarding

    Battleboarding, also known as versus debating and "who would win" debating, is an activity that involves discussing and debating around hypothetical fights between individuals; most popularly, fictional characters. These debates are often held in forums, blogs, sites and wikis, known as versus sites or battle boards. Netizens who engage in battleboarding online are often called "battleboarders". The earliest iterations of battleboarding first appeared in various online boards and forums, though its origins can be traced back to magazines, television shows, and comic book letter columns. Eventually, the online activity grew, becoming one of the most popular internet activities today, and spawning many online communities dedicated solely for battleboarding. It soon evolved into its own subculture, and even went on to inspire other media. == History == === Origins === Before the advent of the internet, articles about hypothetical fights were published in magazines. These articles range from topics like sports, comics and anime, such as Black Belt Magazine issue May 1997 which discussed about a hypothetical match between Muhammad Ali and Bruce Lee, and Wizard Magazine #133 which discussed about various hypothetical fights between American comic characters against Japanese anime characters. During that time, many comic book publishers also conceptualized and published "versus" storylines like Batman Versus Predator and Justice League/Avengers. Many films also capitalized on the concept of characters from different franchises fighting each other, such as Frankenstein Meets the Wolf Man (1934), King Kong vs. Godzilla (1962), Freddy vs Jason (2003), and Alien vs. Predator (2004). Another inspiration behind battleboarding were television shows and documentaries whose premise involved hypothetical fights concerning a variety of subjects like zoology, paleontology, and military history. These include shows such as Animal Face-Off (which pitted animals against each other), Deadliest Warrior (which pitted historical warriors, oftentimes from different time periods, against each other), and Jurassic Fight Club (which was about analyzing cases where different types of dinosaurs fought one another). Death Battle, a web series about pitting characters against each other that began in 2010, is a similar show that soon inspired many battleboarding communities and fandoms. Death Battle, as with many other battleboarding series and websites before it, utilised "calcs", which are mathematical equations that try to calculate how strong a character or weapon is. Other popular web series about the subject include Super Power Beat Down and Grudge Match. === Forums and sites === Many internet forums about movies, comics, anime, and video games often held discussions about hypothetical fights between characters from these media. These discussions would be the first iteration of online battleboarding. A notable early battleboarding website was stardestroyer.net (founded 1998), created by Michael Wong. The website focuses in large part on match-ups between the Star Wars and Star Trek franchises, and also includes a forum covering this as well as other more general battleboarding topics, usually related to science fiction and space opera. In addition to the forums, several webpages written by the administrators and contributors were embedded on the site. These attempted to mathematically quantify the capabilities of Star Wars technology and prove their superiority to their Star Trek equivalents, such as Wong's "Star Wars vs Star Trek: Technology Overview" and Brian Young's "Turbolaser Commentaries." stardestroyer.net had a notable impact on early battleboarding culture and also influenced official products. Curtis Saxton, author of several officially-licensed Star Wars technical reference books, thanked Wong, Young, and several other stardestroyer.net contributors by name in the acknowledgements section of Star Wars: Attack of the Clones Incredible Cross-Sections (2002), referring to them as "prominent among the hundreds of people contributing to constructive debates about Star Wars technicalities over the years, resulting in the consensus of conceptual and physical foundations applied in these pages." Saxton's books in the Incredible Cross-Sections series contain specific numbers about the capabilities of Star Wars ships original to these publications and not used in any other official sources. In an interview conducted by TheForce.Net, Saxton claimed to have been offered the job of writing reference books by a DK employee familiar with his "Star Wars Technical Commentaries" webpage (1995–2001), where Saxton attempted to calculate the firepower, speed, and durability of Star Wars spaceships using his background as an astrophysics student. One of the oldest and longest-running battleboarding forum is Comic Vine's "battle forum", whose first post was in 2007. Comic Vine also has one of the largest impacts on battleboarding, creating many common rules and terminologies such as "bloodlusted", "morals are off", "speed equalized", and many others. Another long-running battle forum is a subreddit called r/whowouldwin, where redditors can post and debate fights about real or fictional individuals. Verdicts of these match-ups are often chosen by using evidences of a character's power, weakness, or feat, such as movie clips, comic book panel scans, and excerpts from related literature; all of which are posted and categorized in a separate subreddit called r/respectthreads. Other influential battle forums include Fanverse, where users can post their own calcs about a character's power level. The popularity of battle forums inspired the creation of websites dedicated only for battleboarding. These include The Outskirts Battle Dome, a website that popularized the use of "power levels" in battleboarding; the aforementioned stardestroyer.net; and Space Battles, a website whose forums and threads are filled with posts about hypothetical fights between characters as well as other related topics. Another influential battleboarding site is the now defunct Fact Pile, and its sister site, FactPileTopia. Fact Pile is one of the first battleboarding site that actually listed down and documented winners of their match-ups. The site closed down in 2016 along with its forum, wikia, and YouTube channel. Besides these, blogs about battleboarding were also created, such as dreager1.com. === Wikis === Nowadays, the most popular battleboarding communities can be seen in Fandom, with two of the oldest and most popular being Deadliest Fiction and VS Battles Wiki. Deadliest Fiction is a Deadliest Warrior-inspired fanon created in July 2010 by a group of historians, academics, and pop culture enthusiasts. Being one of the most influential and accurate battleboarding sites around, Deadliest Fiction allows users to create hypothetical match-ups in the form of blogs, where other users can vote and debate around who will win in the comment section. Once a verdict is reached, the site allows the user to create a simulated fanfiction of how the fight would happen. The same year in October, a similar battleboarding site named VS Battles Wiki was created. In the VS Battles Wiki, users can create profiles and power levels of characters, post match-ups in its threads and forums, and list down the winners and losers of these threads in said character profiles. The wiki is considered the most active wiki battleboarding site today, with over 1 million visitors per month. However, throughout the years, the VS Battles Wiki has had its share of controversies, such as alleged inaccuracies in its profiles. There have also been websites and fanfiction wikis inspired by the battleboarding internet show Death Battle. These include the long-running G1 Death Battle Fan Blog, r/deathbattlematchups, and the popular Death Battle Fanon Wiki and DBX Fanon Wiki. Death Battle also released its own dice and card game, complete with rules and effects taken from battleboarding. == Subculture == In its rise in popularity, battleboarding has given birth to a unique online subculture with its own rules, activities, and terminologies. Several of these influences have become present in other online communities and popular media. Some of the common slang and terminologies used in battleboarding subculture includes: Battle Field Removal: Often abbreviated to "BFR", this is a rule that a fight can end if one character is taken out of a battlefield. This rule is used for characters who have the powers to teleport or transport enemies without actually killing them. Battle Royale: A term originating from Comic Vine in which multiple characters are pitted against each other. The name is probably derived from the film Battle Royale or the video game genre of the same name. Bloodlusted: A hypothetical situation wherein the characters are pitted against each other while in a furious, berserker-like state. Calc: These are calculations battl

    Read more →
  • Empirical dynamic modeling

    Empirical dynamic modeling

    Empirical dynamic modeling (EDM) is a framework for analysis and prediction of nonlinear dynamical systems. Applications include population dynamics, ecosystem service, medicine, neuroscience, dynamical systems, geophysics, and human-computer interaction. EDM was originally developed by Robert May and George Sugihara. It can be considered a methodology for data modeling, predictive analytics, dynamical system analysis, machine learning and time series analysis. == Description == Mathematical models have tremendous power to describe observations of real-world systems. They are routinely used to test hypothesis, explain mechanisms and predict future outcomes. However, real-world systems are often nonlinear and multidimensional, in some instances rendering explicit equation-based modeling problematic. Empirical models, which infer patterns and associations from the data instead of using hypothesized equations, represent a natural and flexible framework for modeling complex dynamics. Donald DeAngelis and Simeon Yurek illustrated that canonical statistical models are ill-posed when applied to nonlinear dynamical systems. A hallmark of nonlinear dynamics is state-dependence: system states are related to previous states governing transition from one state to another. EDM operates in this space, the multidimensional state-space of system dynamics rather than on one-dimensional observational time series. EDM does not presume relationships among states, for example, a functional dependence, but projects future states from localised, neighboring states. EDM is thus a state-space, nearest-neighbors paradigm where system dynamics are inferred from states derived from observational time series. This provides a model-free representation of the system naturally encompassing nonlinear dynamics. A cornerstone of EDM is recognition that time series observed from a dynamical system can be transformed into higher-dimensional state-spaces by time-delay embedding with Takens's theorem. The state-space models are evaluated based on in-sample fidelity to observations, conventionally with Pearson correlation between predictions and observations. == Methods == Primary EDM algorithms include Simplex projection, Sequential locally weighted global linear maps (S-Map) projection, Multivariate embedding in Simplex or S-Map, Convergent cross mapping (CCM), and Multiview Embeding, described below. Nearest neighbors are found according to: NN ( y , X , k ) = ‖ X N i E − y ‖ ≤ ‖ X N j E − y ‖ if 1 ≤ i ≤ j ≤ k {\displaystyle {\text{NN}}(y,X,k)=\|X_{N_{i}}^{E}-y\|\leq \|X_{N_{j}}^{E}-y\|{\text{ if }}1\leq i\leq j\leq k} === Simplex === Simplex projection is a nearest neighbor projection. It locates the k {\displaystyle k} nearest neighbors to the location in the state-space from which a prediction is desired. To minimize the number of free parameters k {\displaystyle k} is typically set to E + 1 {\displaystyle E+1} defining an E + 1 {\displaystyle E+1} dimensional simplex in the state-space. The prediction is computed as the average of the weighted phase-space simplex projected T p {\displaystyle Tp} points ahead. Each neighbor is weighted proportional to their distance to the projection origin vector in the state-space. Find k {\displaystyle k} nearest neighbor: N k ← NN ( y , X , k ) {\displaystyle N_{k}\gets {\text{NN}}(y,X,k)} Define the distance scale: d ← ‖ X N 1 E − y ‖ {\displaystyle d\gets \|X_{N_{1}}^{E}-y\|} Compute weights: For{ i = 1 , … , k {\displaystyle i=1,\dots ,k} } : w i ← exp ⁡ ( − ‖ X N i E − y ‖ / d ) {\displaystyle w_{i}\gets \exp(-\|X_{N_{i}}^{E}-y\|/d)} Average of state-space simplex: y ^ ← ∑ i = 1 k ( w i X N i + T p ) / ∑ i = 1 k w i {\displaystyle {\hat {y}}\gets \sum _{i=1}^{k}\left(w_{i}X_{N_{i}+T_{p}}\right)/\sum _{i=1}^{k}w_{i}} === S-Map === S-Map extends the state-space prediction in Simplex from an average of the E + 1 {\displaystyle E+1} nearest neighbors to a linear regression fit to all neighbors, but localised with an exponential decay kernel. The exponential localisation function is F ( θ ) = exp ( − θ d / D ) {\displaystyle F(\theta )={\text{exp}}(-\theta d/D)} , where d {\displaystyle d} is the neighbor distance and D {\displaystyle D} the mean distance. In this way, depending on the value of θ {\displaystyle \theta } , neighbors close to the prediction origin point have a higher weight than those further from it, such that a local linear approximation to the nonlinear system is reasonable. This localisation ability allows one to identify an optimal local scale, in-effect quantifying the degree of state dependence, and hence nonlinearity of the system. Another feature of S-Map is that for a properly fit model, the regression coefficients between variables have been shown to approximate the gradient (directional derivative) of variables along the manifold. These Jacobians represent the time-varying interaction strengths between system variables. Find k {\displaystyle k} nearest neighbor: N ← NN ( y , X , k ) {\displaystyle N\gets {\text{NN}}(y,X,k)} Sum of distances: D ← 1 k ∑ i = 1 k ‖ X N i E − y ‖ {\displaystyle D\gets {\frac {1}{k}}\sum _{i=1}^{k}\|X_{N_{i}}^{E}-y\|} Compute weights: For{ i = 1 , … , k {\displaystyle i=1,\dots ,k} } : w i ← exp ⁡ ( − θ ‖ X N i E − y ‖ / D ) {\displaystyle w_{i}\gets \exp(-\theta \|X_{N_{i}}^{E}-y\|/D)} Reweighting matrix: W ← diag ( w i ) {\displaystyle W\gets {\text{diag}}(w_{i})} Design matrix: A ← [ 1 X N 1 X N 1 − 1 … X N 1 − E + 1 1 X N 2 X N 2 − 1 … X N 2 − E + 1 ⋮ ⋮ ⋮ ⋱ ⋮ 1 X N k X N k − 1 … X N k − E + 1 ] {\displaystyle A\gets {\begin{bmatrix}1&X_{N_{1}}&X_{N_{1}-1}&\dots &X_{N_{1}-E+1}\\1&X_{N_{2}}&X_{N_{2}-1}&\dots &X_{N_{2}-E+1}\\\vdots &\vdots &\vdots &\ddots &\vdots \\1&X_{N_{k}}&X_{N_{k}-1}&\dots &X_{N_{k}-E+1}\end{bmatrix}}} Weighted design matrix: A ← W A {\displaystyle A\gets WA} Response vector at T p {\displaystyle Tp} : b ← [ X N 1 + T p X N 2 + T p ⋮ X N k + T p ] {\displaystyle b\gets {\begin{bmatrix}X_{N_{1}+T_{p}}\\X_{N_{2}+T_{p}}\\\vdots \\X_{N_{k}+T_{p}}\end{bmatrix}}} Weighted response vector: b ← W b {\displaystyle b\gets Wb} Least squares solution (SVD): c ^ ← argmin c ‖ A c − b ‖ 2 2 {\displaystyle {\hat {c}}\gets {\text{argmin}}_{c}\|Ac-b\|_{2}^{2}} Local linear model c ^ {\displaystyle {\hat {c}}} is prediction: y ^ ← c ^ 0 + ∑ i = 1 E c ^ i y i {\displaystyle {\hat {y}}\gets {\hat {c}}_{0}+\sum _{i=1}^{E}{\hat {c}}_{i}y_{i}} === Multivariate Embedding === Multivariate Embedding recognizes that time-delay embeddings are not the only valid state-space construction. In Simplex and S-Map one can generate a state-space from observational vectors, or time-delay embeddings of a single observational time series, or both. === Convergent Cross Mapping === Convergent cross mapping (CCM) leverages a corollary to the Generalized Takens Theorem that it should be possible to cross predict or cross map between variables observed from the same system. Suppose that in some dynamical system involving variables X {\displaystyle X} and Y {\displaystyle Y} , X {\displaystyle X} causes Y {\displaystyle Y} . Since X {\displaystyle X} and Y {\displaystyle Y} belong to the same dynamical system, their reconstructions (via embeddings) M x {\displaystyle M_{x}} , and M y {\displaystyle M_{y}} , also map to the same system. The causal variable X {\displaystyle X} leaves a signature on the affected variable Y {\displaystyle Y} , and consequently, the reconstructed states based on Y {\displaystyle Y} can be used to cross predict values of X {\displaystyle X} . CCM leverages this property to infer causality by predicting X {\displaystyle X} using the M y {\displaystyle M_{y}} library of points (or vice versa for the other direction of causality), while assessing improvements in cross map predictability as larger and larger random samplings of M y {\displaystyle M_{y}} are used. If the prediction skill of X {\displaystyle X} increases and saturates as the entire M y {\displaystyle M_{y}} is used, this provides evidence that X {\displaystyle X} is casually influencing Y {\displaystyle Y} . === Multiview Embedding === Multiview Embedding is a Dimensionality reduction technique where a large number of state-space time series vectors are combitorially assessed towards maximal model predictability. == Extensions == Extensions to EDM techniques include: Generalized Theorems for Nonlinear State Space Reconstruction Extended Convergent Cross Mapping Dynamic stability S-Map regularization Visual analytics with EDM Convergent Cross Sorting Expert system with EDM hybrid Sliding windows based on the extended convergent cross-mapping Empirical Mode Modeling Accounting for missing data and variable step sizes Accounting for observation noise Hierarchical Bayesian EDM via Gaussian processes Intelligent and Adaptive Control Optimal control via Empirical dynamic programming Multiview distance regularised S-map

    Read more →
  • Digital content

    Digital content

    Digital content is any content that exists in the form of digital data. Digital content is stored on digital media or analog storage in specific formats. Forms of digital content include information that is digitally broadcast, streamed, or contained in computer files. Viewed narrowly, digital content includes popular media types, while a broader approach considers any type of digital information (e. g. digitally updated weather forecasts, GPS maps, and so on) as digital content. Digital content has increased as more households have accessed the Internet. Expanded access has made it easier for people to receive their news and watch TV online, challenging the popularity of traditional platforms. Increased access to the Internet has also led to the mass publication of digital content through individuals in the form of eBooks, blog posts, and even Facebook posts. == History == At the beginning of the Digital Revolution, computers facilitated the discovery, retrieval, and creation of new information in every field of human knowledge. As information became increasingly more accessible, the Digital Revolution also facilitated the creation of digital content. Despite an evolution to digital technology, which occurred somewhere between the late 1970s, distribution of digital content did not begin until the late 1990s with the rise in popularity of the Internet. In the past, digital content was primarily distributed through computers and the Internet. Methods of distribution are rapidly changing as the Digital Revolution brings new channels, such as mobile apps and eBooks. These new technologies will create challenges for content creators, as they determine the best channel to bring content to their consumers. Despite the benefits, new technologies have created new intellectual property issues. Users can easily share, modify, and redistribute content outside of the creator's control. While new technologies have made digital content available to large audiences, managing copyright and limiting content movement will continue to be an issue that digital content creators face in the future. == Types of digital content == Examples include: Video – Types of video content include home videos, music videos, TV shows, and movies. Many of these can be viewed on websites such as YouTube, Hulu, Paramount+, Disney+, HBO Max, and so on, in which people and companies alike can post content. However, many movies and television shows are not available for free legally, but rather can be purchased from sites such as iTunes and Amazon. Audio – Music is the most common form of audio. Spotify has emerged as a popular way for people to listen to music either over the Internet or from their computer desktop. Digital content in the form of music is also available through Pandora and last.fm, both of which allow listeners to listen to music online for no charge. Images – Photo and image sharing is another example of digital content. Popular sites used for this type of digital content includes Imgur, where people share self-created pictures, Flickr, where people share their photo albums, and DeviantArt, where people share their artwork. Popular apps that are used for images include Instagram and Snapchat. Visual Stories - Stories are a new type of digital content that got introduced by Snapchat. Since then, stories as a format has been introduced in a couple of other platforms such as Facebook and Linkedin. In 2018, Google introduced their AMP Stories, which provides content publishers with a mobile-focused format for delivering news and information as visually rich, tap-through stories. Text - Type of digital content which is available in text or written format. Blog websites which store data in form of textual format. === Paid digital content === In order to have access to more premium digital goods, consumers usually have to pay an upfront charge for digital content, or a subscription based fee. Video – Many licensed videos, such as movies and television shows, require money in order to be viewed or downloaded. Popular services used by many include streaming giant Netflix and Amazon's streaming service, as well as recent notice put forth by the online video platform YouTube. Audio – While songs can be streamed for free, generally in order to download most licensed music, consumers need to purchase songs from web stores, such as the popular iTunes. However, Spotify Premium is emerging as a new model for purchasing digital content on the web: consumers pay a monthly fee to unlimited streaming and downloading from Spotify's music library. According to a report done by IHS Inc. in 2013, the global consumer spending on digital content grew to over $57 billion in 2013, which was up almost 30% from $44 billion in 2012. In past years, the US has always been a leader in consumer expenditure on digital content, but as of 2013, many countries have emerged with great consumer expenditure. South Korea's overall digital spend per capita is now greater than the US. ==== Consolidation ==== According to research firm Ampere Analysis, in 2024, a small group of six media conglomerates; Disney, Comcast, Google, Warner Bros. Discovery, Netflix, and Paramount Global—are poised to dominate the global content market. These companies are projected to account for 51% of all global spending on content, a significant increase from 47% in 2020. Disney, in particular, is a major player, with an estimated $35.8 billion investment in television and film content, representing 14% of global spending. This significant increase, fueled by Disney's full ownership of Hulu, highlights the company's strategic focus on streaming services. A substantial portion of the projected $126 billion global content spending is allocated to streaming platforms. === Non-purchasable digital content === Not all digital content is purchasable, and is simply anything published digitally. This would include: News – in recent years newspapers have attempted to expand their readership by creating access to their newspapers digitally. As of 2012, 39% of readers learned about news from online formats, making news a prevalent form of digital content. Advertisements – as media consumers increasingly use digital formats to watch TV, check the weather, and search for content, advertisements have shifted to digital forms to keep up with their viewership. Advertisements are now being made digitally and placed on sites ranging from Facebook to YouTube. Question and Answer sites – these sites are a type of Internet forum where people can post questions they want answered, or provide responses to previous inquiries. With millions of questions posted each day, anyone has the ability to create content on these sites, so the information provided may not be 100% reliable or accurate. Popular sites include Yahoo! Answers, WikiAnswers and Quora. Web mapping – sites such as MapQuest and Google Maps provide users with map content. These sites give people the ability to quickly look up the location of a landmark and create routes to a destination. Online maps are a form of free content provided by companies such as Google and AOL, serving as much more efficient alternatives to the traditional Thomas Guide. == Business implications == === Digital companies === Digital content businesses can include news, information, and entertainment distributed over the Internet and consumed digitally by both consumers and businesses. Based on revenue, the leading digital businesses are ranked Google, China Mobile, Bloomberg, Reed Elsevier, and Apple. The 50 companies with the highest revenue are split between those offering free and paid digital content, but these top 50 companies combined generate revenue of $150 billion. === Educational opportunities === Programs such as CUNY's Macaulay Honors College in their New Media Lab, run by industry professional Robert Small, is set up to train and introduce students to the various disciplines within the digital content industry. The goal is to offer information and access to professional work opportunities. They also explore within an incubator how to create businesses and start ups within the world of digital content. There are many educational events in support of choosing digital content as a career. === Government support === The Irish government adopted a "Strategy for the Digital Content Industry in Ireland" in 2002.

    Read more →
  • Institute of Telecommunications Professionals

    Institute of Telecommunications Professionals

    The Institute of Telecommunications Professionals (ITP) is a membership organisation for professionals in the telecommunications industry, based in the United Kingdom. The Institute was originally founded in 1906. It is now a registered company with Companies House in the United Kingdom, incorporated in 2002. Brendan O' Mahony has been the chief executive of the ITP. Lucy Woods presided over ITP for fifteen years, until 2018, when the organization named Kevin Paige chairman for five years. In 2022 the ITP appointed its new CEO, Charlotte Goodwill. In 2021, the ITP assisted a UK fibre network Vorboss in establishing its training academy. In 2023, the ITP appointed Tim Creswick, the CEO of Vorboss, as the new chair of its board of directors. The institute has an associated journal, the Journal of the Institute of Telecommunications Professionals, established in 2007 and published quarterly.

    Read more →
  • Randomized benchmarking

    Randomized benchmarking

    Randomized benchmarking is an experimental method for measuring the average error rates of quantum computing hardware platforms. The protocol estimates the average error rates by implementing long sequences of randomly sampled quantum gate operations. Randomized benchmarking is the industry-standard protocol used by quantum hardware developers such as IBM and Google to test the performance of the quantum operations. The original theory of randomized benchmarking, proposed by Joseph Emerson and collaborators, considered the implementation of sequences of Haar-random operations, but this had several practical limitations. The now-standard protocol for randomized benchmarking (RB) relies on uniformly random Clifford operations, as proposed in 2006 by Dankert et al. as an application of the theory of unitary t-designs. In current usage randomized benchmarking sometimes refers to the broader family of generalizations of the 2005 protocol involving different random gate sets that can identify various features of the strength and type of errors affecting the elementary quantum gate operations. Randomized benchmarking protocols are an important means of verifying and validating quantum operations and are also routinely used for the optimization of quantum control procedures. == Overview == Randomized benchmarking offers several key advantages over alternative approaches to error characterization. For example, the number of experimental procedures required for full characterization of errors (called tomography) grows exponentially with the number of quantum bits (called qubits). This makes tomographic methods impractical for even small systems of just 3 or 4 qubits. In contrast, randomized benchmarking protocols are the only known approaches to error characterization that scale efficiently as number of qubits in the system increases. Thus RB can be applied in practice to characterize errors in arbitrarily large quantum processors. Additionally, in experimental quantum computing, procedures for state preparation and measurement (SPAM) are also error-prone, and thus quantum process tomography is unable to distinguish errors associated with gate operations from errors associated with SPAM. In contrast, RB protocols are robust to state-preparation and measurement errors Randomized benchmarking protocols estimate key features of the errors that affect a set of quantum operations by examining how the observed fidelity of the final quantum state decreases as the length of the random sequence increases. If the set of operations satisfies certain mathematical properties, such as comprising a sequence of twirls with unitary two-designs, then the measured decay can be shown to be an invariant exponential with a rate fixed uniquely by features of the error model. == History == Randomized benchmarking was proposed in Scalable noise estimation with random unitary operators, where it was shown that long sequences of quantum gates sampled uniformly at random from the Haar measure on the group SU(d) would lead to an exponential decay at a rate that was uniquely fixed by the error model. Emerson, Alicki and Zyczkowski also showed, under the assumption of gate-independent errors, that the measured decay rate is directly related to an important figure of merit, the average gate fidelity and independent of the choice of initial state and any errors in the initial state, as well as the specific random sequences of quantum gates. This protocol applied for arbitrary dimension d and an arbitrary number n of qubits, where d=2n. The SU(d) RB protocol had two important limitations that were overcome in a modified protocol proposed by Dankert et al., who proposed sampling the gate operations uniformly at random from any unitary two-design, such as the Clifford group. They proved that this would produce the same exponential decay rate as the random SU(d) version of the protocol proposed in Emerson et al.. This follows from the observation that a random sequence of gates is equivalent to an independent sequence of twirls under that group, as conjectured in and later proven in. This Clifford-group approach to Randomized Benchmarking is the now standard method for assessing error rates in quantum computers. A variation of this protocol was proposed by NIST in 2008 for the first experimental implementation of an RB-type for single qubit gates. However, the sampling of random gates in the NIST protocol was later proven not to reproduce any unitary two-design. The NIST RB protocol was later shown to also produce an exponential fidelity decay, albeit with a rate that depends on non-invariant features of the error model In recent years a rigorous theoretical framework has been developed for Clifford-group RB protocols to show that they work reliably under very broad experimental conditions. In 2011 and 2012, Magesan et al. proved that the exponential decay rate is fully robust to arbitrary state preparation and measurement errors (SPAM). They also proved a connection between the average gate fidelity and diamond norm metric of error that is relevant to the fault-tolerant threshold. They also provided evidence that the observed decay was exponential and related to the average gate fidelity even if the error model varied across the gate operations, so-called gate-dependent errors, which is the experimentally realistic situation. In 2018, Wallman and Dugas et al., showed that, despite concerns raised in, even under very strong gate-dependence errors the standard RB protocols produces an exponential decay at a rate that precisely measures the average gate-fidelity of the experimentally relevant errors. The results of Wallman. in particular proved that the RB error rate is so robust to gate-dependent errors models that it provides an extremely sensitive tool for detecting non-Markovian errors. This follows because under a standard RB experiment only non-Markovian errors (including time-dependent Markovian errors) can produce a statistically significant deviation from an exponential decay The standard RB protocol was first implemented for single qubit gate operations in 2012 at Yale on a superconducting qubit. A variation of this standard protocol that is only defined for single qubit operations was implemented by NIST in 2008 on a trapped ion. The first implementation of the standard RB protocol for two-qubit gates was performed in 2012 at NIST for a system of two trapped ions

    Read more →
  • Magiran

    Magiran

    Magiran (Persian: مگیران)—Iran's publications database—is a digital library that was founded in 2000 and includes digitized versions of scientific journals, which currently provides the possibility of searching among the full text of 1,500 journals. Registration is required for full access to the database, but access to some items such as newspapers is also possible without registration. A list of Iranian researchers is also maintained there.

    Read more →
  • Affordable affluence

    Affordable affluence

    Affordable affluence refers to a cultural phenomenon where consumers use accessible luxury goods and lifestyles to project status and align themselves with a higher social class, without requiring substantial wealth. This concept is embodied by brands such as Aritzia and Erewhon, which position themselves as offering high-end, trendy, or health-conscious products that are relatively accessible to the average consumer. A related concept is quiet luxury, where the ultra-wealthy signal wealth through subtle means. Quiet luxury emphasizes the widening gap between the ultra-wealthy and the general public, whereas accessible affluence provides a way for the general public to indulge in the lifestyle of the ultra-wealthy. == Origin of the term == An early use of the phrase in this context in a 2023 article in The Cut called "Meet the People Working 3 Jobs to Afford Erewhon." One of the interviewees used Erewhon as an archetype of affordable affluence. It was described as “a way for regular people to position themselves adjacent to the upper class.” == Background and description == The phenomenon arises due to an individual's desire to showcase status. For years, companies have strategized how to target the average consumers by providing a product that signals an elevated social status. For instance, Aritzia partnered with celebrities and micro-influencers to make it an aspirational brand at an affordable cost. Erewhon similarly has allowed middle class consumers to subtly signal a higher degree of perceived wealth by purchasing higher priced, but still attainable items. It has allowed middle-class individuals to feel as though they are part of an exclusive culture. This phenomenon has been seen particularly with Gen Z and Millennials in the setting of financial hardships in the 2020s. Affordable affluence is an example of the lipstick effect. Because traditional status symbols such as expensive cars became relatively more unattainable, posting clips on social media that showcase affordable affluence become an alternative status symbol. Particularly with food, the perception has evolved from a necessity to a luxury. A McKinsey & Company report demonstrated that these generations place a higher importance on groceries than restaurants, travel, and beauty/fashion.

    Read more →
  • Blue check

    Blue check

    A blue check is used on social media platforms, notably X (formerly known as Twitter), to indicate the authenticity of an account. Since November 2022, Twitter users whose accounts are at least 90 days old and have a verified phone number receive verification upon subscribing to X Premium or Verified Organizations; this status persists as long as the subscription remains active. When introduced in June 2009, the system provided the site's readers with a means to distinguish genuine notable account holders, such as celebrities and organizations, from impostors or parodies. Until November 2022, a blue checkmark displayed against an account name indicated that Twitter had taken steps to ensure that the account was actually owned by the person or organization whom it claimed to represent. The checkmark does not imply endorsement from Twitter, and does not mean that tweets from a verified account are necessarily accurate or truthful in any way. People with verified accounts on Twitter are often colloquially referred to as "blue checks" on social media and by reporters. In November 2022, the verification program was modified heavily by new owner Elon Musk, extending verification to any account with a verified phone number and an active subscription to an eligible X Premium (formerly Twitter Blue) plan. These changes faced criticism from users and the media, who believed that the changes would ease impersonation, and allow accounts spreading misleading information to feign credibility. In a related change, Twitter introduced additional gold and gray checkmarks, used by Verified Organizations and government-affiliated accounts, respectively. Twitter claims that the changes to verification are required to "reduce fraudulent accounts and bots". Twitter users who had been verified through the previous system were known as "legacy verified" accounts; legacy verification was deprecated in April 2023, and stripped from accounts who do not meet the new payment requirements. Musk later implied that he had been personally paying for the X Premium subscriptions of several notable celebrities. == Until November 2022 == In June 2009, after being criticized by Kanye West and sued by Tony La Russa over unauthorized accounts run by impersonators, the company launched their "Verified Accounts" program. Twitter stated that an account with a "blue tick" verification badge indicates "we've been in contact with the person or entity the account is representing and verified that it is approved". After the beta period, the company stated in their FAQ that it "proactively verifies accounts on an ongoing basis to make it easier for users to find who they're looking for" and that they "do not accept requests for verification from the general public". Originally, Twitter took on the responsibility of reaching out to celebrities and other notable people to confirm their identities in order to establish a verified account. In July 2016, Twitter announced a public application process to grant verified status to an account "if it is determined to be of public interest" and that verification "does not imply an endorsement". In 2016, the company began accepting requests for verification, but it was discontinued the same year. Twitter explained that the volume of requests for verified accounts had exceeded its ability to cope; rather, Twitter determines on its own whom to approach about verified accounts, limiting verification to accounts which are "authentic, notable, and active". In November 2020, Twitter announced a relaunch of its verification system in 2021. According to the new policy, Twitter verifies six different types of accounts; for three of them (companies, brands, and influential individuals like activists), the existence of a Wikipedia page will be one criterion for showing that the account has "Off Twitter Notability". === Controversy === On June 21, 2014, actor William Shatner raised an issue with several Engadget editorial staff and their verification status on Twitter. Besides the site's social media editor, John Colucci, Shatner also targeted several junior members of the staff for being "nobodies", unlike some of his actor colleagues who did not bear such distinction. Shatner claimed Colucci and the team were bullying him when giving a text interview to Mashable. Over a month later, Shatner continued to discuss the issue on his Tumblr page, to which Engadget replied by defending its team and discussing the controversy surrounding the social media verification. Twitter's practice and process for verifying accounts came under scrutiny again in 2017 after the company verified the account of white supremacist and far-right political activist, Jason Kessler. Many who criticized Twitter's decision to verify Kessler's account saw this as a political act on the company's behalf. In response, Twitter put its verification process on hold. The company tweeted, "Verification was meant to authenticate identity & voice but it is interpreted as an endorsement or an indicator of importance. We recognize that we have created this confusion and need to resolve it. We have paused all general verifications while we work and will report back soon." As of November 2017, Twitter continued to deny verification of Julian Assange's account following his requests. In November 2019, Dalit activists of India alleged that higher-caste people get Twitter verification easily and trended hashtags #CancelAllBlueTicksInIndia and #CasteistTwitter. Critics have said that the company's verification process is not transparent and causes digital marginalisation of already marginalised communities. Twitter India rejected the allegations, calling them "impartial" and working on a "case-by-case" policy. == Since November 2022 == On April 20, 2023, Twitter (known as X since July 2023) began removing verification status for users of public interest, causing a controversy among Twitter users. The website's system was altered, allowing any individual to receive verification for a monthly fee, an act which saw significant criticism. Following the acquisition of Twitter by Elon Musk on October 28, 2022, Musk told Twitter employees to introduce paid verification by November 7 through Twitter Blue. The Verge reported that the updated Blue subscription would cost $19.99 per month, and users would lose their verification status if they did not join within 90 days. Following backlash, Musk tweeted, in response to author Stephen King, a lowered $8 price on November 1, 2022. Twitter confirmed the new price of $7.99 per month on November 5, 2022. The new verification system began rollout on November 9, 2022, a day after the 2022 United States elections. The decision to delay its rollout was to address concerns about users potentially spreading misinformation about voting results by posing as news outlets and lawmakers. At the same time, Twitter introduced a secondary gray "Official" label on some high-profile accounts, but removed them hours after launch. Less than 48 hours later, Twitter reinstated the gray "Official" label, after multiple users were suspended for deliberately impersonating reporters and high-profile athletes like LeBron James. A viral tweet from an account purporting to be the pharmaceutical company Eli Lilly and Company caused the company's stock to fall after announcing "insulin is free now". As a result, Twitter disabled new Blue subscriptions on November 11, 2022. === Announcement === In October 2022, Casey Newton of Platformer reported that executives at Twitter began discussing the possibility of users being forced to pay for Twitter Blue in order to keep their verification status. Musk publicly announced that verification was "being revamped right now" after Newton's article; according to The Verge, Twitter planned to increase the price of Twitter Blue from US$4.99 per month to US$19.99 per month. Users would have had 90 days to subscribe or face losing their verification status, and employees were told to implement paid verification by November 9 or risk getting fired. Upon the news that Twitter Blue would cost US$19.99 per month, author Stephen King expressed displeasure towards Twitter and stated that he would leave. Musk, replying to King's tweet, proposed that the service should cost US$7.99 instead. In a separate tweet, Musk wrote that Twitter Blue subscribers would receive priority in replies, mentions, and search, fewer advertisements, and longer audio and video. Although paid verification was expected to be launched by November 7, the reintroduction of Twitter Blue was delayed until after the 2022 United States elections on November 9, according to a memo obtained by The New York Times. The announcement of paid verification resulted in several accounts facetiously impersonating Musk, such as those of comedians Kathy Griffin and Sarah Silverman, being suspended. In response, Musk announced that impersonators using Twitter Blue "will be permanently suspended". An "official

    Read more →